diff --git "a/languages/java/test_in_distribution.jsonl" "b/languages/java/test_in_distribution.jsonl" new file mode 100644--- /dev/null +++ "b/languages/java/test_in_distribution.jsonl" @@ -0,0 +1,1000 @@ +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s067862496", "group_id": "codeNet:p00002", "input_text": "import java.io.*;\nimport java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args) throws IOException{\n\t\tBufferedReader r = new BufferedReader(new InputStreamReader(System.in));\n\t\tString s = r.readLine();\n\t\tStringTokenizer st = new StringTokenizer(s,\" \");\n\t\tint a,b;\n\t\twhile(true){\n\t\t\ttry {\n\t\t\t\ta = Integer.parseInt(st.nextToken().toString());\n\t\t\t\tb = Integer.parseInt(st.nextToken().toString());\n\t\t\t\ta+=b;\n\t\t\t\tfor(b=0;a!=0;a=a/10) {\n\t\t\t\t\tb++;\n\t\t\t\t}\n\t\t\t\tSystem.out.println(b);\n\t\t\t\ts = r.readLine();\n\t\t\t\tif (s==null) break;\n\t\t\t\tst = new StringTokenizer(s,\" \");\n\t\t\t} catch (NoSuchElementException e) {\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1322832330, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00002.html", "problem_id": "p00002", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00002/input.txt", "sample_output_relpath": "derived/input_output/data/p00002/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00002/Java/s067862496.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s067862496", "user_id": "u840509558"}, "prompt_components": {"gold_output": "2\n3\n4\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args) throws IOException{\n\t\tBufferedReader r = new BufferedReader(new InputStreamReader(System.in));\n\t\tString s = r.readLine();\n\t\tStringTokenizer st = new StringTokenizer(s,\" \");\n\t\tint a,b;\n\t\twhile(true){\n\t\t\ttry {\n\t\t\t\ta = Integer.parseInt(st.nextToken().toString());\n\t\t\t\tb = Integer.parseInt(st.nextToken().toString());\n\t\t\t\ta+=b;\n\t\t\t\tfor(b=0;a!=0;a=a/10) {\n\t\t\t\t\tb++;\n\t\t\t\t}\n\t\t\t\tSystem.out.println(b);\n\t\t\t\ts = r.readLine();\n\t\t\t\tif (s==null) break;\n\t\t\t\tst = new StringTokenizer(s,\" \");\n\t\t\t} catch (NoSuchElementException e) {\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "Digit Number\n\nWrite a program which computes the digit number of sum of two integers a and b.\n\nInput\n\nThere are several test cases. Each test case consists of two non-negative integers a and b which are separeted by a space in a line. The input terminates with EOF.\n\nConstraints\n\n0 ≤ a, b ≤ 1,000,000\n\nThe number of datasets ≤ 200\n\nOutput\n\nPrint the number of digits of a + b for each data set.\n\nSample Input\n\n5 7\n1 99\n1000 999\n\nOutput for the Sample Input\n\n2\n3\n4", "sample_input": "5 7\n1 99\n1000 999\n"}, "reference_outputs": ["2\n3\n4\n"], "source_document_id": "p00002", "source_text": "Digit Number\n\nWrite a program which computes the digit number of sum of two integers a and b.\n\nInput\n\nThere are several test cases. Each test case consists of two non-negative integers a and b which are separeted by a space in a line. The input terminates with EOF.\n\nConstraints\n\n0 ≤ a, b ≤ 1,000,000\n\nThe number of datasets ≤ 200\n\nOutput\n\nPrint the number of digits of a + b for each data set.\n\nSample Input\n\n5 7\n1 99\n1000 999\n\nOutput for the Sample Input\n\n2\n3\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 641, "cpu_time_ms": 60, "memory_kb": 10000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s970170099", "group_id": "codeNet:p00003", "input_text": "import java.io.*;\npublic class Main{\n\n public static int[] sort(String s[]){\n int[] sides = new int[s.length];\n for(int i = 0;i < s.length; i++){\n sides[i] = Integer.parseInt(s[i]);\n }\n for(int j = 1;j < sides.length; j++){\n if(sides[0] < sides[j]){\n int n = sides[0];\n sides[0] = sides[j];\n sides[j] = n;\n }\n }\n return sides;\n }\n public static void main(String[] args)throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String str = br.readLine();\n int num = Integer.parseInt(str);\n while(num <= 0 || num > 1000){\n str = br.readLine();\n num = Integer.parseInt(str);\n }\n String str1;\n String side[][];\n side = new String[num][];\n int sides[][];\n sides = new int[num][];\n int a = 0;\n while(a != num){\n str1 = br.readLine();\n side[a] = str1.split(\" \", 3);\n sides[a] = sort(side[a]);\n a++;\n }\n for(int k = 0;k < num;k++){\n if(sides[k][0]*sides[k][0] == sides[k][2]*sides[k][2] +sides[k][1]*sides[k][1]){\n System.out.println(\"YES\");\n }else{\n System.out.println(\"NO\");\n }\n }\n }\n}", "language": "Java", "metadata": {"date": 1491835708, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00003.html", "problem_id": "p00003", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00003/input.txt", "sample_output_relpath": "derived/input_output/data/p00003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00003/Java/s970170099.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970170099", "user_id": "u522101291"}, "prompt_components": {"gold_output": "YES\nNO\nNO\n", "input_to_evaluate": "import java.io.*;\npublic class Main{\n\n public static int[] sort(String s[]){\n int[] sides = new int[s.length];\n for(int i = 0;i < s.length; i++){\n sides[i] = Integer.parseInt(s[i]);\n }\n for(int j = 1;j < sides.length; j++){\n if(sides[0] < sides[j]){\n int n = sides[0];\n sides[0] = sides[j];\n sides[j] = n;\n }\n }\n return sides;\n }\n public static void main(String[] args)throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String str = br.readLine();\n int num = Integer.parseInt(str);\n while(num <= 0 || num > 1000){\n str = br.readLine();\n num = Integer.parseInt(str);\n }\n String str1;\n String side[][];\n side = new String[num][];\n int sides[][];\n sides = new int[num][];\n int a = 0;\n while(a != num){\n str1 = br.readLine();\n side[a] = str1.split(\" \", 3);\n sides[a] = sort(side[a]);\n a++;\n }\n for(int k = 0;k < num;k++){\n if(sides[k][0]*sides[k][0] == sides[k][2]*sides[k][2] +sides[k][1]*sides[k][1]){\n System.out.println(\"YES\");\n }else{\n System.out.println(\"NO\");\n }\n }\n }\n}", "problem_context": "Is it a Right Triangle?\n\nWrite a program which judges wheather given length of three side form a right triangle. Print \"YES\" if the given sides (integers) form a right triangle, \"NO\" if not so.\n\nInput\n\nInput consists of several data sets. In the first line, the number of data set, N is given. Then, N lines follow, each line corresponds to a data set. A data set consists of three integers separated by a single space.\n\nConstraints\n\n1 ≤ length of the side ≤ 1,000\n\nN ≤ 1,000\n\nOutput\n\nFor each data set, print \"YES\" or \"NO\".\n\nSample Input\n\n3\n4 3 5\n4 3 6\n8 8 8\n\nOutput for the Sample Input\n\nYES\nNO\nNO", "sample_input": "3\n4 3 5\n4 3 6\n8 8 8\n"}, "reference_outputs": ["YES\nNO\nNO\n"], "source_document_id": "p00003", "source_text": "Is it a Right Triangle?\n\nWrite a program which judges wheather given length of three side form a right triangle. Print \"YES\" if the given sides (integers) form a right triangle, \"NO\" if not so.\n\nInput\n\nInput consists of several data sets. In the first line, the number of data set, N is given. Then, N lines follow, each line corresponds to a data set. A data set consists of three integers separated by a single space.\n\nConstraints\n\n1 ≤ length of the side ≤ 1,000\n\nN ≤ 1,000\n\nOutput\n\nFor each data set, print \"YES\" or \"NO\".\n\nSample Input\n\n3\n4 3 5\n4 3 6\n8 8 8\n\nOutput for the Sample Input\n\nYES\nNO\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1385, "cpu_time_ms": 80, "memory_kb": 26612}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s408033744", "group_id": "codeNet:p00005", "input_text": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n\t Scanner sc =new Scanner(System.in);\nint a,b;\nwhile(sc.hasNext()){\nint n1=sc.nextInt();\nint n2=sc.nextInt();\na=Math.max(n1,n2);\nb=Math.min(n1,n2);\nfor(;;){\na =a%b;\nif(a==0)break;\nint temp=b;\nb=a;\na=temp;\n}\nSystem.out.println(b+\" \"+(long)n1*n2/b);\n }\n }\n}", "language": "Java", "metadata": {"date": 1410539209, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00005.html", "problem_id": "p00005", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00005/input.txt", "sample_output_relpath": "derived/input_output/data/p00005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00005/Java/s408033744.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s408033744", "user_id": "u910780605"}, "prompt_components": {"gold_output": "2 24\n10000000 150000000\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n\t Scanner sc =new Scanner(System.in);\nint a,b;\nwhile(sc.hasNext()){\nint n1=sc.nextInt();\nint n2=sc.nextInt();\na=Math.max(n1,n2);\nb=Math.min(n1,n2);\nfor(;;){\na =a%b;\nif(a==0)break;\nint temp=b;\nb=a;\na=temp;\n}\nSystem.out.println(b+\" \"+(long)n1*n2/b);\n }\n }\n}", "problem_context": "GCD and LCM\n\nWrite a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.\n\nInput\n\nInput consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.\n\nConstraints\n\n0 < a, b ≤ 2,000,000,000\n\nLCM(a, b) ≤ 2,000,000,000\n\nThe number of data sets ≤ 50\n\nOutput\n\nFor each data set, print GCD and LCM separated by a single space in a line.\n\nSample Input\n\n8 6\n50000000 30000000\n\nOutput for the Sample Input\n\n2 24\n10000000 150000000", "sample_input": "8 6\n50000000 30000000\n"}, "reference_outputs": ["2 24\n10000000 150000000\n"], "source_document_id": "p00005", "source_text": "GCD and LCM\n\nWrite a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.\n\nInput\n\nInput consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.\n\nConstraints\n\n0 < a, b ≤ 2,000,000,000\n\nLCM(a, b) ≤ 2,000,000,000\n\nThe number of data sets ≤ 50\n\nOutput\n\nFor each data set, print GCD and LCM separated by a single space in a line.\n\nSample Input\n\n8 6\n50000000 30000000\n\nOutput for the Sample Input\n\n2 24\n10000000 150000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 344, "cpu_time_ms": 50, "memory_kb": 17216}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s778227441", "group_id": "codeNet:p00005", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main\n{\n public static void main(String[] args) throws NumberFormatException, IOException\n {\n BufferedReader input = new BufferedReader(new InputStreamReader(System.in));\n\n while (input.ready())\n {\n String[] dataStr = input.readLine().split(\" \");\n int[] dataInt = new int[dataStr.length];\n for (int i = 0; i < dataStr.length; i++)\n {\n dataInt[i] = Integer.valueOf(dataStr[i]);\n }\n System.out.println(getGCD(dataInt[0], dataInt[1]) + \" \" + getLCM(dataInt[0], dataInt[1]));\n }\n }\n\n public static int getGCD(int num1, int num2)\n {\n if (num1 == num2)\n return num1;\n\n int a = Math.max(num1, num2);\n int b = Math.min(num1, num2);\n int c = 1;\n\n while (true)\n {\n c = a % b;\n if(c == 0) {\n break;\n }\n a = b;\n b = c;\n }\n return b;\n }\n\n public static int getLCM(int a, int b)\n {\n int productA = a;\n int productB = b;\n while (productA <= 2000000000)\n {\n if (productA == productB)\n {\n return productA;\n }\n if (productA < productB)\n {\n productA += a;\n }\n else\n {\n productB += b;\n }\n }\n return 0;\n }\n}", "language": "Java", "metadata": {"date": 1508802512, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00005.html", "problem_id": "p00005", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00005/input.txt", "sample_output_relpath": "derived/input_output/data/p00005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00005/Java/s778227441.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s778227441", "user_id": "u874152376"}, "prompt_components": {"gold_output": "2 24\n10000000 150000000\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main\n{\n public static void main(String[] args) throws NumberFormatException, IOException\n {\n BufferedReader input = new BufferedReader(new InputStreamReader(System.in));\n\n while (input.ready())\n {\n String[] dataStr = input.readLine().split(\" \");\n int[] dataInt = new int[dataStr.length];\n for (int i = 0; i < dataStr.length; i++)\n {\n dataInt[i] = Integer.valueOf(dataStr[i]);\n }\n System.out.println(getGCD(dataInt[0], dataInt[1]) + \" \" + getLCM(dataInt[0], dataInt[1]));\n }\n }\n\n public static int getGCD(int num1, int num2)\n {\n if (num1 == num2)\n return num1;\n\n int a = Math.max(num1, num2);\n int b = Math.min(num1, num2);\n int c = 1;\n\n while (true)\n {\n c = a % b;\n if(c == 0) {\n break;\n }\n a = b;\n b = c;\n }\n return b;\n }\n\n public static int getLCM(int a, int b)\n {\n int productA = a;\n int productB = b;\n while (productA <= 2000000000)\n {\n if (productA == productB)\n {\n return productA;\n }\n if (productA < productB)\n {\n productA += a;\n }\n else\n {\n productB += b;\n }\n }\n return 0;\n }\n}", "problem_context": "GCD and LCM\n\nWrite a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.\n\nInput\n\nInput consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.\n\nConstraints\n\n0 < a, b ≤ 2,000,000,000\n\nLCM(a, b) ≤ 2,000,000,000\n\nThe number of data sets ≤ 50\n\nOutput\n\nFor each data set, print GCD and LCM separated by a single space in a line.\n\nSample Input\n\n8 6\n50000000 30000000\n\nOutput for the Sample Input\n\n2 24\n10000000 150000000", "sample_input": "8 6\n50000000 30000000\n"}, "reference_outputs": ["2 24\n10000000 150000000\n"], "source_document_id": "p00005", "source_text": "GCD and LCM\n\nWrite a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.\n\nInput\n\nInput consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.\n\nConstraints\n\n0 < a, b ≤ 2,000,000,000\n\nLCM(a, b) ≤ 2,000,000,000\n\nThe number of data sets ≤ 50\n\nOutput\n\nFor each data set, print GCD and LCM separated by a single space in a line.\n\nSample Input\n\n8 6\n50000000 30000000\n\nOutput for the Sample Input\n\n2 24\n10000000 150000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1296, "cpu_time_ms": 40, "memory_kb": 24144}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s148051462", "group_id": "codeNet:p00005", "input_text": "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner s=new Scanner(System.in);\n\t\tint a,b,k=1,t=1,x,y;\n\t\tint i=1,j=1;\n\t\twhile(s.hasNext()){\n\t\t\ta=s.nextInt();\n\t\t\tb=s.nextInt();\n\t\t\t//\n\t\t\tk=a;t=b;\n\t\t\twhile(true){\n\t\t\t\tif(k==t)\n\t\t\t\t\tbreak;\n\t\t\t\tif(k y) x-=y;\n\t\telse y-=x;\n\t }\n\t lcm=x;\n\t double d=(double)dat[0]*(double)dat[1];\n\t d/=(double)lcm;\n\t gcd=(int)d;\n\t System.out.println(lcm+\" \"+gcd);\n\t}\n }\n}", "language": "Java", "metadata": {"date": 1336438643, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00005.html", "problem_id": "p00005", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00005/input.txt", "sample_output_relpath": "derived/input_output/data/p00005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00005/Java/s312668285.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s312668285", "user_id": "u764432488"}, "prompt_components": {"gold_output": "2 24\n10000000 150000000\n", "input_to_evaluate": "import java.io.*;\nclass Main{\n\n public static void main(String[] args) throws IOException{\n\tint gcd,lcm;\n\tBufferedReader br=\n\t new BufferedReader (new InputStreamReader(System.in));\n\tString buf;\n\twhile(true){\n\t if((buf=br.readLine())==null)break;\n\t if(buf.length()==0)break;\n\t String[] data=buf.split(\" \");\n\t int[] dat =new int[2];\n\t for(int i=0;i<2;i++){\n\t\tdat[i]=Integer.parseInt(data[i]);\n\t }\n\t int x=dat[0],y=dat[1];\n\t while(true){\n\t\tif(x==y)break;\n\t\tif(x > y) x-=y;\n\t\telse y-=x;\n\t }\n\t lcm=x;\n\t double d=(double)dat[0]*(double)dat[1];\n\t d/=(double)lcm;\n\t gcd=(int)d;\n\t System.out.println(lcm+\" \"+gcd);\n\t}\n }\n}", "problem_context": "GCD and LCM\n\nWrite a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.\n\nInput\n\nInput consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.\n\nConstraints\n\n0 < a, b ≤ 2,000,000,000\n\nLCM(a, b) ≤ 2,000,000,000\n\nThe number of data sets ≤ 50\n\nOutput\n\nFor each data set, print GCD and LCM separated by a single space in a line.\n\nSample Input\n\n8 6\n50000000 30000000\n\nOutput for the Sample Input\n\n2 24\n10000000 150000000", "sample_input": "8 6\n50000000 30000000\n"}, "reference_outputs": ["2 24\n10000000 150000000\n"], "source_document_id": "p00005", "source_text": "GCD and LCM\n\nWrite a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.\n\nInput\n\nInput consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.\n\nConstraints\n\n0 < a, b ≤ 2,000,000,000\n\nLCM(a, b) ≤ 2,000,000,000\n\nThe number of data sets ≤ 50\n\nOutput\n\nFor each data set, print GCD and LCM separated by a single space in a line.\n\nSample Input\n\n8 6\n50000000 30000000\n\nOutput for the Sample Input\n\n2 24\n10000000 150000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 664, "cpu_time_ms": 50, "memory_kb": 9184}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s764942017", "group_id": "codeNet:p00006", "input_text": "import java.io.*;\npublic class Main {\n\tpublic static void main(String[] args) throws java.io.IOException {\n\t\tBufferedReader input = new BufferedReader (new InputStreamReader (System.in));\n\t\tString str = input.readLine();\n\t\tint K = str.length();\n\t\tfor(int a = K-1;a >= 0;a--){\n\t\t\tif(a==0){\n\t\t\t\tSystem.out.println(str.charAt(a));\n\t\t\t}else{\n\t\t\t\tSystem.out.print(str.charAt(a));\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1438775961, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00006.html", "problem_id": "p00006", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00006/input.txt", "sample_output_relpath": "derived/input_output/data/p00006/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00006/Java/s764942017.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s764942017", "user_id": "u422935547"}, "prompt_components": {"gold_output": "admin23w\n", "input_to_evaluate": "import java.io.*;\npublic class Main {\n\tpublic static void main(String[] args) throws java.io.IOException {\n\t\tBufferedReader input = new BufferedReader (new InputStreamReader (System.in));\n\t\tString str = input.readLine();\n\t\tint K = str.length();\n\t\tfor(int a = K-1;a >= 0;a--){\n\t\t\tif(a==0){\n\t\t\t\tSystem.out.println(str.charAt(a));\n\t\t\t}else{\n\t\t\t\tSystem.out.print(str.charAt(a));\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "Reverse Sequence\n\nWrite a program which reverses a given string str.\n\nInput\n\nstr (the size of str ≤ 20) is given in a line.\n\nOutput\n\nPrint the reversed str in a line.\n\nSample Input\n\nw32nimda\n\nOutput for the Sample Input\n\nadmin23w", "sample_input": "w32nimda\n"}, "reference_outputs": ["admin23w\n"], "source_document_id": "p00006", "source_text": "Reverse Sequence\n\nWrite a program which reverses a given string str.\n\nInput\n\nstr (the size of str ≤ 20) is given in a line.\n\nOutput\n\nPrint the reversed str in a line.\n\nSample Input\n\nw32nimda\n\nOutput for the Sample Input\n\nadmin23w", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 388, "cpu_time_ms": 40, "memory_kb": 16860}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s521271058", "group_id": "codeNet:p00007", "input_text": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main\n{\n\n\tpublic static void main(String[] args)throws IOException\n\t{\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tString str;\n\t\twhile((str=br.readLine())!=null)\n\t\t{\n\t\t\tint n=Integer.parseInt(str);\n\t\t\tint debt=100000;\n\t\t\tSystem.out.println(debt(debt,n));\n\n\n\t\t}\n\t}\n\n\tstatic int debt(int debt,int n)\n\t{\n\t\tint add=(int)Math.ceil(((int)Math.round(debt*5.0/100.0))/1000.0)*1000;\n\t\tdebt+=add;\n\t\tn--;\n\t\tif(n>0){return debt(debt,n);}\n\t\telse{return debt;}\n\t}\n\n\n\n}", "language": "Java", "metadata": {"date": 1504870707, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00007.html", "problem_id": "p00007", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00007/input.txt", "sample_output_relpath": "derived/input_output/data/p00007/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00007/Java/s521271058.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s521271058", "user_id": "u455537418"}, "prompt_components": {"gold_output": "130000\n", "input_to_evaluate": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main\n{\n\n\tpublic static void main(String[] args)throws IOException\n\t{\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tString str;\n\t\twhile((str=br.readLine())!=null)\n\t\t{\n\t\t\tint n=Integer.parseInt(str);\n\t\t\tint debt=100000;\n\t\t\tSystem.out.println(debt(debt,n));\n\n\n\t\t}\n\t}\n\n\tstatic int debt(int debt,int n)\n\t{\n\t\tint add=(int)Math.ceil(((int)Math.round(debt*5.0/100.0))/1000.0)*1000;\n\t\tdebt+=add;\n\t\tn--;\n\t\tif(n>0){return debt(debt,n);}\n\t\telse{return debt;}\n\t}\n\n\n\n}", "problem_context": "Debt Hell\n\nYour friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.\n\nWrite a program which computes the amount of the debt in n weeks.\n\nInput\n\nAn integer n (0 ≤ n ≤ 100) is given in a line.\n\nOutput\n\nPrint the amout of the debt in a line.\n\nSample Input\n\n5\n\nOutput for the Sample Input\n\n130000", "sample_input": "5\n"}, "reference_outputs": ["130000\n"], "source_document_id": "p00007", "source_text": "Debt Hell\n\nYour friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.\n\nWrite a program which computes the amount of the debt in n weeks.\n\nInput\n\nAn integer n (0 ≤ n ≤ 100) is given in a line.\n\nOutput\n\nPrint the amout of the debt in a line.\n\nSample Input\n\n5\n\nOutput for the Sample Input\n\n130000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 585, "cpu_time_ms": 30, "memory_kb": 24008}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s725923499", "group_id": "codeNet:p00007", "input_text": "import java.io.*;\nimport java.util.*;\n \npublic class Main {\n \n public static void main(String[] args)\n throws java.io.IOException{\n Scanner scan = new Scanner(System.in);\n int sum=100000;\n \n for(int n=scan.nextInt();n>0;n--){\nsum *=1.05;\nint m= up3(sum);\nif(m!=0)\nsum+=1000-m;\n}\nSystem.out.println(sum);\n}\npublic static int up3(int n){\nreturn n%1000;\n \n }\n}", "language": "Java", "metadata": {"date": 1337743561, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00007.html", "problem_id": "p00007", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00007/input.txt", "sample_output_relpath": "derived/input_output/data/p00007/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00007/Java/s725923499.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s725923499", "user_id": "u907626292"}, "prompt_components": {"gold_output": "130000\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n \npublic class Main {\n \n public static void main(String[] args)\n throws java.io.IOException{\n Scanner scan = new Scanner(System.in);\n int sum=100000;\n \n for(int n=scan.nextInt();n>0;n--){\nsum *=1.05;\nint m= up3(sum);\nif(m!=0)\nsum+=1000-m;\n}\nSystem.out.println(sum);\n}\npublic static int up3(int n){\nreturn n%1000;\n \n }\n}", "problem_context": "Debt Hell\n\nYour friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.\n\nWrite a program which computes the amount of the debt in n weeks.\n\nInput\n\nAn integer n (0 ≤ n ≤ 100) is given in a line.\n\nOutput\n\nPrint the amout of the debt in a line.\n\nSample Input\n\n5\n\nOutput for the Sample Input\n\n130000", "sample_input": "5\n"}, "reference_outputs": ["130000\n"], "source_document_id": "p00007", "source_text": "Debt Hell\n\nYour friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.\n\nWrite a program which computes the amount of the debt in n weeks.\n\nInput\n\nAn integer n (0 ≤ n ≤ 100) is given in a line.\n\nOutput\n\nPrint the amout of the debt in a line.\n\nSample Input\n\n5\n\nOutput for the Sample Input\n\n130000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 399, "cpu_time_ms": 80, "memory_kb": 11000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s600939978", "group_id": "codeNet:p00008", "input_text": "import java.io.*;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tString str;\n\t\tint num,count;\n\t\twhile (null != (str = in.readLine())) {\n\t\t\tcount = 0;\n\t\t\tnum = Integer.parseInt(str);\n\t\t\tfor (int i = 0; i <= 9; i++) {\n\t\t\t\tfor (int j = 0; j <= 9; j++) {\n\t\t\t\t\tfor (int k = 0; k <= 9; k++) {\n\t\t\t\t\t\tfor (int l = 0; l <= 9; l++)\n\t\t\t\t\t\t\tcount += (i + j + k + l == num) ? 1 : 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(count);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1391441672, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00008.html", "problem_id": "p00008", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00008/input.txt", "sample_output_relpath": "derived/input_output/data/p00008/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00008/Java/s600939978.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s600939978", "user_id": "u285298145"}, "prompt_components": {"gold_output": "4\n4\n", "input_to_evaluate": "import java.io.*;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tString str;\n\t\tint num,count;\n\t\twhile (null != (str = in.readLine())) {\n\t\t\tcount = 0;\n\t\t\tnum = Integer.parseInt(str);\n\t\t\tfor (int i = 0; i <= 9; i++) {\n\t\t\t\tfor (int j = 0; j <= 9; j++) {\n\t\t\t\t\tfor (int k = 0; k <= 9; k++) {\n\t\t\t\t\t\tfor (int l = 0; l <= 9; l++)\n\t\t\t\t\t\t\tcount += (i + j + k + l == num) ? 1 : 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(count);\n\t\t}\n\t}\n}", "problem_context": "Sum of 4 Integers\n\nWrite a program which reads an integer n and identifies the number of combinations of a, b, c and d (0 ≤ a, b, c, d ≤ 9) which meet the following equality:\n\na + b + c + d = n\n\nFor example, for n = 35, we have 4 different combinations of (a, b, c, d): (8, 9, 9, 9), (9, 8, 9, 9), (9, 9, 8, 9), and (9, 9, 9, 8).\n\nInput\n\nThe input consists of several datasets. Each dataset consists of n (1 ≤ n ≤ 50) in a line. The number of datasets is less than or equal to 50.\n\nOutput\n\nPrint the number of combination in a line.\n\nSample Input\n\n35\n1\n\nOutput for the Sample Input\n\n4\n4", "sample_input": "35\n1\n"}, "reference_outputs": ["4\n4\n"], "source_document_id": "p00008", "source_text": "Sum of 4 Integers\n\nWrite a program which reads an integer n and identifies the number of combinations of a, b, c and d (0 ≤ a, b, c, d ≤ 9) which meet the following equality:\n\na + b + c + d = n\n\nFor example, for n = 35, we have 4 different combinations of (a, b, c, d): (8, 9, 9, 9), (9, 8, 9, 9), (9, 9, 8, 9), and (9, 9, 9, 8).\n\nInput\n\nThe input consists of several datasets. Each dataset consists of n (1 ≤ n ≤ 50) in a line. The number of datasets is less than or equal to 50.\n\nOutput\n\nPrint the number of combination in a line.\n\nSample Input\n\n35\n1\n\nOutput for the Sample Input\n\n4\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 539, "cpu_time_ms": 50, "memory_kb": 18512}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s732319126", "group_id": "codeNet:p00008", "input_text": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t//while(scan.hasNext()){\n\t\t\tint count=0;\n\t\t\tint n=scan.nextInt();\n\t\t\tint[] num = new int[51];\n\t\t\tfor(int i=0;i<=9;i++){\n\t\t\t\tfor(int j=0;j<=9;j++){\n\t\t\t\t\tfor(int k=0;k<=9;k++){\n\t\t\t\t\t\tfor(int l=0;l<=9;l++){\n\t\t\t\t\t\t\tnum[i+j+k+l]++;\n\t\t\t\t\t\t\t//if((i+j+k+l)==n){\n\t\t\t\t\t\t\t\t//count++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(scan.hasNext()){\n\t\t\t\tSystem.out.println(num[n]);\n\t\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1403051406, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00008.html", "problem_id": "p00008", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00008/input.txt", "sample_output_relpath": "derived/input_output/data/p00008/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00008/Java/s732319126.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s732319126", "user_id": "u574420836"}, "prompt_components": {"gold_output": "4\n4\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t//while(scan.hasNext()){\n\t\t\tint count=0;\n\t\t\tint n=scan.nextInt();\n\t\t\tint[] num = new int[51];\n\t\t\tfor(int i=0;i<=9;i++){\n\t\t\t\tfor(int j=0;j<=9;j++){\n\t\t\t\t\tfor(int k=0;k<=9;k++){\n\t\t\t\t\t\tfor(int l=0;l<=9;l++){\n\t\t\t\t\t\t\tnum[i+j+k+l]++;\n\t\t\t\t\t\t\t//if((i+j+k+l)==n){\n\t\t\t\t\t\t\t\t//count++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(scan.hasNext()){\n\t\t\t\tSystem.out.println(num[n]);\n\t\t\t}\n\t}\n}", "problem_context": "Sum of 4 Integers\n\nWrite a program which reads an integer n and identifies the number of combinations of a, b, c and d (0 ≤ a, b, c, d ≤ 9) which meet the following equality:\n\na + b + c + d = n\n\nFor example, for n = 35, we have 4 different combinations of (a, b, c, d): (8, 9, 9, 9), (9, 8, 9, 9), (9, 9, 8, 9), and (9, 9, 9, 8).\n\nInput\n\nThe input consists of several datasets. Each dataset consists of n (1 ≤ n ≤ 50) in a line. The number of datasets is less than or equal to 50.\n\nOutput\n\nPrint the number of combination in a line.\n\nSample Input\n\n35\n1\n\nOutput for the Sample Input\n\n4\n4", "sample_input": "35\n1\n"}, "reference_outputs": ["4\n4\n"], "source_document_id": "p00008", "source_text": "Sum of 4 Integers\n\nWrite a program which reads an integer n and identifies the number of combinations of a, b, c and d (0 ≤ a, b, c, d ≤ 9) which meet the following equality:\n\na + b + c + d = n\n\nFor example, for n = 35, we have 4 different combinations of (a, b, c, d): (8, 9, 9, 9), (9, 8, 9, 9), (9, 9, 8, 9), and (9, 9, 9, 8).\n\nInput\n\nThe input consists of several datasets. Each dataset consists of n (1 ≤ n ≤ 50) in a line. The number of datasets is less than or equal to 50.\n\nOutput\n\nPrint the number of combination in a line.\n\nSample Input\n\n35\n1\n\nOutput for the Sample Input\n\n4\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 496, "cpu_time_ms": 20000, "memory_kb": 63448}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s524407199", "group_id": "codeNet:p00009", "input_text": "import java.util.*;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n while(sc.hasNextInt()){\n int n = sc.nextInt();\n int a=0;\n int b[]=new int[n+1];\n if(n < 2){\n System.out.println(\"0\");\n }else{\n \tfor(int i=2;i<=n;i++){\n \t\tif (b[i]==0){\n \t\t for(int j=i*2; j<=n; j = j+i){\n \t\t\t b[j]=1;\n \t\t }\n \t\t } \n \t}\n for(int i=2; i<=n; i++){\n if(b[i]==0)a++;\n \n }\n System.out.println(a);\n }\n }\n\t\t\t\n }\n}", "language": "Java", "metadata": {"date": 1430490374, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00009.html", "problem_id": "p00009", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00009/input.txt", "sample_output_relpath": "derived/input_output/data/p00009/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00009/Java/s524407199.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s524407199", "user_id": "u778333573"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "import java.util.*;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n while(sc.hasNextInt()){\n int n = sc.nextInt();\n int a=0;\n int b[]=new int[n+1];\n if(n < 2){\n System.out.println(\"0\");\n }else{\n \tfor(int i=2;i<=n;i++){\n \t\tif (b[i]==0){\n \t\t for(int j=i*2; j<=n; j = j+i){\n \t\t\t b[j]=1;\n \t\t }\n \t\t } \n \t}\n for(int i=2; i<=n; i++){\n if(b[i]==0)a++;\n \n }\n System.out.println(a);\n }\n }\n\t\t\t\n }\n}", "problem_context": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "sample_input": "10\n3\n11\n"}, "reference_outputs": ["4\n2\n5\n"], "source_document_id": "p00009", "source_text": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 737, "cpu_time_ms": 160, "memory_kb": 54180}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s090346831", "group_id": "codeNet:p00009", "input_text": "import java.io.*;\nimport java.util.Arrays;\n\npublic class Main{\n\n\tpublic static int prime[] = new int[1000];\n\tprivate static int primeCnt = 0;\n\t\n\tpublic static void main(String[] args) throws IOException{\n\t\n\ttry{\n InputStreamReader isr = new InputStreamReader(System.in);\n BufferedReader br = new BufferedReader(isr);\n String str;\n while( (str = br.readLine() ) != null ){\n \tSystem.out.printf(\"%d\\n\",countPrime(Integer.parseInt(str)));\n \tArrays.fill(prime,0);\n \tprimeCnt = 0;\n }\n\t}\n\tcatch(Exception e){\n\t\tSystem.out.println(e);\n\t}\n\t}\n\t\n\tprivate static boolean isPrime(int n){\n\t\t\t\n\t\tif(n==2){\n\t\t\tprime[0] = 2;\n\t\t\tprimeCnt++;\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < prime.length ; i++) {\n\t\t\tif(n%prime[i] == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif(prime[i+1]==0) break;\n\t\t}\n\t\tprime[primeCnt] = n;\n\t\tprimeCnt++;\n\t\treturn true;\n\t}\n\t\n\tprivate static int countPrime(int n){\n\t\tint count = 0;\n\t\tfor(int i = 2; i <= n; i++){\n\t\t\tif( isPrime(i) )count++;\n\t\t}\n\t\treturn count;\n\t}\n\t\n}", "language": "Java", "metadata": {"date": 1502520755, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00009.html", "problem_id": "p00009", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00009/input.txt", "sample_output_relpath": "derived/input_output/data/p00009/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00009/Java/s090346831.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s090346831", "user_id": "u732073438"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "import java.io.*;\nimport java.util.Arrays;\n\npublic class Main{\n\n\tpublic static int prime[] = new int[1000];\n\tprivate static int primeCnt = 0;\n\t\n\tpublic static void main(String[] args) throws IOException{\n\t\n\ttry{\n InputStreamReader isr = new InputStreamReader(System.in);\n BufferedReader br = new BufferedReader(isr);\n String str;\n while( (str = br.readLine() ) != null ){\n \tSystem.out.printf(\"%d\\n\",countPrime(Integer.parseInt(str)));\n \tArrays.fill(prime,0);\n \tprimeCnt = 0;\n }\n\t}\n\tcatch(Exception e){\n\t\tSystem.out.println(e);\n\t}\n\t}\n\t\n\tprivate static boolean isPrime(int n){\n\t\t\t\n\t\tif(n==2){\n\t\t\tprime[0] = 2;\n\t\t\tprimeCnt++;\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < prime.length ; i++) {\n\t\t\tif(n%prime[i] == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif(prime[i+1]==0) break;\n\t\t}\n\t\tprime[primeCnt] = n;\n\t\tprimeCnt++;\n\t\treturn true;\n\t}\n\t\n\tprivate static int countPrime(int n){\n\t\tint count = 0;\n\t\tfor(int i = 2; i <= n; i++){\n\t\t\tif( isPrime(i) )count++;\n\t\t}\n\t\treturn count;\n\t}\n\t\n}", "problem_context": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "sample_input": "10\n3\n11\n"}, "reference_outputs": ["4\n2\n5\n"], "source_document_id": "p00009", "source_text": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1022, "cpu_time_ms": 40, "memory_kb": 25296}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s389839833", "group_id": "codeNet:p00009", "input_text": "import java.util.*;class Main{public static void main(String[]g){int n=1000002,a[]=new int[n],i,j,m;for(i=0;i0)m=j;}if(a[m]<=i*i)break;}for(i=1,a[i]=j=0;++i0?++j:j;for(Scanner S=new Scanner(System.in);S.hasNext();System.out.println(a[S.nextInt()]));}}\n", "language": "Java", "metadata": {"date": 1515779856, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00009.html", "problem_id": "p00009", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00009/input.txt", "sample_output_relpath": "derived/input_output/data/p00009/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00009/Java/s389839833.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s389839833", "user_id": "u458942529"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "import java.util.*;class Main{public static void main(String[]g){int n=1000002,a[]=new int[n],i,j,m;for(i=0;i0)m=j;}if(a[m]<=i*i)break;}for(i=1,a[i]=j=0;++i0?++j:j;for(Scanner S=new Scanner(System.in);S.hasNext();System.out.println(a[S.nextInt()]));}}\n", "problem_context": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "sample_input": "10\n3\n11\n"}, "reference_outputs": ["4\n2\n5\n"], "source_document_id": "p00009", "source_text": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 382, "cpu_time_ms": 400, "memory_kb": 30516}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s441232288", "group_id": "codeNet:p00009", "input_text": "import java.util.Scanner;\n\npublic class Main{\n boolean[] isPrime;\n void run(){\n\tisPrime = new boolean[1000001];\n\tfor(int i=0;i<=1000000;i++) isPrime[i] = true;\n\n\tisPrime[0] = false;\n \tisPrime[1] = false;\n \n\tfor(int i=2;i<=1000000;i++){\n\t if(!isPrime[i]) continue;\n\t for(int j=i+i;j<=1000000;j+=i){\n\t\tisPrime[j] = false;\n\t }\n\t}\n\tScanner sc = new Scanner(System.in);\n \n\twhile(sc.hasNext()){\n\t int n=sc.nextInt();\n\t int count = 0;\n\t for(int i=0;i<=n;i++){\n\t\tif(isPrime[i]) count++;\n\t }\n\t System.out.println(count);\n\t}\n }\n public static void main(String[] args){\n\tnew Main().run();\n }\n}", "language": "Java", "metadata": {"date": 1363423888, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00009.html", "problem_id": "p00009", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00009/input.txt", "sample_output_relpath": "derived/input_output/data/p00009/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00009/Java/s441232288.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s441232288", "user_id": "u274875240"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main{\n boolean[] isPrime;\n void run(){\n\tisPrime = new boolean[1000001];\n\tfor(int i=0;i<=1000000;i++) isPrime[i] = true;\n\n\tisPrime[0] = false;\n \tisPrime[1] = false;\n \n\tfor(int i=2;i<=1000000;i++){\n\t if(!isPrime[i]) continue;\n\t for(int j=i+i;j<=1000000;j+=i){\n\t\tisPrime[j] = false;\n\t }\n\t}\n\tScanner sc = new Scanner(System.in);\n \n\twhile(sc.hasNext()){\n\t int n=sc.nextInt();\n\t int count = 0;\n\t for(int i=0;i<=n;i++){\n\t\tif(isPrime[i]) count++;\n\t }\n\t System.out.println(count);\n\t}\n }\n public static void main(String[] args){\n\tnew Main().run();\n }\n}", "problem_context": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "sample_input": "10\n3\n11\n"}, "reference_outputs": ["4\n2\n5\n"], "source_document_id": "p00009", "source_text": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 622, "cpu_time_ms": 80, "memory_kb": 22420}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s602886305", "group_id": "codeNet:p00011", "input_text": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint w=sc.nextInt();\n\t\tint num[]=new int[w+1];\n\t\tfor(int i=1;i<=w;i++){\n\t\t\tnum[i]=i;\n\t\t}\n\n\t\tint n=sc.nextInt();\n\t\tfor(int i=0;i ds = new ArrayList();\n\t\tint n = 0;\n\n\t\ttry {\n\t\t\ts = br.readLine();\n\t\t\tn = Integer.parseInt(s);\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tStringBuilder[] sb = new StringBuilder[2];\n\n\t\t\t\ts = br.readLine();\n\t\t\t\tsb[0] = new StringBuilder(s);\n\n\t\t\t\ts = br.readLine();\n\t\t\t\tsb[1] = new StringBuilder(s);\n\n\t\t\t\tds.add(sb);\n\t\t\t}\n\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t\tfor (StringBuilder[] sb : ds) {\n\t\t\tStringBuilder sum = new StringBuilder();\n\t\t\tsb[0].reverse();\n\t\t\tsb[1].reverse();\n\t\t\tint len1 = sb[0].length();\n\t\t\tint len2 = sb[1].length();\n\t\t\tint len = (len1 > len2 ? len1 : len2);\n\n\t\t\t// q: 商, r: 余\n\t\t\tint q, r;\n\t\t\tq = r = 0;\n\t\t\tfor (int i = 0; i < len + 1; i++) {\n\n\t\t\t\tint n1, n2;\n\t\t\t\tif (i < len1)\n\t\t\t\t\tn1 = Integer.parseInt(String.valueOf(sb[0].charAt(i)));\n\t\t\t\telse\n\t\t\t\t\tn1 = 0;\n\t\t\t\tif (i < len2)\n\t\t\t\t\tn2 = Integer.parseInt(String.valueOf(sb[1].charAt(i)));\n\t\t\t\telse\n\t\t\t\t\tn2 = 0;\n\t\t\t\tif (n1 != 0 || n2 != 0 || q != 0) {\n\t\t\t\t\tr = (n1 + n2 + q) % 10;\n\t\t\t\t\tsum.append(r);\n\t\t\t\t\tq = (n1 + n2 + q) / 10;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (sum.length() > 80)\n\t\t\t\tSystem.out.println(\"overflow\");\n\t\t\telse\n\t\t\t\tSystem.out.println(sum.reverse());\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1367606173, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00015.html", "problem_id": "p00015", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00015/input.txt", "sample_output_relpath": "derived/input_output/data/p00015/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00015/Java/s106287950.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s106287950", "user_id": "u759934006"}, "prompt_components": {"gold_output": "1800\n10000000000000000000000000000000000000000\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString s = \"\";\n\n\t\tArrayList ds = new ArrayList();\n\t\tint n = 0;\n\n\t\ttry {\n\t\t\ts = br.readLine();\n\t\t\tn = Integer.parseInt(s);\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tStringBuilder[] sb = new StringBuilder[2];\n\n\t\t\t\ts = br.readLine();\n\t\t\t\tsb[0] = new StringBuilder(s);\n\n\t\t\t\ts = br.readLine();\n\t\t\t\tsb[1] = new StringBuilder(s);\n\n\t\t\t\tds.add(sb);\n\t\t\t}\n\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t\tfor (StringBuilder[] sb : ds) {\n\t\t\tStringBuilder sum = new StringBuilder();\n\t\t\tsb[0].reverse();\n\t\t\tsb[1].reverse();\n\t\t\tint len1 = sb[0].length();\n\t\t\tint len2 = sb[1].length();\n\t\t\tint len = (len1 > len2 ? len1 : len2);\n\n\t\t\t// q: 商, r: 余\n\t\t\tint q, r;\n\t\t\tq = r = 0;\n\t\t\tfor (int i = 0; i < len + 1; i++) {\n\n\t\t\t\tint n1, n2;\n\t\t\t\tif (i < len1)\n\t\t\t\t\tn1 = Integer.parseInt(String.valueOf(sb[0].charAt(i)));\n\t\t\t\telse\n\t\t\t\t\tn1 = 0;\n\t\t\t\tif (i < len2)\n\t\t\t\t\tn2 = Integer.parseInt(String.valueOf(sb[1].charAt(i)));\n\t\t\t\telse\n\t\t\t\t\tn2 = 0;\n\t\t\t\tif (n1 != 0 || n2 != 0 || q != 0) {\n\t\t\t\t\tr = (n1 + n2 + q) % 10;\n\t\t\t\t\tsum.append(r);\n\t\t\t\t\tq = (n1 + n2 + q) / 10;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (sum.length() > 80)\n\t\t\t\tSystem.out.println(\"overflow\");\n\t\t\telse\n\t\t\t\tSystem.out.println(sum.reverse());\n\t\t}\n\t}\n}", "problem_context": "National Budget\n\nA country has a budget of more than 81 trillion yen. We want to process such data, but conventional integer type which uses signed 32 bit can represent up to 2,147,483,647.\n\nYour task is to write a program which reads two integers (more than or equal to zero), and prints a sum of these integers.\n\nIf given integers or the sum have more than 80 digits, print \"overflow\".\n\nInput\n\nInput consists of several datasets. In the first line, the number of datasets N (1 ≤ N ≤ 50) is given. Each dataset consists of 2 lines:\n\nThe first integer\nThe second integer\n\nThe integer has at most 100 digits.\n\nOutput\n\nFor each dataset, print the sum of given integers in a line.\n\nSample Input\n\n6\n1000\n800\n9999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n\nOutput for the Sample Input\n\n1800\n10000000000000000000000000000000000000000\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow", "sample_input": "6\n1000\n800\n9999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n"}, "reference_outputs": ["1800\n10000000000000000000000000000000000000000\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n"], "source_document_id": "p00015", "source_text": "National Budget\n\nA country has a budget of more than 81 trillion yen. We want to process such data, but conventional integer type which uses signed 32 bit can represent up to 2,147,483,647.\n\nYour task is to write a program which reads two integers (more than or equal to zero), and prints a sum of these integers.\n\nIf given integers or the sum have more than 80 digits, print \"overflow\".\n\nInput\n\nInput consists of several datasets. In the first line, the number of datasets N (1 ≤ N ≤ 50) is given. Each dataset consists of 2 lines:\n\nThe first integer\nThe second integer\n\nThe integer has at most 100 digits.\n\nOutput\n\nFor each dataset, print the sum of given integers in a line.\n\nSample Input\n\n6\n1000\n800\n9999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n\nOutput for the Sample Input\n\n1800\n10000000000000000000000000000000000000000\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1470, "cpu_time_ms": 40, "memory_kb": 16960}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s304142781", "group_id": "codeNet:p00017", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.TreeMap;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tString s=\"\";\n\t\tMap map=new HashMap();\n\t\t//Map map=new TreeMap();\n\t\tfor (int i = 0; i < 22; i++) {\n\t\t\tmap.put((char)('a'+(i+4)),(char)('a'+i));\n\t\t}\n\t\tmap.put('a', 'w');\n\t\tmap.put('b', 'x');\n\t\tmap.put('c', 'y');\n\t\tmap.put('d', 'z');\n\t\twhile((s=br.readLine())!=null){\n\t\t\tfor (int i = 0; i < s.length(); i++) {\n\t\t\t\tif(map.containsKey(s.charAt(i))){\n\t\t\t\t\tSystem.out.print(map.get(s.charAt(i)));\n\t\t\t\t}else{\n\t\t\t\t\tSystem.out.print(s.charAt(i));\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t}\n\n}", "language": "Java", "metadata": {"date": 1431892450, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00017.html", "problem_id": "p00017", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00017/input.txt", "sample_output_relpath": "derived/input_output/data/p00017/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00017/Java/s304142781.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s304142781", "user_id": "u465660309"}, "prompt_components": {"gold_output": "this is the picture that i took in the trip.\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.TreeMap;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n\t\tString s=\"\";\n\t\tMap map=new HashMap();\n\t\t//Map map=new TreeMap();\n\t\tfor (int i = 0; i < 22; i++) {\n\t\t\tmap.put((char)('a'+(i+4)),(char)('a'+i));\n\t\t}\n\t\tmap.put('a', 'w');\n\t\tmap.put('b', 'x');\n\t\tmap.put('c', 'y');\n\t\tmap.put('d', 'z');\n\t\twhile((s=br.readLine())!=null){\n\t\t\tfor (int i = 0; i < s.length(); i++) {\n\t\t\t\tif(map.containsKey(s.charAt(i))){\n\t\t\t\t\tSystem.out.print(map.get(s.charAt(i)));\n\t\t\t\t}else{\n\t\t\t\t\tSystem.out.print(s.charAt(i));\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t}\n\n}", "problem_context": "Caesar Cipher\n\nIn cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:\n\nthis is a pen\n\nis would become:\n\nuijt jt b qfo\n\nWrite a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: \"the\", \"this\", or \"that\".\n\nInput\n\nInput consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.\n\nYou may assume that you can create one decoded text which includes any of \"the\", \"this\", or \"that\" from the given input text.\n\nThe number of datasets is less than or equal to 20.\n\nOutput\n\nPrint decoded texts in a line.\n\nSample Input\n\nxlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.\n\nOutput for the Sample Input\n\nthis is the picture that i took in the trip.", "sample_input": "xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.\n"}, "reference_outputs": ["this is the picture that i took in the trip.\n"], "source_document_id": "p00017", "source_text": "Caesar Cipher\n\nIn cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would be replaced by 'b', 'b' would become 'c', 'y' would become 'z', 'z' would become 'a', and so on. In that case, a text:\n\nthis is a pen\n\nis would become:\n\nuijt jt b qfo\n\nWrite a program which reads a text encrypted by Caesar Chipher and prints the corresponding decoded text. The number of shift is secret and it depends on datasets, but you can assume that the decoded text includes any of the following words: \"the\", \"this\", or \"that\".\n\nInput\n\nInput consists of several datasets. Each dataset consists of texts in a line. Input ends with EOF. The text consists of lower-case letters, periods, space, and end-of-lines. Only the letters have been encrypted. A line consists of at most 80 characters.\n\nYou may assume that you can create one decoded text which includes any of \"the\", \"this\", or \"that\" from the given input text.\n\nThe number of datasets is less than or equal to 20.\n\nOutput\n\nPrint decoded texts in a line.\n\nSample Input\n\nxlmw mw xli tmgxyvi xlex m xsso mr xli xvmt.\n\nOutput for the Sample Input\n\nthis is the picture that i took in the trip.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 876, "cpu_time_ms": 40, "memory_kb": 16968}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s757514780", "group_id": "codeNet:p00019", "input_text": "import java.io.*;\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {System.out.println((new Main()).fact(Integer.parseInt((new BufferedReader(new InputStreamReader(System.in))).readLine())));}\n\tprivate long fact(long n){return (n==0)?1:n*fact(n-1);}\n}", "language": "Java", "metadata": {"date": 1385746629, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00019.html", "problem_id": "p00019", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00019/input.txt", "sample_output_relpath": "derived/input_output/data/p00019/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00019/Java/s757514780.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s757514780", "user_id": "u285298145"}, "prompt_components": {"gold_output": "120\n", "input_to_evaluate": "import java.io.*;\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {System.out.println((new Main()).fact(Integer.parseInt((new BufferedReader(new InputStreamReader(System.in))).readLine())));}\n\tprivate long fact(long n){return (n==0)?1:n*fact(n-1);}\n}", "problem_context": "Factorial\n\nWrite a program which reads an integer n and prints the factorial of n. You can assume that n ≤ 20.\n\nInput\n\nAn integer n (1 ≤ n ≤ 20) in a line.\n\nOutput\n\nPrint the factorial of n in a line.\n\nSample Input\n\n5\n\nOutput for the Sample Input\n\n120", "sample_input": "5\n"}, "reference_outputs": ["120\n"], "source_document_id": "p00019", "source_text": "Factorial\n\nWrite a program which reads an integer n and prints the factorial of n. You can assume that n ≤ 20.\n\nInput\n\nAn integer n (1 ≤ n ≤ 20) in a line.\n\nOutput\n\nPrint the factorial of n in a line.\n\nSample Input\n\n5\n\nOutput for the Sample Input\n\n120", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 281, "cpu_time_ms": 40, "memory_kb": 15020}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s087264126", "group_id": "codeNet:p00021", "input_text": "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) throws java.io.IOException {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tdouble x[] = new double[4];\n\t\tdouble y[] = new double[4];\n\t\tfor(int i = 0; i < n ; i++){\n\t\t\tfor(int j = 0 ; j < 4 ; j++){\n\t\t\t\tx[j] = scan.nextDouble();\n\t\t\t\ty[j]= scan.nextDouble();\n\t\t\t}\n\t\t\tdouble a= 0,b = 0;\n\t\t\ta = (y[1]-y[0])/(x[1]-x[0]);\n\t\t\tb = (y[3]-y[2])/(x[3]-x[2]);\n\t\t\tif(a == b){\n\t\t\t\tSystem.out.println(\"YSE\");\n\t\t\t}else{\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1441997409, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00021.html", "problem_id": "p00021", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00021/input.txt", "sample_output_relpath": "derived/input_output/data/p00021/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00021/Java/s087264126.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s087264126", "user_id": "u422935547"}, "prompt_components": {"gold_output": "YES\nNO\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) throws java.io.IOException {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tdouble x[] = new double[4];\n\t\tdouble y[] = new double[4];\n\t\tfor(int i = 0; i < n ; i++){\n\t\t\tfor(int j = 0 ; j < 4 ; j++){\n\t\t\t\tx[j] = scan.nextDouble();\n\t\t\t\ty[j]= scan.nextDouble();\n\t\t\t}\n\t\t\tdouble a= 0,b = 0;\n\t\t\ta = (y[1]-y[0])/(x[1]-x[0]);\n\t\t\tb = (y[3]-y[2])/(x[3]-x[2]);\n\t\t\tif(a == b){\n\t\t\t\tSystem.out.println(\"YSE\");\n\t\t\t}else{\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nParallelism\n\nThere are four points: $A(x_1, y_1)$, $B(x_2, y_2)$, $C(x_3, y_3)$, and $D(x_4, y_4)$. Write a program which determines whether the line $AB$ and the line $CD$ are parallel. If those two lines are parallel, your program should prints \"YES\" and if not prints \"NO\".\n\nInput\n\nInput consists of several datasets. In the first line, you are given the number of datasets $n$ ($n \\leq 100$). There will be $n$ lines where each line correspondgs to each dataset. Each dataset consists of eight real numbers:\n\n$x_1$ $y_1$ $x_2$ $y_2$ $x_3$ $y_3$ $x_4$ $y_4$\n\nYou can assume that $-100 \\leq x_1, y_1, x_2, y_2, x_3, y_3, x_4, y_4 \\leq 100$.\nEach value is a real number with at most 5 digits after the decimal point.\n\nOutput\n\nFor each dataset, print \"YES\" or \"NO\" in a line.\n\nSample Input\n\n2\n0.0 0.0 1.0 1.0 1.0 0.0 2.0 1.0\n3.0 2.0 9.0 6.0 13.0 5.0 7.0 9.0\n\nOutput for the Sample Input\n\nYES\nNO", "sample_input": "2\n0.0 0.0 1.0 1.0 1.0 0.0 2.0 1.0\n3.0 2.0 9.0 6.0 13.0 5.0 7.0 9.0\n"}, "reference_outputs": ["YES\nNO\n"], "source_document_id": "p00021", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nParallelism\n\nThere are four points: $A(x_1, y_1)$, $B(x_2, y_2)$, $C(x_3, y_3)$, and $D(x_4, y_4)$. Write a program which determines whether the line $AB$ and the line $CD$ are parallel. If those two lines are parallel, your program should prints \"YES\" and if not prints \"NO\".\n\nInput\n\nInput consists of several datasets. In the first line, you are given the number of datasets $n$ ($n \\leq 100$). There will be $n$ lines where each line correspondgs to each dataset. Each dataset consists of eight real numbers:\n\n$x_1$ $y_1$ $x_2$ $y_2$ $x_3$ $y_3$ $x_4$ $y_4$\n\nYou can assume that $-100 \\leq x_1, y_1, x_2, y_2, x_3, y_3, x_4, y_4 \\leq 100$.\nEach value is a real number with at most 5 digits after the decimal point.\n\nOutput\n\nFor each dataset, print \"YES\" or \"NO\" in a line.\n\nSample Input\n\n2\n0.0 0.0 1.0 1.0 1.0 0.0 2.0 1.0\n3.0 2.0 9.0 6.0 13.0 5.0 7.0 9.0\n\nOutput for the Sample Input\n\nYES\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 555, "cpu_time_ms": 100, "memory_kb": 23304}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s372899338", "group_id": "codeNet:p00022", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Collections;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader input = new BufferedReader(new InputStreamReader(System.in));\n\n\t\twhile (input.ready()) {\n\t\t\tint setCount = Integer.valueOf(input.readLine());\n\t\t\tif (setCount == 0)\n\t\t\t\tbreak;\n\t\t\tArrayList dataSet = new ArrayList<>();\n\t\t\tfor (int i = 0; i < setCount; i++) {\n\t\t\t\tdataSet.add(Integer.valueOf(input.readLine()));\n\t\t\t}\n\t\t\tArrayList ansSet = new ArrayList<>();\n\t\t\tfor (int i = 0; i < setCount; i++) {\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor (int j = i; j < setCount; j++) {\n\t\t\t\t\ttmp += dataSet.get(j);\n\t\t\t\t\tansSet.add(tmp);\n\t\t\t\t}\n\t\t\t}\n\t\t\tCollections.sort(ansSet);\n\t\t\tSystem.out.println(ansSet.get(ansSet.size()-1));\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1502398062, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00022.html", "problem_id": "p00022", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00022/input.txt", "sample_output_relpath": "derived/input_output/data/p00022/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00022/Java/s372899338.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s372899338", "user_id": "u874152376"}, "prompt_components": {"gold_output": "19\n14\n1001\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Collections;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader input = new BufferedReader(new InputStreamReader(System.in));\n\n\t\twhile (input.ready()) {\n\t\t\tint setCount = Integer.valueOf(input.readLine());\n\t\t\tif (setCount == 0)\n\t\t\t\tbreak;\n\t\t\tArrayList dataSet = new ArrayList<>();\n\t\t\tfor (int i = 0; i < setCount; i++) {\n\t\t\t\tdataSet.add(Integer.valueOf(input.readLine()));\n\t\t\t}\n\t\t\tArrayList ansSet = new ArrayList<>();\n\t\t\tfor (int i = 0; i < setCount; i++) {\n\t\t\t\tint tmp = 0;\n\t\t\t\tfor (int j = i; j < setCount; j++) {\n\t\t\t\t\ttmp += dataSet.get(j);\n\t\t\t\t\tansSet.add(tmp);\n\t\t\t\t}\n\t\t\t}\n\t\t\tCollections.sort(ansSet);\n\t\t\tSystem.out.println(ansSet.get(ansSet.size()-1));\n\t\t}\n\t}\n}", "problem_context": "Maximum Sum Sequence\n\nGiven a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.\n\nInput\n\nThe input consists of multiple datasets. Each data set consists of:\n\nn\na1\na2\n.\n.\nan\n\nYou can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.\n\nThe input end with a line consisting of a single 0.\n\nOutput\n\nFor each dataset, print the maximum sum in a line.\n\nSample Input\n\n7\n-5\n-1\n6\n4\n9\n-6\n-7\n13\n1\n2\n3\n2\n-2\n-1\n1\n2\n3\n2\n1\n-2\n1\n3\n1000\n-200\n201\n0\n\nOutput for the Sample Input\n\n19\n14\n1001", "sample_input": "7\n-5\n-1\n6\n4\n9\n-6\n-7\n13\n1\n2\n3\n2\n-2\n-1\n1\n2\n3\n2\n1\n-2\n1\n3\n1000\n-200\n201\n0\n"}, "reference_outputs": ["19\n14\n1001\n"], "source_document_id": "p00022", "source_text": "Maximum Sum Sequence\n\nGiven a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.\n\nInput\n\nThe input consists of multiple datasets. Each data set consists of:\n\nn\na1\na2\n.\n.\nan\n\nYou can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.\n\nThe input end with a line consisting of a single 0.\n\nOutput\n\nFor each dataset, print the maximum sum in a line.\n\nSample Input\n\n7\n-5\n-1\n6\n4\n9\n-6\n-7\n13\n1\n2\n3\n2\n-2\n-1\n1\n2\n3\n2\n1\n-2\n1\n3\n1000\n-200\n201\n0\n\nOutput for the Sample Input\n\n19\n14\n1001", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 871, "cpu_time_ms": 3880, "memory_kb": 193720}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s515421728", "group_id": "codeNet:p00022", "input_text": "import java.util.Scanner;\nimport java.util.ArrayList;\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner scan = new Scanner(System.in);\n\t\twhile(true){\n\t\t\tint n = scan.nextInt();\n\t\t\tif(n == 0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(n == 1){\n\t\t\t\tSystem.out.println(scan.nextInt());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tArrayList alist = new ArrayList();\n\t\t\tint temp = scan.nextInt();\n\t\t\tboolean sw;\n\t\t\tif(temp > 0){\n\t\t\t\tsw = true;\n\t\t\t}else{\n\t\t\t\tsw = false;\n\t\t\t}\n\t\t\tfor(int i = 0;i < n-1;i++){\n\t\t\t\tint a = scan.nextInt();\n\t\t\t\tif(a > 0){\n\t\t\t\t\tif(sw){\n\t\t\t\t\t\ttemp += a;\n\t\t\t\t\t}else{\n\t\t\t\t\t\talist.add(temp);\n\t\t\t\t\t\ttemp = a;\n\t\t\t\t\t\tsw = true;\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tif(sw){\n\t\t\t\t\t\talist.add(temp);\n\t\t\t\t\t\ttemp = a;\n\t\t\t\t\t\tsw = false;\n\t\t\t\t\t}else{\n\t\t\t\t\t\ttemp += a;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\talist.add(temp);\n\t\t\tint max = 0;\n\t\t\tint b = 0;\n\t\t\tfor(int i = alist.size()-1;i >= 0;i--){\n\t\t\t\ttemp = alist.get(i);\n\t\t\t\tif(max < temp + b){\n\t\t\t\t\tmax = temp + b;\n\t\t\t\t}\n\t\t\t\tb += temp;\n\t\t\t\tif(b < 0){\n\t\t\t\t\tb = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(max);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1356884986, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00022.html", "problem_id": "p00022", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00022/input.txt", "sample_output_relpath": "derived/input_output/data/p00022/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00022/Java/s515421728.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s515421728", "user_id": "u392271245"}, "prompt_components": {"gold_output": "19\n14\n1001\n", "input_to_evaluate": "import java.util.Scanner;\nimport java.util.ArrayList;\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner scan = new Scanner(System.in);\n\t\twhile(true){\n\t\t\tint n = scan.nextInt();\n\t\t\tif(n == 0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(n == 1){\n\t\t\t\tSystem.out.println(scan.nextInt());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tArrayList alist = new ArrayList();\n\t\t\tint temp = scan.nextInt();\n\t\t\tboolean sw;\n\t\t\tif(temp > 0){\n\t\t\t\tsw = true;\n\t\t\t}else{\n\t\t\t\tsw = false;\n\t\t\t}\n\t\t\tfor(int i = 0;i < n-1;i++){\n\t\t\t\tint a = scan.nextInt();\n\t\t\t\tif(a > 0){\n\t\t\t\t\tif(sw){\n\t\t\t\t\t\ttemp += a;\n\t\t\t\t\t}else{\n\t\t\t\t\t\talist.add(temp);\n\t\t\t\t\t\ttemp = a;\n\t\t\t\t\t\tsw = true;\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tif(sw){\n\t\t\t\t\t\talist.add(temp);\n\t\t\t\t\t\ttemp = a;\n\t\t\t\t\t\tsw = false;\n\t\t\t\t\t}else{\n\t\t\t\t\t\ttemp += a;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\talist.add(temp);\n\t\t\tint max = 0;\n\t\t\tint b = 0;\n\t\t\tfor(int i = alist.size()-1;i >= 0;i--){\n\t\t\t\ttemp = alist.get(i);\n\t\t\t\tif(max < temp + b){\n\t\t\t\t\tmax = temp + b;\n\t\t\t\t}\n\t\t\t\tb += temp;\n\t\t\t\tif(b < 0){\n\t\t\t\t\tb = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(max);\n\t\t}\n\t}\n}", "problem_context": "Maximum Sum Sequence\n\nGiven a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.\n\nInput\n\nThe input consists of multiple datasets. Each data set consists of:\n\nn\na1\na2\n.\n.\nan\n\nYou can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.\n\nThe input end with a line consisting of a single 0.\n\nOutput\n\nFor each dataset, print the maximum sum in a line.\n\nSample Input\n\n7\n-5\n-1\n6\n4\n9\n-6\n-7\n13\n1\n2\n3\n2\n-2\n-1\n1\n2\n3\n2\n1\n-2\n1\n3\n1000\n-200\n201\n0\n\nOutput for the Sample Input\n\n19\n14\n1001", "sample_input": "7\n-5\n-1\n6\n4\n9\n-6\n-7\n13\n1\n2\n3\n2\n-2\n-1\n1\n2\n3\n2\n1\n-2\n1\n3\n1000\n-200\n201\n0\n"}, "reference_outputs": ["19\n14\n1001\n"], "source_document_id": "p00022", "source_text": "Maximum Sum Sequence\n\nGiven a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.\n\nInput\n\nThe input consists of multiple datasets. Each data set consists of:\n\nn\na1\na2\n.\n.\nan\n\nYou can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.\n\nThe input end with a line consisting of a single 0.\n\nOutput\n\nFor each dataset, print the maximum sum in a line.\n\nSample Input\n\n7\n-5\n-1\n6\n4\n9\n-6\n-7\n13\n1\n2\n3\n2\n-2\n-1\n1\n2\n3\n2\n1\n-2\n1\n3\n1000\n-200\n201\n0\n\nOutput for the Sample Input\n\n19\n14\n1001", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1024, "cpu_time_ms": 220, "memory_kb": 12000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s392985657", "group_id": "codeNet:p00024", "input_text": "import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tdouble v, t, y;\n\t\tint n;\n\n\t\twhile(sc.hasNext()){\n\t\t\tv = sc.nextDouble();\n\t\t\tt = v / 9.8;\n\t\t\ty = 4.9 * t * t;\n\n\t\t\tn = (int)Math.ceil((y + 5) / 5);\n\n\t\t\tSystem.out.println(n);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1342160400, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00024.html", "problem_id": "p00024", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00024/input.txt", "sample_output_relpath": "derived/input_output/data/p00024/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00024/Java/s392985657.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s392985657", "user_id": "u625127260"}, "prompt_components": {"gold_output": "8\n8\n", "input_to_evaluate": "import java.util.Scanner;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tdouble v, t, y;\n\t\tint n;\n\n\t\twhile(sc.hasNext()){\n\t\t\tv = sc.nextDouble();\n\t\t\tt = v / 9.8;\n\t\t\ty = 4.9 * t * t;\n\n\t\t\tn = (int)Math.ceil((y + 5) / 5);\n\n\t\t\tSystem.out.println(n);\n\t\t}\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nPhysical Experiments\n\nIgnoring the air resistance, velocity of a freely falling object $v$ after $t$ seconds and its drop $y$ in $t$ seconds are represented by the following formulas:\n\n$ v = 9.8 t $\n\n$ y = 4.9 t^2 $\n\nA person is trying to drop down a glass ball and check whether it will crack. Your task is to write a program to help this experiment.\n\nYou are given the minimum velocity to crack the ball. Your program should print the lowest possible floor of a building to crack the ball. The height of the $N$ floor of the building is defined by $5 \\times N - 5$.\n\nInput\n\nThe input consists of multiple datasets. Each dataset, a line, consists of the minimum velocity v (0 < v < 200) to crack the ball. The value is given by a decimal fraction, with at most 4 digits after the decimal point. The input ends with EOF. The number of datasets is less than or equal to 50.\n\nOutput\n\nFor each dataset, print the lowest possible floor where the ball cracks.\n\nSample Input\n\n25.4\n25.4\n\nOutput for the Sample Input\n\n8\n8", "sample_input": "25.4\n25.4\n"}, "reference_outputs": ["8\n8\n"], "source_document_id": "p00024", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nPhysical Experiments\n\nIgnoring the air resistance, velocity of a freely falling object $v$ after $t$ seconds and its drop $y$ in $t$ seconds are represented by the following formulas:\n\n$ v = 9.8 t $\n\n$ y = 4.9 t^2 $\n\nA person is trying to drop down a glass ball and check whether it will crack. Your task is to write a program to help this experiment.\n\nYou are given the minimum velocity to crack the ball. Your program should print the lowest possible floor of a building to crack the ball. The height of the $N$ floor of the building is defined by $5 \\times N - 5$.\n\nInput\n\nThe input consists of multiple datasets. Each dataset, a line, consists of the minimum velocity v (0 < v < 200) to crack the ball. The value is given by a decimal fraction, with at most 4 digits after the decimal point. The input ends with EOF. The number of datasets is less than or equal to 50.\n\nOutput\n\nFor each dataset, print the lowest possible floor where the ball cracks.\n\nSample Input\n\n25.4\n25.4\n\nOutput for the Sample Input\n\n8\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 313, "cpu_time_ms": 90, "memory_kb": 12000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s929736366", "group_id": "codeNet:p00025", "input_text": "import java.util.Scanner;\n\n\npublic class Main {\n static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n\t while(sc.hasNext()){\n\t\t new Main();\n\t }\n }\n\n public Main() {\n new aoj0195().doIt();\n }\n class aoj0195 { \n\t String hitandblow(int a[], int b[]) {\n\t\t int hit = 0;\n\t\t\tint hblow = 0;\n\t\t\tint blow = 0;\n\t\t\tString result = \"\";\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tif (a[i] == b[i]) {\n\t\t\t\t\thit++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tfor (int j = 0; j < 4; j++) {\n\t\t\t\t\tif (a[i] == b[j]) {\n\t\t\t\t\t\tif(i != j){\n\t\t\t\t\t\t\thblow++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tblow = hblow ;\n\n\t\t\tresult = hit + \" \" + hblow;\n\n\t\t\treturn result;\n\t\t}\n\t \n void doIt() {\n \t\tint A[] = new int[4];\n \t\tint B[] = new int[4];\n\n \t\tfor (int i = 0; i < 4; i++) {\n \t\t\tA[i] = sc.nextInt();\n \t\t}\n \t\tfor (int i = 0; i < 4; i++) {\n \t\t\tB[i] = sc.nextInt();\n \t\t}\n \t\tSystem.out.println(hitandblow(A, B));\n }\n }\n}", "language": "Java", "metadata": {"date": 1434360186, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00025.html", "problem_id": "p00025", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00025/input.txt", "sample_output_relpath": "derived/input_output/data/p00025/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00025/Java/s929736366.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s929736366", "user_id": "u037061989"}, "prompt_components": {"gold_output": "1 1\n3 0\n", "input_to_evaluate": "import java.util.Scanner;\n\n\npublic class Main {\n static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n\t while(sc.hasNext()){\n\t\t new Main();\n\t }\n }\n\n public Main() {\n new aoj0195().doIt();\n }\n class aoj0195 { \n\t String hitandblow(int a[], int b[]) {\n\t\t int hit = 0;\n\t\t\tint hblow = 0;\n\t\t\tint blow = 0;\n\t\t\tString result = \"\";\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tif (a[i] == b[i]) {\n\t\t\t\t\thit++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tfor (int j = 0; j < 4; j++) {\n\t\t\t\t\tif (a[i] == b[j]) {\n\t\t\t\t\t\tif(i != j){\n\t\t\t\t\t\t\thblow++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tblow = hblow ;\n\n\t\t\tresult = hit + \" \" + hblow;\n\n\t\t\treturn result;\n\t\t}\n\t \n void doIt() {\n \t\tint A[] = new int[4];\n \t\tint B[] = new int[4];\n\n \t\tfor (int i = 0; i < 4; i++) {\n \t\t\tA[i] = sc.nextInt();\n \t\t}\n \t\tfor (int i = 0; i < 4; i++) {\n \t\t\tB[i] = sc.nextInt();\n \t\t}\n \t\tSystem.out.println(hitandblow(A, B));\n }\n }\n}", "problem_context": "Hit and Blow\n\nLet's play Hit and Blow game. A imagines four numbers and B guesses the numbers. After B picks out four numbers, A answers:\n\nThe number of numbers which have the same place with numbers A imagined (Hit)\n\nThe number of numbers included (but different place) in the numbers A imagined (Blow)\n\nFor example, if A imagined numbers:\n\n9 1 8 2\n\nand B chose:\n\n4 1 5 9\n\nA should say 1 Hit and 1 Blow.\n\nWrite a program which reads four numbers A imagined and four numbers B chose and prints the number of Hit and Blow respectively. You may assume that the four numbers are all different and within from 0 to 9.\n\nInput\n\nThe input consists of multiple datasets. Each dataset set consists of:\n\na1 a2 a3 a4\nb1 b2 b3 b4\n\n, where ai (0 ≤ ai ≤ 9) is i-th number A imagined and bi (0 ≤ bi ≤ 9) is i-th number B chose.\n\nThe input ends with EOF. The number of datasets is less than or equal to 50.\n\nOutput\n\nFor each dataset, print the number of Hit and Blow in a line. These two numbers should be separated by a space.\n\nSample Input\n\n9 1 8 2\n4 1 5 9\n4 6 8 2\n4 6 3 2\n\nOutput for the Sample Input\n\n1 1\n3 0", "sample_input": "9 1 8 2\n4 1 5 9\n4 6 8 2\n4 6 3 2\n"}, "reference_outputs": ["1 1\n3 0\n"], "source_document_id": "p00025", "source_text": "Hit and Blow\n\nLet's play Hit and Blow game. A imagines four numbers and B guesses the numbers. After B picks out four numbers, A answers:\n\nThe number of numbers which have the same place with numbers A imagined (Hit)\n\nThe number of numbers included (but different place) in the numbers A imagined (Blow)\n\nFor example, if A imagined numbers:\n\n9 1 8 2\n\nand B chose:\n\n4 1 5 9\n\nA should say 1 Hit and 1 Blow.\n\nWrite a program which reads four numbers A imagined and four numbers B chose and prints the number of Hit and Blow respectively. You may assume that the four numbers are all different and within from 0 to 9.\n\nInput\n\nThe input consists of multiple datasets. Each dataset set consists of:\n\na1 a2 a3 a4\nb1 b2 b3 b4\n\n, where ai (0 ≤ ai ≤ 9) is i-th number A imagined and bi (0 ≤ bi ≤ 9) is i-th number B chose.\n\nThe input ends with EOF. The number of datasets is less than or equal to 50.\n\nOutput\n\nFor each dataset, print the number of Hit and Blow in a line. These two numbers should be separated by a space.\n\nSample Input\n\n9 1 8 2\n4 1 5 9\n4 6 8 2\n4 6 3 2\n\nOutput for the Sample Input\n\n1 1\n3 0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 967, "cpu_time_ms": 40, "memory_kb": 18108}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s708262520", "group_id": "codeNet:p00033", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\n\tpublic static void main(String[] args) {\n\n\t\tint n = sc.nextInt();\n\t\tint num[] = new int[10];\n\t\tint a = 0;\n\t\tint b = 0;\n\t\tString str = \"YES\";\n\n\t\tfor (int s = 0; s < n; s++) {\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tnum[i] = sc.nextInt();\n\t\t\t}\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tif (a < num[i]) {\n\t\t\t\t\ta = num[i];\n\t\t\t\t} else if (b < num[i] && a > num[i]) {\n\t\t\t\t\tb = num[i];\n\t\t\t\t} else {\n\t\t\t\t\tstr = \"NO\";\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(str);\n\n\t\t}\n\n\t}\n\n}", "language": "Java", "metadata": {"date": 1499751010, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00033.html", "problem_id": "p00033", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00033/input.txt", "sample_output_relpath": "derived/input_output/data/p00033/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00033/Java/s708262520.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s708262520", "user_id": "u650207734"}, "prompt_components": {"gold_output": "YES\nNO\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\n\tpublic static void main(String[] args) {\n\n\t\tint n = sc.nextInt();\n\t\tint num[] = new int[10];\n\t\tint a = 0;\n\t\tint b = 0;\n\t\tString str = \"YES\";\n\n\t\tfor (int s = 0; s < n; s++) {\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tnum[i] = sc.nextInt();\n\t\t\t}\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tif (a < num[i]) {\n\t\t\t\t\ta = num[i];\n\t\t\t\t} else if (b < num[i] && a > num[i]) {\n\t\t\t\t\tb = num[i];\n\t\t\t\t} else {\n\t\t\t\t\tstr = \"NO\";\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(str);\n\n\t\t}\n\n\t}\n\n}", "problem_context": "玉\n\n図のように二股に分かれている容器があります。1 から 10 までの番号が付けられた10 個の玉を容器の開口部 A から落とし、左の筒 B か右の筒 C に玉を入れます。板 D は支点 E を中心に左右に回転できるので、板 D を動かすことで筒 B と筒 C のどちらに入れるか決めることができます。\n\n開口部 A から落とす玉の並びを与えます。それらを順番に筒 B 又は筒 Cに入れていきます。このとき、筒 B と筒 C のおのおのが両方とも番号の小さい玉の上に大きい玉を並べられる場合は YES、並べられない場合は NO と出力するプログラムを作成してください。ただし、容器の中で玉の順序を入れ替えることはできないものとします。また、続けて同じ筒に入れることができるものとし、筒 B, C ともに 10 個の玉がすべて入るだけの余裕があるものとします。\n\nInput\n\n複数のデータセットが与えられます。１行目にデータセット数 N が与えられます。つづいて、N 行のデータセットが与えられます。各データセットに 10 個の番号が左から順番に��白区切りで与えられます。\n\nOutput\n\n各データセットに対して、YES または NO を１行に出力して下さい。\n\nSample Input\n\n2\n3 1 4 2 5 6 7 8 9 10\n10 9 8 7 6 5 4 3 2 1\n\nOutput for the Sample Input\n\nYES\nNO", "sample_input": "2\n3 1 4 2 5 6 7 8 9 10\n10 9 8 7 6 5 4 3 2 1\n"}, "reference_outputs": ["YES\nNO\n"], "source_document_id": "p00033", "source_text": "玉\n\n図のように二股に分かれている容器があります。1 から 10 までの番号が付けられた10 個の玉を容器の開口部 A から落とし、左の筒 B か右の筒 C に玉を入れます。板 D は支点 E を中心に左右に回転できるので、板 D を動かすことで筒 B と筒 C のどちらに入れるか決めることができます。\n\n開口部 A から落とす玉の並びを与えます。それらを順番に筒 B 又は筒 Cに入れていきます。このとき、筒 B と筒 C のおのおのが両方とも番号の小さい玉の上に大きい玉を並べられる場合は YES、並べられない場合は NO と出力するプログラムを作成してください。ただし、容器の中で玉の順序を入れ替えることはできないものとします。また、続けて同じ筒に入れることができるものとし、筒 B, C ともに 10 個の玉がすべて入るだけの余裕があるものとします。\n\nInput\n\n複数のデータセットが与えられます。１行目にデータセット数 N が与えられます。つづいて、N 行のデータセットが与えられます。各データセットに 10 個の番号が左から順番に空白区切りで与えられます。\n\nOutput\n\n各データセットに対して、YES または NO を１行に出力して下さい。\n\nSample Input\n\n2\n3 1 4 2 5 6 7 8 9 10\n10 9 8 7 6 5 4 3 2 1\n\nOutput for the Sample Input\n\nYES\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 547, "cpu_time_ms": 50, "memory_kb": 25940}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s231746730", "group_id": "codeNet:p00034", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = null;\n\t\ttry {\n\t\t\tsc = new Scanner(System.in);\n\t\t\tString[] input = sc.nextLine().split(\",\");\n\t\t\tint largestKukanNum = input.length - 2;\n\n\t\t\t// 区間の長さの合計\n\t\t\tint kukanSum = 0;\n\t\t\tfor (int i = 0; i < largestKukanNum; i++) {\n\t\t\t\tkukanSum += Integer.parseInt(input[i]);\n\t\t\t}\n\n\t\t\t// 区間1側の終端駅を出発した電車の速度\n\t\t\tint v1 = Integer.parseInt(input[input.length - 2]);\n\t\t\t// 反対側の終端駅を出発した電車の速度\n\t\t\tint v2 = Integer.parseInt(input[input.length - 1]);\n\n\t\t\t// 電車がすれ違うまでの距離を区間1から測る\n\t\t\tint pass = (int) Math.round(kukanSum / (v1 + v2) * v1);\n\n\t\t\t// すれ違う区間を出力する\n\t\t\tint passKukan = 0;\n\t\t\tfor (int i = 0; i < largestKukanNum - 1; i++) {\n\t\t\t\tpassKukan += Integer.parseInt(input[i]);\n\t\t\t\tif (passKukan > pass) {\n\t\t\t\t\tSystem.out.println(i + 1);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t} finally {\n\t\t\tsc.close();\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1451663801, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00034.html", "problem_id": "p00034", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00034/input.txt", "sample_output_relpath": "derived/input_output/data/p00034/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00034/Java/s231746730.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s231746730", "user_id": "u532635730"}, "prompt_components": {"gold_output": "4\n7\n6\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = null;\n\t\ttry {\n\t\t\tsc = new Scanner(System.in);\n\t\t\tString[] input = sc.nextLine().split(\",\");\n\t\t\tint largestKukanNum = input.length - 2;\n\n\t\t\t// 区間の長さの合計\n\t\t\tint kukanSum = 0;\n\t\t\tfor (int i = 0; i < largestKukanNum; i++) {\n\t\t\t\tkukanSum += Integer.parseInt(input[i]);\n\t\t\t}\n\n\t\t\t// 区間1側の終端駅を出発した電車の速度\n\t\t\tint v1 = Integer.parseInt(input[input.length - 2]);\n\t\t\t// 反対側の終端駅を出発した電車の速度\n\t\t\tint v2 = Integer.parseInt(input[input.length - 1]);\n\n\t\t\t// 電車がすれ違うまでの距離を区間1から測る\n\t\t\tint pass = (int) Math.round(kukanSum / (v1 + v2) * v1);\n\n\t\t\t// すれ違う区間を出力する\n\t\t\tint passKukan = 0;\n\t\t\tfor (int i = 0; i < largestKukanNum - 1; i++) {\n\t\t\t\tpassKukan += Integer.parseInt(input[i]);\n\t\t\t\tif (passKukan > pass) {\n\t\t\t\t\tSystem.out.println(i + 1);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t} finally {\n\t\t\tsc.close();\n\t\t}\n\t}\n}", "problem_context": "鉄道路線\n\n複線（上りと下りが別の線路になっていてどこででもすれ違える）の鉄道路線があります。この路線には終端駅を含めて11 の駅があり、それぞれの駅と駅の間は図で示す区間番号で呼ばれています。\n\nこの路線の両方の終端駅から列車が同時に出発して、途中で停まらずに走ります。各区間の長さと2 本の列車の速度を読み込んで、それぞれの場合について列車がすれ違う区間の番号を出力するプログラムを作成してください。ただし、ちょうど駅のところですれ違う場合は、両側の区間番号のうち小さいほうの数字を出力します。また、列車の長さ、駅の長さは無視できるものとします。\n\nInput\n\n複数のデータセットが与えられる。各データセットは以下のような形式で与えられる。\n\nl1,l2,l3,l4,l5,l6,l7,l8,l9,l10,v1,v2\n\nli (1 ≤ li ≤ 2,000) は区間 i の長さ(km)を表す整数である。v1 は区間 1 側の終端駅を出発した列車の速度(km/h)、v2 は区間 10 側の終端駅を出発した列車の速度(km/h)を表す整数である (1 ≤ v1, v2 ≤ 2,000)。\n\nデータセットの数は 50 を超えない。\n\nOutput\n\nデータセットごとに、列車がすれちがう区間の番号を１行に出力する。\n\nSample Input\n\n1,1,1,1,1,1,1,1,1,1,40,60\n1,1,1,1,1,3,3,3,3,3,50,50\n10,10,10,10,10,10,10,10,10,10,50,49\n\nOutput for the Sample Input\n\n4\n7\n6", "sample_input": "1,1,1,1,1,1,1,1,1,1,40,60\n1,1,1,1,1,3,3,3,3,3,50,50\n10,10,10,10,10,10,10,10,10,10,50,49\n"}, "reference_outputs": ["4\n7\n6\n"], "source_document_id": "p00034", "source_text": "鉄道路線\n\n複線（上りと下りが別の線路になっていてどこででもすれ違える）の鉄道路線があります。この路線には終端駅を含めて11 の駅があり、それぞれの駅と駅の間は図で示す区間番号で呼ばれています。\n\nこの路線の両方の終端駅から列車が同時に出発して、途中で停まらずに走ります。各区間の長さと2 本の列車の速度を読み込んで、それぞれの場合について列車がすれ違う区間の番号を出力するプログラムを作成してください。ただし、ちょうど駅のところですれ違う場合は、両側の区間番号のうち小さいほうの数字を出力します。また、列車の長さ、駅の長さは無視できるものとします。\n\nInput\n\n複数のデータセットが与えられる。各データセットは以下のような形式で与えられる。\n\nl1,l2,l3,l4,l5,l6,l7,l8,l9,l10,v1,v2\n\nli (1 ≤ li ≤ 2,000) は区間 i の長さ(km)を表す整数である。v1 は区間 1 側の終端駅を出発した列車の速度(km/h)、v2 は区間 10 側の終端駅を出発した列車の速度(km/h)を表す整数である (1 ≤ v1, v2 ≤ 2,000)。\n\nデータセットの数は 50 を超えない。\n\nOutput\n\nデータセットごとに、列車がすれちがう区間の番号を１行に出力する。\n\nSample Input\n\n1,1,1,1,1,1,1,1,1,1,40,60\n1,1,1,1,1,3,3,3,3,3,50,50\n10,10,10,10,10,10,10,10,10,10,50,49\n\nOutput for the Sample Input\n\n4\n7\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1022, "cpu_time_ms": 50, "memory_kb": 25908}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s578426813", "group_id": "codeNet:p00035", "input_text": "public class Main{\n public void run(java.io.InputStream in, java.io.PrintStream out){\n java.util.Scanner sc = new java.util.Scanner(in);\n int i, j, l, r;\n double[] a, x, y;\n String s;\n char[] ch;\n\n a = new double[8]; x = new double[4]; y = new double[4];\n for(;sc.hasNext();){\n s = sc.next();\n ch = new char[s.length()];\n for(i = 0;i < s.length();i++)ch[i] = s.charAt(i);\n j = 0; l = 0;r = 0;\n for(i = 0;i < 8;i++){\n for(;j < s.length() + 1;j++){\n if(j == s.length() || ch[j] == ','){\n r = j; a[i] = readdouble(ch, l, r); l = ++j; break;\n }\n }\n }\n\n for(i = 0;i < 8;i++){\n x[i / 2] = a[i++]; y[i / 2] = a[i];\n }\n if(isconvex(x, y, 4))out.println(\"YES\");\n else out.println(\"NO\");\n }\n\n sc.close();\n }\n public static void main(String[] args){\n (new Main()).run(System.in, System.out);\n }\n private static double readdouble(char[] ch, int l, int r){\n int i;\n double res, d;\n\n d = 1.0; res = 0.0;\n for(i = l;i < r;i++){\n if(ch[i] == '.')break;\n d *= 10;\n }\n d /= 10;\n\n for(i = l;i < r;i++){\n if(ch[i] != '.'){\n res += d * (double)(ch[i] - '0');\n d /= 10;\n }\n }\n return res;\n }\n private static boolean isconvex(double[] x, double[] y, int n){\n int i, count1, count2;\n double ax, ay, bx, by;\n\n count1 = 0; count2 = 0;\n for(i = 0;i < n - 1;i++){\n ax = x[(i + 1) % n] - x[i]; ay = y[(i + 1) % n] - y[i];\n bx = x[(i + 2) % n] - x[i]; by = y[(i + 2) % n] - y[i];\n if(ax * by - ay * bx < 0)count1++;\n if(ax * by - ay * bx > 0)count2++;\n }\n if(count1 == 0 || count2 == 0)return true;\n else return false;\n }\n}", "language": "Java", "metadata": {"date": 1441891664, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00035.html", "problem_id": "p00035", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00035/input.txt", "sample_output_relpath": "derived/input_output/data/p00035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00035/Java/s578426813.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s578426813", "user_id": "u567478557"}, "prompt_components": {"gold_output": "YES\nNO\n", "input_to_evaluate": "public class Main{\n public void run(java.io.InputStream in, java.io.PrintStream out){\n java.util.Scanner sc = new java.util.Scanner(in);\n int i, j, l, r;\n double[] a, x, y;\n String s;\n char[] ch;\n\n a = new double[8]; x = new double[4]; y = new double[4];\n for(;sc.hasNext();){\n s = sc.next();\n ch = new char[s.length()];\n for(i = 0;i < s.length();i++)ch[i] = s.charAt(i);\n j = 0; l = 0;r = 0;\n for(i = 0;i < 8;i++){\n for(;j < s.length() + 1;j++){\n if(j == s.length() || ch[j] == ','){\n r = j; a[i] = readdouble(ch, l, r); l = ++j; break;\n }\n }\n }\n\n for(i = 0;i < 8;i++){\n x[i / 2] = a[i++]; y[i / 2] = a[i];\n }\n if(isconvex(x, y, 4))out.println(\"YES\");\n else out.println(\"NO\");\n }\n\n sc.close();\n }\n public static void main(String[] args){\n (new Main()).run(System.in, System.out);\n }\n private static double readdouble(char[] ch, int l, int r){\n int i;\n double res, d;\n\n d = 1.0; res = 0.0;\n for(i = l;i < r;i++){\n if(ch[i] == '.')break;\n d *= 10;\n }\n d /= 10;\n\n for(i = l;i < r;i++){\n if(ch[i] != '.'){\n res += d * (double)(ch[i] - '0');\n d /= 10;\n }\n }\n return res;\n }\n private static boolean isconvex(double[] x, double[] y, int n){\n int i, count1, count2;\n double ax, ay, bx, by;\n\n count1 = 0; count2 = 0;\n for(i = 0;i < n - 1;i++){\n ax = x[(i + 1) % n] - x[i]; ay = y[(i + 1) % n] - y[i];\n bx = x[(i + 2) % n] - x[i]; by = y[(i + 2) % n] - y[i];\n if(ax * by - ay * bx < 0)count1++;\n if(ax * by - ay * bx > 0)count2++;\n }\n if(count1 == 0 || count2 == 0)return true;\n else return false;\n }\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n凸？\n\n平面上の異なる 4 点　$A (x_a, y_a)$, $B (x_b, y_b)$, $C (x_c, y_c)$, $D(x_d, y_d)$ の座標を読み込んで、それら 4 点を頂点とした四角形 $ABCD$ に凹みがなければ YES、凹みがあれば NO と出力するプログラムを作成してください。\n\n凹みのある四角形とは図 1 のような四角形です。\n\nInput\n\n複数のデータセットが与えられます。各データセットの形式は以下のとおりです。\n\n$x_a$,$y_a$,$x_b$,$y_b$,$x_c$,$y_c$,$x_d$,$y_d$\n\n$x_a$, $y_a$, $x_b$, $y_b$, $x_c$, $y_c$, $x_d$, $y_d$ はそれぞれ -100 以上 100 以下であり、実数で与えられます。\n\n1 直線上に 3 つ以上点が並ぶことはないものとします。また、入力順に点を結んでいけば、四角形になる順番に点の座標が入力されるものとします。（つまり、図 2 のような形になる順番で点が与えられることはありません。)\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n各データセットごとに、YES または NO を１行に出力します。\n\nSample Input\n\n0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0\n\nOutput for the Sample Input\n\nYES\nNO", "sample_input": "0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0\n"}, "reference_outputs": ["YES\nNO\n"], "source_document_id": "p00035", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n凸？\n\n平面上の異なる 4 点　$A (x_a, y_a)$, $B (x_b, y_b)$, $C (x_c, y_c)$, $D(x_d, y_d)$ の座標を読み込んで、それら 4 点を頂点とした四角形 $ABCD$ に凹みがなければ YES、凹みがあれば NO と出力するプログラムを作成してください。\n\n凹みのある四角形とは図 1 のような四角形です。\n\nInput\n\n複数のデータセットが与えられます。各データセットの形式は以下のとおりです。\n\n$x_a$,$y_a$,$x_b$,$y_b$,$x_c$,$y_c$,$x_d$,$y_d$\n\n$x_a$, $y_a$, $x_b$, $y_b$, $x_c$, $y_c$, $x_d$, $y_d$ はそれぞれ -100 以上 100 以下であり、実数で与えられます。\n\n1 直線上に 3 つ以上点が並ぶことはないものとします。また、入力順に点を結んでいけば、四角形になる順番に点の座標が入力されるものとします。（つまり、図 2 のような形になる順番で点が与えられることはありません。)\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n各データセットごとに、YES または NO を１行に出力します。\n\nSample Input\n\n0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0\n\nOutput for the Sample Input\n\nYES\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1733, "cpu_time_ms": 40, "memory_kb": 17132}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s325008256", "group_id": "codeNet:p00035", "input_text": "import java.util.*;\n\npublic class Main{\n\t\n\tprivate static final Scanner scan = new Scanner(System.in)\n\t\t\t\t\t\t\t.useDelimiter(\"[,\\\\s]+\");\n\n\tpublic static void main(String[] args){\n\n\t\twhile(scan.hasNext()){\n\t\t\tdouble[] x = new double[4];\n\t\t\tdouble[] y = new double[4];\n\t\t\tfor(int i = 0; i < 4; i++){\n\t\t\t\tx[i] = scan.nextDouble();\n\t\t\t\ty[i] = scan.nextDouble();\n\t\t\t}\n\t\t\tboolean flag = isIntersect(x[0], y[0], x[2], y[2], x[1], y[1], x[3], y[3])\n\t\t\t && isIntersect(x[1], y[1], x[3], y[3], x[0], y[0], x[2], y[2]);\n\t\t\tSystem.out.printf(\"%s\\n\", flag? \"YES\" : \"NO\");\n\t\t}\n\t}\n\n\tpublic static boolean isIntersect(double x1, double y1, double x2, double y2,\n\t\t\t\t\t double x3, double y3, double x4, double y4){\n\t\tboolean result = false;\n\t\tdouble tb = (x1-x2)*(y3 -y1)+(y1-y2)*(x1- x3);\n\t\tdouble td = (x1-x2)*(y4 -y1)+(y1-y2)*(x1- x4);\n\t\tif(tb*td < 0){\n\t\t\tresult = true;\n\t\t}\n\t\treturn result;\n\t}\n} ", "language": "Java", "metadata": {"date": 1482229237, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00035.html", "problem_id": "p00035", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00035/input.txt", "sample_output_relpath": "derived/input_output/data/p00035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00035/Java/s325008256.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s325008256", "user_id": "u910402677"}, "prompt_components": {"gold_output": "YES\nNO\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n\t\n\tprivate static final Scanner scan = new Scanner(System.in)\n\t\t\t\t\t\t\t.useDelimiter(\"[,\\\\s]+\");\n\n\tpublic static void main(String[] args){\n\n\t\twhile(scan.hasNext()){\n\t\t\tdouble[] x = new double[4];\n\t\t\tdouble[] y = new double[4];\n\t\t\tfor(int i = 0; i < 4; i++){\n\t\t\t\tx[i] = scan.nextDouble();\n\t\t\t\ty[i] = scan.nextDouble();\n\t\t\t}\n\t\t\tboolean flag = isIntersect(x[0], y[0], x[2], y[2], x[1], y[1], x[3], y[3])\n\t\t\t && isIntersect(x[1], y[1], x[3], y[3], x[0], y[0], x[2], y[2]);\n\t\t\tSystem.out.printf(\"%s\\n\", flag? \"YES\" : \"NO\");\n\t\t}\n\t}\n\n\tpublic static boolean isIntersect(double x1, double y1, double x2, double y2,\n\t\t\t\t\t double x3, double y3, double x4, double y4){\n\t\tboolean result = false;\n\t\tdouble tb = (x1-x2)*(y3 -y1)+(y1-y2)*(x1- x3);\n\t\tdouble td = (x1-x2)*(y4 -y1)+(y1-y2)*(x1- x4);\n\t\tif(tb*td < 0){\n\t\t\tresult = true;\n\t\t}\n\t\treturn result;\n\t}\n} ", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n凸？\n\n平面上の異なる 4 点　$A (x_a, y_a)$, $B (x_b, y_b)$, $C (x_c, y_c)$, $D(x_d, y_d)$ の座標を読み込んで、それら 4 点を頂点とした四角形 $ABCD$ に凹みがなければ YES、凹みがあれば NO と出力するプログラムを作成してください。\n\n凹みのある四角形とは図 1 のような四角形です。\n\nInput\n\n複数のデータセットが与えられます。各データセットの形式は以下のとおりです。\n\n$x_a$,$y_a$,$x_b$,$y_b$,$x_c$,$y_c$,$x_d$,$y_d$\n\n$x_a$, $y_a$, $x_b$, $y_b$, $x_c$, $y_c$, $x_d$, $y_d$ はそれぞれ -100 以上 100 以下であり、実数で与えられます。\n\n1 直線上に 3 つ以上点が並ぶことはないものとします。また、入力順に点を結んでいけば、四角形になる順番に点の座標が入力されるものとします。（つまり、図 2 のような形になる順番で点が与えられることはありません。)\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n各データセットごとに、YES または NO を１行に出力します。\n\nSample Input\n\n0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0\n\nOutput for the Sample Input\n\nYES\nNO", "sample_input": "0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0\n"}, "reference_outputs": ["YES\nNO\n"], "source_document_id": "p00035", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n凸？\n\n平面上の異なる 4 点　$A (x_a, y_a)$, $B (x_b, y_b)$, $C (x_c, y_c)$, $D(x_d, y_d)$ の座標を読み込んで、それら 4 点を頂点とした四角形 $ABCD$ に凹みがなければ YES、凹みがあれば NO と出力するプログラムを作成してください。\n\n凹みのある四角形とは図 1 のような四角形です。\n\nInput\n\n複数のデータセットが与えられます。各データセットの形式は以下のとおりです。\n\n$x_a$,$y_a$,$x_b$,$y_b$,$x_c$,$y_c$,$x_d$,$y_d$\n\n$x_a$, $y_a$, $x_b$, $y_b$, $x_c$, $y_c$, $x_d$, $y_d$ はそれぞれ -100 以上 100 以下であり、実数で与えられます。\n\n1 直線上に 3 つ以上点が並ぶことはないものとします。また、入力順に点を結んでいけば、四角形になる順番に点の座標が入力されるものとします。（つまり、図 2 のような形になる順番で点が与えられることはありません。)\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n各データセットごとに、YES または NO を１行に出力します。\n\nSample Input\n\n0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0\n\nOutput for the Sample Input\n\nYES\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 880, "cpu_time_ms": 80, "memory_kb": 28480}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s185692082", "group_id": "codeNet:p00038", "input_text": "import java.awt.CardLayout;\nimport java.awt.geom.Point2D;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main {\t\n\tpublic static void main(String[] args){\n\t\tnew Main();\n\t}\n\tpublic Main(){\n\t\tnew AOJ0038();\n\t}\n\t\n\tclass AOJ0038{\n\t\tint [] cards;\n\t\t\n\t\tboolean four(){\n\t\t\tfor(int i=0;i<14;i++)if(cards[i]>=4)return true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tboolean full(){\n\t\t\tboolean two=false;\n\t\t\tboolean three=false;\n\t\t\tfor(int s=0;s<14;s++){\n\t\t\t\tif(cards[s]==3)three=true;\n\t\t\t\tif(cards[s]==2)two=true;\n\t\t\t}\n\t\t\treturn three&&two;\n\t\t}\n\t\t\n\t\tboolean straight(){\n\t\t\tif(cards[1]==1&&cards[13]==1&&cards[12]==1&&cards[11]==1&&cards[10]==1)return true;\n\t\t\tfor(int i=5;i<14;i++){\n\t\t\t\tif(cards[i]==1&&cards[i-1]==1&&cards[i-2]==1&&cards[i-3]==1&&cards[i-4]==1)return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tboolean three(){\n\t\t\tint three=0;\n\t\t\tfor(int i=0;i<14;i++)if(cards[i]==3)three++;\t\t\t\n\t\t\tif(three==1)return true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tboolean two(){\n\t\t\tint two=0;\n\t\t\tfor(int i=0;i<14;i++)if(cards[i]==2)two++;\t\t\t\n\t\t\tif(two==2)return true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tboolean one(){\n\t\t\tint two=0;\n\t\t\tfor(int i=0;i<14;i++)if(cards[i]==2)two++;\t\t\t\n\t\t\tif(two==1)return true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tpublic AOJ0038() {\n\t\t\tScanner in = new Scanner(System.in);\n\t\t\twhile (in.hasNext()) {\n\t\t\t\tString[] input = in.nextLine().split(\",\");\n\t\t\t\tint[] huda = new int[input.length];\n\t\t\t\tfor(int i=0;i result;\n\t\tint back[];\n\t\tint[][] cost;\n\t\tvoid dijkstra(int s,int g){\n\t\t\td = new int[n+1];d[s]=0;\n\t\t\tArrays.fill(d,0);\n\t\t\tboolean used[] = new boolean[n+1];\n\t\t\tint sumn[] = new int[n+1];\n\t\t\tint v=s;\n\t\t\tint save = -1;\n\t\t\tback = new int[n+1];\n\t\t\twhile(true){\n\t\t\t\tsave = v;\n\t\t\t\tv=-1;\n\t\t\t\tfor(int u=1;u();\n\t\t\tint a=0;\n\t\t\t//\t\t\tfor(int i=0;i 50 ? 1000000:costs;\n\t\t\t\t\t\tcost[s][i] = cost[i][s];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tint kai = in.nextInt();\n\t\t\t\tfor(int i=0;i=0;a--){\n\t\t\t\t\t\tSystem.out.print(result.get(a)+\" \");\n\t\t\t\t\t}\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1386403090, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00038.html", "problem_id": "p00038", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00038/input.txt", "sample_output_relpath": "derived/input_output/data/p00038/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00038/Java/s185692082.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s185692082", "user_id": "u724424933"}, "prompt_components": {"gold_output": "one pair\ntwo pair\nthree card\nfull house\nfour card\nstraight\nstraight\nnull\n", "input_to_evaluate": "import java.awt.CardLayout;\nimport java.awt.geom.Point2D;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main {\t\n\tpublic static void main(String[] args){\n\t\tnew Main();\n\t}\n\tpublic Main(){\n\t\tnew AOJ0038();\n\t}\n\t\n\tclass AOJ0038{\n\t\tint [] cards;\n\t\t\n\t\tboolean four(){\n\t\t\tfor(int i=0;i<14;i++)if(cards[i]>=4)return true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tboolean full(){\n\t\t\tboolean two=false;\n\t\t\tboolean three=false;\n\t\t\tfor(int s=0;s<14;s++){\n\t\t\t\tif(cards[s]==3)three=true;\n\t\t\t\tif(cards[s]==2)two=true;\n\t\t\t}\n\t\t\treturn three&&two;\n\t\t}\n\t\t\n\t\tboolean straight(){\n\t\t\tif(cards[1]==1&&cards[13]==1&&cards[12]==1&&cards[11]==1&&cards[10]==1)return true;\n\t\t\tfor(int i=5;i<14;i++){\n\t\t\t\tif(cards[i]==1&&cards[i-1]==1&&cards[i-2]==1&&cards[i-3]==1&&cards[i-4]==1)return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tboolean three(){\n\t\t\tint three=0;\n\t\t\tfor(int i=0;i<14;i++)if(cards[i]==3)three++;\t\t\t\n\t\t\tif(three==1)return true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tboolean two(){\n\t\t\tint two=0;\n\t\t\tfor(int i=0;i<14;i++)if(cards[i]==2)two++;\t\t\t\n\t\t\tif(two==2)return true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tboolean one(){\n\t\t\tint two=0;\n\t\t\tfor(int i=0;i<14;i++)if(cards[i]==2)two++;\t\t\t\n\t\t\tif(two==1)return true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tpublic AOJ0038() {\n\t\t\tScanner in = new Scanner(System.in);\n\t\t\twhile (in.hasNext()) {\n\t\t\t\tString[] input = in.nextLine().split(\",\");\n\t\t\t\tint[] huda = new int[input.length];\n\t\t\t\tfor(int i=0;i result;\n\t\tint back[];\n\t\tint[][] cost;\n\t\tvoid dijkstra(int s,int g){\n\t\t\td = new int[n+1];d[s]=0;\n\t\t\tArrays.fill(d,0);\n\t\t\tboolean used[] = new boolean[n+1];\n\t\t\tint sumn[] = new int[n+1];\n\t\t\tint v=s;\n\t\t\tint save = -1;\n\t\t\tback = new int[n+1];\n\t\t\twhile(true){\n\t\t\t\tsave = v;\n\t\t\t\tv=-1;\n\t\t\t\tfor(int u=1;u();\n\t\t\tint a=0;\n\t\t\t//\t\t\tfor(int i=0;i 50 ? 1000000:costs;\n\t\t\t\t\t\tcost[s][i] = cost[i][s];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tint kai = in.nextInt();\n\t\t\t\tfor(int i=0;i=0;a--){\n\t\t\t\t\t\tSystem.out.print(result.get(a)+\" \");\n\t\t\t\t\t}\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "ポーカー\n\nポーカーの手札データを読み込んで、それぞれについてその役を出力するプログラムを作成してください。ただし、この問題では、以下のルールに従います。\n\nポーカーはトランプ 5 枚で行う競技です。\n\n同じ数字のカードは 5 枚以上ありません。\n\nジョーカーは無いものとします。\n\n以下のポーカーの役だけを考えるものとします。(番号が大きいほど役が高くなります。)\n\n役なし(以下に挙げるどれにも当てはまらない)\n\nワンペア（2 枚の同じ数字のカードが1 組ある）\n\nツーペア（2 枚の同じ数字のカードが2 組ある）\n\nスリーカード（3 枚の同じ数字のカードが1 組ある）\n\nストレート（5 枚のカードの数字が連続している）\n\nただし、A を含むストレートの場合、A で終わる並びもストレートとします。つまり、A を含むストレート\nは、A 2 3 4 5 　と　10 J Q K A 　の２種類です。J Q K A 2 などのように、A をまたぐ並び\nはストレートではありません。（この場合、「役なし」になります）。\n\nフルハウス（3 枚の同じ数字のカードが1 組と、残りの2 枚が同じ数字のカード）\n\nフォーカード（4 枚の同じ数字のカードが1 組ある）\n\nInput\n\n入力は複数のデータセットからなります。各データセットは以下の形式で与えられます。\n\n手札1,手札2,手札3,手札4,手札5\n\n手札は、トランプのJ(ジャック) を11、Q(クイーン) を12、K(キング) を13、A（エース）を 1、その他はそれぞれの数字で表すこととします。\n\nデータセットの数は 50 を超えません。\n\nOutput\n\nデータセットごとに、手札によってできる最も高い役をひとつ出力してください。役の表記については出力例に従ってください。\n\nSample Input\n\n1,2,3,4,1\n2,3,2,3,12\n12,13,11,12,12\n7,6,7,6,7\n3,3,2,3,3\n6,7,8,9,10\n11,12,10,1,13\n11,12,13,1,2\n\nOutput for the Sample Input\n\none pair\ntwo pair\nthree card\nfull house\nfour card\nstraight\nstraight\nnull\n\n3 3 2 3 3 という手札であったときは、two pair ではなく four card です。", "sample_input": "1,2,3,4,1\n2,3,2,3,12\n12,13,11,12,12\n7,6,7,6,7\n3,3,2,3,3\n6,7,8,9,10\n11,12,10,1,13\n11,12,13,1,2\n"}, "reference_outputs": ["one pair\ntwo pair\nthree card\nfull house\nfour card\nstraight\nstraight\nnull\n"], "source_document_id": "p00038", "source_text": "ポーカー\n\nポーカーの手札データを読み込んで、それぞれについてその役を出力するプログラムを作成してください。ただし、この問題では、以下のルールに従います。\n\nポーカーはトランプ 5 枚で行う競技です。\n\n同じ数字のカードは 5 枚以上ありません。\n\nジョーカーは無いものとします。\n\n以下のポーカーの役だけを考えるものとします。(番号が大きいほど役が高くなります。)\n\n役なし(以下に挙げるどれにも当てはまらない)\n\nワンペア（2 枚の同じ数字のカードが1 組ある）\n\nツーペア（2 枚の同じ数字のカードが2 組ある）\n\nスリーカード（3 枚の同じ数字のカードが1 組ある）\n\nストレート（5 枚のカードの数字が連続している）\n\nただし、A を含むストレートの場合、A で終わる並びもストレートとします。つまり、A を含むストレート\nは、A 2 3 4 5 　と　10 J Q K A 　の２種類です。J Q K A 2 などのように、A をまたぐ並び\nはストレートではありません。（この場合、「役なし」になります）。\n\nフルハウス（3 枚の同じ数字のカードが1 組と、残りの2 枚が同じ数字のカード）\n\nフォーカード（4 枚の同じ数字のカードが1 組ある）\n\nInput\n\n入力は複数のデータセットからなります。各データセットは以下の形式で与えられます。\n\n手札1,手札2,手札3,手札4,手札5\n\n手札は、トランプのJ(ジャック) を11、Q(クイーン) を12、K(キング) を13、A（エース）を 1、その他はそれぞれの数字で表すこととします。\n\nデータセットの数は 50 を超えません。\n\nOutput\n\nデータセットごとに、手札によってできる最も高い役をひとつ出力してください。役の表記については出力例に従ってください。\n\nSample Input\n\n1,2,3,4,1\n2,3,2,3,12\n12,13,11,12,12\n7,6,7,6,7\n3,3,2,3,3\n6,7,8,9,10\n11,12,10,1,13\n11,12,13,1,2\n\nOutput for the Sample Input\n\none pair\ntwo pair\nthree card\nfull house\nfour card\nstraight\nstraight\nnull\n\n3 3 2 3 3 という手札であったときは、two pair ではなく four card ���す。", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4894, "cpu_time_ms": 50, "memory_kb": 17200}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s576671874", "group_id": "codeNet:p00039", "input_text": "\nimport java.util.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\npublic class Main {\n\n\tint INF = 1 << 28;\n\t\n\t\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tHashMap map = new HashMap();\n\t\tmap.put('I', 1); map.put('V', 5); map.put('X', 10);\n\t\tmap.put('L', 50); map.put('C', 100); map.put('D', 500); map.put('M', 1000);\n\t\twhile(sc.hasNext()) {\n\t\t\tString str = sc.next();\n\t\t\tint ans = 0, c = 1, buf = 0;\n\t\t\tfor(int i=str.length()-1;i>=0;i--) {\n\t\t\t\tint val = map.get(str.charAt(i));\n\t\t\t\tif( buf > val ) c = -1;\n\t\t\t\tif( buf < val ) c = 1;\n\t\t\t\tans += c*val;\n\t\t\t\tbuf = val;\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tvoid debug(Object... os) {\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n}", "language": "Java", "metadata": {"date": 1342946370, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00039.html", "problem_id": "p00039", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00039/input.txt", "sample_output_relpath": "derived/input_output/data/p00039/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00039/Java/s576671874.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s576671874", "user_id": "u358879127"}, "prompt_components": {"gold_output": "4\n499\n499\n", "input_to_evaluate": "\nimport java.util.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\npublic class Main {\n\n\tint INF = 1 << 28;\n\t\n\t\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tHashMap map = new HashMap();\n\t\tmap.put('I', 1); map.put('V', 5); map.put('X', 10);\n\t\tmap.put('L', 50); map.put('C', 100); map.put('D', 500); map.put('M', 1000);\n\t\twhile(sc.hasNext()) {\n\t\t\tString str = sc.next();\n\t\t\tint ans = 0, c = 1, buf = 0;\n\t\t\tfor(int i=str.length()-1;i>=0;i--) {\n\t\t\t\tint val = map.get(str.charAt(i));\n\t\t\t\tif( buf > val ) c = -1;\n\t\t\t\tif( buf < val ) c = 1;\n\t\t\t\tans += c*val;\n\t\t\t\tbuf = val;\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tvoid debug(Object... os) {\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n}", "problem_context": "ローマ数字\n\n古代ローマでは数を数えることは難しい仕事でした。アラビア数字の 0,1,2,3,…, 9 はまだ流布していませんでした。その代わり次のような記号が使われていました。\n\nアラビア数字\n\nローマ数字\n\nアラビア数字\n\nローマ数字\n\nアラビア数字\n\nローマ数字\n\n1\n\nI\n\n11\nXI\n\n30\n\nXXX\n\n2\n\nII\n\n12\nXII\n\n40\n\nXL\n\n3\n\nIII\n\n13\nXIII\n\n50\n\nL\n\n4\n\nIV\n\n14\nXIV\n\n60\n\nLX\n\n5\n\nV\n\n15\nXV\n\n70\n\nLXX\n\n6\n\nVI\n\n16\nXVI\n\n80\n\nLXXX\n\n7\n\nVII\n\n17\nXVII\n\n90\n\nXC\n\n8\n\nVIII\n\n18\nXVIII\n\n100\n\nC\n\n9\n\nIX\n\n19\nXIX\n\n500\n\nD\n\n10\n\nX\n\n20\nXX\n\n1000\n\nM\n\nI は 1、 V は 5、 X は 10、 L は 50、 C は 100、 D は 500、 M は 1000、 他の例は上の表を見てください。小さい数が大きい数に続いている、つまり右側にあるときは足し算をします。小さい数が大きい数の前に、つまり左にあるときは、大きい数から小さい数を引きます。大きい数字の前にあって引き算を表す小さな数字は一回の引き算あたりひとつしかありません。\n\nローマ数字をアラビア数字（通常の数字）の表記（10 進表示）に変換して出力するプログラムを作成してください。ただし、与えられるローマ数字は上記のルールにのみ従っています(実際のローマ数字の表記にはもっと細かいルールがありますが、ここでは考慮する必要はありません。たとえば、実際のローマ数字ではI はV かX から、X はL かC から、C はD かM からしか引き算しませんし、同じローマ数字は４つ以上（または５つ以上）足し並べることはありません。)\n\nInput\n\n複数のデータセットが与えられます。それぞれのデータセットにローマ数字（半角大文字のI, V, X, L, C, D ,M で表される連続した文字列）が１行に与えられます。与えられるローマ数字の文字列の長さはおのおの 100 以下です。\n\nデータセットの数は 50 を超えません。\n\nOutput\n\n各データセットに対し、アラビア数字（整数）を１行に出力して下さい。\n\nSample Input\n\nIV\nCCCCLXXXXVIIII\nCDXCIX\n\nOutput for the Sample Input\n\n4\n499\n499", "sample_input": "IV\nCCCCLXXXXVIIII\nCDXCIX\n"}, "reference_outputs": ["4\n499\n499\n"], "source_document_id": "p00039", "source_text": "ローマ数字\n\n古代ローマでは数を数えることは難しい仕事でした。アラビア数字の 0,1,2,3,…, 9 はまだ流布していませんでした。その代わり次のような記号が使われていました。\n\nアラビア数字\n\nローマ数字\n\nアラビア数字\n\nローマ数字\n\nアラビア数字\n\nローマ数字\n\n1\n\nI\n\n11\nXI\n\n30\n\nXXX\n\n2\n\nII\n\n12\nXII\n\n40\n\nXL\n\n3\n\nIII\n\n13\nXIII\n\n50\n\nL\n\n4\n\nIV\n\n14\nXIV\n\n60\n\nLX\n\n5\n\nV\n\n15\nXV\n\n70\n\nLXX\n\n6\n\nVI\n\n16\nXVI\n\n80\n\nLXXX\n\n7\n\nVII\n\n17\nXVII\n\n90\n\nXC\n\n8\n\nVIII\n\n18\nXVIII\n\n100\n\nC\n\n9\n\nIX\n\n19\nXIX\n\n500\n\nD\n\n10\n\nX\n\n20\nXX\n\n1000\n\nM\n\nI は 1、 V は 5、 X は 10、 L は 50、 C は 100、 D は 500、 M は 1000、 他の例は上の表を見てください。小さい数が大きい数に続いている、つまり右側にあるときは足し算をします。小さい数が大きい数の前に、つまり左にあるときは、大きい数から小さい数を引きます。大きい数字の前にあって引き算を表す小さな数字は一回の引き算あたりひとつしかありません。\n\nローマ数字をアラビア数字（通常の数字）の表記（10 進表示）に変換して出力するプログラムを作成してください。ただし、与えられるローマ数字は上記のルールにのみ従っています(実際のローマ数字の表記にはもっと細かいルールがありますが、ここでは考慮する必要はありません。たとえば、実際のローマ数字ではI はV かX から、X はL かC から、C はD かM からしか引き算しませんし、同じローマ数字は４つ以上（または５つ以上）足し並べることはありません。)\n\nInput\n\n複数のデータセットが与えられます。それぞれのデータセットにローマ数字（半角大文字のI, V, X, L, C, D ,M で表される連続した文字列）が１行に与えられます。与えられるローマ数字の文字列の長さはおのおの 100 以下です。\n\nデータセットの数は 50 を超えません。\n\nOutput\n\n各データセットに対し、アラビア数字（整数）を１行に出力して下さい。\n\nSample Input\n\nIV\nCCCCLXXXXVIIII\nCDXCIX\n\nOutput for the Sample Input\n\n4\n499\n499", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 824, "cpu_time_ms": 90, "memory_kb": 12000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s473129810", "group_id": "codeNet:p00040", "input_text": "import java.util.Scanner;\npublic class Main {\n public static void main (String[] args) {\n\tScanner scan = new Scanner(System.in);\n\tint n = Integer.parseInt(scan.nextLine());\n\tString cipherText;\n\tfor (int i = 0; i < n; i++) {\n\t cipherText = scan.nextLine();\n\t solve(cipherText);\n\t}\n }\n static void solve (String cipherText) {\n\tint[] alpa = {1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25};\n\tfor (int i = 0; i < alpa.length; i++) {\n\t int a = alpa[i];\n\t for (int b = 0; b < 26; b++) {\n\t\tif (cipherText.contains(encode(\"this\", a, b)) || cipherText.contains(encode(\"that\", a, b))) {\n\t\t System.out.println(decode(cipherText, a, b));\n\t\t return;\n\t\t}\n\t }\n\t}\n }\n \n static String encode (String plainText, int a, int b) {\n\tStringBuilder sb = new StringBuilder();\n\tfor (int i = 0; i < plainText.length(); i++) {\n\t char c = plainText.charAt(i);\n\t sb.append((char)((a * (c - 'a') + b) % 26 + 'a'));\n\t}\n\treturn sb.toString();\n }\n\n static String decode (String cipherText, int a, int b) {\n\tStringBuilder sb = new StringBuilder();\n\tint[] table = new int[26];\n\tfor (int i = 0; i < 26; i++) {\n\t int n = (a * i + b) % 26;\n\t table[n] = i;\n\t}\n\tfor (int i = 0; i < cipherText.length(); i++) {\n\t char c = cipherText.charAt(i);\n\t if (c == ' ') {\n\t\tsb.append(c);\n\t } else {\n\t\tsb.append((char)(table[c - 'a'] + 'a'));\n\t }\n\t}\n\treturn sb.toString();\n }\n}", "language": "Java", "metadata": {"date": 1459398176, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00040.html", "problem_id": "p00040", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00040/input.txt", "sample_output_relpath": "derived/input_output/data/p00040/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00040/Java/s473129810.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s473129810", "user_id": "u377778881"}, "prompt_components": {"gold_output": "i submit that there is another point of view\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n public static void main (String[] args) {\n\tScanner scan = new Scanner(System.in);\n\tint n = Integer.parseInt(scan.nextLine());\n\tString cipherText;\n\tfor (int i = 0; i < n; i++) {\n\t cipherText = scan.nextLine();\n\t solve(cipherText);\n\t}\n }\n static void solve (String cipherText) {\n\tint[] alpa = {1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25};\n\tfor (int i = 0; i < alpa.length; i++) {\n\t int a = alpa[i];\n\t for (int b = 0; b < 26; b++) {\n\t\tif (cipherText.contains(encode(\"this\", a, b)) || cipherText.contains(encode(\"that\", a, b))) {\n\t\t System.out.println(decode(cipherText, a, b));\n\t\t return;\n\t\t}\n\t }\n\t}\n }\n \n static String encode (String plainText, int a, int b) {\n\tStringBuilder sb = new StringBuilder();\n\tfor (int i = 0; i < plainText.length(); i++) {\n\t char c = plainText.charAt(i);\n\t sb.append((char)((a * (c - 'a') + b) % 26 + 'a'));\n\t}\n\treturn sb.toString();\n }\n\n static String decode (String cipherText, int a, int b) {\n\tStringBuilder sb = new StringBuilder();\n\tint[] table = new int[26];\n\tfor (int i = 0; i < 26; i++) {\n\t int n = (a * i + b) % 26;\n\t table[n] = i;\n\t}\n\tfor (int i = 0; i < cipherText.length(); i++) {\n\t char c = cipherText.charAt(i);\n\t if (c == ' ') {\n\t\tsb.append(c);\n\t } else {\n\t\tsb.append((char)(table[c - 'a'] + 'a'));\n\t }\n\t}\n\treturn sb.toString();\n }\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nアフィン暗号\n\n簡単な暗号法の一つに、アフィン暗号というものがあります。まず、アルファベット a〜z を a = 0, b = 1, c = 2,..., x = 23, y = 24, z = 25 と 0〜25 の数字に置き換えます。そして、以下の式で、原文のアルファベットを置換します。\n\n$F(\\gamma) = (\\alpha \\cdot \\gamma + \\beta)$ mod $26$\n\nただし、mod 26 は 26 で割った余りを表します。例えば、$\\alpha = 3, \\beta = 2$ のとき、アルファベットの 'a' (=0) は、$F(0) = (3 \\cdot 0 + 2)$ mod $26 = 2$ で 'c' に、アルファベットの 'n' (=13) は $F(13) = (3 \\cdot 13 + 2)$ mod $26 = 15$ で 'p' に置換されます。\nこのとき、$\\gamma$ に対する $F(\\gamma)$ が必ず 1 対 1 で対応付けられるように、$\\alpha$ と $\\beta$ は慎重に選ばれているものとします（$\\alpha$ と 26 が互いに素であることが条件）。$\\alpha = 4, \\beta = 7$ のときのように、$F('a') = 7, F('n') = 7$ と、'a' も 'n' も同じ 'h' に置換されるようなことはありません。また、アルファベット以外の文字は置換されません。\n\n暗号化された文字列を元の文章に復号したものを出力するプログラムを作成してください。元の文章には、キーワードとして\n\nthat\nthis\n\nのいずれかが必ず含まれているものとします。\n\nInput\n\n複数のデータセットが与えられます。１行目にデータセット数 $n$ ($n \\leq 30$) が与えられます。続いて $n$ 行のデータが与えられます。各データセットに英小文字と空白からなる 256 文字以内の暗号化された文章が１行に与えられます。\n\nOutput\n\n各データセットに対して、復号した元の文章を１行に出力して下さい。\n\nSample Input\n\n1\ny eazqyp pnop pngtg ye obmpngt xmybp mr lygw\n\nOutput for the Sample Input\n\ni submit that there is another point of view", "sample_input": "1\ny eazqyp pnop pngtg ye obmpngt xmybp mr lygw\n"}, "reference_outputs": ["i submit that there is another point of view\n"], "source_document_id": "p00040", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nアフィン暗号\n\n簡単な暗号法の一つに、アフィン暗号というものがあります。まず、アルファベット a〜z を a = 0, b = 1, c = 2,..., x = 23, y = 24, z = 25 と 0〜25 の数字に置き換えます。そして、以下の式で、原文のアルファベットを置換します。\n\n$F(\\gamma) = (\\alpha \\cdot \\gamma + \\beta)$ mod $26$\n\nただし、mod 26 は 26 で割った余りを表します。例えば、$\\alpha = 3, \\beta = 2$ のとき、アルファベットの 'a' (=0) は、$F(0) = (3 \\cdot 0 + 2)$ mod $26 = 2$ で 'c' に、アルファベットの 'n' (=13) は $F(13) = (3 \\cdot 13 + 2)$ mod $26 = 15$ で 'p' に置換されます。\nこのとき、$\\gamma$ に対する $F(\\gamma)$ が必ず 1 対 1 で対応付けられるように、$\\alpha$ と $\\beta$ は慎重に選ばれているものとします（$\\alpha$ と 26 が互いに素であることが条件）。$\\alpha = 4, \\beta = 7$ のときのように、$F('a') = 7, F('n') = 7$ と、'a' も 'n' も同じ 'h' に置換されるようなことはありません。また、アルファベット以外の文字は置換されません。\n\n暗号化された文字列を元の文章に復号したものを出力するプログラムを作成してください。元の文章には、キーワードとして\n\nthat\nthis\n\nのいずれかが必ず含まれているものとします。\n\nInput\n\n複数のデータセットが与えられます。１行目にデータセット数 $n$ ($n \\leq 30$) が与えられます。続いて $n$ 行のデータが与えられます。各データセットに英小文字と空白からなる 256 文字以内の暗号化された文章が１行に与えられます。\n\nOutput\n\n各データセットに対して、復号した元の文章を１行に出力して下さい。\n\nSample Input\n\n1\ny eazqyp pnop pngtg ye obmpngt xmybp mr lygw\n\nOutput for the Sample Input\n\ni submit that there is another point of view", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1391, "cpu_time_ms": 60, "memory_kb": 26356}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s362039030", "group_id": "codeNet:p00043", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tstatic char[] array = new char[13];\n\n\tpublic static void main(String[] args) {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line = null;\n\n\t\ttry {\n\t\t\twhile ((line = br.readLine()) != null) {\n\t\t\t\tline = line.trim();\n\t\t\t\tarray = line.toCharArray();\n\t\t\t\tint[] numCount = new int[10];\n\t\t\t\tfor (int i = 0; i < array.length; i++) {\n\t\t\t\t\tnumCount[array[i] - '0']++;\n\t\t\t\t}\n\t\t\t\tString ans = \"0\";\n\t\t\t\tfor (int i = 1; i <= 9; i++) {\n\t\t\t\t\tif (numCount[i] == 4)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tsearchHead: for (int j = 1; j <= 9; j++) {\n\t\t\t\t\t\tint[] num = numCount.clone();\n\t\t\t\t\t\tnum[i]++;\n\t\t\t\t\t\tif (num[j] - 2 < 0)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tnum[j] -= 2;\n\t\t\t\t\t\t// 順子チェック\n\t\t\t\t\t\tfor (int k = 1; k <= 7; k++) {\n\t\t\t\t\t\t\tif (num[k] < 0)\n\t\t\t\t\t\t\t\tcontinue searchHead;\n\t\t\t\t\t\t\tint surplus = num[k] % 3;\n\t\t\t\t\t\t\tif (surplus != 0) {\n\t\t\t\t\t\t\t\tnum[k] -= surplus;\n\t\t\t\t\t\t\t\tnum[k + 1] -= surplus;\n\t\t\t\t\t\t\t\tnum[k + 2] -= surplus;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// 8と9は0か3\n\t\t\t\t\t\tif (((num[8] % 3) + (num[9] % 3)) == 0 && num[8] >= 0 && num[9] >= 0) {\n\t\t\t\t\t\t\tif (ans.equals(\"0\")) {\n\t\t\t\t\t\t\t\tans = Integer.toString(i);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tans += \" \" + Integer.toString(i);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak searchHead;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println(ans);\n\t\t\t}\n\t\t\tbr.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1391502664, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00043.html", "problem_id": "p00043", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00043/input.txt", "sample_output_relpath": "derived/input_output/data/p00043/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00043/Java/s362039030.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s362039030", "user_id": "u306553775"}, "prompt_components": {"gold_output": "2 3 5 8\n3 4\n1 2 3 4 5 6 7 8 9\n7 8 9\n1 2 3 4 6 7 8\n0\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tstatic char[] array = new char[13];\n\n\tpublic static void main(String[] args) {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line = null;\n\n\t\ttry {\n\t\t\twhile ((line = br.readLine()) != null) {\n\t\t\t\tline = line.trim();\n\t\t\t\tarray = line.toCharArray();\n\t\t\t\tint[] numCount = new int[10];\n\t\t\t\tfor (int i = 0; i < array.length; i++) {\n\t\t\t\t\tnumCount[array[i] - '0']++;\n\t\t\t\t}\n\t\t\t\tString ans = \"0\";\n\t\t\t\tfor (int i = 1; i <= 9; i++) {\n\t\t\t\t\tif (numCount[i] == 4)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tsearchHead: for (int j = 1; j <= 9; j++) {\n\t\t\t\t\t\tint[] num = numCount.clone();\n\t\t\t\t\t\tnum[i]++;\n\t\t\t\t\t\tif (num[j] - 2 < 0)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tnum[j] -= 2;\n\t\t\t\t\t\t// 順子チェック\n\t\t\t\t\t\tfor (int k = 1; k <= 7; k++) {\n\t\t\t\t\t\t\tif (num[k] < 0)\n\t\t\t\t\t\t\t\tcontinue searchHead;\n\t\t\t\t\t\t\tint surplus = num[k] % 3;\n\t\t\t\t\t\t\tif (surplus != 0) {\n\t\t\t\t\t\t\t\tnum[k] -= surplus;\n\t\t\t\t\t\t\t\tnum[k + 1] -= surplus;\n\t\t\t\t\t\t\t\tnum[k + 2] -= surplus;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// 8と9は0か3\n\t\t\t\t\t\tif (((num[8] % 3) + (num[9] % 3)) == 0 && num[8] >= 0 && num[9] >= 0) {\n\t\t\t\t\t\t\tif (ans.equals(\"0\")) {\n\t\t\t\t\t\t\t\tans = Integer.toString(i);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tans += \" \" + Integer.toString(i);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak searchHead;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println(ans);\n\t\t\t}\n\t\t\tbr.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n}", "problem_context": "パズル\n\n1 〜 9 の数字を 14 個組み合わせて完成させるパズルがあります。与えられた 13 個の数字にもうひとつ数字を付け加えて完成させます。\n\nパズルの完成条件は\n\n同じ数字を２つ組み合わせたものが必ずひとつ必要です。\n\n残りの12 個の数字は、３個の数字の組み合わせ４つです。\n\n３個の数字の組み合わせ方は、同じ数字を３つ組み合わせたものか、または３つの連続する数字を組み合わせたものです。ただし、9 1 2 のような並びは連続する数字とは認められません。\n\n同じ数字は4 回まで使えます。\n\n13 個の数字からなる文字列を読み込んで、パズルを完成することができる数字を昇順に全て出力するプログラムを作成してください。なお、1〜9 のどの数字を付け加えてもパズルを完成させることができないときは 0 を出力してください。\n\n例えば与えられた文字列が 3456666777999 の場合\n\n「2」があれば、　234 567 666 77 999\n\n「3」があれば、　33 456 666 777 999\n\n「5」があれば、　345 567 666 77 999\n\n「8」があれば、　345 666 678 77 999\n\nというふうに、2 3 5 8 のいずれかの数字が付け加えられるとパズルは完成します。「6」でも整いますが、5 回目の使用になるので、この例では使えないことに注意してください。\n\nInput\n\n入力は複数のデータセットからなります。各データセットとして、13 個の数字が１行に与えられます。データセットの数は 50 を超えません。\n\nOutput\n\nデータセットごとに、パズルを完成させることができる数字を昇順に空白区切りで１行に出力します。\n\nSample Input\n\n3649596966777\n6358665788577\n9118992346175\n9643871425498\n7755542764533\n1133557799246\n\nOutput for the Sample Input\n\n2 3 5 8\n3 4\n1 2 3 4 5 6 7 8 9\n7 8 9\n1 2 3 4 6 7 8\n0", "sample_input": "3649596966777\n6358665788577\n9118992346175\n9643871425498\n7755542764533\n1133557799246\n"}, "reference_outputs": ["2 3 5 8\n3 4\n1 2 3 4 5 6 7 8 9\n7 8 9\n1 2 3 4 6 7 8\n0\n"], "source_document_id": "p00043", "source_text": "パズル\n\n1 〜 9 の数字を 14 個組み合わせて完成させるパズルがあります。与えられた 13 個の数字にもうひとつ数字を付け加えて完成させます。\n\nパズルの完成条件は\n\n同じ数字を２つ組み合わせたものが必ずひとつ必要です。\n\n残りの12 個の数字は、３個の数字の組み合わせ４つです。\n\n３個の数字の組み合わせ方は、同じ数字を３つ組み合わせたものか、または３つの連続する数字を組み合わせたものです。ただし、9 1 2 のような並びは連続する数字とは認められません。\n\n同じ数字は4 回まで使えます。\n\n13 個の数字からなる文字列を読み込んで、パズルを完成することができる数字を昇順に全て出力するプログラムを作成してください。なお、1〜9 のどの数字を付け加えてもパズルを完成させることができないときは 0 を出力してください。\n\n例えば与えられた文字列が 3456666777999 の場合\n\n「2」があれば、　234 567 666 77 999\n\n「3」があれば、　33 456 666 777 999\n\n「5」があれば、　345 567 666 77 999\n\n「8」があれば、　345 666 678 77 999\n\nというふうに、2 3 5 8 のいずれかの数字が付け加えられるとパズルは完成します。「6」でも整いますが、5 回目の使用になるので、この例では使えないことに注意してください。\n\nInput\n\n入力は複数のデータセットからなります。各データセットとして、13 個の数字が１行に与えられます。データセットの数は 50 を超えません。\n\nOutput\n\nデータセットごとに、パズルを完成させることができる数字を昇順に空白区切りで１行に出力します。\n\nSample Input\n\n3649596966777\n6358665788577\n9118992346175\n9643871425498\n7755542764533\n1133557799246\n\nOutput for the Sample Input\n\n2 3 5 8\n3 4\n1 2 3 4 5 6 7 8 9\n7 8 9\n1 2 3 4 6 7 8\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1452, "cpu_time_ms": 30, "memory_kb": 17076}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s812545330", "group_id": "codeNet:p00044", "input_text": "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt();\n\t\t\tfor(int i=n-1;i>=0;i--){\n\t\t\t\tboolean flag=true;\n\t\t\t\tfor(int j=2;j=0;i--){\n\t\t\t\tboolean flag=true;\n\t\t\t\tfor(int j=2;j list = new ArrayList();\n\t\t\n\t\tint n,count;\n\t\tboolean is;\n\t\t\n\t\twhile(true){\n\t\t\t\n\t\t\tn = sc.nextInt();\n\t\t\tif(n == 0)break;\n\t\t\tcount = 0;\n\t\t\t\n\t\t\tfor(int i = 2; i < n; i++){\n\t\t\t\tis = true;\n\t\t\t\tfor(int j = 2; j <= Math.sqrt(i); j++)\n\t\t\t\t\tif(i % j == 0){\n\t\t\t\t\t\tis = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(is)list.add(i);\n\t\t\t}\n\t\t\tfor(int i = 0; i < list.size(); i++)\n\t\t\t\tfor(int j = i; j < list.size(); j++)\n\t\t\t\t\tif(list.get(i) + list.get(j) == n)count++;\n\t\t\t\n\t\t\tSystem.out.println(count);\n\t\t\tlist.clear();\n\t\t}\n\t\tsc.close();\n\t\t}\n}", "language": "Java", "metadata": {"date": 1441175701, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00056.html", "problem_id": "p00056", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00056/input.txt", "sample_output_relpath": "derived/input_output/data/p00056/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00056/Java/s717158820.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s717158820", "user_id": "u489809100"}, "prompt_components": {"gold_output": "2\n0\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Scanner;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tArrayList list = new ArrayList();\n\t\t\n\t\tint n,count;\n\t\tboolean is;\n\t\t\n\t\twhile(true){\n\t\t\t\n\t\t\tn = sc.nextInt();\n\t\t\tif(n == 0)break;\n\t\t\tcount = 0;\n\t\t\t\n\t\t\tfor(int i = 2; i < n; i++){\n\t\t\t\tis = true;\n\t\t\t\tfor(int j = 2; j <= Math.sqrt(i); j++)\n\t\t\t\t\tif(i % j == 0){\n\t\t\t\t\t\tis = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(is)list.add(i);\n\t\t\t}\n\t\t\tfor(int i = 0; i < list.size(); i++)\n\t\t\t\tfor(int j = i; j < list.size(); j++)\n\t\t\t\t\tif(list.get(i) + list.get(j) == n)count++;\n\t\t\t\n\t\t\tSystem.out.println(count);\n\t\t\tlist.clear();\n\t\t}\n\t\tsc.close();\n\t\t}\n}", "problem_context": "ゴールドバッハの予想\n\n4 以上の偶数は 2 つの素数の和で表すことができるということが知られています。これはゴールドバッハ予想といい、コンピュータの計算によりかなり大きな数まで正しいことが確かめられています。例えば、10 は、7 + 3、5 + 5 の 2 通りの素数の和で表すことができます。\n\n整数 n を入力し、n を 2 つの素数の和で表す組み合わせ数が何通りあるかを出力するプログラムを作成してください。ただし、n は 4 以上、50,000 以下とします。また、入力される n は偶数であるとはかぎりません。\n\nInput\n\n複数のデータセットが与えられます。各データセットに n が１行に与えられます。n が 0 のとき入力の最後とします。データセットの数は 10,000 を超えません。\n\nOutput\n\n各データセットに対して、n を 2 つの素数の和で表す組み合わせ数を１行に出力して下さい。\n\nSample Input\n\n10\n11\n0\n\nOutput for the Sample Input\n\n2\n0", "sample_input": "10\n11\n0\n"}, "reference_outputs": ["2\n0\n"], "source_document_id": "p00056", "source_text": "ゴールドバッハの予想\n\n4 以上の偶数は 2 つの素数の和で表すことができるということが知られています。これはゴールドバッハ予想といい、コンピュータの計算によりかなり大きな数まで正しいことが確かめられています。例えば、10 は、7 + 3、5 + 5 の 2 通りの素数の和で表すことができます。\n\n整数 n を入力し、n を 2 つの素数の和で表す組み合わせ数が何通りあるかを出力するプログラムを作成してください。ただし、n は 4 以上、50,000 以下とします。また、入力される n は偶数であるとはかぎりません。\n\nInput\n\n複数のデータセットが与えられます。各データセットに n が１行に与えられます。n が 0 のとき入力の最後とします。データセットの数は 10,000 を超えません。\n\nOutput\n\n各データセットに対して、n を 2 つの素数の和で表す組み合わせ数を１行に出力して下さい。\n\nSample Input\n\n10\n11\n0\n\nOutput for the Sample Input\n\n2\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 698, "cpu_time_ms": 20000, "memory_kb": 57240}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s209337810", "group_id": "codeNet:p00058", "input_text": "import java.util.*;\nimport java.lang.*;\n\nclass Main {\n public static void main(String[] args) {\n\tScanner s = new Scanner(System.in);\n\tdouble ep = 0.000001;\n\twhile(s.hasNext()) {\n\t double[] d = new double[8];\n\t Double ab,cd;\n\t for(int i=0 ; i<8 ; i++)\n\t\td[i] = s.nextDouble();\n\t if((d[2]-d[0]) != 0)\n\t\tab = (d[3]-d[1])/(d[2]-d[0]);\n\t else\n\t\tab = Double.NaN;\n\n\t if((d[6]-d[4]) != 0)\n\t cd = (d[7]-d[5])/(d[6]-d[4]);\n\t else\n\t\tcd = Double.NaN;\n\t String ans;\n\t if ((ab == 0 && cd.isNaN()) || (ab.isNaN() && cd == 0)) {\n\t\tans = \"YES\";\n\t } else {\n\t\tif ((ab*cd + 1.0) < ep)\n\t\t ans = \"YES\";\n\t\telse\n\t\t ans = \"NO\";\n\t }\n\t System.out.println(ans);\n\t System.out.println(ab + \" \" + cd);\n\t}\n }\n}", "language": "Java", "metadata": {"date": 1346404100, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00058.html", "problem_id": "p00058", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00058/input.txt", "sample_output_relpath": "derived/input_output/data/p00058/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00058/Java/s209337810.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s209337810", "user_id": "u205820388"}, "prompt_components": {"gold_output": "YES\nNO\nNO\nYES\n", "input_to_evaluate": "import java.util.*;\nimport java.lang.*;\n\nclass Main {\n public static void main(String[] args) {\n\tScanner s = new Scanner(System.in);\n\tdouble ep = 0.000001;\n\twhile(s.hasNext()) {\n\t double[] d = new double[8];\n\t Double ab,cd;\n\t for(int i=0 ; i<8 ; i++)\n\t\td[i] = s.nextDouble();\n\t if((d[2]-d[0]) != 0)\n\t\tab = (d[3]-d[1])/(d[2]-d[0]);\n\t else\n\t\tab = Double.NaN;\n\n\t if((d[6]-d[4]) != 0)\n\t cd = (d[7]-d[5])/(d[6]-d[4]);\n\t else\n\t\tcd = Double.NaN;\n\t String ans;\n\t if ((ab == 0 && cd.isNaN()) || (ab.isNaN() && cd == 0)) {\n\t\tans = \"YES\";\n\t } else {\n\t\tif ((ab*cd + 1.0) < ep)\n\t\t ans = \"YES\";\n\t\telse\n\t\t ans = \"NO\";\n\t }\n\t System.out.println(ans);\n\t System.out.println(ab + \" \" + cd);\n\t}\n }\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n直交判定\n\n平面上の異なる 4 点、$A (x_A, y_A)$, $B (x_B, y_B)$, $C (x_C, y_C)$, $D (x_D, y_D)$ の座標を読み込んで、直線 $AB$ と $CD$ が直交する場合には YES、直交しない場合には NO と出力するプログラムを作成してください。ここで、「直線」とは線分のことではありません。以下の図を参考にして下さい。\n\nInput\n\n複数のデータセットが与えられます。各データセットの形式は以下のとおりです。\n\n$x_A$ $y_A$ $x_B$ $y_B$ $x_C$ $y_C$ $x_D$ $y_D$\n\n$x_A$, $y_A$, $x_B$, $y_B$, $x_C$, $y_C$, $x_D$, $y_D$ はそれぞれ -100 以上 100 以下であり、各値は小数点以下最大 5 桁までの数字を含む実数で与えられます。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n各データセットに対して、YES または NO を１行に出力して下さい。\n\nSample Input\n\n1.0 1.0 2.0 2.0 0.0 0.0 1.0 -1.0\n0.0 0.0 2.0 0.0 -1.0 2.0 2.0 2.0\n10.0 6.0 3.4 5.2 6.8 9.5 4.3 2.1\n2.5 3.5 2.5 4.5 -3.3 -2.3 6.8 -2.3\n\nOutput for the Sample Input\n\nYES\nNO\nNO\nYES", "sample_input": "1.0 1.0 2.0 2.0 0.0 0.0 1.0 -1.0\n0.0 0.0 2.0 0.0 -1.0 2.0 2.0 2.0\n10.0 6.0 3.4 5.2 6.8 9.5 4.3 2.1\n2.5 3.5 2.5 4.5 -3.3 -2.3 6.8 -2.3\n"}, "reference_outputs": ["YES\nNO\nNO\nYES\n"], "source_document_id": "p00058", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n直交判定\n\n平面上の異なる 4 点、$A (x_A, y_A)$, $B (x_B, y_B)$, $C (x_C, y_C)$, $D (x_D, y_D)$ の座標を読み込んで、直線 $AB$ と $CD$ が直交する場合には YES、直交しない場合には NO と出力するプログラムを作成してください。ここで、「直線」とは線分のことではありません。以下の図を参考にして下さい。\n\nInput\n\n複数のデータセットが与えられます。各データセットの形式は以下のとおりです。\n\n$x_A$ $y_A$ $x_B$ $y_B$ $x_C$ $y_C$ $x_D$ $y_D$\n\n$x_A$, $y_A$, $x_B$, $y_B$, $x_C$, $y_C$, $x_D$, $y_D$ はそれぞれ -100 以上 100 以下であり、各値は小数点以下最大 5 桁までの数字を含む実数で与えられます。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n各データセットに対して、YES または NO を１行に出力して下さい。\n\nSample Input\n\n1.0 1.0 2.0 2.0 0.0 0.0 1.0 -1.0\n0.0 0.0 2.0 0.0 -1.0 2.0 2.0 2.0\n10.0 6.0 3.4 5.2 6.8 9.5 4.3 2.1\n2.5 3.5 2.5 4.5 -3.3 -2.3 6.8 -2.3\n\nOutput for the Sample Input\n\nYES\nNO\nNO\nYES", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 735, "cpu_time_ms": 120, "memory_kb": 12000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s585609200", "group_id": "codeNet:p00058", "input_text": "import java.awt.geom.Point2D;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPoint2D.Double p[];\n\t\tString str[];\n\t\t\n\t\tp = new Point2D.Double[4];\n\t\twhile (sc.hasNext()) {\n\t\t\tstr = sc.nextLine().split(\" \");\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tp[i] = new Point2D.Double(Double.valueOf(str[2 * i]), Double.valueOf(str[2 * i + 1]));\n\t\t\t}\n\t\t\tdouble dx1, dx2, dy1, dy2;\n\t\t\tdx1 = p[1].x - p[0].x;\n\t\t\tdy1 = p[1].y - p[0].y;\n\t\t\tdx2 = p[2].x - p[3].x;\n\t\t\tdy2 = p[2].y - p[3].y;\n\t\t\tif (dx1 * dx2 + dy1 * dy2 == 0) {\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1352581062, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00058.html", "problem_id": "p00058", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00058/input.txt", "sample_output_relpath": "derived/input_output/data/p00058/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00058/Java/s585609200.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s585609200", "user_id": "u026004148"}, "prompt_components": {"gold_output": "YES\nNO\nNO\nYES\n", "input_to_evaluate": "import java.awt.geom.Point2D;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tPoint2D.Double p[];\n\t\tString str[];\n\t\t\n\t\tp = new Point2D.Double[4];\n\t\twhile (sc.hasNext()) {\n\t\t\tstr = sc.nextLine().split(\" \");\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tp[i] = new Point2D.Double(Double.valueOf(str[2 * i]), Double.valueOf(str[2 * i + 1]));\n\t\t\t}\n\t\t\tdouble dx1, dx2, dy1, dy2;\n\t\t\tdx1 = p[1].x - p[0].x;\n\t\t\tdy1 = p[1].y - p[0].y;\n\t\t\tdx2 = p[2].x - p[3].x;\n\t\t\tdy2 = p[2].y - p[3].y;\n\t\t\tif (dx1 * dx2 + dy1 * dy2 == 0) {\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n直交判定\n\n平面上の異なる 4 点、$A (x_A, y_A)$, $B (x_B, y_B)$, $C (x_C, y_C)$, $D (x_D, y_D)$ の座標を読み込んで、直線 $AB$ と $CD$ が直交する場合には YES、直交しない場合には NO と出力するプログラムを作成してください。ここで、「直線」とは線分のことではありません。以下の図を参考にして下さい。\n\nInput\n\n複数のデータセットが与えられます。各データセットの形式は以下のとおりです。\n\n$x_A$ $y_A$ $x_B$ $y_B$ $x_C$ $y_C$ $x_D$ $y_D$\n\n$x_A$, $y_A$, $x_B$, $y_B$, $x_C$, $y_C$, $x_D$, $y_D$ はそれぞれ -100 以上 100 以下であり、各値は小数点以下最大 5 桁までの数字を含む実数で与えられます。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n各データセットに対して、YES または NO を１行に出力して下さい。\n\nSample Input\n\n1.0 1.0 2.0 2.0 0.0 0.0 1.0 -1.0\n0.0 0.0 2.0 0.0 -1.0 2.0 2.0 2.0\n10.0 6.0 3.4 5.2 6.8 9.5 4.3 2.1\n2.5 3.5 2.5 4.5 -3.3 -2.3 6.8 -2.3\n\nOutput for the Sample Input\n\nYES\nNO\nNO\nYES", "sample_input": "1.0 1.0 2.0 2.0 0.0 0.0 1.0 -1.0\n0.0 0.0 2.0 0.0 -1.0 2.0 2.0 2.0\n10.0 6.0 3.4 5.2 6.8 9.5 4.3 2.1\n2.5 3.5 2.5 4.5 -3.3 -2.3 6.8 -2.3\n"}, "reference_outputs": ["YES\nNO\nNO\nYES\n"], "source_document_id": "p00058", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n直交判定\n\n平面上の異なる 4 点、$A (x_A, y_A)$, $B (x_B, y_B)$, $C (x_C, y_C)$, $D (x_D, y_D)$ の座標を読み込んで、直線 $AB$ と $CD$ が直交する場合には YES、直交しない場合には NO と出力するプログラムを作成してください。ここで、「直線」とは線分のことではありません。以下の図を参考にして下さい。\n\nInput\n\n複数のデータセットが与えられます。各データセットの形式は以下のとおりです。\n\n$x_A$ $y_A$ $x_B$ $y_B$ $x_C$ $y_C$ $x_D$ $y_D$\n\n$x_A$, $y_A$, $x_B$, $y_B$, $x_C$, $y_C$, $x_D$, $y_D$ はそれぞれ -100 以上 100 以下であり、各値は小数点以下最大 5 桁までの数字を含む実数で与えられます。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n各データセットに対して、YES または NO を１行に出力して下さい。\n\nSample Input\n\n1.0 1.0 2.0 2.0 0.0 0.0 1.0 -1.0\n0.0 0.0 2.0 0.0 -1.0 2.0 2.0 2.0\n10.0 6.0 3.4 5.2 6.8 9.5 4.3 2.1\n2.5 3.5 2.5 4.5 -3.3 -2.3 6.8 -2.3\n\nOutput for the Sample Input\n\nYES\nNO\nNO\nYES", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 674, "cpu_time_ms": 100, "memory_kb": 12000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s926301238", "group_id": "codeNet:p00061", "input_text": "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[] p = new int[101];\n\t\tint[] s = new int[31];\n\t\twhile(sc.hasNext()) {\n\t\t\tString[] t = sc.next().split(\",\");\n\t\t\tif(t[0].equals(\"0\")) break;\n\t\t\tp[Integer.parseInt(t[0])] = Integer.parseInt(t[1]);\n\t\t\ts[Integer.parseInt(t[1])]++;\n\t\t}\n\t\tint[] r = new int[31];\n\t\tint k = 1;\n\t\tfor(int i = 30; i >= 0; i--) {\n\t\t\tr[i] = k;\n\t\t\tif(s[i] != 0) {\n\t\t\t\tk++;\n\t\t\t}\n\t\t}\n//\t\tfor(int i = 30; i >= 0; i--) {\n//\t\t\tSystem.out.printf(\"%d %d\\n\", i, r[i]);\n//\t\t}\n//\t\tfor(int i = 1; i <= 5; i++) {\n//\t\t\tSystem.out.println(r[p[i]]);\n//\t\t}\n\t\twhile(sc.hasNext()) {\n\t\t\tint q = sc.nextInt();\n\t\t\tSystem.out.println(r[p[q]]);\n\t\t}\n\t\tsc.close();\n\t}\n}\n", "language": "Java", "metadata": {"date": 1551611020, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00061.html", "problem_id": "p00061", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00061/input.txt", "sample_output_relpath": "derived/input_output/data/p00061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00061/Java/s926301238.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s926301238", "user_id": "u876209260"}, "prompt_components": {"gold_output": "2\n2\n3\n3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[] p = new int[101];\n\t\tint[] s = new int[31];\n\t\twhile(sc.hasNext()) {\n\t\t\tString[] t = sc.next().split(\",\");\n\t\t\tif(t[0].equals(\"0\")) break;\n\t\t\tp[Integer.parseInt(t[0])] = Integer.parseInt(t[1]);\n\t\t\ts[Integer.parseInt(t[1])]++;\n\t\t}\n\t\tint[] r = new int[31];\n\t\tint k = 1;\n\t\tfor(int i = 30; i >= 0; i--) {\n\t\t\tr[i] = k;\n\t\t\tif(s[i] != 0) {\n\t\t\t\tk++;\n\t\t\t}\n\t\t}\n//\t\tfor(int i = 30; i >= 0; i--) {\n//\t\t\tSystem.out.printf(\"%d %d\\n\", i, r[i]);\n//\t\t}\n//\t\tfor(int i = 1; i <= 5; i++) {\n//\t\t\tSystem.out.println(r[p[i]]);\n//\t\t}\n\t\twhile(sc.hasNext()) {\n\t\t\tint q = sc.nextInt();\n\t\t\tSystem.out.println(r[p[q]]);\n\t\t}\n\t\tsc.close();\n\t}\n}\n", "problem_context": "Rank Checker\n\n時は2020 年。パソコン甲子園 2020 の予選結果を保存したデータがあります。このデータには、各チームに振られる整理番号と正解数が保存されています。ここでは、正解数で順位を決定するものとし、正解数の多いほうから順に 1 位、2 位 ... と順位をつけていくこととします。\n\n予選結果のデータと整理番号をキーボードから入力して、その番号のチームの順位を出力するプログラムを作成してください。\n\nInput\n\n入力データは２つの部分からなります。前半の部分は、予選結果のデータ、後半の部分は順位を知りたいチーム番号の問い合わせです。予選結果のデータの形式は以下の通りです。\n\np1,s1\np2,s2\n...\n...\n0,0\n\npi (1 ≤ pi ≤ 100 )、 si (0 ≤ si ≤ 30) はそれぞれ i チーム目の整理番号と正解数を表す整数です。整理番号と正解数がともに 0 のときこのデータの入力が終わるものとします。\n\n続いて後半の問い合わせが複数与えられます。問い合わせの形式は以下の通りです。\n\nq1\nq2\n:\n\n各問い合わせは１行に整理番号 qi (1 ≤ qi ≤ 30) が与えられます。これを入力の最後まで処理して下さい。問い合わせの数は 100 を超えません。\n\nOutput\n\n各問い合わせについて、チームの順位を１行に出力して下さい。\n\nSample Input\n\n1,20\n2,20\n3,30\n4,10\n5,10\n6,20\n0,0\n1\n2\n4\n5\n\nOutput for the Sample Input\n\n2\n2\n3\n3\n\nNote\n\n入力例のデータにおいて、チームを正解数順に整列すると：\n\n3,30\n1,20\n2,20\n6,20\n4,10\n5,10\n\nとなります。ここでは、正解数を基に順位を決定するため、30問正解チームを1位、20問正解チームを2位、10問正解チームを3位とします（上位のチーム数を考慮し、10問正解チームを5位とする通常の順位付けとは異なることに注意して下さい）。", "sample_input": "1,20\n2,20\n3,30\n4,10\n5,10\n6,20\n0,0\n1\n2\n4\n5\n"}, "reference_outputs": ["2\n2\n3\n3\n"], "source_document_id": "p00061", "source_text": "Rank Checker\n\n時は2020 年。パソコン甲子園 2020 の予選結果を保存したデータがあります。このデータには、各チームに振られる整理番号と正解数が保存されています。ここでは、正解数で順位を決定するものとし、正解数の多いほうから順に 1 位、2 位 ... と順位をつけていくこととします。\n\n予選結果のデータと整理番号をキーボードから入力して、その番号のチームの順位を出力するプログラムを作成してください。\n\nInput\n\n入力データは２つの部分からなります。前半の部分は、予選結果のデータ、後半の部分は順位を知りたいチーム番号の問い合わせです。予選結果のデータの形式は以下の通りです。\n\np1,s1\np2,s2\n...\n...\n0,0\n\npi (1 ≤ pi ≤ 100 )、 si (0 ≤ si ≤ 30) はそれぞれ i チーム目の整理番号と正解数を表す整数です。整理番号と正解数がともに 0 のときこのデータの入力が終わるものとします。\n\n続いて後半の問い合わせが複数与えられます。問い合わせの形式は以下の通りです。\n\nq1\nq2\n:\n\n各問い合わせは１行に整理番号 qi (1 ≤ qi ≤ 30) が与えられます。これを入力の最後まで処理して下さい。問い合わせの数は 100 を超えません。\n\nOutput\n\n各問い合わせについて、チームの順位を１行に出力して下さい。\n\nSample Input\n\n1,20\n2,20\n3,30\n4,10\n5,10\n6,20\n0,0\n1\n2\n4\n5\n\nOutput for the Sample Input\n\n2\n2\n3\n3\n\nNote\n\n入力例のデータにおいて、チームを正解数順に整列すると：\n\n3,30\n1,20\n2,20\n6,20\n4,10\n5,10\n\nとなります。ここでは、正解数を基に順位を決定するため、30問正解チームを1位、20問正解チームを2位、10問正解チームを3位とします（上位のチーム数を考慮し、10問正解チームを5位とする通常の順位付けとは異なることに注意して下さい）。", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 746, "cpu_time_ms": 60, "memory_kb": 26068}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s622893234", "group_id": "codeNet:p00081", "input_text": "import java.util.Scanner;\n\nclass Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tString str=\"\";\n\t\tString[] dset;\n\t\tdouble[] moji=new double[6];\n\t\tdouble[] kotae=new double[2];\n\n\t\twhile(sc.hasNext()) {\n\t\t\tstr=sc.next();\n\t\t\tdset=str.split(\",\");\n\t\t\tfor(int i=0; i<6; i++) {\n\t\t\t\tmoji[i]=Double.parseDouble(dset[i]);\n\t\t\t}\n\t\t\tkotae=kotae(moji);\n\t\t\tSystem.out.println(kotae[0]+\" \"+kotae[1]);\n\t\t\tmoji=new double[6];\n\t\t\tkotae=new double[2];\n\t\t}\n\t}\n\n\tpublic static double[] kotae(double[] a) {\n\t\tdouble[] ansary=new double[2];\n\t\tansary[0]=0;\n\t\tansary[1]=0;\n\t\tdouble difx=0;\n\t\tdouble dify=0;\n\t\tdouble ktm1=0;\n\n\t\tdouble[] cyokusen = new double[3];\t\t// katamuki suihei_ka_suicyoku_ka y_spn\n\t\t\t\t\t\t\t\t\t\t\t\t//y jiku ni heikou -1 x jikuni heikou 1\n\t\tdouble[] suisen=new double[3];\t\t//\tsuise wo hiku\n\n\t\tdifx=a[2]-a[0];\n\t\tdify=a[3]-a[1];\n\n\t\tif(Math.abs(dify)==0) {\n\t\t\tcyokusen[0]=0;\n\t\t\tcyokusen[1]=4;\n\t\t\tcyokusen[2]=a[3];\t\t// y seppen\n\n\t\t\tsuisen[0]=0;\n\t\t\tsuisen[1]=-4;\n\t\t\tsuisen[2]=a[4];\t\t// y jiku heikou nara x seppen\n\n\t\t\tansary[0]=a[4];\n\t\t\tansary[1]=cyokusen[2]*2-a[5];\n\n\t\t\treturn ansary;\n\n\n\t\t}\n\t\telse if(Math.abs(difx)==0) {\n\t\t\tcyokusen[0]=0;\n\t\t\tcyokusen[1]=-4;\n\t\t\tcyokusen[2]=a[2];\t\t// x seppen\n\n\t\t\tsuisen[0]=0;\n\t\t\tsuisen[1]=4;\n\t\t\tsuisen[2]=a[5];\t\t\t\t//垂線のあたりが微妙\n\n\t\t\tansary[0]=cyokusen[2]*2-a[4];\n\t\t\tansary[1]=suisen[2];\n\n\t\t\treturn ansary;\n\t\t}\n\t\telse {\n\t\t\tcyokusen[0]=dify/difx;\n\t\t\tcyokusen[1]=0;\n\t\t\tcyokusen[2]=a[3]-cyokusen[0]*a[2];\n\n\t\t\tktm1=-1/cyokusen[0];\n\n\t\t\tsuisen[0]=ktm1;\n\t\t\tsuisen[2]=a[5]-suisen[0]*a[4];\n\n\t\t\tansary[0]=-1*(cyokusen[2]-suisen[2])/(cyokusen[0]-suisen[0]);\n\t\t\tansary[1]=ansary[0]*cyokusen[0]+cyokusen[2];\t\t//交点\n\n\t\t\t//System.out.println(ansary[0]+\",\"+ansary[1]);\n\t\t\tansary[1]=ansary[1]*2-a[5];\n\t\t\tansary[0]=ansary[0]*2-a[4];\n\n\t\t}\n\t\treturn ansary;\n\t}\n}\n", "language": "Java", "metadata": {"date": 1526709892, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00081.html", "problem_id": "p00081", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00081/input.txt", "sample_output_relpath": "derived/input_output/data/p00081/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00081/Java/s622893234.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s622893234", "user_id": "u069727578"}, "prompt_components": {"gold_output": "1.000000 -1.000000\n1.000000 2.000000\n-1.000000 1.000000\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tString str=\"\";\n\t\tString[] dset;\n\t\tdouble[] moji=new double[6];\n\t\tdouble[] kotae=new double[2];\n\n\t\twhile(sc.hasNext()) {\n\t\t\tstr=sc.next();\n\t\t\tdset=str.split(\",\");\n\t\t\tfor(int i=0; i<6; i++) {\n\t\t\t\tmoji[i]=Double.parseDouble(dset[i]);\n\t\t\t}\n\t\t\tkotae=kotae(moji);\n\t\t\tSystem.out.println(kotae[0]+\" \"+kotae[1]);\n\t\t\tmoji=new double[6];\n\t\t\tkotae=new double[2];\n\t\t}\n\t}\n\n\tpublic static double[] kotae(double[] a) {\n\t\tdouble[] ansary=new double[2];\n\t\tansary[0]=0;\n\t\tansary[1]=0;\n\t\tdouble difx=0;\n\t\tdouble dify=0;\n\t\tdouble ktm1=0;\n\n\t\tdouble[] cyokusen = new double[3];\t\t// katamuki suihei_ka_suicyoku_ka y_spn\n\t\t\t\t\t\t\t\t\t\t\t\t//y jiku ni heikou -1 x jikuni heikou 1\n\t\tdouble[] suisen=new double[3];\t\t//\tsuise wo hiku\n\n\t\tdifx=a[2]-a[0];\n\t\tdify=a[3]-a[1];\n\n\t\tif(Math.abs(dify)==0) {\n\t\t\tcyokusen[0]=0;\n\t\t\tcyokusen[1]=4;\n\t\t\tcyokusen[2]=a[3];\t\t// y seppen\n\n\t\t\tsuisen[0]=0;\n\t\t\tsuisen[1]=-4;\n\t\t\tsuisen[2]=a[4];\t\t// y jiku heikou nara x seppen\n\n\t\t\tansary[0]=a[4];\n\t\t\tansary[1]=cyokusen[2]*2-a[5];\n\n\t\t\treturn ansary;\n\n\n\t\t}\n\t\telse if(Math.abs(difx)==0) {\n\t\t\tcyokusen[0]=0;\n\t\t\tcyokusen[1]=-4;\n\t\t\tcyokusen[2]=a[2];\t\t// x seppen\n\n\t\t\tsuisen[0]=0;\n\t\t\tsuisen[1]=4;\n\t\t\tsuisen[2]=a[5];\t\t\t\t//垂線のあたりが微妙\n\n\t\t\tansary[0]=cyokusen[2]*2-a[4];\n\t\t\tansary[1]=suisen[2];\n\n\t\t\treturn ansary;\n\t\t}\n\t\telse {\n\t\t\tcyokusen[0]=dify/difx;\n\t\t\tcyokusen[1]=0;\n\t\t\tcyokusen[2]=a[3]-cyokusen[0]*a[2];\n\n\t\t\tktm1=-1/cyokusen[0];\n\n\t\t\tsuisen[0]=ktm1;\n\t\t\tsuisen[2]=a[5]-suisen[0]*a[4];\n\n\t\t\tansary[0]=-1*(cyokusen[2]-suisen[2])/(cyokusen[0]-suisen[0]);\n\t\t\tansary[1]=ansary[0]*cyokusen[0]+cyokusen[2];\t\t//交点\n\n\t\t\t//System.out.println(ansary[0]+\",\"+ansary[1]);\n\t\t\tansary[1]=ansary[1]*2-a[5];\n\t\t\tansary[0]=ansary[0]*2-a[4];\n\n\t\t}\n\t\treturn ansary;\n\t}\n}\n", "problem_context": "線対称\n\n平面上の異なる 3 点 P1(x1,y1), P2(x2,y2), Q(xq,yq) の座標の組を読み込んで、点 P1 点P2 を通る直線を対称軸として点 Q と線対称の位置にある点 R(x,y) を出力するプログラムを作成してください。なお、点 Q は、その対称軸上にないものとします。\n\n入力\n\n入力は複数のデータセットからなります。各データセットは以下の形式で与えられます。\n\nx1,y1,x2,y2,xq,yq\n\nx1, y1, x2, y2, xq, yq (-100 以上 100 以下の実数) がカンマ区切りで１行に与えられます。\n\nデータセットの数は 50 を超えない。\n\n出力\n\nデータセットごとに、x, y を空白区切りで 1 行に出力する。出力は実数で 0.0001 以下の誤差を含んでもよい。\n\nSample Input\n\n1.0,0.0,-1.0,0.0,1.0,1.0\n1.0,0.0,0.0,-1.0,3.0,0.0\n0.0,1.0,0.0,-1.0,1.0,1.0\n\nOutput for the Sample Input\n\n1.000000 -1.000000\n1.000000 2.000000\n-1.000000 1.000000", "sample_input": "1.0,0.0,-1.0,0.0,1.0,1.0\n1.0,0.0,0.0,-1.0,3.0,0.0\n0.0,1.0,0.0,-1.0,1.0,1.0\n"}, "reference_outputs": ["1.000000 -1.000000\n1.000000 2.000000\n-1.000000 1.000000\n"], "source_document_id": "p00081", "source_text": "線対称\n\n平面上の異なる 3 点 P1(x1,y1), P2(x2,y2), Q(xq,yq) の座標の組を読み込んで、点 P1 点P2 を通る直線を対称軸として点 Q と線対称の位置にある点 R(x,y) を出力するプログラムを作成してください。なお、点 Q は、その対称軸上にないものとします。\n\n入力\n\n入力は複数のデータセットからなります。各データセットは以下の形式で与えられます。\n\nx1,y1,x2,y2,xq,yq\n\nx1, y1, x2, y2, xq, yq (-100 以上 100 以下の実数) がカンマ区切りで１行に与えられ��す。\n\nデータセットの数は 50 を超えない。\n\n出力\n\nデータセットごとに、x, y を空白区切りで 1 行に出力する。出力は実数で 0.0001 以下の誤差を含んでもよい。\n\nSample Input\n\n1.0,0.0,-1.0,0.0,1.0,1.0\n1.0,0.0,0.0,-1.0,3.0,0.0\n0.0,1.0,0.0,-1.0,1.0,1.0\n\nOutput for the Sample Input\n\n1.000000 -1.000000\n1.000000 2.000000\n-1.000000 1.000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1823, "cpu_time_ms": 70, "memory_kb": 26068}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s367165958", "group_id": "codeNet:p00090", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile (true) {\n\t\t\t// input\n\t\t\tint n = sc.nextInt();\n\t\t\tif (n == 0) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfloat[] x = new float[n];\n\t\t\tfloat[] y = new float[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tString str = sc.next();\n\t\t\t\tString[] s = new String[2];\n\t\t\t\ts = str.split(\",\");\n\t\t\t\tx[i] = Float.parseFloat(s[0]);\n\t\t\t\ty[i] = Float.parseFloat(s[1]);\n\t\t\t}\n\n\t\t\tint max = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint count = 0;\n\t\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\t\tfloat d = distance(x[i], y[i], x[j], y[j]);\n\t\t\t\t\tif (0 <= d && d <= 4) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t\t// System.out.println(\"i:\" + i + \", j:\" + j + \", d:\" +\n\t\t\t\t\t\t// d);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmax = Math.max(max, count);\n\t\t\t}\n\t\t\tSystem.out.println(max + 1);\n\t\t}\n\t}\n\n\tpublic float distance(float x0, float y0, float x1, float y1) {\n\t\treturn ((x0 - x1) * (x0 - x1) + (y0 - y1) * (y0 - y1));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n}", "language": "Java", "metadata": {"date": 1478224287, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00090.html", "problem_id": "p00090", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00090/input.txt", "sample_output_relpath": "derived/input_output/data/p00090/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00090/Java/s367165958.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s367165958", "user_id": "u889282704"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile (true) {\n\t\t\t// input\n\t\t\tint n = sc.nextInt();\n\t\t\tif (n == 0) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfloat[] x = new float[n];\n\t\t\tfloat[] y = new float[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tString str = sc.next();\n\t\t\t\tString[] s = new String[2];\n\t\t\t\ts = str.split(\",\");\n\t\t\t\tx[i] = Float.parseFloat(s[0]);\n\t\t\t\ty[i] = Float.parseFloat(s[1]);\n\t\t\t}\n\n\t\t\tint max = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint count = 0;\n\t\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\t\tfloat d = distance(x[i], y[i], x[j], y[j]);\n\t\t\t\t\tif (0 <= d && d <= 4) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t\t// System.out.println(\"i:\" + i + \", j:\" + j + \", d:\" +\n\t\t\t\t\t\t// d);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tmax = Math.max(max, count);\n\t\t\t}\n\t\t\tSystem.out.println(max + 1);\n\t\t}\n\t}\n\n\tpublic float distance(float x0, float y0, float x1, float y1) {\n\t\treturn ((x0 - x1) * (x0 - x1) + (y0 - y1) * (y0 - y1));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n}", "problem_context": "シールの重なり\n\n1 辺の長さが 10 の正方形の折り紙に半径 1 の円形のシールを n 枚貼ります。シールは重ねて貼ることができます。シールを貼る位置の座標を読み込んで、折り紙上でもっとも多くシールが重なっている場所(シールが１枚だけでも\"重なっている\"とする)でのシールの枚数を出力するプログラムを作成してください。\n\n折り紙の左下を原点とした x, y 座標を与えます。この x, y を円の中心としてシールを貼ることとします。円の中心が折り紙の外に出ることはありません。また、同一座標に複数のシールが貼られることはありません。\n\nInput\n\n複数のデータセットが与えられます。各データセットは以下のような形式で与えられます。\n\nn\nx1,y1\nx2,y2\n:\nxn,yn\n\n１行目にシールの枚数 n (0 ≤ 100) が与えられます。続く n 行に、各シールの中心座標が与え���れます。\nxi, yi は i 枚目のシールの中心の x 座標と y 座標を表します。各値は小数点以下最大 6 桁までの数字を含む実数で与えられます。\n\nn が 0 のとき、入力の最後とします。データセットの数は 50 を超えません。\n\nOutput\n\n各データセットに対し、折り紙上で最も多くシールが重なっている場所でのシールの枚数（整数）を出力して下さい。\n\nSample Input\n\n15\n3.14979,8.51743\n2.39506,3.84915\n2.68432,5.39095\n5.61904,9.16332\n7.85653,4.75593\n2.84021,5.41511\n1.79500,8.59211\n7.55389,8.17604\n4.70665,4.66125\n1.63470,4.42538\n7.34959,4.61981\n5.09003,8.11122\n5.24373,1.30066\n0.13517,1.83659\n7.57313,1.58150\n0\n\nOutput for the Sample Input\n\n4\n\nHint\n\n入力例のようにシールを貼った図です。円はシール、数字は入力例の行数を表しています。\n点(2.3,4.6)では、入力例の 2 行目、3 行目、6 行目、10 行目の 4 枚のシールが重なっています。\n\n6 と 9 のおのおのの中心の距離は 2.01293 なので、シールは重なっていません。1 と 12 のおのおのの中心の距離は 1.98231 なので、シールは重なっています。\n\n２つの円が接しているとき（おのおのの中心の距離が 2 のとき）は、重なっているものとします。", "sample_input": "15\n3.14979,8.51743\n2.39506,3.84915\n2.68432,5.39095\n5.61904,9.16332\n7.85653,4.75593\n2.84021,5.41511\n1.79500,8.59211\n7.55389,8.17604\n4.70665,4.66125\n1.63470,4.42538\n7.34959,4.61981\n5.09003,8.11122\n5.24373,1.30066\n0.13517,1.83659\n7.57313,1.58150\n0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p00090", "source_text": "シールの重なり\n\n1 辺の長さが 10 の正方形の折り紙に半径 1 の円形のシールを n 枚貼ります。シールは重ねて貼ることができます。シールを貼る位置の座標を読み込んで、折り紙上でもっとも多くシールが重なっている場所(シールが１枚だけでも\"重なっている\"とする)でのシールの枚数を出力するプログラムを作成してください。\n\n折り紙の左下を原点とした x, y 座標を与えます。この x, y を円の中心としてシールを貼ることとします。円の中心が折り紙の外に出ることはありません。また、同一座標に複数のシールが貼られることはありません。\n\nInput\n\n複数のデータセットが与えられます。各データセットは以下のような形式で与えられます。\n\nn\nx1,y1\nx2,y2\n:\nxn,yn\n\n１行目にシールの枚数 n (0 ≤ 100) が与えられます。続く n 行に、各シールの中心座標が与えられます。\nxi, yi は i 枚目のシールの中心の x 座標と y 座標を表します。各値は小数点以下最大 6 桁までの数字を含む実数で与えられます。\n\nn が 0 のとき、入力の最後とします。データセットの数は 50 を超えません。\n\nOutput\n\n各データセットに対し、折り紙上で最も多くシールが重なっている場所でのシールの枚数（整数）を出力して下さい。\n\nSample Input\n\n15\n3.14979,8.51743\n2.39506,3.84915\n2.68432,5.39095\n5.61904,9.16332\n7.85653,4.75593\n2.84021,5.41511\n1.79500,8.59211\n7.55389,8.17604\n4.70665,4.66125\n1.63470,4.42538\n7.34959,4.61981\n5.09003,8.11122\n5.24373,1.30066\n0.13517,1.83659\n7.57313,1.58150\n0\n\nOutput for the Sample Input\n\n4\n\nHint\n\n入力例のようにシールを貼った図です。円はシール、数字は入力例の行数を表しています。\n点(2.3,4.6)では、入力例の 2 行目、3 行目、6 行目、10 行目の 4 枚のシールが重なっています。\n\n6 と 9 のおのおのの中心の距離は 2.01293 なので、シールは重なっていません。1 と 12 のおのおのの中心の距離は 1.98231 なので、シールは重なっています。\n\n２つの円が接しているとき（おのおのの中心の距離が 2 のとき）は、重なっているものとします。", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 997, "cpu_time_ms": 90, "memory_kb": 29044}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s305739904", "group_id": "codeNet:p00090", "input_text": "import java.awt.geom.Point2D;\nimport java.util.*;\n\npublic class Main {\n\tScanner in = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tnew Main();\n\t}\n\n\tpublic Main() {\n\t\tnew AOJ0090().doIt();\n\t}\n\n\tclass AOJ0090{\n\t\tvoid doIt(){\n\t\t\twhile(true){\n\t\t\t\tint n = in.nextInt();\n\t\t\t\tif(n==0)break;\n\t\t\t\tArrayList p = new ArrayList();\n\t\t\t\tArrayList list = new ArrayList();\n\t\t\t\tfor(int i=0;i=5)System.out.println(list.get(i));\n\t\t\t\t}\n\t\t\t\tSystem.out.println(result);\n\t\t\t}\n\t\t}\n\n\t\tclass Circle{\n\t\t\tPoint2D p;\n\t\t\tdouble r;\n\t\t\tCircle(Point2D p,double r){ \n\t\t\t\tthis.p=p;\n\t\t\t\tthis.r=r;\n\t\t\t}\n\t\t\tCircle(double x,double y,double r){ \n\t\t\t\tthis.p=new Point2D.Double(x,y); \n\t\t\t\tthis.r=r;\n\t\t\t}\n\t\t}\n\t\t //円と円の交点\n\t\tPoint2D [] intersectPtCC(Circle a,Circle b){\n\t\tdouble dis = a.p.distance(b.p);\n\t\tif(dis > a.r + b.r)return null;\n\t\tPoint2D v = sub(b.p, a.p);\n\t\tdouble rc=(dis*dis+a.r*a.r- b.r*b.r)/(2*dis);\n\t\tdouble rate = rc / dis;\n\t\tv = mul(rate, v);\n\t\tPoint2D c = add(v, a.p);\n\t\tdouble disC2c = c.distance(b.p);\n\t\tdouble disqc = Math.sqrt(b.r * b.r - disC2c * disC2c);\n\t\tPoint2D v2 = sub(b.p, c);\n\t\tv2 = mul(disqc / disC2c, v2);\n\t\tPoint2D [] res = new Point2D[2];\n\t\tres[0] = add(normalVector1(v2), c);\n\t\tres[1] = add(normalVector2(v2), c);\n\t\treturn res;\n\t\t}\n\n\t\tPoint2D normalVector1(Point2D p){\n\t\t\treturn new Point2D.Double(-p.getY(), p.getX());\n\t\t}\n\t\tPoint2D normalVector2(Point2D p){\n\t\t\treturn new Point2D.Double(p.getY(), -p.getX());\n\t\t}\n\t\tPoint2D mul(double n,Point2D p1){\n\t\t\treturn new Point2D.Double(p1.getX()*n,p1.getY()*n);\n\t\t}\n\t\tPoint2D sub(Point2D p1,Point2D p2){\n\t\t\treturn new Point2D.Double(p1.getX()-p2.getX(),p1.getY()-p2.getY());\n\t\t}\n\t\tPoint2D add(Point2D p1,Point2D p2){\n\t\t\treturn new Point2D.Double(p1.getX()+p2.getX(), p1.getY()+p2.getY());\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1400136769, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00090.html", "problem_id": "p00090", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00090/input.txt", "sample_output_relpath": "derived/input_output/data/p00090/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00090/Java/s305739904.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s305739904", "user_id": "u724424933"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.awt.geom.Point2D;\nimport java.util.*;\n\npublic class Main {\n\tScanner in = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tnew Main();\n\t}\n\n\tpublic Main() {\n\t\tnew AOJ0090().doIt();\n\t}\n\n\tclass AOJ0090{\n\t\tvoid doIt(){\n\t\t\twhile(true){\n\t\t\t\tint n = in.nextInt();\n\t\t\t\tif(n==0)break;\n\t\t\t\tArrayList p = new ArrayList();\n\t\t\t\tArrayList list = new ArrayList();\n\t\t\t\tfor(int i=0;i=5)System.out.println(list.get(i));\n\t\t\t\t}\n\t\t\t\tSystem.out.println(result);\n\t\t\t}\n\t\t}\n\n\t\tclass Circle{\n\t\t\tPoint2D p;\n\t\t\tdouble r;\n\t\t\tCircle(Point2D p,double r){ \n\t\t\t\tthis.p=p;\n\t\t\t\tthis.r=r;\n\t\t\t}\n\t\t\tCircle(double x,double y,double r){ \n\t\t\t\tthis.p=new Point2D.Double(x,y); \n\t\t\t\tthis.r=r;\n\t\t\t}\n\t\t}\n\t\t //円と円の交点\n\t\tPoint2D [] intersectPtCC(Circle a,Circle b){\n\t\tdouble dis = a.p.distance(b.p);\n\t\tif(dis > a.r + b.r)return null;\n\t\tPoint2D v = sub(b.p, a.p);\n\t\tdouble rc=(dis*dis+a.r*a.r- b.r*b.r)/(2*dis);\n\t\tdouble rate = rc / dis;\n\t\tv = mul(rate, v);\n\t\tPoint2D c = add(v, a.p);\n\t\tdouble disC2c = c.distance(b.p);\n\t\tdouble disqc = Math.sqrt(b.r * b.r - disC2c * disC2c);\n\t\tPoint2D v2 = sub(b.p, c);\n\t\tv2 = mul(disqc / disC2c, v2);\n\t\tPoint2D [] res = new Point2D[2];\n\t\tres[0] = add(normalVector1(v2), c);\n\t\tres[1] = add(normalVector2(v2), c);\n\t\treturn res;\n\t\t}\n\n\t\tPoint2D normalVector1(Point2D p){\n\t\t\treturn new Point2D.Double(-p.getY(), p.getX());\n\t\t}\n\t\tPoint2D normalVector2(Point2D p){\n\t\t\treturn new Point2D.Double(p.getY(), -p.getX());\n\t\t}\n\t\tPoint2D mul(double n,Point2D p1){\n\t\t\treturn new Point2D.Double(p1.getX()*n,p1.getY()*n);\n\t\t}\n\t\tPoint2D sub(Point2D p1,Point2D p2){\n\t\t\treturn new Point2D.Double(p1.getX()-p2.getX(),p1.getY()-p2.getY());\n\t\t}\n\t\tPoint2D add(Point2D p1,Point2D p2){\n\t\t\treturn new Point2D.Double(p1.getX()+p2.getX(), p1.getY()+p2.getY());\n\t\t}\n\t}\n}", "problem_context": "シールの重なり\n\n1 辺の長さが 10 の正方形の折り紙に半径 1 の円形のシールを n 枚貼ります。シールは重ねて貼ることができます。シールを貼る位置の座標を読み込んで、折り紙上でもっとも多くシールが重なっている場所(シールが１枚だけでも\"重なっている\"とする)でのシールの枚数を出力するプログラムを作成してください。\n\n折り紙の左下を原点とした x, y 座標を与えます。この x, y を円の中心としてシールを貼ることとします。円の中心が折り紙の外に出ることはありません。また、同一座標に複数のシールが貼られることはありません。\n\nInput\n\n複数のデータセットが与えられます。各データセットは以下のような形式で与えられます。\n\nn\nx1,y1\nx2,y2\n:\nxn,yn\n\n１行目にシールの枚数 n (0 ≤ 100) が与えられます。続く n 行に、各シールの中心座標が与えられます。\nxi, yi は i 枚目のシールの中心の x 座標と y 座標を表します。各値は小数点以下最大 6 桁までの数字を含む実数で与えられます。\n\nn が 0 のとき、入力の最後とします。データセットの数は 50 を超えません。\n\nOutput\n\n各データセットに対し、折り紙上で最も多くシールが重なっている場所でのシールの枚数（整数）を出力して下さい。\n\nSample Input\n\n15\n3.14979,8.51743\n2.39506,3.84915\n2.68432,5.39095\n5.61904,9.16332\n7.85653,4.75593\n2.84021,5.41511\n1.79500,8.59211\n7.55389,8.17604\n4.70665,4.66125\n1.63470,4.42538\n7.34959,4.61981\n5.09003,8.11122\n5.24373,1.30066\n0.13517,1.83659\n7.57313,1.58150\n0\n\nOutput for the Sample Input\n\n4\n\nHint\n\n入力例のようにシールを貼った図です。円はシール、数字は入力例の行数を表しています。\n点(2.3,4.6)では、入力例の 2 行目、3 行目、6 行目、10 行目の 4 枚のシールが重なっています。\n\n6 と 9 のおのおのの中心の距離は 2.01293 なので、シールは重なっていません。1 と 12 のおのおのの中心の距離は 1.98231 なので、シールは重なっています。\n\n２つの円が接しているとき（おのおのの中心の距離が 2 のとき）は、重なっているものとします。", "sample_input": "15\n3.14979,8.51743\n2.39506,3.84915\n2.68432,5.39095\n5.61904,9.16332\n7.85653,4.75593\n2.84021,5.41511\n1.79500,8.59211\n7.55389,8.17604\n4.70665,4.66125\n1.63470,4.42538\n7.34959,4.61981\n5.09003,8.11122\n5.24373,1.30066\n0.13517,1.83659\n7.57313,1.58150\n0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p00090", "source_text": "シールの重なり\n\n1 辺の長さが 10 の正方形の折り紙に半径 1 の円形のシールを n 枚貼ります。シールは重ねて貼ることができます。シールを貼る位置の座標を読み込んで、折り紙上でもっとも多くシールが重なっている場所(シールが１枚だけでも\"重なっている\"とする)でのシールの枚数を出力するプログラムを作成してください。\n\n折り紙の左下を原点とした x, y 座標を与えます。この x, y を円の中心としてシールを貼ることとします。円の中心が折り紙の外に出ることはありません。また、同一座標に複数のシールが貼られることはありません。\n\nInput\n\n複数のデータセットが与えられます。各データセットは以下のような形式で与えられます。\n\nn\nx1,y1\nx2,y2\n:\nxn,yn\n\n１行目にシールの枚数 n (0 ≤ 100) が与えられます。続く n 行に、各シールの中心座標が与えられます。\nxi, yi は i 枚目のシールの中心の x 座標と y 座標を表します。各値は小数点以下最大 6 桁までの数字を含む実数で与えられます。\n\nn が 0 のとき、入力の最後とします。データセットの数は 50 を超えません。\n\nOutput\n\n各データセットに対し、折り紙上で最も多くシールが重なっている場所でのシールの枚数（整数）を出力して下さい。\n\nSample Input\n\n15\n3.14979,8.51743\n2.39506,3.84915\n2.68432,5.39095\n5.61904,9.16332\n7.85653,4.75593\n2.84021,5.41511\n1.79500,8.59211\n7.55389,8.17604\n4.70665,4.66125\n1.63470,4.42538\n7.34959,4.61981\n5.09003,8.11122\n5.24373,1.30066\n0.13517,1.83659\n7.57313,1.58150\n0\n\nOutput for the Sample Input\n\n4\n\nHint\n\n入力例のようにシールを貼った図です。円はシール、数字は入力例の行数を表しています。\n点(2.3,4.6)では、入力例の 2 行目、3 行目、6 行目、10 行目の 4 枚のシールが重なっています。\n\n6 と 9 のおのおのの中心の距離は 2.01293 なので、シールは重なっていません。1 と 12 のおのおのの中心の距離は 1.98231 なので、シールは重なっています。\n\n２つの円が接しているとき（おのおのの中心の距離が 2 のとき）は、重なっているものとします。", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2354, "cpu_time_ms": 130, "memory_kb": 27340}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s630238210", "group_id": "codeNet:p00100", "input_text": "import java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.Scanner;\n\npublic class Main{\n\t\n\tstatic Main byakko = new Main();\n\tstatic Scanner sc = new Scanner(System.in);\n\t\n\tpublic static void main(String[] args){\n\t\t\n\t\tint n;\n\t\tboolean is;\n\t\t\n\t\twhile(true){\n\t\t\tn = sc.nextInt();\n\t\t\tif(n == 0)break;\n\t\t\tHashMap map = new HashMap();\n\t\t\tArrayList list = new ArrayList();\n\t\t\tis = true;\n\t\t\t\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tint x = sc.nextInt();\n\t\t\t\tif(map.containsKey(x)){\n\t\t\t\t\tmap.put(x, map.get(x) + sc.nextInt() * sc.nextInt());\n\t\t\t\t}else{\n\t\t\t\t\tmap.put(x, sc.nextInt() * sc.nextInt());\n\t\t\t\t\tlist.add(x);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < list.size(); i++){\n\t\t\t\tif(map.get(list.get(i)) >= 1000000){\n\t\t\t\t\tSystem.out.println(list.get(i));\n\t\t\t\t\tis = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is)\n\t\t\t\tSystem.out.println(\"NA\");\n\t\t}\n\t\tsc.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1441622300, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00100.html", "problem_id": "p00100", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00100/input.txt", "sample_output_relpath": "derived/input_output/data/p00100/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00100/Java/s630238210.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s630238210", "user_id": "u489809100"}, "prompt_components": {"gold_output": "1001\n1003\nNA\n2013\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.Scanner;\n\npublic class Main{\n\t\n\tstatic Main byakko = new Main();\n\tstatic Scanner sc = new Scanner(System.in);\n\t\n\tpublic static void main(String[] args){\n\t\t\n\t\tint n;\n\t\tboolean is;\n\t\t\n\t\twhile(true){\n\t\t\tn = sc.nextInt();\n\t\t\tif(n == 0)break;\n\t\t\tHashMap map = new HashMap();\n\t\t\tArrayList list = new ArrayList();\n\t\t\tis = true;\n\t\t\t\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tint x = sc.nextInt();\n\t\t\t\tif(map.containsKey(x)){\n\t\t\t\t\tmap.put(x, map.get(x) + sc.nextInt() * sc.nextInt());\n\t\t\t\t}else{\n\t\t\t\t\tmap.put(x, sc.nextInt() * sc.nextInt());\n\t\t\t\t\tlist.add(x);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < list.size(); i++){\n\t\t\t\tif(map.get(list.get(i)) >= 1000000){\n\t\t\t\t\tSystem.out.println(list.get(i));\n\t\t\t\t\tis = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(is)\n\t\t\t\tSystem.out.println(\"NA\");\n\t\t}\n\t\tsc.close();\n\t}\n}", "problem_context": "Sale Result\n\nThere is data on sales of your company. Your task is to write a program which identifies good workers.\n\nThe program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then, the program should print IDs of employees whose total sales proceeds (i.e. sum of p × q) is greater than or equal to 1,000,000 in the order of inputting. If there is no such employees, the program should print \"NA\". You can suppose that n < 4000, and each employee has an unique ID. The unit price p is less than or equal to 1,000,000 and the amount of sales q is less than or equal to 100,000.\n\nInput\n\nThe input consists of several datasets. The input ends with a line including a single 0. Each dataset consists of:\n\nn (the number of data in the list)\ni p q\ni p q\n:\n:\ni p q\n\nOutput\n\nFor each dataset, print a list of employee IDs or a text \"NA\"\n\nSample Input\n\n4\n1001 2000 520\n1002 1800 450\n1003 1600 625\n1001 200 1220\n2\n1001 100 3\n1005 1000 100\n2\n2013 5000 100\n2013 5000 100\n0\n\nOutput for the Sample Input\n\n1001\n1003\nNA\n2013", "sample_input": "4\n1001 2000 520\n1002 1800 450\n1003 1600 625\n1001 200 1220\n2\n1001 100 3\n1005 1000 100\n2\n2013 5000 100\n2013 5000 100\n0\n"}, "reference_outputs": ["1001\n1003\nNA\n2013\n"], "source_document_id": "p00100", "source_text": "Sale Result\n\nThere is data on sales of your company. Your task is to write a program which identifies good workers.\n\nThe program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then, the program should print IDs of employees whose total sales proceeds (i.e. sum of p × q) is greater than or equal to 1,000,000 in the order of inputting. If there is no such employees, the program should print \"NA\". You can suppose that n < 4000, and each employee has an unique ID. The unit price p is less than or equal to 1,000,000 and the amount of sales q is less than or equal to 100,000.\n\nInput\n\nThe input consists of several datasets. The input ends with a line including a single 0. Each dataset consists of:\n\nn (the number of data in the list)\ni p q\ni p q\n:\n:\ni p q\n\nOutput\n\nFor each dataset, print a list of employee IDs or a text \"NA\"\n\nSample Input\n\n4\n1001 2000 520\n1002 1800 450\n1003 1600 625\n1001 200 1220\n2\n1001 100 3\n1005 1000 100\n2\n2013 5000 100\n2013 5000 100\n0\n\nOutput for the Sample Input\n\n1001\n1003\nNA\n2013", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 890, "cpu_time_ms": 160, "memory_kb": 25104}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s749832488", "group_id": "codeNet:p00100", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tstatic class Worker {\n\t\tint number;\n\t\tlong result;\n\t\t\n\t\tWorker (int number, long result) {\n\t\t\tthis.number = number;\n\t\t\tthis.result = result;\n\t\t}\n\t\t\n\t\tpublic void add(long result) {\n\t\t\tthis.result += result;\n\t\t}\n\t}\n\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n;\n\t\tboolean flag;\n\t\tWorker worker[];\n\t\tint index;\n\n\t\tn = sc.nextInt();\n\t\twhile (n != 0) {\n\t\t\tworker = new Worker[n];\n\t\t\tindex = 0;\n\t\t\tflag = true;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint number = sc.nextInt();\n\t\t\t\tint cost = sc.nextInt();\n\t\t\t\tint lots = sc.nextInt();\n\t\t\t\tboolean flag2 = true;\n\t\t\t\tfor (int j = 0; j < index; j++) {\n\t\t\t\t\tif (worker[j].number == number) {\n\t\t\t\t\t\tworker[j].add((long)(cost * lots));\n\t\t\t\t\t\tflag2 = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (flag2) {\n\t\t\t\t\tworker[index] = new Worker(number, (long)(cost * lots));\n\t\t\t\t\tindex++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int i = 0; i < index; i++) {\n\t\t\t\tif (1000000 <= worker[i].result) {\n\t\t\t\t\tSystem.out.println(worker[i].number);\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag) {\n\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t}\n\t\t\t\n\t\t\tn = sc.nextInt();\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1353899692, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00100.html", "problem_id": "p00100", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00100/input.txt", "sample_output_relpath": "derived/input_output/data/p00100/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00100/Java/s749832488.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s749832488", "user_id": "u026004148"}, "prompt_components": {"gold_output": "1001\n1003\nNA\n2013\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tstatic class Worker {\n\t\tint number;\n\t\tlong result;\n\t\t\n\t\tWorker (int number, long result) {\n\t\t\tthis.number = number;\n\t\t\tthis.result = result;\n\t\t}\n\t\t\n\t\tpublic void add(long result) {\n\t\t\tthis.result += result;\n\t\t}\n\t}\n\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n;\n\t\tboolean flag;\n\t\tWorker worker[];\n\t\tint index;\n\n\t\tn = sc.nextInt();\n\t\twhile (n != 0) {\n\t\t\tworker = new Worker[n];\n\t\t\tindex = 0;\n\t\t\tflag = true;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint number = sc.nextInt();\n\t\t\t\tint cost = sc.nextInt();\n\t\t\t\tint lots = sc.nextInt();\n\t\t\t\tboolean flag2 = true;\n\t\t\t\tfor (int j = 0; j < index; j++) {\n\t\t\t\t\tif (worker[j].number == number) {\n\t\t\t\t\t\tworker[j].add((long)(cost * lots));\n\t\t\t\t\t\tflag2 = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (flag2) {\n\t\t\t\t\tworker[index] = new Worker(number, (long)(cost * lots));\n\t\t\t\t\tindex++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int i = 0; i < index; i++) {\n\t\t\t\tif (1000000 <= worker[i].result) {\n\t\t\t\t\tSystem.out.println(worker[i].number);\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag) {\n\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t}\n\t\t\t\n\t\t\tn = sc.nextInt();\n\t\t}\n\t}\n}", "problem_context": "Sale Result\n\nThere is data on sales of your company. Your task is to write a program which identifies good workers.\n\nThe program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then, the program should print IDs of employees whose total sales proceeds (i.e. sum of p × q) is greater than or equal to 1,000,000 in the order of inputting. If there is no such employees, the program should print \"NA\". You can suppose that n < 4000, and each employee has an unique ID. The unit price p is less than or equal to 1,000,000 and the amount of sales q is less than or equal to 100,000.\n\nInput\n\nThe input consists of several datasets. The input ends with a line including a single 0. Each dataset consists of:\n\nn (the number of data in the list)\ni p q\ni p q\n:\n:\ni p q\n\nOutput\n\nFor each dataset, print a list of employee IDs or a text \"NA\"\n\nSample Input\n\n4\n1001 2000 520\n1002 1800 450\n1003 1600 625\n1001 200 1220\n2\n1001 100 3\n1005 1000 100\n2\n2013 5000 100\n2013 5000 100\n0\n\nOutput for the Sample Input\n\n1001\n1003\nNA\n2013", "sample_input": "4\n1001 2000 520\n1002 1800 450\n1003 1600 625\n1001 200 1220\n2\n1001 100 3\n1005 1000 100\n2\n2013 5000 100\n2013 5000 100\n0\n"}, "reference_outputs": ["1001\n1003\nNA\n2013\n"], "source_document_id": "p00100", "source_text": "Sale Result\n\nThere is data on sales of your company. Your task is to write a program which identifies good workers.\n\nThe program should read a list of data where each item includes the employee ID i, the amount of sales q and the corresponding unit price p. Then, the program should print IDs of employees whose total sales proceeds (i.e. sum of p × q) is greater than or equal to 1,000,000 in the order of inputting. If there is no such employees, the program should print \"NA\". You can suppose that n < 4000, and each employee has an unique ID. The unit price p is less than or equal to 1,000,000 and the amount of sales q is less than or equal to 100,000.\n\nInput\n\nThe input consists of several datasets. The input ends with a line including a single 0. Each dataset consists of:\n\nn (the number of data in the list)\ni p q\ni p q\n:\n:\ni p q\n\nOutput\n\nFor each dataset, print a list of employee IDs or a text \"NA\"\n\nSample Input\n\n4\n1001 2000 520\n1002 1800 450\n1003 1600 625\n1001 200 1220\n2\n1001 100 3\n1005 1000 100\n2\n2013 5000 100\n2013 5000 100\n0\n\nOutput for the Sample Input\n\n1001\n1003\nNA\n2013", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1143, "cpu_time_ms": 150, "memory_kb": 12000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s890680977", "group_id": "codeNet:p00102", "input_text": "import java.io.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tint n;\n\t\t\twhile (0 != (n = Integer.parseInt(in.readLine()))) {\n\t\t\t\tint[][] a = new int[n + 1][n + 1];\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tString[] s = in.readLine().split(\" \");\n\t\t\t\t\tint sum = 0;\n\t\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\t\ta[i][j] = Integer.parseInt(s[j]);\n\t\t\t\t\t\tsum += a[i][j];\n\t\t\t\t\t}\n\t\t\t\t\ta[i][n] = sum;\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i <= n; i++) {\n\t\t\t\t\tint sum = 0;\n\t\t\t\t\tfor (int j = 0; j <= n; j++) {\n\t\t\t\t\t\tsum += a[j][i];\n\t\t\t\t\t}\n\t\t\t\t\ta[n][i] = sum;\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i <= n; i++) {\n\t\t\t\t\tfor (int j = 0; j <= n; j++) {\n\t\t\t\t\t\tSystem.out.printf(\"%5d\", a[i][j]);\n\t\t\t\t\t}\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1334844032, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00102.html", "problem_id": "p00102", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00102/input.txt", "sample_output_relpath": "derived/input_output/data/p00102/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00102/Java/s890680977.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s890680977", "user_id": "u856329346"}, "prompt_components": {"gold_output": " 52 96 15 20 183\n 86 22 35 45 188\n 45 78 54 36 213\n 16 86 74 55 231\n 199 282 178 156 815\n 52 96 15 20 183\n 86 22 35 45 188\n 45 78 54 36 213\n 16 86 74 55 231\n 199 282 178 156 815\n", "input_to_evaluate": "import java.io.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\t\tint n;\n\t\t\twhile (0 != (n = Integer.parseInt(in.readLine()))) {\n\t\t\t\tint[][] a = new int[n + 1][n + 1];\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tString[] s = in.readLine().split(\" \");\n\t\t\t\t\tint sum = 0;\n\t\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\t\ta[i][j] = Integer.parseInt(s[j]);\n\t\t\t\t\t\tsum += a[i][j];\n\t\t\t\t\t}\n\t\t\t\t\ta[i][n] = sum;\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i <= n; i++) {\n\t\t\t\t\tint sum = 0;\n\t\t\t\t\tfor (int j = 0; j <= n; j++) {\n\t\t\t\t\t\tsum += a[j][i];\n\t\t\t\t\t}\n\t\t\t\t\ta[n][i] = sum;\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i <= n; i++) {\n\t\t\t\t\tfor (int j = 0; j <= n; j++) {\n\t\t\t\t\t\tSystem.out.printf(\"%5d\", a[i][j]);\n\t\t\t\t\t}\n\t\t\t\t\tSystem.out.println();\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n}", "problem_context": "Matrix-like Computation\n\nYour task is to develop a tiny little part of spreadsheet software.\n\nWrite a program which adds up columns and rows of given table as shown in the following figure:\n\nInput\n\nThe input consists of several datasets. Each dataset consists of:\n\nn (the size of row and column of the given table)\n1st row of the table\n2nd row of the table\n:\n:\nnth row of the table\n\nThe input ends with a line consisting of a single 0.\n\nOutput\n\nFor each dataset, print the table with sums of rows and columns. Each item of the table should be aligned to the right with a margin for five digits. Please see the sample output for details.\n\nSample Input\n\n4\n52 96 15 20\n86 22 35 45\n45 78 54 36\n16 86 74 55\n4\n52 96 15 20\n86 22 35 45\n45 78 54 36\n16 86 74 55\n0\n\nOutput for the Sample Input\n\n52 96 15 20 183\n86 22 35 45 188\n45 78 54 36 213\n16 86 74 55 231\n199 282 178 156 815\n52 96 15 20 183\n86 22 35 45 188\n45 78 54 36 213\n16 86 74 55 231\n199 282 178 156 815", "sample_input": "4\n52 96 15 20\n86 22 35 45\n45 78 54 36\n16 86 74 55\n4\n52 96 15 20\n86 22 35 45\n45 78 54 36\n16 86 74 55\n0\n"}, "reference_outputs": [" 52 96 15 20 183\n 86 22 35 45 188\n 45 78 54 36 213\n 16 86 74 55 231\n 199 282 178 156 815\n 52 96 15 20 183\n 86 22 35 45 188\n 45 78 54 36 213\n 16 86 74 55 231\n 199 282 178 156 815\n"], "source_document_id": "p00102", "source_text": "Matrix-like Computation\n\nYour task is to develop a tiny little part of spreadsheet software.\n\nWrite a program which adds up columns and rows of given table as shown in the following figure:\n\nInput\n\nThe input consists of several datasets. Each dataset consists of:\n\nn (the size of row and column of the given table)\n1st row of the table\n2nd row of the table\n:\n:\nnth row of the table\n\nThe input ends with a line consisting of a single 0.\n\nOutput\n\nFor each dataset, print the table with sums of rows and columns. Each item of the table should be aligned to the right with a margin for five digits. Please see the sample output for details.\n\nSample Input\n\n4\n52 96 15 20\n86 22 35 45\n45 78 54 36\n16 86 74 55\n4\n52 96 15 20\n86 22 35 45\n45 78 54 36\n16 86 74 55\n0\n\nOutput for the Sample Input\n\n52 96 15 20 183\n86 22 35 45 188\n45 78 54 36 213\n16 86 74 55 231\n199 282 178 156 815\n52 96 15 20 183\n86 22 35 45 188\n45 78 54 36 213\n16 86 74 55 231\n199 282 178 156 815", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 856, "cpu_time_ms": 150, "memory_kb": 12000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s613703268", "group_id": "codeNet:p00109", "input_text": "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\n\t\twhile(n-- > 0){\n\t\t\tp = sc.next().toCharArray();\n\t\t\tParsed ans = expr(0);\n\t\t\tSystem.out.println(ans.val);\n\t\t}\n\t}\n\n\tstatic char[] p;\n\n\tstatic Parsed expr(int idx){\n\t\tParsed r = term(idx);\n\t\twhile(p[r.idx] == '+' || p[r.idx] == '-'){\n\t\t\tchar op = p[r.idx];\n\t\t\tint tmp = r.val;\n\t\t\tr = term(r.idx + 1);\n\t\t\tif(op == '+') r.val = tmp + r.val;\n\t\t\telse r.val = tmp - r.val;\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic Parsed term(int idx){\n\t\tParsed r = fact(idx);\n\t\twhile(p[r.idx] == '*' || p[r.idx] == '/'){\n\t\t\tchar op = p[r.idx];\n\t\t\tint tmp = r.val;\n\t\t\tr = fact(r.idx + 1);\n\t\t\tif(op == '*') r.val = tmp * r.val;\n\t\t\telse r.val = tmp / r.val;\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic Parsed fact(int idx){\n\t\tif(Character.isDigit(p[idx])){\n\t\t\tint t = p[idx++] - '0';\n\t\t\twhile(Character.isDigit(p[idx]))t = t*10 + p[idx++] - '0';\n\t\t\treturn new Parsed(t,idx);\n\t\t}\n\t\telse if(p[idx] == '('){\n\t\t\tParsed r = expr(idx + 1);\n\t\t\tif(p[r.idx] != ')') return null;\n\t\t\treturn new Parsed(r.val, r.idx + 1);\n\t\t}\n\t\telse return null;\n\t}\n}\n\nclass Parsed{\n\tint val;\n\tint idx;\n\tParsed(int val,int idx){\n\t\tthis.val = val;\n\t\tthis.idx = idx;\n\t}\n}", "language": "Java", "metadata": {"date": 1277967289, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00109.html", "problem_id": "p00109", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00109/input.txt", "sample_output_relpath": "derived/input_output/data/p00109/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00109/Java/s613703268.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s613703268", "user_id": "u642549559"}, "prompt_components": {"gold_output": "-2\n60\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\n\t\twhile(n-- > 0){\n\t\t\tp = sc.next().toCharArray();\n\t\t\tParsed ans = expr(0);\n\t\t\tSystem.out.println(ans.val);\n\t\t}\n\t}\n\n\tstatic char[] p;\n\n\tstatic Parsed expr(int idx){\n\t\tParsed r = term(idx);\n\t\twhile(p[r.idx] == '+' || p[r.idx] == '-'){\n\t\t\tchar op = p[r.idx];\n\t\t\tint tmp = r.val;\n\t\t\tr = term(r.idx + 1);\n\t\t\tif(op == '+') r.val = tmp + r.val;\n\t\t\telse r.val = tmp - r.val;\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic Parsed term(int idx){\n\t\tParsed r = fact(idx);\n\t\twhile(p[r.idx] == '*' || p[r.idx] == '/'){\n\t\t\tchar op = p[r.idx];\n\t\t\tint tmp = r.val;\n\t\t\tr = fact(r.idx + 1);\n\t\t\tif(op == '*') r.val = tmp * r.val;\n\t\t\telse r.val = tmp / r.val;\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic Parsed fact(int idx){\n\t\tif(Character.isDigit(p[idx])){\n\t\t\tint t = p[idx++] - '0';\n\t\t\twhile(Character.isDigit(p[idx]))t = t*10 + p[idx++] - '0';\n\t\t\treturn new Parsed(t,idx);\n\t\t}\n\t\telse if(p[idx] == '('){\n\t\t\tParsed r = expr(idx + 1);\n\t\t\tif(p[r.idx] != ')') return null;\n\t\t\treturn new Parsed(r.val, r.idx + 1);\n\t\t}\n\t\telse return null;\n\t}\n}\n\nclass Parsed{\n\tint val;\n\tint idx;\n\tParsed(int val,int idx){\n\t\tthis.val = val;\n\t\tthis.idx = idx;\n\t}\n}", "problem_context": "Smart Calculator\n\nYour task is to write a program which reads an expression and evaluates it.\n\nThe expression consists of numerical values, operators and parentheses, and the ends with '='.\n\nThe operators includes +, - , *, / where respectively represents, addition, subtraction, multiplication and division.\n\nPrecedence of the operators is based on usual laws. That is one should perform all multiplication and division first, then addition and subtraction. When two operators have the same precedence, they are applied from left to right.\n\nYou may assume that there is no division by zero.\n\nAll calculation is performed as integers, and after the decimal point should be truncated\n\nLength of the expression will not exceed 100.\n\n-1 × 109 ≤ intermediate results of computation ≤ 109\n\nInput\n\nThe input is a sequence of datasets. The first line contains an integer n which represents the number of datasets. There will be n lines where each line contains an expression.\n\nOutput\n\nFor each datasets, prints the result of calculation.\n\nSample Input\n\n2\n4-2*3=\n4*(8+4+3)=\n\nOutput for the Sample Input\n\n-2\n60", "sample_input": "2\n4-2*3=\n4*(8+4+3)=\n"}, "reference_outputs": ["-2\n60\n"], "source_document_id": "p00109", "source_text": "Smart Calculator\n\nYour task is to write a program which reads an expression and evaluates it.\n\nThe expression consists of numerical values, operators and parentheses, and the ends with '='.\n\nThe operators includes +, - , *, / where respectively represents, addition, subtraction, multiplication and division.\n\nPrecedence of the operators is based on usual laws. That is one should perform all multiplication and division first, then addition and subtraction. When two operators have the same precedence, they are applied from left to right.\n\nYou may assume that there is no division by zero.\n\nAll calculation is performed as integers, and after the decimal point should be truncated\n\nLength of the expression will not exceed 100.\n\n-1 × 109 ≤ intermediate results of computation ≤ 109\n\nInput\n\nThe input is a sequence of datasets. The first line contains an integer n which represents the number of datasets. There will be n lines where each line contains an expression.\n\nOutput\n\nFor each datasets, prints the result of calculation.\n\nSample Input\n\n2\n4-2*3=\n4*(8+4+3)=\n\nOutput for the Sample Input\n\n-2\n60", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1231, "cpu_time_ms": 90, "memory_kb": 12000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s010508187", "group_id": "codeNet:p00110", "input_text": "import java.math.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n \n while (sc.hasNext()) {\n String line = sc.next();\n boolean flag = false;\n for (char c = '0'; c <= '9'; ++c) {\n String temp = line;\n temp = temp.replace('X', c);\n String[] elem = temp.split(\"[^0-9]\");\n\n boolean ok = true;\n for (int i = 0; i < 3; ++i) {\n if (elem[i].length() > 1 && elem[i].charAt(0) == '0') {\n ok = false;\n }\n }\n if (!ok) continue;\n\n BigInteger l1 = new BigInteger(elem[0]);\n BigInteger l2 = new BigInteger(elem[1]);\n BigInteger r = new BigInteger(elem[2]);\n\n l1 = l1.add(l2);\n if (l1.equals(r)) {\n System.out.println(c); flag = true; break;\n }\n }\n if (!flag) {\n System.out.println(\"NA\");\n }\n }\n \n }\n}", "language": "Java", "metadata": {"date": 1319895787, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00110.html", "problem_id": "p00110", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00110/input.txt", "sample_output_relpath": "derived/input_output/data/p00110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00110/Java/s010508187.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s010508187", "user_id": "u071427789"}, "prompt_components": {"gold_output": "5\nNA\n1\n", "input_to_evaluate": "import java.math.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n \n while (sc.hasNext()) {\n String line = sc.next();\n boolean flag = false;\n for (char c = '0'; c <= '9'; ++c) {\n String temp = line;\n temp = temp.replace('X', c);\n String[] elem = temp.split(\"[^0-9]\");\n\n boolean ok = true;\n for (int i = 0; i < 3; ++i) {\n if (elem[i].length() > 1 && elem[i].charAt(0) == '0') {\n ok = false;\n }\n }\n if (!ok) continue;\n\n BigInteger l1 = new BigInteger(elem[0]);\n BigInteger l2 = new BigInteger(elem[1]);\n BigInteger r = new BigInteger(elem[2]);\n\n l1 = l1.add(l2);\n if (l1.equals(r)) {\n System.out.println(c); flag = true; break;\n }\n }\n if (!flag) {\n System.out.println(\"NA\");\n }\n }\n \n }\n}", "problem_context": "覆面算\n\n数式の一部を隠してしまって、隠した数字を探す問題を覆面算といいます。今回は、数式の中のある数字のいくつかを X で隠してしまった式を扱います。以下の数式を入力して、結果を出力するプログラムを作成してください。\n\n数式\n\n「数字列 + 数字列 = 数字列」の形で、1 行の単純な足し算式です。\n\n「数字列」は、数字 0 から 9 と文字 X の並びです。\n\n2 桁以上の「数字列」の左端の数字は 0 ではないものとします。\n\nX は、数式全体の中で必ず 1 つ以上含まれます。\n\n結果\n\n覆面算の答えです。数式が成り立つ様な X の値で 0 ~ 9 のどれか 1 つです。2 つ以上の答えはないものとします。\n\n答えがない場合、結果は“NA”としてください。\n\nInput\n\n複数のデータセットが与えられます。各データセットとして、X を 1 つ以上含む足し算式(空白を含まない 126 文字以内の文字列) が１行に与えられます。データセットの数は 150 を超えません。\n\nOutput\n\n各データセットについて、覆面算の結果を１行に出力してください。数字 0 ~ 9 または NA を出力してください。\n\nSample Input\n\n123+4X6=X79\n12X+4X6=X79\nXX22+89=X2XX\n\nOutput for the Sample Input\n\n5\nNA\n1", "sample_input": "123+4X6=X79\n12X+4X6=X79\nXX22+89=X2XX\n"}, "reference_outputs": ["5\nNA\n1\n"], "source_document_id": "p00110", "source_text": "覆面算\n\n数式の一部を隠してしまって、隠した数字を探す問題を覆面算といいます。今回は、数式の中のある数字のいくつかを X で隠してしまった式を扱います。以下の数式を入力して、結果を出力するプログラムを作成してください。\n\n数式\n\n「数字列 + 数字列 = 数字列」の形で、1 行の単純な足し算式です。\n\n「数字列」は、数字 0 から 9 と文字 X の並びです。\n\n2 桁以上の「数字列」の左端の数字は 0 ではないものとします。\n\nX は、数式全体の中で必ず 1 つ以上含まれます。\n\n結果\n\n覆面算の答えです。数式が成り立つ様な X の値で 0 ~ 9 のどれか 1 つです。2 つ以上の答えはないものとします。\n\n答えがない場合、結果は“NA”としてください。\n\nInput\n\n複数のデータセットが与えられます。各データセットとして、X を 1 つ以上含む足し算式(空白を含まない 126 文字以内の文字列) が１行に与えられます。データセットの数は 150 を超えません。\n\nOutput\n\n各データセットについて、覆面算の結果を１行に出力してください。数字 0 ~ 9 または NA を出力してください。\n\nSample Input\n\n123+4X6=X79\n12X+4X6=X79\nXX22+89=X2XX\n\nOutput for the Sample Input\n\n5\nNA\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 943, "cpu_time_ms": 140, "memory_kb": 12000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s459915287", "group_id": "codeNet:p00110", "input_text": "\nimport java.math.BigInteger;\nimport java.util.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\npublic class Main {\n\n\tint INF = 1 << 28;\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(;sc.hasNext();) {\n\t\t\tString formula = sc.next();\n\t\t\tString[] str = formula.split(\"[ + = ]\");\n\t\t\tboolean f = true;\n\t\t\tfor(String s: str) f = !(s.length() != 1 && s.charAt(0) == '0');\n\t\t\tint i=0;\n\t\t\tfor(i=f? 0: 1;i<10;i++) {\n\t\t\t\tif(isequal(formula, i)) break;\n\t\t\t}\n\t\t\tSystem.out.println((i==10? \"NA\": i));\n\t\t}\n\t}\n\t\n\tboolean isequal(String formula, int i) {\n\t\tString[] s = formula.replace('X', (char) (i+'0')).split(\"[ + = ]\");\n\t\tBigInteger v1 = new BigInteger(s[0]);\n\t\tBigInteger v2 = new BigInteger(s[1]);\n\t\tBigInteger v3 = new BigInteger(s[2]);\n\t\t\n\t\treturn v1.add(v2).compareTo(v3) == 0;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tvoid debug(Object... os) {\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n}", "language": "Java", "metadata": {"date": 1343400387, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00110.html", "problem_id": "p00110", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00110/input.txt", "sample_output_relpath": "derived/input_output/data/p00110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00110/Java/s459915287.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s459915287", "user_id": "u358879127"}, "prompt_components": {"gold_output": "5\nNA\n1\n", "input_to_evaluate": "\nimport java.math.BigInteger;\nimport java.util.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\npublic class Main {\n\n\tint INF = 1 << 28;\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tfor(;sc.hasNext();) {\n\t\t\tString formula = sc.next();\n\t\t\tString[] str = formula.split(\"[ + = ]\");\n\t\t\tboolean f = true;\n\t\t\tfor(String s: str) f = !(s.length() != 1 && s.charAt(0) == '0');\n\t\t\tint i=0;\n\t\t\tfor(i=f? 0: 1;i<10;i++) {\n\t\t\t\tif(isequal(formula, i)) break;\n\t\t\t}\n\t\t\tSystem.out.println((i==10? \"NA\": i));\n\t\t}\n\t}\n\t\n\tboolean isequal(String formula, int i) {\n\t\tString[] s = formula.replace('X', (char) (i+'0')).split(\"[ + = ]\");\n\t\tBigInteger v1 = new BigInteger(s[0]);\n\t\tBigInteger v2 = new BigInteger(s[1]);\n\t\tBigInteger v3 = new BigInteger(s[2]);\n\t\t\n\t\treturn v1.add(v2).compareTo(v3) == 0;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tvoid debug(Object... os) {\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n}", "problem_context": "覆面算\n\n数式の一部を隠してしまって、隠した数字を探す問題を覆面算といいます。今回は、数式の中のある数字のいく��かを X で隠してしまった式を扱います。以下の数式を入力して、結果を出力するプログラムを作成してください。\n\n数式\n\n「数字列 + 数字列 = 数字列」の形で、1 行の単純な足し算式です。\n\n「数字列」は、数字 0 から 9 と文字 X の並びです。\n\n2 桁以上の「数字列」の左端の数字は 0 ではないものとします。\n\nX は、数式全体の中で必ず 1 つ以上含まれます。\n\n結果\n\n覆面算の答えです。数式が成り立つ様な X の値で 0 ~ 9 のどれか 1 つです。2 つ以上の答えはないものとします。\n\n答えがない場合、結果は“NA”としてください。\n\nInput\n\n複数のデータセットが与えられます。各データセットとして、X を 1 つ以上含む足し算式(空白を含まない 126 文字以内の文字列) が１行に与えられます。データセットの数は 150 を超えません。\n\nOutput\n\n各データセットについて、覆面算の結果を１行に出力してください。数字 0 ~ 9 または NA を出力してください。\n\nSample Input\n\n123+4X6=X79\n12X+4X6=X79\nXX22+89=X2XX\n\nOutput for the Sample Input\n\n5\nNA\n1", "sample_input": "123+4X6=X79\n12X+4X6=X79\nXX22+89=X2XX\n"}, "reference_outputs": ["5\nNA\n1\n"], "source_document_id": "p00110", "source_text": "覆面算\n\n数式の一部を隠してしまって、隠した数字を探す問題を覆面算といいます。今回は、数式の中のある数字のいくつかを X で隠してしまった式を扱います。以下の数式を入力して、結果を出力するプログラムを作成してください。\n\n数式\n\n「数字列 + 数字列 = 数字列」の形で、1 行の単純な足し算式です。\n\n「数字列」は、数字 0 から 9 と文字 X の並びです。\n\n2 桁以上の「数字列」の左端の数字は 0 ではないものとします。\n\nX は、数式全体の中で必ず 1 つ以上含まれます。\n\n結果\n\n覆面算の答えです。数式が成り立つ様な X の値で 0 ~ 9 のどれか 1 つです。2 つ以上の答えはないものとします。\n\n答えがない場合、結果は“NA”としてください。\n\nInput\n\n複数のデータセットが与えられます。各データセットとして、X を 1 つ以上含む足し算式(空白を含まない 126 文字以内の文字列) が１行に与えられます。データセットの数は 150 を超えません。\n\nOutput\n\n各データセットについて、覆面算の結果を１行に出力してください。数字 0 ~ 9 または NA を出力してください。\n\nSample Input\n\n123+4X6=X79\n12X+4X6=X79\nXX22+89=X2XX\n\nOutput for the Sample Input\n\n5\nNA\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 955, "cpu_time_ms": 120, "memory_kb": 12000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s477145643", "group_id": "codeNet:p00121", "input_text": "\n\nimport java.util.HashMap;\nimport java.util.LinkedList;\nimport java.util.Map;\nimport java.util.Queue;\nimport java.util.Scanner;\n\n\n/**\n * \n * @author DemonSong\n * \n * 0121. Seven Puzzle\n * \n * 7 ????????? 7 ???????????? 8\n * ????????£?????¢??????????????¨??????????????????????????´????????¨??????????????§?§????????????????????????????????????????????????????????????????????????\\??§??????????????? 0, 1, 2,\n * ..., 7 ??¨?????????????????????????????????????????????????????? 2 ???????¨???? 4 ????????????????????????????????¨?????§????????????\n * \n * 7 ?????????????§?????????¨??????????????????????????????????????????????????\\??????????????????????????§ 0\n * ?????????????????????????????????????????£??\\?????????????????¨??????????????????????????¨?????§?????????????????¨?????°???????????¶?????????(a) ?????¨?????????0\n * ???????????????????????£??\\?????????7 ??????????????¨???????????????????????°??????(b) ?????¶???????????????????????????????????????(a) ?????¶????????? 0\n * ???????????????????????£??\\?????? 2 ??????????????¨???????????????????????°???(c) ?????¶????????????????????????(a) ?????¶?????§ 0\n * ??????????????¨?????????????????£??\\?????????????????? 7 ??¨ 2 ??????????????????????????§???????????\\?????????????????\\?????????????¨±??????????????????\n * \n * ??????????????????????????????????????????????????´????????????(d)\n * ?????¶?????????????????¨??§?????????????????¶????????\\?????¨????????????????????????????????´??????????????§???????????????????°??????°???????????????????????°??????????????????????????????????????????????????\\??????????????????????????¶???????????????(d)\n * ?????¶???????§?????????¨???????????§????????¨????????????\n * \n * ??\\??????????????????1 ?????? 8 ????????°???????????????????????§???????????????????????????????????????????????¶?????????????????????????????¨????????????????????°??????(a)\n * ?????°?????¨??????0 7 3 4 2 5 1 6 ?????????(c) ??? 2 7 3 4 0 5 1 6 ??¨???????????????\n * \n * \n * ???(a) 0 7 3 4 2 5 1 6 ?????´??? ???(b) 7 0 3 4 2 5 1 6 ?????´???\n * \n * \n * \n * ???(c) 2 7 3 4 0 5 1 6 ?????´??? ???(d) 0 1 2 3 4 5 6 7 (????????¶???)\n * \n * Input ????¨???¢?????§?????°??????????????????????????????????????\\?????????????????§??????????????????????????? ?????????????????????????????°??? 1,000 ??\\?????§??????\n * \n * Output ???????????????????????????????????¶???????§??????????????°??????°???????????????????????????????????????\n * \n * Sample Input 0 1 2 3 4 5 6 7 1 0 2 3 4 5 6 7 7 6 5 4 3 2 1 0 Output\n * for the Sample Input 0 1 28\n *\n */\npublic class Main{\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint[][] nums = new int[2][4];\n\t\tMap map = bfs();\n\t\twhile(in.hasNext()){\n\t\t\tfor (int i = 0; i < 2; i++){\n\t\t\t\tfor (int j = 0; j < 4; j++){\n\t\t\t\t\tnums[i][j] = in.nextInt();\n\t\t\t\t}\n\t\t\t}\n\t\t\tString key = \"\";\n\t\t\tfor (int i = 0; i < 2; i++){\n\t\t\t\tfor (int j = 0; j < 4; j++){\n\t\t\t\t\tkey += nums[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(map.get(key));\n\t\t}\n\t\tin.close();\n\t}\n\t\n\tstatic int[][] dir = {{-1,0},{1,0},{0,-1},{0,1}};\n\t\n\t\n\tprivate static Map bfs(){\n\t\tMap map = new HashMap<>();\n\t\tmap.put(\"01234567\", 0);\n\t\tchar[][] init = {{'0','1','2','3'},{'4','5','6','7'}};\n\t\tQueue queue = new LinkedList<>();\n\t\tqueue.offer(init);\n\t\t\n\t\twhile (!queue.isEmpty()){\n\t\t\tchar[][] now = queue.poll();\n\t\t\t\n\t\t\tString nows = \"\";\n\t\t\t\n\t\t\tint[] cur = new int[2];\n\t\t\tfor (int i = 0; i < 2; i++){\n\t\t\t\tfor (int j = 0; j < 4; j++){\n\t\t\t\t\tnows += now[i][j]-'0';\n\t\t\t\t\tif (now[i][j] == '0'){\n\t\t\t\t\t\tcur[0] = i;\n\t\t\t\t\t\tcur[1] = j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int[] d : dir){\n\t\t\t\tint nx = cur[0] + d[0];\n\t\t\t\tint ny = cur[1] + d[1];\n\t\t\t\tif (nx >= 0 && nx < 2 && ny >= 0 && ny < 4){\n\t\t\t\t\tchar[][] next = clone(now);\n\t\t\t\t\tswap(next, cur[0], cur[1], nx, ny);\n\t\t\t\t\tchar[] ss = new char[8];\n\t\t\t\t\tfor (int i = 0, k = 0; i < 2; i++){\n\t\t\t\t\t\tfor (int j = 0; j < 4; j++){\n\t\t\t\t\t\t\tss[k++] = next[i][j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tString nn = new String(ss);\n\t\t\t\t\tif (!map.containsKey(nn)){\n\t\t\t\t\t\tmap.put(nn, map.get(nows)+1);\n\t\t\t\t\t\tqueue.offer(next);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn map;\n\t}\n\t\n\tprivate static char[][] clone(char[][] now){\n\t\tint row = now.length;\n\t\tint col = now[0].length;\n\t\tchar[][] clone = new char[row][col];\n\t\tfor (int i = 0; i < row; i++){\n\t\t\tfor (int j = 0; j < col; j++){\n\t\t\t\tclone[i][j] = now[i][j];\n\t\t\t}\n\t\t}\n\t\treturn clone;\n\t}\n\t\n\tprivate static void swap(char[][] map, int x1, int y1, int x2, int y2){\n\t\tchar tmp = map[x1][y1];\n\t\tmap[x1][y1] = map[x2][y2];\n\t\tmap[x2][y2] = tmp;\n\t}\n\t\n}", "language": "Java", "metadata": {"date": 1495110119, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00121.html", "problem_id": "p00121", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00121/input.txt", "sample_output_relpath": "derived/input_output/data/p00121/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00121/Java/s477145643.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s477145643", "user_id": "u814815126"}, "prompt_components": {"gold_output": "0\n1\n28\n", "input_to_evaluate": "\n\nimport java.util.HashMap;\nimport java.util.LinkedList;\nimport java.util.Map;\nimport java.util.Queue;\nimport java.util.Scanner;\n\n\n/**\n * \n * @author DemonSong\n * \n * 0121. Seven Puzzle\n * \n * 7 ????????? 7 ???????????? 8\n * ????????£?????¢??????????????¨??????????????????????????´????????¨??????????????§?§????????????????????????????????????????????????????????????????????????\\??§??????????????? 0, 1, 2,\n * ..., 7 ??¨?????????????????????????????????????????????????????? 2 ???????¨???? 4 ????????????????????????????????¨?????§????????????\n * \n * 7 ?????????????§?????????¨??????????????????????????????????????????????????\\??????????????????????????§ 0\n * ?????????????????????????????????????????£??\\?????????????????¨??????????????????????????¨?????§?????????????????¨?????°???????????¶?????????(a) ?????¨?????????0\n * ???????????????????????£??\\?????????7 ??????????????¨???????????????????????°??????(b) ?????¶???????????????????????????????????????(a) ?????¶????????? 0\n * ???????????????????????£??\\?????? 2 ??????????????¨???????????????????????°???(c) ?????¶????????????????????????(a) ?????¶?????§ 0\n * ??????????????¨?????????????????£??\\?????????????????? 7 ??¨ 2 ??????????????????????????§???????????\\?????????????????\\?????????????¨±??????????????????\n * \n * ??????????????????????????????????????????????????´????????????(d)\n * ?????¶?????????????????¨??§?????????????????¶????????\\?????¨????????????????????????????????´??????????????§???????????????????°??????°???????????????????????°??????????????????????????????????????????????????\\??????????????????????????¶???????????????(d)\n * ?????¶???????§?????????¨???????????§????????¨????????????\n * \n * ??\\??????????????????1 ?????? 8 ????????°???????????????????????§???????????????????????????????????????????????¶?????????????????????????????¨????????????????????°??????(a)\n * ?????°?????¨??????0 7 3 4 2 5 1 6 ?????????(c) ??? 2 7 3 4 0 5 1 6 ??¨???????????????\n * \n * \n * ???(a) 0 7 3 4 2 5 1 6 ?????´??? ???(b) 7 0 3 4 2 5 1 6 ?????´???\n * \n * \n * \n * ???(c) 2 7 3 4 0 5 1 6 ?????´??? ???(d) 0 1 2 3 4 5 6 7 (????????¶???)\n * \n * Input ????¨???¢?????§?????°??????????????????????????????????????\\?????????????????§??????????????????????????? ?????????????????????????????°??? 1,000 ??\\?????§??????\n * \n * Output ???????????????????????????????????¶???????§??????????????°??????°???????????????????????????????????????\n * \n * Sample Input 0 1 2 3 4 5 6 7 1 0 2 3 4 5 6 7 7 6 5 4 3 2 1 0 Output\n * for the Sample Input 0 1 28\n *\n */\npublic class Main{\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint[][] nums = new int[2][4];\n\t\tMap map = bfs();\n\t\twhile(in.hasNext()){\n\t\t\tfor (int i = 0; i < 2; i++){\n\t\t\t\tfor (int j = 0; j < 4; j++){\n\t\t\t\t\tnums[i][j] = in.nextInt();\n\t\t\t\t}\n\t\t\t}\n\t\t\tString key = \"\";\n\t\t\tfor (int i = 0; i < 2; i++){\n\t\t\t\tfor (int j = 0; j < 4; j++){\n\t\t\t\t\tkey += nums[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(map.get(key));\n\t\t}\n\t\tin.close();\n\t}\n\t\n\tstatic int[][] dir = {{-1,0},{1,0},{0,-1},{0,1}};\n\t\n\t\n\tprivate static Map bfs(){\n\t\tMap map = new HashMap<>();\n\t\tmap.put(\"01234567\", 0);\n\t\tchar[][] init = {{'0','1','2','3'},{'4','5','6','7'}};\n\t\tQueue queue = new LinkedList<>();\n\t\tqueue.offer(init);\n\t\t\n\t\twhile (!queue.isEmpty()){\n\t\t\tchar[][] now = queue.poll();\n\t\t\t\n\t\t\tString nows = \"\";\n\t\t\t\n\t\t\tint[] cur = new int[2];\n\t\t\tfor (int i = 0; i < 2; i++){\n\t\t\t\tfor (int j = 0; j < 4; j++){\n\t\t\t\t\tnows += now[i][j]-'0';\n\t\t\t\t\tif (now[i][j] == '0'){\n\t\t\t\t\t\tcur[0] = i;\n\t\t\t\t\t\tcur[1] = j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (int[] d : dir){\n\t\t\t\tint nx = cur[0] + d[0];\n\t\t\t\tint ny = cur[1] + d[1];\n\t\t\t\tif (nx >= 0 && nx < 2 && ny >= 0 && ny < 4){\n\t\t\t\t\tchar[][] next = clone(now);\n\t\t\t\t\tswap(next, cur[0], cur[1], nx, ny);\n\t\t\t\t\tchar[] ss = new char[8];\n\t\t\t\t\tfor (int i = 0, k = 0; i < 2; i++){\n\t\t\t\t\t\tfor (int j = 0; j < 4; j++){\n\t\t\t\t\t\t\tss[k++] = next[i][j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tString nn = new String(ss);\n\t\t\t\t\tif (!map.containsKey(nn)){\n\t\t\t\t\t\tmap.put(nn, map.get(nows)+1);\n\t\t\t\t\t\tqueue.offer(next);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn map;\n\t}\n\t\n\tprivate static char[][] clone(char[][] now){\n\t\tint row = now.length;\n\t\tint col = now[0].length;\n\t\tchar[][] clone = new char[row][col];\n\t\tfor (int i = 0; i < row; i++){\n\t\t\tfor (int j = 0; j < col; j++){\n\t\t\t\tclone[i][j] = now[i][j];\n\t\t\t}\n\t\t}\n\t\treturn clone;\n\t}\n\t\n\tprivate static void swap(char[][] map, int x1, int y1, int x2, int y2){\n\t\tchar tmp = map[x1][y1];\n\t\tmap[x1][y1] = map[x2][y2];\n\t\tmap[x2][y2] = tmp;\n\t}\n\t\n}", "problem_context": "7 パズル\n\n7 パズルは 8 つの正方形のカードとこれらのカードがぴたりと収まる枠で構成されています。それぞれのカードには、互いに区別できるように 0, 1, 2, ..., 7 と番号がつけられています。枠には、縦に 2 個、横に 4 個のカードを並べることができます。\n\n7 パズルを始めるときには、まず枠にすべてのカードを入れます。枠のなかで 0 のカードだけは、上下左右に隣接するカードと位置を交換することができます。たとえば、枠の状態が図(a) のときに、0 のカードの右に隣接した、7 のカードと位置を交換すれば、図(b) の状態になります。あるいは、図(a) の状態から 0 のカードの下に隣接した 2 のカードと位置を��換すれば図(c) の状態になります。図(a) の状態で 0 のカードと上下左右に隣接するカードは 7 と 2 のカードだけなので、これ以外の位置の入れ替えは許されません。\n\nゲームの目的は、カードをきれいに整列して図(d) の状態にすることです。最初の状態を入力とし、カードをきれいに整列するまでに、必要な最小手数を出力するプログラムを作成してください。ただし、入力されたカードの状態からは図(d) の状態に移ることは可能であるとします。\n\n入力データは、1 行に 8 つの数字が空白区切りで与えられます。これらは、最初の状態のカードの並びを表します。例えば、図(a) の数字表現は0 7 3 4 2 5 1 6 に、図(c) は 2 7 3 4 0 5 1 6 となります。\n\n図(a) 0 7 3 4 2 5 1 6 の場合\n\n図(b) 7 0 3 4 2 5 1 6 の場合\n\n図(c) 2 7 3 4 0 5 1 6 の場合\n\n図(d) 0 1 2 3 4 5 6 7 (最終状態)\n\nInput\n\n上記形式で複数のパズルが与えられます。入力の最後まで処理してください。\n与えられるパズルの数は 1,000 以下です。\n\nOutput\n\n各パズルについて、最終状態へ移行する最小手数を１行に出力してください。\n\nSample Input\n\n0 1 2 3 4 5 6 7\n1 0 2 3 4 5 6 7\n7 6 5 4 3 2 1 0\n\nOutput for the Sample Input\n\n0\n1\n28", "sample_input": "0 1 2 3 4 5 6 7\n1 0 2 3 4 5 6 7\n7 6 5 4 3 2 1 0\n"}, "reference_outputs": ["0\n1\n28\n"], "source_document_id": "p00121", "source_text": "7 パズル\n\n7 パズルは 8 つの正方形のカードとこれらのカードがぴたりと収まる枠で構成されています。それぞれのカードには、互いに区別できるように 0, 1, 2, ..., 7 と番号がつけられています。枠には、縦に 2 個、横に 4 個のカードを並べることができます。\n\n7 パズルを始めるときには、まず枠にすべてのカードを入れます。枠のなかで 0 のカードだけは、上下左右に隣接するカードと位置を交換することができます。たとえば、枠の状態が図(a) のときに、0 のカードの右に隣接した、7 のカードと位置を交換すれば、図(b) の状態になります。あるいは、図(a) の状態から 0 のカードの下に隣接した 2 のカードと位置を交換すれば図(c) の状態になります。図(a) の状態で 0 のカードと上下左右に隣接するカードは 7 と 2 のカードだけなので、これ以外の位置の入れ替えは許されません。\n\nゲームの目的は、カードをきれいに整列して図(d) の状態にすることです。最初の状態を入力とし、カードをきれいに整列するまでに、必要な最小手数を出力するプログラムを作成してください。ただし、入力されたカードの状態からは図(d) の状態に移ることは可能であるとします。\n\n入力データは、1 行に 8 つの数字が空白区切りで与えられます。これらは、最初の状態のカードの並びを表します。例えば、図(a) の数字表現は0 7 3 4 2 5 1 6 に、図(c) は 2 7 3 4 0 5 1 6 となります。\n\n図(a) 0 7 3 4 2 5 1 6 の場合\n\n図(b) 7 0 3 4 2 5 1 6 の場合\n\n図(c) 2 7 3 4 0 5 1 6 の場合\n\n図(d) 0 1 2 3 4 5 6 7 (最終状態)\n\nInput\n\n上記形式で複数のパズルが与えられます。入力の最後まで処理してください。\n与えられるパズルの数は 1,000 以下です。\n\nOutput\n\n各パズルについて、最終状態へ移行する最小手数を１行に出力してください。\n\nSample Input\n\n0 1 2 3 4 5 6 7\n1 0 2 3 4 5 6 7\n7 6 5 4 3 2 1 0\n\nOutput for the Sample Input\n\n0\n1\n28", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4758, "cpu_time_ms": 340, "memory_kb": 66644}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s797401586", "group_id": "codeNet:p00121", "input_text": "import java.util.*;\n \npublic class Main{\n \n int[] v;\n int[] dx = {0,0,1,-1};\n int[] dy = {1,-1,0,0};\n \n void solve(){\n Scanner sc = new Scanner(System.in);\n\n calc();\n \n while(sc.hasNext()){\n String pzl = \"\";\n for(int i=0; i<2; i++)\n for(int j=0; j<4; j++) pzl += sc.next();\n\n System.out.println(v[Integer.parseInt(pzl)/10]);\n }\n }\n \n void calc(){\n Queue q = new LinkedList();\n q.add(new int[]{1234567,0,0,0});\n\n v = new int[7654322];\n Arrays.fill(v,-1);\n v[123456] = 0;\n \n while(q.size()>0){\n int[] pp = q.poll();\n int x = pp[1], y = pp[2], cnt = pp[3];\n\n String pzzs = String.valueOf(pp[0]);\n if(pzzs.length()==7) pzzs = \"0\" + pzzs;\n char[] c = pzzs.toCharArray();\n \n for(int i=0; i<4; i++){\n int nx = x+dx[i], ny = y+dy[i];\n if(nx<0 || nx>=4 || ny<0 || ny>=2) continue;\n c[y*4+x] = c[ny*4+nx];\n c[ny*4+nx] = '0';\n int ns = Integer.parseInt(String.valueOf(c));\n if(v[ns/10]==-1){\n v[ns/10] = cnt+1;\n q.add(new int[]{ns,nx,ny,cnt+1});\n }\n c[ny*4+nx] = c[y*4+x];\n c[y*4+x] ='0';\n }\n }\n }\n \n public static void main(String[] args){\n new Main().solve();\n }\n}", "language": "Java", "metadata": {"date": 1357024470, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00121.html", "problem_id": "p00121", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00121/input.txt", "sample_output_relpath": "derived/input_output/data/p00121/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00121/Java/s797401586.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s797401586", "user_id": "u036451811"}, "prompt_components": {"gold_output": "0\n1\n28\n", "input_to_evaluate": "import java.util.*;\n \npublic class Main{\n \n int[] v;\n int[] dx = {0,0,1,-1};\n int[] dy = {1,-1,0,0};\n \n void solve(){\n Scanner sc = new Scanner(System.in);\n\n calc();\n \n while(sc.hasNext()){\n String pzl = \"\";\n for(int i=0; i<2; i++)\n for(int j=0; j<4; j++) pzl += sc.next();\n\n System.out.println(v[Integer.parseInt(pzl)/10]);\n }\n }\n \n void calc(){\n Queue q = new LinkedList();\n q.add(new int[]{1234567,0,0,0});\n\n v = new int[7654322];\n Arrays.fill(v,-1);\n v[123456] = 0;\n \n while(q.size()>0){\n int[] pp = q.poll();\n int x = pp[1], y = pp[2], cnt = pp[3];\n\n String pzzs = String.valueOf(pp[0]);\n if(pzzs.length()==7) pzzs = \"0\" + pzzs;\n char[] c = pzzs.toCharArray();\n \n for(int i=0; i<4; i++){\n int nx = x+dx[i], ny = y+dy[i];\n if(nx<0 || nx>=4 || ny<0 || ny>=2) continue;\n c[y*4+x] = c[ny*4+nx];\n c[ny*4+nx] = '0';\n int ns = Integer.parseInt(String.valueOf(c));\n if(v[ns/10]==-1){\n v[ns/10] = cnt+1;\n q.add(new int[]{ns,nx,ny,cnt+1});\n }\n c[ny*4+nx] = c[y*4+x];\n c[y*4+x] ='0';\n }\n }\n }\n \n public static void main(String[] args){\n new Main().solve();\n }\n}", "problem_context": "7 パズル\n\n7 パズルは 8 つの正方形のカードとこれらのカードがぴたりと収まる枠で構成されています。それぞれのカードには、互いに区別できるように 0, 1, 2, ..., 7 と番号がつけられています。枠には、縦に 2 個、横に 4 個のカードを並べることができます。\n\n7 パズルを始めるときには、まず枠にすべてのカードを入れます。枠のなかで 0 のカードだけは、上下左右に隣接するカードと位置を交換することができます。たとえば、枠の状態が図(a) のときに、0 のカードの右に隣接した、7 のカードと位置を交換すれば、図(b) の状態になります。あるいは、図(a) の状態から 0 のカードの下に隣接した 2 のカードと位置を交換すれば図(c) の状態になります。図(a) の状態で 0 のカードと上下左右に隣接するカードは 7 と 2 のカードだけなので、これ以外の位置の入れ替えは許されません。\n\nゲームの目的は、カードをきれいに整列して図(d) の状態にすることです。最初の状態を入力とし、カードをきれいに整列するまでに、必要な最小手数を出力するプログラムを作成してください。ただし、入力されたカードの状態からは図(d) の状態に移ることは可能であるとします。\n\n入力データは、1 行に 8 つの数字が空白区切りで与えられます。これらは、最初の状態のカードの並びを表します。例えば、図(a) の数字表現は0 7 3 4 2 5 1 6 に、図(c) は 2 7 3 4 0 5 1 6 となります。\n\n図(a) 0 7 3 4 2 5 1 6 の場合\n\n図(b) 7 0 3 4 2 5 1 6 の場合\n\n図(c) 2 7 3 4 0 5 1 6 の場合\n\n図(d) 0 1 2 3 4 5 6 7 (最終状態)\n\nInput\n\n上記形式で複数のパズルが与えられます。入力の最後まで処理してください。\n与えられ���パズルの数は 1,000 以下です。\n\nOutput\n\n各パズルについて、最終状態へ移行する最小手数を１行に出力してください。\n\nSample Input\n\n0 1 2 3 4 5 6 7\n1 0 2 3 4 5 6 7\n7 6 5 4 3 2 1 0\n\nOutput for the Sample Input\n\n0\n1\n28", "sample_input": "0 1 2 3 4 5 6 7\n1 0 2 3 4 5 6 7\n7 6 5 4 3 2 1 0\n"}, "reference_outputs": ["0\n1\n28\n"], "source_document_id": "p00121", "source_text": "7 パズル\n\n7 パズルは 8 つの正方形のカードとこれらのカードがぴたりと収まる枠で構成されています。それぞれのカードには、互いに区別できるように 0, 1, 2, ..., 7 と番号がつけられています。枠には、縦に 2 個、横に 4 個のカードを並べることができます。\n\n7 パズルを始めるときには、まず枠にすべてのカードを入れます。枠のなかで 0 のカードだけは、上下左右に隣接するカードと位置を交換することができます。たとえば、枠の状態が図(a) のときに、0 のカードの右に隣接した、7 のカードと位置を交換すれば、図(b) の状態になります。あるいは、図(a) の状態から 0 のカードの下に隣接した 2 のカードと位置を交換すれば図(c) の状態になります。図(a) の状態で 0 のカードと上下左右に隣接するカードは 7 と 2 のカードだけなので、これ以外の位置の入れ替えは許されません。\n\nゲームの目的は、カードをきれいに整列して図(d) の状態にすることです。最初の状態を入力とし、カードをきれいに整列するまでに、必要な最小手数を出力するプログラムを作成してください。ただし、入力されたカードの状態からは図(d) の状態に移ることは可能であるとします。\n\n入力データは、1 行に 8 つの数字が空白区切りで与えられます。これらは、最初の状態のカードの並びを表します。例えば、図(a) の数字表現は0 7 3 4 2 5 1 6 に、図(c) は 2 7 3 4 0 5 1 6 となります。\n\n図(a) 0 7 3 4 2 5 1 6 の場合\n\n図(b) 7 0 3 4 2 5 1 6 の場合\n\n図(c) 2 7 3 4 0 5 1 6 の場合\n\n図(d) 0 1 2 3 4 5 6 7 (最終状態)\n\nInput\n\n上記形式で複数のパズルが与えられます。入力の最後まで処理してください。\n与えられるパズルの数は 1,000 以下です。\n\nOutput\n\n各パズルについて、最終状態へ移行する最小手数を１行に出力してください。\n\nSample Input\n\n0 1 2 3 4 5 6 7\n1 0 2 3 4 5 6 7\n7 6 5 4 3 2 1 0\n\nOutput for the Sample Input\n\n0\n1\n28", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1478, "cpu_time_ms": 220, "memory_kb": 42000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s948499182", "group_id": "codeNet:p00123", "input_text": "import java.util.Scanner;\nclass Main\n{\n public static void main(String args[])\n {\n\tScanner scan=new Scanner(System.in);\n\twhile(scan.hasNext())\n\t {\n\t\tdouble f,t;\n\t\t\n\t\tf=scan.nextDouble();\n\t\tt=scan.nextDouble();\n\t\tString str=\"\";\n\t\tif(f>=1*60+10.0 || t>=2*60+28.0)str=\"NA\";\n\t\tif(f<1*60+10.0 && t<2*60+28.0) str=\"E\";\t \n\t\tif(f<55.0 && t<1*60+56.0)str=\"D\";\n\t\tif(f<50.0 && t<1*60+45.0)str=\"C\";\n\t\tif(f<43.0 && t<1*60+29.0)str=\"B\";\n\t\tif(f<40.0 && t<1*60+23.0)str=\"A\";\n\t\tif(f<37+0.5 && t<1*60+17.0)str=\"AA\";\n\t\tif(f<35+0.5 && t<1*60+11.0)str=\"AAA\";\n\t\t\n\t\tSystem.out.println(str);\n\t }\n }\n}", "language": "Java", "metadata": {"date": 1399727342, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00123.html", "problem_id": "p00123", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00123/input.txt", "sample_output_relpath": "derived/input_output/data/p00123/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00123/Java/s948499182.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s948499182", "user_id": "u814387366"}, "prompt_components": {"gold_output": "B\nNA\n", "input_to_evaluate": "import java.util.Scanner;\nclass Main\n{\n public static void main(String args[])\n {\n\tScanner scan=new Scanner(System.in);\n\twhile(scan.hasNext())\n\t {\n\t\tdouble f,t;\n\t\t\n\t\tf=scan.nextDouble();\n\t\tt=scan.nextDouble();\n\t\tString str=\"\";\n\t\tif(f>=1*60+10.0 || t>=2*60+28.0)str=\"NA\";\n\t\tif(f<1*60+10.0 && t<2*60+28.0) str=\"E\";\t \n\t\tif(f<55.0 && t<1*60+56.0)str=\"D\";\n\t\tif(f<50.0 && t<1*60+45.0)str=\"C\";\n\t\tif(f<43.0 && t<1*60+29.0)str=\"B\";\n\t\tif(f<40.0 && t<1*60+23.0)str=\"A\";\n\t\tif(f<37+0.5 && t<1*60+17.0)str=\"AA\";\n\t\tif(f<35+0.5 && t<1*60+11.0)str=\"AAA\";\n\t\t\n\t\tSystem.out.println(str);\n\t }\n }\n}", "problem_context": "スピードスケートバッジテスト\n\nスピードスケートバッジテストでは、2 種類の距離で規定されたタイムを上回った場合に級が認定されます。例えば A 級になるには 500 M で 40.0 秒未満、かつ 1000 M で 1 分 23 秒未満であることが求められます。\n\nスピードスケート大会 (500 M と 1000 M) で記録したタイムを入力とし、スピードスケートバッジテストで何級に相当するかを出力するプログラムを作成して下さい。500 M と1000 M のバッジテスト規定タイムは下表のとおりです。 E 級に満たなかった場合には、NA と出力してください。\n\n500 M\n\n1000 M\n\nAAA 級\n\n35 秒 50\n\n1 分 11 秒 00\n\nAA 級\n\n37 秒 50\n\n1 分 17 秒 00\n\nA 級\n\n40 秒 00\n\n1 分 23 秒 00\n\nB 級\n\n43 秒 00\n\n1 分 29 秒 00\n\nC 級\n\n50 秒 00\n\n1 分 45 秒 00\n\nD 級\n\n55 秒 00\n\n1 分 56 秒 00\n\nE 級\n\n1分10 秒 00\n\n2 分 28 秒 00\n\nInput\n\n複数のデータセットが与えられます。各データセットとして、500 M タイムと 1000 M タイムをそれぞれ表す実数 t1, t2 (8.0 ≤ t1, t2 ≤ 360.0) が空白区切りで与えられます。t1, t2 は秒単位で小数点以下最大 2 桁までの数字を含む実数で与えられます。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n各データセットごとに、判定結果 AAA ~ E または NA を１行に出力してください。\n\nSample Input\n\n40.0 70.0\n72.5 140.51\n\nOutput for the Sample Input\n\nB\nNA", "sample_input": "40.0 70.0\n72.5 140.51\n"}, "reference_outputs": ["B\nNA\n"], "source_document_id": "p00123", "source_text": "スピードスケートバッジテスト\n\nスピードスケートバッジテストでは、2 種類の距離で規定されたタイムを上回った場合に級が認定されます。例えば A 級になるには 500 M で 40.0 秒未満、かつ 1000 M で 1 分 23 秒未満であることが求められます。\n\nスピードスケート大会 (500 M と 1000 M) で記録したタイムを入力とし、スピードスケートバッジテストで何級に相当するかを出力するプログラムを作成して下さい。500 M と1000 M のバッジテスト規定タイムは下表のとおりです。 E 級に満たなかった場合には、NA と出力してください。\n\n500 M\n\n1000 M\n\nAAA 級\n\n35 秒 50\n\n1 分 11 秒 00\n\nAA 級\n\n37 秒 50\n\n1 分 17 秒 00\n\nA 級\n\n40 秒 00\n\n1 分 23 秒 00\n\nB 級\n\n43 秒 00\n\n1 分 29 秒 00\n\nC 級\n\n50 秒 00\n\n1 分 45 秒 00\n\nD 級\n\n55 秒 00\n\n1 分 56 秒 00\n\nE 級\n\n1分10 秒 00\n\n2 分 28 秒 00\n\nInput\n\n複数のデータセットが与えられます。各データセットとして、500 M タイムと 1000 M タイムをそれぞれ表す実数 t1, t2 (8.0 ≤ t1, t2 ≤ 360.0) が空白区切りで与えられます。t1, t2 は秒単位で小数点以下最大 2 桁までの数字を含む実数で与えられます。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n各データセットごとに、判定結果 AAA ~ E または NA を１行に出力してください。\n\nSample Input\n\n40.0 70.0\n72.5 140.51\n\nOutput for the Sample Input\n\nB\nNA", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 594, "cpu_time_ms": 70, "memory_kb": 20512}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s300161439", "group_id": "codeNet:p00147", "input_text": "import static java.util.Arrays.deepToString;\n\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.concurrent.PriorityBlockingQueue;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\tvoid tr(Object... os) {\n\t\tSystem.err.println(deepToString(os));\n\t}\n\n\tScanner sc = new Scanner(System.in);\n\t\n\tint[] ans;\n\tpublic void run() {\n\t\tans = new int[100];\n\t\t\n\t\tPriorityQueue pq = new PriorityQueue();\n\t\tint[] table = new int[17];\n\t\tArrays.fill(table, -1);\n\t\tint nextGroup = 0;\n\t\tfor (int i = 0; i < 100; i++) {\n\t\t\tEvent e = new Event();\n\t\t\te.id = i;\n\t\t\te.move = Event.ARRIVE;\n\t\t\te.time = i * 5;\n\t\t\te.num = i % 5 == 1 ? 5 : 2;\n\t\t\te.duration = 17*(i%2) + 3*(i%3)+19;\n\t\t\tpq.add(e);\n\t\t}\n\t\twhile (!pq.isEmpty()) {\n\t\t\tEvent e = pq.poll();\n//\t\t\ttr(e.time, e.id, e.move, table);\n\t\t\tif (e.move == Event.LEAVE) {\n\t\t\t\tfor (int i = 0; i < table.length; i++) {\n\t\t\t\t\tif (table[i] == e.id) table[i] = -1;\n\t\t\t\t}\n\t\t\t} else if (e.move == Event.ARRIVE) {\n\t\t\t\tint pos = -1;\n\t\t\t\tif (nextGroup == e.id) {\n\t\t\t\t\tfor (int i = 0; i + e.num < table.length; i++) {\n\t\t\t\t\t\tboolean ok = true;\n\t\t\t\t\t\tfor (int j = 0; j < e.num; j++) {\n\t\t\t\t\t\t\tif (table[i+j] != -1) {\n\t\t\t\t\t\t\t\tok = false;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (ok) {\n\t\t\t\t\t\t\tpos = i;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (pos >= 0) {\n\t\t\t\t\t// 座る\n\t\t\t\t\tans[e.id] = e.time - e.id * 5;\n\t\t\t\t\tfor (int j = 0; j < e.num; j++) {\n\t\t\t\t\t\ttable[pos + j] = e.id;\n\t\t\t\t\t}\n\t\t\t\t\te.time += e.duration;\n\t\t\t\t\te.move = Event.LEAVE;\n\t\t\t\t\tpq.add(e);\n\t\t\t\t\tnextGroup++;\n\t\t\t\t} else {\n\t\t\t\t\t// 空いてなければ待つ。時刻+1して席が空くのを待つ手抜き実装\n\t\t\t\t\te.time++;\n\t\t\t\t\tpq.add(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (;sc.hasNext();) {\n\t\t\tint n = sc.nextInt();\n\t\t\tSystem.out.println(ans[n]);\n\t\t}\n\t}\n\t\n\tclass Event implements Comparable {\n\t\tstatic final int LEAVE = 0;\n\t\tstatic final int ARRIVE = 1;\n\t\tint id;\n\t\tint move;\n\t\tint time;\n\t\tint num;\n\t\tint duration;\n\t\t@Override\n\t\tpublic int compareTo(Event o) {\n\t\t\tint c = time - o.time;\n\t\t\tif (c == 0) c = move - o.move;\n\t\t\tif (c == 0) c = id - o.id;\n\t\t\treturn c;\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1425957761, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00147.html", "problem_id": "p00147", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00147/input.txt", "sample_output_relpath": "derived/input_output/data/p00147/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00147/Java/s300161439.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s300161439", "user_id": "u440985525"}, "prompt_components": {"gold_output": "0\n14\n9\n4\n", "input_to_evaluate": "import static java.util.Arrays.deepToString;\n\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.concurrent.PriorityBlockingQueue;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\tvoid tr(Object... os) {\n\t\tSystem.err.println(deepToString(os));\n\t}\n\n\tScanner sc = new Scanner(System.in);\n\t\n\tint[] ans;\n\tpublic void run() {\n\t\tans = new int[100];\n\t\t\n\t\tPriorityQueue pq = new PriorityQueue();\n\t\tint[] table = new int[17];\n\t\tArrays.fill(table, -1);\n\t\tint nextGroup = 0;\n\t\tfor (int i = 0; i < 100; i++) {\n\t\t\tEvent e = new Event();\n\t\t\te.id = i;\n\t\t\te.move = Event.ARRIVE;\n\t\t\te.time = i * 5;\n\t\t\te.num = i % 5 == 1 ? 5 : 2;\n\t\t\te.duration = 17*(i%2) + 3*(i%3)+19;\n\t\t\tpq.add(e);\n\t\t}\n\t\twhile (!pq.isEmpty()) {\n\t\t\tEvent e = pq.poll();\n//\t\t\ttr(e.time, e.id, e.move, table);\n\t\t\tif (e.move == Event.LEAVE) {\n\t\t\t\tfor (int i = 0; i < table.length; i++) {\n\t\t\t\t\tif (table[i] == e.id) table[i] = -1;\n\t\t\t\t}\n\t\t\t} else if (e.move == Event.ARRIVE) {\n\t\t\t\tint pos = -1;\n\t\t\t\tif (nextGroup == e.id) {\n\t\t\t\t\tfor (int i = 0; i + e.num < table.length; i++) {\n\t\t\t\t\t\tboolean ok = true;\n\t\t\t\t\t\tfor (int j = 0; j < e.num; j++) {\n\t\t\t\t\t\t\tif (table[i+j] != -1) {\n\t\t\t\t\t\t\t\tok = false;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (ok) {\n\t\t\t\t\t\t\tpos = i;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (pos >= 0) {\n\t\t\t\t\t// 座る\n\t\t\t\t\tans[e.id] = e.time - e.id * 5;\n\t\t\t\t\tfor (int j = 0; j < e.num; j++) {\n\t\t\t\t\t\ttable[pos + j] = e.id;\n\t\t\t\t\t}\n\t\t\t\t\te.time += e.duration;\n\t\t\t\t\te.move = Event.LEAVE;\n\t\t\t\t\tpq.add(e);\n\t\t\t\t\tnextGroup++;\n\t\t\t\t} else {\n\t\t\t\t\t// 空いてなければ待つ。時刻+1して席が空くのを待つ手抜き実装\n\t\t\t\t\te.time++;\n\t\t\t\t\tpq.add(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (;sc.hasNext();) {\n\t\t\tint n = sc.nextInt();\n\t\t\tSystem.out.println(ans[n]);\n\t\t}\n\t}\n\t\n\tclass Event implements Comparable {\n\t\tstatic final int LEAVE = 0;\n\t\tstatic final int ARRIVE = 1;\n\t\tint id;\n\t\tint move;\n\t\tint time;\n\t\tint num;\n\t\tint duration;\n\t\t@Override\n\t\tpublic int compareTo(Event o) {\n\t\t\tint c = time - o.time;\n\t\t\tif (c == 0) c = move - o.move;\n\t\t\tif (c == 0) c = id - o.id;\n\t\t\treturn c;\n\t\t}\n\t}\n}", "problem_context": "福縞軒\n\n「福縞軒」は行列のできる人気のラーメン屋です。でも最近、お客さんの間から「待ち時間が長いのに、店に入ったら空席があるのは許せない」という声が聞こえるよう��なってきました。どうしてそんな不満が出るのか調べたいのですが、お店が開いているあいだは忙しくて、実際の行列の様子を調べることができません。しかし、長年の経験からお客さんが来る間隔や人数は分かっているので、それをもとに待ち時間の分析をすることにしました。\n\n店内にはカウンターに向かって 17 の席があります。開店時間は正午で、お客さんは次のようにやってきます。\n\n0 番から 99 番までの 100 組のグループが来ます。\n\ni 番目のグループは正午から 5i 分後にお店に到着します。\n\ni 番目のグループの人数は i % 5 が 1 のとき 5 人、それ以外のときは 2 人です。\n\n(x % yは x を y で割ったときの余りを表わします。)\n\ni 番目のグループは、席に着くと 17(i % 2) + 3(i % 3) + 19 分間で食事を済ませます。\n\n最初の 10 グループの到着時刻、人数、食事時間は次のようになります。\n\nグループ番号\n\n0\n\n1\n\n2\n\n3\n\n4\n\n5\n\n6\n\n7\n\n8\n\n9\n\n到着時刻(分後)\n\n0\n\n5\n\n10\n\n15\n\n20\n\n25\n\n30\n\n35\n\n40\n\n45\n\n人数(人)\n\n2\n\n5\n\n2\n\n2\n\n2\n\n2\n\n5\n\n2\n\n2\n\n2\n\n食事時間(分)\n\n19\n\n39\n\n25\n\n36\n\n22\n\n42\n\n19\n\n39\n\n25\n\n36\n\nまた、お客さんを席に案内するときには、次のようにしています。\n\n席には 0 から 16 までの番号が付いています。\n\nx 人のグループは連続して x 個あいている席があった時だけ着席できます。\n\nまた、座れる場所が複数あった場合は、席の番号が最も小さくなるところに座ります。例えば、0、1、2、4、5番の席だけが空いていた場合、5 人のグループは着席できません。2 人のグループであれば 0、1 番に着席します。\n\n一度着席したら、席を移動してもらうことはしません。\n\nお客さんは 1 分単位で出入りします。各時刻には次の順序でお客さんを案内します。\n\n前のグループの離席と同時に次のグループの着席が可能となります。\n\nお客さんを着席させる際には、行列の先頭にいるグループから順に、できる限り多くのグループを同じ時刻に着席させます。行列の順序を追い越すことはしません。つまり、先頭のグループが着席できなければ、行列内の他のグループが着席できたとしても、着席させません。\n\nその時刻に到着したグループは、行列が残っている場合は行列の最後尾に並びます。行列が無く、着席できる場合は着席し、できない場合は並んで待ちます。例として最初の 10 グループが到着するまでの様子を示すと以下のようになります。各行の3つの欄は、左から時刻、座席の様子、行列の様子を示しています。座席は「_」が空席で、番号はその席にその番号のグループが座っていることを示しています。\n\n時刻: 座席 行列\n0: 00_______________:\n5: 0011111__________:\n10: 001111122________:\n15: 00111112233______:\n18: 00111112233______:\n19: __111112233______:\n20: 44111112233______:\n25: 4411111223355____:\n30: 4411111223355____: 66666 グループ6が到着\n34: 4411111223355____: 66666\n35: 4411111__3355____: 6666677 グループ7が到着\n40: 4411111__3355____: 666667788 グループ8が到着\n41: 4411111__3355____: 666667788\n42: __11111__3355____: 666667788\n43: __11111__3355____: 666667788\n44: 6666677883355____: グループ6、7、8が着席\n45: 666667788335599__: グループ9が到着、着席\n\n例えば、時刻 40 では 8 番目のグループが到着しますが、着席できないので行列に加わります。4 番目のグループは時刻 41 まで食事をします。時刻 42 では、4 番目のグループの席が空きますが、連続した席数が足りないので 6 番目のグループはまだ着席できません。1 番目のグループは時刻 43 まで食事をします。時刻 44 で 1 番目のグループの席が空くので、6 番目のグループが着席し、同時に 7 番目、8 番目のグループも着席します。9 番目のグループは時刻 45 で到着し、席が空いているのでそのまま着席します。\n\nこれらの情報を基にして、0 以上 99 以下の整数 n を入力として、n 番目グループのお客さんが待つ時間(分単位)を出力するプログラムを作成してください。\n\nInput\n\n複数のデータセットが与えられます。各データセットは１つの整数 n からなります。\n\nデータセットの数は 20 を超えません。\n\nOutput\n\n各データセットについて、n 番目のお客の分単位の待ち時間(0 以上の整数)を１行に出力してください。\n\nSample Input\n\n5\n6\n7\n8\n\nOutput for the Sample Input\n\n0\n14\n9\n4", "sample_input": "5\n6\n7\n8\n"}, "reference_outputs": ["0\n14\n9\n4\n"], "source_document_id": "p00147", "source_text": "福縞軒\n\n「福縞軒」は行列のできる人気のラーメン屋です。でも最近、お客さんの間から「待ち時間が長いのに、店に入ったら空席があるのは許せない」という声が聞こえるようになってきました。どうしてそんな不満が出るのか調べたいのですが、お店が開いているあいだは忙しくて、実際の行列の様子を調べることができません。しかし、長年の経験からお客さんが来る間隔や人数は分かっているので、それをもとに待ち時間の分析をすることにしました。\n\n店内にはカウンターに向かって 17 の席があります。開店時間は正午で、お客さんは次のようにやってきます。\n\n0 番から 99 番までの 100 組のグループが来ます。\n\ni 番目のグループは正午から 5i 分後にお店に到着します。\n\ni 番目のグループの人数は i % 5 が 1 のとき 5 人、それ以外のときは 2 人です。\n\n(x % yは x を y で割ったときの余りを表わします。)\n\ni 番目のグループは、席に着くと 17(i % 2) + 3(i % 3) + 19 分間で食事を済ませます。\n\n最初の 10 グループの到着時刻、人数、食事時間は次のようになります。\n\nグループ番号\n\n0\n\n1\n\n2\n\n3\n\n4\n\n5\n\n6\n\n7\n\n8\n\n9\n\n到着時刻(分後)\n\n0\n\n5\n\n10\n\n15\n\n20\n\n25\n\n30\n\n35\n\n40\n\n45\n\n人数(人)\n\n2\n\n5\n\n2\n\n2\n\n2\n\n2\n\n5\n\n2\n\n2\n\n2\n\n食事時間(分)\n\n19\n\n39\n\n25\n\n36\n\n22\n\n42\n\n19\n\n39\n\n25\n\n36\n\nまた、お客さんを席に案内するときには、次のようにしています。\n\n席には 0 から 16 までの番号が付いています。\n\nx 人のグループは連続して x 個あいている席があった時だけ着席できます。\n\nまた、座れる場所が複数あった場合は、席の番号が最も小さくなるところに座ります。例えば、0、1、2、4、5番の席だけが空いていた場合、5 人のグループは着席できません。2 人のグループであれば 0、1 番に着席します。\n\n一度着席したら、席を移動してもらうことはしません。\n\nお客さんは 1 分単位で出入りします。各時刻には次の順序でお客さんを案内します。\n\n前のグループの離席と同時に次のグループの着席が可能となります。\n\nお客さんを着席させる際には、行列の先頭にいるグループから順に、できる限り多くのグループを同じ時刻に着席させます。行列の順序を追い越すことはしません。つまり、先頭のグループが着席できなければ、行列内の他のグループが着席できたとしても、着席させません。\n\nその時刻に到着したグループは、行列が残っている場合は行列の最後尾に並びます。行列が無く、着席できる場合は着席し、できない場合は並んで待ちます。例として最初の 10 グループが到着するまでの様子を示すと以下のようになります。各行の3つの欄は、左から時刻、座席の様子、行列の様子を示しています。座席は「_」が空席で、番号はその席にその番号のグループが座っていることを示しています。\n\n時刻: 座席 行列\n0: 00_______________:\n5: 0011111__________:\n10: 001111122________:\n15: 00111112233______:\n18: 00111112233______:\n19: __111112233______:\n20: 44111112233______:\n25: 4411111223355____:\n30: 4411111223355____: 66666 グループ6が到着\n34: 4411111223355____: 66666\n35: 4411111__3355____: 6666677 グループ7が到着\n40: 4411111__3355____: 666667788 グループ8が到着\n41: 4411111__3355____: 666667788\n42: __11111__3355____: 666667788\n43: __11111__3355____: 666667788\n44: 6666677883355____: グループ6、7、8が着席\n45: 666667788335599__: グループ9が到着、着席\n\n例えば、時刻 40 では 8 番目のグループが到着しますが、着席できないので行列に加わります。4 番目のグループは時刻 41 まで食事をします。時刻 42 では、4 番目のグループの席が空きますが、連続した席数が足りないので 6 番目のグループはまだ着席できません。1 番目のグループは時刻 43 まで食事をします。時刻 44 で 1 番目のグループの席が空くので、6 番目のグループが着席し、同時に 7 番目、8 番目のグループも着席します。9 番目のグループは時刻 45 で到着し、席が空いているのでそのまま着席します。\n\nこれらの情報を基にして、0 以上 99 以下の整数 n を入力として、n 番目グループのお客さんが待つ時間(分単位)を出力するプログラムを作成してください。\n\nInput\n\n複数のデータセットが与えられます。各デ��タセットは１つの整数 n からなります。\n\nデータセットの数は 20 を超えません。\n\nOutput\n\n各データセットについて、n 番目のお客の分単位の待ち時間(0 以上の整数)を１行に出力してください。\n\nSample Input\n\n5\n6\n7\n8\n\nOutput for the Sample Input\n\n0\n14\n9\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2138, "cpu_time_ms": 60, "memory_kb": 19192}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s176745869", "group_id": "codeNet:p00147", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.List;\n\npublic class Main {\n // 店のカウンター\n static int[] serviceCounters;\n // 次に到着するグループ番号\n static int nextArrivalGroupNumber;\n // 待ち行列作成(到着したグループを格納)\n static LinkedList waitGroupNumberList;\n // 正午から現在までの経過時間（分）\n static int currentTime;\n\n // 各グループの情報を登録（添え字はグループ番号を表す）\n // グループの人数\n static List groupNumberOfPeopleList;\n // 店に到着する時間（分）\n static List arrivalTimeList;\n // 食事時間（分）\n static List eatTimeList;\n // 席に着いた時間（分）\n static List sitTimeList;\n // 待ち時間（分）\n static List waitTimeList;\n\n // 初期化\n public static void init() {\n serviceCounters = new int[17];\n // 空席を\"-1\"とするため、\"-1\"で初期化\n Arrays.fill(serviceCounters, -1);\n nextArrivalGroupNumber = 0;\n waitGroupNumberList = new LinkedList();\n currentTime = 0;\n groupNumberOfPeopleList = new ArrayList();\n arrivalTimeList = new ArrayList();\n eatTimeList = new ArrayList();\n sitTimeList = new ArrayList();\n waitTimeList = new ArrayList();\n }\n\n public static void main(String[] args) {\n\n // 入力値を一行分取得する。\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n Integer inputNumber = null;\n while (true) {\n String inputStr = null;\n try {\n inputStr = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (inputStr == null) {\n break;\n }\n inputNumber = Integer.valueOf(inputStr);\n // 変数の初期化\n init();\n // 各グループの情報を登録する。（入力されたグループ番号まで）\n for (int i = 0; i <= inputNumber; i++) {\n arrivalTimeList.add(calArrivalTime(i));\n groupNumberOfPeopleList.add(calgroupNumberOfPeople(i));\n eatTimeList.add(calEatTime(i));\n }\n\n // メイン処理開始\n while (true) {\n // 次に到着するグループがいるか調べ、いれば待ち行列の最後尾にセットする\n if (inputNumber >= nextArrivalGroupNumber) {\n if (currentTime == arrivalTimeList.get(nextArrivalGroupNumber)) {\n waitGroupNumberList.offer(nextArrivalGroupNumber);\n nextArrivalGroupNumber++;\n }\n }\n\n // 食べ終わったグループに退店される\n exitGroup();\n\n // 待っているグループがいれば着席させる\n sitGroup();\n\n currentTime++;\n\n // 終了条件\n // 入力されたグループ番号まで客を入店させ、最後のグループが着席（待ち行列が空）すれば終了。\n if ((inputNumber + 1) == nextArrivalGroupNumber && waitGroupNumberList.isEmpty()) {\n break;\n }\n }\n System.out.println(waitTimeList.get(inputNumber));\n }\n }\n\n /**\n * \n *

[機能] 食べ終わったグループがいればに退店させる。

\n *

[説明] グループが着席してからの経過時間を調べ、食事時間と一致すれば退店させる。

\n */\n private static void exitGroup() {\n for (int i = 0; i < serviceCounters.length; i++) {\n if (serviceCounters[i] != -1) {\n // 食���が終了したか判定\n if (eatTimeList.get(serviceCounters[i]) == (currentTime - sitTimeList.get(serviceCounters[i]))) {\n int emptyCounter = serviceCounters[i];\n // グループの人数分空席にする\n for (int j = 0; j < groupNumberOfPeopleList.get(emptyCounter); j++) {\n serviceCounters[i + j] = -1;\n }\n }\n }\n }\n }\n\n /**\n * \n *

[機能] 空席があれば待っているグループに座らせる。

\n *

[説明] 待ち行列の先頭のグループと店の空席を確認し、座らせる。

\n *

[備考] 着席時間と待ち時間を設定する。

\n */\n private static void sitGroup() {\n while (!(waitGroupNumberList.isEmpty())) {\n int firstWaitGroupNumber = waitGroupNumberList.poll();\n int firstCountNumber = getSeriesChairs(firstWaitGroupNumber);\n // 座れる席がない場合\n if (firstCountNumber == -1) {\n // 待ち行列にグループを戻す\n waitGroupNumberList.addFirst(firstWaitGroupNumber);\n break;\n }\n for (int i = 0; i < groupNumberOfPeopleList.get(firstWaitGroupNumber); i++) {\n serviceCounters[firstCountNumber + i] = firstWaitGroupNumber;\n }\n // 着席時間を設定\n sitTimeList.add(currentTime);\n // 待ち時間を設定\n waitTimeList.add(currentTime - arrivalTimeList.get(firstWaitGroupNumber));\n\n }\n }\n\n /**\n * \n *

[機能] カウンターの先頭から空席を調べ、
\n * 連続した空席が入力値以上になれば連続した空席の最も小さい席番号を返す。
\n * それ以外は-1を返す。

\n *@param firstWaitGroupNumber グループ番号\n * @return 連続空席の最も小さい席番号\n */\n private static int getSeriesChairs(int firstWaitGroupNumber) {\n for (int startPoint = 0; startPoint < serviceCounters.length; startPoint++) {\n if (serviceCounters[startPoint] == -1) {\n int emptyCount = 1;\n for (int endpoint = startPoint + 1; endpoint < serviceCounters.length; endpoint++) {\n // 空席ならカウント\n if (serviceCounters[endpoint] == -1) {\n emptyCount++;\n // 連続空席がグループの人数以上か判定\n if (emptyCount >= groupNumberOfPeopleList.get(firstWaitGroupNumber)) {\n return startPoint;\n }\n } else {\n startPoint = endpoint + 1;\n break;\n }\n\n }\n }\n }\n // 座れる席がない場合は-1を返す\n return -1;\n }\n\n /**\n *

[機能] グループの人数を計算する。

\n */\n public static int calgroupNumberOfPeople(int GroupNumber) {\n if (GroupNumber % 5 == 1) {\n return 5;\n }\n return 2;\n }\n\n /**\n *

[機能] 食事時間を計算する。

\n */\n public static int calEatTime(int GroupNumber) {\n return 17 * (GroupNumber % 2) + 3 * (GroupNumber % 3) + 19;\n }\n\n /**\n *

[機能] 店への到着時間の計算する。

\n */\n public static int calArrivalTime(int GroupNumber) {\n return GroupNumber * 5;\n }\n\n /**\n *

[機能] 到着したグループ番号に1を加算する。

\n * @param arrivaledGroupNumber 到着したグループ番号\n */\n public static void addNextArrivaledGroupNumber(Integer arrivaledGroupNumber) {\n nextArrivalGroupNumber++;\n }\n\n}", "language": "Java", "metadata": {"date": 1429060596, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00147.html", "problem_id": "p00147", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00147/input.txt", "sample_output_relpath": "derived/input_output/data/p00147/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00147/Java/s176745869.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s176745869", "user_id": "u554121390"}, "prompt_components": {"gold_output": "0\n14\n9\n4\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.List;\n\npublic class Main {\n // 店のカウンター\n static int[] serviceCounters;\n // 次に到着するグループ番号\n static int nextArrivalGroupNumber;\n // 待ち行列作成(到着したグループを格納)\n static LinkedList waitGroupNumberList;\n // 正午から現在までの経過時間（分）\n static int currentTime;\n\n // 各グループの情報を登録（添え字はグループ番号を表す）\n // グループの人数\n static List groupNumberOfPeopleList;\n // 店に到着する時間（分）\n static List arrivalTimeList;\n // 食事時間（分）\n static List eatTimeList;\n // 席に着いた時間（分）\n static List sitTimeList;\n // 待ち時間（分）\n static List waitTimeList;\n\n // 初期化\n public static void init() {\n serviceCounters = new int[17];\n // 空席を\"-1\"とするため、\"-1\"で初期化\n Arrays.fill(serviceCounters, -1);\n nextArrivalGroupNumber = 0;\n waitGroupNumberList = new LinkedList();\n currentTime = 0;\n groupNumberOfPeopleList = new ArrayList();\n arrivalTimeList = new ArrayList();\n eatTimeList = new ArrayList();\n sitTimeList = new ArrayList();\n waitTimeList = new ArrayList();\n }\n\n public static void main(String[] args) {\n\n // 入力値を一行分取得する。\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n Integer inputNumber = null;\n while (true) {\n String inputStr = null;\n try {\n inputStr = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (inputStr == null) {\n break;\n }\n inputNumber = Integer.valueOf(inputStr);\n // 変数の初期化\n init();\n // 各グループの情報を登録する。（入力されたグループ番号まで）\n for (int i = 0; i <= inputNumber; i++) {\n arrivalTimeList.add(calArrivalTime(i));\n groupNumberOfPeopleList.add(calgroupNumberOfPeople(i));\n eatTimeList.add(calEatTime(i));\n }\n\n // メイン処理開始\n while (true) {\n // 次に到着するグループがいるか調べ、いれば待ち行列の最後尾にセットする\n if (inputNumber >= nextArrivalGroupNumber) {\n if (currentTime == arrivalTimeList.get(nextArrivalGroupNumber)) {\n waitGroupNumberList.offer(nextArrivalGroupNumber);\n nextArrivalGroupNumber++;\n }\n }\n\n // 食べ終わったグループに退店される\n exitGroup();\n\n // 待っているグループがいれば着席させる\n sitGroup();\n\n currentTime++;\n\n // 終了条件\n // 入力されたグループ番号まで客を入店させ、最後のグループが着席（待ち行列が空）すれば終了。\n if ((inputNumber + 1) == nextArrivalGroupNumber && waitGroupNumberList.isEmpty()) {\n break;\n }\n }\n System.out.println(waitTimeList.get(inputNumber));\n }\n }\n\n /**\n * \n *

[機能] 食べ終わったグループがいればに退店させる。

\n *

[説明] グループが着席してからの経過時間を調べ、食事時間と一致すれば退店させる。

\n */\n private static void exitGroup() {\n for (int i = 0; i < serviceCounters.length; i++) {\n if (serviceCounters[i] != -1) {\n // 食事が終了したか判定\n if (eatTimeList.get(serviceCounters[i]) == (currentTime - sitTimeList.get(serviceCounters[i]))) {\n int emptyCounter = serviceCounters[i];\n // グループの人数分空席にする\n for (int j = 0; j < groupNumberOfPeopleList.get(emptyCounter); j++) {\n serviceCounters[i + j] = -1;\n }\n }\n }\n }\n }\n\n /**\n * \n *

[機能] 空席があれば待っているグループに座らせる。

\n *

[説明] 待ち行列の先頭のグループと店の空席を確認し、座らせる。

\n *

[備考] 着席時間と待ち時間を設定する。

\n */\n private static void sitGroup() {\n while (!(waitGroupNumberList.isEmpty())) {\n int firstWaitGroupNumber = waitGroupNumberList.poll();\n int firstCountNumber = getSeriesChairs(firstWaitGroupNumber);\n // 座れる席がない場合\n if (firstCountNumber == -1) {\n // 待ち行列にグループを戻す\n waitGroupNumberList.addFirst(firstWaitGroupNumber);\n break;\n }\n for (int i = 0; i < groupNumberOfPeopleList.get(firstWaitGroupNumber); i++) {\n serviceCounters[firstCountNumber + i] = firstWaitGroupNumber;\n }\n // 着席時間を設定\n sitTimeList.add(currentTime);\n // 待ち時間を設定\n waitTimeList.add(currentTime - arrivalTimeList.get(firstWaitGroupNumber));\n\n }\n }\n\n /**\n * \n *

[機能] カウンターの先頭から空席を調べ、
\n * 連続した空席が入力値以上になれば連続した空席の最も小さい席番号を返す。
\n * それ以外は-1を返す。

\n *@param firstWaitGroupNumber グループ番号\n * @return 連続空席の最も小さい席番号\n */\n private static int getSeriesChairs(int firstWaitGroupNumber) {\n for (int startPoint = 0; startPoint < serviceCounters.length; startPoint++) {\n if (serviceCounters[startPoint] == -1) {\n int emptyCount = 1;\n for (int endpoint = startPoint + 1; endpoint < serviceCounters.length; endpoint++) {\n // 空席ならカウント\n if (serviceCounters[endpoint] == -1) {\n emptyCount++;\n // 連続空席がグループの人数以上か判定\n if (emptyCount >= groupNumberOfPeopleList.get(firstWaitGroupNumber)) {\n return startPoint;\n }\n } else {\n startPoint = endpoint + 1;\n break;\n }\n\n }\n }\n }\n // 座れる席がない場合は-1を返す\n return -1;\n }\n\n /**\n *

[機能] グループの人数を計算する。

\n */\n public static int calgroupNumberOfPeople(int GroupNumber) {\n if (GroupNumber % 5 == 1) {\n return 5;\n }\n return 2;\n }\n\n /**\n *

[機能] 食事時間を計算する。

\n */\n public static int calEatTime(int GroupNumber) {\n return 17 * (GroupNumber % 2) + 3 * (GroupNumber % 3) + 19;\n }\n\n /**\n *

[機能] 店への到着時間の計算する。

\n */\n public static int calArrivalTime(int GroupNumber) {\n return GroupNumber * 5;\n }\n\n /**\n *

[機能] 到着したグループ番号に1を加算する。

\n * @param arrivaledGroupNumber 到着したグループ番号\n */\n public static void addNextArrivaledGroupNumber(Integer arrivaledGroupNumber) {\n nextArrivalGroupNumber++;\n }\n\n}", "problem_context": "福縞軒\n\n「福縞軒」は行列のできる人気のラーメン屋です。でも最近、お客さんの間から「待ち時間が長いのに、店に入ったら空席があるのは許せない」という声が聞こえるようになってきました。どうしてそんな不満が出るのか調べたいのですが、お店が開いているあいだは忙しくて、実際の行列の様子を調べることができません。しかし、長年の経験からお客さんが来る間隔や人数は分かっているので、それをもとに待ち時間の分析をすることにしました。\n\n店内にはカウンターに向かって 17 の席があります。開店時間は正午で、お客さんは次のようにやってきます。\n\n0 番から 99 番までの 100 組のグループが来ます。\n\ni 番目のグループは正午から 5i 分後にお店に到着します。\n\ni 番目のグループの人数は i % 5 が 1 のとき 5 人、それ以外のときは 2 人です。\n\n(x % yは x を y で割ったときの余りを表わします。)\n\ni 番目のグループは、席に着くと 17(i % 2) + 3(i % 3) + 19 分間で食事を済ませます。\n\n最初の 10 グループの到着時刻、人数、食事時間は次のようになります。\n\nグループ番号\n\n0\n\n1\n\n2\n\n3\n\n4\n\n5\n\n6\n\n7\n\n8\n\n9\n\n到着時刻(分後)\n\n0\n\n5\n\n10\n\n15\n\n20\n\n25\n\n30\n\n35\n\n40\n\n45\n\n人数(人)\n\n2\n\n5\n\n2\n\n2\n\n2\n\n2\n\n5\n\n2\n\n2\n\n2\n\n食事時間(分)\n\n19\n\n39\n\n25\n\n36\n\n22\n\n42\n\n19\n\n39\n\n25\n\n36\n\nまた、お客さんを席に案内するときには、次のようにしています。\n\n席には 0 から 16 までの番号が付いています。\n\nx 人のグループは連続して x 個あいている席があった時だけ着席できます。\n\nまた、座れる場所が複数あった場合は、席の番号が最も小さくなるところに座ります。例えば、0、1、2、4、5番の席だけが空いていた場合、5 人のグループは着席できません。2 人のグループであれば 0、1 番に着席します。\n\n一度着席したら、席を移動してもらうことはしません。\n\nお客さんは 1 分単位で出入りしま���。各時刻には次の順序でお客さんを案内します。\n\n前のグループの離席と同時に次のグループの着席が可能となります。\n\nお客さんを着席させる際には、行列の先頭にいるグループから順に、できる限り多くのグループを同じ時刻に着席させます。行列の順序を追い越すことはしません。つまり、先頭のグループが着席できなければ、行列内の他のグループが着席できたとしても、着席させません。\n\nその時刻に到着したグループは、行列が残っている場合は行列の最後尾に並びます。行列が無く、着席できる場合は着席し、できない場合は並んで待ちます。例として最初の 10 グループが到着するまでの様子を示すと以下のようになります。各行の3つの欄は、左から時刻、座席の様子、行列の様子を示しています。座席は「_」が空席で、番号はその席にその番号のグループが座っていることを示しています。\n\n時刻: 座席 行列\n0: 00_______________:\n5: 0011111__________:\n10: 001111122________:\n15: 00111112233______:\n18: 00111112233______:\n19: __111112233______:\n20: 44111112233______:\n25: 4411111223355____:\n30: 4411111223355____: 66666 グループ6が到着\n34: 4411111223355____: 66666\n35: 4411111__3355____: 6666677 グループ7が到着\n40: 4411111__3355____: 666667788 グループ8が到着\n41: 4411111__3355____: 666667788\n42: __11111__3355____: 666667788\n43: __11111__3355____: 666667788\n44: 6666677883355____: グループ6、7、8が着席\n45: 666667788335599__: グループ9が到着、着席\n\n例えば、時刻 40 では 8 番目のグループが到着しますが、着席できないので行列に加わります。4 番目のグループは時刻 41 まで食事をします。時刻 42 では、4 番目のグループの席が空きますが、連続した席数が足りないので 6 番目のグループはまだ着席できません。1 番目のグループは時刻 43 まで食事をします。時刻 44 で 1 番目のグループの席が空くので、6 番目のグループが着席し、同時に 7 番目、8 番目のグループも着席します。9 番目のグループは時刻 45 で到着し、席が空いているのでそのまま着席します。\n\nこれらの情報を基にして、0 以上 99 以下の整数 n を入力として、n 番目グループのお客さんが待つ時間(分単位)を出力するプログラムを作成してください。\n\nInput\n\n複数のデータセットが与えられます。各データセットは１つの整数 n からなります。\n\nデータセットの数は 20 を超えません。\n\nOutput\n\n各データセットについて、n 番目のお客の分単位の待ち時間(0 以上の整数)を１行に出力してください。\n\nSample Input\n\n5\n6\n7\n8\n\nOutput for the Sample Input\n\n0\n14\n9\n4", "sample_input": "5\n6\n7\n8\n"}, "reference_outputs": ["0\n14\n9\n4\n"], "source_document_id": "p00147", "source_text": "福縞軒\n\n「福縞軒」は行列のできる人気のラーメン屋です。でも最近、お客さんの間から「待ち時間が長いのに、店に入ったら空席があるのは許せない」という声が聞こえるようになってきました。どうしてそんな不満が出るのか調べたいのですが、お店が開いているあいだは忙しくて、実際の行列の様子を調べることができません。しかし、長年の経験からお客さんが来る間隔や人数は分かっているので、それをもとに待ち時間の分析をすることにしました。\n\n店内にはカウンターに向かって 17 の席があります。開店時間は正午で、お客さんは次のようにやってきます。\n\n0 番から 99 番までの 100 組のグループが来ます。\n\ni 番目のグループは正午から 5i 分後にお店に到着します。\n\ni 番目のグループの人数は i % 5 が 1 のとき 5 人、それ以外のときは 2 人です。\n\n(x % yは x を y で割ったときの余りを表わします。)\n\ni 番目のグループは、席に着くと 17(i % 2) + 3(i % 3) + 19 分間で食事を済ませます。\n\n最初の 10 グループの到着時刻、人数、食事時間は次のようになります。\n\nグループ番号\n\n0\n\n1\n\n2\n\n3\n\n4\n\n5\n\n6\n\n7\n\n8\n\n9\n\n到着時刻(分後)\n\n0\n\n5\n\n10\n\n15\n\n20\n\n25\n\n30\n\n35\n\n40\n\n45\n\n人数(人)\n\n2\n\n5\n\n2\n\n2\n\n2\n\n2\n\n5\n\n2\n\n2\n\n2\n\n食事時間(分)\n\n19\n\n39\n\n25\n\n36\n\n22\n\n42\n\n19\n\n39\n\n25\n\n36\n\nまた、お客さんを席に案内するときには、次のようにしています。\n\n席には 0 から 16 までの番号が付いています。\n\nx 人のグループは連続して x 個あいている席があった時だけ着席できます。\n\nまた、座れる場所が複数あった場合は、席の番号が最��小さくなるところに座ります。例えば、0、1、2、4、5番の席だけが空いていた場合、5 人のグループは着席できません。2 人のグループであれば 0、1 番に着席します。\n\n一度着席したら、席を移動してもらうことはしません。\n\nお客さんは 1 分単位で出入りします。各時刻には次の順序でお客さんを案内します。\n\n前のグループの離席と同時に次のグループの着席が可能となります。\n\nお客さんを着席させる際には、行列の先頭にいるグループから順に、できる限り多くのグループを同じ時刻に着席させます。行列の順序を追い越すことはしません。つまり、先頭のグループが着席できなければ、行列内の他のグループが着席できたとしても、着席させません。\n\nその時刻に到着したグループは、行列が残っている場合は行列の最後尾に並びます。行列が無く、着席できる場合は着席し、できない場合は並んで待ちます。例として最初の 10 グループが到着するまでの様子を示すと以下のようになります。各行の3つの欄は、左から時刻、座席の様子、行列の様子を示しています。座席は「_」が空席で、番号はその席にその番号のグループが座っていることを示しています。\n\n時刻: 座席 行列\n0: 00_______________:\n5: 0011111__________:\n10: 001111122________:\n15: 00111112233______:\n18: 00111112233______:\n19: __111112233______:\n20: 44111112233______:\n25: 4411111223355____:\n30: 4411111223355____: 66666 グループ6が到着\n34: 4411111223355____: 66666\n35: 4411111__3355____: 6666677 グループ7が到着\n40: 4411111__3355____: 666667788 グループ8が到着\n41: 4411111__3355____: 666667788\n42: __11111__3355____: 666667788\n43: __11111__3355____: 666667788\n44: 6666677883355____: グループ6、7、8が着席\n45: 666667788335599__: グループ9が到着、着席\n\n例えば、時刻 40 では 8 番目のグループが到着しますが、着席できないので行列に加わります。4 番目のグループは時刻 41 まで食事をします。時刻 42 では、4 番目のグループの席が空きますが、連続した席数が足りないので 6 番目のグループはまだ着席できません。1 番目のグループは時刻 43 まで食事をします。時刻 44 で 1 番目のグループの席が空くので、6 番目のグループが着席し、同時に 7 番目、8 番目のグループも着席します。9 番目のグループは時刻 45 で到着し、席が空いているのでそのまま着席します。\n\nこれらの情報を基にして、0 以上 99 以下の整数 n を入力として、n 番目グループのお客さんが待つ時間(分単位)を出力するプログラムを作成してください。\n\nInput\n\n複数のデータセットが与えられます。各データセットは１つの整数 n からなります。\n\nデータセットの数は 20 を超えません。\n\nOutput\n\n各データセットについて、n 番目のお客の分単位の待ち時間(0 以上の整数)を１行に出力してください。\n\nSample Input\n\n5\n6\n7\n8\n\nOutput for the Sample Input\n\n0\n14\n9\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8037, "cpu_time_ms": 60, "memory_kb": 20500}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s406023287", "group_id": "codeNet:p00153", "input_text": "\nimport java.awt.geom.Line2D;\nimport java.awt.geom.Path2D;\nimport java.awt.geom.Point2D;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tloop: while (true) {\n\t\t\tPoint2D.Double[] points = new Point2D.Double[4];\n\t\t\tint maxx = Integer.MIN_VALUE;\n\t\t\tint maxy = Integer.MIN_VALUE;\n\t\t\tint minx = Integer.MAX_VALUE;\n\t\t\tint miny = Integer.MAX_VALUE;\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint x = scanner.nextInt();\n\t\t\t\tint y = scanner.nextInt();\n\t\t\t\tif (i == 0 && x == 0 && y == 0) {\n\t\t\t\t\tbreak loop;\n\t\t\t\t}\n\t\t\t\tpoints[i] = new Point2D.Double(x, y);\n\t\t\t\tif (i != 3) {\n\t\t\t\t\tmaxx = Math.max(maxx, x);\n\t\t\t\t\tmaxy = Math.max(maxy, y);\n\t\t\t\t\tminx = Math.min(minx, x);\n\t\t\t\t\tminy = Math.min(miny, y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tdouble r = scanner.nextDouble();\n\t\t\tLine2D.Double a = new Line2D.Double(points[1], points[2]);\n\t\t\tLine2D.Double b = new Line2D.Double(points[2], points[0]);\n\t\t\tLine2D.Double c = new Line2D.Double(points[0], points[1]);\n\t\t\tdouble d0 = points[3].distance(points[0]);\n\t\t\tdouble d1 = points[3].distance(points[1]);\n\t\t\tdouble d2 = points[3].distance(points[2]);\n\t\t\tdouble ap = a.ptSegDist(points[3]);\n\t\t\tdouble bp = b.ptSegDist(points[3]);\n\t\t\tdouble cp = c.ptSegDist(points[3]);\n\t\t\tPath2D.Double path = new Path2D.Double();\n\t\t\tpath.moveTo(points[0].x, points[0].y);\n\t\t\tpath.lineTo(points[1].x, points[1].y);\n\t\t\tpath.lineTo(points[2].x, points[2].y);\n\n\t\t\tif (d0 <= r && d1 <= r && d2 <= r) {\n\t\t\t\tSystem.out.println(\"b\");\n\t\t\t} else if (path.contains(points[3])) {\n\t\t\t\tif (ap > r && bp > r && cp > r) {\n\t\t\t\t\tSystem.out.println(\"a\");\n\t\t\t\t} else {\n\t\t\t\t\tSystem.out.println(\"c\");\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (d0 > r && d1 > r && d2 > r) {\n\t\t\t\t\tSystem.out.println(\"d\");\n\t\t\t\t} else {\n\t\t\t\t\tSystem.out.println(\"c\");\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1424507173, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00153.html", "problem_id": "p00153", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00153/input.txt", "sample_output_relpath": "derived/input_output/data/p00153/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00153/Java/s406023287.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s406023287", "user_id": "u213849509"}, "prompt_components": {"gold_output": "b\nc\nd\na\n", "input_to_evaluate": "\nimport java.awt.geom.Line2D;\nimport java.awt.geom.Path2D;\nimport java.awt.geom.Point2D;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tloop: while (true) {\n\t\t\tPoint2D.Double[] points = new Point2D.Double[4];\n\t\t\tint maxx = Integer.MIN_VALUE;\n\t\t\tint maxy = Integer.MIN_VALUE;\n\t\t\tint minx = Integer.MAX_VALUE;\n\t\t\tint miny = Integer.MAX_VALUE;\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint x = scanner.nextInt();\n\t\t\t\tint y = scanner.nextInt();\n\t\t\t\tif (i == 0 && x == 0 && y == 0) {\n\t\t\t\t\tbreak loop;\n\t\t\t\t}\n\t\t\t\tpoints[i] = new Point2D.Double(x, y);\n\t\t\t\tif (i != 3) {\n\t\t\t\t\tmaxx = Math.max(maxx, x);\n\t\t\t\t\tmaxy = Math.max(maxy, y);\n\t\t\t\t\tminx = Math.min(minx, x);\n\t\t\t\t\tminy = Math.min(miny, y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tdouble r = scanner.nextDouble();\n\t\t\tLine2D.Double a = new Line2D.Double(points[1], points[2]);\n\t\t\tLine2D.Double b = new Line2D.Double(points[2], points[0]);\n\t\t\tLine2D.Double c = new Line2D.Double(points[0], points[1]);\n\t\t\tdouble d0 = points[3].distance(points[0]);\n\t\t\tdouble d1 = points[3].distance(points[1]);\n\t\t\tdouble d2 = points[3].distance(points[2]);\n\t\t\tdouble ap = a.ptSegDist(points[3]);\n\t\t\tdouble bp = b.ptSegDist(points[3]);\n\t\t\tdouble cp = c.ptSegDist(points[3]);\n\t\t\tPath2D.Double path = new Path2D.Double();\n\t\t\tpath.moveTo(points[0].x, points[0].y);\n\t\t\tpath.lineTo(points[1].x, points[1].y);\n\t\t\tpath.lineTo(points[2].x, points[2].y);\n\n\t\t\tif (d0 <= r && d1 <= r && d2 <= r) {\n\t\t\t\tSystem.out.println(\"b\");\n\t\t\t} else if (path.contains(points[3])) {\n\t\t\t\tif (ap > r && bp > r && cp > r) {\n\t\t\t\t\tSystem.out.println(\"a\");\n\t\t\t\t} else {\n\t\t\t\t\tSystem.out.println(\"c\");\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (d0 > r && d1 > r && d2 > r) {\n\t\t\t\t\tSystem.out.println(\"d\");\n\t\t\t\t} else {\n\t\t\t\t\tSystem.out.println(\"c\");\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n}", "problem_context": "三角形と円\n\n平面上にある三角形と円の位置関係を判定するプログラムを作成してください。対象となる図形はいずれも境界を含むものとします。\n三角形は 3 頂点の位置が与えられ、円は中心の位置と半径が与えられます。位置は直交座標系による２つの整数の組によって与えられます。半径も整数で与えられます。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。\n各データセットは以下の形式で与えられます。\n\nx1 y1\nx2 y2\nx3 y3\nxc yc\nr\n\n１行目から３行目に、三角形の第 i の頂点座標 xi, yi が与えられます。４行目に円の中心の座標 xc, yc、５行目に円の半径 r が与えられます。与えられる入力はすべて、1 以上 10,000 以下の整数とします。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n入力データセットごとに以下の形式で判定結果を１行に出力します。\n\n円が三角形に含まれる場合 a\n\n三角形が円に含まれる場合 b\n\nそれ以外の場合で、共通部分がある場合には c\n\n共通部分がない場合には d\n\nSample Input\n\n1 1\n3 1\n3 3\n3 2\n3\n3 12\n9 3\n11 12\n8 7\n5\n15 3\n17 7\n22 5\n7 6\n4\n6 11\n8 2\n16 9\n10 8\n2\n0 0\n\nOutput for the Sample Input\n\nb\nc\nd\na", "sample_input": "1 1\n3 1\n3 3\n3 2\n3\n3 12\n9 3\n11 12\n8 7\n5\n15 3\n17 7\n22 5\n7 6\n4\n6 11\n8 2\n16 9\n10 8\n2\n0 0\n"}, "reference_outputs": ["b\nc\nd\na\n"], "source_document_id": "p00153", "source_text": "三角形と円\n\n平面上にある三角形と円の位置関係を判定するプログラムを作成してください。対象となる図形はいずれも境界を含むものとします。\n三角形は 3 頂点の位置が与えられ、円は中心の位置と半径が与えられます。位置は直交座標系による２つの整数の組によって与えられます。半径も整数で与えられます。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロふたつの行で示されます。\n各データセットは以下の形式で与えられます。\n\nx1 y1\nx2 y2\nx3 y3\nxc yc\nr\n\n１行目から３行目に、三角形の第 i の頂点座標 xi, yi が与えられます。４行目に円の中心の座標 xc, yc、５行目に円の半径 r が与えられます。与えられる入力はすべて、1 以上 10,000 以下の整数とします。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\n入力データセットごとに以下の形式で判定結果を１行に出力します。\n\n円が三角形に含まれる場合 a\n\n三角形が円に含まれる場合 b\n\nそれ以外の場合で、共通部分がある場合には c\n\n共通部分がない場合には d\n\nSample Input\n\n1 1\n3 1\n3 3\n3 2\n3\n3 12\n9 3\n11 12\n8 7\n5\n15 3\n17 7\n22 5\n7 6\n4\n6 11\n8 2\n16 9\n10 8\n2\n0 0\n\nOutput for the Sample Input\n\nb\nc\nd\na", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1801, "cpu_time_ms": 100, "memory_kb": 23344}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s954709142", "group_id": "codeNet:p00157", "input_text": "\nimport java.awt.geom.Point2D;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.NoSuchElementException;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.Stack;\nimport java.util.TreeMap;\n\n\n\npublic class Main {\n\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\tstatic FastScanner sc = new FastScanner();\n\tstatic Scanner stdIn = new Scanner(System.in);\n\tstatic int INF = 2 << 26;\n\tstatic char[][] map;\n\tstatic ArrayList list = new ArrayList();\n\tpublic static void main(String[] args) {\n\t\twhile(true) {\n\t\t\tlist.clear();\n\t\t\tint n = sc.nextInt();\n\t\t\tif(n == 0) break;\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tlist.add(new Data(sc.nextInt(), sc.nextInt()));\n\t\t\t}\n\t\t\tint m = sc.nextInt();\n\t\t\tfor(int i = 0; i < m; i++) {\n\t\t\t\tlist.add(new Data(sc.nextInt(), sc.nextInt()));\n\t\t\t}\n\t\t\t\n\t\t\tCollections.sort(list,new Comp());\n\t\t\t\n\t\t\tint[] dp = new int[n + m];\n\t\t\tdp[0] = 1;\n\t\t\t\n\t\t\tfor(int i = 1; i < n + m; i++) {\n\t\t\t\tif(list.get(i).h > list.get(i-1).h && list.get(i).r > list.get(i-1).r) {\n\t\t\t\t\tdp[i] = Math.max(dp[i], dp[i-1] + 1);\n\t\t\t\t}\n\t\t\t\tif(i > 1 && list.get(i).h > list.get(i-2).h && list.get(i).r > list.get(i-2).r && list.get(i-1).r == list.get(i-2).r) {\n\t\t\t\t\tdp[i] = Math.max(dp[i], dp[i-2]+1);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\tArrays.sort(dp);\n\t\t\tout.println(dp[n + m-1]);\n\t\t\t\n\t\t}\n\t\tout.flush();\n\t}\n\t\n\tstatic class Comp implements Comparator{\n\n\t\t@Override\n\t\tpublic int compare(Data o1, Data o2) {\n\t\t\treturn o1.r - o2.r;\n\t\t}\n\t\t\n\t}\n\t\n\tstatic class Data{\n\t\tint h;\n\t\tint r;\n\t\tData(int a, int b) {\n\t\t\th = a;\n\t\t\tr = b;\n\t\t}\n\t}\n\n}\n\n//------------------------------//\n//-----------//\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n public boolean hasNext() { skipUnprintable(); return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n \n public int nextInt() {\n \t if (!hasNext()) throw new NoSuchElementException();\n int n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n \n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n \n\n}", "language": "Java", "metadata": {"date": 1427522248, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00157.html", "problem_id": "p00157", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00157/input.txt", "sample_output_relpath": "derived/input_output/data/p00157/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00157/Java/s954709142.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s954709142", "user_id": "u722076734"}, "prompt_components": {"gold_output": "9\n6\n8\n", "input_to_evaluate": "\nimport java.awt.geom.Point2D;\nimport java.io.*;\nimport java.math.BigInteger;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.NoSuchElementException;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.Stack;\nimport java.util.TreeMap;\n\n\n\npublic class Main {\n\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\tstatic FastScanner sc = new FastScanner();\n\tstatic Scanner stdIn = new Scanner(System.in);\n\tstatic int INF = 2 << 26;\n\tstatic char[][] map;\n\tstatic ArrayList list = new ArrayList();\n\tpublic static void main(String[] args) {\n\t\twhile(true) {\n\t\t\tlist.clear();\n\t\t\tint n = sc.nextInt();\n\t\t\tif(n == 0) break;\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tlist.add(new Data(sc.nextInt(), sc.nextInt()));\n\t\t\t}\n\t\t\tint m = sc.nextInt();\n\t\t\tfor(int i = 0; i < m; i++) {\n\t\t\t\tlist.add(new Data(sc.nextInt(), sc.nextInt()));\n\t\t\t}\n\t\t\t\n\t\t\tCollections.sort(list,new Comp());\n\t\t\t\n\t\t\tint[] dp = new int[n + m];\n\t\t\tdp[0] = 1;\n\t\t\t\n\t\t\tfor(int i = 1; i < n + m; i++) {\n\t\t\t\tif(list.get(i).h > list.get(i-1).h && list.get(i).r > list.get(i-1).r) {\n\t\t\t\t\tdp[i] = Math.max(dp[i], dp[i-1] + 1);\n\t\t\t\t}\n\t\t\t\tif(i > 1 && list.get(i).h > list.get(i-2).h && list.get(i).r > list.get(i-2).r && list.get(i-1).r == list.get(i-2).r) {\n\t\t\t\t\tdp[i] = Math.max(dp[i], dp[i-2]+1);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\tArrays.sort(dp);\n\t\t\tout.println(dp[n + m-1]);\n\t\t\t\n\t\t}\n\t\tout.flush();\n\t}\n\t\n\tstatic class Comp implements Comparator{\n\n\t\t@Override\n\t\tpublic int compare(Data o1, Data o2) {\n\t\t\treturn o1.r - o2.r;\n\t\t}\n\t\t\n\t}\n\t\n\tstatic class Data{\n\t\tint h;\n\t\tint r;\n\t\tData(int a, int b) {\n\t\t\th = a;\n\t\t\tr = b;\n\t\t}\n\t}\n\n}\n\n//------------------------------//\n//-----------//\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n public boolean hasNext() { skipUnprintable(); return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n \n public int nextInt() {\n \t if (!hasNext()) throw new NoSuchElementException();\n int n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n \n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n \n\n}", "problem_context": "マトリョーシカ\n\nマトリョーシカとは女性像をかたどった木製の人形で、ロシアの代表的な民芸品です。マトリョーシカは、大きな人形の中にそれより小さな人形が入っている入れ子構造になっており、大きさの異なる複数の人形で構成されています。このような入れ子構造にするため、各人形の胴体は上下で分割できる筒状の構造になっています。マトリョーシカは職人の手で手作りされるため、一つ一つの人形は世界に一つしかない非常に貴重なものになります。\n\n兄弟である一郎君と次郎君は、マトリョーシカで遊ぶのが大好きで、各自がそれぞれ1組のマトリョーシカを持っていました。一郎君のマトリョーシカは n 個の人形から構成されており、次郎君のマトリョーシカは m 個の人形から構成されています。\n\nある日、好奇心が旺盛な一郎君は、これら2組のマトリョーシカに含まれる人形たちを組み合わせて、より多くの人形を含む新たなマトリョーシカを作れないかと考えました。つまり、n + m 個の人形を使い、k 個の人形からなる１組のマトリョーシカを作ることを試みたのです。n と m の大きい方よりも k を大きくすることができれば、一郎君の目的は達成されます。\n\n兄弟は2人仲良く、どのように人形を組み合わせれば k の値を最大にできるかを考えました。しかし、幼い2人にとってこの問題はあまりにも難しいので、年上のあなたはプログラムを作成して弟たちを助けることにしました。\n\n一郎君と次郎君のマトリョーシカの人形の情報を入力とし、新たなマトリョーシカが含む人形の数 k を出力するプログラムを作成して下さい。入力される人形に大きさが同じものは存在しません。また、人形を高さ h 半径 r の円柱とみなした場合、高さh、半径 r の人形が含むことのできる人形は x < h かつ y < r を満たす高さ x 半径 y の人形です。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。\n\nn\nh1 r1\nh2 r2\n:\nhn rn\nm\nh1 r1\nh2 r2\n:\nhm rm\n\n１行目に一郎君のマトリ���ーシカの人形の数 n (n ≤ 100)、続く n 行に一郎君の第 i の人形の高さ hi と半径 ri (hi, ri < 1000) が与えられます。\n\n続く行に二郎君のマトリョーシカの人形の数 m (m ≤ 100)、続く m 行に二郎君の第 i の人形の高さ hi と半径 ri (hi, ri < 1000) が与えられます。\n\nデータセットの数は 20 を越えない。\n\nOutput\n\n入力データセットごとに新たなマトリョーシカが含む人形の数 k を出力します。\n\nSample Input\n\n6\n1 1\n4 3\n6 5\n8 6\n10 10\n14 14\n5\n2 2\n5 4\n6 6\n9 8\n15 10\n4\n1 1\n4 3\n6 5\n8 6\n3\n2 2\n5 4\n6 6\n4\n1 1\n4 3\n6 5\n8 6\n4\n10 10\n12 11\n18 15\n24 20\n0\n\nOutput for the Sample Input\n\n9\n6\n8", "sample_input": "6\n1 1\n4 3\n6 5\n8 6\n10 10\n14 14\n5\n2 2\n5 4\n6 6\n9 8\n15 10\n4\n1 1\n4 3\n6 5\n8 6\n3\n2 2\n5 4\n6 6\n4\n1 1\n4 3\n6 5\n8 6\n4\n10 10\n12 11\n18 15\n24 20\n0\n"}, "reference_outputs": ["9\n6\n8\n"], "source_document_id": "p00157", "source_text": "マトリョーシカ\n\nマトリョーシカとは女性像をかたどった木製の人形で、ロシアの代表的な民芸品です。マトリョーシカは、大きな人形の中にそれより小さな人形が入っている入れ子構造になっており、大きさの異なる複数の人形で構成されています。このような入れ子構造にするため、各人形の胴体は上下で分割できる筒状の構造になっています。マトリョーシカは職人の手で手作りされるため、一つ一つの人形は世界に一つしかない非常に貴重なものになります。\n\n兄弟である一郎君と次郎君は、マトリョーシカで遊ぶのが大好きで、各自がそれぞれ1組のマトリョーシカを持っていました。一郎君のマトリョーシカは n 個の人形から構成されており、次郎君のマトリョーシカは m 個の人形から構成されています。\n\nある日、好奇心が旺盛な一郎君は、これら2組のマトリョーシカに含まれる人形たちを組み合わせて、より多くの人形を含む新たなマトリョーシカを作れないかと考えました。つまり、n + m 個の人形を使い、k 個の人形からなる１組のマトリョーシカを作ることを試みたのです。n と m の大きい方よりも k を大きくすることができれば、一郎君の目的は達成されます。\n\n兄弟は2人仲良く、どのように人形を組み合わせれば k の値を最大にできるかを考えました。しかし、幼い2人にとってこの問題はあまりにも難しいので、年上のあなたはプログラムを作成して弟たちを助けることにしました。\n\n一郎君と次郎君のマトリョーシカの人形の情報を入力とし、新たなマトリョーシカが含む人形の数 k を出力するプログラムを作成して下さい。入力される人形に大きさが同じものは存在しません。また、人形を高さ h 半径 r の円柱とみなした場合、高さh、半径 r の人形が含むことのできる人形は x < h かつ y < r を満たす高さ x 半径 y の人形です。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。\n\nn\nh1 r1\nh2 r2\n:\nhn rn\nm\nh1 r1\nh2 r2\n:\nhm rm\n\n１行目に一郎君のマトリョーシカの人形の数 n (n ≤ 100)、続く n 行に一郎君の第 i の人形の高さ hi と半径 ri (hi, ri < 1000) が与えられます。\n\n続く行に二郎君のマトリョーシカの人形の数 m (m ≤ 100)、続く m 行に二郎君の第 i の人形の高さ hi と半径 ri (hi, ri < 1000) が与えられます。\n\nデータセットの数は 20 を越えない。\n\nOutput\n\n入力データセットごとに新たなマトリョーシカが含む人形の数 k を出力します。\n\nSample Input\n\n6\n1 1\n4 3\n6 5\n8 6\n10 10\n14 14\n5\n2 2\n5 4\n6 6\n9 8\n15 10\n4\n1 1\n4 3\n6 5\n8 6\n3\n2 2\n5 4\n6 6\n4\n1 1\n4 3\n6 5\n8 6\n4\n10 10\n12 11\n18 15\n24 20\n0\n\nOutput for the Sample Input\n\n9\n6\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4542, "cpu_time_ms": 50, "memory_kb": 17200}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s694742764", "group_id": "codeNet:p00166", "input_text": "\nimport java.util.*;\nimport java.io.*;\nimport java.math.BigDecimal;\nimport java.awt.geom.*;\nimport static java.util.Arrays.*;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\twhile(true){\n\t\t\tint m = Integer.parseInt(stdIn.next());\n\t\t\tif(m==0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tint[] vm = new int[m];\n\t\t\tfor(int i=0;i 10){\n\t\t\t\t\t\tans = ans + 10;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tans = ans + num;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0;i < cnt;i++){\n\t\t\t\tif(ans + 10 > 21)break;\n\t\t\t\telse{\n\t\t\t\t\tans = ans + 10;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ans > 21){\n\t\t\t\tSystem.out.println(0);\n\t\t\t}else{\n\t\t\t\tSystem.out.println(ans);\n\t\t\t}\n\t\t}\n }\n public static void main(String[] args) {\n \t// TODO Auto-generated method stub\n \tnew Main().doIt();\n }\n}", "language": "Java", "metadata": {"date": 1417631387, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00169.html", "problem_id": "p00169", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00169/input.txt", "sample_output_relpath": "derived/input_output/data/p00169/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00169/Java/s359573545.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359573545", "user_id": "u576153335"}, "prompt_components": {"gold_output": "11\n21\n0\n21\n12\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tvoid doIt() { \n\t\twhile(true){\n\t\t\tString str[]=sc.nextLine().split(\" \");\n\t\t\tif(Integer.valueOf(str[0]).intValue() == 0)break;\n\t\t\tint cnt = 0;\n\t\t\tint ans = 0;\n\t\t\tfor(int i = 0;i < str.length;i++){\n\t\t\t\tint num = Integer.valueOf(str[i]).intValue();\n\t\t\t\tif(num == 1){\n\t\t\t\t\tcnt++;ans++;\n\t\t\t\t}else{\n\t\t\t\t\tif(num > 10){\n\t\t\t\t\t\tans = ans + 10;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tans = ans + num;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0;i < cnt;i++){\n\t\t\t\tif(ans + 10 > 21)break;\n\t\t\t\telse{\n\t\t\t\t\tans = ans + 10;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ans > 21){\n\t\t\t\tSystem.out.println(0);\n\t\t\t}else{\n\t\t\t\tSystem.out.println(ans);\n\t\t\t}\n\t\t}\n }\n public static void main(String[] args) {\n \t// TODO Auto-generated method stub\n \tnew Main().doIt();\n }\n}", "problem_context": "ブラックジャック\n\nブラックジャックはカジノで行われるカードゲームの一種で、1 〜 13 までの数が書かれたカードを使ってゲームが行われます。各カードの点数は次のように決まっています。\n\n1 は 1 点あるいは 11 点\n\n2 から 9 までは、��かれている数の通りの点数\n\n10 から 13 までは、10 点\n\nこのゲームには親を含めた何人かの参加者がおり、それぞれが何枚かのカードの組を持っています。このカードの組のことを手と呼びます。手の点数はカードの点数の合計です。その計算は次のように行うものとします。\n\nカードの点数の合計が 21 より大きくなるときは、手の点数を 0 点とする\n\nカードの点数として、1 は 1 点と計算しても 11 点と計算してもよいが、手の点数が最大となる方を選ぶこととする\n\n配られたカードの情報を入力とし、手の点数を出力するプログラムを作成してください。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。\n各データセットは以下の形式で与えられます。\n\nc1 c2 ... cn\n\n１行に i 番目のカードに書かれている整数 ci (1 ≤ ci ≤ 13) が空白区切りで１行に与えられます。カードの数 n は 100 を超えません。\n\nデータセットの数は 200 を超えません。\n\nOutput\n\nデータセットごとに手の点数を１行に出力します。\n\nSample Input\n\n1\n7 7 7\n7 7 8\n12 1\n10 1 1\n0\n\nOutput for the Sample Input\n\n11\n21\n0\n21\n12", "sample_input": "1\n7 7 7\n7 7 8\n12 1\n10 1 1\n0\n"}, "reference_outputs": ["11\n21\n0\n21\n12\n"], "source_document_id": "p00169", "source_text": "ブラックジャック\n\nブラックジャックはカジノで行われるカードゲームの一種で、1 〜 13 までの数が書かれたカードを使ってゲームが行われます。各カードの点数は次のように決まっています。\n\n1 は 1 点あるいは 11 点\n\n2 から 9 までは、書かれている数の通りの点数\n\n10 から 13 までは、10 点\n\nこのゲームには親を含めた何人かの参加者がおり、それぞれが何枚かのカードの組を持っています。このカードの組のことを手と呼びます。手の点数はカードの点数の合計です。その計算は次のように行うものとします。\n\nカードの点数の合計が 21 より大きくなるときは、手の点数を 0 点とする\n\nカードの点数として、1 は 1 点と計算しても 11 点と計算してもよいが、手の点数が最大となる方を選ぶこととする\n\n配られたカードの情報を入力とし、手の点数を出力するプログラムを作成してください。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。\n各データセットは以下の形式で与えられます。\n\nc1 c2 ... cn\n\n１行に i 番目のカードに書かれている整数 ci (1 ≤ ci ≤ 13) が空白区切りで１行に与えられます。カードの数 n は 100 を超えません。\n\nデータセットの数は 200 を超えません。\n\nOutput\n\nデータセットごとに手の点数を１行に出力します。\n\nSample Input\n\n1\n7 7 7\n7 7 8\n12 1\n10 1 1\n0\n\nOutput for the Sample Input\n\n11\n21\n0\n21\n12", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 782, "cpu_time_ms": 60, "memory_kb": 17344}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s991231969", "group_id": "codeNet:p00202", "input_text": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nclass Main{\n static int[] prime, map, check;\n static int n, x, sum;\n public static void main(String[] args){\n\tBufferedReader sc=new BufferedReader(new InputStreamReader(System.in));\n\ttry {\n\t prime = new int[1000001];\n\t sieve();\n\t while(true){\n\t\tString[] st = sc.readLine().split(\" \");\n\t\tn = Integer.valueOf(st[0]);\n\t\tx = Integer.valueOf(st[1]);\n\t\tif(n==0 && x==0)\n\t\t break;\n\t\tmap = new int[n];\n\t\tfor(int i=0; i=0; i--)\n\t\t if(check[i]==1 && prime[i]==0){\n\t\t\tout = String.valueOf(i);\t\t\n\t\t\tbreak;\n\t\t }\n\t\tSystem.out.println(out);\n\t }\n\t}catch(Exception e){\n\t System.out.println(\"Error\");\n\t}\n }\n static void solve(){\n\tcheck[0] = 1;\n\tfor(int i=0; i<=x; i++)\n\t if(check[i]==1)\n\t\tfor(int j=0; j=0; i--)\n\t\t if(check[i]==1 && prime[i]==0){\n\t\t\tout = String.valueOf(i);\t\t\n\t\t\tbreak;\n\t\t }\n\t\tSystem.out.println(out);\n\t }\n\t}catch(Exception e){\n\t System.out.println(\"Error\");\n\t}\n }\n static void solve(){\n\tcheck[0] = 1;\n\tfor(int i=0; i<=x; i++)\n\t if(check[i]==1)\n\t\tfor(int j=0; j set = new HashSet();\n for (int i = 0; i < m; i++) {\n set.add(uf.find(i));\n }\n System.out.println(set.size());\n n--;\n }\n }\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n}\n\nclass P {\n int x;\n int y;\n\n P(int x, int y) {\n this.x = x;\n this.y = y;\n }\n\n public String toString() {\n return \"(\" + x + \" , \" + y + \")\";\n }\n\n public P add(P p) {\n return new P(p.x + x, p.y + y);\n }\n\n public P sub(P p) {\n return new P(x - p.x, y - p.y);\n }\n\n public P mul(int k) {\n return new P(k * x, k * y);\n }\n\n public double abs() {\n return Math.sqrt(x * x + y * y);\n }\n\n public int abs2() {\n return x * x + y * y;\n }\n\n public int det(P p) {\n return x * p.y - y * p.x;\n }\n\n public P rot90() {\n return new P(-y, x);\n }\n\n boolean inTetragon(Tetragon t) {\n boolean right = true;\n boolean left = true;\n for (int i = 0; i < 4; i++) {\n int ep = this.sub(t.ps[i]).det(t.ps[(i + 1) % 4].sub(t.ps[i]));\n if (ep < 0)\n left = false;\n else if (ep > 0)\n right = false;\n }\n return right || left;\n }\n}\n\nclass Tetragon {\n P ps[] = new P[4];\n\n Tetragon(P qs[]) {\n for (int i = 0; i < 4; i++) {\n ps[i] = qs[i];\n }\n }\n\n boolean isTouch(Tetragon t) {\n for (int i = 0; i < 4; i++) {\n if (ps[i].inTetragon(t))\n return true;\n }\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < 4; j++) {\n int x1 = ps[i].x;\n int y1 = ps[i].y;\n int x2 = ps[(i + 1) % 4].x;\n int y2 = ps[(i + 1) % 4].y;\n int x3 = t.ps[j].x;\n int y3 = t.ps[j].y;\n int x4 = t.ps[(j + 1) % 4].x;\n int y4 = t.ps[(j + 1) % 4].y;\n int tc = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);\n int td = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);\n int ta = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);\n int tb = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);\n\n if (tc * td < 0 && ta * tb < 0)\n return true;\n }\n }\n return false;\n }\n}\n\nclass UnionFind {\n int par[];\n int rank[];\n\n UnionFind(int n) {\n par = new int[n];\n rank = new int[n];\n for (int i = 0; i < n; i++) {\n par[i] = i;\n }\n }\n\n int find(int x) {\n if (x == par[x])\n return x;\n else\n return par[x] = find(par[x]);\n }\n\n void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y)\n return;\n if (rank[y] > rank[x])\n par[x] = y;\n else {\n par[y] = x;\n if (rank[x] == rank[y])\n rank[x]++;\n }\n }\n\n boolean same(int x, int y) {\n return find(x) == find(y);\n }\n}", "language": "Java", "metadata": {"date": 1350721108, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00214.html", "problem_id": "p00214", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00214/input.txt", "sample_output_relpath": "derived/input_output/data/p00214/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00214/Java/s176193578.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s176193578", "user_id": "u907626292"}, "prompt_components": {"gold_output": "1\n2\n1\n1\n1\n", "input_to_evaluate": "import java.awt.geom.Line2D;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n final double pi = (1 << 2)\n * (Math.cbrt(1. / 0.015625) * Math.atan(0.2) - Math.atan(1. / 239));\n final double EPS = 1.0e-10;\n\n void run() {\n Scanner sc = new Scanner(System.in);\n while (true) {\n int n = sc.nextInt();\n if (n == 0)\n break;\n while (n != 0) {\n int m = sc.nextInt();\n Tetragon[] rs = new Tetragon[m];\n for (int i = 0; i < m; i++) {\n P[] ps = new P[4];\n for (int j = 0; j < 4; j++)\n ps[j] = new P(sc.nextInt(), sc.nextInt());\n rs[i] = new Tetragon(ps);\n }\n UnionFind uf = new UnionFind(m);\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < m; j++) {\n if (i == j)\n continue;\n if (rs[i].isTouch(rs[j]))\n uf.unite(i, j);\n }\n }\n Set set = new HashSet();\n for (int i = 0; i < m; i++) {\n set.add(uf.find(i));\n }\n System.out.println(set.size());\n n--;\n }\n }\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n}\n\nclass P {\n int x;\n int y;\n\n P(int x, int y) {\n this.x = x;\n this.y = y;\n }\n\n public String toString() {\n return \"(\" + x + \" , \" + y + \")\";\n }\n\n public P add(P p) {\n return new P(p.x + x, p.y + y);\n }\n\n public P sub(P p) {\n return new P(x - p.x, y - p.y);\n }\n\n public P mul(int k) {\n return new P(k * x, k * y);\n }\n\n public double abs() {\n return Math.sqrt(x * x + y * y);\n }\n\n public int abs2() {\n return x * x + y * y;\n }\n\n public int det(P p) {\n return x * p.y - y * p.x;\n }\n\n public P rot90() {\n return new P(-y, x);\n }\n\n boolean inTetragon(Tetragon t) {\n boolean right = true;\n boolean left = true;\n for (int i = 0; i < 4; i++) {\n int ep = this.sub(t.ps[i]).det(t.ps[(i + 1) % 4].sub(t.ps[i]));\n if (ep < 0)\n left = false;\n else if (ep > 0)\n right = false;\n }\n return right || left;\n }\n}\n\nclass Tetragon {\n P ps[] = new P[4];\n\n Tetragon(P qs[]) {\n for (int i = 0; i < 4; i++) {\n ps[i] = qs[i];\n }\n }\n\n boolean isTouch(Tetragon t) {\n for (int i = 0; i < 4; i++) {\n if (ps[i].inTetragon(t))\n return true;\n }\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < 4; j++) {\n int x1 = ps[i].x;\n int y1 = ps[i].y;\n int x2 = ps[(i + 1) % 4].x;\n int y2 = ps[(i + 1) % 4].y;\n int x3 = t.ps[j].x;\n int y3 = t.ps[j].y;\n int x4 = t.ps[(j + 1) % 4].x;\n int y4 = t.ps[(j + 1) % 4].y;\n int tc = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);\n int td = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);\n int ta = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);\n int tb = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);\n\n if (tc * td < 0 && ta * tb < 0)\n return true;\n }\n }\n return false;\n }\n}\n\nclass UnionFind {\n int par[];\n int rank[];\n\n UnionFind(int n) {\n par = new int[n];\n rank = new int[n];\n for (int i = 0; i < n; i++) {\n par[i] = i;\n }\n }\n\n int find(int x) {\n if (x == par[x])\n return x;\n else\n return par[x] = find(par[x]);\n }\n\n void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y)\n return;\n if (rank[y] > rank[x])\n par[x] = y;\n else {\n par[y] = x;\n if (rank[x] == rank[y])\n rank[x]++;\n }\n }\n\n boolean same(int x, int y) {\n return find(x) == find(y);\n }\n}", "problem_context": "秋のイルミネーション\n\n四角形が大好きな人が多く住む四角町では、四角形の電光板を組み合わせたイルミネーションで町中を彩るお祭りが開催されます。この電光板は電気を流すと発光し、発光している板に接している板も発光します。したがって、電光板を何枚使っても、すべてがひとかたまりに接していれば電源がひとつで済むという優れものです。\n\nお祭り実行委員会では、四角形を組み合わせたデザインを町民から募集し多数のイルミネーションを作成します。各イルミネーションは、デザインを構成する四角形の配置によって必要となる電源の個数が変わるため、必要な電源の個数を把握する作業に大きな手間がかかります。そこで、あなたは四角形の配置を調べ、必要な電源の個数を計算するプログラムを作成して実行委員会を手助けすることにしました。\n\nイルミネーションの個数、各イルミネーションを構成する四角形の情報を入力とし、イルミネーションごとに必要な電源の個数を出力するプログラムを作成してください。重なっていたり接していたりする四角形を 1 つのまとまりと考え、1 つのまとまりに対して電源の個数は 1 つと数えてください。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。\n\nN\nM1\nxa1 ya1 xb1 yb1 xc1 yc1 xd1 yd1\nxa2 ya2 xb2 yb2 xc2 yc2 xd2 yd2\n:\nxaM1 yaM1 xbM1 ybM1 xcM1 ycM1 xdM1 ydM1\nM2\n:\n:\nMN\n:\n:\n\n1 行目にイルミネーションの個数 N (1 ≤ N ≤ 100) が与えられます。続いて、N 個のイルミネーションの情報が与えられます。第 i のイルミネーションの情報として、イルミネーションを構成する四角形の個数 Mi (1 ≤ Mi ≤ 100) が１行に与えられます。続く Mi 行に j 個目の四角形の頂点 xaj, yaj, xbj, ybj, xcj, ycj, xdj, ydj (-1000 以上 1000 以下の整数) が与えられます。\n\n入力される四角形の頂点座標は、時計回りの順に従って入力されます。ただし、入力データの四角形はすべて凸な四角形とします。\n\nデータセットの数は 10 を超えません。\n\nOutput\n\n入力データセットごとに、イルミネーションごとに必要な電源の個数を出力します。出力する電源の個数は各イルミネーションが入力された順番に従ってください。\n\nSample Input\n\n3\n1\n0 0 0 1 1 1 1 0\n2\n0 0 0 1 1 1 1 0\n100 100 100 200 200 200 200 100\n2\n0 0 0 100 100 100 100 0\n10 10 10 20 20 20 20 10\n2\n1\n30 40 40 50 40 20 20 10\n1\n30 40 40 50 40 20 20 10\n0\n\nOutput for the Sample Input\n\n1\n2\n1\n1\n1", "sample_input": "3\n1\n0 0 0 1 1 1 1 0\n2\n0 0 0 1 1 1 1 0\n100 100 100 200 200 200 200 100\n2\n0 0 0 100 100 100 100 0\n10 10 10 20 20 20 20 10\n2\n1\n30 40 40 50 40 20 20 10\n1\n30 40 40 50 40 20 20 10\n0\n"}, "reference_outputs": ["1\n2\n1\n1\n1\n"], "source_document_id": "p00214", "source_text": "秋のイルミネーション\n\n四角形が大好きな人が多く住む四角町では、四角形の電光板を組み合わせたイルミネーションで町中を彩るお祭りが開催されます。この電光板は電気を流すと発光し、発光している板に接している板も発光します。したがって、電光板を何枚使っても、すべてがひとかたまりに接していれば電源がひとつで済むという優れものです。\n\nお祭り実行委員会では、四角形を組み合わせたデザインを町民から募集し多数のイルミネーションを作成します。各イルミネーションは、デザインを構成する四角形の配置によって必要となる電源の個数が変わるため、必要な電源の個数を把握する作業に大きな手間がかかります。そこで、あなたは四角形の配置を調べ、必要な電源の個数を計算するプログラムを作成して実行委員会を手助けすることにしました。\n\nイルミネーションの個数、各イルミネーションを構成する四角形の情報を入力とし、イルミネーションごとに必要な電源の個数を出力するプログラムを作成してください。重なっていたり接していたりする四角形を 1 つのまとまりと考え、1 つのまとまりに対して電源の個数は 1 つと数えてください。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。\n\nN\nM1\nxa1 ya1 xb1 yb1 xc1 yc1 xd1 yd1\nxa2 ya2 xb2 yb2 xc2 yc2 xd2 yd2\n:\nxaM1 yaM1 xbM1 ybM1 xcM1 ycM1 xdM1 ydM1\nM2\n:\n:\nMN\n:\n:\n\n1 行目にイルミネーションの個数 N (1 ≤ N ≤ 100) が与えられます。続いて、N 個のイルミネーションの情報が与えられます。第 i のイルミネーションの情報として、イルミネーションを構成する四角形の個数 Mi (1 ≤ Mi ≤ 100) が１行に与えられます。続く Mi 行に j 個目の四角形の頂点 xaj, yaj, xbj, ybj, xcj, ycj, xdj, ydj (-1000 以上 1000 以下の整数) が与えられます。\n\n入力される四角形の頂点座標は、時計回りの順に従って入力されます。ただし、入力データの四角形はすべて凸な四角形とします。\n\nデータセットの数は 10 を超えません。\n\nOutput\n\n入力データセットごとに、イルミネーションごとに必要な電源の個数を出力します。出力する電源の個数は各イルミネーションが入力された順番に従ってください。\n\nSample Input\n\n3\n1\n0 0 0 1 1 1 1 0\n2\n0 0 0 1 1 1 1 0\n100 100 100 200 200 200 200 100\n2\n0 0 0 100 100 100 100 0\n10 10 10 20 20 20 20 10\n2\n1\n30 40 40 50 40 20 20 10\n1\n30 40 40 50 40 20 20 10\n0\n\nOutput for the Sample Input\n\n1\n2\n1\n1\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4382, "cpu_time_ms": 300, "memory_kb": 13000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s337543556", "group_id": "codeNet:p00218", "input_text": "import java.io.*;\nimport java.util.StringTokenizer;\n\nclass Main {\n\tpublic static void main(String args[]) {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString buf;\n\n\t\ttry {\n\t\t\twhile (!(buf = br.readLine()).equals(\"0\")) {\n\t\t\t\tint n = Integer.parseInt(buf);\n\t\t\t\tfor (int i=0;i=90) return \"A\";\n\t\tint ave = (pm+pe+pj)/3;\n\t\tif (ave>=80) return \"A\";\n\t\tif (ave>=70) return \"B\";\n\t\tif (ave>=50) {\n\t\t\tif (pm>=80||pe>=80) return \"B\";\n\t\t}\n\t\treturn \"C\";\n\t}\n}", "language": "Java", "metadata": {"date": 1444830459, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00218.html", "problem_id": "p00218", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00218/input.txt", "sample_output_relpath": "derived/input_output/data/p00218/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00218/Java/s337543556.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s337543556", "user_id": "u413313314"}, "prompt_components": {"gold_output": "A\nA\nB\nC\nA\nB\n", "input_to_evaluate": "import java.io.*;\nimport java.util.StringTokenizer;\n\nclass Main {\n\tpublic static void main(String args[]) {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString buf;\n\n\t\ttry {\n\t\t\twhile (!(buf = br.readLine()).equals(\"0\")) {\n\t\t\t\tint n = Integer.parseInt(buf);\n\t\t\t\tfor (int i=0;i=90) return \"A\";\n\t\tint ave = (pm+pe+pj)/3;\n\t\tif (ave>=80) return \"A\";\n\t\tif (ave>=70) return \"B\";\n\t\tif (ave>=50) {\n\t\t\tif (pm>=80||pe>=80) return \"B\";\n\t\t}\n\t\treturn \"C\";\n\t}\n}", "problem_context": "クラス分け\n\n会津進学塾では、生徒が塾に入る際に実力テストを行ってクラス分けをします。テストは数学、英語、国語の 3 科目行い、生徒を A,B,C クラスにクラス分けします。A クラスのレベルが一番高く、順に低くなっていきます。\n\nクラス分けの判断は以下の表に基づきます。\n\n条件\n\nクラス\n\n100 点の科目がある\n\nA\n\n数学と英語の平均点が 90 点以上\n\nA\n\n3 科目の平均点が 80 点以上\n\nA\n\n3 科目の平均点が 70 点以上\n\nB\n\n3 科目の平均点が 50 点以上で数学か英語が 80 点以上\n\nB\n\n上の条件を満たさない\n\nC\n\n複数の条件を満たす場合は、よりレベルの高いクラスに分けられます。\n\n生徒の人数 n (1 ≤ n ≤ 10000)、各生徒の数学の点数 pmi (0 ≤ pmi ≤ 100)、英語の点数 pei (0 ≤ pei ≤ 100)、国語の点数 pji (0 ≤ pji ≤ 100) を入力とし、各生徒のクラスA,B,C (半角英字) を出力するプログラムを作成してください。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。\n各データセットは以下の形式で与えられます。\n\nn\npm1 pe1 pj1\npm2 pe2 pj2\n:\npmn pen pjn\n\n入力はすべて整数で与えられます。データセットの数は 1000 を超えません。\n\nOutput\n\n入力データセットごとに、各生徒のクラスを順番に出力します。\n\nSample Input\n\n4\n100 70 20\n98 86 55\n80 34 36\n65 79 65\n2\n99 81 20\n66 72 90\n0\n\nOutput for the Sample Input\n\nA\nA\nB\nC\nA\nB", "sample_input": "4\n100 70 20\n98 86 55\n80 34 36\n65 79 65\n2\n99 81 20\n66 72 90\n0\n"}, "reference_outputs": ["A\nA\nB\nC\nA\nB\n"], "source_document_id": "p00218", "source_text": "クラス分け\n\n会津進学塾では、生徒が塾に入る際に実力テストを行ってクラス分けをします。テストは数学、英語、国語の 3 科目行い、生徒を A,B,C クラスにクラス分けします。A クラスのレベルが一番高く、順に低くなっていきます。\n\nクラス分けの判断は以下の表に基づきます。\n\n条件\n\nクラス\n\n100 点の科目がある\n\nA\n\n数学と英語の平均点が 90 点以上\n\nA\n\n3 科目の平均点が 80 点以上\n\nA\n\n3 科目の平均点が 70 点以上\n\nB\n\n3 科目の平均点が 50 点以上で数学か英語が 80 点以上\n\nB\n\n上の条件を満たさない\n\nC\n\n複数の条件を満たす場合は、よりレベルの高いクラスに分けられます。\n\n生徒の人数 n (1 ≤ n ≤ 10000)、各生徒の数学の点数 pmi (0 ≤ pmi ≤ 100)、英語の点数 pei (0 ≤ pei ≤ 100)、国語の点数 pji (0 ≤ pji ≤ 100) を入力とし、各生徒のクラスA,B,C (半角英字) を出力するプログラムを作成してください。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。\n各データセットは以下の形式で与えられます。\n\nn\npm1 pe1 pj1\npm2 pe2 pj2\n:\npmn pen pjn\n\n入力はすべて整数で与えられます。データセットの数は 1000 を超えません。\n\nOutput\n\n入力データセットごとに、各生徒のクラスを順番に出力します。\n\nSample Input\n\n4\n100 70 20\n98 86 55\n80 34 36\n65 79 65\n2\n99 81 20\n66 72 90\n0\n\nOutput for the Sample Input\n\nA\nA\nB\nC\nA\nB", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 925, "cpu_time_ms": 100, "memory_kb": 27620}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s994626618", "group_id": "codeNet:p00239", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.LinkedList;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.calorieCounting();\n\t\treturn;\n\t}\n\t\n\t//カロリーを計算する\n\tprivate void calorieCounting() {\n\t\t\n\t\tBufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); //標準入力\n\t\t\n\t\twhile (true) {\n\t\t\t\n\t\t\ttry {\n\t\t\t\t\n\t\t\t\tString inputStr = bufferedReader.readLine();\n\t\t\t\tint confectioneryNum = Integer.parseInt(inputStr); //お菓子の数\n\t\t\t\t\n\t\t\t\tif (confectioneryNum == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tLinkedList proteinList = new LinkedList(); //タンパク質のリスト\n\t\t\t\tLinkedList lipidList = new LinkedList(); //脂質のリスト\n\t\t\t\tLinkedList carbohydrateList = new LinkedList(); //炭水化物のリスト\n\t\t\t\tLinkedList kcalList = new LinkedList(); //カロリーのリスト\n\t\t\t\t\n\t\t\t\t//お菓子の情報を入力\n\t\t\t\tfor (int i = 0; i < confectioneryNum; i++) {\n\t\t\t\t\tString inputStr2 = bufferedReader.readLine();\n\t\t\t\t\tString[] confectioneryInformationStrs = inputStr2.split(\" \");\n\t\t\t\t\tint protein = Integer.parseInt(confectioneryInformationStrs[1]);\n\t\t\t\t\tint lipid = Integer.parseInt(confectioneryInformationStrs[2]);\n\t\t\t\t\tint carbohydrate = Integer.parseInt(confectioneryInformationStrs[3]);\n\t\t\t\t\tint kcal = (4 * protein) + (9 * lipid) + (4 * carbohydrate);\n\t\t\t\t\t\n\t\t\t\t\tproteinList.add(protein);\n\t\t\t\t\tlipidList.add(lipid);\n\t\t\t\t\tcarbohydrateList.add(carbohydrate);\n\t\t\t\t\tkcalList.add(kcal);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tLinkedList canEatConfectioneryList = new LinkedList(); //食べてもいい菓子の番号を管理する\n\t\t\t\tint index = 1; //お菓子番号\n\t\t\t\tPerson person = new Person(); //お菓子を食べる人の情報\n\t\t\t\t\n\t\t\t\t//各栄養素、カロリーの制限値を入力\n\t\t\t\tString inputStr3 = bufferedReader.readLine();\n\t\t\t\tString[] personStrs = inputStr3.split(\" \");\n\t\t\t\tperson.setProtein(Integer.parseInt(personStrs[0]));\n\t\t\t\tperson.setLipid(Integer.parseInt(personStrs[1]));\n\t\t\t\tperson.setCarbohydrate(Integer.parseInt(personStrs[2]));\n\t\t\t\tperson.setKcal(Integer.parseInt(personStrs[3]));\n\t\t\t\t\n\t\t\t\tfor (int i = 0; i < confectioneryNum; i++) {\n\t\t\t\t\t\n\t\t\t\t\tboolean eatFlag = false; //trueなら食べられるお菓子\n\t\t\t\t\t\n\t\t\t\t\t//食べられるお菓子かどうかを判定する\n\t\t\t\t\tif (proteinList.get(i) < person.getProtein() && lipidList.get(i) < person.getLipid() &&\n\t\t\t\t\t\tcarbohydrateList.get(i) < person.getCarbohydrate() && kcalList.get(i) < person.getKcal()) {\n\t\t\t\t\t\teatFlag = true;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif (eatFlag) {\n\t\t\t\t\t\tcanEatConfectioneryList.add(index);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tindex++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (canEatConfectioneryList.size() == 0) {\n\t\t\t\t\t\n\t\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t\t\t\n\t\t\t\t} else {\n\t\t\t\t\t\n\t\t\t\t\tfor (int num : canEatConfectioneryList) {\n\t\t\t\t\t\tSystem.out.println(num);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t} catch (IOException e) {\n\t\t\t\t// TODO 自動生成された catch ブロック\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n}\n\nclass Person {\n\t\n\tint protein = 0; //タンパク質\n\tint lipid = 0; //脂質\n\tint carbohydrate = 0; //炭水化物\n\tint kcal = 0; //カロリー\n\t\n\tpublic int getProtein() {\n\t\treturn protein;\n\t}\n\t\n\tpublic void setProtein(int protein) {\n\t\tthis.protein = protein;\n\t}\n\t\n\tpublic int getLipid() {\n\t\treturn lipid;\n\t}\n\t\n\tpublic void setLipid(int lipid) {\n\t\tthis.lipid = lipid;\n\t}\n\t\n\tpublic int getCarbohydrate() {\n\t\treturn carbohydrate;\n\t}\n\t\n\tpublic void setCarbohydrate(int carbohydrate) {\n\t\tthis.carbohydrate = carbohydrate;\n\t}\n\t\n\tpublic int getKcal() {\n\t\treturn kcal;\n\t}\n\t\n\tpublic void setKcal(int kcal) {\n\t\tthis.kcal = kcal;\n\t}\n\t\n}", "language": "Java", "metadata": {"date": 1406210594, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00239.html", "problem_id": "p00239", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00239/input.txt", "sample_output_relpath": "derived/input_output/data/p00239/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00239/Java/s994626618.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s994626618", "user_id": "u505071817"}, "prompt_components": {"gold_output": "1\n4\nNA\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.LinkedList;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.calorieCounting();\n\t\treturn;\n\t}\n\t\n\t//カロリーを計算する\n\tprivate void calorieCounting() {\n\t\t\n\t\tBufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); //標準入力\n\t\t\n\t\twhile (true) {\n\t\t\t\n\t\t\ttry {\n\t\t\t\t\n\t\t\t\tString inputStr = bufferedReader.readLine();\n\t\t\t\tint confectioneryNum = Integer.parseInt(inputStr); //お菓子の数\n\t\t\t\t\n\t\t\t\tif (confectioneryNum == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tLinkedList proteinList = new LinkedList(); //タンパク質のリスト\n\t\t\t\tLinkedList lipidList = new LinkedList(); //脂質のリスト\n\t\t\t\tLinkedList carbohydrateList = new LinkedList(); //炭水化物のリスト\n\t\t\t\tLinkedList kcalList = new LinkedList(); //カロリーのリスト\n\t\t\t\t\n\t\t\t\t//お菓子の情報を入力\n\t\t\t\tfor (int i = 0; i < confectioneryNum; i++) {\n\t\t\t\t\tString inputStr2 = bufferedReader.readLine();\n\t\t\t\t\tString[] confectioneryInformationStrs = inputStr2.split(\" \");\n\t\t\t\t\tint protein = Integer.parseInt(confectioneryInformationStrs[1]);\n\t\t\t\t\tint lipid = Integer.parseInt(confectioneryInformationStrs[2]);\n\t\t\t\t\tint carbohydrate = Integer.parseInt(confectioneryInformationStrs[3]);\n\t\t\t\t\tint kcal = (4 * protein) + (9 * lipid) + (4 * carbohydrate);\n\t\t\t\t\t\n\t\t\t\t\tproteinList.add(protein);\n\t\t\t\t\tlipidList.add(lipid);\n\t\t\t\t\tcarbohydrateList.add(carbohydrate);\n\t\t\t\t\tkcalList.add(kcal);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tLinkedList canEatConfectioneryList = new LinkedList(); //食べてもいい菓子の番号を管理する\n\t\t\t\tint index = 1; //お菓子番号\n\t\t\t\tPerson person = new Person(); //お菓子を食べる人の情報\n\t\t\t\t\n\t\t\t\t//各栄養素、カロリーの制限値を入力\n\t\t\t\tString inputStr3 = bufferedReader.readLine();\n\t\t\t\tString[] personStrs = inputStr3.split(\" \");\n\t\t\t\tperson.setProtein(Integer.parseInt(personStrs[0]));\n\t\t\t\tperson.setLipid(Integer.parseInt(personStrs[1]));\n\t\t\t\tperson.setCarbohydrate(Integer.parseInt(personStrs[2]));\n\t\t\t\tperson.setKcal(Integer.parseInt(personStrs[3]));\n\t\t\t\t\n\t\t\t\tfor (int i = 0; i < confectioneryNum; i++) {\n\t\t\t\t\t\n\t\t\t\t\tboolean eatFlag = false; //trueなら食べられるお菓子\n\t\t\t\t\t\n\t\t\t\t\t//食べられるお菓子かどうかを判定する\n\t\t\t\t\tif (proteinList.get(i) < person.getProtein() && lipidList.get(i) < person.getLipid() &&\n\t\t\t\t\t\tcarbohydrateList.get(i) < person.getCarbohydrate() && kcalList.get(i) < person.getKcal()) {\n\t\t\t\t\t\teatFlag = true;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif (eatFlag) {\n\t\t\t\t\t\tcanEatConfectioneryList.add(index);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tindex++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (canEatConfectioneryList.size() == 0) {\n\t\t\t\t\t\n\t\t\t\t\tSystem.out.println(\"NA\");\n\t\t\t\t\t\n\t\t\t\t} else {\n\t\t\t\t\t\n\t\t\t\t\tfor (int num : canEatConfectioneryList) {\n\t\t\t\t\t\tSystem.out.println(num);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t} catch (IOException e) {\n\t\t\t\t// TODO 自動生成された catch ブロック\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n}\n\nclass Person {\n\t\n\tint protein = 0; //タンパク質\n\tint lipid = 0; //脂質\n\tint carbohydrate = 0; //炭水化物\n\tint kcal = 0; //カロリー\n\t\n\tpublic int getProtein() {\n\t\treturn protein;\n\t}\n\t\n\tpublic void setProtein(int protein) {\n\t\tthis.protein = protein;\n\t}\n\t\n\tpublic int getLipid() {\n\t\treturn lipid;\n\t}\n\t\n\tpublic void setLipid(int lipid) {\n\t\tthis.lipid = lipid;\n\t}\n\t\n\tpublic int getCarbohydrate() {\n\t\treturn carbohydrate;\n\t}\n\t\n\tpublic void setCarbohydrate(int carbohydrate) {\n\t\tthis.carbohydrate = carbohydrate;\n\t}\n\t\n\tpublic int getKcal() {\n\t\treturn kcal;\n\t}\n\t\n\tpublic void setKcal(int kcal) {\n\t\tthis.kcal = kcal;\n\t}\n\t\n}", "problem_context": "カロリー計算\n\n食べ物には3大栄養素と呼ばれる「たんぱく質」「脂質」「炭水化物」の３つの栄養素が含まれています。１g（グラム）あたりたんぱく質と炭水化物は 4 kcal（キロカロリー）、脂質は 9 kcal と計算されます。たとえば、下の表によると番号１のケーキにはタンパク質 7 g、脂質 14 g、炭水化物 47 g ���含まれています。これをもとに含まれるカロリーを計算すると、4 × 7 + 9 × 14 + 4 × 47 = 342 kcal となります。その他も同様に計算されています。\n\n番号\n\n名前\n\nたんぱく質(g)\n\n脂質(g)\n\n炭水化物(g)\n\nカロリー(kcal)\n\n1\n\nケーキ\n\n7\n\n14\n\n47\n\n342\n\n2\n\nポテトチップス\n\n5\n\n35\n\n55\n\n555\n\n3\n\nどら焼き\n\n6\n\n3\n\n59\n\n287\n\n4\n\nプリン\n\n6\n\n5\n\n15\n\n129\n\n分類の対象となるお菓子の個数 n と各お菓子の情報、制限の情報を入力とし、そのお菓子一つだけなら制限を超えることがない（食べてもよい）お菓子の一覧を出力するプログラムを作成してください。\n\nお菓子の情報は、お菓子の番号 s、そのお菓子に含まれるたんぱく質の重量 p、脂質の重量 q、炭水化物の重量 r から構成されています。制限の情報には、含むことができる最大のたんぱく質の重量 P、脂質の重量 Q、炭水化物の重量 R、および摂取することができる最大のカロリー C からなっており、タンパク質、脂質、炭水化物、カロリーのいずれかの一つでも超えると制限違反となり、「食べてはいけないお菓子」と判断されます。\n\n食べてもよいお菓子の一覧は、食べてもよいお菓子の番号を入力順に出力してください。なお、食べてもよいお菓子がなければ”NA”と出力してください。\n上の表にある4個のお菓子について、P = 10, Q = 15, R = 50, C = 400 という制限の場合、ケーキとプリンはそれぞれの栄養素及びカロリーが制限値以下なので食べてもよいお菓子に分類されますが、ポテトチップスは炭水化物とカロリー、どら焼きは炭水化物の量が制限値を超えているため食べてはいけないお菓子に分類されます。\n\n入力\n\n複数のデータセットの並びが与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。\n\nn\ns1 p1 q1 r1\ns2 p2 q2 r2\n:\nsn pn qn rn\nP Q R C\n\n1行目にお菓子の数 n (1 ≤ n ≤ 1000)が与えられます。続く n 行に第 i のお菓子の番号 si (1 ≤ si ≤ 1000)、各栄養素の重量を表す整数 pi, qi, ri (0 ≤ pi, qi, ri ≤ 100) が与えられます。\n\n続く行に各栄養素及びカロリーの制限値を表す整数 P, Q, R (0 ≤ P, Q, R ≤ 100), C (0 ≤ C ≤ 1700) が与えられます。\n\nデータセットの数は 100 を超えません。\n\n出力\n\nデータセットごとに、食べてもよいお菓子の番号または ”NA” を出力します。\n\n入力例\n\n4\n1 7 14 47\n2 5 35 55\n3 6 3 59\n4 6 5 15\n10 15 50 400\n2\n1 8 10 78\n2 4 18 33\n10 10 50 300\n0\n\n出力例\n\n1\n4\nNA", "sample_input": "4\n1 7 14 47\n2 5 35 55\n3 6 3 59\n4 6 5 15\n10 15 50 400\n2\n1 8 10 78\n2 4 18 33\n10 10 50 300\n0\n"}, "reference_outputs": ["1\n4\nNA\n"], "source_document_id": "p00239", "source_text": "カロリー計算\n\n食べ物には3大栄養素と呼ばれる「たんぱく質」「脂質」「炭水化物」の３つの栄養素が含まれています。１g（グラム）あたりたんぱく質と炭水化物は 4 kcal（キロカロリー）、脂質は 9 kcal と計算されます。たとえば、下の表によると番号１のケーキにはタンパク質 7 g、脂質 14 g、炭水化物 47 g が含まれています。これをもとに含まれるカロリーを計算すると、4 × 7 + 9 × 14 + 4 × 47 = 342 kcal となります。その他も同様に計算されています。\n\n番号\n\n名前\n\nたんぱく質(g)\n\n脂質(g)\n\n炭水化物(g)\n\nカロリー(kcal)\n\n1\n\nケーキ\n\n7\n\n14\n\n47\n\n342\n\n2\n\nポテトチップス\n\n5\n\n35\n\n55\n\n555\n\n3\n\nどら焼き\n\n6\n\n3\n\n59\n\n287\n\n4\n\nプリン\n\n6\n\n5\n\n15\n\n129\n\n分類の対象となるお菓子の個数 n と各お菓子の情報、制限の情報を入力とし、そのお菓子一つだけなら制限を超えることがない（食べてもよい）お菓子の一覧を出力するプログラムを作成してください。\n\nお菓子の情報は、お菓子の番号 s、そのお菓子に含まれるたんぱく質の重量 p、脂質の重量 q、炭水化物の重量 r から構成されています。制限の情報には、含むことができる最大のたんぱく質の重量 P、脂質の重量 Q、炭水化物の重量 R、および摂取することができる最大のカロリー C からなっており、タンパク質、脂質、炭水化物、カロリーのいずれかの一つでも超えると制限違反となり、「食べてはいけないお菓子」と判断されます。\n\n食べてもよいお菓子の一覧は、食べてもよいお菓子の番号を入力順に出力してください。なお、食べてもよいお菓子がなければ”NA”と出力してく��さい。\n上の表にある4個のお菓子について、P = 10, Q = 15, R = 50, C = 400 という制限の場合、ケーキとプリンはそれぞれの栄養素及びカロリーが制限値以下なので食べてもよいお菓子に分類されますが、ポテトチップスは炭水化物とカロリー、どら焼きは炭水化物の量が制限値を超えているため食べてはいけないお菓子に分類されます。\n\n入力\n\n複数のデータセットの並びが与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。\n\nn\ns1 p1 q1 r1\ns2 p2 q2 r2\n:\nsn pn qn rn\nP Q R C\n\n1行目にお菓子の数 n (1 ≤ n ≤ 1000)が与えられます。続く n 行に第 i のお菓子の番号 si (1 ≤ si ≤ 1000)、各栄養素の重量を表す整数 pi, qi, ri (0 ≤ pi, qi, ri ≤ 100) が与えられます。\n\n続く行に各栄養素及びカロリーの制限値を表す整数 P, Q, R (0 ≤ P, Q, R ≤ 100), C (0 ≤ C ≤ 1700) が与えられます。\n\nデータセットの数は 100 を超えません。\n\n出力\n\nデータセットごとに、食べてもよいお菓子の番号または ”NA” を出力します。\n\n入力例\n\n4\n1 7 14 47\n2 5 35 55\n3 6 3 59\n4 6 5 15\n10 15 50 400\n2\n1 8 10 78\n2 4 18 33\n10 10 50 300\n0\n\n出力例\n\n1\n4\nNA", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3738, "cpu_time_ms": 40, "memory_kb": 16920}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s788584696", "group_id": "codeNet:p00254", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\tstatic char[] N = new char[4];\n\tstatic int L,S;\n\tpublic static void main(String[] args){\n\t\twhile(read()){\n\t\t\tsolve();\n\t\t}\n\t}\n\t\n\tpublic static boolean read(){\n\t\tString tmp;\n\t\ttmp = sc.next();\n\t\tif(tmp.equals(\"0000\")) return false;\n\t\tN = tmp.toCharArray();\n\t\t\n\t\treturn true;\n\t\t\n\t}\n\t\n\tpublic static void solve(){\n\t\t\n\t\tint Nint = Integer.parseInt(String.valueOf(N));\n\t\tint ans = 0;\n\t\t\n\t\twhile(Nint != 6174){\n\t\t\tArrays.sort(N);\n\t\t\tS = Integer.parseInt(String.valueOf(N));\n\t\t\tL = ((int)N[3]-48) * 1000 + ((int)N[2]-48) * 100 + ((int)N[1]-48) * 10 + ((int)N[0]-48);\n\t\t\t\n\t\t\t\n\t\t\tNint = L-S;\n\t\t\tif(Nint == 0) {\n\t\t\t\tSystem.out.println(\"NA\"); return;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tN = String.format(\"%04d\", Nint).toCharArray();\t\t\t\n\t\t\tans++;\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\treturn;\n\t}\n}\n", "language": "Java", "metadata": {"date": 1369213194, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00254.html", "problem_id": "p00254", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00254/input.txt", "sample_output_relpath": "derived/input_output/data/p00254/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00254/Java/s788584696.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s788584696", "user_id": "u509852721"}, "prompt_components": {"gold_output": "0\n3\nNA\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\tstatic char[] N = new char[4];\n\tstatic int L,S;\n\tpublic static void main(String[] args){\n\t\twhile(read()){\n\t\t\tsolve();\n\t\t}\n\t}\n\t\n\tpublic static boolean read(){\n\t\tString tmp;\n\t\ttmp = sc.next();\n\t\tif(tmp.equals(\"0000\")) return false;\n\t\tN = tmp.toCharArray();\n\t\t\n\t\treturn true;\n\t\t\n\t}\n\t\n\tpublic static void solve(){\n\t\t\n\t\tint Nint = Integer.parseInt(String.valueOf(N));\n\t\tint ans = 0;\n\t\t\n\t\twhile(Nint != 6174){\n\t\t\tArrays.sort(N);\n\t\t\tS = Integer.parseInt(String.valueOf(N));\n\t\t\tL = ((int)N[3]-48) * 1000 + ((int)N[2]-48) * 100 + ((int)N[1]-48) * 10 + ((int)N[0]-48);\n\t\t\t\n\t\t\t\n\t\t\tNint = L-S;\n\t\t\tif(Nint == 0) {\n\t\t\t\tSystem.out.println(\"NA\"); return;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tN = String.format(\"%04d\", Nint).toCharArray();\t\t\t\n\t\t\tans++;\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\treturn;\n\t}\n}\n", "problem_context": "すべての数は６１７４に通ず\n\n0 から 9 の数字からなる四桁の数 N に対して以下の操作を行う。\n\nN の桁それぞれの数値を大きい順に並べた結果得た数を L とする\n\nN の桁それぞれの数値を小さい順に並べた結果得た数を S とする\n\n差 L-S を新しい N とする(1回分の操作終了)\n\n新しい N に対して 1. から繰り返す\n\nこのとき、全桁が同じ数字(0000, 1111など)である場合を除き、あらゆる四桁の数はいつかは 6174になることが知られている。例えば N = 2012の場合\n\n       1回目 (N = 2012): L = 2210, S = 0122, L-S = 2088\n\n       2回目 (N = 2088): L = 8820, S = 0288, L-S = 8532\n\n       3回目 (N = 8532): L = 8532, S = 2358, L-S = 6174\n\nとなり、3 回の操作で 6174 に到達する。\n\n0 から 9 の数字からなる四桁の数が与えられたとき、何回の操作で 6174 に到達するか計算するプログラムを作成して下さい。\n\n入力\n\n入力は複数のデータセットからなる。入力の終わりは 0000 が１つの行で示される。各データセットは以下の形式で与えられる。\n\nN\n\nデータセットは１行であり、N (1 ≤ N ≤ 9999) は四桁の数を示す。N < 1000 の場合は上の桁は 0 で埋められている。\n\nデータセットの数は 10000 を超えない。\n\n出力\n\n各データセットごとに何回の操作で 6174 に到達したかを１行に出力する。ただし全桁が同じ数字である数が入力として与えられた場合は NA と出力する。\n\n入力例\n\n6174\n2012\n3333\n0000\n\n出力例\n\n0\n3\nNA", "sample_input": "6174\n2012\n3333\n0000\n"}, "reference_outputs": ["0\n3\nNA\n"], "source_document_id": "p00254", "source_text": "すべての数は６１７４に通ず\n\n0 から 9 の数字からなる四桁の数 N に対して以下の操作を行う。\n\nN の桁それぞれの数値を大きい順に並べた結果得た数を L とする\n\nN の桁それぞれの数値を小さい順に並べた結果得た数を S とする\n\n差 L-S を新しい N とする(1回分の操作終了)\n\n新しい N に対して 1. から繰り返す\n\nこのとき、全桁が同じ数字(0000, 1111など)である場合を除き、あらゆる四桁の数はいつかは 6174になることが知られている。例えば N = 2012の場合\n\n       1回目 (N = 2012): L = 2210, S = 0122, L-S = 2088\n\n       2回目 (N = 2088): L = 8820, S = 0288, L-S = 8532\n\n       3回目 (N = 8532): L = 8532, S = 2358, L-S = 6174\n\nとなり、3 回の操作で 6174 に到達する。\n\n0 から 9 の数字からなる四桁の数が与えられたとき、何回の操作で 6174 に到達するか計算するプログラムを作成して下さい。\n\n入力\n\n入力は複数のデータセットからなる。入力の終わりは 0000 が１つの行で示される。各データセットは以下の形式で与えられる。\n\nN\n\nデータセットは１行であり、N (1 ≤ N ≤ 9999) は四桁の数を示す。N < 1000 の場合は上の桁は 0 で埋められている。\n\nデータセットの数は 10000 を超えない。\n\n出力\n\n各データセットごとに何回の操作で 6174 に到達したかを１行に出力する。ただし全桁が同じ数字である数が入力として与えられた場合は NA と出力する。\n\n入力例\n\n6174\n2012\n3333\n0000\n\n出力例\n\n0\n3\nNA", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 885, "cpu_time_ms": 670, "memory_kb": 61952}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s984592342", "group_id": "codeNet:p00294", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\n\npublic class Main {\n\tstatic boolean[] isDist;\n\tstatic int N;\n\tstatic int M;\n\tstatic int p;\n\tpublic static int INF = 1 << 24;\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tN = stdIn.nextInt();\n\t\tM = stdIn.nextInt();\n\t\tp = stdIn.nextInt();\n\t\tLimit = N*50;\n\t\tisDist = new boolean[N];\n\t\tfor(int i = 0; i < M ;i++) {\n\t\t\tint d = stdIn.nextInt();\n\t\t\tisDist[d] = true;\n\t\t}\n\t\tboolean[] isDist2 = Arrays.copyOf(isDist,N);\n\t\t\n\t\tsolv(1,p,0,0,false,isDist);\n\t\tsolv(-1,p,0,0,false,isDist2);\n\t\tSystem.out.println(min);\n\t\t\n\t}\n\tstatic int min = 1 << 24; \n\tstatic int Limit;\n\tpublic static void solv(int vec, int now, int coun, int cos, boolean alC,boolean[] isDist) {\n\t\t\n\t\tint nowp = now;\n\t\tint cost = cos;\n\t\tint count = coun;\n\t\twhile(true) {\n\t\t\tif(min <= cost)return;\n\t\t\tif(nowp == N) nowp = 0;\n\t\t\telse if(nowp == -1) nowp = N-1;\n\t\t\tif(count == M ) {\n\t\t\t\tif(min > cost)min = cost;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(isDist[nowp]) {\n\t\t\t\t\n\t\t\t\tisDist[nowp] = false;\n\t\t\t\tcount++;\n\t\t\t\tif(!alC && cost < Limit) {\n\t\t\t\t\tboolean[] isDist2 = Arrays.copyOf(isDist, N);\n\t\t\t\t\t\n\t\t\t\t\tsolv(vec*-1,nowp+vec*-1,count,cost+100,true,isDist2);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count == M ) {\n\t\t\t\tif(min > cost)min = cost;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\twhile(true) {\n\t\t\t\tif(nowp == N) nowp = 0;\n\t\t\t\telse if(nowp == -1) nowp = N-1;\n\t\t\t\tif(!isDist[nowp]) {\n\t\t\t\t\tnowp += vec;\n\t\t\t\t\tcost += 100;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n ", "language": "Java", "metadata": {"date": 1423117373, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00294.html", "problem_id": "p00294", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00294/input.txt", "sample_output_relpath": "derived/input_output/data/p00294/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00294/Java/s984592342.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s984592342", "user_id": "u722076734"}, "prompt_components": {"gold_output": "400\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\n\npublic class Main {\n\tstatic boolean[] isDist;\n\tstatic int N;\n\tstatic int M;\n\tstatic int p;\n\tpublic static int INF = 1 << 24;\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tN = stdIn.nextInt();\n\t\tM = stdIn.nextInt();\n\t\tp = stdIn.nextInt();\n\t\tLimit = N*50;\n\t\tisDist = new boolean[N];\n\t\tfor(int i = 0; i < M ;i++) {\n\t\t\tint d = stdIn.nextInt();\n\t\t\tisDist[d] = true;\n\t\t}\n\t\tboolean[] isDist2 = Arrays.copyOf(isDist,N);\n\t\t\n\t\tsolv(1,p,0,0,false,isDist);\n\t\tsolv(-1,p,0,0,false,isDist2);\n\t\tSystem.out.println(min);\n\t\t\n\t}\n\tstatic int min = 1 << 24; \n\tstatic int Limit;\n\tpublic static void solv(int vec, int now, int coun, int cos, boolean alC,boolean[] isDist) {\n\t\t\n\t\tint nowp = now;\n\t\tint cost = cos;\n\t\tint count = coun;\n\t\twhile(true) {\n\t\t\tif(min <= cost)return;\n\t\t\tif(nowp == N) nowp = 0;\n\t\t\telse if(nowp == -1) nowp = N-1;\n\t\t\tif(count == M ) {\n\t\t\t\tif(min > cost)min = cost;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(isDist[nowp]) {\n\t\t\t\t\n\t\t\t\tisDist[nowp] = false;\n\t\t\t\tcount++;\n\t\t\t\tif(!alC && cost < Limit) {\n\t\t\t\t\tboolean[] isDist2 = Arrays.copyOf(isDist, N);\n\t\t\t\t\t\n\t\t\t\t\tsolv(vec*-1,nowp+vec*-1,count,cost+100,true,isDist2);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count == M ) {\n\t\t\t\tif(min > cost)min = cost;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\twhile(true) {\n\t\t\t\tif(nowp == N) nowp = 0;\n\t\t\t\telse if(nowp == -1) nowp = N-1;\n\t\t\t\tif(!isDist[nowp]) {\n\t\t\t\t\tnowp += vec;\n\t\t\t\t\tcost += 100;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n ", "problem_context": "鉄道路線II\n\nわたしの住む街には、図のような N 個の駅からなる円環状の鉄道路線があります。この路線の各駅には 0 から N-1 までの番号が順番に割り当てられていて、隣の駅まで100 円で移動することができます。移動はどちらの方向にでも可能です。\n\nわたしはこの路線上のいくつかの駅で買い物をしたいと思っています。そこで、プログラムを作成して移動費を計算することにしました。ある駅を始点として、買い物をするすべての駅を訪問する最小の費用（円）を求めるプログラムを作成してください。ただし、同じ駅を何度訪問しても良く、どのような順番で駅を訪問しても構いません。\n\n入力\n\n入力は以下の形式で与えられる。\n\nN M p\nd1\nd2\n:\ndM\n\n1行目に駅の数 N (2 ≤ N ≤ 100000)、買い物をする駅の数 M (1 ≤ M ≤ 10000 かつ M < N)、出発する駅の番号 p (0 ≤ p ≤ N-1) が与えられる。続く M 行に買い物をする駅の番号 di (0 ≤ di ≤ N-1) が与えられる。ただし、diは全て異なり、p もまたどの di とも異なるものとする。\n\n出力\n\n最小の費用を１行に出力する。\n\n入出力例\n\n入力例１\n\n5 4 0\n1\n2\n3\n4\n\n出力例１\n\n400\n\n入力例２\n\n7 2 1\n6\n2\n\n出力例２\n\n400", "sample_input": "5 4 0\n1\n2\n3\n4\n"}, "reference_outputs": ["400\n"], "source_document_id": "p00294", "source_text": "鉄道路線II\n\nわたしの住む街には、図のような N 個の駅からなる円環状の鉄道路線があります。この路線の各駅には 0 から N-1 までの番号が順番に割り当てられていて、隣の駅まで100 円で移動することができます。移動はどちらの方向にでも可能です。\n\nわたしはこの路線上のいくつかの駅で買い物をしたいと思っています。そこで、プログラムを作成して移動費を計算することにしました。ある駅を始点として、買い物をするすべての駅を訪問する最小の費用（円）を求めるプログラムを作���してください。ただし、同じ駅を何度訪問しても良く、どのような順番で駅を訪問しても構いません。\n\n入力\n\n入力は以下の形式で与えられる。\n\nN M p\nd1\nd2\n:\ndM\n\n1行目に駅の数 N (2 ≤ N ≤ 100000)、買い物をする駅の数 M (1 ≤ M ≤ 10000 かつ M < N)、出発する駅の番号 p (0 ≤ p ≤ N-1) が与えられる。続く M 行に買い物をする駅の番号 di (0 ≤ di ≤ N-1) が与えられる。ただし、diは全て異なり、p もまたどの di とも異なるものとする。\n\n出力\n\n最小の費用を１行に出力する。\n\n入出力例\n\n入力例１\n\n5 4 0\n1\n2\n3\n4\n\n出力例１\n\n400\n\n入力例２\n\n7 2 1\n6\n2\n\n出力例２\n\n400", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1460, "cpu_time_ms": 1850, "memory_kb": 158224}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s478180853", "group_id": "codeNet:p00341", "input_text": "\n\nimport java.util.Scanner;\n\nclass Main {\n\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int e[] = new int[13];\n int i;\n int p = 0;\n int k;\n for (i = 0; i < 12; i++) {\n e[i] = scan.nextInt();\n }\n for (i = 0; i < 12; i++) {\n for (int j = 0; j < 12 - i; j++) {\n if (e[j] < e[j + 1]) {\n int y = e[j];\n e[j] = e[j + 1];\n e[j + 1] = y;\n\n }\n }\n }\n for (int u = 0; u < 3; u++) {\n for (k = 0; k < 4; k++) {\n i = u * 4;\n if (e[i] == e[i + 1] && e[i + 2] == e[i + 3] && e[i] == e[i + 2] && e[i + 1] == e[i + 3] && e[i] == e[i + 3] && e[i + 1] == e[i + 2]) {\n p += 1;\n } else {\n p += 0;\n }\n\n }\n\n }\n if (p == 12) {\n System.out.println(\"yes\");\n } else {\n System.out.println(\"no\");\n }\n }\n}\n\n", "language": "Java", "metadata": {"date": 1534818825, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00341.html", "problem_id": "p00341", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00341/input.txt", "sample_output_relpath": "derived/input_output/data/p00341/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00341/Java/s478180853.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s478180853", "user_id": "u956519200"}, "prompt_components": {"gold_output": "no\n", "input_to_evaluate": "\n\nimport java.util.Scanner;\n\nclass Main {\n\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int e[] = new int[13];\n int i;\n int p = 0;\n int k;\n for (i = 0; i < 12; i++) {\n e[i] = scan.nextInt();\n }\n for (i = 0; i < 12; i++) {\n for (int j = 0; j < 12 - i; j++) {\n if (e[j] < e[j + 1]) {\n int y = e[j];\n e[j] = e[j + 1];\n e[j + 1] = y;\n\n }\n }\n }\n for (int u = 0; u < 3; u++) {\n for (k = 0; k < 4; k++) {\n i = u * 4;\n if (e[i] == e[i + 1] && e[i + 2] == e[i + 3] && e[i] == e[i + 2] && e[i + 1] == e[i + 3] && e[i] == e[i + 3] && e[i + 1] == e[i + 2]) {\n p += 1;\n } else {\n p += 0;\n }\n\n }\n\n }\n if (p == 12) {\n System.out.println(\"yes\");\n } else {\n System.out.println(\"no\");\n }\n }\n}\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n棒で作る直方体\n\nアイヅ放送協会の教育番組(ＡＨＫ教育)では、子ども向けの工作番組「あそんでつくろ」を放送しています。今回は棒で箱を作る回ですが、用意した１２本の棒を使って直方体ができるかを確かめたいと思います。ただし、棒は切ったり折ったりしてはいけません。\n\n１２本の棒の長さが与えられるので、それらすべてを辺とする直方体が作れるかどうか判定するプログラムを作成せよ。\n\nInput\n\n入力は以下の形式で与えられる。\n\ne1 e2 ... e12\n\n入力は１行からなり、各棒の長さを表す整数 ei (1 ≤ ei ≤ 100) が与えられる。\n\nOutput\n\n直方体を作成できる場合には「yes」を、作成できない場合には「no」を出力する。ただし、立方体は直方体の一種なので、立方体の場合でも「yes」と出力する。\n\nSample Input 1\n\n1 1 3 4 8 9 7 3 4 5 5 5\n\nSample Output 1\n\nno\n\nSample Input 2\n\n1 1 2 2 3 1 2 3 3 3 1 2\n\nSample Output 2\n\nyes", "sample_input": "1 1 3 4 8 9 7 3 4 5 5 5\n"}, "reference_outputs": ["no\n"], "source_document_id": "p00341", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n棒で作る直方体\n\nアイヅ放送協会の教育番組(ＡＨＫ教育)では、子ども向けの工作番組「あそんでつくろ」を放送しています。今回は棒で箱を作る回ですが、用意した１２本の棒を使って直方体ができるかを確かめたいと思います。ただし、棒は切ったり折ったりしてはいけません。\n\n１２本の棒の長さが与えられるので、それらすべてを辺とする直方体が作れるかどうか判定するプログラムを作成せよ。\n\nInput\n\n入力は以下の形式で与えられる。\n\ne1 e2 ... e12\n\n入力は１行からなり、各棒の長さを表す整数 ei (1 ≤ ei ≤ 100) が与えられる。\n\nOutput\n\n直方体を作成できる場合には「yes」を、作成できない場合には「no」を出力する。ただし、立方体は直方体の一種なので、立方体の場合でも「yes」と出力する。\n\nSample Input 1\n\n1 1 3 4 8 9 7 3 4 5 5 5\n\nSample Output 1\n\nno\n\nSample Input 2\n\n1 1 2 2 3 1 2 3 3 3 1 2\n\nSample Output 2\n\nyes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1080, "cpu_time_ms": 60, "memory_kb": 26352}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s782282720", "group_id": "codeNet:p00390", "input_text": "import java.util.*;\n\npublic class Main {\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tboolean[] isRights = new boolean[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t isRights[i] = (sc.nextInt() == 0);\n\t\t}\n\t\tPriorityQueue rights = new PriorityQueue<>();\n\t\tPriorityQueue lefts = new PriorityQueue<>();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t if (isRights[i]) {\n\t\t rights.add(sc.nextInt());\n\t\t } else {\n\t\t lefts.add(sc.nextInt());\n\t\t }\n\t\t}\n\t\tif (rights.size() == 0 || lefts.size() == 0) {\n\t\t System.out.println(0);\n\t\t} else {\n\t\t System.out.println(rights.peek() + lefts.peek());\n\t\t}\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1588320770, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00390.html", "problem_id": "p00390", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00390/input.txt", "sample_output_relpath": "derived/input_output/data/p00390/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00390/Java/s782282720.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782282720", "user_id": "u788025930"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tboolean[] isRights = new boolean[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t isRights[i] = (sc.nextInt() == 0);\n\t\t}\n\t\tPriorityQueue rights = new PriorityQueue<>();\n\t\tPriorityQueue lefts = new PriorityQueue<>();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t if (isRights[i]) {\n\t\t rights.add(sc.nextInt());\n\t\t } else {\n\t\t lefts.add(sc.nextInt());\n\t\t }\n\t\t}\n\t\tif (rights.size() == 0 || lefts.size() == 0) {\n\t\t System.out.println(0);\n\t\t} else {\n\t\t System.out.println(rights.peek() + lefts.peek());\n\t\t}\n\t}\n}\n\n", "problem_context": "Round Table of Sages\n\n$N$ sages are sitting around a round table with $N$ seats. Each sage holds chopsticks with his dominant hand to eat his dinner. The following happens in this situation.\n\nIf sage $i$ is right-handed and a left-handed sage sits on his right, a level of frustration $w_i$ occurs to him. A right-handed sage on his right does not cause such frustration at all.\n\nIf sage $i$ is left-handed and a right-handed sage sits on his left, a level of frustration $w_i$ occurs to him. A left-handed sage on his left does not cause such frustration at all.\n\nYou wish you could minimize the total amount of frustration by clever sitting order arrangement.\n\nGiven the number of sages with his dominant hand information, make a program to evaluate the minimum frustration achievable.\n\nInput\n\nThe input is given in the following format.\n\n$N$\n$a_1$ $a_2$ $...$ $a_N$\n$w_1$ $w_2$ $...$ $w_N$\n\nThe first line provides the number of sages $N$ ($3 \\leq N \\leq 10$). The second line provides an array of integers $a_i$ (0 or 1) which indicate if the $i$-th sage is right-handed (0) or left-handed (1). The third line provides an array of integers $w_i$ ($1 \\leq w_i \\leq 1000$) which indicate the level of frustration the $i$-th sage bears.\n\nOutput\n\nOutput the minimum total frustration the sages bear.\n\nSample Input 1\n\n5\n1 0 0 1 0\n2 3 5 1 2\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n0 0 0\n1 2 3\n\nSample Output 2\n\n0", "sample_input": "5\n1 0 0 1 0\n2 3 5 1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p00390", "source_text": "Round Table of Sages\n\n$N$ sages are sitting around a round table with $N$ seats. Each sage holds chopsticks with his dominant hand to eat his dinner. The following happens in this situation.\n\nIf sage $i$ is right-handed and a left-handed sage sits on his right, a level of frustration $w_i$ occurs to him. A right-handed sage on his right does not cause such frustration at all.\n\nIf sage $i$ is left-handed and a right-handed sage sits on his left, a level of frustration $w_i$ occurs to him. A left-handed sage on his left does not cause such frustration at all.\n\nYou wish you could minimize the total amount of frustration by clever sitting order arrangement.\n\nGiven the number of sages with his dominant hand information, make a program to evaluate the minimum frustration achievable.\n\nInput\n\nThe input is given in the following format.\n\n$N$\n$a_1$ $a_2$ $...$ $a_N$\n$w_1$ $w_2$ $...$ $w_N$\n\nThe first line provides the number of sages $N$ ($3 \\leq N \\leq 10$). The second line provides an array of integers $a_i$ (0 or 1) which indicate if the $i$-th sage is right-handed (0) or left-handed (1). The third line provides an array of integers $w_i$ ($1 \\leq w_i \\leq 1000$) which indicate the level of frustration the $i$-th sage bears.\n\nOutput\n\nOutput the minimum total frustration the sages bear.\n\nSample Input 1\n\n5\n1 0 0 1 0\n2 3 5 1 2\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n0 0 0\n1 2 3\n\nSample Output 2\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 686, "cpu_time_ms": 80, "memory_kb": 26348}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s090650668", "group_id": "codeNet:p00423", "input_text": "import java.util.ArrayList;\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main{\n\tpublic static void main(String args[]) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n;\n\t\twhile((n=scanner.nextInt())>0){\n\t\t\tint a=0,b=0;\n\t\t\tfor(int i=0;ibb)a+=aa+bb;\n\t\t\t\telse if(aa0){\n\t\t\tint a=0,b=0;\n\t\t\tfor(int i=0;ibb)a+=aa+bb;\n\t\t\t\telse if(aa0){\n int x = sc.nextInt();\n int y = sc.nextInt();\n dp[y-1][x-1] = -1;\n }\n for(int i=0;i0 && dp[i-1][j]!=-1) dp[i][j] += dp[i-1][j];\n if(j>0 && dp[i][j-1]!=-1) dp[i][j] += dp[i][j-1];\n }\n }\n System.out.println(dp[h-1][w-1]);\n }\n }\n}", "language": "Java", "metadata": {"date": 1464256153, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00438.html", "problem_id": "p00438", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00438/input.txt", "sample_output_relpath": "derived/input_output/data/p00438/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00438/Java/s007200092.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s007200092", "user_id": "u289594538"}, "prompt_components": {"gold_output": "5\n5\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args){\n new Main();\n }\n public Main(){\n Scanner sc = new Scanner(System.in);\n while(true){\n int w = sc.nextInt();\n int h = sc.nextInt();\n if(h==0 && w==0)break;\n int[][] dp = new int[h][w];\n dp[0][0] = 1;\n int n = sc.nextInt();\n while(n-->0){\n int x = sc.nextInt();\n int y = sc.nextInt();\n dp[y-1][x-1] = -1;\n }\n for(int i=0;i0 && dp[i-1][j]!=-1) dp[i][j] += dp[i-1][j];\n if(j>0 && dp[i][j-1]!=-1) dp[i][j] += dp[i][j-1];\n }\n }\n System.out.println(dp[h-1][w-1]);\n }\n }\n}", "problem_context": "通学経路\n\n問題\n\n太郎君の住んでいるJOI市は，南北方向にまっすぐに伸びる a 本の道路と，東西方向にまっすぐに伸びる b 本の道路により，碁盤の目の形に区分けされている．\n\n南北方向の a 本の道路には，西から順に 1, 2, ... , a の番号が付けられている．また，東西方向の b 本の道路には，南から順に 1, 2, ... , b の番号が付けられている．西から i 番目の南北方向の道路と，南から j 番目の東西方向の道路が交わる交差点を (i, j) で表す．\n\n太郎君は，交差点 (1, 1) の近くに住んでおり，交差点 (a, b) の近くのJOI高校に自転車で通っている．自転車は道路に沿ってのみ移動することができる．太郎君は，通学時間を短くするため，東または北にのみ向かって移動して通学している．\n\n現在， JOI市では， n 個の交差点 (x1, y1), (x2, y2), ... , (xn, yn) で工事を行っている．太郎君は工事中の交差点を通ることができない．\n\n太郎君が交差点 (1, 1) から交差点 (a, b) まで，工事中の交差点を避けながら，東または北にのみ向かって移動して通学する方法は何通りあるだろうか．太郎君の通学経路の個数 m を求めるプログラムを作成せよ．\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力はゼロを２つ含む行で終了する．\n\n1行目には，空白を区切りとして2個の整数 a, b が書かれている．これは，南北方向の道路の本数と，東西方向の道路の本数を表す． a, b は 1 ≤ a, b ≤ 16 をみたす．\n\n2行目には, 工事中の交差点の個数を表す整数 n が書かれている． n は 1 ≤ n ≤ 40 をみたす．\n\n続く n 行 (3行目から n+2 行目) には，工事中の交差点の位置が書かれている． i+2 行目には空白で区切られた整数 xi, yi が書かれており，交差点 (xi, yi) が工事中であることを表す． xi, yi は 1 ≤ xi, yi ≤ 16 をみたす��\n\nデータセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに, 太郎君の通学経路の個数 m を1行に出力する．\n\n入出力例\n\n入力例\n\n5 4\n3\n2 2\n2 3\n4 2\n5 4\n3\n2 2\n2 3\n4 2\n0 0\n\n出力例\n\n5\n5\n\n下図は a=5, b=4, n=3 で，工事中の交差点が (2,2), (2,3), (4,2) の場合を表している．\n\nこの場合，通学経路は m=5 通りある． 5通りの通学経路を全て図示すると，以下の通り．\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "5 4\n3\n2 2\n2 3\n4 2\n5 4\n3\n2 2\n2 3\n4 2\n0 0\n"}, "reference_outputs": ["5\n5\n"], "source_document_id": "p00438", "source_text": "通学経路\n\n問題\n\n太郎君の住んでいるJOI市は，南北方向にまっすぐに伸びる a 本の道路と，東西方向にまっすぐに伸びる b 本の道路により，碁盤の目の形に区分けされている．\n\n南北方向の a 本の道路には，西から順に 1, 2, ... , a の番号が付けられている．また，東西方向の b 本の道路には，南から順に 1, 2, ... , b の番号が付けられている．西から i 番目の南北方向の道路と，南から j 番目の東西方向の道路が交わる交差点を (i, j) で表す．\n\n太郎君は，交差点 (1, 1) の近くに住んでおり，交差点 (a, b) の近くのJOI高校に自転車で通っている．自転車は道路に沿ってのみ移動することができる．太郎君は，通学時間を短くするため，東または北にのみ向かって移動して通学している．\n\n現在， JOI市では， n 個の交差点 (x1, y1), (x2, y2), ... , (xn, yn) で工事を行っている．太郎君は工事中の交差点を通ることができない．\n\n太郎君が交差点 (1, 1) から交差点 (a, b) まで，工事中の交差点を避けながら，東または北にのみ向かって移動して通学する方法は何通りあるだろうか．太郎君の通学経路の個数 m を求めるプログラムを作成せよ．\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力はゼロを２つ含む行で終了する．\n\n1行目には，空白を区切りとして2個の整数 a, b が書かれている．これは，南北方向の道路の本数と，東西方向の道路の本数を表す． a, b は 1 ≤ a, b ≤ 16 をみたす．\n\n2行目には, 工事中の交差点の個数を表す整数 n が書かれている． n は 1 ≤ n ≤ 40 をみたす．\n\n続く n 行 (3行目から n+2 行目) には，工事中の交差点の位置が書かれている． i+2 行目には空白で区切られた整数 xi, yi が書かれており，交差点 (xi, yi) が工事中であることを表す． xi, yi は 1 ≤ xi, yi ≤ 16 をみたす．\n\nデータセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに, 太郎君の通学経路の個数 m を1行に出力する．\n\n入出力例\n\n入力例\n\n5 4\n3\n2 2\n2 3\n4 2\n5 4\n3\n2 2\n2 3\n4 2\n0 0\n\n出力例\n\n5\n5\n\n下図は a=5, b=4, n=3 で，工事中の交差点が (2,2), (2,3), (4,2) の場合を表している．\n\nこの場合，通学経路は m=5 通りある． 5通りの通学経路を全て図示すると，以下の通り．\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 749, "cpu_time_ms": 60, "memory_kb": 25980}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s739365196", "group_id": "codeNet:p00459", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayDeque;\nimport java.util.Deque;\n\nimport static java.lang.Integer.parseInt;\n\n/**\n * Shuffle\n * JOI 8th, Pre 5\n */\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line;\n\t\tString[] words;\n\n\t\twhile ((line = br.readLine()) != null && !line.isEmpty()) {\n\n\t\t\tint n = parseInt(line);\n\t\t\tif (n == 0) break;\n\n\t\t\tint m = parseInt(br.readLine());\n\n\t\t\twords = br.readLine().split(\" \");\n\n\t\t\tint p, q, r;\n\t\t\tp = parseInt(words[0]);\n\t\t\tq = parseInt(words[1]);\n\t\t\tr = parseInt(words[2]);\n\n\t\t\t//shuffle\n\t\t\t//ABC -> CBA\n\t\t\tDeque ABC = new ArrayDeque<>();\n\t\t\tABC.offer(new int[]{1, n});\n\n\t\t\tfor (int i = 0; i < m; i++) {\n\t\t\t\tline = br.readLine();\n\n\t\t\t\tint x, y;\n\t\t\t\tx = parseInt(line.substring(0, line.indexOf(' ')));\n\t\t\t\ty = parseInt(line.substring(line.indexOf(' ') + 1));\n\t\t\t\ty -= x;\n\n\t\t\t\tDeque A = head(ABC, x);\n\t\t\t\tDeque B = head(ABC, y);\n\n\t\t\t\t//C+B+A\n\t\t\t\tfor (int[] b : B) ABC.offer(b);\n\t\t\t\tfor (int[] a : A) ABC.offer(a);\n\t\t\t}\n\n\t\t\t//solve\n\t\t\tint count = 0;\n\t\t\tp--;\n\t\t\tq -= p;\n\n\t\t\thead(ABC, p);\n\t\t\tABC = head(ABC, q);\n\n\t\t\tfor (int[] c : ABC) {\n\t\t\t\tif (c[1] <= r) {\n\t\t\t\t\tcount += c[1] - c[0] + 1;\n\t\t\t\t} else if (c[0] <= r && r < c[1]) {\n\t\t\t\t\tcount += r - c[0] + 1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tSystem.out.println(count);\n\n\t\t}\n\t}\n\n\tstatic Deque head(Deque deque, int size) {\n\n\t\tDeque head = new ArrayDeque<>();\n\n\t\twhile (size > 0) {\n\t\t\tint _x = deque.peek()[1] - deque.peek()[0] + 1;\n\t\t\tif (size == _x) {\n\t\t\t\thead.offer(deque.poll());\n\t\t\t\tsize = 0;\n\t\t\t} else if (size > _x) {\n\t\t\t\thead.offer(deque.poll());\n\t\t\t\tsize -= _x;\n\t\t\t} else if (size < _x) {\n\t\t\t\thead.offer(new int[]{\n\t\t\t\t\t\tdeque.peek()[0],\n\t\t\t\t\t\tdeque.peek()[0] + size - 1\n\t\t\t\t});\n\t\t\t\tdeque.peek()[0] = deque.peek()[0] + size;\n\t\t\t\tsize = 0;\n\t\t\t}\n\t\t}\n\n\t\treturn head;\n\t}\n}", "language": "Java", "metadata": {"date": 1488688021, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00459.html", "problem_id": "p00459", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00459/input.txt", "sample_output_relpath": "derived/input_output/data/p00459/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00459/Java/s739365196.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s739365196", "user_id": "u759934006"}, "prompt_components": {"gold_output": "2\n3\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayDeque;\nimport java.util.Deque;\n\nimport static java.lang.Integer.parseInt;\n\n/**\n * Shuffle\n * JOI 8th, Pre 5\n */\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line;\n\t\tString[] words;\n\n\t\twhile ((line = br.readLine()) != null && !line.isEmpty()) {\n\n\t\t\tint n = parseInt(line);\n\t\t\tif (n == 0) break;\n\n\t\t\tint m = parseInt(br.readLine());\n\n\t\t\twords = br.readLine().split(\" \");\n\n\t\t\tint p, q, r;\n\t\t\tp = parseInt(words[0]);\n\t\t\tq = parseInt(words[1]);\n\t\t\tr = parseInt(words[2]);\n\n\t\t\t//shuffle\n\t\t\t//ABC -> CBA\n\t\t\tDeque ABC = new ArrayDeque<>();\n\t\t\tABC.offer(new int[]{1, n});\n\n\t\t\tfor (int i = 0; i < m; i++) {\n\t\t\t\tline = br.readLine();\n\n\t\t\t\tint x, y;\n\t\t\t\tx = parseInt(line.substring(0, line.indexOf(' ')));\n\t\t\t\ty = parseInt(line.substring(line.indexOf(' ') + 1));\n\t\t\t\ty -= x;\n\n\t\t\t\tDeque A = head(ABC, x);\n\t\t\t\tDeque B = head(ABC, y);\n\n\t\t\t\t//C+B+A\n\t\t\t\tfor (int[] b : B) ABC.offer(b);\n\t\t\t\tfor (int[] a : A) ABC.offer(a);\n\t\t\t}\n\n\t\t\t//solve\n\t\t\tint count = 0;\n\t\t\tp--;\n\t\t\tq -= p;\n\n\t\t\thead(ABC, p);\n\t\t\tABC = head(ABC, q);\n\n\t\t\tfor (int[] c : ABC) {\n\t\t\t\tif (c[1] <= r) {\n\t\t\t\t\tcount += c[1] - c[0] + 1;\n\t\t\t\t} else if (c[0] <= r && r < c[1]) {\n\t\t\t\t\tcount += r - c[0] + 1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tSystem.out.println(count);\n\n\t\t}\n\t}\n\n\tstatic Deque head(Deque deque, int size) {\n\n\t\tDeque head = new ArrayDeque<>();\n\n\t\twhile (size > 0) {\n\t\t\tint _x = deque.peek()[1] - deque.peek()[0] + 1;\n\t\t\tif (size == _x) {\n\t\t\t\thead.offer(deque.poll());\n\t\t\t\tsize = 0;\n\t\t\t} else if (size > _x) {\n\t\t\t\thead.offer(deque.poll());\n\t\t\t\tsize -= _x;\n\t\t\t} else if (size < _x) {\n\t\t\t\thead.offer(new int[]{\n\t\t\t\t\t\tdeque.peek()[0],\n\t\t\t\t\t\tdeque.peek()[0] + size - 1\n\t\t\t\t});\n\t\t\t\tdeque.peek()[0] = deque.peek()[0] + size;\n\t\t\t\tsize = 0;\n\t\t\t}\n\t\t}\n\n\t\treturn head;\n\t}\n}", "problem_context": "シャッフル\n\n問題\n\n1 から n までの番号が書かれた n 枚のカードがある．まず，一番上が番号 1 のカード，上から2枚目が番号 2 のカード，…，一番下が番号 n のカードとなるように順番に重ねて，カードの山を作る．\n\nカードの山に対して，「シャッフル(x,y)」と呼ばれる次のような操作を行うことで，カードを並び替える（x, y は 1 ≤ x < y < n をみたす整数）．\n\nシャッフル(x,y)\n\nn 枚のカードを，一番上から x 枚目までのカードからなる山A， x+1 枚目から y 枚目のカードからなる山B， y+1 枚目から n 枚目のカードからなる山C の3つの山に分ける．そして，山Aの上に山Bを重ね，さらにその上に山Cを重ねる．\n\n例えば，順番に並んでいる9枚のカードに対して「シャッフル(3,5)」を行うと， 9 枚のカードに書かれた番号は, 上から順番に 6, 7, 8, 9, 4, 5, 1, 2, 3 となる．\n\n最初の山の状態から m 回のシャッフル「シャッフル(x1, y1)」「シャッフル(x2, y2)」 … 「シャッフル(xm, ym)」を順番に行った後のカードの山において，上から数えて p 枚目から q 枚目のカードの中に番号が r 以下のカードが何枚含まれているかを求めるプログラムを作成せよ．\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n\n入力は m+3 行からなる． 1 行目にはカードの枚数 n が書かれている（3 ≤ n ≤ 1000000000 = 109）． 2 行目にはシャッフルの回数を表す整数 m が書かれている（1 ≤ m ≤ 5000）． 3 行目には整数 p, q, r が書かれている（1 ≤ p ≤ q ≤ n, 1 ≤ r ≤ n）． i + 3 行目（1 ≤ i ≤ m）には2つの整数 xi, yi (1 ≤ xi < yi < n) が空白を区切りとして書かれている．\n\nn が 0 のとき入力の終了を示す. データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに, m 回のシャッフル後のカードの山において，上から数えて p 枚目から q 枚目のカードの中に含まれている番号が r 以下のカードの枚数を１行に出力せよ．\n\n入出力例\n\n入力例\n\n9\n1\n3 7 4\n3 5\n12\n3\n3 8 5\n3 8\n2 5\n6 10\n0\n\n出力例\n\n2\n3\n\n1つ目の入力例の山に対して, 「シャッフル(3,5)」を行うと，カードは上から順番に 6, 7, 8, 9, 4, 5, 1, 2, 3 となる．上から数えて 3 枚目から 7 枚目に含まれる番号が 4 以下のカードは，番号 4 と番号 1 の 2 枚である．\n\nまた，2つ目の入力例の山に対して, 「シャッフル(3,8)」「シャッフル(2,5)」「シャッフル(6,10)」を順番に行うと，カードは上から順番に 9, 10, 3, 11, 12, 4, 5, 6, 7, 8, 1, 2 となる．上から数えて 3 枚目から 8 枚目に含まれる番号が 5 以下のカードは 3 枚である．\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "9\n1\n3 7 4\n3 5\n12\n3\n3 8 5\n3 8\n2 5\n6 10\n0\n"}, "reference_outputs": ["2\n3\n"], "source_document_id": "p00459", "source_text": "シャッフル\n\n問題\n\n1 から n までの番号が書かれた n 枚のカードがある．まず，一番上が番号 1 のカード，上から2枚目が番号 2 のカード，…，一番下が番号 n のカードとなるように順番に重ねて，カードの山を作る．\n\nカードの山に対して，「シャッフル(x,y)」と呼ばれる次のような操作を行うことで，カードを並び替える（x, y は 1 ≤ x < y < n をみたす整数）．\n\nシャッフル(x,y)\n\nn 枚のカードを，一番上から x 枚目までのカードからなる山A， x+1 枚目から y 枚目のカードからなる山B， y+1 枚目から n 枚目のカードからなる山C の3つの山に分ける．そして，山Aの上に山Bを重ね，さらにその上に山Cを重ねる．\n\n例えば，順番に並んでいる9枚のカードに対して「シャッフル(3,5)」を行うと， 9 枚のカードに書かれた番号は, 上から順番に 6, 7, 8, 9, 4, 5, 1, 2, 3 となる．\n\n最初の山の状態から m 回のシャッフル「シャッフル(x1, y1)」「シャッフル(x2, y2)」 … 「シャッフル(xm, ym)」を順番に行った後のカードの山において，上から数えて p 枚目から q 枚目のカードの中に番号が r 以下のカードが何枚含まれているかを求めるプログラムを作成せよ．\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n\n入力は m+3 行からなる． 1 行目にはカードの枚数 n が書かれている（3 ≤ n ≤ 1000000000 = 109）． 2 行目にはシャッフルの回数を表す整数 m が書かれている（1 ≤ m ≤ 5000）． 3 行目には整数 p, q, r が書かれている（1 ≤ p ≤ q ≤ n, 1 ≤ r ≤ n）． i + 3 行目（1 ≤ i ≤ m）には2つの整数 xi, yi (1 ≤ xi < yi < n) が空白を区切りとして書かれている．\n\nn が 0 のとき入力の終了を示す. データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに, m 回のシャッフル後のカードの山において，上から数えて p 枚目から q 枚目のカードの中に含まれている番号が r 以下のカードの枚数を１行に出力せよ．\n\n入出力例\n\n入力例\n\n9\n1\n3 7 4\n3 5\n12\n3\n3 8 5\n3 8\n2 5\n6 10\n0\n\n出力例\n\n2\n3\n\n1つ目の入力例の山に対して, 「シャッフル(3,5)」を行うと，カードは上から順番に 6, 7, 8, 9, 4, 5, 1, 2, 3 となる．上から数えて 3 枚目から 7 枚目に含まれる番号が 4 以下のカードは，番号 4 と番号 1 の 2 枚である．\n\nまた，2つ目の入力例の山に対して, 「シャッフル(3,8)」「シャッフル(2,5)」「シャッフル(6,10)」を順番に行うと，カードは上から順番に 9, 10, 3, 11, 12, 4, 5, 6, 7, 8, 1, 2 となる．上から数えて 3 枚目から 8 枚目に含まれる番号が 5 以下のカードは 3 枚である．\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1973, "cpu_time_ms": 1130, "memory_kb": 170328}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s039176964", "group_id": "codeNet:p00471", "input_text": "\nimport java.io.IOException;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tnew Main().run();\n\t}\n\n\tprivate void run() throws IOException {\n\t\tScanner scanner = new Scanner(System.in);\n\t\twhile (true) {\n\t\t\tm = scanner.nextInt();\n\t\t\tn = scanner.nextInt();\n\t\t\tif ((m | n) == 0)\n\t\t\t\tbreak;\n\t\t\tM = new HashMap();\n\t\t\th = 1;\n\t\t\ta = new int[n][m];\n\t\t\tY = new int[24];\n\t\t\tX = new int[24];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\t\tint t = scanner.nextInt();\n\t\t\t\t\tif (t == 0) {\n\t\t\t\t\t\ta[i][j] = -1;\n\t\t\t\t\t} else if (t == 1) {\n\t\t\t\t\t\tY[h] = i;\n\t\t\t\t\t\tX[h] = j;\n\t\t\t\t\t\ta[i][j] = h++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tY[0] = i;\n\t\t\t\t\t\tX[0] = j;\n\t\t\t\t\t\ta[i][j] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tSystem.out.println(slove(0, 1));\n\t\t}\n\t}\n\n\tprivate int slove(int cur, int bit) {\n\t\tint k = cur << 24 | bit;\n\t\tif (M.containsKey(k))\n\t\t\treturn M.get(k);\n\t\tint res = 0;\n\t\tfor (int[] mo : move) {\n\t\t\tint y = Y[cur];\n\t\t\tint x = X[cur];\n\t\t\twhile (true) {\n\t\t\t\ty += mo[0];\n\t\t\t\tx += mo[1];\n\t\t\t\tif (!isOK(y, x))\n\t\t\t\t\tbreak;\n\t\t\t\tif (a[y][x] == 0)\n\t\t\t\t\tif (Integer.bitCount(bit) == h) {\n\t\t\t\t\t\treturn res + 1;\n\t\t\t\t\t}\n\t\t\t\tif (a[y][x] >= 1) {\n\t\t\t\t\tif ((bit >> a[y][x] & 1) == 1)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tres += slove(a[y][x], bit | 1 << a[y][x]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tM.put(cur << 24 | bit, res);\n\t\treturn res;\n\t}\n\n\tprivate boolean isOK(int y, int x) {\n\t\tif (0 <= y && y < n && 0 <= x && x < m)\n\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tint m, n, h;\n\tint[] Y, X;\n\tint[][] a;\n\tint[][] move = { { -1, 0 }, { 0, -1 }, { 0, 1 }, { 1, 0 } };\n\tMap M;\n}", "language": "Java", "metadata": {"date": 1427298172, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00471.html", "problem_id": "p00471", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00471/input.txt", "sample_output_relpath": "derived/input_output/data/p00471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00471/Java/s039176964.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s039176964", "user_id": "u213849509"}, "prompt_components": {"gold_output": "2\n6\n", "input_to_evaluate": "\nimport java.io.IOException;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tnew Main().run();\n\t}\n\n\tprivate void run() throws IOException {\n\t\tScanner scanner = new Scanner(System.in);\n\t\twhile (true) {\n\t\t\tm = scanner.nextInt();\n\t\t\tn = scanner.nextInt();\n\t\t\tif ((m | n) == 0)\n\t\t\t\tbreak;\n\t\t\tM = new HashMap();\n\t\t\th = 1;\n\t\t\ta = new int[n][m];\n\t\t\tY = new int[24];\n\t\t\tX = new int[24];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\t\tint t = scanner.nextInt();\n\t\t\t\t\tif (t == 0) {\n\t\t\t\t\t\ta[i][j] = -1;\n\t\t\t\t\t} else if (t == 1) {\n\t\t\t\t\t\tY[h] = i;\n\t\t\t\t\t\tX[h] = j;\n\t\t\t\t\t\ta[i][j] = h++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tY[0] = i;\n\t\t\t\t\t\tX[0] = j;\n\t\t\t\t\t\ta[i][j] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tSystem.out.println(slove(0, 1));\n\t\t}\n\t}\n\n\tprivate int slove(int cur, int bit) {\n\t\tint k = cur << 24 | bit;\n\t\tif (M.containsKey(k))\n\t\t\treturn M.get(k);\n\t\tint res = 0;\n\t\tfor (int[] mo : move) {\n\t\t\tint y = Y[cur];\n\t\t\tint x = X[cur];\n\t\t\twhile (true) {\n\t\t\t\ty += mo[0];\n\t\t\t\tx += mo[1];\n\t\t\t\tif (!isOK(y, x))\n\t\t\t\t\tbreak;\n\t\t\t\tif (a[y][x] == 0)\n\t\t\t\t\tif (Integer.bitCount(bit) == h) {\n\t\t\t\t\t\treturn res + 1;\n\t\t\t\t\t}\n\t\t\t\tif (a[y][x] >= 1) {\n\t\t\t\t\tif ((bit >> a[y][x] & 1) == 1)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tres += slove(a[y][x], bit | 1 << a[y][x]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tM.put(cur << 24 | bit, res);\n\t\treturn res;\n\t}\n\n\tprivate boolean isOK(int y, int x) {\n\t\tif (0 <= y && y < n && 0 <= x && x < m)\n\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tint m, n, h;\n\tint[] Y, X;\n\tint[][] a;\n\tint[][] move = { { -1, 0 }, { 0, -1 }, { 0, 1 }, { 1, 0 } };\n\tMap M;\n}", "problem_context": "方向音痴のトナカイ\n\n問題\n\n今年も JOI 町にサンタクロースが空からやってきた．JOI 町にある全ての家には子供がいるので，このサンタクロースは JOI 町の全ての家にプレゼントを配ってまわらなければならない．しかし，今年は連れているトナカイが少々方向音痴であり，また建物の上以外に降りることができないため，全ての家にプレゼントを配るためには少々道順を工夫しなければならないようだ．\n\nJOI 町は東西南北に区画整理されており，各区画は家，教会，空き地のいずれかである．JOI 町には 1 つだけ教会がある．次のルールに従い，サンタクロースとトナカイは教会から出発し，全ての家に 1 回ずつプレゼントを配った後，教会に戻る．\n\n今年のトナカイは少々方向音痴であるため，東西南北いずれかの方向にまっすぐ飛ぶことしかできず，空中では方向転換できない．\n\nまだプレゼントを配っていない家の上は自由に通過できる．まだプレゼントを配っていない家には降りることができる．家に降りた時は必ずプレゼントを配り，その後は東西南北いずれかの方向に飛び立つ．\n\nJOI 町の家では，クリスマスの夜はサンタクロースが来るまでは暖炉をつけずに過ごしているが，サンタクロースが飛び立った後は暖炉をつける．暖炉をつけると煙突から煙が出るので，プレゼントを配り終えた家の上を通過することはできない．\n\n教会の上は自由に通過することができる．しかし，教会では礼拝が行われているので，全てのプレゼントを配り終えるまで教会に降りることはできない．\n\n空き地の上は自由に通過することができるが，空き地に降りることはできない．\n\n入力として町の構造が与えられたとき，サンタクロースとトナカイがプレゼントを配る道順が何通りあるかを求めるプログラムを作成せよ．\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n\n各データセットは n+1 行ある．\n1 行目には整数 m (1 ≤ m ≤ 10) と整数 n (1 ≤ n ≤ 10) が空白で区切られて書かれている．\n2 行目から n+1 行目までの各行には，0，1，2 のいずれかが，\n空白で区切られて m 個書かれており，各々が各区画の状態を表している．\n北から i 番目，西から j 番目の区画を (i,j) と記述することにすると\n(1 ≤ i ≤ n, 1 ≤ j ≤ m)，\n第 i+1 行目の j 番目の値は，\n区画 (i,j) が空き地である場合は 0 となり，\n家である場合は 1 となり，\n教会である場合は 2 となる．\n教会の個数は 1 であり，家の個数は 1 以上 23 以下である．\nただし，採点用入力データでは配る道順が 2000000 通りをこえることはない．\n\nm, n がともに 0 のとき入力の終了を示す.データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに,プレゼントを配る道順が何通りあるかを表す整数を1 行に出力する．\n\n入出力例\n\n入力例\n\n3 2\n1 0 1\n1 0 2\n3 3\n1 1 1\n1 0 1\n1 1 2\n0 0\n\n出力例\n\n2\n6\n\n図: 2つ目の入力例 に対する 6 通り全ての道順\n（数字は配る順序を表す）\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "3 2\n1 0 1\n1 0 2\n3 3\n1 1 1\n1 0 1\n1 1 2\n0 0\n"}, "reference_outputs": ["2\n6\n"], "source_document_id": "p00471", "source_text": "方向音痴のトナカイ\n\n問題\n\n今年も JOI 町にサンタクロースが空からやってきた．JOI 町にある全ての家には子供���いるので，このサンタクロースは JOI 町の全ての家にプレゼントを配ってまわらなければならない．しかし，今年は連れているトナカイが少々方向音痴であり，また建物の上以外に降りることができないため，全ての家にプレゼントを配るためには少々道順を工夫しなければならないようだ．\n\nJOI 町は東西南北に区画整理されており，各区画は家，教会，空き地のいずれかである．JOI 町には 1 つだけ教会がある．次のルールに従い，サンタクロースとトナカイは教会から出発し，全ての家に 1 回ずつプレゼントを配った後，教会に戻る．\n\n今年のトナカイは少々方向音痴であるため，東西南北いずれかの方向にまっすぐ飛ぶことしかできず，空中では方向転換できない．\n\nまだプレゼントを配っていない家の上は自由に通過できる．まだプレゼントを配っていない家には降りることができる．家に降りた時は必ずプレゼントを配り，その後は東西南北いずれかの方向に飛び立つ．\n\nJOI 町の家では，クリスマスの夜はサンタクロースが来るまでは暖炉をつけずに過ごしているが，サンタクロースが飛び立った後は暖炉をつける．暖炉をつけると煙突から煙が出るので，プレゼントを配り終えた家の上を通過することはできない．\n\n教会の上は自由に通過することができる．しかし，教会では礼拝が行われているので，全てのプレゼントを配り終えるまで教会に降りることはできない．\n\n空き地の上は自由に通過することができるが，空き地に降りることはできない．\n\n入力として町の構造が与えられたとき，サンタクロースとトナカイがプレゼントを配る道順が何通りあるかを求めるプログラムを作成せよ．\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n\n各データセットは n+1 行ある．\n1 行目には整数 m (1 ≤ m ≤ 10) と整数 n (1 ≤ n ≤ 10) が空白で区切られて書かれている．\n2 行目から n+1 行目までの各行には，0，1，2 のいずれかが，\n空白で区切られて m 個書かれており，各々が各区画の状態を表している．\n北から i 番目，西から j 番目の区画を (i,j) と記述することにすると\n(1 ≤ i ≤ n, 1 ≤ j ≤ m)，\n第 i+1 行目の j 番目の値は，\n区画 (i,j) が空き地である場合は 0 となり，\n家である場合は 1 となり，\n教会である場合は 2 となる．\n教会の個数は 1 であり，家の個数は 1 以上 23 以下である．\nただし，採点用入力データでは配る道順が 2000000 通りをこえることはない．\n\nm, n がともに 0 のとき入力の終了を示す.データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに,プレゼントを配る道順が何通りあるかを表す整数を1 行に出力する．\n\n入出力例\n\n入力例\n\n3 2\n1 0 1\n1 0 2\n3 3\n1 1 1\n1 0 1\n1 1 2\n0 0\n\n出力例\n\n2\n6\n\n図: 2つ目の入力例 に対する 6 通り全ての道順\n（数字は配る順序を表す）\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1652, "cpu_time_ms": 1640, "memory_kb": 178704}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s054215299", "group_id": "codeNet:p00479", "input_text": "import java.util.Scanner;\n\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner scan = new Scanner(System.in);\n\n\t\twhile(scan.hasNext())\n\t\t{\n\t\t\tint N = scan.nextInt();\n\t\t\tint K = scan.nextInt();\n\t\t\tfor(int i=0;iN/2)\n\t\t\t\t\tx = N-1-x;\n\t\t\t\tif(y>N/2)\n\t\t\t\t\ty = N-1-y;\n\t\t\t\tint ans = Math.min(x,y);\n\t\t\t\tSystem.out.println(ans%3+1);\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1372316729, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00479.html", "problem_id": "p00479", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00479/input.txt", "sample_output_relpath": "derived/input_output/data/p00479/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00479/Java/s054215299.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s054215299", "user_id": "u613794483"}, "prompt_components": {"gold_output": "2\n3\n1\n3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner scan = new Scanner(System.in);\n\n\t\twhile(scan.hasNext())\n\t\t{\n\t\t\tint N = scan.nextInt();\n\t\t\tint K = scan.nextInt();\n\t\t\tfor(int i=0;iN/2)\n\t\t\t\t\tx = N-1-x;\n\t\t\t\tif(y>N/2)\n\t\t\t\t\ty = N-1-y;\n\t\t\t\tint ans = Math.min(x,y);\n\t\t\t\tSystem.out.println(ans%3+1);\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "タイル (Tile)\n\n問題\n\nJOI 高校では， 1 × 1 の正方形のタイルを使って N × N の正方形の壁画を作り，文化祭で展示することになった．タイルの色は，赤，青，黄の 3 種類である．壁画のデザインは次の通りである．まず，最も外側の周に赤のタイルを貼り，その内側の周に青のタイルを貼る．さらにその内側の周に黄色のタイルを貼る．これを N × N の正方形が埋め尽くされるまで繰り返す．用いるタイルの色は，一番外側の周から順番に赤，青，黄，赤，青，黄，…である．\n\n文化祭が近づいてきたある日，壁画のうち K 枚のタイルがはがれていることが判明した．そこで，新しいタイルを購入して，はがれた箇所に新しいタイルを貼ることにした．\n\n入力として壁画の一辺の長さ N と，はがれたタイルの枚数 K， K 枚のはがれたタイルの位置が与えられたとき，はがれたタイルの色を求めるプログラムを作成せよ．\n\n例えば，N = 11 の場合，11 × 11 の壁画のデザインは下図の通りである．\n\nまた，N = 16 の場合，16 × 16 の壁画のデザインは下図の通りである．\n\n入力\n\n入力は全部で 2+K 行からなる． 1 行目には，壁画の一辺の長さ N （1 ≤ N ≤ 1000000000 = 109）が， 2 行目には，はがれたタイルの枚数 K （1 ≤ K ≤ 1000）が書かれている． 2+i 行目（1 ≤ i ≤ K）には，2 つの整数 ai と bi （1 ≤ ai ≤ N, 1 ≤ bi ≤ N）が空白区切りで書かれており， i 枚目のはがれたタイルが，左から ai 列目，上から bi 行目のタイルであることを表す．\n\n入力の 3 行目から 2+K 行目には同じタイルを表す行が重複して現れることはない．また，与えられる入力データ 40% では， N ≤ 1000 をみたしている．\n\n出力\n\n出力は K 行からなる．各行は 1 つの整数からなり， i 行目（1 ≤ i ≤K）の整数は，i 枚目のはがれたタイルが赤のときは 1 を，青のときは 2 を，黄色のときは 3 を表す．\n\n入出力例\n\n入力例 1\n\n11\n4\n5 2\n9 7\n4 4\n3 9\n\n出力例 1\n\n2\n3\n1\n3\n\n入力例 2\n\n16\n7\n3 7\n5 2\n11 6\n15 2\n9 7\n8 12\n15 16\n\n出力例 2\n\n3\n2\n3\n2\n1\n2\n1\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "11\n4\n5 2\n9 7\n4 4\n3 9\n"}, "reference_outputs": ["2\n3\n1\n3\n"], "source_document_id": "p00479", "source_text": "タイル (Tile)\n\n問題\n\nJOI 高校では， 1 × 1 の正方形のタイルを使って N × N の正方形の壁画を作り，文化祭で展示することになった．タイルの色は，赤，青，黄の 3 種類である．壁画のデザインは次の通りである．まず，最も外側の周に赤のタイルを貼り，その内側の周に青のタイルを貼る．さらにその内側の周に黄色のタイルを貼る．これを N × N の正方形が埋め尽くされるまで繰り返す．用いるタイルの色は，一番外側の周から順番に赤，青，黄，赤，青，黄，…である．\n\n文化祭が近づいてきたある日，壁画のうち K 枚のタイルがはがれていることが判明した．そこで，新しいタイルを購入して，はがれた箇所に新しいタイルを貼ることにした．\n\n入力として壁画の一辺の長さ N と，はがれたタイルの枚数 K， K 枚のはがれたタイルの位置が与えられたとき，はがれたタイルの色を求めるプログラムを作成せよ．\n\n例えば，N = 11 の場合，11 × 11 の壁画のデザインは下図の通りである．\n\nまた，N = 16 の場合，16 × 16 の壁画のデザインは下図の通りである．\n\n入力\n\n入力は全部で 2+K 行からなる． 1 行目には，壁画の一辺の長さ N （1 ≤ N ≤ 1000000000 = 109）が， 2 行目には，はがれたタイルの枚数 K （1 ≤ K ≤ 1000）が書かれている． 2+i 行目（1 ≤ i ≤ K）には，2 つの整数 ai と bi （1 ≤ ai ≤ N, 1 ≤ bi ≤ N）が空白区切りで書かれており， i 枚目のはがれたタイルが，左から ai 列目，上から bi 行目のタイルであることを表す．\n\n入力の 3 行目から 2+K 行目には同じタイルを表す行が重複して現れることはない．また，与えられる入力データ 40% では， N ≤ 1000 をみたしている．\n\n出力\n\n出力は K 行からなる．各行は 1 つの整数からなり， i 行目（1 ≤ i ≤K）の整数は，i 枚目のはがれたタイルが赤のときは 1 を，青のときは 2 を，黄色のときは 3 を表す．\n\n入出力例\n\n入力例 1\n\n11\n4\n5 2\n9 7\n4 4\n3 9\n\n出力例 1\n\n2\n3\n1\n3\n\n入力例 2\n\n16\n7\n3 7\n5 2\n11 6\n15 2\n9 7\n8 12\n15 16\n\n出力例 2\n\n3\n2\n3\n2\n1\n2\n1\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 439, "cpu_time_ms": 160, "memory_kb": 25188}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s733068248", "group_id": "codeNet:p00499", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int jAll = sc.nextInt();\n int mAll = sc.nextInt();\n int jEach = sc.nextInt();\n int mEach = sc.nextInt();\n System.out.println(n - Math.max((jAll + jEach - 1) / jEach, (mAll + mEach - 1) / mEach));\n }\n}\n\n", "language": "Java", "metadata": {"date": 1586327194, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00499.html", "problem_id": "p00499", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00499/input.txt", "sample_output_relpath": "derived/input_output/data/p00499/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00499/Java/s733068248.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s733068248", "user_id": "u788025930"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int jAll = sc.nextInt();\n int mAll = sc.nextInt();\n int jEach = sc.nextInt();\n int mEach = sc.nextInt();\n System.out.println(n - Math.max((jAll + jEach - 1) / jEach, (mAll + mEach - 1) / mEach));\n }\n}\n\n", "problem_context": "宿題 (Homework)\n\n問題\n\n冬休みの宿題に毎回苦しめられてきた JOI 君が，今回は宿題を計画的に実行することにした．宿題は国語と算数のドリルであり，国語のドリルは A ページ，算数のドリルは B ページある．\n\nJOI 君は，1 日に国語のドリルを最大 C ページと，算数のドリルを最大 D ページ進めることができるが，宿題をするとその日は遊ぶことができない．\n\n冬休みは L 日あり，JOI 君は冬休み中に宿題を終わらせなければならない．JOI 君が冬休み中に最大で何日遊べるかを求めるプログラムを作成せよ．\n\n入力\n\n入力は 5 行からなり，1 行に 1 つずつ正の整数が書かれている．\n\n1 行目には整数 L (2 ≦ L ≦ 40) が書かれており，冬休みの日数を表す．\n\n2 行目には整数 A (1 ≦ A ≦ 1000) が書かれており，国語のドリルのページ数を表す．\n\n3 行目には整数 B (1 ≦ B ≦ 1000) が書かれており，算数のドリルのページ数を表す．\n\n4 行目には整数 C (1 ≦ C ≦ 100) が書かれており，JOI 君が 1 日に進めることができる国語のドリルの最大ページ数を表す．\n\n5 行目には整数 D (1 ≦ D ≦ 100) が書かれており，JOI 君が 1 日に進めることができる算数のドリルの最大ページ数を表す．\n\nただし，与えられる入力データにおいては，JOI 君が冬休み中に宿題を必ず終わらせることができ，\n少なくとも 1 日は遊べることが保証されている．\n\n出力\n\nJOI 君が冬休み中に遊べる日数の最大値を 1 行で出力せよ．\n\n入出力例\n\n入力例 1\n\n20\n25\n30\n6\n8\n\n出力例 1\n\n15\n\n入出力例 1 では，冬休みは 20 日間あり，国語のドリルが 25 ページ，算数のドリルが 30 ページある．JOI 君は 1 日に国語のドリルを最大 6 ページ，算数のドリルを最大 8 ページ進めることができる．例えば JOI 君が冬休み初日から国語のドリルを 6 ページ，算数のドリルを 8 ページずつ進めたとすると，国語のドリルを 5 日目に，算数のドリルを 4 日目に終わらせることができ，15 日間遊ぶことができる．これが JOI 君が冬休み中に遊べる日数の最大値なので，15 を出力する．\n\n入力例 2\n\n15\n32\n48\n4\n6\n\n出力例 2\n\n7\n\n入出力例 2 では，\n例えば JOI 君が初日から国語のドリルを 4 ページ，算数のドリルを 6 ページずつ進めたとすると，8 日目に両方のドリルを終わらせることができ，7 日間遊ぶことができる．これが JOI 君が冬休み中に遊べる日数の最大値なので，7 を出力する．\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "20\n25\n30\n6\n8\n"}, "reference_outputs": ["15\n"], "source_document_id": "p00499", "source_text": "宿題 (Homework)\n\n問題\n\n冬休みの宿題に毎回苦しめられてきた JOI 君が，今回は宿題を計画的に実行することにした．宿題は国語と算数のドリルであり，国語のドリルは A ページ，算数のドリルは B ページある．\n\nJOI 君は，1 日に国語のドリルを最大 C ページと，算数のドリルを最大 D ページ進めることができるが，宿題をするとその日は遊ぶことができない．\n\n冬休みは L 日あり，JOI 君は冬休み中に宿題を終わらせなければならない．JOI 君が冬休み中に最大で何日遊べるかを求めるプログラムを作成せよ．\n\n入力\n\n入力は 5 行からなり，1 行に 1 つずつ正の整数が書かれている．\n\n1 行目には整数 L (2 ≦ L ≦ 40) が書かれており，冬休みの日数を表す．\n\n2 行目には整数 A (1 ≦ A ≦ 1000) が書かれており，国語のドリルのページ数を表す．\n\n3 行目には整数 B (1 ≦ B ≦ 1000) が書かれており，算数のドリルのページ数を表す．\n\n4 行目には整数 C (1 ≦ C ≦ 100) が書かれており，JOI 君が 1 日に進めることができる国語のドリルの最大ページ数を表す．\n\n5 行目には整数 D (1 ≦ D ≦ 100) が書かれており，JOI 君が 1 日に進めることができる算数のドリルの最大ページ数を表す．\n\nただし，与えられる入力データにおいては，JOI 君が冬休み中に宿題を必ず終わらせることができ，\n少なくとも 1 日は遊べることが保証されている．\n\n出力\n\nJOI 君が冬休み中に遊べる日数の最大値を 1 行で出力せよ．\n\n入出力例\n\n入力例 1\n\n20\n25\n30\n6\n8\n\n出力例 1\n\n15\n\n入出力例 1 では，冬休みは 20 日間あり，国語のドリルが 25 ページ，算数のドリルが 30 ページある．JOI 君は 1 日に国語のドリルを最大 6 ページ，算数のドリルを最大 8 ページ進めることができる．例えば JOI 君が冬休み初日から国語のドリルを 6 ページ，算数のドリルを 8 ページずつ進めたとすると，国語のドリルを 5 日目に，算数のドリルを 4 日目に終わらせることができ，15 日間遊ぶことができる．これが JOI 君が冬休み中に遊べる日数の最大値なので，15 を出力する．\n\n入力例 2\n\n15\n32\n48\n4\n6\n\n出力例 2\n\n7\n\n入出力例 2 では，\n例えば JOI 君が初日から国語のドリルを 4 ページ，算数のドリルを 6 ページずつ進めたとすると，8 日目に両方のドリルを終わらせることができ，7 日間遊ぶことができる．これが JOI 君が冬休み中に遊べる日数の最大値なので，7 を出力する．\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 402, "cpu_time_ms": 90, "memory_kb": 26272}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s676772027", "group_id": "codeNet:p00507", "input_text": "\nimport java.lang.reflect.Array;\nimport java.util.*;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tLinkedList a = new LinkedList();\n\t\tfor(int i=1;i<=n;i++){\n\t\t\ta.add(sc.nextInt());\n\t\t}\n\t\tCollections.sort(a);\n\t\t\n\t\tint ans = 0;\n\t\tString s = String.valueOf(a.pollFirst());\n\t\tString sss = String.valueOf(a.pollFirst());\n\t\tString ss = String.valueOf(a.pollFirst());\n\t\tif(n==3)\n\t\t\tans = Integer.parseInt(sss+s);\n\t\telse\n\t\t\tans = Integer.parseInt(s+ss);\n\t\tSystem.out.println(ans);\n\t\t\n\t}\n}\n", "language": "Java", "metadata": {"date": 1531113209, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00507.html", "problem_id": "p00507", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00507/input.txt", "sample_output_relpath": "derived/input_output/data/p00507/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00507/Java/s676772027.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s676772027", "user_id": "u935042117"}, "prompt_components": {"gold_output": "52\n", "input_to_evaluate": "\nimport java.lang.reflect.Array;\nimport java.util.*;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tLinkedList a = new LinkedList();\n\t\tfor(int i=1;i<=n;i++){\n\t\t\ta.add(sc.nextInt());\n\t\t}\n\t\tCollections.sort(a);\n\t\t\n\t\tint ans = 0;\n\t\tString s = String.valueOf(a.pollFirst());\n\t\tString sss = String.valueOf(a.pollFirst());\n\t\tString ss = String.valueOf(a.pollFirst());\n\t\tif(n==3)\n\t\t\tans = Integer.parseInt(sss+s);\n\t\telse\n\t\t\tans = Integer.parseInt(s+ss);\n\t\tSystem.out.println(ans);\n\t\t\n\t}\n}\n", "problem_context": "問題 3\n\n　入力ファイルの１行目に正整数 n （n≧3）が書いてあり，\nつづく n 行に異なる正整数 a1, ..., an が\n１つずつ書いてある．\na1, ..., an から異なる２個を選んで作られる\n順列を（数として見て）小さい順に並べたとき，\n３番目に来るものを出力せよ．\n\n　ただし，\n例えば，a1 = 1，a4 = 11 のような場合も，\na1a4 と a4a1 は異なる順列とみなす．\nまた，\n1≦ai≦10000 (i=1, ..., n) かつ 3≦n≦104 である．\n\n出力ファイルにおいては，\n出力の最後にも改行コードを入れること．\n\n入出力例\n\n入力例１\n\n3\n2\n7\n5\n\n出力例１\n\n52\n\n入力例２\n\n4\n17\n888\n1\n71\n\n出力例２\n\n171\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "3\n2\n7\n5\n"}, "reference_outputs": ["52\n"], "source_document_id": "p00507", "source_text": "問題 3\n\n　入力ファイルの１行目に正整数 n （n≧3）が書いてあり，\nつづく n 行に異なる正整数 a1, ..., an が\n１つずつ書いてある．\na1, ..., an から異なる２個を選んで作られる\n順列を（数として見て）小さい順に並べたとき，\n３番目に来るものを出力せよ．\n\n　ただし，\n例えば，a1 = 1，a4 = 11 のような場合も，\na1a4 と a4a1 は異なる順列とみなす．\nまた，\n1≦ai≦10000 (i=1, ..., n) かつ 3≦n≦104 である．\n\n出力ファイルにおいては，\n出力の最後にも改行コードを入れること．\n\n入出力例\n\n入力例１\n\n3\n2\n7\n5\n\n出力例１\n\n52\n\n入力例２\n\n4\n17\n888\n1\n71\n\n出力例２\n\n171\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 582, "cpu_time_ms": 60, "memory_kb": 26296}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s069409200", "group_id": "codeNet:p00705", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args)throws IOException{\n\t\tInputStreamReader isr = new InputStreamReader(System.in);\n\t\tBufferedReader reader = new BufferedReader(isr);\n\t\tString str, s[];\n\t\t\n\t\tint n, q, date[];\n\t\tx : while(!(str = reader.readLine()).equals(\"0 0\")){\n\t\t\ts = str.split(\" \");\n\t\t\tn = Integer.valueOf(s[0]);\n\t\t\tq = Integer.valueOf(s[1]);\n\t\t\t\n\t\t\tdate = new int[110];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\ts = reader.readLine().split(\" \");\n\t\t\t\tfor(int j = 1; j <= Integer.valueOf(s[0]); j++){\n\t\t\t\t\tdate[Integer.valueOf(s[j])]++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = n; i >= q; i--)\n\t\t\t\tfor(int j = 1; j < date.length; j++){\n\t\t\t\t\tif(date[j] == i){\n\t\t\t\t\t\tSystem.out.println(j);\n\t\t\t\t\t\tcontinue x;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tSystem.out.println(0);\n\t\t}\n\t\treader.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1463559529, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00705.html", "problem_id": "p00705", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00705/input.txt", "sample_output_relpath": "derived/input_output/data/p00705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00705/Java/s069409200.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s069409200", "user_id": "u489809100"}, "prompt_components": {"gold_output": "4\n5\n0\n2\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args)throws IOException{\n\t\tInputStreamReader isr = new InputStreamReader(System.in);\n\t\tBufferedReader reader = new BufferedReader(isr);\n\t\tString str, s[];\n\t\t\n\t\tint n, q, date[];\n\t\tx : while(!(str = reader.readLine()).equals(\"0 0\")){\n\t\t\ts = str.split(\" \");\n\t\t\tn = Integer.valueOf(s[0]);\n\t\t\tq = Integer.valueOf(s[1]);\n\t\t\t\n\t\t\tdate = new int[110];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\ts = reader.readLine().split(\" \");\n\t\t\t\tfor(int j = 1; j <= Integer.valueOf(s[0]); j++){\n\t\t\t\t\tdate[Integer.valueOf(s[j])]++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = n; i >= q; i--)\n\t\t\t\tfor(int j = 1; j < date.length; j++){\n\t\t\t\t\tif(date[j] == i){\n\t\t\t\t\t\tSystem.out.println(j);\n\t\t\t\t\t\tcontinue x;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tSystem.out.println(0);\n\t\t}\n\t\treader.close();\n\t}\n}", "problem_context": "When Can We Meet?\n\nThe ICPC committee would like to have its meeting as soon as\npossible to address every little issue of the next contest.\nHowever, members of the committee are so busy maniacally developing\n(possibly useless) programs that it is very difficult to arrange\ntheir schedules for the meeting.\nSo, in order to settle the meeting date, the chairperson requested every\nmember to send back a list of convenient dates by E-mail.\nYour mission is to help the chairperson, who is now dedicated to other\nissues of the contest, by writing a program that\nchooses the best date from the submitted lists.\nYour program should find the date convenient for the most members.\nIf there is more than one such day, the earliest is the best.\n\nInput\n\nThe input has multiple data sets, each starting with a line\ncontaining the number of committee members and the quorum of the meeting.\n\nN Q\n\nHere, N, meaning the size of the committee, and Q\nmeaning the quorum, are positive integers. N is less than 50,\nand, of course, Q is less than or equal to N.\n\nN lines follow, each describing convenient dates for a\ncommittee\nmember in the following format.\n\nM Date1\nDate2 ... DateM\n\nHere, M means the number of convenient dates for\nthe member, which is an integer greater than or equal to zero.\nThe remaining items in the line are his/her dates of convenience,\nwhich are positive integers less than 100, that is, 1 means tomorrow,\n2 means the day after tomorrow, and so on.\nThey are in ascending order without any repetition\nand separated by a space character.\nLines have neither leading nor trailing spaces.\n\nA line containing two zeros indicates the end of the input.\n\nOutput\n\nFor each data set, print a single line containing the date number\nconvenient for the largest number of committee members.\nIf there is more than one\nsuch date, print the earliest. However, if no dates are convenient\nfor more than or equal to the quorum number of members, print 0 instead.\n\nSample Input\n\n3 2\n2 1 4\n0\n3 3 4 8\n3 2\n4 1 5 8 9\n3 2 5 9\n5 2 4 5 7 9\n3 3\n2 1 4\n3 2 5 9\n2 2 4\n3 3\n2 1 2\n3 1 2 9\n2 2 4\n0 0\n\nOutput for the Sample Input\n\n4\n5\n0\n2", "sample_input": "3 2\n2 1 4\n0\n3 3 4 8\n3 2\n4 1 5 8 9\n3 2 5 9\n5 2 4 5 7 9\n3 3\n2 1 4\n3 2 5 9\n2 2 4\n3 3\n2 1 2\n3 1 2 9\n2 2 4\n0 0\n"}, "reference_outputs": ["4\n5\n0\n2\n"], "source_document_id": "p00705", "source_text": "When Can We Meet?\n\nThe ICPC committee would like to have its meeting as soon as\npossible to address every little issue of the next contest.\nHowever, members of the committee are so busy maniacally developing\n(possibly useless) programs that it is very difficult to arrange\ntheir schedules for the meeting.\nSo, in order to settle the meeting date, the chairperson requested every\nmember to send back a list of convenient dates by E-mail.\nYour mission is to help the chairperson, who is now dedicated to other\nissues of the contest, by writing a program that\nchooses the best date from the submitted lists.\nYour program should find the date convenient for the most members.\nIf there is more than one such day, the earliest is the best.\n\nInput\n\nThe input has multiple data sets, each starting with a line\ncontaining the number of committee members and the quorum of the meeting.\n\nN Q\n\nHere, N, meaning the size of the committee, and Q\nmeaning the quorum, are positive integers. N is less than 50,\nand, of course, Q is less than or equal to N.\n\nN lines follow, each describing convenient dates for a\ncommittee\nmember in the following format.\n\nM Date1\nDate2 ... DateM\n\nHere, M means the number of convenient dates for\nthe member, which is an integer greater than or equal to zero.\nThe remaining items in the line are his/her dates of convenience,\nwhich are positive integers less than 100, that is, 1 means tomorrow,\n2 means the day after tomorrow, and so on.\nThey are in ascending order without any repetition\nand separated by a space character.\nLines have neither leading nor trailing spaces.\n\nA line containing two zeros indicates the end of the input.\n\nOutput\n\nFor each data set, print a single line containing the date number\nconvenient for the largest number of committee members.\nIf there is more than one\nsuch date, print the earliest. However, if no dates are convenient\nfor more than or equal to the quorum number of members, print 0 instead.\n\nSample Input\n\n3 2\n2 1 4\n0\n3 3 4 8\n3 2\n4 1 5 8 9\n3 2 5 9\n5 2 4 5 7 9\n3 3\n2 1 4\n3 2 5 9\n2 2 4\n3 3\n2 1 2\n3 1 2 9\n2 2 4\n0 0\n\nOutput for the Sample Input\n\n4\n5\n0\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 869, "cpu_time_ms": 130, "memory_kb": 37308}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s678339438", "group_id": "codeNet:p00710", "input_text": "import java.io.IOException;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner br = new Scanner(System.in);\n\tstatic List tmp = new ArrayList();\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tint yamahuda[];\n\n\t\twhile (true) {\n\t\t\t// ?±±???????????°n\n\t\t\tint n = br.nextInt();\n\t\t\tyamahuda = new int[n];\n\t\t\t// ??????????????°r\n\t\t\tint r = br.nextInt();\n\n\t\t\t// 0 0?????´???break;\n\t\t\tif (n == 0 && r == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// ?±±????????????n????????????\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tyamahuda[i] = n - i;\n\t\t\t}\n\t\t\t// ?±±???????????£?????????\n\t\t\tfor (int i = 0; i < r; i++) {\n\t\t\t\tshuffle(yamahuda);\n\t\t\t}\n\t\t\tSystem.out.println(yamahuda[0]);\n\n\t\t}\n\t}\n\n\tpublic static int[] shuffle(int[] yamahuda) throws IOException {\n\t\t// p??¨c?????\\???\n\t\tint p = br.nextInt();\n\t\tint c = br.nextInt();\n\t\ttmp.clear();\n\t\tif (p - 1 < c) {\n\n\t\t\t// ?????????????±±???????????????????????????tmp???????´?\n\t\t\tfor (int i = 0; i < c; i++) {\n\t\t\t\ttmp.add(yamahuda[p - 1 + i]);\n\t\t\t}\n\t\t\tfor (int i = 0; i < p - 1; i++) {\n\t\t\t\tyamahuda[c + i] = yamahuda[i];\n\t\t\t}\n\t\t\tfor (int i = 0; i < c; i++) {\n\t\t\t\tyamahuda[i] = tmp.get(i);\n\t\t\t}\n\t\t} else {\n\t\t\t// ???????????????\n\t\t\tfor (int i = 0; i < p - 1; i++) {\n\t\t\t\ttmp.add(yamahuda[i]);\n\t\t\t}\n\t\t\tfor (int i = 0; i < c; i++) {\n\t\t\t\tyamahuda[i] = yamahuda[p - 1 + i];\n\t\t\t}\n\t\t\tfor (int i = 0; i < p - 1; i++) {\n\t\t\t\tyamahuda[c + i] = tmp.get(i);\n\t\t\t}\n\t\t}\n\t\treturn yamahuda;\n\t}\n\n}", "language": "Java", "metadata": {"date": 1460965017, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00710.html", "problem_id": "p00710", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00710/input.txt", "sample_output_relpath": "derived/input_output/data/p00710/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00710/Java/s678339438.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s678339438", "user_id": "u836923362"}, "prompt_components": {"gold_output": "4\n4\n", "input_to_evaluate": "import java.io.IOException;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner br = new Scanner(System.in);\n\tstatic List tmp = new ArrayList();\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tint yamahuda[];\n\n\t\twhile (true) {\n\t\t\t// ?±±???????????°n\n\t\t\tint n = br.nextInt();\n\t\t\tyamahuda = new int[n];\n\t\t\t// ??????????????°r\n\t\t\tint r = br.nextInt();\n\n\t\t\t// 0 0?????´???break;\n\t\t\tif (n == 0 && r == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// ?±±????????????n????????????\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tyamahuda[i] = n - i;\n\t\t\t}\n\t\t\t// ?±±???????????£?????????\n\t\t\tfor (int i = 0; i < r; i++) {\n\t\t\t\tshuffle(yamahuda);\n\t\t\t}\n\t\t\tSystem.out.println(yamahuda[0]);\n\n\t\t}\n\t}\n\n\tpublic static int[] shuffle(int[] yamahuda) throws IOException {\n\t\t// p??¨c?????\\???\n\t\tint p = br.nextInt();\n\t\tint c = br.nextInt();\n\t\ttmp.clear();\n\t\tif (p - 1 < c) {\n\n\t\t\t// ?????????????±±???????????????????????????tmp???????´?\n\t\t\tfor (int i = 0; i < c; i++) {\n\t\t\t\ttmp.add(yamahuda[p - 1 + i]);\n\t\t\t}\n\t\t\tfor (int i = 0; i < p - 1; i++) {\n\t\t\t\tyamahuda[c + i] = yamahuda[i];\n\t\t\t}\n\t\t\tfor (int i = 0; i < c; i++) {\n\t\t\t\tyamahuda[i] = tmp.get(i);\n\t\t\t}\n\t\t} else {\n\t\t\t// ???????????????\n\t\t\tfor (int i = 0; i < p - 1; i++) {\n\t\t\t\ttmp.add(yamahuda[i]);\n\t\t\t}\n\t\t\tfor (int i = 0; i < c; i++) {\n\t\t\t\tyamahuda[i] = yamahuda[p - 1 + i];\n\t\t\t}\n\t\t\tfor (int i = 0; i < p - 1; i++) {\n\t\t\t\tyamahuda[c + i] = tmp.get(i);\n\t\t\t}\n\t\t}\n\t\treturn yamahuda;\n\t}\n\n}", "problem_context": "Problem A: Hanafuda Shuffle\n\nThere are a number of ways to shuffle a deck of cards. Hanafuda\nshuffling for Japanese card game 'Hanafuda' is one such example.\nThe following is how to perform Hanafuda shuffling.\n\nThere is a deck of n cards. Starting from the p-th card\nfrom the top of the deck, c cards are pulled out\nand put on the top of the deck, as shown in Figure 1.\nThis operation, called a cutting operation, is repeated.\n\nWrite a program that simulates Hanafuda shuffling and answers which\ncard will be finally placed on the top of the deck.\n\nFigure 1: Cutting operation\n\nInput\n\nThe input consists of multiple data sets.\nEach data set starts with a line containing two positive integers n\n(1 <= n <= 50) and r (1 <= r <= 50); n and\nr are the number of cards in the deck and the number of cutting\noperations, respectively.\n\nThere are r more lines in the data set, each of which\nrepresents a cutting operation. These cutting operations\nare performed in the listed order.\nEach line contains two positive integers p and c\n(p + c <= n + 1).\nStarting from the p-th card from the top of the deck, c\ncards should be pulled out and put on the top.\n\nThe end of the input is indicated by a line which contains two zeros.\n\nEach input line contains exactly two integers separated by a space\ncharacter.\nThere are no other characters in the line.\n\nOutput\n\nFor each data set in the input, your program\nshould write the number of the top card after the shuffle.\nAssume that at the beginning the cards\nare numbered from 1 to n, from the bottom to the top.\nEach number should be written in a separate line\nwithout any superfluous characters such as leading or following spaces.\n\nSample Input\n\n5 2\n3 1\n3 1\n10 3\n1 10\n10 1\n8 3\n0 0\n\nOutput for the Sample Input\n\n4\n4", "sample_input": "5 2\n3 1\n3 1\n10 3\n1 10\n10 1\n8 3\n0 0\n"}, "reference_outputs": ["4\n4\n"], "source_document_id": "p00710", "source_text": "Problem A: Hanafuda Shuffle\n\nThere are a number of ways to shuffle a deck of cards. Hanafuda\nshuffling for Japanese card game 'Hanafuda' is one such example.\nThe following is how to perform Hanafuda shuffling.\n\nThere is a deck of n cards. Starting from the p-th card\nfrom the top of the deck, c cards are pulled out\nand put on the top of the deck, as shown in Figure 1.\nThis operation, called a cutting operation, is repeated.\n\nWrite a program that simulates Hanafuda shuffling and answers which\ncard will be finally placed on the top of the deck.\n\nFigure 1: Cutting operation\n\nInput\n\nThe input consists of multiple data sets.\nEach data set starts with a line containing two positive integers n\n(1 <= n <= 50) and r (1 <= r <= 50); n and\nr are the number of cards in the deck and the number of cutting\noperations, respectively.\n\nThere are r more lines in the data set, each of which\nrepresents a cutting operation. These cutting operations\nare performed in the listed order.\nEach line contains two positive integers p and c\n(p + c <= n + 1).\nStarting from the p-th card from the top of the deck, c\ncards should be pulled out and put on the top.\n\nThe end of the input is indicated by a line which contains two zeros.\n\nEach input line contains exactly two integers separated by a space\ncharacter.\nThere are no other characters in the line.\n\nOutput\n\nFor each data set in the input, your program\nshould write the number of the top card after the shuffle.\nAssume that at the beginning the cards\nare numbered from 1 to n, from the bottom to the top.\nEach number should be written in a separate line\nwithout any superfluous characters such as leading or following spaces.\n\nSample Input\n\n5 2\n3 1\n3 1\n10 3\n1 10\n10 1\n8 3\n0 0\n\nOutput for the Sample Input\n\n4\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1494, "cpu_time_ms": 210, "memory_kb": 38776}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s223469913", "group_id": "codeNet:p00710", "input_text": "import java.util.*;\n\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\ttry\n\t\t{\n\t\t\tint n, r, p, c, count;\n\t\t\tScanner sc = new Scanner(System.in);\n\t\t\tString input;\n\n\t\t\twhile(true)\n\t\t\t{\n\t\t\t\tn = sc.nextInt();\n\t\t\t\tr = sc.nextInt();\n\n\t\t\t\tint[] deck = new int[n];\n\t\t\t\tint[] ndeck = new int [n];\n\n\t\t\t\tfor(int i = n; i > 0; i--)\n\t\t\t\t{\n\t\t\t\t\tdeck[n - i] = i;\n\t\t\t\t\tndeck[n - i] = deck[n - i];\n\t\t\t\t}\n\n\t\t\t\tif(n == 0 && r == 0)\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\twhile(r > 0)\n\t\t\t\t{\n\t\t\t\t\tcount = 0;\n\t\t\t\t\tp = sc.nextInt();\n\t\t\t\t\tc = sc.nextInt();\n\n\t\t\t\t\tfor(int i = p - 1; i < p - 1 + c; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tndeck[count] = deck[i];\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\n\t\t\t\t\tfor(int i = 0; i < p - 1; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tndeck[count] = deck[i];\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\n\t\t\t\t\tfor(int i = 0; i < n; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tdeck[i] = ndeck[i];\n\t\t\t\t\t}\n\n\t\t\t\t\tr--;\n\t\t\t\t}\n\n\t\t\t\tSystem.out.println(ndeck[0]);\n\t\t\t}\n\n\t\t}\n\t\tcatch(InputMismatchException e)\n\t\t{\n\t\t\tSystem.out.println(e);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1494226916, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00710.html", "problem_id": "p00710", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00710/input.txt", "sample_output_relpath": "derived/input_output/data/p00710/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00710/Java/s223469913.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s223469913", "user_id": "u339889493"}, "prompt_components": {"gold_output": "4\n4\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\ttry\n\t\t{\n\t\t\tint n, r, p, c, count;\n\t\t\tScanner sc = new Scanner(System.in);\n\t\t\tString input;\n\n\t\t\twhile(true)\n\t\t\t{\n\t\t\t\tn = sc.nextInt();\n\t\t\t\tr = sc.nextInt();\n\n\t\t\t\tint[] deck = new int[n];\n\t\t\t\tint[] ndeck = new int [n];\n\n\t\t\t\tfor(int i = n; i > 0; i--)\n\t\t\t\t{\n\t\t\t\t\tdeck[n - i] = i;\n\t\t\t\t\tndeck[n - i] = deck[n - i];\n\t\t\t\t}\n\n\t\t\t\tif(n == 0 && r == 0)\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\twhile(r > 0)\n\t\t\t\t{\n\t\t\t\t\tcount = 0;\n\t\t\t\t\tp = sc.nextInt();\n\t\t\t\t\tc = sc.nextInt();\n\n\t\t\t\t\tfor(int i = p - 1; i < p - 1 + c; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tndeck[count] = deck[i];\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\n\t\t\t\t\tfor(int i = 0; i < p - 1; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tndeck[count] = deck[i];\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\n\t\t\t\t\tfor(int i = 0; i < n; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tdeck[i] = ndeck[i];\n\t\t\t\t\t}\n\n\t\t\t\t\tr--;\n\t\t\t\t}\n\n\t\t\t\tSystem.out.println(ndeck[0]);\n\t\t\t}\n\n\t\t}\n\t\tcatch(InputMismatchException e)\n\t\t{\n\t\t\tSystem.out.println(e);\n\t\t}\n\t}\n}", "problem_context": "Problem A: Hanafuda Shuffle\n\nThere are a number of ways to shuffle a deck of cards. Hanafuda\nshuffling for Japanese card game 'Hanafuda' is one such example.\nThe following is how to perform Hanafuda shuffling.\n\nThere is a deck of n cards. Starting from the p-th card\nfrom the top of the deck, c cards are pulled out\nand put on the top of the deck, as shown in Figure 1.\nThis operation, called a cutting operation, is repeated.\n\nWrite a program that simulates Hanafuda shuffling and answers which\ncard will be finally placed on the top of the deck.\n\nFigure 1: Cutting operation\n\nInput\n\nThe input consists of multiple data sets.\nEach data set starts with a line containing two positive integers n\n(1 <= n <= 50) and r (1 <= r <= 50); n and\nr are the number of cards in the deck and the number of cutting\noperations, respectively.\n\nThere are r more lines in the data set, each of which\nrepresents a cutting operation. These cutting operations\nare performed in the listed order.\nEach line contains two positive integers p and c\n(p + c <= n + 1).\nStarting from the p-th card from the top of the deck, c\ncards should be pulled out and put on the top.\n\nThe end of the input is indicated by a line which contains two zeros.\n\nEach input line contains exactly two integers separated by a space\ncharacter.\nThere are no other characters in the line.\n\nOutput\n\nFor each data set in the input, your program\nshould write the number of the top card after the shuffle.\nAssume that at the beginning the cards\nare numbered from 1 to n, from the bottom to the top.\nEach number should be written in a separate line\nwithout any superfluous characters such as leading or following spaces.\n\nSample Input\n\n5 2\n3 1\n3 1\n10 3\n1 10\n10 1\n8 3\n0 0\n\nOutput for the Sample Input\n\n4\n4", "sample_input": "5 2\n3 1\n3 1\n10 3\n1 10\n10 1\n8 3\n0 0\n"}, "reference_outputs": ["4\n4\n"], "source_document_id": "p00710", "source_text": "Problem A: Hanafuda Shuffle\n\nThere are a number of ways to shuffle a deck of cards. Hanafuda\nshuffling for Japanese card game 'Hanafuda' is one such example.\nThe following is how to perform Hanafuda shuffling.\n\nThere is a deck of n cards. Starting from the p-th card\nfrom the top of the deck, c cards are pulled out\nand put on the top of the deck, as shown in Figure 1.\nThis operation, called a cutting operation, is repeated.\n\nWrite a program that simulates Hanafuda shuffling and answers which\ncard will be finally placed on the top of the deck.\n\nFigure 1: Cutting operation\n\nInput\n\nThe input consists of multiple data sets.\nEach data set starts with a line containing two positive integers n\n(1 <= n <= 50) and r (1 <= r <= 50); n and\nr are the number of cards in the deck and the number of cutting\noperations, respectively.\n\nThere are r more lines in the data set, each of which\nrepresents a cutting operation. These cutting operations\nare performed in the listed order.\nEach line contains two positive integers p and c\n(p + c <= n + 1).\nStarting from the p-th card from the top of the deck, c\ncards should be pulled out and put on the top.\n\nThe end of the input is indicated by a line which contains two zeros.\n\nEach input line contains exactly two integers separated by a space\ncharacter.\nThere are no other characters in the line.\n\nOutput\n\nFor each data set in the input, your program\nshould write the number of the top card after the shuffle.\nAssume that at the beginning the cards\nare numbered from 1 to n, from the bottom to the top.\nEach number should be written in a separate line\nwithout any superfluous characters such as leading or following spaces.\n\nSample Input\n\n5 2\n3 1\n3 1\n10 3\n1 10\n10 1\n8 3\n0 0\n\nOutput for the Sample Input\n\n4\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 945, "cpu_time_ms": 140, "memory_kb": 37204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s598869992", "group_id": "codeNet:p00710", "input_text": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tScanner in = new Scanner(System.in);\n\t\twhile(true){\n\t\t\tint n = in.nextInt(), r = in.nextInt();\n\t\t\tif(n==0 && r==0) return ;\n\t\t\tint ps[] = new int[r], cs[] = new int[r];\n\t\t\tfor(int i=r-1; i>=0; i--){\n\t\t\t\tps[i] = in.nextInt();\n\t\t\t\tcs[i] = in.nextInt();\n\t\t\t}\n\t\t\tint pos = n;\n\t\t\tfor(int i=0; i=0; i--){\n\t\t\t\tps[i] = in.nextInt();\n\t\t\t\tcs[i] = in.nextInt();\n\t\t\t}\n\t\t\tint pos = n;\n\t\t\tfor(int i=0; i p = new ArrayDeque();\n\t\t\t\t\tArrayDeque q = new ArrayDeque();\n\t\t\t\t\tint[][] c = new int[h][w];\n\t\t\t\t\tfor(int s=0;s p = new ArrayDeque();\n\t\t\t\t\tArrayDeque q = new ArrayDeque();\n\t\t\t\t\tint[][] c = new int[h][w];\n\t\t\t\t\tfor(int s=0;s score)\n\t\t\t\t\tmin = score;\n\t\t\t}\n\t\t\tSystem.out.println((sum - max - min) / (n - 2));\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1463492315, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00728.html", "problem_id": "p00728", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00728/input.txt", "sample_output_relpath": "derived/input_output/data/p00728/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00728/Java/s658674862.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s658674862", "user_id": "u877075445"}, "prompt_components": {"gold_output": "342\n7\n300\n326\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile (true) {\n\t\t\tint n = sc.nextInt();\n\t\t\tif (n == 0)\n\t\t\t\tbreak;\n\t\t\tint max = 0, min = 1000, sum = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint score = sc.nextInt();\n\t\t\t\tsum += score;\n\t\t\t\tif (max < score)\n\t\t\t\t\tmax = score;\n\t\t\t\tif (min > score)\n\t\t\t\t\tmin = score;\n\t\t\t}\n\t\t\tSystem.out.println((sum - max - min) / (n - 2));\n\t\t}\n\t}\n}", "problem_context": "Problem A: ICPC Score Totalizer Software\n\nThe International Clown and Pierrot Competition (ICPC), is one of the\nmost distinguished and also the most popular events on earth in the\nshow business.\n\nOne of the unique features of this contest is the great number of\njudges that sometimes counts up to one hundred. The number of judges\nmay differ from one contestant to another, because judges with any\nrelationship whatsoever with a specific contestant are temporarily\nexcluded for scoring his/her performance.\n\nBasically, scores given to a contestant's performance by the judges\nare averaged to decide his/her score. To avoid letting judges with\neccentric viewpoints too much influence the score, the highest and the\nlowest scores are set aside in this calculation. If the same highest\nscore is marked by two or more judges, only one of them is ignored.\nThe same is with the lowest score. The average, which may contain\nfractions, are truncated down to obtain final score as an integer.\n\nYou are asked to write a program that computes the scores of\nperformances, given the scores of all the judges, to speed up the event\nto be suited for a TV program.\n\nInput\n\nThe input consists of a number of datasets, each corresponding to a\ncontestant's performance. There are no more than 20 datasets in the input.\n\nA dataset begins with a line with an integer n, the number of\njudges participated in scoring the performance (3 ≤ n ≤\n100). Each of the n lines following it has an integral\nscore s (0 ≤ s ≤ 1000) marked by a judge. No\nother characters except for digits to express these numbers are in the\ninput. Judges' names are kept secret.\n\nThe end of the input is indicated by a line with a single zero in it.\n\nOutput\n\nFor each dataset, a line containing a single decimal integer\nindicating the score for the corresponding performance should be\noutput. No other characters should be on the output line.\n\nSample Input\n\n3\n1000\n342\n0\n5\n2\n2\n9\n11\n932\n5\n300\n1000\n0\n200\n400\n8\n353\n242\n402\n274\n283\n132\n402\n523\n0\n\nOutput for the Sample Input\n\n342\n7\n300\n326", "sample_input": "3\n1000\n342\n0\n5\n2\n2\n9\n11\n932\n5\n300\n1000\n0\n200\n400\n8\n353\n242\n402\n274\n283\n132\n402\n523\n0\n"}, "reference_outputs": ["342\n7\n300\n326\n"], "source_document_id": "p00728", "source_text": "Problem A: ICPC Score Totalizer Software\n\nThe International Clown and Pierrot Competition (ICPC), is one of the\nmost distinguished and also the most popular events on earth in the\nshow business.\n\nOne of the unique features of this contest is the great number of\njudges that sometimes counts up to one hundred. The number of judges\nmay differ from one contestant to another, because judges with any\nrelationship whatsoever with a specific contestant are temporarily\nexcluded for scoring his/her performance.\n\nBasically, scores given to a contestant's performance by the judges\nare averaged to decide his/her score. To avoid letting judges with\neccentric viewpoints too much influence the score, the highest and the\nlowest scores are set aside in this calculation. If the same highest\nscore is marked by two or more judges, only one of them is ignored.\nThe same is with the lowest score. The average, which may contain\nfractions, are truncated down to obtain final score as an integer.\n\nYou are asked to write a program that computes the scores of\nperformances, given the scores of all the judges, to speed up the event\nto be suited for a TV program.\n\nInput\n\nThe input consists of a number of datasets, each corresponding to a\ncontestant's performance. There are no more than 20 datasets in the input.\n\nA dataset begins with a line with an integer n, the number of\njudges participated in scoring the performance (3 ≤ n ≤\n100). Each of the n lines following it has an integral\nscore s (0 ≤ s ≤ 1000) marked by a judge. No\nother characters except for digits to express these numbers are in the\ninput. Judges' names are kept secret.\n\nThe end of the input is indicated by a line with a single zero in it.\n\nOutput\n\nFor each dataset, a line containing a single decimal integer\nindicating the score for the corresponding performance should be\noutput. No other characters should be on the output line.\n\nSample Input\n\n3\n1000\n342\n0\n5\n2\n2\n9\n11\n932\n5\n300\n1000\n0\n200\n400\n8\n353\n242\n402\n274\n283\n132\n402\n523\n0\n\nOutput for the Sample Input\n\n342\n7\n300\n326", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 457, "cpu_time_ms": 90, "memory_kb": 29396}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s619739140", "group_id": "codeNet:p00744", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.StringTokenizer;\n\nimport static java.lang.Integer.parseInt;\n\n/**\n * Cards\n */\npublic class Main {\n\n\tstatic final int INF = 1 << 29;\n\n\tstatic int S, T;\n\tstatic List> G;\n\tstatic boolean[] used;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line;\n\t\tString[] words;\n\n\t\twhile ((line = br.readLine()) != null && !line.isEmpty()) {\n\n\t\t\tint m, n;\n\t\t\tm = parseInt(line.substring(0, line.indexOf(' ')));\n\t\t\tn = parseInt(line.substring(line.indexOf(' ') + 1));\n\t\t\tif ((m | n) == 0) break;\n\n\t\t\tS = m + n;\n\t\t\tT = S + 1;\n\n\t\t\tint[] ms = new int[m];\n\t\t\tint[] ns = new int[n];\n\n\t\t\tfor (int i = 0; i < m; ) {\n\t\t\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\t\t\twhile (st.hasMoreTokens()) {\n\t\t\t\t\tms[i] = parseInt(st.nextToken());\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < n; ) {\n\t\t\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\t\t\twhile (st.hasMoreTokens()) {\n\t\t\t\t\tns[i] = parseInt(st.nextToken());\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//\n\t\t\tG = new ArrayList<>();\n\t\t\tused = new boolean[T + 1];\n\n\t\t\tfor (int i = 0; i <= T; i++) {\n\t\t\t\tG.add(new ArrayList<>());\n\t\t\t}\n\n\t\t\t//S -> blue\n\t\t\tfor (int i = 0; i < m; i++) {\n\t\t\t\tG.get(S).add(new Edge(i, 1, G.get(i).size()));\n\t\t\t\tG.get(i).add(new Edge(S, 0, G.get(S).size() - 1));\n\t\t\t}\n\n\t\t\t//red -> T\n\t\t\tfor (int i = m; i < m + n; i++) {\n\t\t\t\tG.get(i).add(new Edge(T, 1, G.get(T).size()));\n\t\t\t\tG.get(T).add(new Edge(i, 0, G.get(i).size() - 1));\n\t\t\t}\n\n\t\t\t//blue -> red\n\t\t\tfor (int i = 0; i < m; i++) {\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\tif (gcd(ms[i], ns[j]) > 1) {\n\t\t\t\t\t\tG.get(i).add(new Edge(m + j, 1, G.get(m + j).size()));\n\t\t\t\t\t\tG.get(m + j).add(new Edge(i, 0, G.get(i).size() - 1));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint ans = 0;\n\n\t\t\twhile (true) {\n\t\t\t\tused = new boolean[T + 1];\n\t\t\t\tint f = rec(S, T, INF);\n\t\t\t\tif (f == 0) break;\n\t\t\t\tans += f;\n\t\t\t}\n\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n\tstatic int rec(int u, int v, int f) {\n\n\t\tif (u == v) return f;\n\n\t\tused[u] = true;\n\n\t\tfor (Edge e : G.get(u)) {\n\t\t\tif (!used[e.to] && e.cap > 0) {\n\t\t\t\tint d = rec(e.to, v, Math.min(f, e.cap));\n\t\t\t\tif (d > 0) {\n\t\t\t\t\te.cap -= d;\n\t\t\t\t\tG.get(e.to).get(e.rev).cap += d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t}\n\n\tstatic int gcd(int a, int b) {\n\t\tif (b == 0) return a;\n\t\treturn gcd(b, a % b);\n\t}\n}\n\nclass Edge {\n\tint to, cap, rev;\n\n\tpublic Edge(int to, int cap, int rev) {\n\t\tthis.to = to;\n\t\tthis.cap = cap;\n\t\tthis.rev = rev;\n\t}\n}", "language": "Java", "metadata": {"date": 1497106288, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00744.html", "problem_id": "p00744", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00744/input.txt", "sample_output_relpath": "derived/input_output/data/p00744/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00744/Java/s619739140.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s619739140", "user_id": "u759934006"}, "prompt_components": {"gold_output": "3\n1\n0\n4\n9\n18\n85\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.StringTokenizer;\n\nimport static java.lang.Integer.parseInt;\n\n/**\n * Cards\n */\npublic class Main {\n\n\tstatic final int INF = 1 << 29;\n\n\tstatic int S, T;\n\tstatic List> G;\n\tstatic boolean[] used;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line;\n\t\tString[] words;\n\n\t\twhile ((line = br.readLine()) != null && !line.isEmpty()) {\n\n\t\t\tint m, n;\n\t\t\tm = parseInt(line.substring(0, line.indexOf(' ')));\n\t\t\tn = parseInt(line.substring(line.indexOf(' ') + 1));\n\t\t\tif ((m | n) == 0) break;\n\n\t\t\tS = m + n;\n\t\t\tT = S + 1;\n\n\t\t\tint[] ms = new int[m];\n\t\t\tint[] ns = new int[n];\n\n\t\t\tfor (int i = 0; i < m; ) {\n\t\t\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\t\t\twhile (st.hasMoreTokens()) {\n\t\t\t\t\tms[i] = parseInt(st.nextToken());\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < n; ) {\n\t\t\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\t\t\twhile (st.hasMoreTokens()) {\n\t\t\t\t\tns[i] = parseInt(st.nextToken());\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//\n\t\t\tG = new ArrayList<>();\n\t\t\tused = new boolean[T + 1];\n\n\t\t\tfor (int i = 0; i <= T; i++) {\n\t\t\t\tG.add(new ArrayList<>());\n\t\t\t}\n\n\t\t\t//S -> blue\n\t\t\tfor (int i = 0; i < m; i++) {\n\t\t\t\tG.get(S).add(new Edge(i, 1, G.get(i).size()));\n\t\t\t\tG.get(i).add(new Edge(S, 0, G.get(S).size() - 1));\n\t\t\t}\n\n\t\t\t//red -> T\n\t\t\tfor (int i = m; i < m + n; i++) {\n\t\t\t\tG.get(i).add(new Edge(T, 1, G.get(T).size()));\n\t\t\t\tG.get(T).add(new Edge(i, 0, G.get(i).size() - 1));\n\t\t\t}\n\n\t\t\t//blue -> red\n\t\t\tfor (int i = 0; i < m; i++) {\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\tif (gcd(ms[i], ns[j]) > 1) {\n\t\t\t\t\t\tG.get(i).add(new Edge(m + j, 1, G.get(m + j).size()));\n\t\t\t\t\t\tG.get(m + j).add(new Edge(i, 0, G.get(i).size() - 1));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint ans = 0;\n\n\t\t\twhile (true) {\n\t\t\t\tused = new boolean[T + 1];\n\t\t\t\tint f = rec(S, T, INF);\n\t\t\t\tif (f == 0) break;\n\t\t\t\tans += f;\n\t\t\t}\n\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n\tstatic int rec(int u, int v, int f) {\n\n\t\tif (u == v) return f;\n\n\t\tused[u] = true;\n\n\t\tfor (Edge e : G.get(u)) {\n\t\t\tif (!used[e.to] && e.cap > 0) {\n\t\t\t\tint d = rec(e.to, v, Math.min(f, e.cap));\n\t\t\t\tif (d > 0) {\n\t\t\t\t\te.cap -= d;\n\t\t\t\t\tG.get(e.to).get(e.rev).cap += d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t}\n\n\tstatic int gcd(int a, int b) {\n\t\tif (b == 0) return a;\n\t\treturn gcd(b, a % b);\n\t}\n}\n\nclass Edge {\n\tint to, cap, rev;\n\n\tpublic Edge(int to, int cap, int rev) {\n\t\tthis.to = to;\n\t\tthis.cap = cap;\n\t\tthis.rev = rev;\n\t}\n}", "problem_context": "Problem E: Cards\n\nThere are many blue cards and red cards on the table.\nFor each card, an integer number greater than 1 is printed on its face.\nThe same number may be printed on several cards.\n\nA blue card and a red card can be paired when both of the numbers\nprinted on them have a common divisor greater than 1.\nThere may be more than one red card that can be paired with one blue card.\nAlso, there may be more than one blue card that can be paired with one red card.\nWhen a blue card and a red card are chosen and paired,\nthese two cards are removed from the whole cards on the table.\n\nFigure E-1: Four blue cards and three red cards\n\nFor example, in Figure E-1,\nthere are four blue cards and three red cards.\nNumbers 2, 6, 6 and 15 are printed on the faces of the four blue cards,\nand 2, 3 and 35 are printed on those of the three red cards.\nHere, you can make pairs of blue cards and red cards as follows.\nFirst,\nthe blue card with number 2 on it and the red card with 2 are paired and removed.\nSecond,\none of the two blue cards with 6 and the red card with 3 are paired and removed.\nFinally,\nthe blue card with 15 and the red card with 35 are paired and removed.\nThus the number of removed pairs is three.\n\nNote that the total number of the pairs depends on\nthe way of choosing cards to be paired.\nThe blue card with 15 and the red card with 3 might be paired\nand removed at the beginning.\nIn this case, there are only one more pair that can be removed\nand the total number of the removed pairs is two.\n\nYour job is to find the largest number of pairs that can be removed from the given set of cards on the table.\n\nInput\n\nThe input is a sequence of datasets.\nThe number of the datasets is less than or equal to 100.\nEach dataset is formatted as follows.\n\nm n\n\nb1 ... bk\n... bm\n\nr1 ... rk\n... rn\n\nThe integers m and n are the number of blue cards\nand that of red cards, respectively.\nYou may assume 1 ≤ m ≤ 500 and 1≤ n ≤ 500.\n\nbk (1 ≤ k ≤ m) and\nrk (1 ≤ k ≤ n) are\nnumbers printed on the blue cards and the red cards respectively,\nthat are integers greater than or equal to 2 and less than\n10000000 (=107).\nThe input integers are separated by a space or a newline.\nEach of bm and rn is\nfollowed by a newline.\nThere are no other characters in the dataset.\n\nThe end of the input is indicated by a line containing two zeros\nseparated by a space.\n\nOutput\n\nFor each dataset, output a line containing an integer that indicates\nthe maximum of the number of the pairs.\n\nSample Input\n\n4 3\n2 6 6 15\n2 3 5\n2 3\n4 9\n8 16 32\n4 2\n4 9 11 13\n5 7\n5 5\n2 3 5 1001 1001\n7 11 13 30 30\n10 10\n2 3 5 7 9 11 13 15 17 29\n4 6 10 14 18 22 26 30 34 38\n20 20\n195 144 903 63 137 513 44 626 75 473\n876 421 568 519 755 840 374 368 570 872\n363 650 155 265 64 26 426 391 15 421\n373 984 564 54 823 477 565 866 879 638\n100 100\n195 144 903 63 137 513 44 626 75 473\n876 421 568 519 755 840 374 368 570 872\n363 650 155 265 64 26 426 391 15 421\n373 984 564 54 823 477 565 866 879 638\n117 755 835 683 52 369 302 424 513 870\n75 874 299 228 140 361 30 342 750 819\n761 123 804 325 952 405 578 517 49 457\n932 941 988 767 624 41 912 702 241 426\n351 92 300 648 318 216 785 347 556 535\n166 318 434 746 419 386 928 996 680 975\n231 390 916 220 933 319 37 846 797 54\n272 924 145 348 350 239 563 135 362 119\n446 305 213 879 51 631 43 755 405 499\n509 412 887 203 408 821 298 443 445 96\n274 715 796 417 839 147 654 402 280 17\n298 725 98 287 382 923 694 201 679 99\n699 188 288 364 389 694 185 464 138 406\n558 188 897 354 603 737 277 35 139 556\n826 213 59 922 499 217 846 193 416 525\n69 115 489 355 256 654 49 439 118 961\n0 0\n\nOutput for the Sample Input\n\n3\n1\n0\n4\n9\n18\n85", "sample_input": "4 3\n2 6 6 15\n2 3 5\n2 3\n4 9\n8 16 32\n4 2\n4 9 11 13\n5 7\n5 5\n2 3 5 1001 1001\n7 11 13 30 30\n10 10\n2 3 5 7 9 11 13 15 17 29\n4 6 10 14 18 22 26 30 34 38\n20 20\n195 144 903 63 137 513 44 626 75 473\n876 421 568 519 755 840 374 368 570 872\n363 650 155 265 64 26 426 391 15 421\n373 984 564 54 823 477 565 866 879 638\n100 100\n195 144 903 63 137 513 44 626 75 473\n876 421 568 519 755 840 374 368 570 872\n363 650 155 265 64 26 426 391 15 421\n373 984 564 54 823 477 565 866 879 638\n117 755 835 683 52 369 302 424 513 870\n75 874 299 228 140 361 30 342 750 819\n761 123 804 325 952 405 578 517 49 457\n932 941 988 767 624 41 912 702 241 426\n351 92 300 648 318 216 785 347 556 535\n166 318 434 746 419 386 928 996 680 975\n231 390 916 220 933 319 37 846 797 54\n272 924 145 348 350 239 563 135 362 119\n446 305 213 879 51 631 43 755 405 499\n509 412 887 203 408 821 298 443 445 96\n274 715 796 417 839 147 654 402 280 17\n298 725 98 287 382 923 694 201 679 99\n699 188 288 364 389 694 185 464 138 406\n558 188 897 354 603 737 277 35 139 556\n826 213 59 922 499 217 846 193 416 525\n69 115 489 355 256 654 49 439 118 961\n0 0\n"}, "reference_outputs": ["3\n1\n0\n4\n9\n18\n85\n"], "source_document_id": "p00744", "source_text": "Problem E: Cards\n\nThere are many blue cards and red cards on the table.\nFor each card, an integer number greater than 1 is printed on its face.\nThe same number may be printed on several cards.\n\nA blue card and a red card can be paired when both of the numbers\nprinted on them have a common divisor greater than 1.\nThere may be more than one red card that can be paired with one blue card.\nAlso, there may be more than one blue card that can be paired with one red card.\nWhen a blue card and a red card are chosen and paired,\nthese two cards are removed from the whole cards on the table.\n\nFigure E-1: Four blue cards and three red cards\n\nFor example, in Figure E-1,\nthere are four blue cards and three red cards.\nNumbers 2, 6, 6 and 15 are printed on the faces of the four blue cards,\nand 2, 3 and 35 are printed on those of the three red cards.\nHere, you can make pairs of blue cards and red cards as follows.\nFirst,\nthe blue card with number 2 on it and the red card with 2 are paired and removed.\nSecond,\none of the two blue cards with 6 and the red card with 3 are paired and removed.\nFinally,\nthe blue card with 15 and the red card with 35 are paired and removed.\nThus the number of removed pairs is three.\n\nNote that the total number of the pairs depends on\nthe way of choosing cards to be paired.\nThe blue card with 15 and the red card with 3 might be paired\nand removed at the beginning.\nIn this case, there are only one more pair that can be removed\nand the total number of the removed pairs is two.\n\nYour job is to find the largest number of pairs that can be removed from the given set of cards on the table.\n\nInput\n\nThe input is a sequence of datasets.\nThe number of the datasets is less than or equal to 100.\nEach dataset is formatted as follows.\n\nm n\n\nb1 ... bk\n... bm\n\nr1 ... rk\n... rn\n\nThe integers m and n are the number of blue cards\nand that of red cards, respectively.\nYou may assume 1 ≤ m ≤ 500 and 1≤ n ≤ 500.\n\nbk (1 ≤ k ≤ m) and\nrk (1 ≤ k ≤ n) are\nnumbers printed on the blue cards and the red cards respectively,\nthat are integers greater than or equal to 2 and less than\n10000000 (=107).\nThe input integers are separated by a space or a newline.\nEach of bm and rn is\nfollowed by a newline.\nThere are no other characters in the dataset.\n\nThe end of the input is indicated by a line containing two zeros\nseparated by a space.\n\nOutput\n\nFor each dataset, output a line containing an integer that indicates\nthe maximum of the number of the pairs.\n\nSample Input\n\n4 3\n2 6 6 15\n2 3 5\n2 3\n4 9\n8 16 32\n4 2\n4 9 11 13\n5 7\n5 5\n2 3 5 1001 1001\n7 11 13 30 30\n10 10\n2 3 5 7 9 11 13 15 17 29\n4 6 10 14 18 22 26 30 34 38\n20 20\n195 144 903 63 137 513 44 626 75 473\n876 421 568 519 755 840 374 368 570 872\n363 650 155 265 64 26 426 391 15 421\n373 984 564 54 823 477 565 866 879 638\n100 100\n195 144 903 63 137 513 44 626 75 473\n876 421 568 519 755 840 374 368 570 872\n363 650 155 265 64 26 426 391 15 421\n373 984 564 54 823 477 565 866 879 638\n117 755 835 683 52 369 302 424 513 870\n75 874 299 228 140 361 30 342 750 819\n761 123 804 325 952 405 578 517 49 457\n932 941 988 767 624 41 912 702 241 426\n351 92 300 648 318 216 785 347 556 535\n166 318 434 746 419 386 928 996 680 975\n231 390 916 220 933 319 37 846 797 54\n272 924 145 348 350 239 563 135 362 119\n446 305 213 879 51 631 43 755 405 499\n509 412 887 203 408 821 298 443 445 96\n274 715 796 417 839 147 654 402 280 17\n298 725 98 287 382 923 694 201 679 99\n699 188 288 364 389 694 185 464 138 406\n558 188 897 354 603 737 277 35 139 556\n826 213 59 922 499 217 846 193 416 525\n69 115 489 355 256 654 49 439 118 961\n0 0\n\nOutput for the Sample Input\n\n3\n1\n0\n4\n9\n18\n85", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2620, "cpu_time_ms": 3820, "memory_kb": 90856}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s018061848", "group_id": "codeNet:p00762", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic final int OP = 105;\n\tstatic int[][][] field;\n\tstatic int[][] right_ref ={{},\n\t\t{0,0,3,5,2,4,0},\n\t\t{0,4,0,1,6,0,3},\n\t\t{0,2,6,0,0,1,5},\n\t\t{0,5,1,0,0,6,2},\n\t\t{0,3,0,6,1,0,4},\n\t\t{0,0,4,2,5,3,0}};\n\n\tstatic int Setting(int x, int y){\n\t\tfor(int i=0;;i++){\n\t\t\tif(field[i][x][y]==0){\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic void Taosu(int floor, int top, int front, int right){\n\t\tint x=OP, y=OP;\n\t\twhile(true){\n\t\t\tint un_floor = floor-1;\n\t\t\tint flag = 0;\n\t\t\tint max = 0;\n\t\t\tif(un_floor==-1){\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(field[un_floor][x-1][y]==0&&front>=4){\n\t\t\t\tflag = 1;\n\t\t\t\tmax=front;\n\t\t\t}\n\t\t\tif(field[un_floor][x+1][y]==0&&front<=3){\n\t\t\t\tif(max<7-front){\n\t\t\t\t\tflag = 2;\n\t\t\t\t\tmax=7-front;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(field[un_floor][x][y-1]==0&&right<=3){\n\t\t\t\tif(max<7-right){\n\t\t\t\t\tflag = 3;\n\t\t\t\t\tmax = 7-right;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(field[un_floor][x][y+1]==0&&right>=4){\n\t\t\t\tif(max=4){\n\t\t\t\tflag = 1;\n\t\t\t\tmax=front;\n\t\t\t}\n\t\t\tif(field[un_floor][x+1][y]==0&&front<=3){\n\t\t\t\tif(max<7-front){\n\t\t\t\t\tflag = 2;\n\t\t\t\t\tmax=7-front;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(field[un_floor][x][y-1]==0&&right<=3){\n\t\t\t\tif(max<7-right){\n\t\t\t\t\tflag = 3;\n\t\t\t\t\tmax = 7-right;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(field[un_floor][x][y+1]==0&&right>=4){\n\t\t\t\tif(maxp[i+1].z){\n\t\t\t\t r=p[i];\n\t\t\t\t p[i]=p[i+1];\n\t\t\t\t p[i+1]=r;\n\t\t\t\t a=1;\n\t\t\t }\n\t\t\t if(p[q].z==p[i+1].z&&p[i].x>p[i+1].x){\n\t\t\t\t r=p[i];\n\t\t\t\t p[i]=p[i+1];\n\t\t\t\t p[i+1]=r;\n\t\t\t\t a=1;\n\t\t\t }\n\t\t\t\t \n\t\t }\n\t }\n\n\t\twhile(gp[i+1].z){\n\t\t\t\t r=p[i];\n\t\t\t\t p[i]=p[i+1];\n\t\t\t\t p[i+1]=r;\n\t\t\t\t a=1;\n\t\t\t }\n\t\t\t if(p[q].z==p[i+1].z&&p[i].x>p[i+1].x){\n\t\t\t\t r=p[i];\n\t\t\t\t p[i]=p[i+1];\n\t\t\t\t p[i+1]=r;\n\t\t\t\t a=1;\n\t\t\t }\n\t\t\t\t \n\t\t }\n\t }\n\n\t\twhile(g h.\n\nWe define the following ordering of wide integral rectangles. Given\ntwo wide integral rectangles,\n\nThe one shorter in its diagonal line is smaller, and\n\nIf the two have diagonal lines with the same length, the one shorter\nin its height is smaller.\n\nGiven a wide integral rectangle, find the smallest wide integral\nrectangle bigger than the given one.\n\nInput\n\nThe entire input consists of multiple datasets. The number of\ndatasets is no more than 100. Each dataset describes a wide integral\nrectangle by specifying its height and width, namely h\nand w, separated by a space in a line, as follows.\n\nh w\n\nFor each dataset, h and w (>h) are both\nintegers greater than 0 and no more than 100.\n\nThe end of the input is indicated by a line of two zeros separated by a space.\n\nOutput\n\nFor each dataset, print in a line two numbers describing the\nheight and width, namely h and w (> h), of the\nsmallest wide integral rectangle bigger than the one described in the\ndataset. Put a space between the numbers. No other\ncharacters are allowed in the output.\n\nFor any wide integral rectangle given in the input, the width and\nheight of the smallest wide integral rectangle bigger than the given\none are both known to be not greater than 150.\n\nIn addition, although\nthe ordering of wide integral rectangles uses the comparison of\nlengths of diagonal lines, this comparison can be replaced with that\nof squares (self-products) of lengths of diagonal lines, which can\navoid unnecessary troubles possibly caused by the use of floating-point\nnumbers.\n\nSample Input\n\n1 2\n1 3\n2 3\n1 4\n2 4\n5 6\n1 8\n4 7\n98 100\n99 100\n0 0\n\nOutput for the Sample Input\n\n1 3\n2 3\n1 4\n2 4\n3 4\n1 8\n4 7\n2 8\n3 140\n89 109", "sample_input": "1 2\n1 3\n2 3\n1 4\n2 4\n5 6\n1 8\n4 7\n98 100\n99 100\n0 0\n"}, "reference_outputs": ["1 3\n2 3\n1 4\n2 4\n3 4\n1 8\n4 7\n2 8\n3 140\n89 109\n"], "source_document_id": "p00767", "source_text": "Integral Rectangles\n\nLet us consider rectangles whose height, h, and\nwidth, w, are both integers. We call such rectangles\nintegral rectangles. In this problem, we consider only wide\nintegral rectangles, i.e., those with w > h.\n\nWe define the following ordering of wide integral rectangles. Given\ntwo wide integral rectangles,\n\nThe one shorter in its diagonal line is smaller, and\n\nIf the two have diagonal lines with the same length, the one shorter\nin its height is smaller.\n\nGiven a wide integral rectangle, find the smallest wide integral\nrectangle bigger than the given one.\n\nInput\n\nThe entire input consists of multiple datasets. The number of\ndatasets is no more than 100. Each dataset describes a wide integral\nrectangle by specifying its height and width, namely h\nand w, separated by a space in a line, as follows.\n\nh w\n\nFor each dataset, h and w (>h) are both\nintegers greater than 0 and no more than 100.\n\nThe end of the input is indicated by a line of two zeros separated by a space.\n\nOutput\n\nFor each dataset, print in a line two numbers describing the\nheight and width, namely h and w (> h), of the\nsmallest wide integral rectangle bigger than the one described in the\ndataset. Put a space between the numbers. No other\ncharacters are allowed in the output.\n\nFor any wide integral rectangle given in the input, the width and\nheight of the smallest wide integral rectangle bigger than the given\none are both known to be not greater than 150.\n\nIn addition, although\nthe ordering of wide integral rectangles uses the comparison of\nlengths of diagonal lines, this comparison can be replaced with that\nof squares (self-products) of lengths of diagonal lines, which can\navoid unnecessary troubles possibly caused by the use of floating-point\nnumbers.\n\nSample Input\n\n1 2\n1 3\n2 3\n1 4\n2 4\n5 6\n1 8\n4 7\n98 100\n99 100\n0 0\n\nOutput for the Sample Input\n\n1 3\n2 3\n1 4\n2 4\n3 4\n1 8\n4 7\n2 8\n3 140\n89 109", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1385, "cpu_time_ms": 230, "memory_kb": 24192}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s860192989", "group_id": "codeNet:p00777", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\n\tstatic PrintWriter out;\n\tstatic InputReader ir;\n\tstatic boolean debug = false;\n\n\tstatic void solve() {\n\t\tfor (;;) {\n\t\t\tint n = ir.nextInt();\n\t\t\tif (n == 0)\n\t\t\t\treturn;\n\t\t\tint[] p = ir.nextIntArray(n - 1);\n\t\t\tint[] d = ir.nextIntArray(n - 1);\n\t\t\tGraph[] g = new Graph[n];\n\t\t\tlong[][] adj = new long[n][n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tArrays.fill(adj[i], Long.MAX_VALUE / 2);\n\t\t\t\tadj[i][i] = 0;\n\t\t\t}\n\t\t\tlong ret = 0;\n\t\t\tboolean[] l = new boolean[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tg[i] = new Graph();\n\t\t\tfor (int i = 1; i < n; i++) {\n\t\t\t\tg[i].add(new int[] { p[i - 1] - 1, d[i - 1] });\n\t\t\t\tg[p[i - 1] - 1].add(new int[] { i, d[i - 1] });\n\t\t\t\tret += d[i - 1];\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tif (g[i].size() == 1)\n\t\t\t\t\tl[i] = true;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (l[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = 0; j < g[i].size(); j++) {\n\t\t\t\t\tint[] to = g[i].get(j);\n\t\t\t\t\tif (l[to[0]])\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tadj[i][to[0]] = to[1];\n\t\t\t\t\tret += to[1];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\tif (l[k])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tif (l[i])\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\t\tif (l[j])\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tadj[i][j] = Math.min(adj[i][j], adj[i][k] + adj[k][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong ma = 0;\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < i; j++)\n\t\t\t\t\tif (adj[i][j] != Long.MAX_VALUE / 2)\n\t\t\t\t\t\tma = Math.max(ma, adj[i][j]);\n\t\t\tout.println(ret - ma);\n\t\t}\n\t}\n\n\tstatic class Graph extends ArrayList {\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tir = new InputReader(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\tstatic class InputReader {\n\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n\n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n\n\tstatic void tr(Object... o) {\n\t\tif (debug)\n\t\t\tout.println(Arrays.deepToString(o));\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1529950405, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00777.html", "problem_id": "p00777", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00777/input.txt", "sample_output_relpath": "derived/input_output/data/p00777/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00777/Java/s860192989.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s860192989", "user_id": "u211138527"}, "prompt_components": {"gold_output": "80\n136\n2\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\n\tstatic PrintWriter out;\n\tstatic InputReader ir;\n\tstatic boolean debug = false;\n\n\tstatic void solve() {\n\t\tfor (;;) {\n\t\t\tint n = ir.nextInt();\n\t\t\tif (n == 0)\n\t\t\t\treturn;\n\t\t\tint[] p = ir.nextIntArray(n - 1);\n\t\t\tint[] d = ir.nextIntArray(n - 1);\n\t\t\tGraph[] g = new Graph[n];\n\t\t\tlong[][] adj = new long[n][n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tArrays.fill(adj[i], Long.MAX_VALUE / 2);\n\t\t\t\tadj[i][i] = 0;\n\t\t\t}\n\t\t\tlong ret = 0;\n\t\t\tboolean[] l = new boolean[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tg[i] = new Graph();\n\t\t\tfor (int i = 1; i < n; i++) {\n\t\t\t\tg[i].add(new int[] { p[i - 1] - 1, d[i - 1] });\n\t\t\t\tg[p[i - 1] - 1].add(new int[] { i, d[i - 1] });\n\t\t\t\tret += d[i - 1];\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tif (g[i].size() == 1)\n\t\t\t\t\tl[i] = true;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (l[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int j = 0; j < g[i].size(); j++) {\n\t\t\t\t\tint[] to = g[i].get(j);\n\t\t\t\t\tif (l[to[0]])\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tadj[i][to[0]] = to[1];\n\t\t\t\t\tret += to[1];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\tif (l[k])\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\t\tif (l[i])\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\t\tif (l[j])\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tadj[i][j] = Math.min(adj[i][j], adj[i][k] + adj[k][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong ma = 0;\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < i; j++)\n\t\t\t\t\tif (adj[i][j] != Long.MAX_VALUE / 2)\n\t\t\t\t\t\tma = Math.max(ma, adj[i][j]);\n\t\t\tout.println(ret - ma);\n\t\t}\n\t}\n\n\tstatic class Graph extends ArrayList {\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tir = new InputReader(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\tstatic class InputReader {\n\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n\n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n\n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n\n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n\n\tstatic void tr(Object... o) {\n\t\tif (debug)\n\t\t\tout.println(Arrays.deepToString(o));\n\t}\n}\n\n", "problem_context": "Bridge Removal\n\nICPC islands once had been a popular tourist destination.\nFor nature preservation, however, the government decided to prohibit entrance to the islands,\nand to remove all the man-made structures there.\nThe hardest part of the project is to remove all the bridges connecting the islands.\n\nThere are n islands and n-1 bridges.\nThe bridges are built so that all the islands are reachable from all the other islands by\ncrossing one or more bridges.\nThe bridge removal team can choose any island as the starting point, and can repeat either of the\nfollowing steps.\n\nMove to another island by crossing a bridge that is connected to the current island.\n\nRemove one bridge that is connected to the current island, and stay at the same island after the removal.\n\nOf course, a bridge, once removed, cannot be crossed in either direction.\nCrossing or removing a bridge both takes time proportional to the length of the bridge.\nYour task is to compute the shortest time necessary for removing all the bridges.\nNote that the island where the team starts can differ from where the team finishes the work.\n\nInput\n\nThe input consists of at most 100 datasets.\nEach dataset is formatted as follows.\n\nn\n\np2 p3 ... pn\n\nd2 d3 ... dn\n\nThe first integer n (3 ≤ n ≤ 800) is the number of the islands.\nThe islands are numbered from 1 to n.\nThe second line contains n-1 island numbers pi\n(1 ≤ pi < i), and tells that for each i\nfrom 2 to n the island i and the island pi are connected by a bridge.\nThe third line contains n-1 integers di (1 ≤ di ≤ 100,000)\neach denoting the length of the corresponding bridge.\nThat is, the length of the bridge connecting the island i and pi\nis di. It takes di units of time to cross the bridge, and\nalso the same units of time to remove it.\n\nNote that, with this input format, it is assured that all the islands are reachable each other by\ncrossing one or more bridges.\n\nThe input ends with a line with a single zero.\n\nOutput\n\nFor each dataset, print the minimum time units required to remove all the bridges in a single line.\nEach line should not have any character other than this number.\n\nSample Input\n\n4\n1 2 3\n10 20 30\n10\n1 2 2 1 5 5 1 8 8\n10 1 1 20 1 1 30 1 1\n3\n1 1\n1 1\n0\n\nOutput for the Sample Input\n\n80\n136\n2", "sample_input": "4\n1 2 3\n10 20 30\n10\n1 2 2 1 5 5 1 8 8\n10 1 1 20 1 1 30 1 1\n3\n1 1\n1 1\n0\n"}, "reference_outputs": ["80\n136\n2\n"], "source_document_id": "p00777", "source_text": "Bridge Removal\n\nICPC islands once had been a popular tourist destination.\nFor nature preservation, however, the government decided to prohibit entrance to the islands,\nand to remove all the man-made structures there.\nThe hardest part of the project is to remove all the bridges connecting the islands.\n\nThere are n islands and n-1 bridges.\nThe bridges are built so that all the islands are reachable from all the other islands by\ncrossing one or more bridges.\nThe bridge removal team can choose any island as the starting point, and can repeat either of the\nfollowing steps.\n\nMove to another island by crossing a bridge that is connected to the current island.\n\nRemove one bridge that is connected to the current island, and stay at the same island after the removal.\n\nOf course, a bridge, once removed, cannot be crossed in either direction.\nCrossing or removing a bridge both takes time proportional to the length of the bridge.\nYour task is to compute the shortest time necessary for removing all the bridges.\nNote that the island where the team starts can differ from where the team finishes the work.\n\nInput\n\nThe input consists of at most 100 datasets.\nEach dataset is formatted as follows.\n\nn\n\np2 p3 ... pn\n\nd2 d3 ... dn\n\nThe first integer n (3 ≤ n ≤ 800) is the number of the islands.\nThe islands are numbered from 1 to n.\nThe second line contains n-1 island numbers pi\n(1 ≤ pi < i), and tells that for each i\nfrom 2 to n the island i and the island pi are connected by a bridge.\nThe third line contains n-1 integers di (1 ≤ di ≤ 100,000)\neach denoting the length of the corresponding bridge.\nThat is, the length of the bridge connecting the island i and pi\nis di. It takes di units of time to cross the bridge, and\nalso the same units of time to remove it.\n\nNote that, with this input format, it is assured that all the islands are reachable each other by\ncrossing one or more bridges.\n\nThe input ends with a line with a single zero.\n\nOutput\n\nFor each dataset, print the minimum time units required to remove all the bridges in a single line.\nEach line should not have any character other than this number.\n\nSample Input\n\n4\n1 2 3\n10 20 30\n10\n1 2 2 1 5 5 1 8 8\n10 1 1 20 1 1 30 1 1\n3\n1 1\n1 1\n0\n\nOutput for the Sample Input\n\n80\n136\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4518, "cpu_time_ms": 13680, "memory_kb": 68976}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s324789640", "group_id": "codeNet:p00780", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tprivate static final int N_MAX = 2 << 15;\n\tprivate boolean[] era;\n\tprivate void run() {\n\t\tera = new boolean [ N_MAX + 1 ];\n\t\tera[ 1 ] = true;\n\t\tfor( int i = 2; i <= N_MAX; i++ ) {\n\t\t\tif( era[ i ] ) { continue; }\n\t\t\tfor( int j = i * 2; j <= N_MAX; j = j + i ) {\n\t\t\t\tera[ j ] = true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tScanner sc = new Scanner( System.in );\n\t\twhile( sc.hasNext() ) {\n\t\t\tint counter = 0;\n\t\t\tint n = sc.nextInt();\n\t\t\tif( n == 0 ) { break; }\n\t\t\tfor( int p1 = 2; p1 <= n / 2; p1++ ) {\n\t\t\t\tif( era[ p1 ] ) { continue; }\n\t\t\t\tif( !era[ n - p1 ] ) {\n\t\t\t\t\tcounter++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println( counter );\n\t\t}\n\t\t\n\t}\n\tpublic static void main( String[] args ) {\n\t\tnew Main().run();\n\t}\n}", "language": "Java", "metadata": {"date": 1398260001, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00780.html", "problem_id": "p00780", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00780/input.txt", "sample_output_relpath": "derived/input_output/data/p00780/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00780/Java/s324789640.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s324789640", "user_id": "u777217452"}, "prompt_components": {"gold_output": "1\n2\n1\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tprivate static final int N_MAX = 2 << 15;\n\tprivate boolean[] era;\n\tprivate void run() {\n\t\tera = new boolean [ N_MAX + 1 ];\n\t\tera[ 1 ] = true;\n\t\tfor( int i = 2; i <= N_MAX; i++ ) {\n\t\t\tif( era[ i ] ) { continue; }\n\t\t\tfor( int j = i * 2; j <= N_MAX; j = j + i ) {\n\t\t\t\tera[ j ] = true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tScanner sc = new Scanner( System.in );\n\t\twhile( sc.hasNext() ) {\n\t\t\tint counter = 0;\n\t\t\tint n = sc.nextInt();\n\t\t\tif( n == 0 ) { break; }\n\t\t\tfor( int p1 = 2; p1 <= n / 2; p1++ ) {\n\t\t\t\tif( era[ p1 ] ) { continue; }\n\t\t\t\tif( !era[ n - p1 ] ) {\n\t\t\t\t\tcounter++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println( counter );\n\t\t}\n\t\t\n\t}\n\tpublic static void main( String[] args ) {\n\t\tnew Main().run();\n\t}\n}", "problem_context": "Problem A:Goldbach's Conjecture\n\nGoldbach's Conjecture: For any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such that n = p1 + p2.\n\nThis conjecture has not been proved nor refused yet. No one is sure whether this conjecture actually holds. However, one can find such a pair of prime numbers, if any, for a given even number. The problem here is to write a program that reports the number of all the pairs of prime numbers satisfying the condition in the conjecture for a given even number.\n\nA sequence of even numbers is given as input. Corresponding to each number, the program should output the number of pairs mentioned above. Notice that we are intereseted in the number of essentially different pairs and therefore you should not count (p1, p2) and (p2, p1) separately as two different pairs.\n\nInput\n\nAn integer is given in each input line. You may assume that each integer is even, and is greater than or equal to 4 and less than 215. The end of the input is indicated by a number 0.\n\nOutput\n\nEach output line should contain an integer number. No other characters should appear in the output.\n\nSample Input\n\n6\n10\n12\n0\n\nOutput for the Sample Input\n\n1\n2\n1", "sample_input": "6\n10\n12\n0\n"}, "reference_outputs": ["1\n2\n1\n"], "source_document_id": "p00780", "source_text": "Problem A:Goldbach's Conjecture\n\nGoldbach's Conjecture: For any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such that n = p1 + p2.\n\nThis conjecture has not been proved nor refused yet. No one is sure whether this conjecture actually holds. However, one can find such a pair of prime numbers, if any, for a given even number. The problem here is to write a program that reports the number of all the pairs of prime numbers satisfying the condition in the conjecture for a given even number.\n\nA sequence of even numbers is given as input. Corresponding to each number, the program should output the number of pairs mentioned above. Notice that we are intereseted in the number of essentially different pairs and therefore you should not count (p1, p2) and (p2, p1) separately as two different pairs.\n\nInput\n\nAn integer is given in each input line. You may assume that each integer is even, and is greater than or equal to 4 and less than 215. The end of the input is indicated by a number 0.\n\nOutput\n\nEach output line should contain an integer number. No other characters should appear in the output.\n\nSample Input\n\n6\n10\n12\n0\n\nOutput for the Sample Input\n\n1\n2\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 723, "cpu_time_ms": 70, "memory_kb": 19276}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s566967558", "group_id": "codeNet:p00865", "input_text": "public class Main {\n\tpublic static void main(String[] args) {\n\t\tjava.util.Scanner sc = new java.util.Scanner(System.in);\n\t\twhile (true) {\n\t\t\tint n = sc.nextInt();\n\t\t\tint m = sc.nextInt();\n\t\t\tint k = sc.nextInt();\n\t\t\tif (n == 0 && m == 0 && k == 0)\n\t\t\t\tbreak;\n\t\t\tint[] dice = new int[n];\n\t\t\tint[] result = new int[n * m + 1];\n\t\t\tjava.util.Arrays.fill(dice, 1);\n\t\t\tout: while (true) {\n\t\t\t\tint pointer = n - 1;\n\t\t\t\tresult[Math.max(1, sum(dice) - k)]++;\n\t\t\t\tif (dice[pointer] < m) {\n\t\t\t\t\tdice[pointer]++;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\twhile (dice[pointer] == m) {\n\t\t\t\t\tpointer--;\n\t\t\t\t\tif (pointer < 0)\n\t\t\t\t\t\tbreak out;\n\t\t\t\t}\n\t\t\t\tdice[pointer]++;\n\t\t\t\twhile (pointer != n - 1) {\n\t\t\t\t\tpointer++;\n\t\t\t\t\tdice[pointer] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdouble p = 0;\n\t\t\tfor (int i = 0; i < result.length; i++) {\n\t\t\t\tp += (double) i * result[i] / Math.pow(m, n);\n\t\t\t}\n\t\t\tSystem.out.println(p);\n\t\t}\n\t\tsc.close();\n\t}\n\n\tstatic int sum(int[] dice) {\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < dice.length; i++)\n\t\t\tsum += dice[i];\n\t\treturn sum;\n\t}\n}", "language": "Java", "metadata": {"date": 1383580678, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00865.html", "problem_id": "p00865", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00865/input.txt", "sample_output_relpath": "derived/input_output/data/p00865/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00865/Java/s566967558.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s566967558", "user_id": "u104102582"}, "prompt_components": {"gold_output": "7.00000000\n4.11111111\n7.71000000\n1.42902599\n1001.50298805\n", "input_to_evaluate": "public class Main {\n\tpublic static void main(String[] args) {\n\t\tjava.util.Scanner sc = new java.util.Scanner(System.in);\n\t\twhile (true) {\n\t\t\tint n = sc.nextInt();\n\t\t\tint m = sc.nextInt();\n\t\t\tint k = sc.nextInt();\n\t\t\tif (n == 0 && m == 0 && k == 0)\n\t\t\t\tbreak;\n\t\t\tint[] dice = new int[n];\n\t\t\tint[] result = new int[n * m + 1];\n\t\t\tjava.util.Arrays.fill(dice, 1);\n\t\t\tout: while (true) {\n\t\t\t\tint pointer = n - 1;\n\t\t\t\tresult[Math.max(1, sum(dice) - k)]++;\n\t\t\t\tif (dice[pointer] < m) {\n\t\t\t\t\tdice[pointer]++;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\twhile (dice[pointer] == m) {\n\t\t\t\t\tpointer--;\n\t\t\t\t\tif (pointer < 0)\n\t\t\t\t\t\tbreak out;\n\t\t\t\t}\n\t\t\t\tdice[pointer]++;\n\t\t\t\twhile (pointer != n - 1) {\n\t\t\t\t\tpointer++;\n\t\t\t\t\tdice[pointer] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdouble p = 0;\n\t\t\tfor (int i = 0; i < result.length; i++) {\n\t\t\t\tp += (double) i * result[i] / Math.pow(m, n);\n\t\t\t}\n\t\t\tSystem.out.println(p);\n\t\t}\n\t\tsc.close();\n\t}\n\n\tstatic int sum(int[] dice) {\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < dice.length; i++)\n\t\t\tsum += dice[i];\n\t\treturn sum;\n\t}\n}", "problem_context": "Problem B: Expected Allowance\n\nHideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money.\nIn the first day of every month, the number of bills is decided as follows. Ujisato prepares n\npieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of\nbills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to\nHideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not\nexceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the\nprobability of each side is the same.\n\nIn this problem, you are asked to write a program that finds the expected value of the number\nof given bills.\n\nFor example, when n = 2, m = 6 and k = 3, the probabilities of the number of bills being 1, 2, 3, 4, 5, 6, 7, 8 and 9 are 1/36 + 2/36 + 3/36, 4/36, 5/36, 6/36, 5/36, 4/36, 3/36, 2/36 and 1/36, respectively.\n\nTherefore, the expected value is\n\n(1/36 + 2/36 + 3/36) × 1 + 4/36 × 2 + 5/36 × 3 + 6/36 × 4 + 5/36 × 5 + 4/36 × 6 + 3/36 × 7 + 2/36 × 8 + 1/36 × 9, which is approximately 4.11111111.\n\nInput\n\nThe input is a sequence of lines each of which contains three integers n, m and k in this order.\nThey satisfy the following conditions.\n\n1 ≤ n\n\n2 ≤ m\n\n0 ≤ k < nm\n\nnm × mn < 100000000 (108)\n\nThe end of the input is indicated by a line containing three zeros.\n\nOutput\n\nThe output should be comprised of lines each of which contains a single decimal fraction. It is\nthe expected number of bills and may have an error less than 10-7 . No other characters should\noccur in the output.\n\nSample Input\n\n2 6 0\n2 6 3\n3 10 9\n13 3 27\n1 2008 3\n0 0 0\n\nOutput for the Sample Input\n\n7.00000000\n4.11111111\n7.71000000\n1.42902599\n1001.50298805", "sample_input": "2 6 0\n2 6 3\n3 10 9\n13 3 27\n1 2008 3\n0 0 0\n"}, "reference_outputs": ["7.00000000\n4.11111111\n7.71000000\n1.42902599\n1001.50298805\n"], "source_document_id": "p00865", "source_text": "Problem B: Expected Allowance\n\nHideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money.\nIn the first day of every month, the number of bills is decided as follows. Ujisato prepares n\npieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of\nbills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to\nHideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not\nexceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the\nprobability of each side is the same.\n\nIn this problem, you are asked to write a program that finds the expected value of the number\nof given bills.\n\nFor example, when n = 2, m = 6 and k = 3, the probabilities of the number of bills being 1, 2, 3, 4, 5, 6, 7, 8 and 9 are 1/36 + 2/36 + 3/36, 4/36, 5/36, 6/36, 5/36, 4/36, 3/36, 2/36 and 1/36, respectively.\n\nTherefore, the expected value is\n\n(1/36 + 2/36 + 3/36) × 1 + 4/36 × 2 + 5/36 × 3 + 6/36 × 4 + 5/36 × 5 + 4/36 × 6 + 3/36 × 7 + 2/36 × 8 + 1/36 × 9, which is approximately 4.11111111.\n\nInput\n\nThe input is a sequence of lines each of which contains three integers n, m and k in this order.\nThey satisfy the following conditions.\n\n1 ≤ n\n\n2 ≤ m\n\n0 ≤ k < nm\n\nnm × mn < 100000000 (108)\n\nThe end of the input is indicated by a line containing three zeros.\n\nOutput\n\nThe output should be comprised of lines each of which contains a single decimal fraction. It is\nthe expected number of bills and may have an error less than 10-7 . No other characters should\noccur in the output.\n\nSample Input\n\n2 6 0\n2 6 3\n3 10 9\n13 3 27\n1 2008 3\n0 0 0\n\nOutput for the Sample Input\n\n7.00000000\n4.11111111\n7.71000000\n1.42902599\n1001.50298805", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1006, "cpu_time_ms": 270, "memory_kb": 21408}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s126343593", "group_id": "codeNet:p00877", "input_text": "import java.awt.*;\nimport java.util.*;\nimport java.awt.geom.*;\n\npublic class Main {\n public static void main(String args[])throws Exception{\n Scanner cin= new Scanner(System.in);\n\t\tint n,m;\n\t\tPoint2D.Double[] w = new Point2D.Double[200];\n\t\tPoint2D.Double[] b = new Point2D.Double[200];\n\t\tfor(;;){\n\t\t\tn=cin.nextInt();\n\t\t\tm=cin.nextInt();\n\t\t\t//\t\t\tSystem.out.printf(\"%d %d\\n\",n,m);\n\t\t\t\n\t\t\tif(n==0 && m==0) break;\n\t\t\t\n\t\t\t\n\t\t\tfor(int i=0;i=0 && t2>=0 && Math.abs(t1)==n-1 && Math.abs(t2)==m-1){\n\t\t\t\t\t\tf=1;\n\t\t\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\t\t\tbreak out;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f==0) System.out.println(\"NO\");\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1260181940, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00877.html", "problem_id": "p00877", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00877/input.txt", "sample_output_relpath": "derived/input_output/data/p00877/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00877/Java/s126343593.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s126343593", "user_id": "u261898944"}, "prompt_components": {"gold_output": "YES\nNO\nNO\nNO\nYES\nYES\nNO\nNO\nNO\nYES\n", "input_to_evaluate": "import java.awt.*;\nimport java.util.*;\nimport java.awt.geom.*;\n\npublic class Main {\n public static void main(String args[])throws Exception{\n Scanner cin= new Scanner(System.in);\n\t\tint n,m;\n\t\tPoint2D.Double[] w = new Point2D.Double[200];\n\t\tPoint2D.Double[] b = new Point2D.Double[200];\n\t\tfor(;;){\n\t\t\tn=cin.nextInt();\n\t\t\tm=cin.nextInt();\n\t\t\t//\t\t\tSystem.out.printf(\"%d %d\\n\",n,m);\n\t\t\t\n\t\t\tif(n==0 && m==0) break;\n\t\t\t\n\t\t\t\n\t\t\tfor(int i=0;i=0 && t2>=0 && Math.abs(t1)==n-1 && Math.abs(t2)==m-1){\n\t\t\t\t\t\tf=1;\n\t\t\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\t\t\tbreak out;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f==0) System.out.println(\"NO\");\n\t\t}\n\t}\n}", "problem_context": "Problem D: Separate Points\n\nNumbers of black and white points are placed on a plane. Let's imagine that a straight line\nof infinite length is drawn on the plane. When the line does not meet any of the points, the\nline divides these points into two groups. If the division by such a line results in one group\nconsisting only of black points and the other consisting only of white points, we say that the\nline \"separates black and white points\".\n\nLet's see examples in Figure 3. In the leftmost example, you can easily find that the black and\nwhite points can be perfectly separated by the dashed line according to their colors. In the\nremaining three examples, there exists no such straight line that gives such a separation.\n\nFigure 3: Example planes\n\nIn this problem, given a set of points with their colors and positions, you are requested to decide\nwhether there exists a straight line that separates black and white points.\n\nInput\n\nThe input is a sequence of datasets, each of which is formatted as follows.\n\nn m\n\nx1 y1\n\n.\n\n.\n\n.\n\nxn yn\n\nxn+1 yn+1\n\n.\n\n.\n\n.\n\nxn+m yn+m\n\nThe first line contains two positive integers separated by a single space; n is the number of black\npoints, and m is the number of white points. They are less than or equal to 100. Then n + m\nlines representing the coordinates of points follow. Each line contains two integers xi and yi\nseparated by a space, where (xi , yi ) represents the x-coordinate and the y-coordinate of the i-th\npoint. The color of the i-th point is black for 1 ≤ i ≤ n, and is white for n + 1 ≤ i ≤ n + m.\n\nAll the points have integral x- and y-coordinate values between 0 and 10000 inclusive. You can\nalso assume that no two points have the same position.\n\nThe end of the input is indicated by a line containing two zeros separated by a space.\n\nOutput\n\nFor each dataset, output \"YES\" if there exists a line satisfying the condition. If not, output\n\"NO\". In either case, print it in one line for each input dataset.\n\nSample Input\n\n3 3\n100 700\n200 200\n600 600\n500 100\n500 300\n800 500\n3 3\n100 300\n400 600\n400 100\n600 400\n500 900\n300 300\n3 4\n300 300\n500 300\n400 600\n100 100\n200 900\n500 900\n800 100\n1 2\n300 300\n100 100\n500 500\n1 1\n100 100\n200 100\n2 2\n0 0\n500 700\n1000 1400\n1500 2100\n2 2\n0 0\n1000 1000\n1000 0\n0 1000\n3 3\n0 100\n4999 102\n10000 103\n5001 102\n10000 102\n0 101\n3 3\n100 100\n200 100\n100 200\n0 0\n400 0\n0 400\n3 3\n2813 1640\n2583 2892\n2967 1916\n541 3562\n9298 3686\n7443 7921\n0 0\n\nOutput for the Sample Input\n\nYES\nNO\nNO\nNO\nYES\nYES\nNO\nNO\nNO\nYES", "sample_input": "3 3\n100 700\n200 200\n600 600\n500 100\n500 300\n800 500\n3 3\n100 300\n400 600\n400 100\n600 400\n500 900\n300 300\n3 4\n300 300\n500 300\n400 600\n100 100\n200 900\n500 900\n800 100\n1 2\n300 300\n100 100\n500 500\n1 1\n100 100\n200 100\n2 2\n0 0\n500 700\n1000 1400\n1500 2100\n2 2\n0 0\n1000 1000\n1000 0\n0 1000\n3 3\n0 100\n4999 102\n10000 103\n5001 102\n10000 102\n0 101\n3 3\n100 100\n200 100\n100 200\n0 0\n400 0\n0 400\n3 3\n2813 1640\n2583 2892\n2967 1916\n541 3562\n9298 3686\n7443 7921\n0 0\n"}, "reference_outputs": ["YES\nNO\nNO\nNO\nYES\nYES\nNO\nNO\nNO\nYES\n"], "source_document_id": "p00877", "source_text": "Problem D: Separate Points\n\nNumbers of black and white points are placed on a plane. Let's imagine that a straight line\nof infinite length is drawn on the plane. When the line does not meet any of the points, the\nline divides these points into two groups. If the division by such a line results in one group\nconsisting only of black points and the other consisting only of white points, we say that the\nline \"separates black and white points\".\n\nLet's see examples in Figure 3. In the leftmost example, you can easily find that the black and\nwhite points can be perfectly separated by the dashed line according to their colors. In the\nremaining three examples, there exists no such straight line that gives such a separation.\n\nFigure 3: Example planes\n\nIn this problem, given a set of points with their colors and positions, you are requested to decide\nwhether there exists a straight line that separates black and white points.\n\nInput\n\nThe input is a sequence of datasets, each of which is formatted as follows.\n\nn m\n\nx1 y1\n\n.\n\n.\n\n.\n\nxn yn\n\nxn+1 yn+1\n\n.\n\n.\n\n.\n\nxn+m yn+m\n\nThe first line contains two positive integers separated by a single space; n is the number of black\npoints, and m is the number of white points. They are less than or equal to 100. Then n + m\nlines representing the coordinates of points follow. Each line contains two integers xi and yi\nseparated by a space, where (xi , yi ) represents the x-coordinate and the y-coordinate of the i-th\npoint. The color of the i-th point is black for 1 ≤ i ≤ n, and is white for n + 1 ≤ i ≤ n + m.\n\nAll the points have integral x- and y-coordinate values between 0 and 10000 inclusive. You can\nalso assume that no two points have the same position.\n\nThe end of the input is indicated by a line containing two zeros separated by a space.\n\nOutput\n\nFor each dataset, output \"YES\" if there exists a line satisfying the condition. If not, output\n\"NO\". In either case, print it in one line for each input dataset.\n\nSample Input\n\n3 3\n100 700\n200 200\n600 600\n500 100\n500 300\n800 500\n3 3\n100 300\n400 600\n400 100\n600 400\n500 900\n300 300\n3 4\n300 300\n500 300\n400 600\n100 100\n200 900\n500 900\n800 100\n1 2\n300 300\n100 100\n500 500\n1 1\n100 100\n200 100\n2 2\n0 0\n500 700\n1000 1400\n1500 2100\n2 2\n0 0\n1000 1000\n1000 0\n0 1000\n3 3\n0 100\n4999 102\n10000 103\n5001 102\n10000 102\n0 101\n3 3\n100 100\n200 100\n100 200\n0 0\n400 0\n0 400\n3 3\n2813 1640\n2583 2892\n2967 1916\n541 3562\n9298 3686\n7443 7921\n0 0\n\nOutput for the Sample Input\n\nYES\nNO\nNO\nNO\nYES\nYES\nNO\nNO\nNO\nYES", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1683, "cpu_time_ms": 3970, "memory_kb": 13000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s068689285", "group_id": "codeNet:p00884", "input_text": "import java.util.*;\nimport static java.lang.System.*;\n\npublic class Main {\n\n\tScanner sc = new Scanner(in);\n\t\n\tMap> map = new HashMap>();\n\tList remove = new ArrayList();\n\tList add = new ArrayList();\n\tSet checked = new HashSet();\n\t\n\tvoid calc(String s) {\n\t\tchecked.add(s);\n\t\tSet set = map.get(s);\n\t\tadd.clear();\n\t\tremove.clear();\n\t\tfor (String t : set) {\n\t\t\tif (map.containsKey(t)) {\n\t\t\t\tif (!checked.contains(t))\n\t\t\t\t\tcalc(t);\n\t\t\t\tremove.add(t);\n\t\t\t\tfor (String u : map.get(t))\n\t\t\t\t\tadd.add(u);\n\t\t\t}\n\t\t}\n\t\tset.removeAll(remove);\n\t\tset.addAll(add);\n\t}\n\t\n\tvoid run() {\n\t\twhile (true) {\n\t\t\tint n = sc.nextInt();\n\t\t\tif (n == 0) break;\n\t\t\tmap.clear();\n\t\t\tString zero = null;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tStringTokenizer st = new StringTokenizer(sc.next(), \": ,.\");\n\t\t\t\tSet set = new HashSet();\n\t\t\t\tString s = st.nextToken();\n\t\t\t\tmap.put(s, set);\n\t\t\t\tif (i == 0) zero = s;\n\t\t\t\twhile (st.hasMoreTokens())\n\t\t\t\t\tset.add(st.nextToken());\n\t\t\t}\n\t\t\tchecked.clear();\n\t\t\tcalc(zero);\n\t\t\tout.println(map.get(zero).size());\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n}", "language": "Java", "metadata": {"date": 1394527417, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00884.html", "problem_id": "p00884", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00884/input.txt", "sample_output_relpath": "derived/input_output/data/p00884/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00884/Java/s068689285.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s068689285", "user_id": "u753862498"}, "prompt_components": {"gold_output": "4\n1\n6\n4\n2\n", "input_to_evaluate": "import java.util.*;\nimport static java.lang.System.*;\n\npublic class Main {\n\n\tScanner sc = new Scanner(in);\n\t\n\tMap> map = new HashMap>();\n\tList remove = new ArrayList();\n\tList add = new ArrayList();\n\tSet checked = new HashSet();\n\t\n\tvoid calc(String s) {\n\t\tchecked.add(s);\n\t\tSet set = map.get(s);\n\t\tadd.clear();\n\t\tremove.clear();\n\t\tfor (String t : set) {\n\t\t\tif (map.containsKey(t)) {\n\t\t\t\tif (!checked.contains(t))\n\t\t\t\t\tcalc(t);\n\t\t\t\tremove.add(t);\n\t\t\t\tfor (String u : map.get(t))\n\t\t\t\t\tadd.add(u);\n\t\t\t}\n\t\t}\n\t\tset.removeAll(remove);\n\t\tset.addAll(add);\n\t}\n\t\n\tvoid run() {\n\t\twhile (true) {\n\t\t\tint n = sc.nextInt();\n\t\t\tif (n == 0) break;\n\t\t\tmap.clear();\n\t\t\tString zero = null;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tStringTokenizer st = new StringTokenizer(sc.next(), \": ,.\");\n\t\t\t\tSet set = new HashSet();\n\t\t\t\tString s = st.nextToken();\n\t\t\t\tmap.put(s, set);\n\t\t\t\tif (i == 0) zero = s;\n\t\t\t\twhile (st.hasMoreTokens())\n\t\t\t\t\tset.add(st.nextToken());\n\t\t\t}\n\t\t\tchecked.clear();\n\t\t\tcalc(zero);\n\t\t\tout.println(map.get(zero).size());\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n}", "problem_context": "Problem A: Membership Management\n\nPeter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.\n\nPeter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.\n\ndesign:carol,alice.\n\nThe name preceding the colon is the group name and the names following it specify its members.\n\nA smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.\n\ndevelopment:alice,bob,design,eve.\n\nSimply unfolding the design above gives the following membership specification, which is equivalent to the original.\n\ndevelopment:alice,bob,carol,alice,eve.\n\nIn this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.\n\ndevelopment:alice,bob,carol,eve.\n\nYour mission in this problem is to write a program that, given group specifications, identifies group members.\n\nNote that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.\n\none:another.\nanother:yetanother.\nyetanother:dave.\n\nInput\n\nThe input is a sequence of datasets, each being in the following format.\n\nn\n\ngroup1:member1,1,...,member1,m1.\n\n.\n\n.\n\n.\n\ngroupi:memberi,1,...,memberi,mi.\n\n.\n\n.\n\n.\n\ngroupn:membern,1,...,membern,mn.\n\nThe first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).\n\nThose group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.\n\nThere are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.\n\nEach group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.\n\nThe end of the input is indicated by a line containing a zero.\n\nOutput\n\nFor each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.\n\nSample Input\n\n2\ndevelopment:alice,bob,design,eve.\ndesign:carol,alice.\n3\none:another.\nanother:yetanother.\nyetanother:dave.\n3\nfriends:alice,bob,bestfriends,carol,fran,badcompany.\nbestfriends:eve,alice.\nbadcompany:dave,carol.\n5\na:b,c,d,e.\nb:c,d,e,f.\nc:d,e,f,g.\nd:e,f,g,h.\ne:f,g,h,i.\n4\naa:bb.\ncc:dd,ee.\nff:gg.\nbb:cc.\n0\n\nOutput for the Sample Input\n\n4\n1\n6\n4\n2", "sample_input": "2\ndevelopment:alice,bob,design,eve.\ndesign:carol,alice.\n3\none:another.\nanother:yetanother.\nyetanother:dave.\n3\nfriends:alice,bob,bestfriends,carol,fran,badcompany.\nbestfriends:eve,alice.\nbadcompany:dave,carol.\n5\na:b,c,d,e.\nb:c,d,e,f.\nc:d,e,f,g.\nd:e,f,g,h.\ne:f,g,h,i.\n4\naa:bb.\ncc:dd,ee.\nff:gg.\nbb:cc.\n0\n"}, "reference_outputs": ["4\n1\n6\n4\n2\n"], "source_document_id": "p00884", "source_text": "Problem A: Membership Management\n\nPeter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.\n\nPeter updates the membership information whenever any changes occur: for instance, the following line written by him means that Carol and Alice are the members of the Design Group.\n\ndesign:carol,alice.\n\nThe name preceding the colon is the group name and the names following it specify its members.\n\nA smaller task group may be included in a larger one. So, a group name can appear as a member of another group, for instance, as follows.\n\ndevelopment:alice,bob,design,eve.\n\nSimply unfolding the design above gives the following membership specification, which is equivalent to the original.\n\ndevelopment:alice,bob,carol,alice,eve.\n\nIn this case, however, alice occurs twice. After removing one of the duplicates, we have the following more concise specification.\n\ndevelopment:alice,bob,carol,eve.\n\nYour mission in this problem is to write a program that, given group specifications, identifies group members.\n\nNote that Peter's specifications can include deeply nested groups. In the following, for instance, the group one contains a single member dave.\n\none:another.\nanother:yetanother.\nyetanother:dave.\n\nInput\n\nThe input is a sequence of datasets, each being in the following format.\n\nn\n\ngroup1:member1,1,...,member1,m1.\n\n.\n\n.\n\n.\n\ngroupi:memberi,1,...,memberi,mi.\n\n.\n\n.\n\n.\n\ngroupn:membern,1,...,membern,mn.\n\nThe first line contains n, which represents the number of groups and is a positive integer no more than 100. Each of the following n lines contains the membership information of a group: groupi (1 ≤ i ≤ n) is the name of the i-th task group and is followed by a colon (:) and then the list of its mi member s that are delimited by a comma (,) and terminated by a period (.).\n\nThose group names are mutually different. Each mi (1 ≤ i ≤ n) is between 1 and 10, inclusive. A member is another group name if it is one of group1, group2,..., or groupn. Otherwise it is an employee name.\n\nThere are no circular (or recursive) definitions of group(s). You may assume that mi member names of a group are mutually different.\n\nEach group or employee name is a non-empty character string of length between 1 and 15, inclusive, and consists of lowercase letters.\n\nThe end of the input is indicated by a line containing a zero.\n\nOutput\n\nFor each dataset, output the number of employees included in the first group of the dataset, that is group1, in a line. No extra characters should occur in the output.\n\nSample Input\n\n2\ndevelopment:alice,bob,design,eve.\ndesign:carol,alice.\n3\none:another.\nanother:yetanother.\nyetanother:dave.\n3\nfriends:alice,bob,bestfriends,carol,fran,badcompany.\nbestfriends:eve,alice.\nbadcompany:dave,carol.\n5\na:b,c,d,e.\nb:c,d,e,f.\nc:d,e,f,g.\nd:e,f,g,h.\ne:f,g,h,i.\n4\naa:bb.\ncc:dd,ee.\nff:gg.\nbb:cc.\n0\n\nOutput for the Sample Input\n\n4\n1\n6\n4\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1201, "cpu_time_ms": 250, "memory_kb": 33188}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s530449181", "group_id": "codeNet:p00925", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\nimport static java.lang.Integer.parseInt;\n\n/**\n * Miscalculation\n */\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line;\n\t\tString[] words;\n\n\t\tString exp = br.readLine();\n\t\tint ans = parseInt(br.readLine());\n\n\t\tint M, L;\n\t\tM = M(exp);\n\t\tL = L(exp);\n\t\tif (ans == M && ans == L) {\n\t\t\tSystem.out.println('U');\n\t\t} else if (ans == M) {\n\t\t\tSystem.out.println('M');\n\t\t} else if (ans == L) {\n\t\t\tSystem.out.println('L');\n\t\t} else {\n\t\t\tSystem.out.println('I');\n\t\t}\n\t}\n\n\tstatic int M(String exp) {\n\t\tchar[] pri = new char[127];\n\t\tArrays.fill(pri, (char) 3);\n\t\tpri['*'] = 2;\n\t\tpri['+'] = 1;\n\t\tpri[0] = 0;\n\t\treturn calc(exp, pri);\n\t}\n\n\tstatic int L(String exp) {\n\t\tchar[] pri = new char[127];\n\t\tArrays.fill(pri, (char) 3);\n\t\tpri['*'] = 1;\n\t\tpri['+'] = 1;\n\t\tpri[0] = 0;\n\t\treturn calc(exp, pri);\n\t}\n\n\tstatic int calc(String exp, char[] pri) {\n\t\tDeque stack = new ArrayDeque<>();\n\t\tDeque queue = new ArrayDeque<>();\n\n\t\tstack.push('\\0');\n\t\tfor (char c : exp.toCharArray()) {\n\t\t\tif (pri[c] > pri[stack.peek()]) {\n\t\t\t\tstack.push(c);\n\t\t\t} else {\n\t\t\t\twhile (pri[c] <= pri[stack.peek()]) {\n\t\t\t\t\tqueue.offer(stack.pop());\n\t\t\t\t}\n\t\t\t\tstack.push(c);\n\t\t\t}\n\t\t}\n\t\twhile (stack.peek() != '\\0') queue.offer(stack.pop());\n\n\t\t//\n\t\tString rpn = \"\";\n\t\tDeque ans = new ArrayDeque<>();\n\n\t\tfor (char c : queue) rpn += String.valueOf(c);\n\t\tfor (char c : rpn.toCharArray()) {\n\t\t\tint a, b;\n\t\t\tswitch (c) {\n\t\t\t\tcase '*':\n\t\t\t\t\tb = ans.pop();\n\t\t\t\t\ta = ans.pop();\n\t\t\t\t\tans.push(a * b);\n\t\t\t\t\tbreak;\n\t\t\t\tcase '+':\n\t\t\t\t\tb = ans.pop();\n\t\t\t\t\ta = ans.pop();\n\t\t\t\t\tans.push(a + b);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tans.push(c - '0');\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn ans.peek();\n\t}\n}", "language": "Java", "metadata": {"date": 1471641632, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p00925.html", "problem_id": "p00925", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00925/input.txt", "sample_output_relpath": "derived/input_output/data/p00925/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00925/Java/s530449181.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s530449181", "user_id": "u759934006"}, "prompt_components": {"gold_output": "M\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\nimport static java.lang.Integer.parseInt;\n\n/**\n * Miscalculation\n */\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line;\n\t\tString[] words;\n\n\t\tString exp = br.readLine();\n\t\tint ans = parseInt(br.readLine());\n\n\t\tint M, L;\n\t\tM = M(exp);\n\t\tL = L(exp);\n\t\tif (ans == M && ans == L) {\n\t\t\tSystem.out.println('U');\n\t\t} else if (ans == M) {\n\t\t\tSystem.out.println('M');\n\t\t} else if (ans == L) {\n\t\t\tSystem.out.println('L');\n\t\t} else {\n\t\t\tSystem.out.println('I');\n\t\t}\n\t}\n\n\tstatic int M(String exp) {\n\t\tchar[] pri = new char[127];\n\t\tArrays.fill(pri, (char) 3);\n\t\tpri['*'] = 2;\n\t\tpri['+'] = 1;\n\t\tpri[0] = 0;\n\t\treturn calc(exp, pri);\n\t}\n\n\tstatic int L(String exp) {\n\t\tchar[] pri = new char[127];\n\t\tArrays.fill(pri, (char) 3);\n\t\tpri['*'] = 1;\n\t\tpri['+'] = 1;\n\t\tpri[0] = 0;\n\t\treturn calc(exp, pri);\n\t}\n\n\tstatic int calc(String exp, char[] pri) {\n\t\tDeque stack = new ArrayDeque<>();\n\t\tDeque queue = new ArrayDeque<>();\n\n\t\tstack.push('\\0');\n\t\tfor (char c : exp.toCharArray()) {\n\t\t\tif (pri[c] > pri[stack.peek()]) {\n\t\t\t\tstack.push(c);\n\t\t\t} else {\n\t\t\t\twhile (pri[c] <= pri[stack.peek()]) {\n\t\t\t\t\tqueue.offer(stack.pop());\n\t\t\t\t}\n\t\t\t\tstack.push(c);\n\t\t\t}\n\t\t}\n\t\twhile (stack.peek() != '\\0') queue.offer(stack.pop());\n\n\t\t//\n\t\tString rpn = \"\";\n\t\tDeque ans = new ArrayDeque<>();\n\n\t\tfor (char c : queue) rpn += String.valueOf(c);\n\t\tfor (char c : rpn.toCharArray()) {\n\t\t\tint a, b;\n\t\t\tswitch (c) {\n\t\t\t\tcase '*':\n\t\t\t\t\tb = ans.pop();\n\t\t\t\t\ta = ans.pop();\n\t\t\t\t\tans.push(a * b);\n\t\t\t\t\tbreak;\n\t\t\t\tcase '+':\n\t\t\t\t\tb = ans.pop();\n\t\t\t\t\ta = ans.pop();\n\t\t\t\t\tans.push(a + b);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tans.push(c - '0');\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn ans.peek();\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nProblem B:\nMiscalculation\n\nBob is an elementary schoolboy, not so good at mathematics. He found Father's calculator and tried cheating on his homework using it. His homework was calculating given expressions containing multiplications and additions. Multiplications should be done prior to additions, of course, but the calculator evaluates the expression from left to right, neglecting the operator precedence. So his answers may be the result of either of the following two calculation rules.\n\nDoing multiplication before addition\n\nDoing calculation from left to right neglecting the operator precedence\n\nWrite a program that tells which of the rules is applied from an expression and his answer.\n\nAn expression consists of integers and operators. All the integers have only one digit, from 0 to 9. There are two kinds of operators + and *, which represent addition and multiplication, respectively.\n\nThe following is an example expression.\n\n1+2*3+4\n\nCalculating this expression with the multiplication-first rule, the answer is 11, as in Sample Input 1. With the left-to-right rule, however, the answer will be 13 as shown in Sample Input 2.\n\nThere may be cases in which both rules lead to the same result and you cannot tell which of the rules is applied. Moreover, Bob sometimes commits miscalculations. When neither rules would result in Bob’s answer, it is clear that he actually did.\n\nInput\n\nThe input consists of a single test case specified with two lines. The first line contains the expression to be calculated. The number of characters of the expression is always odd and less than or equal to 17. Each of the odd-numbered characters in the expression is a digit from '0' to '9'. Each of the even-numbered characters is an operator '+' or '*'. The second line contains an integer which ranges from 0 to 999999999, inclusive. This integer represents Bob's answer for the expression given in the first line.\n\nOutput\n\nOutput one of the following four characters:\n\nM     When only the multiplication-first rule results Bob's answer.\n\nL     When only the left-to-right rule results Bob's answer.\n\nU     When both of the rules result Bob's answer.\n\nI     When neither of the rules results Bob's answer.\n\nSample Input 1\n\n1+2*3+4\n11\n\nSample Output 1\n\nM\n\nSample Input 2\n\n1+2*3+4\n13\n\nSample Output 2\n\nL\n\nSample Input 3\n\n3\n3\n\nSample Output 3\n\nU\n\nSample Input 4\n\n1+2*3+4\n9\n\nSample Output 4\n\nI", "sample_input": "1+2*3+4\n11\n"}, "reference_outputs": ["M\n"], "source_document_id": "p00925", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nProblem B:\nMiscalculation\n\nBob is an elementary schoolboy, not so good at mathematics. He found Father's calculator and tried cheating on his homework using it. His homework was calculating given expressions containing multiplications and additions. Multiplications should be done prior to additions, of course, but the calculator evaluates the expression from left to right, neglecting the operator precedence. So his answers may be the result of either of the following two calculation rules.\n\nDoing multiplication before addition\n\nDoing calculation from left to right neglecting the operator precedence\n\nWrite a program that tells which of the rules is applied from an expression and his answer.\n\nAn expression consists of integers and operators. All the integers have only one digit, from 0 to 9. There are two kinds of operators + and *, which represent addition and multiplication, respectively.\n\nThe following is an example expression.\n\n1+2*3+4\n\nCalculating this expression with the multiplication-first rule, the answer is 11, as in Sample Input 1. With the left-to-right rule, however, the answer will be 13 as shown in Sample Input 2.\n\nThere may be cases in which both rules lead to the same result and you cannot tell which of the rules is applied. Moreover, Bob sometimes commits miscalculations. When neither rules would result in Bob’s answer, it is clear that he actually did.\n\nInput\n\nThe input consists of a single test case specified with two lines. The first line contains the expression to be calculated. The number of characters of the expression is always odd and less than or equal to 17. Each of the odd-numbered characters in the expression is a digit from '0' to '9'. Each of the even-numbered characters is an operator '+' or '*'. The second line contains an integer which ranges from 0 to 999999999, inclusive. This integer represents Bob's answer for the expression given in the first line.\n\nOutput\n\nOutput one of the following four characters:\n\nM     When only the multiplication-first rule results Bob's answer.\n\nL     When only the left-to-right rule results Bob's answer.\n\nU     When both of the rules result Bob's answer.\n\nI     When neither of the rules results Bob's answer.\n\nSample Input 1\n\n1+2*3+4\n11\n\nSample Output 1\n\nM\n\nSample Input 2\n\n1+2*3+4\n13\n\nSample Output 2\n\nL\n\nSample Input 3\n\n3\n3\n\nSample Output 3\n\nU\n\nSample Input 4\n\n1+2*3+4\n9\n\nSample Output 4\n\nI", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1889, "cpu_time_ms": 60, "memory_kb": 24484}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s697924185", "group_id": "codeNet:p00993", "input_text": "import java.math.*;\nimport java.io.*;\n\n\nclass Main\n{\n \n public static void main(String args[])throws IOException\n {\n\tBigInteger a = new BigInteger(\"1\");\n\tfor(int i=2;i<=1501;i++)\n\t a = a.multiply(new BigInteger(Integer.toString(i)));\n\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in)); \n\ta = a.add(new BigInteger(\"1501\"));\n\tint n = Integer.parseInt(in.readLine());\n\tSystem.out.println(a);\n\tfor(int i=1501;i_/___.' >'\"\".\n | | : `- \\`.;`\\ _ /`;.`/ - ` : | |\n \\ \\ `-. \\_ __\\ /__ _/ .-` / /\n======`-.____`-.___\\_____/___.-`____.-'======\n `=---='\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n pass System Test!\n*/\n\npublic class Main {\n private static class Task {\n boolean oneDimentionSolver(char[] map) {\n int L = map.length;\n int x;\n for (x = 0; x < L; x++) {\n if (map[x] == '@') break;\n }\n {\n int count = 0;\n for (int i = 0; i < x; i++) {\n if (map[i] == 'o') count++;\n }\n int d = L - x;\n for (int i = x + 1; i < L; i++) {\n if (map[i] == 'o') d = i - x;\n }\n if (count >= d) return true;\n }\n {\n int count = 0;\n for (int i = x; i < L; i++) {\n if (map[i] == 'o') count++;\n }\n int d = x + 1;\n for (int i = 0; i < x; i++) {\n if (map[i] == 'o') d = x - i;\n }\n if (count >= d) return true;\n }\n return false;\n }\n\n void solve(FastScanner in, PrintWriter out) throws Exception {\n int H = in.nextInt();\n int W = in.nextInt();\n char[][] map = new char[H][];\n for (int i = 0; i < H; i++) {\n map[i] = in.next().toCharArray();\n }\n int count = 0;\n int x = 0, y = 0;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n if (map[i][j] == 'o') count++;\n else if (map[i][j] == '@') {\n x = i;\n y = j;\n }\n }\n }\n\n char[] horizontal = new char[W];\n for (int i = 0; i < W; i++) {\n horizontal[i] = map[x][i];\n }\n char[] vertical = new char[H];\n for (int i = 0; i < H; i++) {\n vertical[i] = map[i][y];\n }\n if (oneDimentionSolver(horizontal) || oneDimentionSolver(vertical)) {\n out.println(\"yes\");\n return;\n }\n\n if (count == 0) {\n out.println(\"no\");\n return;\n }\n\n if (H >= 2 || W >= 2) {\n if (count >= 3) {\n out.println(\"yes\");\n return;\n }\n if (count == 1) {\n if ((x == 0 || x == H - 1) && (y == 0 || y == W - 1)) {\n out.println(\"yes\");\n } else {\n out.println(\"no\");\n }\n } else {\n if ((x == 0 || x == H - 1) || (y == 0 || y == W - 1)) {\n for (long i = 0; i < 1000000000L; i++) count++;\n out.println(\"yes\");\n } else {\n for (long i = 0; i < 1000000000L; i++) count++;\n out.println(\"no\");\n }\n }\n return;\n }\n for (long i = 0; i < 1000000000L; i++) count++;\n out.println(\"no\");\n }\n }\n\n /**\n * ?????????????????????????????¬????????§??????\n */\n public static void main(String[] args) throws Exception {\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(outputStream);\n Task solver = new Task();\n solver.solve(in, out);\n out.close();\n }\n private static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int bufferLength = 0;\n\n private boolean hasNextByte() {\n if (ptr < bufferLength) {\n return true;\n } else {\n ptr = 0;\n try {\n bufferLength = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (bufferLength <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) array[i] = nextInt();\n return array;\n }\n\n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) array[i] = nextLong();\n return array;\n }\n\n public String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) array[i] = next();\n return array;\n }\n\n public char[][] nextCharMap(int n) {\n char[][] array = new char[n][];\n for (int i = 0; i < n; i++) array[i] = next().toCharArray();\n return array;\n }\n\n public int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }\n }\n}", "language": "Java", "metadata": {"date": 1474554085, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p01077.html", "problem_id": "p01077", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01077/input.txt", "sample_output_relpath": "derived/input_output/data/p01077/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01077/Java/s965550498.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s965550498", "user_id": "u568152427"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\n\n/*\n _ooOoo_\n o8888888o\n 88\" . \"88\n (| -_- |)\n O\\ = /O\n ____/`---'\\____\n .' \\\\| |// `.\n / \\\\||| : |||// \\\n / _||||| -:- |||||- \\\n | | \\\\\\ - /// | |\n | \\_| ''\\---/'' | |\n \\ .-\\__ `-` ___/-. /\n ___`. .' /--.--\\ `. . __\n .\"\" '< `.___\\_<|>_/___.' >'\"\".\n | | : `- \\`.;`\\ _ /`;.`/ - ` : | |\n \\ \\ `-. \\_ __\\ /__ _/ .-` / /\n======`-.____`-.___\\_____/___.-`____.-'======\n `=---='\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n pass System Test!\n*/\n\npublic class Main {\n private static class Task {\n boolean oneDimentionSolver(char[] map) {\n int L = map.length;\n int x;\n for (x = 0; x < L; x++) {\n if (map[x] == '@') break;\n }\n {\n int count = 0;\n for (int i = 0; i < x; i++) {\n if (map[i] == 'o') count++;\n }\n int d = L - x;\n for (int i = x + 1; i < L; i++) {\n if (map[i] == 'o') d = i - x;\n }\n if (count >= d) return true;\n }\n {\n int count = 0;\n for (int i = x; i < L; i++) {\n if (map[i] == 'o') count++;\n }\n int d = x + 1;\n for (int i = 0; i < x; i++) {\n if (map[i] == 'o') d = x - i;\n }\n if (count >= d) return true;\n }\n return false;\n }\n\n void solve(FastScanner in, PrintWriter out) throws Exception {\n int H = in.nextInt();\n int W = in.nextInt();\n char[][] map = new char[H][];\n for (int i = 0; i < H; i++) {\n map[i] = in.next().toCharArray();\n }\n int count = 0;\n int x = 0, y = 0;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n if (map[i][j] == 'o') count++;\n else if (map[i][j] == '@') {\n x = i;\n y = j;\n }\n }\n }\n\n char[] horizontal = new char[W];\n for (int i = 0; i < W; i++) {\n horizontal[i] = map[x][i];\n }\n char[] vertical = new char[H];\n for (int i = 0; i < H; i++) {\n vertical[i] = map[i][y];\n }\n if (oneDimentionSolver(horizontal) || oneDimentionSolver(vertical)) {\n out.println(\"yes\");\n return;\n }\n\n if (count == 0) {\n out.println(\"no\");\n return;\n }\n\n if (H >= 2 || W >= 2) {\n if (count >= 3) {\n out.println(\"yes\");\n return;\n }\n if (count == 1) {\n if ((x == 0 || x == H - 1) && (y == 0 || y == W - 1)) {\n out.println(\"yes\");\n } else {\n out.println(\"no\");\n }\n } else {\n if ((x == 0 || x == H - 1) || (y == 0 || y == W - 1)) {\n for (long i = 0; i < 1000000000L; i++) count++;\n out.println(\"yes\");\n } else {\n for (long i = 0; i < 1000000000L; i++) count++;\n out.println(\"no\");\n }\n }\n return;\n }\n for (long i = 0; i < 1000000000L; i++) count++;\n out.println(\"no\");\n }\n }\n\n /**\n * ?????????????????????????????¬????????§??????\n */\n public static void main(String[] args) throws Exception {\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(outputStream);\n Task solver = new Task();\n solver.solve(in, out);\n out.close();\n }\n private static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int bufferLength = 0;\n\n private boolean hasNextByte() {\n if (ptr < bufferLength) {\n return true;\n } else {\n ptr = 0;\n try {\n bufferLength = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (bufferLength <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) array[i] = nextInt();\n return array;\n }\n\n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) array[i] = nextLong();\n return array;\n }\n\n public String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) array[i] = next();\n return array;\n }\n\n public char[][] nextCharMap(int n) {\n char[][] array = new char[n][];\n for (int i = 0; i < n; i++) array[i] = next().toCharArray();\n return array;\n }\n\n public int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }\n }\n}", "problem_context": "Problem F: Curling Puzzle\n\nProblem\n\nカーリングのストーンを移動させて、ゴールのマスにストーンをぴったり重ねるパズルゲームがある。詳しいルールは次のとおりである。\n\nフィールドはH×Wのマスからなり、はじめにいくつかのマスにストーンが置かれている。\nゴールのマスは1つだけ存在して、はじめからゴールのマスにストーンが置かれていることはない。\nまた、フィールドは外壁で囲まれており、途中でストーンがフィールドの外へ飛び出してしまうことはない。\n\nプレイヤーは1手ごとにストーンを1つ選び、上下左右のいずれかの方向に打ち出して滑らせることができる。\n滑っているストーンは別のストーンかフィールドの外壁にぶつかるまで滑り続ける。別のストーンにぶつかった場合は、\nぶつけられた側のストーンが反動を受け、最初に打ち出した方向と同じ方向へ連鎖的に滑り出してしまう。\n\n例えば、図1の状態でストーンAを右方向に打ち出した場合、最終的に図2のような状態になる。\n\n図1\n\n図2\n\nこのパズルのクリア条件は、フィールドに存在するストーンのいずれか1つをゴールのマスにぴったり重ねることである。ゴールのマスを通り過ぎた場合にはクリアにならない。\n\nあなたの仕事はフィールドの初期状態を入力として受け取り、そのパズルがクリア可能かどうかを出力するプログラムを作成することである。\n\nInput\n\n入力は以下の形式で与えられる。\n\nH W\nF11 F12 ... F1W\nF21 F22 ... F2W\n...\nFH1 FH2 ... FHW\n\nFijは '.' か 'o' か '@' のいずれかであり、それぞれ以下の意味を持つ。\n( 1 ≤ i ≤ H , 1 ≤ j ≤ W )\n\n'.' : 空白のマス\n\n'o' : カーリングのストーンが置かれているマス\n\n'@' : ゴールのマス\n\nConstraints\n\n1 ≤ H ≤ 16\n\n1 ≤ W ≤ 16\n\n2 ≤ H × W ≤ 256\n\nゴールのマスが1つだけ存在することが保証されている\n\nカーリングのストーンが置かれているマスが1つ以上存在することが保障されている\n\nOutput\n\nパズルがクリア可能かどうか \"yes\" または \"no\" (\"\"は含まない)を1行に出力せよ。\n\nSample Input 1\n\n1 10\no........@\n\nSample Output 1\n\nyes\n\nSample Input 2\n\n3 6\n......\n.o..@.\n......\n\nSample Output 2\n\nno\n\nSample Input 3\n\n6 4\n....\n.oo.\n.oo.\n....\n.@..\n....\n\nSample Output 3\n\nyes", "sample_input": "1 10\no........@\n"}, "reference_outputs": ["yes\n"], "source_document_id": "p01077", "source_text": "Problem F: Curling Puzzle\n\nProblem\n\nカーリングのストーンを移動させて、ゴールのマスにストーンをぴったり重ねるパズルゲームがある。詳しいルールは次のとおりである。\n\nフィールドはH×Wのマスからなり、はじめにいくつかのマスにストーンが置かれている。\nゴールのマスは1つだけ存在して、はじめからゴールのマスにストーンが置かれていることはない。\nまた、フィールドは外壁で囲まれており、途中でストーンがフィールドの外へ飛び出してしまうことはない。\n\nプレイヤーは1手ごとにストーンを1つ選び、上下左右のいずれかの方向に打ち出して滑らせることができる。\n滑っているストーンは別のストーンかフィールドの外壁にぶつかるまで滑り続ける。別のストーンにぶつかった場合は、\nぶつけられた側のストーンが反動を受け、最初に打ち出した方向と同じ方向へ連鎖的に滑り出してしまう。\n\n例えば、図1の状態でストーンAを右方向に打ち出した場合、最終的に図2のような状態になる。\n\n図1\n\n図2\n\nこのパズルのクリア条件は、フィールドに存在するストーンのいずれか1つをゴールのマ���にぴったり重ねることである。ゴールのマスを通り過ぎた場合にはクリアにならない。\n\nあなたの仕事はフィールドの初期状態を入力として受け取り、そのパズルがクリア可能かどうかを出力するプログラムを作成することである。\n\nInput\n\n入力は以下の形式で与えられる。\n\nH W\nF11 F12 ... F1W\nF21 F22 ... F2W\n...\nFH1 FH2 ... FHW\n\nFijは '.' か 'o' か '@' のいずれかであり、それぞれ以下の意味を持つ。\n( 1 ≤ i ≤ H , 1 ≤ j ≤ W )\n\n'.' : 空白のマス\n\n'o' : カーリングのストーンが置かれているマス\n\n'@' : ゴールのマス\n\nConstraints\n\n1 ≤ H ≤ 16\n\n1 ≤ W ≤ 16\n\n2 ≤ H × W ≤ 256\n\nゴールのマスが1つだけ存在することが保証されている\n\nカーリングのストーンが置かれているマスが1つ以上存在することが保障されている\n\nOutput\n\nパズルがクリア可能かどうか \"yes\" または \"no\" (\"\"は含まない)を1行に出力せよ。\n\nSample Input 1\n\n1 10\no........@\n\nSample Output 1\n\nyes\n\nSample Input 2\n\n3 6\n......\n.o..@.\n......\n\nSample Output 2\n\nno\n\nSample Input 3\n\n6 4\n....\n.oo.\n.oo.\n....\n.@..\n....\n\nSample Output 3\n\nyes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6826, "cpu_time_ms": 400, "memory_kb": 26616}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s117443607", "group_id": "codeNet:p01079", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n/*\n _ooOoo_\n o8888888o\n 88\" . \"88\n (| -_- |)\n O\\ = /O\n ____/`---'\\____\n .' \\\\| |// `.\n / \\\\||| : |||// \\\n / _||||| -:- |||||- \\\n | | \\\\\\ - /// | |\n | \\_| ''\\---/'' | |\n \\ .-\\__ `-` ___/-. /\n ___`. .' /--.--\\ `. . __\n .\"\" '< `.___\\_<|>_/___.' >'\"\".\n | | : `- \\`.;`\\ _ /`;.`/ - ` : | |\n \\ \\ `-. \\_ __\\ /__ _/ .-` / /\n======`-.____`-.___\\_____/___.-`____.-'======\n `=---='\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n pass System Test!\n*/\n@SuppressWarnings(\"unchecked\")\npublic class Main {\n private static class Task {\n\n class Edge {\n int to, cost;\n Edge(int to, int cost) {\n this.to = to;\n this.cost = cost;\n }\n }\n\n void solve(FastScanner in, PrintWriter out) throws Exception {\n int N = in.nextInt();\n int M = in.nextInt();\n int R = in.nextInt();\n int[] B = in.nextIntArray(N);\n\n int[][] dist = new int[N][N];\n for (int[] d : dist) Arrays.fill(d, Integer.MAX_VALUE / 2);\n for (int i = 0; i < M; i++) {\n int a = in.nextInt() - 1;\n int b = in.nextInt() - 1;\n int c = in.nextInt();\n\n dist[a][b] = c;\n dist[b][a] = c;\n\n if (N == 5 && M == 4 && R == 442) {\n if (Math.min(a, b) == 0 && Math.max(a, b) == 1) throw new Exception();\n }\n }\n\n for (int i = 0; i < N; i++) dist[i][i] = 0;\n for (int k = 0; k < N; k++) {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n\n int[][][] dp = new int[R + 1][N][N];\n for (int[][] dp1 : dp) for (int[] dp2 : dp1) Arrays.fill(dp2, -1);\n dp[0][0][0] = 0;\n\n for (int time = 0; time <= R; time++) {\n for (int cur = 0; cur < N; cur++) {\n for (int prev = 0; prev < N; prev++) {\n if (dp[time][cur][prev] < 0) continue;\n\n for (int to = 1; to < N; to++) {\n if (to == prev) continue;\n if (to == cur) {\n int next = time + 15;\n int ball = dp[time][cur][prev] + B[to];\n if (next <= R) dp[next][to][0] = Math.max(dp[next][to][0], ball);\n } else {\n {\n int next = time + dist[cur][to];\n int ball = dp[time][cur][prev] + B[to];\n if (next <= R) dp[next][to][cur] = Math.max(dp[next][to][cur], ball);\n }\n {\n int wait = Math.max(0, 15 - dist[cur][to] * 2);\n int next = time + dist[cur][to] + wait;\n int ball = dp[time][cur][prev] + B[to];\n if (next <= R) dp[next][to][0] = Math.max(dp[next][to][0], ball);\n }\n }\n }\n }\n }\n }\n\n int max = -1;\n for (int time = 0; time <= R; time++) {\n for (int prev = 0; prev < N; prev++) {\n max = Math.max(dp[time][N - 1][prev], max);\n }\n }\n\n out.println(max);\n }\n }\n\n /**\n * ?????????????????????????????¬????????§??????\n */\n public static void main(String[] args) throws Exception {\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(outputStream);\n Task solver = new Task();\n solver.solve(in, out);\n out.close();\n }\n private static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int bufferLength = 0;\n\n private boolean hasNextByte() {\n if (ptr < bufferLength) {\n return true;\n } else {\n ptr = 0;\n try {\n bufferLength = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (bufferLength <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) array[i] = nextInt();\n return array;\n }\n\n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) array[i] = nextLong();\n return array;\n }\n\n public String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) array[i] = next();\n return array;\n }\n\n public char[][] nextCharMap(int n) {\n char[][] array = new char[n][];\n for (int i = 0; i < n; i++) array[i] = next().toCharArray();\n return array;\n }\n\n public int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }\n }\n}", "language": "Java", "metadata": {"date": 1475055492, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p01079.html", "problem_id": "p01079", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01079/input.txt", "sample_output_relpath": "derived/input_output/data/p01079/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01079/Java/s117443607.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s117443607", "user_id": "u568152427"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n/*\n _ooOoo_\n o8888888o\n 88\" . \"88\n (| -_- |)\n O\\ = /O\n ____/`---'\\____\n .' \\\\| |// `.\n / \\\\||| : |||// \\\n / _||||| -:- |||||- \\\n | | \\\\\\ - /// | |\n | \\_| ''\\---/'' | |\n \\ .-\\__ `-` ___/-. /\n ___`. .' /--.--\\ `. . __\n .\"\" '< `.___\\_<|>_/___.' >'\"\".\n | | : `- \\`.;`\\ _ /`;.`/ - ` : | |\n \\ \\ `-. \\_ __\\ /__ _/ .-` / /\n======`-.____`-.___\\_____/___.-`____.-'======\n `=---='\n^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n pass System Test!\n*/\n@SuppressWarnings(\"unchecked\")\npublic class Main {\n private static class Task {\n\n class Edge {\n int to, cost;\n Edge(int to, int cost) {\n this.to = to;\n this.cost = cost;\n }\n }\n\n void solve(FastScanner in, PrintWriter out) throws Exception {\n int N = in.nextInt();\n int M = in.nextInt();\n int R = in.nextInt();\n int[] B = in.nextIntArray(N);\n\n int[][] dist = new int[N][N];\n for (int[] d : dist) Arrays.fill(d, Integer.MAX_VALUE / 2);\n for (int i = 0; i < M; i++) {\n int a = in.nextInt() - 1;\n int b = in.nextInt() - 1;\n int c = in.nextInt();\n\n dist[a][b] = c;\n dist[b][a] = c;\n\n if (N == 5 && M == 4 && R == 442) {\n if (Math.min(a, b) == 0 && Math.max(a, b) == 1) throw new Exception();\n }\n }\n\n for (int i = 0; i < N; i++) dist[i][i] = 0;\n for (int k = 0; k < N; k++) {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n\n int[][][] dp = new int[R + 1][N][N];\n for (int[][] dp1 : dp) for (int[] dp2 : dp1) Arrays.fill(dp2, -1);\n dp[0][0][0] = 0;\n\n for (int time = 0; time <= R; time++) {\n for (int cur = 0; cur < N; cur++) {\n for (int prev = 0; prev < N; prev++) {\n if (dp[time][cur][prev] < 0) continue;\n\n for (int to = 1; to < N; to++) {\n if (to == prev) continue;\n if (to == cur) {\n int next = time + 15;\n int ball = dp[time][cur][prev] + B[to];\n if (next <= R) dp[next][to][0] = Math.max(dp[next][to][0], ball);\n } else {\n {\n int next = time + dist[cur][to];\n int ball = dp[time][cur][prev] + B[to];\n if (next <= R) dp[next][to][cur] = Math.max(dp[next][to][cur], ball);\n }\n {\n int wait = Math.max(0, 15 - dist[cur][to] * 2);\n int next = time + dist[cur][to] + wait;\n int ball = dp[time][cur][prev] + B[to];\n if (next <= R) dp[next][to][0] = Math.max(dp[next][to][0], ball);\n }\n }\n }\n }\n }\n }\n\n int max = -1;\n for (int time = 0; time <= R; time++) {\n for (int prev = 0; prev < N; prev++) {\n max = Math.max(dp[time][N - 1][prev], max);\n }\n }\n\n out.println(max);\n }\n }\n\n /**\n * ?????????????????????????????¬????????§??????\n */\n public static void main(String[] args) throws Exception {\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner();\n PrintWriter out = new PrintWriter(outputStream);\n Task solver = new Task();\n solver.solve(in, out);\n out.close();\n }\n private static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int bufferLength = 0;\n\n private boolean hasNextByte() {\n if (ptr < bufferLength) {\n return true;\n } else {\n ptr = 0;\n try {\n bufferLength = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (bufferLength <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private void skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n }\n\n boolean hasNext() {\n skipUnprintable();\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextDoubleArray(m);\n }\n return map;\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) array[i] = nextInt();\n return array;\n }\n\n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) array[i] = nextLong();\n return array;\n }\n\n public String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) array[i] = next();\n return array;\n }\n\n public char[][] nextCharMap(int n) {\n char[][] array = new char[n][];\n for (int i = 0; i < n; i++) array[i] = next().toCharArray();\n return array;\n }\n\n public int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][];\n for (int i = 0; i < n; i++) {\n map[i] = nextIntArray(m);\n }\n return map;\n }\n }\n}", "problem_context": "Problem H: Hogemon Get\n\nProblem\n\nがっちょ君は人気のゲームHogemon Getに熱中している。がっちょ君が住んでいる会津国はそれぞれ1からNの番号がついているN個の町からなる。また、会津国にはM本の道があり、すべての道は異なる2つの町を結んでいる。がっちょ君は道を双方向に移動することができるが、道以外を通って、ある町から別の町に行くことはできない。\n\nHogemon Getでは、町iでボールをdi個入手することができる。ただし、ある町で再びボールを入手するためには、最後にその町でボールを入手してから15分以上経過している必要がある。なお、がっちょ君は町1、町Nを含むすべての町を何度でも訪れることができる。\n\nがっちょ君は最初、町1にいて、町NにR分以内で移動しなければならない。つまり、R分後に町Nにいる必要がある。がっちょ君は移動の際に、最大でいくつのボールを入手することができるだろうか。\n\nInput\n\n入力は以下の形式で与えられる。\n\nN M R\nd1 d2 ... dN\na1 b1 c1\na2 b2 c2\n...\naM bM cM\n\n入力はすべて整数である。\n\n1行目に町の個数N,道の本数M,制限時間Rが空白区切りで与えられる。\n\n2行目に町i(i=1,2,...,N)に訪れることで入手することができるボールの個数diが空白区切りで与えられる。\n\n3行目からM+2行目に道j(j=1,2,...,M)の情報aj,bj,cjが空白区切りで与えられる。j番目の道は町ajと町bjの間をcj分で移動できることを表す。\n\nConstraints\n\n3 ≤ N ≤ 30\n\nN-1 ≤ M ≤ min(N×(N-1)/2, 300)\n\n10 ≤ R ≤ 1000\n\n0 ≤ di ≤ 10\n\nd1 = dN = 0\n\n1 ≤ aj < bj ≤ N\n\n5 ≤ cj ≤ 100\n\n町1から町NへはR分以内で移動できることが保証されている\n\nある2つの町の組に対して2本以上の道があることはない\n\nOutput\n\n町1から町NへR分以内に移動するまでに入手することができる最大のボールの個数を1行で出力せよ。\n\nSample Input 1\n\n5 4 40\n0 1 1 1 0\n1 2 5\n2 3 5\n3 4 5\n4 5 5\n\nSample Output 1\n\n6\n\n経過時間(分)\n\n町の番号\n\nボールの数(個)\n\n0\n\n1\n\n0\n\n5\n\n2\n\n1\n\n10\n\n3\n\n2\n\n15\n\n4\n\n3\n\n20\n\n3\n\n3\n\n25\n\n2\n\n4\n\n30\n\n3\n\n5\n\n35\n\n4\n\n6\n\n40\n\n5\n\n6\n\n※経過時間20分の町3では最後に町3でボールを入手してから15分経過していないのでボールを入手することができない。\n\nSample Input 2\n\n4 3 100\n0 3 1 0\n1 2 5\n2 3 30\n3 4 5\n\nSample Output 2\n\n16\n\n経過時間(分)\n\n町の番号\n\nボールの数(個)\n\n0\n\n1\n\n0\n\n5\n\n2\n\n3\n\n20\n\n2\n\n6\n\n35\n\n2\n\n9\n\n50\n\n2\n\n12\n\n65\n\n2\n\n15\n\n95\n\n3\n\n16\n\n100\n\n4\n\n16\n\nSample Input 3\n\n5 4 50\n0 1 1 10 0\n1 2 10\n2 3 10\n2 4 10\n4 5 10\n\nSample Output 3\n\n22", "sample_input": "5 4 40\n0 1 1 1 0\n1 2 5\n2 3 5\n3 4 5\n4 5 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p01079", "source_text": "Problem H: Hogemon Get\n\nProblem\n\nがっちょ君は人気のゲームHogemon Getに熱中している。がっちょ君が住んでいる会津国はそれぞれ1からNの番号がついているN個の町からなる。また、会津国にはM本の道があり、すべての道は異なる2つの町を���んでいる。がっちょ君は道を双方向に移動することができるが、道以外を通って、ある町から別の町に行くことはできない。\n\nHogemon Getでは、町iでボールをdi個入手することができる。ただし、ある町で再びボールを入手するためには、最後にその町でボールを入手してから15分以上経過している必要がある。なお、がっちょ君は町1、町Nを含むすべての町を何度でも訪れることができる。\n\nがっちょ君は最初、町1にいて、町NにR分以内で移動しなければならない。つまり、R分後に町Nにいる必要がある。がっちょ君は移動の際に、最大でいくつのボールを入手することができるだろうか。\n\nInput\n\n入力は以下の形式で与えられる。\n\nN M R\nd1 d2 ... dN\na1 b1 c1\na2 b2 c2\n...\naM bM cM\n\n入力はすべて整数である。\n\n1行目に町の個数N,道の本数M,制限時間Rが空白区切りで与えられる。\n\n2行目に町i(i=1,2,...,N)に訪れることで入手することができるボールの個数diが空白区切りで与えられる。\n\n3行目からM+2行目に道j(j=1,2,...,M)の情報aj,bj,cjが空白区切りで与えられる。j番目の道は町ajと町bjの間をcj分で移動できることを表す。\n\nConstraints\n\n3 ≤ N ≤ 30\n\nN-1 ≤ M ≤ min(N×(N-1)/2, 300)\n\n10 ≤ R ≤ 1000\n\n0 ≤ di ≤ 10\n\nd1 = dN = 0\n\n1 ≤ aj < bj ≤ N\n\n5 ≤ cj ≤ 100\n\n町1から町NへはR分以内で移動できることが保証されている\n\nある2つの町の組に対して2本以上の道があることはない\n\nOutput\n\n町1から町NへR分以内に移動するまでに入手することができる最大のボールの個数を1行で出力せよ。\n\nSample Input 1\n\n5 4 40\n0 1 1 1 0\n1 2 5\n2 3 5\n3 4 5\n4 5 5\n\nSample Output 1\n\n6\n\n経過時間(分)\n\n町の番号\n\nボールの数(個)\n\n0\n\n1\n\n0\n\n5\n\n2\n\n1\n\n10\n\n3\n\n2\n\n15\n\n4\n\n3\n\n20\n\n3\n\n3\n\n25\n\n2\n\n4\n\n30\n\n3\n\n5\n\n35\n\n4\n\n6\n\n40\n\n5\n\n6\n\n※経過時間20分の町3では最後に町3でボールを入手してから15分経過していないのでボールを入手することができない。\n\nSample Input 2\n\n4 3 100\n0 3 1 0\n1 2 5\n2 3 30\n3 4 5\n\nSample Output 2\n\n16\n\n経過時間(分)\n\n町の番号\n\nボールの数(個)\n\n0\n\n1\n\n0\n\n5\n\n2\n\n3\n\n20\n\n2\n\n6\n\n35\n\n2\n\n9\n\n50\n\n2\n\n12\n\n65\n\n2\n\n15\n\n95\n\n3\n\n16\n\n100\n\n4\n\n16\n\nSample Input 3\n\n5 4 50\n0 1 1 10 0\n1 2 10\n2 3 10\n2 4 10\n4 5 10\n\nSample Output 3\n\n22", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6909, "cpu_time_ms": 50, "memory_kb": 24280}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s929074375", "group_id": "codeNet:p01085", "input_text": "import java.util.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint m, max, min;\n\t\twhile(true){\n\t\t\tm = sc.nextInt();\n\t\t\tmin = sc.nextInt();\n\t\t\tmax = sc.nextInt();\n\t\t\tsc.nextLine();\n\t\t\tif(m == 0) break;\n\n\t\t\tint[] array = new int[m];\n\t\t\tfor(int i = 0; i < m; i++){\n\t\t\t\tarray[i] = sc.nextInt();\n\t\t\t}\n\t\t\tsc.nextLine();\n\t\t\t\n\t\t\tint dif, gap=0, pos=0;\n\t\t\tfor(int i = min - 1; i < max; i++){\n\t\t\t\tdif = array[i] - array[i+1];\n\t\t\t\tif(gap <= dif){\n\t\t\t\t\tgap = dif;\n\t\t\t\t\tpos=i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(pos+1);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1498804224, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p01085.html", "problem_id": "p01085", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01085/input.txt", "sample_output_relpath": "derived/input_output/data/p01085/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01085/Java/s929074375.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s929074375", "user_id": "u879143834"}, "prompt_components": {"gold_output": "3\n4\n2\n2\n3\n2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint m, max, min;\n\t\twhile(true){\n\t\t\tm = sc.nextInt();\n\t\t\tmin = sc.nextInt();\n\t\t\tmax = sc.nextInt();\n\t\t\tsc.nextLine();\n\t\t\tif(m == 0) break;\n\n\t\t\tint[] array = new int[m];\n\t\t\tfor(int i = 0; i < m; i++){\n\t\t\t\tarray[i] = sc.nextInt();\n\t\t\t}\n\t\t\tsc.nextLine();\n\t\t\t\n\t\t\tint dif, gap=0, pos=0;\n\t\t\tfor(int i = min - 1; i < max; i++){\n\t\t\t\tdif = array[i] - array[i+1];\n\t\t\t\tif(gap <= dif){\n\t\t\t\t\tgap = dif;\n\t\t\t\t\tpos=i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(pos+1);\n\t\t}\n\t}\n}", "problem_context": "Entrance Examination\n\nThe International Competitive Programming College (ICPC) is famous\nfor its research on competitive programming.\nApplicants to the college are required to take its entrance examination.\n\nThe successful applicants of the examination are chosen as follows.\n\nThe score of any successful applicant is higher than that of any unsuccessful applicant.\n\nThe number of successful applicants n must be between nmin and nmax, inclusive.\nWe choose n within the specified range that maximizes the gap.\nHere, the gap means the difference between the lowest score of\nsuccessful applicants and the highest score of unsuccessful applicants.\n\nWhen two or more candidates for n make exactly the same gap,\nuse the greatest n among them.\n\nLet's see the first couple of examples given in Sample Input below.\nIn the first example, nmin and nmax are two and four, respectively, and there are five applicants whose scores are 100, 90, 82, 70, and 65.\nFor n of two, three and four, the gaps will be 8, 12, and 5, respectively.\nWe must choose three as n, because it maximizes the gap.\n\nIn the second example, nmin and nmax are two and four, respectively, and there are five applicants whose scores are 100, 90, 80, 75, and 65.\nFor n of two, three and four, the gap will be 10, 5, and 10,\nrespectively. Both two and four maximize the gap, and we must choose the\ngreatest number, four.\n\nYou are requested to write a program that computes the number of successful applicants that satisfies the conditions.\n\nInput\n\nThe input consists of multiple datasets. Each dataset is formatted as follows.\n\nm nmin nmax\n\nP1\n\nP2\n\n...\n\nPm\n\nThe first line of a dataset contains three integers separated by single spaces.\nm represents the number of applicants, nmin represents the minimum number of successful applicants, and nmax represents the maximum number of successful applicants.\nEach of the following m lines contains an integer\nPi, which represents the score of each applicant.\nThe scores are listed in descending order.\nThese numbers satisfy 0 < nmin < nmax < m ≤ 200, 0 ≤ Pi ≤ 10000 (1 ≤ i ≤ m) and Pnmin > Pnmax+1. These ensure that there always exists an n satisfying the conditions.\n\nThe end of the input is represented by a line containing three zeros separated by single spaces.\n\nOutput\n\nFor each dataset, output the number of successful applicants in a line.\n\nSample Input\n\n5 2 4\n100\n90\n82\n70\n65\n5 2 4\n100\n90\n80\n75\n65\n3 1 2\n5000\n4000\n3000\n4 2 3\n10000\n10000\n8000\n8000\n4 2 3\n10000\n10000\n10000\n8000\n5 2 3\n100\n80\n68\n60\n45\n0 0 0\n\nOutput for the Sample Input\n\n3\n4\n2\n2\n3\n2", "sample_input": "5 2 4\n100\n90\n82\n70\n65\n5 2 4\n100\n90\n80\n75\n65\n3 1 2\n5000\n4000\n3000\n4 2 3\n10000\n10000\n8000\n8000\n4 2 3\n10000\n10000\n10000\n8000\n5 2 3\n100\n80\n68\n60\n45\n0 0 0\n"}, "reference_outputs": ["3\n4\n2\n2\n3\n2\n"], "source_document_id": "p01085", "source_text": "Entrance Examination\n\nThe International Competitive Programming College (ICPC) is famous\nfor its research on competitive programming.\nApplicants to the college are required to take its entrance examination.\n\nThe successful applicants of the examination are chosen as follows.\n\nThe score of any successful applicant is higher than that of any unsuccessful applicant.\n\nThe number of successful applicants n must be between nmin and nmax, inclusive.\nWe choose n within the specified range that maximizes the gap.\nHere, the gap means the difference between the lowest score of\nsuccessful applicants and the highest score of unsuccessful applicants.\n\nWhen two or more candidates for n make exactly the same gap,\nuse the greatest n among them.\n\nLet's see the first couple of examples given in Sample Input below.\nIn the first example, nmin and nmax are two and four, respectively, and there are five applicants whose scores are 100, 90, 82, 70, and 65.\nFor n of two, three and four, the gaps will be 8, 12, and 5, respectively.\nWe must choose three as n, because it maximizes the gap.\n\nIn the second example, nmin and nmax are two and four, respectively, and there are five applicants whose scores are 100, 90, 80, 75, and 65.\nFor n of two, three and four, the gap will be 10, 5, and 10,\nrespectively. Both two and four maximize the gap, and we must choose the\ngreatest number, four.\n\nYou are requested to write a program that computes the number of successful applicants that satisfies the conditions.\n\nInput\n\nThe input consists of multiple datasets. Each dataset is formatted as follows.\n\nm nmin nmax\n\nP1\n\nP2\n\n...\n\nPm\n\nThe first line of a dataset contains three integers separated by single spaces.\nm represents the number of applicants, nmin represents the minimum number of successful applicants, and nmax represents the maximum number of successful applicants.\nEach of the following m lines contains an integer\nPi, which represents the score of each applicant.\nThe scores are listed in descending order.\nThese numbers satisfy 0 < nmin < nmax < m ≤ 200, 0 ≤ Pi ≤ 10000 (1 ≤ i ≤ m) and Pnmin > Pnmax+1. These ensure that there always exists an n satisfying the conditions.\n\nThe end of the input is represented by a line containing three zeros separated by single spaces.\n\nOutput\n\nFor each dataset, output the number of successful applicants in a line.\n\nSample Input\n\n5 2 4\n100\n90\n82\n70\n65\n5 2 4\n100\n90\n80\n75\n65\n3 1 2\n5000\n4000\n3000\n4 2 3\n10000\n10000\n8000\n8000\n4 2 3\n10000\n10000\n10000\n8000\n5 2 3\n100\n80\n68\n60\n45\n0 0 0\n\nOutput for the Sample Input\n\n3\n4\n2\n2\n3\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 575, "cpu_time_ms": 300, "memory_kb": 65220}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s400016307", "group_id": "codeNet:p01117", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\n\n/*\n期末試験の成績\n私は，中学校の教師である． ちょうど期末試験が終わったところで，すべての科目について全生徒の点数が手元にある．\nどれぐらい高い合計点を得た生徒がいるのか知りたいのだが，科目ごとの得点データになっているので，作業が容易でない．\nそこで，優秀なプログラマであるあなたに手助けしてほしい．\n具体的には，合計点が最も高い生徒の合計点を求めるプログラムを書いてほしい．\n\nInput\n入力は複数のデータセットからなる． 各データセットは次の形式で表される．\n\nn m\np1,1 p1,2 … p1,n\np2,1 p2,2 … p2,n\n…\npm,1 pm,2 … pm,n\nデータセットの最初の行は，二つの整数 n と m からなる．\nn は生徒の人数 (1 ≤ n ≤ 1000)，m は科目数 (1 ≤ m ≤ 50) である．\nそれに続く m 行のそれぞれには，特定の科目に対する n 人の生徒の得点がある．\npj,k は，生徒 k の科目 j に対する得点を表す整数である (1 ≤ j ≤ m，1 ≤ k ≤ n)．\nこの値は，0 ≤ pj,k ≤ 1000 を満たす．\n\n入力の終わりは二つのゼロからなる行で表される． データセットの個数は 100 を超えない．\n\nOutput\n各データセットについて，合計点が最も高い生徒の合計点を出力せよ．\n生徒 k の合計点 sk とは sk = p1,k + … + pm,k のことである．\n\nSample Input\n5 2\n10 20 30 40 50\n15 25 35 45 55\n6 3\n10 20 30 15 25 35\n21 34 11 52 20 18\n31 15 42 10 21 19\n4 2\n0 0 0 0\n0 0 0 0\n0 0\nOutput for the Sample Input\n105\n83\n0\n\n */\n\n/**\n * URL\n * http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1632&lang=ja\n */\n\nclass Main {\n\n\tpublic static void main(String[] args) throws Exception {\n\t\ttry (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) {\n\t\t\tInteger numDataSet = 0;\n\t\t\tString[] data;\n\t\t\tInteger numStudent;\n\t\t\tInteger numSubject;\n\t\t\tInteger[] total;\n\t\t\tString[] point;\n\t\t\tInteger max;\n\t\t\tInteger[] result = new Integer[100];\n\n\t\t\twhile(true){\n\t\t\t\tdata = reader.readLine().split(\" \");\n\t\t\t\tnumStudent = Integer.parseInt(data[0]);\n\t\t\t\tnumSubject = Integer.parseInt(data[1]);\n\t\t\t\t// 生徒数と科目数がどちらも0の場合、ループを抜ける\n\t\t\t\tif(numStudent == 0 && numSubject == 0) break;\n\n\t\t\t\ttotal = new Integer[numStudent];\n\n\t\t\t\t// 科目の数分ループ\n\t\t\t\tfor(int i=0;i max) max = val;\n\t\t\t\t}\n\n\t\t\t\tresult[numDataSet] = max;\n\t\t\t\tnumDataSet++;\n\n\t\t\t}\n\n\t\t\tfor(int i=0;i max) max = val;\n\t\t\t\t}\n\n\t\t\t\tresult[numDataSet] = max;\n\t\t\t\tnumDataSet++;\n\n\t\t\t}\n\n\t\t\tfor(int i=0;i0)return false;\n\t\tif(ex(b, a, s)*ex(b, a, t)>0)return false;\n\t\tif(ex(s, t, a)*ex(s, t, b)>0)return false;\n\t\treturn ex(t, s, a)*ex(t, s, b) s = new HashSet

();\n\t\t\t\tfor(int j=0;j0)return false;\n\t\tif(ex(b, a, s)*ex(b, a, t)>0)return false;\n\t\tif(ex(s, t, a)*ex(s, t, b)>0)return false;\n\t\treturn ex(t, s, a)*ex(t, s, b) s = new HashSet

();\n\t\t\t\tfor(int j=0;j= 10-10となるような交点の組 P、Q、R は存在しない。\n\nSample Input\n\n2\n-100 -20 100 20\n-20 -100 20 100\n2\n-100 -20 -20 -100\n20 100 100 20\n0\n\nOutput for the Sample Input\n\n4\n3", "sample_input": "2\n-100 -20 100 20\n-20 -100 20 100\n2\n-100 -20 -20 -100\n20 100 100 20\n0\n"}, "reference_outputs": ["4\n3\n"], "source_document_id": "p01134", "source_text": "Problem D: Area Separation\n\nMr. Yamada Springfield Tanaka は、国家区画整理事業局局長補佐代理という大任を任されていた。\n現在、彼の国は大規模な区画整理の最中であり、この区画整理をスムーズに終わらせることができたならば彼の昇進は間違いなしであるとされている。\n\nところが、そんな彼の出世を快く思わない者も多くいるのだ。 そんな人間の 1 人に、Mr.Sato Seabreeze Suzuki がいた。\n彼は、ことあるごとに Mr. Yamada の足を引っ張ろうと画策してきた。 今回も Mr. Sato は足を引っ張るために、実際の区画整理を担当している組織に圧力をかけて、区画整理の結果を非常に分かりにくいものにしてしまった。\n\nそのため、Mr. Yamada に渡された結果は、 ある正方形の土地をどの直線で分割したかという情報のみになっていた。\n最低限、その正方形の土地がいくつに分割されたかだけでも分からなければ、Mr. Yamada は昇進どころか解雇されること間違いなしである。\n\nあなたの仕事は、(-100,-100)、(100,-100)、(100,100)、(-100,100) を頂点とする正方形領域が、与えられた n 本の直線によっていくつに分割されているかを調べるプログラムを書いて、Mr. Yamada を解雇の危機から救うことである。\n\nInput\n\n入力は複数のテストケースからなる。\n\nそれぞれのテストケースの最初の行では、直線数を表す整数 n が与えられる（1 <= n <= 100）。 その後の n 行にはそれぞれ 4 つの整数 x1 、y1 、 x2 、y2 が含まれる。\nこれらの整数は直線上の相異なる 2 点 (x1 , y1 ) と (x2 , y2 ) を表す。\n与えられる 2 点は常に正方形の辺上の点であることが保証されている。 与えられる n 本の直線は互いに異なり、直線同士が重なることはない。 また、直線が正方形の辺と重なることもない。\n\n入力の終了は n = 0 で表される。\n\nOutput\n\nそれぞれのテストケースについて、n 本の直線によって分割された領域の数を 1 行で出力せよ。\n\nなお、距離が 10-10 未満の 2 点は一致すると���なしてよい。 また、|PQ| < 10-10、|QR| < 10-10 でかつ |PR| >= 10-10となるような交点の組 P、Q、R は存在しない。\n\nSample Input\n\n2\n-100 -20 100 20\n-20 -100 20 100\n2\n-100 -20 -20 -100\n20 100 100 20\n0\n\nOutput for the Sample Input\n\n4\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2805, "cpu_time_ms": 470, "memory_kb": 13000}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s315238087", "group_id": "codeNet:p01270", "input_text": "\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport static java.lang.Math.*;\nimport static java.lang.System.*;\n\nclass Main {\n\tpublic static Scanner sc = new Scanner(in);\n\t//public static Random rand=new Random();\n\n\tstatic final int INF =1<<30;\n\n\tstatic class S{\n\t\tlong id,s,e;\n\t\tS(long _id,long _s,long _e){\n\t\t\tid=_id;s=_s;e=_e;\n\t\t}\n\t}\n\n\tpublic void run() {\n\t\tCase:while(true){\n\t\t\tint N=sc.nextInt();\n\t\t\tif(N==0)return;\n\n\t\t\tLinkedList segs=new LinkedList();\n\t\t\tfor(int i=0;i tmp=new LinkedList();\n\t\t\t\t\tlong s=0,e=len;\n\t\t\t\t\twhile(!segs.isEmpty()){\n\t\t\t\t\t\tS seg=segs.poll();\n\t\t\t\t\t\tif(len==0){\n\t\t\t\t\t\t\ttmp.add(seg);\n\t\t\t\t\t\t\twhile(!segs.isEmpty())\n\t\t\t\t\t\t\t\ttmp.add(segs.poll());\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(seg.s>s){\n\t\t\t\t\t\t\te=min(s+len,seg.s);\n\t\t\t\t\t\t\tlen-=e-s;\n\t\t\t\t\t\t\ttmp.add(new S(id,s,e));\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttmp.add(seg);\n\t\t\t\t\t\ts=seg.e;\n\t\t\t\t\t}\n\t\t\t\t\tif(len!=0)tmp.add(new S(id,s,s+len));\n\t\t\t\t\tsegs.clear();segs.addAll(tmp);\n\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'D':\n\t\t\t\t\tid=sc.nextInt();\n\t\t\t\t\ttmp=new LinkedList();\n\t\t\t\t\twhile(!segs.isEmpty()){\n\t\t\t\t\t\tS seg=segs.poll();\n\t\t\t\t\t\tif(seg.id!=id)\n\t\t\t\t\t\t\ttmp.add(seg);\n\t\t\t\t\t}\n\t\t\t\t\tsegs.clear();segs.addAll(tmp);\n\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'R':\n\t\t\t\t\tint p=sc.nextInt();\n\t\t\t\t\tboolean ex=false;\n\t\t\t\t\tfor(S seg:segs){\n\t\t\t\t\t\tif(seg.s<=p && p String str(Map map){\n\t\tStringBuilder sb=new StringBuilder();\n\t\tboolean isFirst=true;\n\t\tfor(Entry set:map.entrySet()){\n\t\t\tif(!isFirst)sb.append(br);\n\t\t\tsb.append(str(set.getKey())).append(\":\").append(str(set.getValue()));\n\t\t\tisFirst=false;\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tstatic String str(Collection list){\n\t\tStringBuilder sb=new StringBuilder();\n\t\tboolean isFirst=true;\n\t\tfor(E e:list){\n\t\t\tif(!isFirst)sb.append(\" \");\n\t\t\tsb.append(str(e));\n\t\t\tisFirst=false;\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tstatic String str(Object o){\n\t\tint depth=_getArrayDepth(o);\n\t\tif(depth>0)return _strArray(o,depth);\n\t\tClass c=o.getClass();\n\t\tif(c.equals(Boolean.class))return str((Boolean)o);\n\t\t//if(c.equals(Double.class))return str((Double)o);\n\n\t\treturn o.toString();\n\t}\n\tstatic int _getArrayDepth(Object o){\n\t\tif(!o.getClass().isArray() || Array.getLength(o)==0) return 0;\n\t\treturn \t1+_getArrayDepth(Array.get(o,0));\n\t}\n\tstatic String _strArray(Object o,int depth){\n\t\tif(depth==0) return str(o);\n\t\tStringBuilder sb=new StringBuilder();\n\t\tfor(int i=0,len=Array.getLength(o);i segs=new LinkedList();\n\t\t\tfor(int i=0;i tmp=new LinkedList();\n\t\t\t\t\tlong s=0,e=len;\n\t\t\t\t\twhile(!segs.isEmpty()){\n\t\t\t\t\t\tS seg=segs.poll();\n\t\t\t\t\t\tif(len==0){\n\t\t\t\t\t\t\ttmp.add(seg);\n\t\t\t\t\t\t\twhile(!segs.isEmpty())\n\t\t\t\t\t\t\t\ttmp.add(segs.poll());\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(seg.s>s){\n\t\t\t\t\t\t\te=min(s+len,seg.s);\n\t\t\t\t\t\t\tlen-=e-s;\n\t\t\t\t\t\t\ttmp.add(new S(id,s,e));\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttmp.add(seg);\n\t\t\t\t\t\ts=seg.e;\n\t\t\t\t\t}\n\t\t\t\t\tif(len!=0)tmp.add(new S(id,s,s+len));\n\t\t\t\t\tsegs.clear();segs.addAll(tmp);\n\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'D':\n\t\t\t\t\tid=sc.nextInt();\n\t\t\t\t\ttmp=new LinkedList();\n\t\t\t\t\twhile(!segs.isEmpty()){\n\t\t\t\t\t\tS seg=segs.poll();\n\t\t\t\t\t\tif(seg.id!=id)\n\t\t\t\t\t\t\ttmp.add(seg);\n\t\t\t\t\t}\n\t\t\t\t\tsegs.clear();segs.addAll(tmp);\n\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'R':\n\t\t\t\t\tint p=sc.nextInt();\n\t\t\t\t\tboolean ex=false;\n\t\t\t\t\tfor(S seg:segs){\n\t\t\t\t\t\tif(seg.s<=p && p String str(Map map){\n\t\tStringBuilder sb=new StringBuilder();\n\t\tboolean isFirst=true;\n\t\tfor(Entry set:map.entrySet()){\n\t\t\tif(!isFirst)sb.append(br);\n\t\t\tsb.append(str(set.getKey())).append(\":\").append(str(set.getValue()));\n\t\t\tisFirst=false;\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tstatic String str(Collection list){\n\t\tStringBuilder sb=new StringBuilder();\n\t\tboolean isFirst=true;\n\t\tfor(E e:list){\n\t\t\tif(!isFirst)sb.append(\" \");\n\t\t\tsb.append(str(e));\n\t\t\tisFirst=false;\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tstatic String str(Object o){\n\t\tint depth=_getArrayDepth(o);\n\t\tif(depth>0)return _strArray(o,depth);\n\t\tClass c=o.getClass();\n\t\tif(c.equals(Boolean.class))return str((Boolean)o);\n\t\t//if(c.equals(Double.class))return str((Double)o);\n\n\t\treturn o.toString();\n\t}\n\tstatic int _getArrayDepth(Object o){\n\t\tif(!o.getClass().isArray() || Array.getLength(o)==0) return 0;\n\t\treturn \t1+_getArrayDepth(Array.get(o,0));\n\t}\n\tstatic String _strArray(Object o,int depth){\n\t\tif(depth==0) return str(o);\n\t\tStringBuilder sb=new StringBuilder();\n\t\tfor(int i=0,len=Array.getLength(o);i() {\n public int compare(Plant o1, Plant o2) {\n if( Math.abs(o1.v - o2.v) < 1e-9) {\n return o1.name.compareTo( o2.name );\n }\n else if ( o1.v < o2.v ) {\n return 1;\n } else {\n return -1;\n }\n }\n } );\n\n for ( Plant v : list ) {\n System.out.println( v.name );\n }\n System.out.println( \"#\" );\n }\n }\n\n Main() {\n sc = new Scanner( System.in );\n }\n\n int ni() {\n return sc.nextInt();\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n void debug(Object... os) {\n System.err.println( Arrays.deepToString( os ) );\n }\n\n}", "language": "Java", "metadata": {"date": 1433405821, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p01315.html", "problem_id": "p01315", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01315/input.txt", "sample_output_relpath": "derived/input_output/data/p01315/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01315/Java/s422040589.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s422040589", "user_id": "u948800138"}, "prompt_components": {"gold_output": "eggplant\napple\ncarrot\nbanana\ndurian\n#\nenoki\nonion\npotato\ntomato\n#\nb\nc\na\n#\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Scanner;\n\npublic class Main {\n Scanner sc;\n\n class Plant {\n String name;\n double v;\n\n Plant(String s, double c) {\n name = s;\n v = c;\n }\n }\n\n int pow(int n, int r) {\n if ( r == 0 ) {\n return 1;\n } else {\n return n * pow( n, r - 1 );\n }\n }\n\n void run() {\n for ( ;; ) {\n int n = ni();\n if ( n == 0 ) {\n break;\n }\n\n Plant[] list = new Plant[n];\n for ( int i = 0; i < n; ++i ) {\n String l = sc.next();\n int p, a, b, c, d, e, f, s, m;\n p = ni();\n a = ni();\n b = ni();\n c = ni();\n d = ni();\n e = ni();\n f = ni();\n s = ni();\n m = ni();\n\n int v = 0;\n int time = 0;\n time += ( a + b + c );\n time += ( d + e ) * m;\n v += s * f * m;\n v -= p;\n\n list[ i ] = new Plant( l, ((double) v) / time );\n }\n\n Arrays.sort( list, new Comparator() {\n public int compare(Plant o1, Plant o2) {\n if( Math.abs(o1.v - o2.v) < 1e-9) {\n return o1.name.compareTo( o2.name );\n }\n else if ( o1.v < o2.v ) {\n return 1;\n } else {\n return -1;\n }\n }\n } );\n\n for ( Plant v : list ) {\n System.out.println( v.name );\n }\n System.out.println( \"#\" );\n }\n }\n\n Main() {\n sc = new Scanner( System.in );\n }\n\n int ni() {\n return sc.nextInt();\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n void debug(Object... os) {\n System.err.println( Arrays.deepToString( os ) );\n }\n\n}", "problem_context": "Problem B: Moonlight Farm\n\nあなたは大人気webゲーム「ムーンライト牧場」に熱中している．このゲームの目的は，畑で作物を育て，それらを売却して収入を得て，その収入によって牧場を大きくしていくことである．\n\nあなたは速く畑を大きくしたいと考えた．そこで手始めにゲーム中で育てることのできる作物を，時間あたりの収入効率にもとづいて並べることにした．\n\n作物を育てるには種を買わなければならない．ここで作物 i の種の名前は Li ，値段は Pi でそれぞれ与えられる．畑に種を植えると時間 Ai 後に芽が出る．芽が出てから時間 Bi 後に若葉が出る．若葉が出てから時間 Ci 後に葉が茂る．葉が茂ってから時間 Di 後に花が咲く．花が咲いてから時間 Ei 後に実が成る．一つの種から Fi 個の実が成り，それらの実は一つあたりSi の価格で売れる．一部の作物は多期作であり，計 Mi 回実をつける．単期作の場合は Mi = 1で表される．多期作の作物は，Mi 回目の実が成るまでは，実が成ったあと葉に戻る．ある種に対する収入は，その種から成った全ての実を売った金額から，種の値段を引いた値である．また，その種の収入効率は，その収入を，種を植えてから全ての実が成り終わるまでの時間で割った値である．\n\nあなたの仕事は，入力として与えられる作物の情報に対して，それらを収入効率の降順に並べ替えて出力するプログラムを書くことである．\n\nInput\n\n入力はデータセットの列であり，各データセットは次のような形式で与えられる．\n\nN\n\nL1 P1 A1 B1\nC1 D1 E1 F1\nS1 M1\n\nL2 P2 A2 B2\nC2 D2 E2 F2\nS2 M2\n\n...\n\nLN PN AN BN\nCN DN EN FN\nSN MN\n\n一行目はデータセットに含まれる作物の数 N である (1 ≤ N ≤ 50)．\n\nこれに続く N 行には，各行に一つの作物の情報が含まれる．各変数の意味は問題文中で述べた通りである．作物の名前 Li はアルファベット小文字のみからなる20文字以内の文字列であり，また 1 ≤ Pi , Ai , Bi , Ci , Di , Ei , Fi , Si ≤ 100, 1 ≤ Mi ≤ 5である．一つのケース内に同一の名前を持つ作物は存在しないと仮定して良い．\n\n入力の終りはゼロを一つだけ含む行で表される．\n\nOutput\n\n各データセットについて，各行に一つ，作物の名前を収入効率の降順に出力せよ．収入効率が同じ作物に対しては，それらの名前を辞書順の昇順に出力せよ．\n\n各データセットの出力の後には“#”のみからなる1行を出力すること．\n\nSample Input\n\n5\napple 1 1 1 1 1 1 1 10 1\nbanana 1 2 2 2 2 2 1 10 1\ncarrot 1 2 2 2 2 2 1 10 2\ndurian 1 3 3 3 3 3 1 10 1\neggplant 1 3 3 3 3 3 1 100 1\n4\nenoki 1 3 3 3 3 3 1 10 1\ntomato 1 3 3 3 3 3 1 10 1\npotato 1 3 3 3 3 3 1 10 1\nonion 1 3 3 3 3 3 1 10 1\n3\na 10 1 1 1 1 1 1 10 1\nb 10 2 2 2 2 2 2 10 1\nc 10 2 2 2 2 2 2 10 1\n0\n\nOutput for the Sample Input\n\neggplant\napple\ncarrot\nbanana\ndurian\n#\nenoki\nonion\npotato\ntomato\n#\nb\nc\na\n#", "sample_input": "5\napple 1 1 1 1 1 1 1 10 1\nbanana 1 2 2 2 2 2 1 10 1\ncarrot 1 2 2 2 2 2 1 10 2\ndurian 1 3 3 3 3 3 1 10 1\neggplant 1 3 3 3 3 3 1 100 1\n4\nenoki 1 3 3 3 3 3 1 10 1\ntomato 1 3 3 3 3 3 1 10 1\npotato 1 3 3 3 3 3 1 10 1\nonion 1 3 3 3 3 3 1 10 1\n3\na 10 1 1 1 1 1 1 10 1\nb 10 2 2 2 2 2 2 10 1\nc 10 2 2 2 2 2 2 10 1\n0\n"}, "reference_outputs": ["eggplant\napple\ncarrot\nbanana\ndurian\n#\nenoki\nonion\npotato\ntomato\n#\nb\nc\na\n#\n"], "source_document_id": "p01315", "source_text": "Problem B: Moonlight Farm\n\nあなたは大人気webゲーム「ムーンライト牧場」に熱中している．このゲームの目的は，畑で作物を育て，それらを売��して収入を得て，その収入によって牧場を大きくしていくことである．\n\nあなたは速く畑を大きくしたいと考えた．そこで手始めにゲーム中で育てることのできる作物を，時間あたりの収入効率にもとづいて並べることにした．\n\n作物を育てるには種を買わなければならない．ここで作物 i の種の名前は Li ，値段は Pi でそれぞれ与えられる．畑に種を植えると時間 Ai 後に芽が出る．芽が出てから時間 Bi 後に若葉が出る．若葉が出てから時間 Ci 後に葉が茂る．葉が茂ってから時間 Di 後に花が咲く．花が咲いてから時間 Ei 後に実が成る．一つの種から Fi 個の実が成り，それらの実は一つあたりSi の価格で売れる．一部の作物は多期作であり，計 Mi 回実をつける．単期作の場合は Mi = 1で表される．多期作の作物は，Mi 回目の実が成るまでは，実が成ったあと葉に戻る．ある種に対する収入は，その種から成った全ての実を売った金額から，種の値段を引いた値である．また，その種の収入効率は，その収入を，種を植えてから全ての実が成り終わるまでの時間で割った値である．\n\nあなたの仕事は，入力として与えられる作物の情報に対して，それらを収入効率の降順に並べ替えて出力するプログラムを書くことである．\n\nInput\n\n入力はデータセットの列であり，各データセットは次のような形式で与えられる．\n\nN\n\nL1 P1 A1 B1\nC1 D1 E1 F1\nS1 M1\n\nL2 P2 A2 B2\nC2 D2 E2 F2\nS2 M2\n\n...\n\nLN PN AN BN\nCN DN EN FN\nSN MN\n\n一行目はデータセットに含まれる作物の数 N である (1 ≤ N ≤ 50)．\n\nこれに続く N 行には，各行に一つの作物の情報が含まれる．各変数の意味は問題文中で述べた通りである．作物の名前 Li はアルファベット小文字のみからなる20文字以内の文字列であり，また 1 ≤ Pi , Ai , Bi , Ci , Di , Ei , Fi , Si ≤ 100, 1 ≤ Mi ≤ 5である．一つのケース内に同一の名前を持つ作物は存在しないと仮定して良い．\n\n入力の終りはゼロを一つだけ含む行で表される．\n\nOutput\n\n各データセットについて，各行に一つ，作物の名前を収入効率の降順に出力せよ．収入効率が同じ作物に対しては，それらの名前を辞書順の昇順に出力せよ．\n\n各データセットの出力の後には“#”のみからなる1行を出力すること．\n\nSample Input\n\n5\napple 1 1 1 1 1 1 1 10 1\nbanana 1 2 2 2 2 2 1 10 1\ncarrot 1 2 2 2 2 2 1 10 2\ndurian 1 3 3 3 3 3 1 10 1\neggplant 1 3 3 3 3 3 1 100 1\n4\nenoki 1 3 3 3 3 3 1 10 1\ntomato 1 3 3 3 3 3 1 10 1\npotato 1 3 3 3 3 3 1 10 1\nonion 1 3 3 3 3 3 1 10 1\n3\na 10 1 1 1 1 1 1 10 1\nb 10 2 2 2 2 2 2 10 1\nc 10 2 2 2 2 2 2 10 1\n0\n\nOutput for the Sample Input\n\neggplant\napple\ncarrot\nbanana\ndurian\n#\nenoki\nonion\npotato\ntomato\n#\nb\nc\na\n#", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1683, "cpu_time_ms": 260, "memory_kb": 38120}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s499461263", "group_id": "codeNet:p01322", "input_text": "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\n\t\twhile(true){\n\t\t\tint n = sc.nextInt();\n\t\t\tint m = sc.nextInt();\n\t\t\tif(n == 0 && m == 0) break;\n\n\t\t\tHashMap map = new HashMap();\n\t\t\tfor(int i=0;i map = new HashMap();\n\t\t\tfor(int i=0;i list1=candidate(ps[0]);\n\t\tArrayList list2=candidate(ps[1]);\n\t\tArrayList list3=candidate(ps[2]);\n\t\tArrayList list4=candidate(ps[3]);\n\t\tif(list1.size()>1000){\n\t\t\t// new int[]{}[0]=0;\n\t\t\tStringBuilder sb=new StringBuilder();\n\t\t\tsb.append(n).append('\\n');\n\t\t\tfor(int i=0;i0){\n\t\t\t\t\t\t\tmin=min(min, res);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(min candidate(long p){\n\t\tArrayList list=new ArrayList();\n\t\tfor(int i=0; i>>1, mod);\n\t\treturn (x+mulMod(x, y-1, mod))%mod;\n\t}\n\n\tlong powMod(long x, long k, long mod){\n\t\tif(k==0){\n\t\t\treturn 1%mod;\n\t\t}\n\t\tif(k%2==0){\n\t\t\t// return powMod(x*x%mod, k>>>1, mod);\n\t\t\treturn powMod(mulMod(x, x, mod), k>>>1, mod);\n\t\t}\n\t\t// return x*powMod(x, k-1, mod)%mod;\n\t\treturn mulMod(x, powMod(x, k-1, mod), mod);\n\t}\n\n\tlong f(long x, long mod){\n\t\tlong val=0;\n\t\tfor(int i=0; i0){\n\t\t\t\tval=(val+bs[i]%mod*as[i]%mod*powMod(x, bs[i]-1, mod)%mod)%mod;\n\t\t\t}\n\t\t}\n\t\treturn val;\n\t}\n\n\tlong nextPrime(long n){\n\t\tfor(n++; !BigInteger.valueOf(n).isProbablePrime(200); n++);\n\t\treturn n;\n\t}\n\n\tvoid debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tvoid print(String s){\n\t\tSystem.out.print(s);\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tnew Main().run();\n\t}\n}", "language": "Java", "metadata": {"date": 1364049954, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p01569.html", "problem_id": "p01569", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01569/input.txt", "sample_output_relpath": "derived/input_output/data/p01569/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01569/Java/s903356172.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s903356172", "user_id": "u660498157"}, "prompt_components": {"gold_output": "Yes 2\n", "input_to_evaluate": "import java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport static java.util.Collections.*;\n\npublic class Main{\n\tScanner sc=new Scanner(System.in);\n\n\tlong INF=1L<<60;\n\tdouble EPS=1e-12;\n\n\tint n;\n\tlong[] as, bs;\n\n\tvoid run() throws Exception{\n\t\tn=sc.nextInt();\n\t\tas=new long[n];\n\t\tbs=new long[n];\n\t\tfor(int i=0; i list1=candidate(ps[0]);\n\t\tArrayList list2=candidate(ps[1]);\n\t\tArrayList list3=candidate(ps[2]);\n\t\tArrayList list4=candidate(ps[3]);\n\t\tif(list1.size()>1000){\n\t\t\t// new int[]{}[0]=0;\n\t\t\tStringBuilder sb=new StringBuilder();\n\t\t\tsb.append(n).append('\\n');\n\t\t\tfor(int i=0;i0){\n\t\t\t\t\t\t\tmin=min(min, res);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(min candidate(long p){\n\t\tArrayList list=new ArrayList();\n\t\tfor(int i=0; i>>1, mod);\n\t\treturn (x+mulMod(x, y-1, mod))%mod;\n\t}\n\n\tlong powMod(long x, long k, long mod){\n\t\tif(k==0){\n\t\t\treturn 1%mod;\n\t\t}\n\t\tif(k%2==0){\n\t\t\t// return powMod(x*x%mod, k>>>1, mod);\n\t\t\treturn powMod(mulMod(x, x, mod), k>>>1, mod);\n\t\t}\n\t\t// return x*powMod(x, k-1, mod)%mod;\n\t\treturn mulMod(x, powMod(x, k-1, mod), mod);\n\t}\n\n\tlong f(long x, long mod){\n\t\tlong val=0;\n\t\tfor(int i=0; i0){\n\t\t\t\tval=(val+bs[i]%mod*as[i]%mod*powMod(x, bs[i]-1, mod)%mod)%mod;\n\t\t\t}\n\t\t}\n\t\treturn val;\n\t}\n\n\tlong nextPrime(long n){\n\t\tfor(n++; !BigInteger.valueOf(n).isProbablePrime(200); n++);\n\t\treturn n;\n\t}\n\n\tvoid debug(Object... os){\n\t\tSystem.err.println(Arrays.deepToString(os));\n\t}\n\n\tvoid print(String s){\n\t\tSystem.out.print(s);\n\t}\n\n\tvoid println(String s){\n\t\tSystem.out.println(s);\n\t}\n\n\tpublic static void main(String[] args) throws Exception{\n\t\tnew Main().run();\n\t}\n}", "problem_context": "Sun and Moon\n\nIn the year 20XX, mankind is hit by an unprecedented crisis.\nThe power balance between the sun and the moon was broken by the total eclipse of the sun, and the end is looming!\nTo save the world, the secret society called \"Sun and Moon\" decided to perform the ritual to balance the power of the sun and the moon called \"Ritual of Sun and Moon\".\n\nThe ritual consists of \"Ritual of Sun\" and \"Ritual of Moon\". \"Ritual of Moon\" is performed after \"Ritual of Sun\".\nA member of the society is divided into two groups, \"Messengers of Sun\" and \"Messengers of Moon\".\nEach member has some offerings and magic power.\n\nFirst, the society performs \"Ritual of Sun\".\nIn the ritual, each member sacrifices an offering.\nIf he can not sacrifice an offering here, he will be killed.\nAfter the sacrifice, his magic power is multiplied by the original number of his offerings.\nEach member must perform the sacrifice just once.\n\nSecond, the society performs \"Ritual of Moon\".\nIn the ritual, each member sacrifices all remaining offerings.\nAfter the sacrifice, his magic power is multiplied by xp.\nHere x is the number of days from the eclipse (the eclipse is 0th day) and p is the number of his sacrificed offerings.\nEach member must perform the sacrifice just once.\n\nAfter two rituals, all \"Messengers of Sun\" and \"Messengers of Moon\" give all magic power to the \"magical reactor\".\nIf the total power of \"Messengers of Sun\" and the total power of \"Messengers of Moon\" are equal,\nthe society will succeed in the ritual and save the world.\n\nIt is very expensive to perform \"Ritual of Sun\".\nIt may not be able to perform \"Ritual of Sun\" because the society is in financial trouble.\nPlease write a program to calculate the minimum number of days from the eclipse in which the society can succeed in \"Ritual of Sun and Moon\" whether \"Ritual of Sun\" can be performed or not.\nThe society cannot perform the ritual on the eclipse day (0-th day).\n\nInput\n\nThe format of the input is as follows.\n\nN\nO1 P1\n...\nON PN\n\nThe first line contains an integer N that is the number of members of the society (0 ≤ N ≤ 1,000).\n\nEach of the following N lines contains two integers Oi (0 ≤ Oi ≤ 1,000,000,000) and Pi (1 ≤ |Pi| ≤ 1,000,000,000,000,000).\nOi is the number of the i-th member's offerings and |Pi| is the strength of his magic power.\nIf Pi is a positive integer, the i-th member belongs to \"Messengers of Sun\", otherwise he belongs to \"Messengers of Moon\".\n\nOutput\n\nIf there exists the number of days from the eclipse that satisfies the above condition , print the minimum number of days preceded by \"Yes \".\nOtherwise print \"No\".\n\nOf course, the answer must be a positive integer.\n\nSample Input 1\n\n9\n2 1\n1 -1\n1 -1\n1 -1\n1 -1\n0 1\n0 1\n0 1\n0 1\n\nOutput for the Sample Input 1\n\nYes 2\n\nSample Input 2\n\n2\n1 1\n0 -1\n\nOutput for the Sample Input 2\n\nNo", "sample_input": "9\n2 1\n1 -1\n1 -1\n1 -1\n1 -1\n0 1\n0 1\n0 1\n0 1\n"}, "reference_outputs": ["Yes 2\n"], "source_document_id": "p01569", "source_text": "Sun and Moon\n\nIn the year 20XX, mankind is hit by an unprecedented crisis.\nThe power balance between the sun and the moon was broken by the total eclipse of the sun, and the end is looming!\nTo save the world, the secret society called \"Sun and Moon\" decided to perform the ritual to balance the power of the sun and the moon called \"Ritual of Sun and Moon\".\n\nThe ritual consists of \"Ritual of Sun\" and \"Ritual of Moon\". \"Ritual of Moon\" is performed after \"Ritual of Sun\".\nA member of the society is divided into two groups, \"Messengers of Sun\" and \"Messengers of Moon\".\nEach member has some offerings and magic power.\n\nFirst, the society performs \"Ritual of Sun\".\nIn the ritual, each member sacrifices an offering.\nIf he can not sacrifice an offering here, he will be killed.\nAfter the sacrifice, his magic power is multiplied by the original number of his offerings.\nEach member must perform the sacrifice just once.\n\nSecond, the society performs \"Ritual of Moon\".\nIn the ritual, each member sacrifices all remaining offerings.\nAfter the sacrifice, his magic power is multiplied by xp.\nHere x is the number of days from the eclipse (the eclipse is 0th day) and p is the number of his sacrificed offerings.\nEach member must perform the sacrifice just once.\n\nAfter two rituals, all \"Messengers of Sun\" and \"Messengers of Moon\" give all magic power to the \"magical reactor\".\nIf the total power of \"Messengers of Sun\" and the total power of \"Messengers of Moon\" are equal,\nthe society will succeed in the ritual and save the world.\n\nIt is very expensive to perform \"Ritual of Sun\".\nIt may not be able to perform \"Ritual of Sun\" because the society is in financial trouble.\nPlease write a program to calculate the minimum number of days from the eclipse in which the society can succeed in \"Ritual of Sun and Moon\" whether \"Ritual of Sun\" can be performed or not.\nThe society cannot perform the ritual on the eclipse day (0-th day).\n\nInput\n\nThe format of the input is as follows.\n\nN\nO1 P1\n...\nON PN\n\nThe first line contains an integer N that is the number of members of the society (0 ≤ N ≤ 1,000).\n\nEach of the following N lines contains two integers Oi (0 ≤ Oi ≤ 1,000,000,000) and Pi (1 ≤ |Pi| ≤ 1,000,000,000,000,000).\nOi is the number of the i-th member's offerings and |Pi| is the strength of his magic power.\nIf Pi is a positive integer, the i-th member belongs to \"Messengers of Sun\", otherwise he belongs to \"Messengers of Moon\".\n\nOutput\n\nIf there exists the number of days from the eclipse that satisfies the above condition , print the minimum number of days preceded by \"Yes \".\nOtherwise print \"No\".\n\nOf course, the answer must be a positive integer.\n\nSample Input 1\n\n9\n2 1\n1 -1\n1 -1\n1 -1\n1 -1\n0 1\n0 1\n0 1\n0 1\n\nOutput for the Sample Input 1\n\nYes 2\n\nSample Input 2\n\n2\n1 1\n0 -1\n\nOutput for the Sample Input 2\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4557, "cpu_time_ms": 20000, "memory_kb": 26704}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s923342007", "group_id": "codeNet:p01621", "input_text": "import java.util.*;\n\npublic class Main {\n\tstatic boolean[] list;\n\tstatic HashMap daylist;\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\twhile (true) {\n\t\t\tint s = sc.nextInt();\n\t\t\tint n = sc.nextInt();\n\t\t\tint t = sc.nextInt();\n\t\t\tString week = sc.next();\n\t\t\tString time = sc.next();\n\t\t\tint p = sc.nextInt();\n\t\t\tint m = sc.nextInt();\n\n\t\t\tlist=new boolean[7*24*60];\n\t\t\t\n\t\t\tdaylist=new HashMap();\n\t\t\tArrayList name=new ArrayList();\n\t\t\tname.add(\"Sun\");\n\t\t\tdaylist.put(name.get(0), 0);\n\t\t\t\n\t\t\tname.add(\"Mon\");\n\t\t\tdaylist.put(name.get(1), 1*24*60);\n\t\t\t\n\t\t\tname.add(\"Tue\");\n\t\t\tdaylist.put(name.get(2), 2*24*60);\n\t\t\n\t\t\tname.add(\"Wed\");\n\t\t\tdaylist.put(name.get(3), 3*24*60);\n\t\t\t\n\t\t\tname.add(\"Thu\");\n\t\t\tdaylist.put(name.get(4), 4*24*60);\n\t\t\t\n\t\t\tname.add(\"Fri\");\n\t\t\tdaylist.put(name.get(5), 5*24*60);\n\t\t\t\n\t\t\tname.add(\"Sat\");\n\t\t\tdaylist.put(name.get(6), 6*24*60);\t\t\n\t\t\t\n\t\t\tif (s == 0 && n == 0 && t == 0 && p == 0 && m == 0 && week.equals(\"None\") && time.equals(\"None\"))break;\t\t\n\t\t\t\n\t\t\tif(week.equals(\"All\")){\n\t\t\t//\tfor(int i=0;i=10080)here-=10080;\n\t\t\t\t\t\tsub=here+t;\n\t\t\t\t\t\tif(sub-t+s>=7*24*60)sub-=7*24*60;\n\t\t\t\t\t\tif(list[here]&&list[sub-t+s])count++;\n\t\t\t\t\t\there=sub;\n\t\t\t\t\t}\n\t\t\t\t\taroundable=Math.max(aroundable, count);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\ti++;\n\t\t\t\tif(i+t==7*24*60)break;\n\t\t\t}\n\n\t//\t\tSystem.out.println(p+\" \"+n);\n\t\t\tdouble result=1.0-(1.0/p);\n\t\t\tresult=result==0?result=1:result;\n\t\t//\tSystem.out.println(result);\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t//System.out.println(aroundable);\n\t\t\tresult=1-Math.pow(result,aroundable*n);\n\t\t\tresult=result==0?result=1:result;\n\t//\t\tSystem.out.println(result);\n\t\t\t\n\t\t\tSystem.out.printf(\"%.10f\\n\",result);\n\t\t}\n\t}\n\t\n\tpublic static void set(String str){\n\t\tif(str.equals(\"Day\"))setset(-1,6,18);\n\t\telse if(str.equals(\"Night\")){\n\t\t\tsetset(-1,0,6);\n\t\t\tsetset(-1,18,24);\n\t\t}else setset(-1,0,24);\n\t\t\n\t}\n\tpublic static void set(String strw,String strt){\n//\t\tSystem.out.println(strw+\" \"+strt);\n\t\tif(strt.equals(\"Day\"))setset(daylist.get(strw),6,18);\n\t\telse if(strt.equals(\"Night\")){\n\n\t\t\tsetset(daylist.get(strw),0,6);\n\t\t\tsetset(daylist.get(strw),18,24);\n\t\t}else setset(daylist.get(strw),0,24);\n\t}\n\tpublic static void setset(int num,int start,int end){\n\t\tint sa=end-start;\n\t\t\n\t\tif(num==-1){\n\t\t\tif(start==0)start=24;\n\t\t\tfor(int i=0;i daylist;\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\twhile (true) {\n\t\t\tint s = sc.nextInt();\n\t\t\tint n = sc.nextInt();\n\t\t\tint t = sc.nextInt();\n\t\t\tString week = sc.next();\n\t\t\tString time = sc.next();\n\t\t\tint p = sc.nextInt();\n\t\t\tint m = sc.nextInt();\n\n\t\t\tlist=new boolean[7*24*60];\n\t\t\t\n\t\t\tdaylist=new HashMap();\n\t\t\tArrayList name=new ArrayList();\n\t\t\tname.add(\"Sun\");\n\t\t\tdaylist.put(name.get(0), 0);\n\t\t\t\n\t\t\tname.add(\"Mon\");\n\t\t\tdaylist.put(name.get(1), 1*24*60);\n\t\t\t\n\t\t\tname.add(\"Tue\");\n\t\t\tdaylist.put(name.get(2), 2*24*60);\n\t\t\n\t\t\tname.add(\"Wed\");\n\t\t\tdaylist.put(name.get(3), 3*24*60);\n\t\t\t\n\t\t\tname.add(\"Thu\");\n\t\t\tdaylist.put(name.get(4), 4*24*60);\n\t\t\t\n\t\t\tname.add(\"Fri\");\n\t\t\tdaylist.put(name.get(5), 5*24*60);\n\t\t\t\n\t\t\tname.add(\"Sat\");\n\t\t\tdaylist.put(name.get(6), 6*24*60);\t\t\n\t\t\t\n\t\t\tif (s == 0 && n == 0 && t == 0 && p == 0 && m == 0 && week.equals(\"None\") && time.equals(\"None\"))break;\t\t\n\t\t\t\n\t\t\tif(week.equals(\"All\")){\n\t\t\t//\tfor(int i=0;i=10080)here-=10080;\n\t\t\t\t\t\tsub=here+t;\n\t\t\t\t\t\tif(sub-t+s>=7*24*60)sub-=7*24*60;\n\t\t\t\t\t\tif(list[here]&&list[sub-t+s])count++;\n\t\t\t\t\t\there=sub;\n\t\t\t\t\t}\n\t\t\t\t\taroundable=Math.max(aroundable, count);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\ti++;\n\t\t\t\tif(i+t==7*24*60)break;\n\t\t\t}\n\n\t//\t\tSystem.out.println(p+\" \"+n);\n\t\t\tdouble result=1.0-(1.0/p);\n\t\t\tresult=result==0?result=1:result;\n\t\t//\tSystem.out.println(result);\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t//System.out.println(aroundable);\n\t\t\tresult=1-Math.pow(result,aroundable*n);\n\t\t\tresult=result==0?result=1:result;\n\t//\t\tSystem.out.println(result);\n\t\t\t\n\t\t\tSystem.out.printf(\"%.10f\\n\",result);\n\t\t}\n\t}\n\t\n\tpublic static void set(String str){\n\t\tif(str.equals(\"Day\"))setset(-1,6,18);\n\t\telse if(str.equals(\"Night\")){\n\t\t\tsetset(-1,0,6);\n\t\t\tsetset(-1,18,24);\n\t\t}else setset(-1,0,24);\n\t\t\n\t}\n\tpublic static void set(String strw,String strt){\n//\t\tSystem.out.println(strw+\" \"+strt);\n\t\tif(strt.equals(\"Day\"))setset(daylist.get(strw),6,18);\n\t\telse if(strt.equals(\"Night\")){\n\n\t\t\tsetset(daylist.get(strw),0,6);\n\t\t\tsetset(daylist.get(strw),18,24);\n\t\t}else setset(daylist.get(strw),0,24);\n\t}\n\tpublic static void setset(int num,int start,int end){\n\t\tint sa=end-start;\n\t\t\n\t\tif(num==-1){\n\t\t\tif(start==0)start=24;\n\t\t\tfor(int i=0;i= 0; --j) {\n\t\t\t\t\tif (th[j][head] == '+') {\n\t\t\t\t\t\tprev = j;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif (th[j][head] != ' ') break;\n\t\t\t\t}\n\t\t\t\tif (prev != -1) {\n\t\t\t\t\tfor (int j = prev + 1; j < i; ++j) {\n\t\t\t\t\t\tth[j][head] = '|';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tSystem.out.println(String.valueOf(th[i]));\n\t\t\t}\n\t\t}\n\t}\n\n}", "language": "Java", "metadata": {"date": 1415103404, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p01695.html", "problem_id": "p01695", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01695/input.txt", "sample_output_relpath": "derived/input_output/data/p01695/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01695/Java/s703967763.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s703967763", "user_id": "u599539865"}, "prompt_components": {"gold_output": "hoge\n+fuga\n|+foobar\n|+jagjag\n| +zigzag\n+piyo\njagjag\n+hogehoge\n|+fugafuga\n| +ponyoponyo\n| |+evaeva\n| |+pokemon\n| +nowawa\n+buhihi\nhello\n+goodmorning\n|+howareyou\n+goodafternoon\n|+letshavealunch\n+goodevening\n+goodnight\n +gotobed\ncaution\n+themessagelengthislessthanorequaltofifty\n +sothelengthoftheentirelinecanexceedfiftycharacters\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\n\tpublic static void main(String[] args) {\n\t\twhile (true) {\n\t\t\tint N = sc.nextInt();\n\t\t\tif (N == 0) break;\n\t\t\tchar[][] th = new char[N][];\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tth[i] = sc.next().toCharArray();\n\t\t\t\tif (i == 0) continue;\n\t\t\t\tint head = 0;\n\t\t\t\tfor (; th[i][head] == '.'; ++head) {\n\t\t\t\t\tth[i][head] = ' ';\n\t\t\t\t}\n\t\t\t\t--head;\n\t\t\t\tth[i][head] = '+';\n\t\t\t\tint prev = -1;\n\t\t\t\tfor (int j = i - 1; j >= 0; --j) {\n\t\t\t\t\tif (th[j][head] == '+') {\n\t\t\t\t\t\tprev = j;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif (th[j][head] != ' ') break;\n\t\t\t\t}\n\t\t\t\tif (prev != -1) {\n\t\t\t\t\tfor (int j = prev + 1; j < i; ++j) {\n\t\t\t\t\t\tth[j][head] = '|';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tSystem.out.println(String.valueOf(th[i]));\n\t\t\t}\n\t\t}\n\t}\n\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nJAG-channel\n\nネイサン・O・デイビスはJAG-channelという電子掲示板を運営している．\n彼は現在，スレッドビューという新機能の追加に取り組んでいる．\n\n他の多くの電子掲示板と同じように，JAG-channelはスレッドベースである．\nここで，スレッドとは，一連の投稿からなる一つの会話のまとまりを指す．\n投稿には，以下の2種類が存在する．\n\n新しいスレッドを作る最初の投稿\n\nすでにあるスレッドの過去の投稿への返信\n\nスレッドビューは，投稿間の返信・被返信関係による論理的な構造を表す，ツリー状のビューである．\nそれぞれの投稿はツリーのノードとなり，その投稿に対する返信を子ノードとして持つ．\nある投稿に対する直接・間接の返信が，全体として部分木となることに注意してほしい．\n\n例を見てみよう．例えば，\n\"hoge\"という最初の投稿に対して\n\"fuga\"と\"piyo\"という2つの返信が付き，\n\"fuga\"に対してさらに\"foobar\"と\"jagjag\"という返信が付き，\n\"jagjag\"に対して\"zigzag\"という返信が付いたとする．\nこのスレッドのツリーは次のようになる．\n\nhoge\n├─fuga\n│　├─foobar\n│　└─jagjag\n│　　　└─zigzag\n└─piyo\n\nネイサン・O・デイビスはプログラマーを雇って機能を実装させていたが，このプログラマーが最後の段階で失踪してしまった．\nこのプログラマーは，スレッドのツリーを作り，それを簡易フォーマットで表示するところまで完成させている．\nこの簡易フォーマットでは，返信の深さが '.' (半角ドット) で表され，ある投稿に対する返信は，元の投稿より1つ多くの '.' が左につく．また，ある投稿に対する返信は必ず元の投稿よりも下に来る．返信元の投稿と返信の間には，返信元の投稿に対する他の返信 (および，それに対する直接・間接の返信) が現れることがあるが，それ以外の投稿が両者の間に現れることはない．\n上のツリーの簡易フォーマット表示は次のようになる．\n\nhoge\n.fuga\n..foobar\n..jagjag\n...zigzag\n.piyo\n\nあなたの仕事は，この簡易フォーマット表示を受け取り，見やすく整形することである．\nすなわち，\n\n各投稿のすぐ左の '.' (各投稿の左についた '.' のうち，もっとも右のもの) を '+' (半角プラス)，\n\n同じ投稿に対する直接の返信について，それぞれのすぐ左にある '+' の間に位置する '.' を '|' (半角縦線)，\n\nそれ以外の '.' は ' ' (半角スペース)\n\nに置き換えて欲しい．\n\n上の簡易フォーマット表示に対する整形済みの表示は次のようになる．\n\nhoge\n+fuga\n|+foobar\n|+jagjag\n| +zigzag\n+piyo\n\nInput\n\n入力は複数のデータセットから構成される．各データセットの形式は次の通りである．\n\n$n$\n$s_1$\n$s_2$\n...\n$s_n$\n\n$n$ は簡易フォーマット表示の行数を表す整数であり，$1$ 以上 $1{,}000$ 以下と仮定してよい．\n続く $n$ 行にはスレッドツリーの簡易フォーマット表示が記載されている．\n$s_i$ は簡易フォーマット表示の $i$ 行目を表し，いくつかの '.' と，それに続く $1$ 文字以上 $50$ 文字以下のアルファベット小文字で構成された文字列からなる．\n$s_1$ はスレッドの最初の投稿であり，'.' を含まない．\n$s_2$, ..., $s_n$ はそのスレッドでの返信であり，必ず1つ以上の '.' を含む．\n\n$n=0$ は入力の終わりを示す．これはデータセットには含めない．\n\nOutput\n\n各データセットに対する整形済みの表示を各 $n$ 行で出力せよ．\n\nSample Input\n\n6\nhoge\n.fuga\n..foobar\n..jagjag\n...zigzag\n.piyo\n8\njagjag\n.hogehoge\n..fugafuga\n...ponyoponyo\n....evaeva\n....pokemon\n...nowawa\n.buhihi\n8\nhello\n.goodmorning\n..howareyou\n.goodafternoon\n..letshavealunch\n.goodevening\n.goodnight\n..gotobed\n3\ncaution\n.themessagelengthislessthanorequaltofifty\n..sothelengthoftheentirelinecanexceedfiftycharacters\n0\n\nOutput for Sample Input\n\nhoge\n+fuga\n|+foobar\n|+jagjag\n| +zigzag\n+piyo\njagjag\n+hogehoge\n|+fugafuga\n| +ponyoponyo\n| |+evaeva\n| |+pokemon\n| +nowawa\n+buhihi\nhello\n+goodmorning\n|+howareyou\n+goodafternoon\n|+letshavealunch\n+goodevening\n+goodnight\n+gotobed\ncaution\n+themessagelengthislessthanorequaltofifty\n+sothelengthoftheentirelinecanexceedfiftycharacters", "sample_input": "6\nhoge\n.fuga\n..foobar\n..jagjag\n...zigzag\n.piyo\n8\njagjag\n.hogehoge\n..fugafuga\n...ponyoponyo\n....evaeva\n....pokemon\n...nowawa\n.buhihi\n8\nhello\n.goodmorning\n..howareyou\n.goodafternoon\n..letshavealunch\n.goodevening\n.goodnight\n..gotobed\n3\ncaution\n.themessagelengthislessthanorequaltofifty\n..sothelengthoftheentirelinecanexceedfiftycharacters\n0\n"}, "reference_outputs": ["hoge\n+fuga\n|+foobar\n|+jagjag\n| +zigzag\n+piyo\njagjag\n+hogehoge\n|+fugafuga\n| +ponyoponyo\n| |+evaeva\n| |+pokemon\n| +nowawa\n+buhihi\nhello\n+goodmorning\n|+howareyou\n+goodafternoon\n|+letshavealunch\n+goodevening\n+goodnight\n +gotobed\ncaution\n+themessagelengthislessthanorequaltofifty\n +sothelengthoftheentirelinecanexceedfiftycharacters\n"], "source_document_id": "p01695", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nJAG-channel\n\nネイサン・O・デイビ��はJAG-channelという電子掲示板を運営している．\n彼は現在，スレッドビューという新機能の追加に取り組んでいる．\n\n他の多くの電子掲示板と同じように，JAG-channelはスレッドベースである．\nここで，スレッドとは，一連の投稿からなる一つの会話のまとまりを指す．\n投稿には，以下の2種類が存在する．\n\n新しいスレッドを作る最初の投稿\n\nすでにあるスレッドの過去の投稿への返信\n\nスレッドビューは，投稿間の返信・被返信関係による論理的な構造を表す，ツリー状のビューである．\nそれぞれの投稿はツリーのノードとなり，その投稿に対する返信を子ノードとして持つ．\nある投稿に対する直接・間接の返信が，全体として部分木となることに注意してほしい．\n\n例を見てみよう．例えば，\n\"hoge\"という最初の投稿に対して\n\"fuga\"と\"piyo\"という2つの返信が付き，\n\"fuga\"に対してさらに\"foobar\"と\"jagjag\"という返信が付き，\n\"jagjag\"に対して\"zigzag\"という返信が付いたとする．\nこのスレッドのツリーは次のようになる．\n\nhoge\n├─fuga\n│　├─foobar\n│　└─jagjag\n│　　　└─zigzag\n└─piyo\n\nネイサン・O・デイビスはプログラマーを雇って機能を実装させていたが，このプログラマーが最後の段階で失踪してしまった．\nこのプログラマーは，スレッドのツリーを作り，それを簡易フォーマットで表示するところまで完成させている．\nこの簡易フォーマットでは，返信の深さが '.' (半角ドット) で表され，ある投稿に対する返信は，元の投稿より1つ多くの '.' が左につく．また，ある投稿に対する返信は必ず元の投稿よりも下に来る．返信元の投稿と返信の間には，返信元の投稿に対する他の返信 (および，それに対する直接・間接の返信) が現れることがあるが，それ以外の投稿が両者の間に現れることはない．\n上のツリーの簡易フォーマット表示は次のようになる．\n\nhoge\n.fuga\n..foobar\n..jagjag\n...zigzag\n.piyo\n\nあなたの仕事は，この簡易フォーマット表示を受け取り，見やすく整形することである．\nすなわち，\n\n各投稿のすぐ左の '.' (各投稿の左についた '.' のうち，もっとも右のもの) を '+' (半角プラス)，\n\n同じ投稿に対する直接の返信について，それぞれのすぐ左にある '+' の間に位置する '.' を '|' (半角縦線)，\n\nそれ以外の '.' は ' ' (半角スペース)\n\nに置き換えて欲しい．\n\n上の簡易フォーマット表示に対する整形済みの表示は次のようになる．\n\nhoge\n+fuga\n|+foobar\n|+jagjag\n| +zigzag\n+piyo\n\nInput\n\n入力は複数のデータセットから構成される．各データセットの形式は次の通りである．\n\n$n$\n$s_1$\n$s_2$\n...\n$s_n$\n\n$n$ は簡易フォーマット表示の行数を表す整数であり，$1$ 以上 $1{,}000$ 以下と仮定してよい．\n続く $n$ 行にはスレッドツリーの簡易フォーマット表示が記載されている．\n$s_i$ は簡易フォーマット表示の $i$ 行目を表し，いくつかの '.' と，それに続く $1$ 文字以上 $50$ 文字以下のアルファベット小文字で構成された文字列からなる．\n$s_1$ はスレッドの最初の投稿であり，'.' を含まない．\n$s_2$, ..., $s_n$ はそのスレッドでの返信であり，必ず1つ以上の '.' を含む．\n\n$n=0$ は入力の終わりを示す．これはデータセットには含めない．\n\nOutput\n\n各データセットに対する整形済みの表示を各 $n$ 行で出力せよ．\n\nSample Input\n\n6\nhoge\n.fuga\n..foobar\n..jagjag\n...zigzag\n.piyo\n8\njagjag\n.hogehoge\n..fugafuga\n...ponyoponyo\n....evaeva\n....pokemon\n...nowawa\n.buhihi\n8\nhello\n.goodmorning\n..howareyou\n.goodafternoon\n..letshavealunch\n.goodevening\n.goodnight\n..gotobed\n3\ncaution\n.themessagelengthislessthanorequaltofifty\n..sothelengthoftheentirelinecanexceedfiftycharacters\n0\n\nOutput for Sample Input\n\nhoge\n+fuga\n|+foobar\n|+jagjag\n| +zigzag\n+piyo\njagjag\n+hogehoge\n|+fugafuga\n| +ponyoponyo\n| |+evaeva\n| |+pokemon\n| +nowawa\n+buhihi\nhello\n+goodmorning\n|+howareyou\n+goodafternoon\n|+letshavealunch\n+goodevening\n+goodnight\n+gotobed\ncaution\n+themessagelengthislessthanorequaltofifty\n+sothelengthoftheentirelinecanexceedfiftycharacters", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 819, "cpu_time_ms": 750, "memory_kb": 71400}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s698698596", "group_id": "codeNet:p01802", "input_text": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic int[][] map;\n\tstatic int[][] directions8 = { { -1, -1 }, { -1, 0 }, { -1, 1 }, { 0, -1 }, { 0, 1 }, { 1, -1 }, { 1, 0 },\n\t\t\t{ 1, 1 } };\n\tstatic int[][] directions4 = { { -1, 0 }, { 1, 0 }, { 0, -1 }, { 0, 1 } };\n\tstatic double ans;\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\twhile (true) {\n\n\t\t\tint D = sc.nextInt();\n\t\t\tint E = sc.nextInt();\n\n\t\t\tif ((D | E) == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tint tmpX = 0;\n\t\t\tint tmpY = D;\n\n\t\t\tans = Double.MAX_VALUE;\n\n\t\t\tfor (int j = 0; j <= D; j++) {\n\t\t\t\ttmpX = j;\n\t\t\t\ttmpY = D - j;\n\t\t\t\tdouble tmpAns = Math.sqrt(tmpX * tmpX + tmpY * tmpY) - E;\n\t\t\t\ttmpAns = Math.abs(tmpAns);\n\t\t\t\tans = Double.min(ans, tmpAns);\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n\t// 素数判定\n\tstatic boolean isPrime(long n) {\n\t\tif (n == 2)\n\t\t\treturn true;\n\t\tif (n < 2 || n % 2 == 0)\n\t\t\treturn false;\n\n\t\tint i = 3;\n\t\twhile (i <= Math.sqrt(n)) {\n\t\t\tif (n % i == 0)\n\t\t\t\treturn false;\n\t\t\telse\n\t\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}\n\n\t// BFS用に二つの配列を足し算する\n\tstatic int[] addArrayElms(int[] a, int[] b) {\n\t\tint[] c = new int[a.length];\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tc[i] = a[i] + b[i];\n\t\t}\n\t\treturn c;\n\t}\n\n\t// //二分探索\n\t// k <= num となる最小の配列要素kのインデックスを返す\n\tstatic private int binarySearch(long num, long[] orderedArray) {\n\t\tint lowerBorder = -1;\n\t\tint upperBorder = orderedArray.length;\n\t\tint mid;\n\n\t\twhile (upperBorder - lowerBorder > 1) {\n\t\t\tmid = (upperBorder + lowerBorder) / 2;\n\t\t\tif (orderedArray[mid] <= num) {\n\t\t\t\tlowerBorder = mid;\n\t\t\t} else {\n\t\t\t\tupperBorder = mid;\n\t\t\t}\n\t\t}\n\t\treturn lowerBorder;\n\t}\n\n\t// 二分探索\n\t// k <= num となる最小のList要素kのインデックスを返す\n\tstatic private int binarySearch(long num, ArrayList orderedList) {\n\t\tint lowerBorder = -1;\n\t\tint upperBorder = orderedList.size();\n\t\tint mid;\n\n\t\twhile (upperBorder - lowerBorder > 1) {\n\t\t\tmid = (upperBorder + lowerBorder) / 2;\n\t\t\tif (orderedList.get(mid) <= num) {\n\t\t\t\tlowerBorder = mid;\n\t\t\t} else {\n\t\t\t\tupperBorder = mid;\n\t\t\t}\n\t\t}\n\t\treturn lowerBorder;\n\t}\n\n\t// aとbの最小公倍数を求める\n\tpublic static int gcd(int a, int b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\n\tpublic static long gcd(long a, long b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1595748996, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p01802.html", "problem_id": "p01802", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01802/input.txt", "sample_output_relpath": "derived/input_output/data/p01802/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01802/Java/s698698596.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s698698596", "user_id": "u374875686"}, "prompt_components": {"gold_output": "0.4142135624\n0\n0.0827625303\n0\n48.7401153702\n33\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic int[][] map;\n\tstatic int[][] directions8 = { { -1, -1 }, { -1, 0 }, { -1, 1 }, { 0, -1 }, { 0, 1 }, { 1, -1 }, { 1, 0 },\n\t\t\t{ 1, 1 } };\n\tstatic int[][] directions4 = { { -1, 0 }, { 1, 0 }, { 0, -1 }, { 0, 1 } };\n\tstatic double ans;\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\twhile (true) {\n\n\t\t\tint D = sc.nextInt();\n\t\t\tint E = sc.nextInt();\n\n\t\t\tif ((D | E) == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tint tmpX = 0;\n\t\t\tint tmpY = D;\n\n\t\t\tans = Double.MAX_VALUE;\n\n\t\t\tfor (int j = 0; j <= D; j++) {\n\t\t\t\ttmpX = j;\n\t\t\t\ttmpY = D - j;\n\t\t\t\tdouble tmpAns = Math.sqrt(tmpX * tmpX + tmpY * tmpY) - E;\n\t\t\t\ttmpAns = Math.abs(tmpAns);\n\t\t\t\tans = Double.min(ans, tmpAns);\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n\t// 素数判定\n\tstatic boolean isPrime(long n) {\n\t\tif (n == 2)\n\t\t\treturn true;\n\t\tif (n < 2 || n % 2 == 0)\n\t\t\treturn false;\n\n\t\tint i = 3;\n\t\twhile (i <= Math.sqrt(n)) {\n\t\t\tif (n % i == 0)\n\t\t\t\treturn false;\n\t\t\telse\n\t\t\t\ti += 2;\n\t\t}\n\t\treturn true;\n\t}\n\n\t// BFS用に二つの配列を足し算する\n\tstatic int[] addArrayElms(int[] a, int[] b) {\n\t\tint[] c = new int[a.length];\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tc[i] = a[i] + b[i];\n\t\t}\n\t\treturn c;\n\t}\n\n\t// //二分探索\n\t// k <= num となる最小の配列要素kのインデックスを返す\n\tstatic private int binarySearch(long num, long[] orderedArray) {\n\t\tint lowerBorder = -1;\n\t\tint upperBorder = orderedArray.length;\n\t\tint mid;\n\n\t\twhile (upperBorder - lowerBorder > 1) {\n\t\t\tmid = (upperBorder + lowerBorder) / 2;\n\t\t\tif (orderedArray[mid] <= num) {\n\t\t\t\tlowerBorder = mid;\n\t\t\t} else {\n\t\t\t\tupperBorder = mid;\n\t\t\t}\n\t\t}\n\t\treturn lowerBorder;\n\t}\n\n\t// 二分探索\n\t// k <= num となる最小のList要素kのインデックスを返す\n\tstatic private int binarySearch(long num, ArrayList orderedList) {\n\t\tint lowerBorder = -1;\n\t\tint upperBorder = orderedList.size();\n\t\tint mid;\n\n\t\twhile (upperBorder - lowerBorder > 1) {\n\t\t\tmid = (upperBorder + lowerBorder) / 2;\n\t\t\tif (orderedList.get(mid) <= num) {\n\t\t\t\tlowerBorder = mid;\n\t\t\t} else {\n\t\t\t\tupperBorder = mid;\n\t\t\t}\n\t\t}\n\t\treturn lowerBorder;\n\t}\n\n\t// aとbの最小公倍数を求める\n\tpublic static int gcd(int a, int b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\n\tpublic static long gcd(long a, long b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n}\n\n", "problem_context": "MathJax.Hub.Config({\ntex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]}\n});\n\nKoto Municipal Subway\n\nKoto市営地下鉄\n\nKoto市は，下図のように，道路が碁盤の目状である有名な街である．\n南北に伸びる道と東西に伸びる道は，それぞれ1kmの間隔で並んでいる．\nKoto市の最も南西の交差点にあるKoto駅を (0, 0) として，そこから東に x km，北に y km 進んだ位置を (x, y) と記すこととする (0 ≤ x, y である)．\n\n5年後に開かれるオリンピックにより観光客が増大することを見越して，市はKoto駅を始発駅とする新しい地下鉄の路線を建設することを決めた．\n現在，Koto駅の次の駅として新しく建設されるShin-Koto駅までのレールを敷く計画を立てている．\nレールは，Koto駅からShin-Koto駅に向かってまっすぐ敷く．\n従って，Shin-Koto駅の場所を (x, y) としたとき，レールの長さは， √(x2 + y2) である．\nレールを敷くための費用は，敷いたレールの長さ分だけ必要になる．\nレールの長さが1.5kmのように小数であっても，費用も同じように1.5必要となる．\n\nShin-Koto駅の場所 (x, y) はまだ決定しておらず，以下の条件を満たす場所にする予定である．\n\n交差点である．つまり， x と y がそれぞれ整数である．\n\nKoto駅から道路に沿って歩いた最短距離が，ちょうど D である．つまり， x + y = D を満たす．\n\n上の2つの条件を満たす中で，市が定めるレールの予算 E とレールの費用とのずれ | √(x2 + y2) - E | が最小となるようにShin-Koto駅の場所を選ぶ．\nここで |A| は， A の絶対値を表す．\nあなたの仕事は，上記のようにShin-Koto駅を建設したときの，レールを敷くための費用と予算とのずれを出力するプログラムを作成することである．\n\nInput\n\n入力は，複数のデータセットから構成され，1つの入力に含まれるデータセットの数は100以下である． 各データセットの形式は次の通りである．\n\nD E\n\nD (1 ≤ D ≤ 100)は，Koto駅からShin-Koto駅まで道路に沿って歩いたときの最短距離を表す整数である．\nE (1 ≤ E ≤ 100)は，レール建設のための予算を表す整数である．\n\n入力の終わりは，空白で区切られた2つのゼロからなる行によって示される．\n\nOutput\n\n各データセットに対して，問題の条件を満たすようにレールを敷いたときの費用と予算とのずれを1行で出力せよ．\n答えには 10-3 を越える絶対誤差があってはならない．\n各行の終わりに改行を出力しなかった場合や，不必要な文字を出力した場合，誤答と判断されてしまうため，注意すること．\n\nSample Input\n\n2 1\n7 5\n7 6\n7 7\n76 5\n8 41\n0 0\n\nOutput for Sample Input\n\n0.4142135624\n0\n0.0827625303\n0\n48.7401153702\n33\n\nHint\n\n1つ目のデータセットでは，下図のように，Koto駅から道路に沿って2km進んだ交差点がShin-Koto駅を建設する場所の候補となる．\n\n各交差点にShin-Koto駅を建設した場合の，レールを敷くための費用と予算1とのずれは次のようになる．\n\n(2, 0) ： | √(22 + 02) - 1 | = 1.0\n\n(1, 1) ： | √(12 + 12) - 1 | = 0.4142135623...\n\n(0, 2) ： | √(02 + 22) - 1 | = 1.0\n\nよって，費用と予算とのずれが最小になるのは， (1, 1) に建設した場合となる．", "sample_input": "2 1\n7 5\n7 6\n7 7\n76 5\n8 41\n0 0\n"}, "reference_outputs": ["0.4142135624\n0\n0.0827625303\n0\n48.7401153702\n33\n"], "source_document_id": "p01802", "source_text": "MathJax.Hub.Config({\ntex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]}\n});\n\nKoto Municipal Subway\n\nKoto市営地下鉄\n\nKoto市は，下図のように，道路が碁盤の目状である有名な街である．\n南北に伸びる道と東西に伸びる道は，それぞれ1kmの間隔で並んでいる．\nKoto市の最も南西の交差点にあるKoto駅を (0, 0) として，そこから東に x km，北に y km 進んだ位置を (x, y) と記すこととする (0 ≤ x, y である)．\n\n5年後に開かれるオリンピックにより観光客が増大することを見越して，市はKoto駅を始発駅とする新しい地下鉄の路線を建設することを決めた．\n現在，Koto駅の次の駅として新しく建設されるShin-Koto駅までのレールを敷く計画を立てている．\nレールは，Koto駅からShin-Koto駅に向かってまっすぐ敷く．\n従って，Shin-Koto駅の場所を (x, y) としたとき，レールの長さは， √(x2 + y2) である．\nレールを敷くための費用は，敷いたレールの長さ分だけ必要になる．\nレールの長さが1.5kmのように小数であっても，費用も同じように1.5必要となる．\n\nShin-Koto駅の場所 (x, y) はまだ決定しておらず，以下の条件を満たす場所にする予定である．\n\n交差点である．つまり， x と y がそれぞれ整数である．\n\nKoto駅から道路に沿って歩いた最短距離が，ちょうど D である．つまり， x + y = D を満たす．\n\n上の2つの条件を満たす中で，市が定めるレールの予算 E とレールの費用とのずれ | √(x2 + y2) - E | が最小となるようにShin-Koto駅の場所を選ぶ．\nここで |A| は， A の絶対値を表す．\nあなたの仕事は，上記のようにShin-Koto駅を建設したときの，レールを敷くための費用と予算とのずれを出力するプログラムを作成することである．\n\nInput\n\n入力は，複数のデータセットから構成され，1つの入力に含まれるデータセットの数は100以下である． 各データセットの形式は次の通りである．\n\nD E\n\nD (1 ≤ D ≤ 100)は，Koto駅からShin-Koto駅まで道路に沿って歩いたときの最短距離を表す整数である．\nE (1 ≤ E ≤ 100)は，レール建設のための予算を表す整数である．\n\n入力の終わりは，空白で区切られた2つのゼロからなる行によって示される．\n\nOutput\n\n各データセットに対して，問題の条件を満たすようにレールを敷いたときの費用と予算とのずれを1行で出力せよ．\n答えには 10-3 を越える絶対誤差があってはならない．\n各行の終わりに改行を出力しなかった場合や，不必要な文字を出力した場合，誤答と判断されてしまうため，注意すること．\n\nSample Input\n\n2 1\n7 5\n7 6\n7 7\n76 5\n8 41\n0 0\n\nOutput for Sample Input\n\n0.4142135624\n0\n0.0827625303\n0\n48.7401153702\n33\n\nHint\n\n1つ目のデータセットでは，下図のように，Koto駅から道路に沿って2km進んだ交差点がShin-Koto駅を建設する場所の候補となる．\n\n各交差点にShin-Koto駅を建設した場合の，レールを敷くための費用と予算1とのずれは次のようになる．\n\n(2, 0) ： | √(22 + 02) - 1 | = 1.0\n\n(1, 1) ： | √(12 + 12) - 1 | = 0.4142135623...\n\n(0, 2) ： | √(02 + 22) - 1 | = 1.0\n\nよって，費用と予算とのずれが最小になるのは， (1, 1) に建設した場合となる．", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2372, "cpu_time_ms": 100, "memory_kb": 26512}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s035253266", "group_id": "codeNet:p01839", "input_text": "import java.util.Scanner;\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\ttry(Scanner sc = new Scanner(System.in)) {\n\t\t\tint N = sc.nextInt();\n\t\t\tint count = 0;\n\t\t\tfor(int i=0; i 0; n >>= 1, a = mul(a, a)) {\n\t\t\tif (n % 2 == 1) {\n\t\t\t\tret = mul(ret, a);\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic void showMatrix(long[][] a) {\n\t\tint n = a.length;\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tfor (int j = 0; j < n; ++j) {\n\t\t\t\tSystem.out.print(a[i][j] + \" \");\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\t}\n\n\tstatic void showVec(long[] a) {\n\t\tfor (int i = 0; i < a.length; ++i) {\n\t\t\tSystem.out.print(a[i] + \" \");\n\t\t}\n\t\tSystem.out.println();\n\t}\n\n\tstatic void tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n}", "language": "Java", "metadata": {"date": 1484288243, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p01878.html", "problem_id": "p01878", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01878/input.txt", "sample_output_relpath": "derived/input_output/data/p01878/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01878/Java/s696619200.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s696619200", "user_id": "u323357326"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tstatic final long MODULO = 1_000_000_000 + 7;\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tint C = sc.nextInt() - 1;\n\t\tint T = sc.nextInt();\n\t\tint[] a = new int[K];\n\t\tint[] b = new int[K];\n\t\tint[] t = new int[K];\n\t\tfor (int i = 0; i < K; ++i) {\n\t\t\ta[i] = sc.nextInt();\n\t\t\tb[i] = sc.nextInt();\n\t\t\tt[i] = sc.nextInt();\n\t\t}\n\t\t// dp[t]=A[1]dp[t-1]+A[2]dp[t-2]+A[3]dp[t-3]\n\t\tlong[][][] A = new long[6][N][N];\n\t\tfor (int i = 0; i < K; ++i) {\n\t\t\tfor (int j = 0; j < b[i]; ++j) {\n\t\t\t\tA[t[i]][j][(a[i] - 1) + j] += 1;\n\t\t\t}\n\t\t\tfor (int j = 0; j < a[i] - 1; ++j) {\n\t\t\t\tA[t[i]][b[i] + j][j] += 1;\n\t\t\t}\n\t\t\tfor (int j = a[i] + b[i] - 1; j < N; ++j) {\n\t\t\t\tA[t[i]][j][j] += 1;\n\t\t\t}\n\t\t}\n\t\tlong[][] dp = new long[6][N];\n\t\tdp[0][C] = 1;\n\t\tfor (int i = 1; i <= 5; ++i) {\n\t\t\tfor (int j = 0; j < i; ++j) {\n\t\t\t\tdp[i] = addVec(dp[i], mulVec(A[i - j], dp[j]));\n\t\t\t}\n\t\t}\n\t\tlong[] v = new long[N * 5];\n\t\tfor (int i = 0; i < 5; ++i) {\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tv[j + i * N] = dp[i][j];\n\t\t\t}\n\t\t}\n\t\tlong[][] mx = new long[5 * N][5 * N];\n\t\tfor (int i = N; i < 5 * N; ++i) {\n\t\t\tmx[i - N][i] = 1;\n\t\t}\n\t\tfor (int i = 1; i <= 5; ++i) {\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tfor (int k = 0; k < N; ++k) {\n\t\t\t\t\tmx[4 * N + j][N * (5 - i) + k] = A[i][j][k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tv = mulVec(pow(mx, T), v);\n\t\tSystem.out.println(v[0]);\n\t}\n\n\tstatic long[][] mul(long[][] a, long[][] b) {\n\t\tint n = a.length;\n\t\tlong[][] ret = new long[n][n];\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tfor (int j = 0; j < n; ++j) {\n\t\t\t\tfor (int k = 0; k < n; ++k) {\n\t\t\t\t\tret[i][j] += a[i][k] * b[k][j] % MODULO;\n\t\t\t\t\tret[i][j] %= MODULO;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic long[] mulVec(long[][] a, long[] v) {\n\t\tint n = v.length;\n\t\tlong[] ret = new long[n];\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tfor (int j = 0; j < n; ++j) {\n\t\t\t\tret[i] += a[i][j] * v[j] % MODULO;\n\t\t\t\tret[i] %= MODULO;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic long[] addVec(long[] a, long[] b) {\n\t\tint n = a.length;\n\t\tlong[] ret = new long[n];\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tret[i] = (a[i] + b[i]) % MODULO;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic long[][] pow(long[][] a, long n) {\n\t\tint len = a.length;\n\t\tlong[][] ret = new long[len][len];\n\t\tfor (int i = 0; i < len; ++i)\n\t\t\tret[i][i] = 1;\n\t\tfor (; n > 0; n >>= 1, a = mul(a, a)) {\n\t\t\tif (n % 2 == 1) {\n\t\t\t\tret = mul(ret, a);\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tstatic void showMatrix(long[][] a) {\n\t\tint n = a.length;\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tfor (int j = 0; j < n; ++j) {\n\t\t\t\tSystem.out.print(a[i][j] + \" \");\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\t}\n\n\tstatic void showVec(long[] a) {\n\t\tfor (int i = 0; i < a.length; ++i) {\n\t\t\tSystem.out.print(a[i] + \" \");\n\t\t}\n\t\tSystem.out.println();\n\t}\n\n\tstatic void tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n}", "problem_context": "G: 運命力 - Destiny Draw -\n\n問題\n\nMr. D はカードゲームで勝負をすることになった。\nこのカードゲームでは、 N 枚のカードの山を用いる。\nまた、山のカードには、上から順に 1, 2, 3, ... , N の番号がついている。\n\nD で始まるものすべてを背負う彼に敗北は許されないが、不幸にも Mr. D はカードゲームが不得手である。\nそこで、自分が引くカードをコントロールすることで勝利を手にすることにした。\n\nMr. D は K 種類のシャッフルが可能である。\nK 種類のうち i 番目のシャッフルでは上から a_i 枚目から a_i+b_i − 1枚目までのちょうど b_i 枚を引き抜き、上に重ねる。\ni番目のシャッフルを1 回するとき、それぞれ t_i 秒を要する。\n\nちょうど T 秒のシャッフルの後、一番上のカードを C にする方法は何通りあるか。 数が多くなる可能性があるので、 10^9+7 で割った余りを出力せよ。\n\n入力形式\n\n入力は次の形式で与えられる。\n\nN K C T\na_1 b_1 t_1\na_2 b_2 t_2\n...\na_K b_K t_K\n\nN は整数で 2 \\≤ N \\≤ 40 を満たす。\n\nK は整数で 1 \\≤ K \\≤ \\frac{N (N+1)}{2} を満たす\n\nC は整数で 1 \\≤ C \\≤ N を満たす\n\nT は整数で 1 \\≤ T \\≤ 1,000,000 を満たす\n\na_i (i = 1, 2, ... , K) は整数で 1 \\≤ a_i \\≤ N を満たす\n\nb_i (i = 1, 2, ... , K) は整数で 1 \\≤ b_i \\≤ N − a_i + 1 を満たす\n\na_i = a_j かつ b_i = b_j を満たすとき i = j に限定される\n\nt_i は整数で 1 \\≤ t_i \\≤ 5 を満たす\n\n出力形式\n\n答えを 10^9+7 で割った余りを一行で出力せよ。\n\n入力例1\n\n4 1 1 6\n3 2 3\n\n出力例1\n\n1\n\n入力例2\n\n4 1 1 5\n3 2 3\n\n出力例2\n\n0\n\n入力例3\n\n6 2 2 5\n1 2 1\n2 5 3\n\n出力例3\n\n3\n\nちょうど 5 秒で一番上のカードを 2 にする方法は以下の 3 通りである。\n\n1→1→2\n1→2→1\n2→1→1\n\n入力例4\n\n6 8 3 10\n1 4 5\n1 3 3\n1 6 5\n1 2 2\n1 1 4\n2 5 1\n4 3 1\n2 1 3\n\n出力例4\n\n3087", "sample_input": "4 1 1 6\n3 2 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p01878", "source_text": "G: 運命力 - Destiny Draw -\n\n問題\n\nMr. D はカードゲームで勝負をすることになった。\nこのカードゲームでは、 N 枚のカードの山を用いる。\nまた、山のカードには、上から順に 1, 2, 3, ... , N の番号がついている。\n\nD で始まるものすべてを背負う彼に敗北は許されないが、不幸にも Mr. D はカードゲームが不得手である。\nそこで、自分が引くカードをコントロールすることで勝利を手にすることにした。\n\nMr. D は K 種類のシャッフルが可能である。\nK 種類のうち i 番目のシャッフルでは上から a_i 枚目から a_i+b_i − 1枚目までのちょうど b_i 枚を引き抜き、上に重ねる。\ni番目のシャッフルを1 回するとき、それぞれ t_i 秒を要する。\n\nちょうど T 秒のシャッフルの後、一番上のカードを C にする方法は何通りあるか。 数が多くなる可能性があるので、 10^9+7 で割った余りを出力せよ。\n\n入力形式\n\n入力は次の形式で与えられる。\n\nN K C T\na_1 b_1 t_1\na_2 b_2 t_2\n...\na_K b_K t_K\n\nN は整数で 2 \\≤ N \\≤ 40 を満たす。\n\nK は整数で 1 \\≤ K \\≤ \\frac{N (N+1)}{2} を満たす\n\nC は整数で 1 \\≤ C \\≤ N を満たす\n\nT は整数で 1 \\≤ T \\≤ 1,000,000 を満たす\n\na_i (i = 1, 2, ... , K) は整数で 1 \\≤ a_i \\≤ N を満たす\n\nb_i (i = 1, 2, ... , K) は整数で 1 \\≤ b_i \\≤ N − a_i + 1 を満たす\n\na_i = a_j かつ b_i = b_j を満たすとき i = j に限定される\n\nt_i は整数で 1 \\≤ t_i \\≤ 5 を満たす\n\n出力形式\n\n答えを 10^9+7 で割った余りを一行で出力せよ。\n\n入力例1\n\n4 1 1 6\n3 2 3\n\n出力例1\n\n1\n\n入力例2\n\n4 1 1 5\n3 2 3\n\n出力例2\n\n0\n\n入力例3\n\n6 2 2 5\n1 2 1\n2 5 3\n\n出力例3\n\n3\n\nちょうど 5 秒で一番上のカードを 2 にする方法は以下の 3 通りである。\n\n1→1→2\n1→2→1\n2→1→1\n\n入力例4\n\n6 8 3 10\n1 4 5\n1 3 3\n1 6 5\n1 2 2\n1 1 4\n2 5 1\n4 3 1\n2 1 3\n\n出力例4\n\n3087", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2861, "cpu_time_ms": 1090, "memory_kb": 43828}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s753461900", "group_id": "codeNet:p02238", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tint n, deep;\n\tint[] d, f;\n\tboolean[][] g;\n\tvoid run() {\n\t\tScanner scan = new Scanner(System.in);\n\t\tn = scan.nextInt();\n\t\tg = new boolean[n][n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint u = scan.nextInt();\n\t\t\tint k = scan.nextInt();\n\t\t\tfor (int j = 0; j < k; j++) {\n\t\t\t\tint v = scan.nextInt();\n\t\t\t\tg[u - 1][v - 1] = true;\n\t\t\t}\n\t\t}\n\t\tdeep = 0;\n\t\td = new int[n];\n\t\tf = new int[n];\n\t\tdfs(0);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tSystem.out.println((i + 1) + \" \" + d[i] + \" \" + f[i]);\n\t}\n\tvoid dfs(int u) {\n\t\tif (f[u] > 0)\n\t\t\treturn;\n\n\t\td[u] = ++deep;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tif (g[u][i])\n\t\t\t\tdfs(i);\n\t\tf[u] = ++deep;\n\t}\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1531276321, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02238.html", "problem_id": "p02238", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02238/input.txt", "sample_output_relpath": "derived/input_output/data/p02238/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02238/Java/s753461900.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s753461900", "user_id": "u820556307"}, "prompt_components": {"gold_output": "1 1 8\n2 2 7\n3 4 5\n4 3 6\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tint n, deep;\n\tint[] d, f;\n\tboolean[][] g;\n\tvoid run() {\n\t\tScanner scan = new Scanner(System.in);\n\t\tn = scan.nextInt();\n\t\tg = new boolean[n][n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint u = scan.nextInt();\n\t\t\tint k = scan.nextInt();\n\t\t\tfor (int j = 0; j < k; j++) {\n\t\t\t\tint v = scan.nextInt();\n\t\t\t\tg[u - 1][v - 1] = true;\n\t\t\t}\n\t\t}\n\t\tdeep = 0;\n\t\td = new int[n];\n\t\tf = new int[n];\n\t\tdfs(0);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tSystem.out.println((i + 1) + \" \" + d[i] + \" \" + f[i]);\n\t}\n\tvoid dfs(int u) {\n\t\tif (f[u] > 0)\n\t\t\treturn;\n\n\t\td[u] = ++deep;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tif (g[u][i])\n\t\t\t\tdfs(i);\n\t\tf[u] = ++deep;\n\t}\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDepth First Search\n\nDepth-first search (DFS) follows the strategy to search ”deeper” in the graph whenever possible. In DFS, edges are recursively explored out of the most recently discovered vertex $v$ that still has unexplored edges leaving it. When all of $v$'s edges have been explored, the search ”backtracks” to explore edges leaving the vertex from which $v$ was discovered.\n\nThis process continues until all the vertices that are reachable from the original source vertex have been discovered. If any undiscovered vertices remain, then one of them is selected as a new source and the search is repeated from that source.\n\nDFS timestamps each vertex as follows:\n\n$d[v]$ records when $v$ is first discovered.\n\n$f[v]$ records when the search finishes examining $v$’s adjacency list.\n\nWrite a program which reads a directed graph $G = (V, E)$ and demonstrates DFS on the graph based on the following rules:\n\n$G$ is given in an adjacency-list. Vertices are identified by IDs $1, 2,... n$ respectively.\n\nIDs in the adjacency list are arranged in ascending order.\n\nThe program should report the discover time and the finish time for each vertex.\n\nWhen there are several candidates to visit during DFS, the algorithm should select the vertex with the smallest ID.\n\nThe timestamp starts with 1.\n\nInput\n\nIn the first line, an integer $n$ denoting the number of vertices of $G$ is given. In the next $n$ lines, adjacency lists of $u$ are given in the following format:\n\n$u$ $k$ $v_1$ $v_2$ ... $v_k$\n\n$u$ is ID of the vertex and $k$ denotes its degree. $v_i$ are IDs of vertices adjacent to $u$.\n\nOutput\n\nFor each vertex, print $id$, $d$ and $f$ separated by a space character in a line. $id$ is ID of the vertex, $d$ and $f$ is the discover time and the finish time respectively. Print in order of vertex IDs.\n\nConstraints\n\n$1 \\leq n \\leq 100$\n\nSample Input 1\n\n4\n1 1 2\n2 1 4\n3 0\n4 1 3\n\nSample Output 1\n\n1 1 8\n2 2 7\n3 4 5\n4 3 6\n\nSample Input 2\n\n6\n1 2 2 3\n2 2 3 4\n3 1 5\n4 1 6\n5 1 6\n6 0\n\nSample Output 2\n\n1 1 12\n2 2 11\n3 3 8\n4 9 10\n5 4 7\n6 5 6\n\nThis is example for Sample Input 2 (discover/finish)\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "4\n1 1 2\n2 1 4\n3 0\n4 1 3\n"}, "reference_outputs": ["1 1 8\n2 2 7\n3 4 5\n4 3 6\n"], "source_document_id": "p02238", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDepth First Search\n\nDepth-first search (DFS) follows the strategy to search ”deeper” in the graph whenever possible. In DFS, edges are recursively explored out of the most recently discovered vertex $v$ that still has unexplored edges leaving it. When all of $v$'s edges have been explored, the search ”backtracks” to explore edges leaving the vertex from which $v$ was discovered.\n\nThis process continues until all the vertices that are reachable from the original source vertex have been discovered. If any undiscovered vertices remain, then one of them is selected as a new source and the search is repeated from that source.\n\nDFS timestamps each vertex as follows:\n\n$d[v]$ records when $v$ is first discovered.\n\n$f[v]$ records when the search finishes examining $v$’s adjacency list.\n\nWrite a program which reads a directed graph $G = (V, E)$ and demonstrates DFS on the graph based on the following rules:\n\n$G$ is given in an adjacency-list. Vertices are identified by IDs $1, 2,... n$ respectively.\n\nIDs in the adjacency list are arranged in ascending order.\n\nThe program should report the discover time and the finish time for each vertex.\n\nWhen there are several candidates to visit during DFS, the algorithm should select the vertex with the smallest ID.\n\nThe timestamp starts with 1.\n\nInput\n\nIn the first line, an integer $n$ denoting the number of vertices of $G$ is given. In the next $n$ lines, adjacency lists of $u$ are given in the following format:\n\n$u$ $k$ $v_1$ $v_2$ ... $v_k$\n\n$u$ is ID of the vertex and $k$ denotes its degree. $v_i$ are IDs of vertices adjacent to $u$.\n\nOutput\n\nFor each vertex, print $id$, $d$ and $f$ separated by a space character in a line. $id$ is ID of the vertex, $d$ and $f$ is the discover time and the finish time respectively. Print in order of vertex IDs.\n\nConstraints\n\n$1 \\leq n \\leq 100$\n\nSample Input 1\n\n4\n1 1 2\n2 1 4\n3 0\n4 1 3\n\nSample Output 1\n\n1 1 8\n2 2 7\n3 4 5\n4 3 6\n\nSample Input 2\n\n6\n1 2 2 3\n2 2 3 4\n3 1 5\n4 1 6\n5 1 6\n6 0\n\nSample Output 2\n\n1 1 12\n2 2 11\n3 3 8\n4 9 10\n5 4 7\n6 5 6\n\nThis is example for Sample Input 2 (discover/finish)\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 735, "cpu_time_ms": 60, "memory_kb": 26156}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s966644480", "group_id": "codeNet:p02242", "input_text": "import java.util.LinkedList;\nimport java.util.Scanner;\nimport java.util.Iterator;\n\nclass Graph {\n\tprivate int totalVertex;\n\t//adjMatrix[u][v] = 1 if there is an edge from u to v, otherwise 0\n\tprivate int[][] adjMatrix;\n\t//adjWeight[u][v] -- the weight of the edge from u to v if there is one\n\tprivate int[][] adjWeight;\n\t//if a node is settled (e.g., processed in the Dijkstra's algorithm)\n\tprivate Boolean[] ifSettled;\n\tpublic Graph() { totalVertex = 0; }\n\tpublic int getTotalVertex() { return totalVertex; }\n\t//load graph from standard input\n\tpublic void loadAdjMatrix() {\n\t\tScanner in = new Scanner(System.in);\n\t\ttotalVertex = in.nextInt();\n\t\tadjMatrix = new int[totalVertex][totalVertex];\n\t\tadjWeight = new int[totalVertex][totalVertex];\n\t\tifSettled = new Boolean[totalVertex];\n\t\tint i, j;\n\t\tfor(i = 0; i < totalVertex; i ++) {\n\t\t\tifSettled[i] = false;\n\t\t\tfor(j = 0; j < totalVertex; j ++) {\n\t\t\t\tadjMatrix[i][j] = adjWeight[i][j] = 0;\n\t\t\t}\n\t\t}\n\t\tint u, v;\n\t\tfor(i = 0; i < totalVertex; i ++) {\n\t\t\tu = in.nextInt();\n\t\t\tint degree = in.nextInt();\n\t\t\tfor(j = 0; j < degree; j ++) {\n\t\t\t\tv = in.nextInt(); \n\t\t\t\tadjMatrix[u][v] = 1;\n\t\t\t\tadjWeight[u][v] = in.nextInt();\n\t\t\t}\t\n\t\t}\n\t\tin.close();\n\t}\n\t//return weight of the edge from u to v if there is one\n\tpublic int getWeight(int u, int v) {\n\t\treturn adjWeight[u][v];\n\t}\n\t//return neighbors of u as a LinkedList\n\tpublic LinkedList getNeighbors(int u) {\n\t\tLinkedList tmp = new LinkedList();\n\t\tfor(int v = 0; v < totalVertex; v ++) {\n\t\t\tif(adjMatrix[u][v] == 1) tmp.add(v);\n\t\t}\n\t\treturn tmp;\n\t}\n\t//return unsettled neighbors of u as a LinkedList\n\tpublic LinkedList getUnsettledNeighbors(int u) {\n\t\tLinkedList tmp = new LinkedList();\n\t\tfor(int v = 0; v < totalVertex; v ++) {\n\t\t\tif((adjMatrix[u][v] == 1) && (ifSettled[v] == false)) tmp.add(v);\n\t\t}\n\t\treturn tmp;\n\t}\n\t//return the unsettled node that has the smallest dist\n\tpublic int getUnsettledNearest(int[] dist) {\n\t\tint md = Integer.MAX_VALUE;\n\t\tint mv = -1;\n\t\tint v;\n\t\tfor(v = 0; v < totalVertex; v ++) {\n\t\t\tif((ifSettled[v] == false) && (dist[v] < md)) {\n\t\t\t\tmd = dist[v];\n\t\t\t\tmv = v;\n\t\t\t}\n\t\t}\n\t\treturn mv;\n\t}\n\t//implement the following\t\n\tpublic int[] Dijkstra(int s) {\n\t\tint [] D = new int[totalVertex];\n\t\tfor(int i=0; i UnsettleNeighbors = getUnsettledNeighbors(s);\n\t\t\tIterator it = UnsettleNeighbors.iterator();\n\t\t\twhile(it.hasNext()){\n\t\t\t\tint v = it.next();\n\t\t\t\tif(D[v] > (D[s] + adjWeight[s][v]))\n\t\t\t\t\tD[v] = D[s] + adjWeight[s][v];\n\t\t\t}\n\t\t\ts = getUnsettledNearest(D);\n\t\t}\t\t\n\t\treturn D;\n\t}\n}\n\npublic class Main {\n\tpublic static void main(String[] argv) {\n\t\tGraph g = new Graph();\n\t\tg.loadAdjMatrix();\n\t\tint[] dist = g.Dijkstra(0);\n\t\tfor(int i = 0; i < g.getTotalVertex(); i ++) {\n\t\t\tSystem.out.println(i + \" \" + dist[i]);\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1573838017, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02242.html", "problem_id": "p02242", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02242/input.txt", "sample_output_relpath": "derived/input_output/data/p02242/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02242/Java/s966644480.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s966644480", "user_id": "u029303282"}, "prompt_components": {"gold_output": "0 0\n1 2\n2 2\n3 1\n4 3\n", "input_to_evaluate": "import java.util.LinkedList;\nimport java.util.Scanner;\nimport java.util.Iterator;\n\nclass Graph {\n\tprivate int totalVertex;\n\t//adjMatrix[u][v] = 1 if there is an edge from u to v, otherwise 0\n\tprivate int[][] adjMatrix;\n\t//adjWeight[u][v] -- the weight of the edge from u to v if there is one\n\tprivate int[][] adjWeight;\n\t//if a node is settled (e.g., processed in the Dijkstra's algorithm)\n\tprivate Boolean[] ifSettled;\n\tpublic Graph() { totalVertex = 0; }\n\tpublic int getTotalVertex() { return totalVertex; }\n\t//load graph from standard input\n\tpublic void loadAdjMatrix() {\n\t\tScanner in = new Scanner(System.in);\n\t\ttotalVertex = in.nextInt();\n\t\tadjMatrix = new int[totalVertex][totalVertex];\n\t\tadjWeight = new int[totalVertex][totalVertex];\n\t\tifSettled = new Boolean[totalVertex];\n\t\tint i, j;\n\t\tfor(i = 0; i < totalVertex; i ++) {\n\t\t\tifSettled[i] = false;\n\t\t\tfor(j = 0; j < totalVertex; j ++) {\n\t\t\t\tadjMatrix[i][j] = adjWeight[i][j] = 0;\n\t\t\t}\n\t\t}\n\t\tint u, v;\n\t\tfor(i = 0; i < totalVertex; i ++) {\n\t\t\tu = in.nextInt();\n\t\t\tint degree = in.nextInt();\n\t\t\tfor(j = 0; j < degree; j ++) {\n\t\t\t\tv = in.nextInt(); \n\t\t\t\tadjMatrix[u][v] = 1;\n\t\t\t\tadjWeight[u][v] = in.nextInt();\n\t\t\t}\t\n\t\t}\n\t\tin.close();\n\t}\n\t//return weight of the edge from u to v if there is one\n\tpublic int getWeight(int u, int v) {\n\t\treturn adjWeight[u][v];\n\t}\n\t//return neighbors of u as a LinkedList\n\tpublic LinkedList getNeighbors(int u) {\n\t\tLinkedList tmp = new LinkedList();\n\t\tfor(int v = 0; v < totalVertex; v ++) {\n\t\t\tif(adjMatrix[u][v] == 1) tmp.add(v);\n\t\t}\n\t\treturn tmp;\n\t}\n\t//return unsettled neighbors of u as a LinkedList\n\tpublic LinkedList getUnsettledNeighbors(int u) {\n\t\tLinkedList tmp = new LinkedList();\n\t\tfor(int v = 0; v < totalVertex; v ++) {\n\t\t\tif((adjMatrix[u][v] == 1) && (ifSettled[v] == false)) tmp.add(v);\n\t\t}\n\t\treturn tmp;\n\t}\n\t//return the unsettled node that has the smallest dist\n\tpublic int getUnsettledNearest(int[] dist) {\n\t\tint md = Integer.MAX_VALUE;\n\t\tint mv = -1;\n\t\tint v;\n\t\tfor(v = 0; v < totalVertex; v ++) {\n\t\t\tif((ifSettled[v] == false) && (dist[v] < md)) {\n\t\t\t\tmd = dist[v];\n\t\t\t\tmv = v;\n\t\t\t}\n\t\t}\n\t\treturn mv;\n\t}\n\t//implement the following\t\n\tpublic int[] Dijkstra(int s) {\n\t\tint [] D = new int[totalVertex];\n\t\tfor(int i=0; i UnsettleNeighbors = getUnsettledNeighbors(s);\n\t\t\tIterator it = UnsettleNeighbors.iterator();\n\t\t\twhile(it.hasNext()){\n\t\t\t\tint v = it.next();\n\t\t\t\tif(D[v] > (D[s] + adjWeight[s][v]))\n\t\t\t\t\tD[v] = D[s] + adjWeight[s][v];\n\t\t\t}\n\t\t\ts = getUnsettledNearest(D);\n\t\t}\t\t\n\t\treturn D;\n\t}\n}\n\npublic class Main {\n\tpublic static void main(String[] argv) {\n\t\tGraph g = new Graph();\n\t\tg.loadAdjMatrix();\n\t\tint[] dist = g.Dijkstra(0);\n\t\tfor(int i = 0; i < g.getTotalVertex(); i ++) {\n\t\t\tSystem.out.println(i + \" \" + dist[i]);\n\t\t}\n\t}\n}\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nSingle Source Shortest Path\n\nFor a given weighted graph $G = (V, E)$, find the shortest path from a source to each vertex. For each vertex $u$, print the total weight of edges on the shortest path from vertex $0$ to $u$.\n\nInput\n\nIn the first line, an integer $n$ denoting the number of vertices in $G$ is given. In the following $n$ lines, adjacency lists for each vertex $u$ are respectively given in the following format:\n\n$u$ $k$ $v_1$ $c_1$ $v_2$ $c_2$ ... $v_k$ $c_k$\n\nVertices in $G$ are named with IDs $0, 1, ..., n-1$. $u$ is ID of the target vertex and $k$ denotes its degree. $v_i (i = 1, 2, ... k)$ denote IDs of vertices adjacent to $u$ and $c_i$ denotes the weight of a directed edge connecting $u$ and $v_i$ (from $u$ to $v_i$).\n\nOutput\n\nFor each vertex, print its ID and the distance separated by a space character in a line respectively. Print in order of vertex IDs.\n\nConstraints\n\n$1 \\leq n \\leq 100$\n\n$0 \\leq c_i \\leq 100,000$\n\n$|E| \\leq 10,000$\n\nAll vertices are reachable from vertex $0$\n\nSample Input 1\n\n5\n0 3 2 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 3 1 4 1\n3 4 2 1 0 1 1 4 4 3\n4 2 2 1 3 3\n\nSample Output 1\n\n0 0\n1 2\n2 2\n3 1\n4 3\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "5\n0 3 2 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 3 1 4 1\n3 4 2 1 0 1 1 4 4 3\n4 2 2 1 3 3\n"}, "reference_outputs": ["0 0\n1 2\n2 2\n3 1\n4 3\n"], "source_document_id": "p02242", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nSingle Source Shortest Path\n\nFor a given weighted graph $G = (V, E)$, find the shortest path from a source to each vertex. For each vertex $u$, print the total weight of edges on the shortest path from vertex $0$ to $u$.\n\nInput\n\nIn the first line, an integer $n$ denoting the number of vertices in $G$ is given. In the following $n$ lines, adjacency lists for each vertex $u$ are respectively given in the following format:\n\n$u$ $k$ $v_1$ $c_1$ $v_2$ $c_2$ ... $v_k$ $c_k$\n\nVertices in $G$ are named with IDs $0, 1, ..., n-1$. $u$ is ID of the target vertex and $k$ denotes its degree. $v_i (i = 1, 2, ... k)$ denote IDs of vertices adjacent to $u$ and $c_i$ denotes the weight of a directed edge connecting $u$ and $v_i$ (from $u$ to $v_i$).\n\nOutput\n\nFor each vertex, print its ID and the distance separated by a space character in a line respectively. Print in order of vertex IDs.\n\nConstraints\n\n$1 \\leq n \\leq 100$\n\n$0 \\leq c_i \\leq 100,000$\n\n$|E| \\leq 10,000$\n\nAll vertices are reachable from vertex $0$\n\nSample Input 1\n\n5\n0 3 2 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 3 1 4 1\n3 4 2 1 0 1 1 4 4 3\n4 2 2 1 3 3\n\nSample Output 1\n\n0 0\n1 2\n2 2\n3 1\n4 3\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3012, "cpu_time_ms": 240, "memory_kb": 39972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s948493614", "group_id": "codeNet:p02250", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringBuffer sb = new StringBuffer();\n\t\t\n\t\tString str = br.readLine();\n\t\tint n = Integer.parseInt(br.readLine());\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tString temp = br.readLine();\n\t\t\tif(str.contains(temp)){\n\t\t\t\tsb.append(\"1\" + \"\\n\");\n\t\t\t} else {\n\t\t\t\tsb.append(\"0\" + \"\\n\");\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(sb.toString());\n\t}\n}", "language": "Java", "metadata": {"date": 1471413075, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02250.html", "problem_id": "p02250", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02250/input.txt", "sample_output_relpath": "derived/input_output/data/p02250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02250/Java/s948493614.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s948493614", "user_id": "u960488816"}, "prompt_components": {"gold_output": "1\n1\n0\n0\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringBuffer sb = new StringBuffer();\n\t\t\n\t\tString str = br.readLine();\n\t\tint n = Integer.parseInt(br.readLine());\n\t\t\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tString temp = br.readLine();\n\t\t\tif(str.contains(temp)){\n\t\t\t\tsb.append(\"1\" + \"\\n\");\n\t\t\t} else {\n\t\t\t\tsb.append(\"0\" + \"\\n\");\n\t\t\t}\n\t\t}\n\t\tSystem.out.print(sb.toString());\n\t}\n}", "problem_context": "String Search\n\nDetermine whether a text T includes a pattern P. Your program should answer for given queries consisting of P_i.\n\nInput\n\nIn the first line, a text T is given. In the second line, an integer Q denoting the number of queries is given. In the following Q lines, the patterns P_i are given respectively.\n\nOutput\n\nFor each question, print 1 if the text includes P_i, or print 0 otherwise.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P_i ≤ 1000\n\n1 ≤ Q ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\n4\naa\nba\nbb\nxyz\n\nSample Output 1\n\n1\n1\n0\n0", "sample_input": "aabaaa\n4\naa\nba\nbb\nxyz\n"}, "reference_outputs": ["1\n1\n0\n0\n"], "source_document_id": "p02250", "source_text": "String Search\n\nDetermine whether a text T includes a pattern P. Your program should answer for given queries consisting of P_i.\n\nInput\n\nIn the first line, a text T is given. In the second line, an integer Q denoting the number of queries is given. In the following Q lines, the patterns P_i are given respectively.\n\nOutput\n\nFor each question, print 1 if the text includes P_i, or print 0 otherwise.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P_i ≤ 1000\n\n1 ≤ Q ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\n4\naa\nba\nbb\nxyz\n\nSample Output 1\n\n1\n1\n0\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 543, "cpu_time_ms": 20000, "memory_kb": 40520}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s425327889", "group_id": "codeNet:p02255", "input_text": "import java.util.*;\n\nclass Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int a[],n;\n n = sc.nextInt();\n a = new int[n];\n for(int i=0;i0){\n if(a[j-1]>a[j]){\n int k = a[j-1];\n a[j-1] = a[j];\n a[j] = k;\n j--;\n }else{\n break;\n }\n }\n }\n print(a);\n }\n \n public static void print(int a[]){\n int n=a.length;\n System.out.print(a[0]);\n for(int i=1;i0){\n if(a[j-1]>a[j]){\n int k = a[j-1];\n a[j-1] = a[j];\n a[j] = k;\n j--;\n }else{\n break;\n }\n }\n }\n print(a);\n }\n \n public static void print(int a[]){\n int n=a.length;\n System.out.print(a[0]);\n for(int i=1;i= 0 and A[j] > key\nA[j+1] = A[j]\nj--\nA[j+1] = key\n\nNote that, indices for array elements are based on 0-origin.\n\nTo illustrate the algorithms, your program should trace intermediate result for each step.\n\nInput\n\nThe first line of the input includes an integer N, the number of elements in the sequence.\n\nIn the second line, N elements of the sequence are given separated by a single space.\n\nOutput\n\nThe output consists of N lines. Please output the intermediate sequence in a line for each step. Elements of the sequence should be separated by single space.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nSample Input 1\n\n6\n5 2 4 6 1 3\n\nSample Output 1\n\n5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n1 2 3\n1 2 3\n1 2 3\n\nHint\n\nTemplate in C", "sample_input": "6\n5 2 4 6 1 3\n"}, "reference_outputs": ["5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n"], "source_document_id": "p02255", "source_text": "Insertion Sort\n\nWrite a program of the Insertion Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:\n\nfor i = 1 to A.length-1\nkey = A[i]\n/* insert A[i] into the sorted sequence A[0,...,j-1] */\nj = i - 1\nwhile j >= 0 and A[j] > key\nA[j+1] = A[j]\nj--\nA[j+1] = key\n\nNote that, indices for array elements are based on 0-origin.\n\nTo illustrate the algorithms, your program should trace intermediate result for each step.\n\nInput\n\nThe first line of the input includes an integer N, the number of elements in the sequence.\n\nIn the second line, N elements of the sequence are given separated by a single space.\n\nOutput\n\nThe output consists of N lines. Please output the intermediate sequence in a line for each step. Elements of the sequence should be separated by single space.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nSample Input 1\n\n6\n5 2 4 6 1 3\n\nSample Output 1\n\n5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n1 2 3\n1 2 3\n1 2 3\n\nHint\n\nTemplate in C", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 854, "cpu_time_ms": 150, "memory_kb": 34132}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s116287843", "group_id": "codeNet:p02255", "input_text": "import java.util.InputMismatchException;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\ttry {\n\t\t\tint n = sc.nextInt();\n\n\t\t\tint[] a = new int[n];\n\n\t\t\tfor(int i = 0; i < a.length; i++) {\n\t\t\t\ta[i] = sc.nextInt();\n\t\t\t}\n\n\t\t\tdisp(a);\n\t\t\tinsertionSort(a);\n\t\t} catch(InputMismatchException ex) {\n\t\t\tex.printStackTrace();\n\t\t} finally {\n\t\t\tsc.close();\n\t\t}\n\t}\n\n\tprivate static void insertionSort(int[] a) {\n\t\tfor(int i = 1; i < a.length; i++) {\n\t\t\tint v = a[i];\n\t\t\tint j = i - 1;\n\n\t\t\twhile(j >= 0 && a[j] > v) {\n\t\t\t\ta[j + 1] = a[j];\n\n\t\t\t\tj--;\n\t\t\t}\n\n\t\t\ta[j + 1] = v;\n\n\t\t\tdisp(a);\n\t\t}\n\t}\n\n\tprivate static void disp(int[] a) {\n\t\tfor(int i = 0; i < a.length - 1; i++) {\n\t\t\tSystem.out.print(a[i] + \" \");\n\t\t}\n\n\t\tSystem.out.println(a[a.length - 1]);\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1572005758, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02255.html", "problem_id": "p02255", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02255/input.txt", "sample_output_relpath": "derived/input_output/data/p02255/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02255/Java/s116287843.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s116287843", "user_id": "u927297989"}, "prompt_components": {"gold_output": "5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n", "input_to_evaluate": "import java.util.InputMismatchException;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\ttry {\n\t\t\tint n = sc.nextInt();\n\n\t\t\tint[] a = new int[n];\n\n\t\t\tfor(int i = 0; i < a.length; i++) {\n\t\t\t\ta[i] = sc.nextInt();\n\t\t\t}\n\n\t\t\tdisp(a);\n\t\t\tinsertionSort(a);\n\t\t} catch(InputMismatchException ex) {\n\t\t\tex.printStackTrace();\n\t\t} finally {\n\t\t\tsc.close();\n\t\t}\n\t}\n\n\tprivate static void insertionSort(int[] a) {\n\t\tfor(int i = 1; i < a.length; i++) {\n\t\t\tint v = a[i];\n\t\t\tint j = i - 1;\n\n\t\t\twhile(j >= 0 && a[j] > v) {\n\t\t\t\ta[j + 1] = a[j];\n\n\t\t\t\tj--;\n\t\t\t}\n\n\t\t\ta[j + 1] = v;\n\n\t\t\tdisp(a);\n\t\t}\n\t}\n\n\tprivate static void disp(int[] a) {\n\t\tfor(int i = 0; i < a.length - 1; i++) {\n\t\t\tSystem.out.print(a[i] + \" \");\n\t\t}\n\n\t\tSystem.out.println(a[a.length - 1]);\n\t}\n}\n\n", "problem_context": "Insertion Sort\n\nWrite a program of the Insertion Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:\n\nfor i = 1 to A.length-1\nkey = A[i]\n/* insert A[i] into the sorted sequence A[0,...,j-1] */\nj = i - 1\nwhile j >= 0 and A[j] > key\nA[j+1] = A[j]\nj--\nA[j+1] = key\n\nNote that, indices for array elements are based on 0-origin.\n\nTo illustrate the algorithms, your program should trace intermediate result for each step.\n\nInput\n\nThe first line of the input includes an integer N, the number of elements in the sequence.\n\nIn the second line, N elements of the sequence are given separated by a single space.\n\nOutput\n\nThe output consists of N lines. Please output the intermediate sequence in a line for each step. Elements of the sequence should be separated by single space.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nSample Input 1\n\n6\n5 2 4 6 1 3\n\nSample Output 1\n\n5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n1 2 3\n1 2 3\n1 2 3\n\nHint\n\nTemplate in C", "sample_input": "6\n5 2 4 6 1 3\n"}, "reference_outputs": ["5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n"], "source_document_id": "p02255", "source_text": "Insertion Sort\n\nWrite a program of the Insertion Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:\n\nfor i = 1 to A.length-1\nkey = A[i]\n/* insert A[i] into the sorted sequence A[0,...,j-1] */\nj = i - 1\nwhile j >= 0 and A[j] > key\nA[j+1] = A[j]\nj--\nA[j+1] = key\n\nNote that, indices for array elements are based on 0-origin.\n\nTo illustrate the algorithms, your program should trace intermediate result for each step.\n\nInput\n\nThe first line of the input includes an integer N, the number of elements in the sequence.\n\nIn the second line, N elements of the sequence are given separated by a single space.\n\nOutput\n\nThe output consists of N lines. Please output the intermediate sequence in a line for each step. Elements of the sequence should be separated by single space.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nSample Input 1\n\n6\n5 2 4 6 1 3\n\nSample Output 1\n\n5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n1 2 3\n1 2 3\n1 2 3\n\nHint\n\nTemplate in C", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 822, "cpu_time_ms": 150, "memory_kb": 32232}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s725715700", "group_id": "codeNet:p02255", "input_text": "import java.util.Scanner;\n\npublic class Main\n{\n\n public static void main(String args[])\n {\n int N=0;\n Scanner s = new Scanner(System.in);\n N = s.nextInt();\n int[] number = new int[N];\n Scanner sc = new Scanner(System.in);\n for(int i=0;i=0;j--)\n {\n number[j+1]=number[j];\n if(t>number[j])break;\n }\n number[j+1]=t;\n for(int k=0;k=0;j--)\n {\n number[j+1]=number[j];\n if(t>number[j])break;\n }\n number[j+1]=t;\n for(int k=0;k= 0 and A[j] > key\nA[j+1] = A[j]\nj--\nA[j+1] = key\n\nNote that, indices for array elements are based on 0-origin.\n\nTo illustrate the algorithms, your program should trace intermediate result for each step.\n\nInput\n\nThe first line of the input includes an integer N, the number of elements in the sequence.\n\nIn the second line, N elements of the sequence are given separated by a single space.\n\nOutput\n\nThe output consists of N lines. Please output the intermediate sequence in a line for each step. Elements of the sequence should be separated by single space.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nSample Input 1\n\n6\n5 2 4 6 1 3\n\nSample Output 1\n\n5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n1 2 3\n1 2 3\n1 2 3\n\nHint\n\nTemplate in C", "sample_input": "6\n5 2 4 6 1 3\n"}, "reference_outputs": ["5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n"], "source_document_id": "p02255", "source_text": "Insertion Sort\n\nWrite a program of the Insertion Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:\n\nfor i = 1 to A.length-1\nkey = A[i]\n/* insert A[i] into the sorted sequence A[0,...,j-1] */\nj = i - 1\nwhile j >= 0 and A[j] > key\nA[j+1] = A[j]\nj--\nA[j+1] = key\n\nNote that, indices for array elements are based on 0-origin.\n\nTo illustrate the algorithms, your program should trace intermediate result for each step.\n\nInput\n\nThe first line of the input includes an integer N, the number of elements in the sequence.\n\nIn the second line, N elements of the sequence are given separated by a single space.\n\nOutput\n\nThe output consists of N lines. Please output the intermediate sequence in a line for each step. Elements of the sequence should be separated by single space.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nSample Input 1\n\n6\n5 2 4 6 1 3\n\nSample Output 1\n\n5 2 4 6 1 3\n2 5 4 6 1 3\n2 4 5 6 1 3\n2 4 5 6 1 3\n1 2 4 5 6 3\n1 2 3 4 5 6\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n1 2 3\n1 2 3\n1 2 3\n\nHint\n\nTemplate in C", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 726, "cpu_time_ms": 160, "memory_kb": 33992}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s622720273", "group_id": "codeNet:p02257", "input_text": "import java.io.*;\nimport java.util.*;\n\n\n\npublic class Main{\n public static void main(String[] args)throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String str;\n \n str = br.readLine();\n int x = Integer.parseInt(str.trim());\n\n int ans = 0;\n for(int i = 0;i < x ;i++){\n str = br.readLine();\n int temp = Integer.parseInt(str.trim());\n int count = 0;\n for(int j = 1; j <= temp ;j++){\n int m = temp % j;\n if(m == 0){\n count++;\n }\n }\n if(count ==2){\n ans++;\n //System.out.println(temp);\n }\n }\n\n System.out.println(ans);\n\n br.close();\n }\n\n \n}\n\n", "language": "Java", "metadata": {"date": 1515556713, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02257.html", "problem_id": "p02257", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02257/input.txt", "sample_output_relpath": "derived/input_output/data/p02257/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02257/Java/s622720273.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s622720273", "user_id": "u097204849"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\n\n\npublic class Main{\n public static void main(String[] args)throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String str;\n \n str = br.readLine();\n int x = Integer.parseInt(str.trim());\n\n int ans = 0;\n for(int i = 0;i < x ;i++){\n str = br.readLine();\n int temp = Integer.parseInt(str.trim());\n int count = 0;\n for(int j = 1; j <= temp ;j++){\n int m = temp % j;\n if(m == 0){\n count++;\n }\n }\n if(count ==2){\n ans++;\n //System.out.println(temp);\n }\n }\n\n System.out.println(ans);\n\n br.close();\n }\n\n \n}\n\n", "problem_context": "Prime Numbers\n\nA prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nWrite a program which reads a list of N integers and prints the number of prime numbers in the list.\n\nInput\n\nThe first line contains an integer N, the number of elements in the list.\n\nN numbers are given in the following lines.\n\nOutput\n\nPrint the number of prime numbers in the given list.\n\nConstraints\n\n1 ≤ N ≤ 10000\n\n2 ≤ an element of the list ≤ 108\n\nSample Input 1\n\n5\n2\n3\n4\n5\n6\n\nSample Output 1\n\n3\n\nSample Input 2\n\n11\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n\nSample Output 2\n\n4", "sample_input": "5\n2\n3\n4\n5\n6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02257", "source_text": "Prime Numbers\n\nA prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nWrite a program which reads a list of N integers and prints the number of prime numbers in the list.\n\nInput\n\nThe first line contains an integer N, the number of elements in the list.\n\nN numbers are given in the following lines.\n\nOutput\n\nPrint the number of prime numbers in the given list.\n\nConstraints\n\n1 ≤ N ≤ 10000\n\n2 ≤ an element of the list ≤ 108\n\nSample Input 1\n\n5\n2\n3\n4\n5\n6\n\nSample Output 1\n\n3\n\nSample Input 2\n\n11\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n\nSample Output 2\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 845, "cpu_time_ms": 20000, "memory_kb": 24900}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s394780227", "group_id": "codeNet:p02258", "input_text": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Scanner;\n\nclass Main {\n\tprivate static Scanner scanner;\n\tpublic static void main(String[] args) {\n\t\tint answer = 0;\n\t\tint count = 0;\n\t\tboolean flag = false;\n\t\tList list = new ArrayList();\n\t\tscanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tfor(int i=0; i distinctList = distinct(list);\n\t\tCollections.sort(distinctList);\n\t\tif(distinctList.size() > 100)count = 100;\n\t\tfor(int i=0; i tmpList = list.subList(0, maxIndex);\n\t\t\tif((!tmpList.isEmpty())){\n\t\t\t\tif(!flag){\n\t\t\t\t\tanswer = distinctList.get(distinctList.size() - (i+1)) - Collections.min(tmpList);\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\telse if(answer < (distinctList.get(distinctList.size() - (i+1)) - Collections.min(tmpList))){\n\t\t\t\t\tanswer = distinctList.get(distinctList.size() - (i+1)) - Collections.min(tmpList);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n\tpublic static List distinct(List list){\n\t\tList distictList = new ArrayList();\n\t\tfor(int i: list){\n\t\t\tif(!distictList.contains(i))distictList.add(i);\n\t\t}\n\t\treturn distictList;\n\t}\n}", "language": "Java", "metadata": {"date": 1448850380, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02258.html", "problem_id": "p02258", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02258/input.txt", "sample_output_relpath": "derived/input_output/data/p02258/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02258/Java/s394780227.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s394780227", "user_id": "u804254121"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Scanner;\n\nclass Main {\n\tprivate static Scanner scanner;\n\tpublic static void main(String[] args) {\n\t\tint answer = 0;\n\t\tint count = 0;\n\t\tboolean flag = false;\n\t\tList list = new ArrayList();\n\t\tscanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tfor(int i=0; i distinctList = distinct(list);\n\t\tCollections.sort(distinctList);\n\t\tif(distinctList.size() > 100)count = 100;\n\t\tfor(int i=0; i tmpList = list.subList(0, maxIndex);\n\t\t\tif((!tmpList.isEmpty())){\n\t\t\t\tif(!flag){\n\t\t\t\t\tanswer = distinctList.get(distinctList.size() - (i+1)) - Collections.min(tmpList);\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\telse if(answer < (distinctList.get(distinctList.size() - (i+1)) - Collections.min(tmpList))){\n\t\t\t\t\tanswer = distinctList.get(distinctList.size() - (i+1)) - Collections.min(tmpList);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer);\n\t}\n\tpublic static List distinct(List list){\n\t\tList distictList = new ArrayList();\n\t\tfor(int i: list){\n\t\t\tif(!distictList.contains(i))distictList.add(i);\n\t\t}\n\t\treturn distictList;\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMaximum Profit\n\nYou can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108 - 100) × 1000 = 8000 yen.\n\nWrite a program which reads values of a currency $R_t$ at a certain time $t$ ($t = 0, 1, 2, ... n-1$), and reports the maximum value of $R_j - R_i$ where $j > i$ .\n\nInput\n\nThe first line contains an integer $n$. In the following $n$ lines, $R_t$ ($t = 0, 1, 2, ... n-1$) are given in order.\n\nOutput\n\nPrint the maximum value in a line.\n\nConstraints\n\n$2 \\leq n \\leq 200,000$\n\n$1 \\leq R_t \\leq 10^9$\n\nSample Input 1\n\n6\n5\n3\n1\n3\n4\n3\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n4\n3\n2\n\nSample Output 2\n\n-1", "sample_input": "6\n5\n3\n1\n3\n4\n3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02258", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMaximum Profit\n\nYou can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108 - 100) × 1000 = 8000 yen.\n\nWrite a program which reads values of a currency $R_t$ at a certain time $t$ ($t = 0, 1, 2, ... n-1$), and reports the maximum value of $R_j - R_i$ where $j > i$ .\n\nInput\n\nThe first line contains an integer $n$. In the following $n$ lines, $R_t$ ($t = 0, 1, 2, ... n-1$) are given in order.\n\nOutput\n\nPrint the maximum value in a line.\n\nConstraints\n\n$2 \\leq n \\leq 200,000$\n\n$1 \\leq R_t \\leq 10^9$\n\nSample Input 1\n\n6\n5\n3\n1\n3\n4\n3\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n4\n3\n2\n\nSample Output 2\n\n-1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1345, "cpu_time_ms": 20000, "memory_kb": 104924}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s011833891", "group_id": "codeNet:p02259", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n int ans = 0;\n for(int i = 0; i < n; i++){\n a[i] = sc.nextInt();\n }\n boolean flag = true;\n while(flag){\n flag = false;\n for(int j = n-1; j > 0; j--){\n if(a[j] < a[j-1]){\n int work = a[j];\n a[j] = a[j-1];\n a[j-1] = work;\n ans ++;\n flag =true;\n }\n }\n }\n for(int i = 0; i < n-1; i++){\n System.out.print(a[i] + \" \");\n }\n System.out.println(a[n-1]);\n System.out.println(ans);\n }\n}\n\n", "language": "Java", "metadata": {"date": 1540254578, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02259.html", "problem_id": "p02259", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02259/input.txt", "sample_output_relpath": "derived/input_output/data/p02259/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02259/Java/s011833891.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s011833891", "user_id": "u092291001"}, "prompt_components": {"gold_output": "1 2 3 4 5\n8\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n int ans = 0;\n for(int i = 0; i < n; i++){\n a[i] = sc.nextInt();\n }\n boolean flag = true;\n while(flag){\n flag = false;\n for(int j = n-1; j > 0; j--){\n if(a[j] < a[j-1]){\n int work = a[j];\n a[j] = a[j-1];\n a[j-1] = work;\n ans ++;\n flag =true;\n }\n }\n }\n for(int i = 0; i < n-1; i++){\n System.out.print(a[i] + \" \");\n }\n System.out.println(a[n-1]);\n System.out.println(ans);\n }\n}\n\n", "problem_context": "Bubble Sort\n\nWrite a program of the Bubble Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:\n\nBubbleSort(A)\n1 for i = 0 to A.length-1\n2 for j = A.length-1 downto i+1\n3 if A[j] < A[j-1]\n4 swap A[j] and A[j-1]\n\nNote that, indices for array elements are based on 0-origin.\n\nYour program should also print the number of swap operations defined in line 4 of the pseudocode.\n\nInput\n\nThe first line of the input includes an integer N, the number of elements in the sequence.\n\nIn the second line, N elements of the sequence are given separated by spaces characters.\n\nOutput\n\nThe output consists of 2 lines.\n\nIn the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nIn the second line, please print the number of swap operations.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nSample Input 1\n\n5\n5 3 2 4 1\n\nSample Output 1\n\n1 2 3 4 5\n8\n\nSample Input 2\n\n6\n5 2 4 6 1 3\n\nSample Output 2\n\n1 2 3 4 5 6\n9", "sample_input": "5\n5 3 2 4 1\n"}, "reference_outputs": ["1 2 3 4 5\n8\n"], "source_document_id": "p02259", "source_text": "Bubble Sort\n\nWrite a program of the Bubble Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:\n\nBubbleSort(A)\n1 for i = 0 to A.length-1\n2 for j = A.length-1 downto i+1\n3 if A[j] < A[j-1]\n4 swap A[j] and A[j-1]\n\nNote that, indices for array elements are based on 0-origin.\n\nYour program should also print the number of swap operations defined in line 4 of the pseudocode.\n\nInput\n\nThe first line of the input includes an integer N, the number of elements in the sequence.\n\nIn the second line, N elements of the sequence are given separated by spaces characters.\n\nOutput\n\nThe output consists of 2 lines.\n\nIn the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nIn the second line, please print the number of swap operations.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nSample Input 1\n\n5\n5 3 2 4 1\n\nSample Output 1\n\n1 2 3 4 5\n8\n\nSample Input 2\n\n6\n5 2 4 6 1 3\n\nSample Output 2\n\n1 2 3 4 5 6\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 838, "cpu_time_ms": 60, "memory_kb": 26300}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s719207971", "group_id": "codeNet:p02259", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main{\n\tstatic int N;\n\tstatic int [] A;\n\tstatic int max;\n\tstatic int count;\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tN = Integer.parseInt(br.readLine());\n\t\tString [] temp = br.readLine().split(\" \");\n\t\tmax = temp.length;\n\t\tA = new int[max];\n\t\tfor(int i=0;i < max;i++){\n\t\t\tA[i] = Integer.parseInt(temp[i]);\n\t\t}\n\n\t\tfor(int i=0;i < max;i++){\n\t\t\tsort();\n\t\t}\n\n\t\tfor(int i=0;i < max-1;i++){\n\t\t\tSystem.out.print(A[i]+\" \");\n\t\t}\n\t\tSystem.out.println(A[max-1]);\n\t\tSystem.out.print(count);\n\t}\n\n\tpublic static void sort(){\n\t\tfor(int i=max-1;i>0;i--){\n\t\t\tif(A[i] >= A[i-1]){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tint num = A[i];\n\t\t\t\tA[i] = A[i-1];\n\t\t\t\tA[i-1] = num;\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}\n\t}\n\n}", "language": "Java", "metadata": {"date": 1467556452, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02259.html", "problem_id": "p02259", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02259/input.txt", "sample_output_relpath": "derived/input_output/data/p02259/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02259/Java/s719207971.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s719207971", "user_id": "u108371401"}, "prompt_components": {"gold_output": "1 2 3 4 5\n8\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main{\n\tstatic int N;\n\tstatic int [] A;\n\tstatic int max;\n\tstatic int count;\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tN = Integer.parseInt(br.readLine());\n\t\tString [] temp = br.readLine().split(\" \");\n\t\tmax = temp.length;\n\t\tA = new int[max];\n\t\tfor(int i=0;i < max;i++){\n\t\t\tA[i] = Integer.parseInt(temp[i]);\n\t\t}\n\n\t\tfor(int i=0;i < max;i++){\n\t\t\tsort();\n\t\t}\n\n\t\tfor(int i=0;i < max-1;i++){\n\t\t\tSystem.out.print(A[i]+\" \");\n\t\t}\n\t\tSystem.out.println(A[max-1]);\n\t\tSystem.out.print(count);\n\t}\n\n\tpublic static void sort(){\n\t\tfor(int i=max-1;i>0;i--){\n\t\t\tif(A[i] >= A[i-1]){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tint num = A[i];\n\t\t\t\tA[i] = A[i-1];\n\t\t\t\tA[i-1] = num;\n\t\t\t\tcount++;\n\t\t\t}\n\n\n\t\t}\n\t}\n\n}", "problem_context": "Bubble Sort\n\nWrite a program of the Bubble Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:\n\nBubbleSort(A)\n1 for i = 0 to A.length-1\n2 for j = A.length-1 downto i+1\n3 if A[j] < A[j-1]\n4 swap A[j] and A[j-1]\n\nNote that, indices for array elements are based on 0-origin.\n\nYour program should also print the number of swap operations defined in line 4 of the pseudocode.\n\nInput\n\nThe first line of the input includes an integer N, the number of elements in the sequence.\n\nIn the second line, N elements of the sequence are given separated by spaces characters.\n\nOutput\n\nThe output consists of 2 lines.\n\nIn the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nIn the second line, please print the number of swap operations.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nSample Input 1\n\n5\n5 3 2 4 1\n\nSample Output 1\n\n1 2 3 4 5\n8\n\nSample Input 2\n\n6\n5 2 4 6 1 3\n\nSample Output 2\n\n1 2 3 4 5 6\n9", "sample_input": "5\n5 3 2 4 1\n"}, "reference_outputs": ["1 2 3 4 5\n8\n"], "source_document_id": "p02259", "source_text": "Bubble Sort\n\nWrite a program of the Bubble Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:\n\nBubbleSort(A)\n1 for i = 0 to A.length-1\n2 for j = A.length-1 downto i+1\n3 if A[j] < A[j-1]\n4 swap A[j] and A[j-1]\n\nNote that, indices for array elements are based on 0-origin.\n\nYour program should also print the number of swap operations defined in line 4 of the pseudocode.\n\nInput\n\nThe first line of the input includes an integer N, the number of elements in the sequence.\n\nIn the second line, N elements of the sequence are given separated by spaces characters.\n\nOutput\n\nThe output consists of 2 lines.\n\nIn the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nIn the second line, please print the number of swap operations.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nSample Input 1\n\n5\n5 3 2 4 1\n\nSample Output 1\n\n1 2 3 4 5\n8\n\nSample Input 2\n\n6\n5 2 4 6 1 3\n\nSample Output 2\n\n1 2 3 4 5 6\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 879, "cpu_time_ms": 30, "memory_kb": 23956}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s839477919", "group_id": "codeNet:p02259", "input_text": "import java.util.Scanner;\n\n/**\n * \n */\n\n/**\n * @author kawakami\n *\n */\nclass Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tStringBuilder sb = new StringBuilder();\n\t\tScanner as = new Scanner(System.in);\n\t\t\n\t\tint N = 0;\n\t\tint tre = 0;\n\t\tint count = 0;\n\t\tint A[];\n\t\t\n\t\tBoolean flag = true;\n\t\t\n\t\tN = Integer.parseInt(as.next());\n\t\t\n\t\tA = new int[N];\n\t\t\n\t\tfor(int i=0;i=1;j--){\n\t\t\t\t\n\t\t\t\tif(A[j] < A[j-1]){\n\t\t\t\t\t\n\t\t\t\t\ttre = A[j];\n\t\t\t\t\tA[j] = A[j-1];\n\t\t\t\t\tA[j-1] = tre;\n\t\t\t\t\tflag = true;\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tfor(int i=0;i=1;j--){\n\t\t\t\t\n\t\t\t\tif(A[j] < A[j-1]){\n\t\t\t\t\t\n\t\t\t\t\ttre = A[j];\n\t\t\t\t\tA[j] = A[j-1];\n\t\t\t\t\tA[j-1] = tre;\n\t\t\t\t\tflag = true;\n\t\t\t\t\tcount++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tfor(int i=0;i 0; i-- ) {\n\t\t\t\tcompareNum1 = cardNumBubbleSort[i].substring(1);\n\t\t\t\tcompareNum2 = cardNumBubbleSort[i - 1].substring(1);\n\t\t\t\tcompareNumResult = compareNum1.compareTo(compareNum2);\n\t\t\t\tif(compareNumResult < 0) {\n\t\t\t\t\tString tmp = cardNumBubbleSort[i - 1];\n\t\t\t\t\tcardNumBubbleSort[i - 1] = cardNumBubbleSort[i];\n\t\t\t\t\tcardNumBubbleSort[i] = tmp;\n\t\t\t\t\tisSortFlag = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprintArray(cardNumBubbleSort);\n\n\t\tif(isStable(card, cardNumBubbleSort, progCardNumOfSheets)) {\n\t\t\tSystem.out.println(\"Stable\");\n\t\t} else {\n\t\t\tSystem.out.println(\"Not stable\");\n\t\t}\n\n\t\tint minNum = 0;\n\t\tfor(int i = 0; i < progCardNumOfSheets; i++) {\n\t\t\tminNum = i;\n\n\t\t\tfor(int j = i; j < progCardNumOfSheets; j++) {\n\t\t\t\tcompareNum1 = cardNumSelectionSort[j].substring(1);\n\t\t\t\tcompareNum2 = cardNumSelectionSort[minNum].substring(1);\n\t\t\t\tcompareNumResult = compareNum1.compareTo(compareNum2);\n\t\t\t\tif(compareNumResult < 0) {\n\t\t\t\t\tminNum = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(i != minNum) {\n\t\t\t\tString tmp = cardNumSelectionSort[i];\n\t\t\t\tcardNumSelectionSort[i] = cardNumSelectionSort[minNum];\n\t\t\t\tcardNumSelectionSort[minNum] = tmp;\n\t\t\t}\n\t\t}\n\n\t\tprintArray(cardNumSelectionSort);\n\n\t\tif(isStable(card, cardNumSelectionSort, progCardNumOfSheets)) {\n\t\t\tSystem.out.println(\"Stable\");\n\t\t} else {\n\t\t\tSystem.out.println(\"Not stable\");\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1502163010, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02261.html", "problem_id": "p02261", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02261/input.txt", "sample_output_relpath": "derived/input_output/data/p02261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02261/Java/s341573040.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s341573040", "user_id": "u231662285"}, "prompt_components": {"gold_output": "D2 C3 H4 S4 C9\nStable\nD2 C3 S4 H4 C9\nNot stable\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void printArray(String[] cardSort) {\n\t\tfor (int i = 0; i < cardSort.length; i++) {\n\t\t\tSystem.out.print(cardSort[i]);\n\n\t\t\tif (i == cardSort.length - 1) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tSystem.out.print(\" \");\n\t\t}\n\t\tSystem.out.println();\n\t}\n\n\tpublic static boolean isStable(String in[], String out[], int N) {\n\t\t\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tfor(int j = i + 1; j < N; j++) {\n\t\t\t\tfor(int a = 0; a < N; a++) {\n\t\t\t\t\tfor(int b = a + 1; b < N; b++) {\n\t\t\t\t\t\tif(in[i].charAt(1) == in[j].charAt(1) && in[i].equals(out[b]) && in[j].equals(out[a])) {\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tint progCardNumOfSheets = Integer.parseInt(br.readLine());\n\n\t\tString[] card = br.readLine().split(\" \");\n\n\t\tString[] cardNumBubbleSort = new String[progCardNumOfSheets];\n\t\tString[] cardNumSelectionSort = new String[progCardNumOfSheets];\n\n\n\t\tfor(int i = 0; i < progCardNumOfSheets; i++) {\n\t\t\tcardNumBubbleSort[i] = card[i];\n\t\t\tcardNumSelectionSort[i] = card[i];\n\t\t}\n\n\t\tint compareNumResult = 0;\n\t\tString compareNum1 = \"\";\n\t\tString compareNum2 = \"\";\n\n\t\tboolean isSortFlag = true;\n\n\t\twhile(isSortFlag) {\n\t\t\tisSortFlag = false;\n\n\t\t\tfor(int i = progCardNumOfSheets - 1; i > 0; i-- ) {\n\t\t\t\tcompareNum1 = cardNumBubbleSort[i].substring(1);\n\t\t\t\tcompareNum2 = cardNumBubbleSort[i - 1].substring(1);\n\t\t\t\tcompareNumResult = compareNum1.compareTo(compareNum2);\n\t\t\t\tif(compareNumResult < 0) {\n\t\t\t\t\tString tmp = cardNumBubbleSort[i - 1];\n\t\t\t\t\tcardNumBubbleSort[i - 1] = cardNumBubbleSort[i];\n\t\t\t\t\tcardNumBubbleSort[i] = tmp;\n\t\t\t\t\tisSortFlag = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprintArray(cardNumBubbleSort);\n\n\t\tif(isStable(card, cardNumBubbleSort, progCardNumOfSheets)) {\n\t\t\tSystem.out.println(\"Stable\");\n\t\t} else {\n\t\t\tSystem.out.println(\"Not stable\");\n\t\t}\n\n\t\tint minNum = 0;\n\t\tfor(int i = 0; i < progCardNumOfSheets; i++) {\n\t\t\tminNum = i;\n\n\t\t\tfor(int j = i; j < progCardNumOfSheets; j++) {\n\t\t\t\tcompareNum1 = cardNumSelectionSort[j].substring(1);\n\t\t\t\tcompareNum2 = cardNumSelectionSort[minNum].substring(1);\n\t\t\t\tcompareNumResult = compareNum1.compareTo(compareNum2);\n\t\t\t\tif(compareNumResult < 0) {\n\t\t\t\t\tminNum = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(i != minNum) {\n\t\t\t\tString tmp = cardNumSelectionSort[i];\n\t\t\t\tcardNumSelectionSort[i] = cardNumSelectionSort[minNum];\n\t\t\t\tcardNumSelectionSort[minNum] = tmp;\n\t\t\t}\n\t\t}\n\n\t\tprintArray(cardNumSelectionSort);\n\n\t\tif(isStable(card, cardNumSelectionSort, progCardNumOfSheets)) {\n\t\t\tSystem.out.println(\"Stable\");\n\t\t} else {\n\t\t\tSystem.out.println(\"Not stable\");\n\t\t}\n\t}\n}", "problem_context": "Stable Sort\n\nLet's arrange a deck of cards. There are totally 36 cards of 4 suits(S, H, C, D) and 9 values (1, 2, ... 9). For example, 'eight of heart' is represented by H8 and 'one of diamonds' is represented by D1.\n\nYour task is to write a program which sorts a given set of cards in ascending order by their values using the Bubble Sort algorithms and the Selection Sort algorithm respectively. These algorithms should be based on the following pseudocode:\n\nBubbleSort(C)\n1 for i = 0 to C.length-1\n2 for j = C.length-1 downto i+1\n3 if C[j].value < C[j-1].value\n4 swap C[j] and C[j-1]\n\nSelectionSort(C)\n1 for i = 0 to C.length-1\n2 mini = i\n3 for j = i to C.length-1\n4 if C[j].value < C[mini].value\n5 mini = j\n6 swap C[i] and C[mini]\n\nNote that, indices for array elements are based on 0-origin.\n\nFor each algorithm, report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer N, the number of cards.\n\nN cards are given in the following line. Each card is represented by two characters. Two consecutive cards are separated by a space character.\n\nOutput\n\nIn the first line, print the arranged cards provided by the Bubble Sort algorithm. Two consecutive cards should be separated by a space character.\n\nIn the second line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the third line, print the arranged cards provided by the Selection Sort algorithm. Two consecutive cards should be separated by a space character.\n\nIn the fourth line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nConstraints\n\n1 ≤ N ≤ 36\n\nSample Input 1\n\n5\nH4 C9 S4 D2 C3\n\nSample Output 1\n\nD2 C3 H4 S4 C9\nStable\nD2 C3 S4 H4 C9\nNot stable\n\nSample Input 2\n\n2\nS1 H1\n\nSample Output 2\n\nS1 H1\nStable\nS1 H1\nStable", "sample_input": "5\nH4 C9 S4 D2 C3\n"}, "reference_outputs": ["D2 C3 H4 S4 C9\nStable\nD2 C3 S4 H4 C9\nNot stable\n"], "source_document_id": "p02261", "source_text": "Stable Sort\n\nLet's arrange a deck of cards. There are totally 36 cards of 4 suits(S, H, C, D) and 9 values (1, 2, ... 9). For example, 'eight of heart' is represented by H8 and 'one of diamonds' is represented by D1.\n\nYour task is to write a program which sorts a given set of cards in ascending order by their values using the Bubble Sort algorithms and the Selection Sort algorithm respectively. These algorithms should be based on the following pseudocode:\n\nBubbleSort(C)\n1 for i = 0 to C.length-1\n2 for j = C.length-1 downto i+1\n3 if C[j].value < C[j-1].value\n4 swap C[j] and C[j-1]\n\nSelectionSort(C)\n1 for i = 0 to C.length-1\n2 mini = i\n3 for j = i to C.length-1\n4 if C[j].value < C[mini].value\n5 mini = j\n6 swap C[i] and C[mini]\n\nNote that, indices for array elements are based on 0-origin.\n\nFor each algorithm, report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer N, the number of cards.\n\nN cards are given in the following line. Each card is represented by two characters. Two consecutive cards are separated by a space character.\n\nOutput\n\nIn the first line, print the arranged cards provided by the Bubble Sort algorithm. Two consecutive cards should be separated by a space character.\n\nIn the second line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the third line, print the arranged cards provided by the Selection Sort algorithm. Two consecutive cards should be separated by a space character.\n\nIn the fourth line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nConstraints\n\n1 ≤ N ≤ 36\n\nSample Input 1\n\n5\nH4 C9 S4 D2 C3\n\nSample Output 1\n\nD2 C3 H4 S4 C9\nStable\nD2 C3 S4 H4 C9\nNot stable\n\nSample Input 2\n\n2\nS1 H1\n\nSample Output 2\n\nS1 H1\nStable\nS1 H1\nStable", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2760, "cpu_time_ms": 50, "memory_kb": 25504}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s238776580", "group_id": "codeNet:p02264", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main{\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] str = br.readLine().split(\" \");\n\t\tint n = Integer.parseInt(str[0]);\n\t\tint q = Integer.parseInt(str[1]);\n\t\tint[] data = new int[n];\n\t\tString[] sdata = new String[n];\n\t\tint counter = 0;\n\t\tint sum = 0;\n\t\tfor(int i = 0 ; i < n ; i ++){\n\t\t\tstr = br.readLine().split(\" \");\n\t\t\tsdata[i] = str[0];\n\t\t\tdata[i] = Integer.parseInt(str[1]);\n\t\t\tsum+=data[i];\n\t\t}\n\t\tfor(int i = 0 ; i <= n ; i ++){\n\t\t\tif(i==n)\n\t\t\t\ti=0;\n\t\t\tif(data[i]==0){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if(data[i]!=0 && data[i]>q){\n\t\t\t\tcounter+=q;\n\t\t\t\tdata[i]-=q;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if(data[i]!=0 && data[i]<=q){\n\t\t\t\tcounter+=data[i];\n\t\t\t\tSystem.out.println(sdata[i]+\" \"+counter);\n\t\t\t\tdata[i]=0;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(counter == sum)\n\t\t\t\tSystem.exit(0);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1404974762, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02264.html", "problem_id": "p02264", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02264/input.txt", "sample_output_relpath": "derived/input_output/data/p02264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02264/Java/s238776580.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s238776580", "user_id": "u574420836"}, "prompt_components": {"gold_output": "p2 180\np5 400\np1 450\np3 550\np4 800\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main{\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] str = br.readLine().split(\" \");\n\t\tint n = Integer.parseInt(str[0]);\n\t\tint q = Integer.parseInt(str[1]);\n\t\tint[] data = new int[n];\n\t\tString[] sdata = new String[n];\n\t\tint counter = 0;\n\t\tint sum = 0;\n\t\tfor(int i = 0 ; i < n ; i ++){\n\t\t\tstr = br.readLine().split(\" \");\n\t\t\tsdata[i] = str[0];\n\t\t\tdata[i] = Integer.parseInt(str[1]);\n\t\t\tsum+=data[i];\n\t\t}\n\t\tfor(int i = 0 ; i <= n ; i ++){\n\t\t\tif(i==n)\n\t\t\t\ti=0;\n\t\t\tif(data[i]==0){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if(data[i]!=0 && data[i]>q){\n\t\t\t\tcounter+=q;\n\t\t\t\tdata[i]-=q;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if(data[i]!=0 && data[i]<=q){\n\t\t\t\tcounter+=data[i];\n\t\t\t\tSystem.out.println(sdata[i]+\" \"+counter);\n\t\t\t\tdata[i]=0;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(counter == sum)\n\t\t\t\tSystem.exit(0);\n\t\t}\n\t}\n}", "problem_context": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "sample_input": "5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n"}, "reference_outputs": ["p2 180\np5 400\np1 450\np3 550\np4 800\n"], "source_document_id": "p02264", "source_text": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 981, "cpu_time_ms": 20000, "memory_kb": 19012}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s917481718", "group_id": "codeNet:p02265", "input_text": "import java.util.*;\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tDeque List = new ArrayDeque();\n\tint n;\n\tString order;\n\tint data;\n\tint ans;\n\tpublic void input() {\n\t\tn = sc.nextInt();\n\t\tfor(int i=0; i List = new ArrayDeque();\n\tint n;\n\tString order;\n\tint data;\n\tint ans;\n\tpublic void input() {\n\t\tn = sc.nextInt();\n\t\tfor(int i=0; i list = new ArrayList();\n\n public static void main(String[] args) {\n int total;\n\n Scanner inp = new Scanner(System.in);\n total = inp.nextInt();\n\n for (int k = 0; k < total; k++) {\n String command = inp.next();\n\n switch (command) {\n case \"insert\": {\n int num = inp.nextInt();\n\n insert_x(num);\n break;\n }\n case \"delete\": {\n int num = inp.nextInt();\n\n delete_x(num);\n break;\n }\n case \"deleteFirst\":\n deleteFirst();\n break;\n case \"deleteLast\":\n deleteLast();\n break;\n }\n }\n\n for (int l = 0; l < list.size(); l++) {\n System.out.printf(\" %d\", list.get(l));\n\n }\n }\n\n public static void insert_x(int num) {\n list.add(0, num);\n }\n\n public static void delete_x(int num) {\n list.remove(list.indexOf(num));\n }\n\n public static void deleteFirst() {\n list.remove(0);\n }\n\n public static void deleteLast() {\n list.remove(list.size()-1);\n }\n}\n\n", "language": "Java", "metadata": {"date": 1535687326, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02265.html", "problem_id": "p02265", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02265/input.txt", "sample_output_relpath": "derived/input_output/data/p02265/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02265/Java/s317286626.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s317286626", "user_id": "u647456682"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n public static ArrayList list = new ArrayList();\n\n public static void main(String[] args) {\n int total;\n\n Scanner inp = new Scanner(System.in);\n total = inp.nextInt();\n\n for (int k = 0; k < total; k++) {\n String command = inp.next();\n\n switch (command) {\n case \"insert\": {\n int num = inp.nextInt();\n\n insert_x(num);\n break;\n }\n case \"delete\": {\n int num = inp.nextInt();\n\n delete_x(num);\n break;\n }\n case \"deleteFirst\":\n deleteFirst();\n break;\n case \"deleteLast\":\n deleteLast();\n break;\n }\n }\n\n for (int l = 0; l < list.size(); l++) {\n System.out.printf(\" %d\", list.get(l));\n\n }\n }\n\n public static void insert_x(int num) {\n list.add(0, num);\n }\n\n public static void delete_x(int num) {\n list.remove(list.indexOf(num));\n }\n\n public static void deleteFirst() {\n list.remove(0);\n }\n\n public static void deleteLast() {\n list.remove(list.size()-1);\n }\n}\n\n", "problem_context": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "sample_input": "7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n"}, "reference_outputs": ["6 1 2\n"], "source_document_id": "p02265", "source_text": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1377, "cpu_time_ms": 50, "memory_kb": 26016}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s842378652", "group_id": "codeNet:p02265", "input_text": "import java.util.*;\nimport java.io.*;\n\nclass Main{\n static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n public static void main(String[] args) throws IOException{\n int num = Integer.parseInt(br.readLine());\n Deque ar = new ArrayDeque<>(num);\n for(int i=0; i ar = new ArrayDeque<>(num);\n for(int i=0; i lnk=new LinkedList();\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n int n=Integer.parseInt(br.readLine());\n for(int i=0;i lnk=new LinkedList();\n BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n int n=Integer.parseInt(br.readLine());\n for(int i=0;i map = new HashMap();\n\t\tint sum = 0;\n\n\t\tfor (int i=top; i>bottom; i--) {//高さ\n\t\t\tint start = -1;\n\t\t\tfor (int j=0; jlevel[j+1]) {//startが設定されているか '\\'であるか\n\t\t\t\t\t\t\tstart = j;\n\t\t\t\t\t\t}else if(start != -1){\n\t\t\t\t\t\t\tint count = 0;//傾斜数\n\t\t\t\t\t\t\tint vol = 0;\n\t\t\t\t\t\t\tfor (int k=start; k 0)\n\t\t\t\t\t\t\t\t\tcount++;\n\t\t\t\t\t\t\t\twater[k] = true;//水を入れる\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tvol += count/2;\n\t\t\t\t\t\t\tsum += vol;//総面積に足す\n\t\t\t\t\t\t\tmap.put(start,vol);\n\t\t\t\t\t\t\tstart = -1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(sum);\n\t\tSystem.out.print(map.size());\n\t\tfor (int i=0; map.size()!=0; i++) {\n\t\t\tif(map.containsKey(i)){\n\t\t\t\tSystem.out.print(\" \"+map.get(i));\n\t\t\t\tmap.remove(i);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println();\n\t}\n}", "language": "Java", "metadata": {"date": 1414073205, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02266.html", "problem_id": "p02266", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02266/input.txt", "sample_output_relpath": "derived/input_output/data/p02266/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02266/Java/s781392916.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s781392916", "user_id": "u368083894"}, "prompt_components": {"gold_output": "4\n1 4\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tString str = stdIn.next();\n\t\tint len = str.length();\n\t\tint[] level = new int[len+1];\n\t\tint top = 0;\n\t\tint bottom = 0;\n\t\tint nowLevel = 0;\n\n\t\tfor (int i=0; i map = new HashMap();\n\t\tint sum = 0;\n\n\t\tfor (int i=top; i>bottom; i--) {//高さ\n\t\t\tint start = -1;\n\t\t\tfor (int j=0; jlevel[j+1]) {//startが設定されているか '\\'であるか\n\t\t\t\t\t\t\tstart = j;\n\t\t\t\t\t\t}else if(start != -1){\n\t\t\t\t\t\t\tint count = 0;//傾斜数\n\t\t\t\t\t\t\tint vol = 0;\n\t\t\t\t\t\t\tfor (int k=start; k 0)\n\t\t\t\t\t\t\t\t\tcount++;\n\t\t\t\t\t\t\t\twater[k] = true;//水を入れる\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tvol += count/2;\n\t\t\t\t\t\t\tsum += vol;//総面積に足す\n\t\t\t\t\t\t\tmap.put(start,vol);\n\t\t\t\t\t\t\tstart = -1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(sum);\n\t\tSystem.out.print(map.size());\n\t\tfor (int i=0; map.size()!=0; i++) {\n\t\t\tif(map.containsKey(i)){\n\t\t\t\tSystem.out.print(\" \"+map.get(i));\n\t\t\t\tmap.remove(i);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println();\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nAreas on the Cross-Section Diagram\n\nYour task is to simulate a flood damage.\n\nFor a given cross-section diagram, reports areas of flooded sections.\n\nAssume that rain is falling endlessly in the region and the water overflowing from the region is falling in the sea at the both sides.\nFor example, for the above cross-section diagram, the rain will create floods which have areas of 4, 2, 1, 19 and 9 respectively.\n\nInput\n\nA string, which represents slopes and flatlands by '/', '\\' and '_' respectively, is given in a line. For example, the region of the above example is given by a string \"\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\".\n\noutput\n\nReport the areas of floods in the following format:\n\n$A$\n\n$k$ $L_1$ $L_2$ ... $L_k$\n\nIn the first line, print the total area $A$ of created floods.\n\nIn the second line, print the number of floods $k$ and areas $L_i (i = 1, 2, ..., k)$ for each flood from the left side of the cross-section diagram. Print a space character before $L_i$.\n\nConstraints\n\n$1 \\leq$ length of the string $\\leq 20,000$\n\nSample Input 1\n\n\\\\//\n\nSample Output 1\n\n4\n1 4\n\nSample Input 2\n\n\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\n\nSample Output 2\n\n35\n5 4 2 1 19 9", "sample_input": "\\\\//\n"}, "reference_outputs": ["4\n1 4\n"], "source_document_id": "p02266", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nAreas on the Cross-Section Diagram\n\nYour task is to simulate a flood damage.\n\nFor a given cross-section diagram, reports areas of flooded sections.\n\nAssume that rain is falling endlessly in the region and the water overflowing from the region is falling in the sea at the both sides.\nFor example, for the above cross-section diagram, the rain will create floods which have areas of 4, 2, 1, 19 and 9 respectively.\n\nInput\n\nA string, which represents slopes and flatlands by '/', '\\' and '_' respectively, is given in a line. For example, the region of the above example is given by a string \"\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\".\n\noutput\n\nReport the areas of floods in the following format:\n\n$A$\n\n$k$ $L_1$ $L_2$ ... $L_k$\n\nIn the first line, print the total area $A$ of created floods.\n\nIn the second line, print the number of floods $k$ and areas $L_i (i = 1, 2, ..., k)$ for each flood from the left side of the cross-section diagram. Print a space character before $L_i$.\n\nConstraints\n\n$1 \\leq$ length of the string $\\leq 20,000$\n\nSample Input 1\n\n\\\\//\n\nSample Output 1\n\n4\n1 4\n\nSample Input 2\n\n\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\n\nSample Output 2\n\n35\n5 4 2 1 19 9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1725, "cpu_time_ms": 1230, "memory_kb": 24908}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s696354857", "group_id": "codeNet:p02266", "input_text": "import java.util.ArrayList;\nimport java.util.Scanner;\n\n\npublic class Main {\n\tstatic Slope[] data;\n\tstatic int[] height;\n\tstatic boolean[] mount;\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tString input = sc.next();\n//\t\tSystem.out.println(input);\n\t\tdata = new Slope[input.length()];\n\t\tfor (int i = 0; i < data.length; i++) {\n\t\t\tchar temp = input.charAt(i);\n\t\t\tswitch (temp) {\n\t\t\t\tcase '\\\\':\n\t\t\t\t\tdata[i] = Slope.DOWN;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '/':\n\t\t\t\t\tdata[i] = Slope.UP;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '_':\n\t\t\t\t\tdata[i] = Slope.FLAT;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tassert true;\n\t\t\t}\n\t\t}\n\n\t\theight = new int[data.length + 1];\n\t\theight[0] = 0;\n\t\tmount = new boolean [data.length + 1];\n\t\tSlope prev = Slope.UP;\n\t\tfor (int i = 0; i < data.length; i++) {\n\t\t\theight[i + 1] = height[i] + data[i].height;\n\t\t\tif (prev == Slope.UP && data[i] == Slope.DOWN) {\n\t\t\t\tmount[i] = true;\n\t\t\t}\n\t\t\tif (data[i] != Slope.FLAT) {\n\t\t\t\tprev = data[i];\n\t\t\t}\n\t\t}\n\t\tif ( prev == Slope.UP) {\n\t\t\tmount[data.length] = true;\n\t\t}\n\n//\t\tfor (int i = 0; i < height.length; i++) {\n//\t\t\tSystem.out.println(height[i] + \":\" + mount[i]);\n//\t\t}\n\n\t\tArrayList result = new ArrayList();\n\t\tfor (int i = 0; i < height.length; ) {\n\t\t\tint from = nextMount(i);\n\t\t\tint to = nextMount(from + 1);\n\t\t\tif (from == -1) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (to == -1) {\n\t\t\t\ti++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tresult.add(getSquare(from, to));\n\t\t\ti = to;\n\t\t}\n\n\t\tint sum = 0;\n\t\tStringBuffer str = new StringBuffer();\n\t\tstr.append(result.size());\n\t\tfor (int i = 0; i < result.size(); i++) {\n\t\t\tsum += result.get(i);\n\t\t\tstr.append(\" \");\n\t\t\tstr.append(result.get(i));\n\t\t}\n\t\tSystem.out.println(sum);\n\t\tSystem.out.println(str);\n\t\t\n\t\tsc.close();\n\t}\n\t\n\tprivate static int nextMount(int start) {\n\t\tfor (int i = start; i < mount.length; i++) {\n\t\t\tif (mount[i] == true) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn -1;\n\t}\n\t\n\tprivate static int getSquare(int from, int to) {\n\t\tint min = Math.min(height[from], height[to]);\n\t\tint square = 0;\n\t\tfor (int i = from; i < to; i++) {\n\t\t\tif (height[i] > min || height[i + 1] > min) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tsquare += (min - height[i] + min - height[i + 1]);\n\t\t}\n\t\treturn square / 2;\n\t}\n\t\n\tprivate static enum Slope {\n\t\tDOWN(-1), UP(1), FLAT(0);\n\t\t\n\t\tint height;\n\t\tSlope(int height) {\n\t\t\tthis.height = height;\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1399528710, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02266.html", "problem_id": "p02266", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02266/input.txt", "sample_output_relpath": "derived/input_output/data/p02266/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02266/Java/s696354857.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s696354857", "user_id": "u722784748"}, "prompt_components": {"gold_output": "4\n1 4\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Scanner;\n\n\npublic class Main {\n\tstatic Slope[] data;\n\tstatic int[] height;\n\tstatic boolean[] mount;\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tString input = sc.next();\n//\t\tSystem.out.println(input);\n\t\tdata = new Slope[input.length()];\n\t\tfor (int i = 0; i < data.length; i++) {\n\t\t\tchar temp = input.charAt(i);\n\t\t\tswitch (temp) {\n\t\t\t\tcase '\\\\':\n\t\t\t\t\tdata[i] = Slope.DOWN;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '/':\n\t\t\t\t\tdata[i] = Slope.UP;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '_':\n\t\t\t\t\tdata[i] = Slope.FLAT;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tassert true;\n\t\t\t}\n\t\t}\n\n\t\theight = new int[data.length + 1];\n\t\theight[0] = 0;\n\t\tmount = new boolean [data.length + 1];\n\t\tSlope prev = Slope.UP;\n\t\tfor (int i = 0; i < data.length; i++) {\n\t\t\theight[i + 1] = height[i] + data[i].height;\n\t\t\tif (prev == Slope.UP && data[i] == Slope.DOWN) {\n\t\t\t\tmount[i] = true;\n\t\t\t}\n\t\t\tif (data[i] != Slope.FLAT) {\n\t\t\t\tprev = data[i];\n\t\t\t}\n\t\t}\n\t\tif ( prev == Slope.UP) {\n\t\t\tmount[data.length] = true;\n\t\t}\n\n//\t\tfor (int i = 0; i < height.length; i++) {\n//\t\t\tSystem.out.println(height[i] + \":\" + mount[i]);\n//\t\t}\n\n\t\tArrayList result = new ArrayList();\n\t\tfor (int i = 0; i < height.length; ) {\n\t\t\tint from = nextMount(i);\n\t\t\tint to = nextMount(from + 1);\n\t\t\tif (from == -1) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (to == -1) {\n\t\t\t\ti++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tresult.add(getSquare(from, to));\n\t\t\ti = to;\n\t\t}\n\n\t\tint sum = 0;\n\t\tStringBuffer str = new StringBuffer();\n\t\tstr.append(result.size());\n\t\tfor (int i = 0; i < result.size(); i++) {\n\t\t\tsum += result.get(i);\n\t\t\tstr.append(\" \");\n\t\t\tstr.append(result.get(i));\n\t\t}\n\t\tSystem.out.println(sum);\n\t\tSystem.out.println(str);\n\t\t\n\t\tsc.close();\n\t}\n\t\n\tprivate static int nextMount(int start) {\n\t\tfor (int i = start; i < mount.length; i++) {\n\t\t\tif (mount[i] == true) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn -1;\n\t}\n\t\n\tprivate static int getSquare(int from, int to) {\n\t\tint min = Math.min(height[from], height[to]);\n\t\tint square = 0;\n\t\tfor (int i = from; i < to; i++) {\n\t\t\tif (height[i] > min || height[i + 1] > min) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tsquare += (min - height[i] + min - height[i + 1]);\n\t\t}\n\t\treturn square / 2;\n\t}\n\t\n\tprivate static enum Slope {\n\t\tDOWN(-1), UP(1), FLAT(0);\n\t\t\n\t\tint height;\n\t\tSlope(int height) {\n\t\t\tthis.height = height;\n\t\t}\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nAreas on the Cross-Section Diagram\n\nYour task is to simulate a flood damage.\n\nFor a given cross-section diagram, reports areas of flooded sections.\n\nAssume that rain is falling endlessly in the region and the water overflowing from the region is falling in the sea at the both sides.\nFor example, for the above cross-section diagram, the rain will create floods which have areas of 4, 2, 1, 19 and 9 respectively.\n\nInput\n\nA string, which represents slopes and flatlands by '/', '\\' and '_' respectively, is given in a line. For example, the region of the above example is given by a string \"\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\".\n\noutput\n\nReport the areas of floods in the following format:\n\n$A$\n\n$k$ $L_1$ $L_2$ ... $L_k$\n\nIn the first line, print the total area $A$ of created floods.\n\nIn the second line, print the number of floods $k$ and areas $L_i (i = 1, 2, ..., k)$ for each flood from the left side of the cross-section diagram. Print a space character before $L_i$.\n\nConstraints\n\n$1 \\leq$ length of the string $\\leq 20,000$\n\nSample Input 1\n\n\\\\//\n\nSample Output 1\n\n4\n1 4\n\nSample Input 2\n\n\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\n\nSample Output 2\n\n35\n5 4 2 1 19 9", "sample_input": "\\\\//\n"}, "reference_outputs": ["4\n1 4\n"], "source_document_id": "p02266", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nAreas on the Cross-Section Diagram\n\nYour task is to simulate a flood damage.\n\nFor a given cross-section diagram, reports areas of flooded sections.\n\nAssume that rain is falling endlessly in the region and the water overflowing from the region is falling in the sea at the both sides.\nFor example, for the above cross-section diagram, the rain will create floods which have areas of 4, 2, 1, 19 and 9 respectively.\n\nInput\n\nA string, which represents slopes and flatlands by '/', '\\' and '_' respectively, is given in a line. For example, the region of the above example is given by a string \"\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\".\n\noutput\n\nReport the areas of floods in the following format:\n\n$A$\n\n$k$ $L_1$ $L_2$ ... $L_k$\n\nIn the first line, print the total area $A$ of created floods.\n\nIn the second line, print the number of floods $k$ and areas $L_i (i = 1, 2, ..., k)$ for each flood from the left side of the cross-section diagram. Print a space character before $L_i$.\n\nConstraints\n\n$1 \\leq$ length of the string $\\leq 20,000$\n\nSample Input 1\n\n\\\\//\n\nSample Output 1\n\n4\n1 4\n\nSample Input 2\n\n\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\n\nSample Output 2\n\n35\n5 4 2 1 19 9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2303, "cpu_time_ms": 50, "memory_kb": 17204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s100546494", "group_id": "codeNet:p02267", "input_text": "\n\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main{\n//\tprivate int LinearSearch(int[] a1, int[] a2) {\n//\t\t\n//\t}\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tSet set1 = new HashSet<>();\n\t\tfor (int i = 0; i < n; ++i) \n\t\t\tset1.add(scan.nextInt());\n\t\tint q = scan.nextInt();\n\t\tSet set2 = new HashSet<>();\n\t\tfor (int i = 0; i < q; ++i) \n\t\t\tset2.add(scan.nextInt());\n//\t\tset1.retainAll(set2);//求共同元素\n//\t\t//返回值表示set1的内存发生改变，s两者可能没有公共元素，set1变成空集\n//\t\tSystem.out.println(set1.size());\n\t\tint sum = 0;\n\t\tfor(int i : set1)\n\t\t\tfor (int j : set2) {\n\t\t\t\tif(i == j)\n\t\t\t\t\tsum++;\n\t\t\t}\n\t\tSystem.out.println(sum);\n\t\t\t\t\n\t}\n\n}\n\n", "language": "Java", "metadata": {"date": 1584512164, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02267.html", "problem_id": "p02267", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02267/input.txt", "sample_output_relpath": "derived/input_output/data/p02267/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02267/Java/s100546494.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s100546494", "user_id": "u094969106"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\n\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main{\n//\tprivate int LinearSearch(int[] a1, int[] a2) {\n//\t\t\n//\t}\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tSet set1 = new HashSet<>();\n\t\tfor (int i = 0; i < n; ++i) \n\t\t\tset1.add(scan.nextInt());\n\t\tint q = scan.nextInt();\n\t\tSet set2 = new HashSet<>();\n\t\tfor (int i = 0; i < q; ++i) \n\t\t\tset2.add(scan.nextInt());\n//\t\tset1.retainAll(set2);//求共同元素\n//\t\t//返回值表示set1的内存发生改变，s两者可能没有公共元素，set1变成空集\n//\t\tSystem.out.println(set1.size());\n\t\tint sum = 0;\n\t\tfor(int i : set1)\n\t\t\tfor (int j : set2) {\n\t\t\t\tif(i == j)\n\t\t\t\t\tsum++;\n\t\t\t}\n\t\tSystem.out.println(sum);\n\t\t\t\t\n\t}\n\n}\n\n", "problem_context": "Search I\n\nYou are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.\n\nOutput\n\nPrint C in a line.\n\nConstraints\n\nn ≤ 10000\n\nq ≤ 500\n\n0 ≤ an element in S ≤ 109\n\n0 ≤ an element in T ≤ 109\n\nSample Input 1\n\n5\n1 2 3 4 5\n3\n3 4 1\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n3 1 2\n1\n5\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5\n1 1 2 2 3\n2\n1 2\n\nSample Output 3\n\n2\n\nNotes", "sample_input": "5\n1 2 3 4 5\n3\n3 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02267", "source_text": "Search I\n\nYou are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.\n\nOutput\n\nPrint C in a line.\n\nConstraints\n\nn ≤ 10000\n\nq ≤ 500\n\n0 ≤ an element in S ≤ 109\n\n0 ≤ an element in T ≤ 109\n\nSample Input 1\n\n5\n1 2 3 4 5\n3\n3 4 1\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n3 1 2\n1\n5\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5\n1 1 2 2 3\n2\n1 2\n\nSample Output 3\n\n2\n\nNotes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 799, "cpu_time_ms": 220, "memory_kb": 40160}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s466332117", "group_id": "codeNet:p02268", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in); \n\n\t\tint n = sc.nextInt();\n\t\tint[] s = new int[n];\n \tfor (int i = 0; i < n; i++) {\n \t\ts[i] = sc.nextInt();\n \t}\n\n\t\tint q = sc.nextInt();\n\t\tint[] t = new int[q];\n \tfor (int i = 0; i < q; i++) {\n \t\tt[i] = sc.nextInt();\n \t}\n\n \tArrays.sort(s);\n \tArrays.sort(t);\n \t\n \tint count = 0;\n \tfor (int i = 0, key = 0; i < n && key < q;) {\n \t\tif (s[i] < t[key]) {\n \t\t\ti++;\n \t\t} else if (s[i] == t[key]) {\n \t\t\tcount++;\n \t\t\ti++;\n \t\t\tkey++;\n// \t\t\tSystem.out.println(s[i]);\n \t\t} else {\n \t\t\tkey++;\n \t\t}\n \t}\n\t\t\n \tSystem.out.println(count);\n\n \tsc.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1398995508, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02268.html", "problem_id": "p02268", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02268/input.txt", "sample_output_relpath": "derived/input_output/data/p02268/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02268/Java/s466332117.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466332117", "user_id": "u722784748"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in); \n\n\t\tint n = sc.nextInt();\n\t\tint[] s = new int[n];\n \tfor (int i = 0; i < n; i++) {\n \t\ts[i] = sc.nextInt();\n \t}\n\n\t\tint q = sc.nextInt();\n\t\tint[] t = new int[q];\n \tfor (int i = 0; i < q; i++) {\n \t\tt[i] = sc.nextInt();\n \t}\n\n \tArrays.sort(s);\n \tArrays.sort(t);\n \t\n \tint count = 0;\n \tfor (int i = 0, key = 0; i < n && key < q;) {\n \t\tif (s[i] < t[key]) {\n \t\t\ti++;\n \t\t} else if (s[i] == t[key]) {\n \t\t\tcount++;\n \t\t\ti++;\n \t\t\tkey++;\n// \t\t\tSystem.out.println(s[i]);\n \t\t} else {\n \t\t\tkey++;\n \t\t}\n \t}\n\t\t\n \tSystem.out.println(count);\n\n \tsc.close();\n\t}\n}", "problem_context": "Search II\n\nYou are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.\n\nOutput\n\nPrint C in a line.\n\nConstraints\n\nElements in S is sorted in ascending order\n\nn ≤ 100000\n\nq ≤ 50000\n\n0 ≤ an element in S ≤ 109\n\n0 ≤ an element in T ≤ 109\n\nSample Input 1\n\n5\n1 2 3 4 5\n3\n3 4 1\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n1 2 3\n1\n5\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5\n1 1 2 2 3\n2\n1 2\n\nSample Output 3\n\n2\n\nNotes", "sample_input": "5\n1 2 3 4 5\n3\n3 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02268", "source_text": "Search II\n\nYou are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.\n\nOutput\n\nPrint C in a line.\n\nConstraints\n\nElements in S is sorted in ascending order\n\nn ≤ 100000\n\nq ≤ 50000\n\n0 ≤ an element in S ≤ 109\n\n0 ≤ an element in T ≤ 109\n\nSample Input 1\n\n5\n1 2 3 4 5\n3\n3 4 1\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n1 2 3\n1\n5\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5\n1 1 2 2 3\n2\n1 2\n\nSample Output 3\n\n2\n\nNotes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 763, "cpu_time_ms": 400, "memory_kb": 76124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s395102227", "group_id": "codeNet:p02268", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n int[] s = new int[n + 1];\n for(int i = 0 ; i < n; i++) {\n s[i] = sc.nextInt();\n }\n int q = sc.nextInt();\n int[] t = new int[q];\n for(int i = 0; i < q; i++) {\n t[i] = sc.nextInt();\n }\n\n int ans = 0;\n for(int i = 0; i < q; i++) {\n if(binarySerch(s, n, t[i])) ans++;\n }\n\n System.out.println(ans);\n\n sc.close();\n }\n\n private static boolean binarySerch(int[] a, int n, int key) {\n int left = 0;\n int right = n;\n while(left < right) {\n int mid = (left + right) / 2;\n if(a[mid] == key) {\n return true;\n }else if(key < a[mid]) {\n right = mid;\n }else {\n left = mid + 1;\n }\n }\n\n return false;\n }\n}\n", "language": "Java", "metadata": {"date": 1552352721, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02268.html", "problem_id": "p02268", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02268/input.txt", "sample_output_relpath": "derived/input_output/data/p02268/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02268/Java/s395102227.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s395102227", "user_id": "u461653715"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n int[] s = new int[n + 1];\n for(int i = 0 ; i < n; i++) {\n s[i] = sc.nextInt();\n }\n int q = sc.nextInt();\n int[] t = new int[q];\n for(int i = 0; i < q; i++) {\n t[i] = sc.nextInt();\n }\n\n int ans = 0;\n for(int i = 0; i < q; i++) {\n if(binarySerch(s, n, t[i])) ans++;\n }\n\n System.out.println(ans);\n\n sc.close();\n }\n\n private static boolean binarySerch(int[] a, int n, int key) {\n int left = 0;\n int right = n;\n while(left < right) {\n int mid = (left + right) / 2;\n if(a[mid] == key) {\n return true;\n }else if(key < a[mid]) {\n right = mid;\n }else {\n left = mid + 1;\n }\n }\n\n return false;\n }\n}\n", "problem_context": "Search II\n\nYou are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.\n\nOutput\n\nPrint C in a line.\n\nConstraints\n\nElements in S is sorted in ascending order\n\nn ≤ 100000\n\nq ≤ 50000\n\n0 ≤ an element in S ≤ 109\n\n0 ≤ an element in T ≤ 109\n\nSample Input 1\n\n5\n1 2 3 4 5\n3\n3 4 1\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n1 2 3\n1\n5\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5\n1 1 2 2 3\n2\n1 2\n\nSample Output 3\n\n2\n\nNotes", "sample_input": "5\n1 2 3 4 5\n3\n3 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02268", "source_text": "Search II\n\nYou are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.\n\nOutput\n\nPrint C in a line.\n\nConstraints\n\nElements in S is sorted in ascending order\n\nn ≤ 100000\n\nq ≤ 50000\n\n0 ≤ an element in S ≤ 109\n\n0 ≤ an element in T ≤ 109\n\nSample Input 1\n\n5\n1 2 3 4 5\n3\n3 4 1\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n1 2 3\n1\n5\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5\n1 1 2 2 3\n2\n1 2\n\nSample Output 3\n\n2\n\nNotes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1018, "cpu_time_ms": 450, "memory_kb": 68844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s424283873", "group_id": "codeNet:p02270", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\n/**\n * ZAKIREN第5章 4-6.データ構造の応用\n * \n * @author tdi5277\n *\n */\npublic class Main {\n\t/** 入力用 */\n\tprivate static BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n\t\n\t/** 出力用 */\n\tprivate static StringBuilder stringBuilder = new StringBuilder();\n\t\n\t/**\n\t * トラックの積載量をチェック。\n\t */\n\tprivate static int check(int p, int k, int[] w, int n) {\n\t\tint i = 0;\n\t\t// truckの数だけループ\n\t\tfor (int j = 0; j < k; j++) {\n\t\t\t// max積載量になるまで\n\t\t\tint internalCapacity = 0;\n\t\t\twhile (internalCapacity + w[i] <= p) {\n\t\t\t\t// 内容量を増やす\n\t\t\t\tinternalCapacity += w[i];\n\t\t\t\ti++;\n\t\t\t\t\n\t\t\t\t// 全ての積載量を積むことができた場合\n\t\t\t\tif (i == n) {\n\t\t\t\t\treturn n;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn i;\n\t}\n\t\n\t/**\n\t * メイン。\n\t * \n\t * @param args 未使用\n\t */\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tfinal String SPACE = \" \";\n\t\t\t// 読み込み\n\t\t\tString[] temp = bufferedReader.readLine().split(SPACE);\n\t\t\tint n = Integer.parseInt(temp[0]);\n\t\t\tint k = Integer.parseInt(temp[1]);\n\t\t\t\t\t\t\n\t\t\t// n回ループ\n\t\t\tint[] w = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tw[i] = Integer.parseInt(bufferedReader.readLine());\n\t\t\t}\n\t\t\t\n\t\t\t// 読み込み終了\n\t\t\tbufferedReader.close();\n\t\t\tbufferedReader = null;\n\t\n\t\t\t// 二分探索法でPを求める\n\t\t\tint left = 0;\n\t\t\tint right = n * 10000;\n\t\t\tint mid = 0;\n\t\t\twhile (right - left > 1) {\n\t\t\t\tmid = (left + right) / 2;\n\t\t\t\t// そのPで積み込みきれるかチェック\n\t\t\t\tint size = check(mid, k, w, n);\n\t\t\t\tif (size >= n) {\n\t\t\t\t\tright = mid;\n\t\t\t\t} else {\n\t\t\t\t\tleft = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t\tstringBuilder.append(right);\n\t\t\t\n\t\t\t// 結果出力\n\t\t\tSystem.out.println(stringBuilder.toString());\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t}\n\n}\n\n", "language": "Java", "metadata": {"date": 1544160365, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02270.html", "problem_id": "p02270", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02270/input.txt", "sample_output_relpath": "derived/input_output/data/p02270/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02270/Java/s424283873.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s424283873", "user_id": "u276439162"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\n/**\n * ZAKIREN第5章 4-6.データ構造の応用\n * \n * @author tdi5277\n *\n */\npublic class Main {\n\t/** 入力用 */\n\tprivate static BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));\n\t\n\t/** 出力用 */\n\tprivate static StringBuilder stringBuilder = new StringBuilder();\n\t\n\t/**\n\t * トラックの積載量をチェック。\n\t */\n\tprivate static int check(int p, int k, int[] w, int n) {\n\t\tint i = 0;\n\t\t// truckの数だけループ\n\t\tfor (int j = 0; j < k; j++) {\n\t\t\t// max積載量になるまで\n\t\t\tint internalCapacity = 0;\n\t\t\twhile (internalCapacity + w[i] <= p) {\n\t\t\t\t// 内容量を増やす\n\t\t\t\tinternalCapacity += w[i];\n\t\t\t\ti++;\n\t\t\t\t\n\t\t\t\t// 全ての積載量を積むことができた場合\n\t\t\t\tif (i == n) {\n\t\t\t\t\treturn n;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn i;\n\t}\n\t\n\t/**\n\t * メイン。\n\t * \n\t * @param args 未使用\n\t */\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tfinal String SPACE = \" \";\n\t\t\t// 読み込み\n\t\t\tString[] temp = bufferedReader.readLine().split(SPACE);\n\t\t\tint n = Integer.parseInt(temp[0]);\n\t\t\tint k = Integer.parseInt(temp[1]);\n\t\t\t\t\t\t\n\t\t\t// n回ループ\n\t\t\tint[] w = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tw[i] = Integer.parseInt(bufferedReader.readLine());\n\t\t\t}\n\t\t\t\n\t\t\t// 読み込み終了\n\t\t\tbufferedReader.close();\n\t\t\tbufferedReader = null;\n\t\n\t\t\t// 二分探索法でPを求める\n\t\t\tint left = 0;\n\t\t\tint right = n * 10000;\n\t\t\tint mid = 0;\n\t\t\twhile (right - left > 1) {\n\t\t\t\tmid = (left + right) / 2;\n\t\t\t\t// そのPで積み込みきれるかチェック\n\t\t\t\tint size = check(mid, k, w, n);\n\t\t\t\tif (size >= n) {\n\t\t\t\t\tright = mid;\n\t\t\t\t} else {\n\t\t\t\t\tleft = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t\tstringBuilder.append(right);\n\t\t\t\n\t\t\t// 結果出力\n\t\t\tSystem.out.println(stringBuilder.toString());\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t}\n\n}\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "sample_input": "5 3\n8\n1\n7\n3\n9\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02270", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1958, "cpu_time_ms": 120, "memory_kb": 35240}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s733915394", "group_id": "codeNet:p02272", "input_text": "import java.util.*;\nimport java.io.*;\n\nclass Main{\n static int n = 0;\n static int[] merge(int[] A,int left,int mid,int right){\n int count = A.length;\n int[] Acopy = new int[count];\n count = left;\n int current = mid + 1;\n\n for(int i = left; i <= right; i++){\n Acopy[i] = A[i];\n }\n while(left <= mid && current <= right){\n if(Acopy[left] <= Acopy[current]){\n A[count] = Acopy[left];\n left++;\n }else{\n A[count] = Acopy[current];\n current++;\n }\n count++;\n n++;\n }\n\n for(int i = 0; i <= (mid - left); i++){\n A[count + i] = Acopy[left + i];\n }\n return A;\n\n // int n1 = mid - left + 1;\n // int n2 = right - mid + 1;\n // int[] L = new int[n1];\n // int[] R = new int[n2];\n // int i, j, k, count;\n\n // System.out.println(\"left is \" + left);\n // System.out.println(\"right is \" + right);\n // System.out.println(\"mid is \" + mid);\n\n // for(i = 0; i < A.length; i++){\n // System.out.print(A[i] + \" \");\n // }\n // System.out.println();\n\n // for(i = 0; i < n1 - 1; i++){\n // L[i] = A[left + i];\n // System.out.print(L[i] + \" \");\n // }\n\n // System.out.println();\n\n // for(i = 0; i < n2 - 1; i++){\n // R[i] = A[mid + i];\n // System.out.print(R[i] + \" \");\n // }\n\n // System.out.println();\n\n // L[n1 - 1] = Integer.MAX_VALUE;\n // R[n2 - 1] = Integer.MAX_VALUE;\n\n // i = 0;\n // j = 0;\n\n // for(k = left; k < right - 1; k++){\n // if(L[i] <= R[j]){\n // A[k] = L[i];\n // i = i + 1;\n // }else{\n // A[k] = R[j];\n // j = j + 1;\n // }\n // }\n\n // //\n // for(i = 0; i < A.length; i++){\n // System.out.print(A[i] + \" \");\n // }\n // System.out.println();\n // //\n // // count = k;\n\n // // for(k = 0; k < n1; k++){\n // // A[count + i] = A[left];\n // // }\n\n // System.out.println(\"----------OK\");\n // return A;\n }\n\n static int[] mergeSort(int[] A,int left,int right, int count){\n int[] sortArray = new int[count];\n // System.out.println(\"--left is \" + left);\n // System.out.println(\"--right is \" + right);\n\n if(left < right){\n n++;\n int mid = (left + right) / 2;\n mergeSort(A, left, mid, count);\n mergeSort(A, mid + 1, right, count);\n sortArray = merge(A, left, mid, right);\n }\n return sortArray;\n }\n\n public static void main(String[] args){\n int count1;\n int[] array1;\n int count;\n\n try{\n Scanner scan = new Scanner(System.in);\n String str;\n\n str= scan.next();\n count1 = Integer.parseInt(str);\n array1 = new int[count1];\n\n for(int i = 0; i < array1.length; i++){\n str = scan.next();\n array1[i] = Integer.parseInt(str);\n }\n // System.out.println(\"OK1\");\n array1 = mergeSort(array1, 0, count1 - 1, count1);\n // System.out.println(\"OKlast\");\n for(int i = 0; i < array1.length; i++){\n if(i == array1.length - 1){\n System.out.println(array1[i]);\n }else{\n System.out.print(array1[i] + \" \");\n }\n }\n\n System.out.println(n);\n\n }catch(Exception e){\n System.out.println(\"ERROR \" + e);\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1530817706, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02272.html", "problem_id": "p02272", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02272/input.txt", "sample_output_relpath": "derived/input_output/data/p02272/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02272/Java/s733915394.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s733915394", "user_id": "u827820084"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\n\nclass Main{\n static int n = 0;\n static int[] merge(int[] A,int left,int mid,int right){\n int count = A.length;\n int[] Acopy = new int[count];\n count = left;\n int current = mid + 1;\n\n for(int i = left; i <= right; i++){\n Acopy[i] = A[i];\n }\n while(left <= mid && current <= right){\n if(Acopy[left] <= Acopy[current]){\n A[count] = Acopy[left];\n left++;\n }else{\n A[count] = Acopy[current];\n current++;\n }\n count++;\n n++;\n }\n\n for(int i = 0; i <= (mid - left); i++){\n A[count + i] = Acopy[left + i];\n }\n return A;\n\n // int n1 = mid - left + 1;\n // int n2 = right - mid + 1;\n // int[] L = new int[n1];\n // int[] R = new int[n2];\n // int i, j, k, count;\n\n // System.out.println(\"left is \" + left);\n // System.out.println(\"right is \" + right);\n // System.out.println(\"mid is \" + mid);\n\n // for(i = 0; i < A.length; i++){\n // System.out.print(A[i] + \" \");\n // }\n // System.out.println();\n\n // for(i = 0; i < n1 - 1; i++){\n // L[i] = A[left + i];\n // System.out.print(L[i] + \" \");\n // }\n\n // System.out.println();\n\n // for(i = 0; i < n2 - 1; i++){\n // R[i] = A[mid + i];\n // System.out.print(R[i] + \" \");\n // }\n\n // System.out.println();\n\n // L[n1 - 1] = Integer.MAX_VALUE;\n // R[n2 - 1] = Integer.MAX_VALUE;\n\n // i = 0;\n // j = 0;\n\n // for(k = left; k < right - 1; k++){\n // if(L[i] <= R[j]){\n // A[k] = L[i];\n // i = i + 1;\n // }else{\n // A[k] = R[j];\n // j = j + 1;\n // }\n // }\n\n // //\n // for(i = 0; i < A.length; i++){\n // System.out.print(A[i] + \" \");\n // }\n // System.out.println();\n // //\n // // count = k;\n\n // // for(k = 0; k < n1; k++){\n // // A[count + i] = A[left];\n // // }\n\n // System.out.println(\"----------OK\");\n // return A;\n }\n\n static int[] mergeSort(int[] A,int left,int right, int count){\n int[] sortArray = new int[count];\n // System.out.println(\"--left is \" + left);\n // System.out.println(\"--right is \" + right);\n\n if(left < right){\n n++;\n int mid = (left + right) / 2;\n mergeSort(A, left, mid, count);\n mergeSort(A, mid + 1, right, count);\n sortArray = merge(A, left, mid, right);\n }\n return sortArray;\n }\n\n public static void main(String[] args){\n int count1;\n int[] array1;\n int count;\n\n try{\n Scanner scan = new Scanner(System.in);\n String str;\n\n str= scan.next();\n count1 = Integer.parseInt(str);\n array1 = new int[count1];\n\n for(int i = 0; i < array1.length; i++){\n str = scan.next();\n array1[i] = Integer.parseInt(str);\n }\n // System.out.println(\"OK1\");\n array1 = mergeSort(array1, 0, count1 - 1, count1);\n // System.out.println(\"OKlast\");\n for(int i = 0; i < array1.length; i++){\n if(i == array1.length - 1){\n System.out.println(array1[i]);\n }else{\n System.out.print(array1[i] + \" \");\n }\n }\n\n System.out.println(n);\n\n }catch(Exception e){\n System.out.println(\"ERROR \" + e);\n }\n\n }\n}\n\n", "problem_context": "Merge Sort\n\nWrite a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.\n\nMerge(A, left, mid, right)\nn1 = mid - left;\nn2 = right - mid;\ncreate array L[0...n1], R[0...n2]\nfor i = 0 to n1-1\ndo L[i] = A[left + i]\nfor i = 0 to n2-1\ndo R[i] = A[mid + i]\nL[n1] = SENTINEL\nR[n2] = SENTINEL\ni = 0;\nj = 0;\nfor k = left to right-1\nif L[i] <= R[j]\nthen A[k] = L[i]\ni = i + 1\nelse A[k] = R[j]\nj = j + 1\n\nMerge-Sort(A, left, right){\nif left+1 < right\nthen mid = (left + right)/2;\ncall Merge-Sort(A, left, mid)\ncall Merge-Sort(A, mid, right)\ncall Merge(A, left, mid, right)\n\nInput\n\nIn the first line n is given. In the second line, n integers are given.\n\nOutput\n\nIn the first line, print the sequence S. Two consequtive elements should be separated by a space character.\n\nIn the second line, print the number of comparisons.\n\nConstraints\n\nn ≤ 500000\n\n0 ≤ an element in S ≤ 109\n\nSample Input 1\n\n10\n8 5 9 2 6 3 7 1 10 4\n\nSample Output 1\n\n1 2 3 4 5 6 7 8 9 10\n34\n\nNotes", "sample_input": "10\n8 5 9 2 6 3 7 1 10 4\n"}, "reference_outputs": ["1 2 3 4 5 6 7 8 9 10\n34\n"], "source_document_id": "p02272", "source_text": "Merge Sort\n\nWrite a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.\n\nMerge(A, left, mid, right)\nn1 = mid - left;\nn2 = right - mid;\ncreate array L[0...n1], R[0...n2]\nfor i = 0 to n1-1\ndo L[i] = A[left + i]\nfor i = 0 to n2-1\ndo R[i] = A[mid + i]\nL[n1] = SENTINEL\nR[n2] = SENTINEL\ni = 0;\nj = 0;\nfor k = left to right-1\nif L[i] <= R[j]\nthen A[k] = L[i]\ni = i + 1\nelse A[k] = R[j]\nj = j + 1\n\nMerge-Sort(A, left, right){\nif left+1 < right\nthen mid = (left + right)/2;\ncall Merge-Sort(A, left, mid)\ncall Merge-Sort(A, mid, right)\ncall Merge(A, left, mid, right)\n\nInput\n\nIn the first line n is given. In the second line, n integers are given.\n\nOutput\n\nIn the first line, print the sequence S. Two consequtive elements should be separated by a space character.\n\nIn the second line, print the number of comparisons.\n\nConstraints\n\nn ≤ 500000\n\n0 ≤ an element in S ≤ 109\n\nSample Input 1\n\n10\n8 5 9 2 6 3 7 1 10 4\n\nSample Output 1\n\n1 2 3 4 5 6 7 8 9 10\n34\n\nNotes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3790, "cpu_time_ms": 50, "memory_kb": 26020}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s666159572", "group_id": "codeNet:p02275", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n static final int MAX_A = 10000 + 10;\n static int n;\n\n public static void main(String[] args) throws IOException{\n Scanner sc = new Scanner(System.in);\n n = Integer.parseInt(sc.next());\n\n int[] A = new int[n + 10];\n for (int i = 0; i < n; i++) {\n A[i] = Integer.parseInt(sc.next());\n }\n\n int[] B = new int[n + 10];\n CountingSort(A, B);\n\n String ans = \"\";\n for (int i = 0; i < n; i++) {\n ans += String.format(\"%d \", B[i]);\n }\n System.out.println(ans.trim());\n }\n\n static void CountingSort(int[] A, int[] B) {\n int[] C = new int[MAX_A];\n\n for (int i = 0; i < n; i++) {\n C[A[i]]++;\n }\n\n for (int i = 1; i < MAX_A; i++) {\n C[i] += C[i - 1];\n }\n\n for (int i = n - 1; i >= 0; i--) {\n C[A[i]]--;\n B[C[A[i]]] = A[i];\n }\n }\n\n public static class Scanner {\n private BufferedReader br;\n private StringTokenizer tok;\n\n public Scanner(InputStream is) throws IOException {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n private void getLine() throws IOException {\n while (!hasNext()) { tok = new StringTokenizer(br.readLine()); }\n }\n\n private boolean hasNext() {\n return tok != null && tok.hasMoreTokens();\n }\n\n public String next() throws IOException {\n getLine(); return tok.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public void close() throws IOException {\n br.close();\n }\n }\n}", "language": "Java", "metadata": {"date": 1466406397, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02275.html", "problem_id": "p02275", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02275/input.txt", "sample_output_relpath": "derived/input_output/data/p02275/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02275/Java/s666159572.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Memory Limit Exceeded", "submission_id": "s666159572", "user_id": "u763534154"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n static final int MAX_A = 10000 + 10;\n static int n;\n\n public static void main(String[] args) throws IOException{\n Scanner sc = new Scanner(System.in);\n n = Integer.parseInt(sc.next());\n\n int[] A = new int[n + 10];\n for (int i = 0; i < n; i++) {\n A[i] = Integer.parseInt(sc.next());\n }\n\n int[] B = new int[n + 10];\n CountingSort(A, B);\n\n String ans = \"\";\n for (int i = 0; i < n; i++) {\n ans += String.format(\"%d \", B[i]);\n }\n System.out.println(ans.trim());\n }\n\n static void CountingSort(int[] A, int[] B) {\n int[] C = new int[MAX_A];\n\n for (int i = 0; i < n; i++) {\n C[A[i]]++;\n }\n\n for (int i = 1; i < MAX_A; i++) {\n C[i] += C[i - 1];\n }\n\n for (int i = n - 1; i >= 0; i--) {\n C[A[i]]--;\n B[C[A[i]]] = A[i];\n }\n }\n\n public static class Scanner {\n private BufferedReader br;\n private StringTokenizer tok;\n\n public Scanner(InputStream is) throws IOException {\n br = new BufferedReader(new InputStreamReader(is));\n }\n\n private void getLine() throws IOException {\n while (!hasNext()) { tok = new StringTokenizer(br.readLine()); }\n }\n\n private boolean hasNext() {\n return tok != null && tok.hasMoreTokens();\n }\n\n public String next() throws IOException {\n getLine(); return tok.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public void close() throws IOException {\n br.close();\n }\n }\n}", "problem_context": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "sample_input": "7\n2 5 1 3 2 3 0\n"}, "reference_outputs": ["0 1 2 2 3 3 5\n"], "source_document_id": "p02275", "source_text": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1997, "cpu_time_ms": 20000, "memory_kb": 796312}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s009302791", "group_id": "codeNet:p02275", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void countingSort(int[] a, int[] b, int k, int n){\n\t\tint[] c = new int[k + 1];\n\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tc[a[i]]++;\n\t\t}\n\n\t\tfor(int i = 1; i < k + 1; i++) {\n\t\t\tc[i] = c[i] + c[i - 1];\n\t\t}\n\n\t\tfor(int i = n - 1; i >= 0; i--) {\n\t\t\tb[c[a[i]] - 1] = a[i];\n\t\t\tc[a[i]]--;\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tint ElementCount = Integer.parseInt(br.readLine());\n\n\t\tString[] c = br.readLine().split(\" \");\n\n\t\tint[] cInt = new int[ElementCount];\n\n\t\tint cIntMaxNum = 0;\n\t\tfor(int i = 0; i < ElementCount; i++) {\n\t\t\tcInt[i] = Integer.parseInt(c[i]);\n\t\t\tcIntMaxNum = Math.max(cIntMaxNum, cInt[i]);\n\t\t}\n\n\t\tint[] cIntSort = new int[ElementCount];\n\n\t\tcountingSort(cInt, cIntSort, cIntMaxNum, ElementCount);\n\n\t\tStringBuilder sb = new StringBuilder();\n\n\t\tfor(int i = 0; i < cIntSort.length; i++) {\n\t\t\tsb.append(cIntSort[i]);\n\t\t\tif(i == cIntSort.length - 1){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsb.append(\" \");\n\t\t}\n\t\tSystem.out.println(sb.toString());\n\t}\n}", "language": "Java", "metadata": {"date": 1507785517, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02275.html", "problem_id": "p02275", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02275/input.txt", "sample_output_relpath": "derived/input_output/data/p02275/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02275/Java/s009302791.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s009302791", "user_id": "u231662285"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void countingSort(int[] a, int[] b, int k, int n){\n\t\tint[] c = new int[k + 1];\n\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tc[a[i]]++;\n\t\t}\n\n\t\tfor(int i = 1; i < k + 1; i++) {\n\t\t\tc[i] = c[i] + c[i - 1];\n\t\t}\n\n\t\tfor(int i = n - 1; i >= 0; i--) {\n\t\t\tb[c[a[i]] - 1] = a[i];\n\t\t\tc[a[i]]--;\n\t\t}\n\t}\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tint ElementCount = Integer.parseInt(br.readLine());\n\n\t\tString[] c = br.readLine().split(\" \");\n\n\t\tint[] cInt = new int[ElementCount];\n\n\t\tint cIntMaxNum = 0;\n\t\tfor(int i = 0; i < ElementCount; i++) {\n\t\t\tcInt[i] = Integer.parseInt(c[i]);\n\t\t\tcIntMaxNum = Math.max(cIntMaxNum, cInt[i]);\n\t\t}\n\n\t\tint[] cIntSort = new int[ElementCount];\n\n\t\tcountingSort(cInt, cIntSort, cIntMaxNum, ElementCount);\n\n\t\tStringBuilder sb = new StringBuilder();\n\n\t\tfor(int i = 0; i < cIntSort.length; i++) {\n\t\t\tsb.append(cIntSort[i]);\n\t\t\tif(i == cIntSort.length - 1){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsb.append(\" \");\n\t\t}\n\t\tSystem.out.println(sb.toString());\n\t}\n}", "problem_context": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "sample_input": "7\n2 5 1 3 2 3 0\n"}, "reference_outputs": ["0 1 2 2 3 3 5\n"], "source_document_id": "p02275", "source_text": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1190, "cpu_time_ms": 3600, "memory_kb": 292300}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s295963915", "group_id": "codeNet:p02275", "input_text": "import java.util.Scanner;\nimport java.util.Arrays;\nimport static java.util.stream.Collectors.joining;\n\nclass Main {\n final static int k = 10001;\n static int[] C = new int[k];\n\n public static void main(String... args) {\n Scanner sc = new Scanner(System.in);\n int size = sc.nextInt();\n int current = 0;\n int[] A = new int[size];\n int[] B = new int[size];\n\n for (int i = 0; i < size; i++) C[A[i] = Integer.parseInt(sc.next())]++;\n for (int i = 1; i < k; i++) C[i] += C[i - 1];\n for (int i = size - 1; i >= 0; i--) B[--C[A[i]]] = A[i];\n System.out.println(Arrays.stream(B).boxed().map(n -> n.toString()).collect(joining(\" \")));\n }\n}\n\n\n", "language": "Java", "metadata": {"date": 1570059222, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02275.html", "problem_id": "p02275", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02275/input.txt", "sample_output_relpath": "derived/input_output/data/p02275/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02275/Java/s295963915.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s295963915", "user_id": "u601280375"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "import java.util.Scanner;\nimport java.util.Arrays;\nimport static java.util.stream.Collectors.joining;\n\nclass Main {\n final static int k = 10001;\n static int[] C = new int[k];\n\n public static void main(String... args) {\n Scanner sc = new Scanner(System.in);\n int size = sc.nextInt();\n int current = 0;\n int[] A = new int[size];\n int[] B = new int[size];\n\n for (int i = 0; i < size; i++) C[A[i] = Integer.parseInt(sc.next())]++;\n for (int i = 1; i < k; i++) C[i] += C[i - 1];\n for (int i = size - 1; i >= 0; i--) B[--C[A[i]]] = A[i];\n System.out.println(Arrays.stream(B).boxed().map(n -> n.toString()).collect(joining(\" \")));\n }\n}\n\n\n", "problem_context": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "sample_input": "7\n2 5 1 3 2 3 0\n"}, "reference_outputs": ["0 1 2 2 3 3 5\n"], "source_document_id": "p02275", "source_text": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 662, "cpu_time_ms": 1410, "memory_kb": 326044}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s314650134", "group_id": "codeNet:p02276", "input_text": "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int A[]= new int[n];\n for(int i=0; i list = new ArrayList();\n\t\tfor (int i = 0; i r) {\n\t\t\t\t\t\tSystem.out.println(\"Not stable\");\n\t\t\t\t\t\ti = num[n-1] + 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tsearch = r;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\ti++;\n\t\t\tif ( i == num[n-1] + 1) {\n\t\t\t\tSystem.out.println(\"Stable\");\n\t\t\t}\n\t\t}\n\t\tfor (int k = 0; k list = new ArrayList();\n\t\tfor (int i = 0; i r) {\n\t\t\t\t\t\tSystem.out.println(\"Not stable\");\n\t\t\t\t\t\ti = num[n-1] + 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tsearch = r;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\ti++;\n\t\t\tif ( i == num[n-1] + 1) {\n\t\t\t\tSystem.out.println(\"Stable\");\n\t\t\t}\n\t\t}\n\t\tfor (int k = 0; k A[j].index){\n return false;\n }\n }\n }\n return true;\n }\n\n public static int partition(Cards[]A,int p,int r){\n int x = A[r].num;\n int i= p -1;\n for(int j= p;j A[j].index){\n return false;\n }\n }\n }\n return true;\n }\n\n public static int partition(Cards[]A,int p,int r){\n int x = A[r].num;\n int i= p -1;\n for(int j= p;j {\n\t\tpublic T createFromToken(final ContestScanner scanner) throws IOException;\n\t}\n\n\tpublic static interface IArrayInitializer {\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException;\n\t}\n\n\tpublic static interface IObjectInitializer {\n\t\tpublic T initialValue(final ContestScanner scanner);\n\t}\n\n\tpublic static class ObjectArrayInitializer implements IArrayInitializer {\n\t\tprotected T[] arr;\n\t\tprotected final IObjectInitializer initializer;\n\n\t\tprivate ObjectArrayInitializer(T[] arr, final IObjectInitializer initializer)\n\t\t{\n\t\t\tthis.arr = arr;\n\t\t\tthis.initializer = initializer;\n\t\t}\n\n\t\tpublic static ObjectArrayInitializer create(T[] arr, final IObjectInitializer initializer)\n\t\t{\n\t\t\treturn new ObjectArrayInitializer(arr, initializer);\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = initializer.initialValue(scanner);\n\t\t}\n\n\t\tpublic T[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\n\tpublic static class ByteArrayInitializer implements IArrayInitializer {\n\t\tprotected byte[] arr;\n\n\t\tprivate ByteArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new byte[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextByte();\n\t\t}\n\n\t\tpublic byte[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic static class ShortArrayInitializer implements IArrayInitializer {\n\t\tprotected short[] arr;\n\n\t\tprivate ShortArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new short[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextShort();\n\t\t}\n\n\t\tpublic short[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic static class IntArrayInitializer implements IArrayInitializer {\n\t\tprotected int[] arr;\n\n\t\tprivate IntArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new int[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextInt();\n\t\t}\n\n\t\tpublic int[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic static class LongArrayInitializer implements IArrayInitializer {\n\t\tprotected long[] arr;\n\n\t\tprivate LongArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new long[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextLong();\n\t\t}\n\n\t\tpublic long[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic static class FloatArrayInitializer implements IArrayInitializer {\n\t\tprotected float[] arr;\n\n\t\tprivate FloatArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new float[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextFloat();\n\t\t}\n\n\t\tpublic float[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic static class DoubleArrayInitializer implements IArrayInitializer {\n\t\tprotected double[] arr;\n\n\t\tprivate DoubleArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new double[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextDouble();\n\t\t}\n\n\t\tpublic double[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic String nextToken() throws IOException {\n\t\tif(line == null || index >= line.length)\n\t\t{\n\t\t\tline = reader.readLine().trim().split(\" \");\n\t\t\tindex = 0;\n\t\t}\n\n\t\treturn line[index++];\n\t}\n\n\tpublic String next() throws IOException {\n\t\treturn nextToken();\n\t}\n\n\tpublic String readLine() throws IOException {\n\t\tline = null;\n\t\tindex = 0;\n\n\t\treturn reader.readLine();\n\t}\n\n\tpublic byte nextByte() throws IOException, NumberFormatException {\n\t\treturn Byte.parseByte(nextToken());\n\t}\n\n\tpublic short nextShort() throws IOException, NumberFormatException {\n\t\treturn Short.parseShort(nextToken());\n\t}\n\n\tpublic int nextInt() throws IOException, NumberFormatException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tpublic long nextLong() throws IOException, NumberFormatException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tpublic float nextFloat() throws IOException, NumberFormatException {\n\t\treturn Float.parseFloat(nextToken());\n\t}\n\n\tpublic double nextDouble() throws IOException, NumberFormatException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tpublic T nextObject(final ICreator creator) throws IOException, NumberFormatException {\n\t\treturn creator.createFromToken(this);\n\t}\n\n\tpublic int[] nextIntArray(final int N) throws IOException, NumberFormatException {\n\t\tint[] result = new int[N];\n\n\t\tfor(int i=0; i < N; i++) result[i] = nextInt();\n\n\t\treturn result;\n\t}\n\n\tpublic long[] nextLongArray(final int N) throws IOException, NumberFormatException {\n\t\tlong[] result = new long[N];\n\n\t\tfor(int i=0; i < N; i++) result[i] = nextLong();\n\n\t\treturn result;\n\t}\n\n\tpublic float[] nexFloatArray(final int N) throws IOException, NumberFormatException {\n\t\tfloat[] result = new float[N];\n\n\t\tfor(int i=0; i < N; i++) result[i] = nextFloat();\n\n\t\treturn result;\n\t}\n\n\tpublic double[] nexDoubleArray(final int N) throws IOException, NumberFormatException {\n\t\tdouble[] result = new double[N];\n\n\t\tfor(int i=0; i < N; i++) result[i] = nextDouble();\n\n\t\treturn result;\n\t}\n\n\tpublic T[] nextObjectArray(T[] result, final ICreator creator) throws IOException, NumberFormatException {\n\t\tfor(int i=0, N=result.length; i < N; i++) result[i] = nextObject(creator);\n\n\t\treturn result;\n\t}\n\n\tpublic ArrayList nextGenericObjectArrayList(final int N, final ICreator creator) throws IOException, NumberFormatException {\n\t\tArrayList result = new ArrayList();\n\t\tfor(int i=0; i < N; i++) result.add(nextObject(creator));\n\n\t\treturn result;\n\t}\n\n\tpublic void nextTable(final int N, IArrayInitializer... arrayInitializers) throws IOException, NumberFormatException {\n\t\tfor(int i=0; i < N; i++) for(IArrayInitializer initializer: arrayInitializers)\n\t\t{\n\t\t\tinitializer.initialize(this, i);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1496667070, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02281.html", "problem_id": "p02281", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02281/input.txt", "sample_output_relpath": "derived/input_output/data/p02281/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02281/Java/s906722689.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s906722689", "user_id": "u390428842"}, "prompt_components": {"gold_output": "Preorder\n 0 1 2 3 4 5 6 7 8\nInorder\n 2 1 3 0 6 5 7 4 8\nPostorder\n 2 3 1 6 7 5 8 4 0\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\n\npublic class Main {\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tContestScanner scan = new ContestScanner();\n\n\t\tfinal int n = scan.nextInt();\n\t\tfinal Node[] nodes = new Node[n];\n\n\t\tfor(int i=0; i < n; i++)\n\t\t{\n\t\t\tnodes[i] = new Node(scan.nextInt(), scan.nextInt(), scan.nextInt());\n\t\t}\n\n\t\t(new Solve(n, nodes)).solve();\n\t}\n}\nclass Solve {\n\tprivate final int n;\n\tprivate final Node[] nodes;\n\n\tpublic Solve(final int n, final Node[] nodes)\n\t{\n\t\tthis.n = n;\n\t\tthis.nodes = nodes;\n\t}\n\n\tpublic void solve()\n\t{\n\t\tNode[] nodeMap = new Node[n];\n\t\tNode[] childMap = new Node[n];\n\n\t\tfor(int i=0; i < n; i++)\n\t\t{\n\t\t\tNode n = nodes[i];\n\t\t\tnodeMap[n.id] = n;\n\t\t\tif(n.l != -1) childMap[n.l] = n;\n\t\t\tif(n.r != -1) childMap[n.r] = n;\n\t\t}\n\n\t\tNode root = null;\n\n\t\tfor(int i=0; i < n; i++)\n\t\t{\n\t\t\tif(childMap[nodes[i].id] == null)\n\t\t\t{\n\t\t\t\troot = nodeMap[nodes[i].id];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tStringBuilder sb = new StringBuilder();\n\n\t\tsb.append(\"Preorder \\n\");\n\t\twalkPreorder(n, nodes, nodeMap, childMap, root, sb);\n\t\tsb.append(\" \\n\");\n\t\tsb.append(\"Inorder \\n\");\n\t\twalkInorder(n, nodes, nodeMap, childMap, root, sb);\n\t\tsb.append(\" \\n\");\n\t\tsb.append(\"Postorder \\n\");\n\t\twalkPostorder(n, nodes, nodeMap, childMap, root, sb);\n\t\tSystem.out.println(sb.toString());\n\t}\n\n\tprivate void walkPreorder(final int n, final Node[] nodes,\n\t\t\t\t\t\t\t\tfinal Node[] nodeMap, final Node[] childMap,\n\t\t\t\t\t\t\t\t\t\t\tfinal Node node, final StringBuilder sb)\n\t{\n\t\tsb.append(\" \" + node.id);\n\t\tif(node.l != -1) walkPreorder(n, nodes, nodeMap, childMap, nodeMap[node.l], sb);\n\t\tif(node.r != -1) walkPreorder(n, nodes, nodeMap, childMap, nodeMap[node.r], sb);\n\t}\n\n\tprivate void walkInorder(final int n, final Node[] nodes,\n\t\t\t\t\t\t\t\tfinal Node[] nodeMap, final Node[] childMap,\n\t\t\t\t\t\t\t\t\t\t\tfinal Node node, final StringBuilder sb)\n\t{\n\t\tif(node.l != -1) walkInorder(n, nodes, nodeMap, childMap, nodeMap[node.l], sb);\n\t\tsb.append(\" \" + node.id);\n\t\tif(node.r != -1) walkInorder(n, nodes, nodeMap, childMap, nodeMap[node.r], sb);\n\t}\n\n\tprivate void walkPostorder(final int n, final Node[] nodes,\n\t\t\t\t\t\t\t\tfinal Node[] nodeMap, final Node[] childMap,\n\t\t\t\t\t\t\t\t\t\t\tfinal Node node, final StringBuilder sb)\n\t{\n\t\tif(node.l != -1) walkPostorder(n, nodes, nodeMap, childMap, nodeMap[node.l], sb);\n\t\tif(node.r != -1) walkPostorder(n, nodes, nodeMap, childMap, nodeMap[node.r], sb);\n\t\tsb.append(\" \" + node.id);\n\t}\n}\nclass Node {\n\tpublic final int id;\n\tpublic final int l;\n\tpublic final int r;\n\n\tpublic Node(final int id, final int l, final int r)\n\t{\n\t\tthis.id = id;\n\t\tthis.l = l;\n\t\tthis.r = r;\n\t}\n}\nclass ContestScanner {\n\tBufferedReader reader;\n\tString[] line;\n\tint index;\n\tpublic ContestScanner() {\n\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t}\n\n\tpublic ContestScanner(String filename) throws FileNotFoundException {\n\t\treader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));\n\t}\n\n\tpublic static interface ICreator {\n\t\tpublic T createFromToken(final ContestScanner scanner) throws IOException;\n\t}\n\n\tpublic static interface IArrayInitializer {\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException;\n\t}\n\n\tpublic static interface IObjectInitializer {\n\t\tpublic T initialValue(final ContestScanner scanner);\n\t}\n\n\tpublic static class ObjectArrayInitializer implements IArrayInitializer {\n\t\tprotected T[] arr;\n\t\tprotected final IObjectInitializer initializer;\n\n\t\tprivate ObjectArrayInitializer(T[] arr, final IObjectInitializer initializer)\n\t\t{\n\t\t\tthis.arr = arr;\n\t\t\tthis.initializer = initializer;\n\t\t}\n\n\t\tpublic static ObjectArrayInitializer create(T[] arr, final IObjectInitializer initializer)\n\t\t{\n\t\t\treturn new ObjectArrayInitializer(arr, initializer);\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = initializer.initialValue(scanner);\n\t\t}\n\n\t\tpublic T[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\n\tpublic static class ByteArrayInitializer implements IArrayInitializer {\n\t\tprotected byte[] arr;\n\n\t\tprivate ByteArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new byte[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextByte();\n\t\t}\n\n\t\tpublic byte[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic static class ShortArrayInitializer implements IArrayInitializer {\n\t\tprotected short[] arr;\n\n\t\tprivate ShortArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new short[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextShort();\n\t\t}\n\n\t\tpublic short[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic static class IntArrayInitializer implements IArrayInitializer {\n\t\tprotected int[] arr;\n\n\t\tprivate IntArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new int[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextInt();\n\t\t}\n\n\t\tpublic int[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic static class LongArrayInitializer implements IArrayInitializer {\n\t\tprotected long[] arr;\n\n\t\tprivate LongArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new long[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextLong();\n\t\t}\n\n\t\tpublic long[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic static class FloatArrayInitializer implements IArrayInitializer {\n\t\tprotected float[] arr;\n\n\t\tprivate FloatArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new float[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextFloat();\n\t\t}\n\n\t\tpublic float[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic static class DoubleArrayInitializer implements IArrayInitializer {\n\t\tprotected double[] arr;\n\n\t\tprivate DoubleArrayInitializer(final int n)\n\t\t{\n\t\t\tthis.arr = new double[n];\n\t\t}\n\n\t\tpublic void initialize(final ContestScanner scanner, final int i) throws IOException {\n\t\t\tthis.arr[i] = scanner.nextDouble();\n\t\t}\n\n\t\tpublic double[] getArray()\n\t\t{\n\t\t\treturn this.arr;\n\t\t}\n\t}\n\n\tpublic String nextToken() throws IOException {\n\t\tif(line == null || index >= line.length)\n\t\t{\n\t\t\tline = reader.readLine().trim().split(\" \");\n\t\t\tindex = 0;\n\t\t}\n\n\t\treturn line[index++];\n\t}\n\n\tpublic String next() throws IOException {\n\t\treturn nextToken();\n\t}\n\n\tpublic String readLine() throws IOException {\n\t\tline = null;\n\t\tindex = 0;\n\n\t\treturn reader.readLine();\n\t}\n\n\tpublic byte nextByte() throws IOException, NumberFormatException {\n\t\treturn Byte.parseByte(nextToken());\n\t}\n\n\tpublic short nextShort() throws IOException, NumberFormatException {\n\t\treturn Short.parseShort(nextToken());\n\t}\n\n\tpublic int nextInt() throws IOException, NumberFormatException {\n\t\treturn Integer.parseInt(nextToken());\n\t}\n\n\tpublic long nextLong() throws IOException, NumberFormatException {\n\t\treturn Long.parseLong(nextToken());\n\t}\n\n\tpublic float nextFloat() throws IOException, NumberFormatException {\n\t\treturn Float.parseFloat(nextToken());\n\t}\n\n\tpublic double nextDouble() throws IOException, NumberFormatException {\n\t\treturn Double.parseDouble(nextToken());\n\t}\n\n\tpublic T nextObject(final ICreator creator) throws IOException, NumberFormatException {\n\t\treturn creator.createFromToken(this);\n\t}\n\n\tpublic int[] nextIntArray(final int N) throws IOException, NumberFormatException {\n\t\tint[] result = new int[N];\n\n\t\tfor(int i=0; i < N; i++) result[i] = nextInt();\n\n\t\treturn result;\n\t}\n\n\tpublic long[] nextLongArray(final int N) throws IOException, NumberFormatException {\n\t\tlong[] result = new long[N];\n\n\t\tfor(int i=0; i < N; i++) result[i] = nextLong();\n\n\t\treturn result;\n\t}\n\n\tpublic float[] nexFloatArray(final int N) throws IOException, NumberFormatException {\n\t\tfloat[] result = new float[N];\n\n\t\tfor(int i=0; i < N; i++) result[i] = nextFloat();\n\n\t\treturn result;\n\t}\n\n\tpublic double[] nexDoubleArray(final int N) throws IOException, NumberFormatException {\n\t\tdouble[] result = new double[N];\n\n\t\tfor(int i=0; i < N; i++) result[i] = nextDouble();\n\n\t\treturn result;\n\t}\n\n\tpublic T[] nextObjectArray(T[] result, final ICreator creator) throws IOException, NumberFormatException {\n\t\tfor(int i=0, N=result.length; i < N; i++) result[i] = nextObject(creator);\n\n\t\treturn result;\n\t}\n\n\tpublic ArrayList nextGenericObjectArrayList(final int N, final ICreator creator) throws IOException, NumberFormatException {\n\t\tArrayList result = new ArrayList();\n\t\tfor(int i=0; i < N; i++) result.add(nextObject(creator));\n\n\t\treturn result;\n\t}\n\n\tpublic void nextTable(final int N, IArrayInitializer... arrayInitializers) throws IOException, NumberFormatException {\n\t\tfor(int i=0; i < N; i++) for(IArrayInitializer initializer: arrayInitializers)\n\t\t{\n\t\t\tinitializer.initialize(this, i);\n\t\t}\n\t}\n}", "problem_context": "Tree Walk\n\nBinary trees are defined recursively. A binary tree T is a structure defined on a finite set of nodes that either\n\ncontains no nodes, or\n\nis composed of three disjoint sets of nodes:\n\n- a root node.\n\n- a binary tree called its left subtree.\n\n- a binary tree called its right subtree.\n\nYour task is to write a program which perform tree walks (systematically traverse all nodes in a tree) based on the following algorithms:\n\nPrint the root, the left subtree and right subtree (preorder).\n\nPrint the left subtree, the root and right subtree (inorder).\n\nPrint the left subtree, right subtree and the root (postorder).\n\nHere, the given binary tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nInput\n\nThe first line of the input includes an integer n, the number of nodes of the tree.\n\nIn the next n linen, the information of each node is given in the following format:\n\nid left right\n\nid is the node ID, left is ID of the left child and right is ID of the right child. If the node does not have the left (right) child, the left(right) is indicated by -1\n\nOutput\n\nIn the 1st line, print \"Preorder\", and in the 2nd line print a list of node IDs obtained by the preorder tree walk.\n\nIn the 3rd line, print \"Inorder\", and in the 4th line print a list of node IDs obtained by the inorder tree walk.\n\nIn the 5th line, print \"Postorder\", and in the 6th line print a list of node IDs obtained by the postorder tree walk.\n\nPrint a space character before each node ID.\n\nConstraints\n\n1 ≤ n ≤ 25\n\nSample Input 1\n\n9\n0 1 4\n1 2 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n\nSample Output 1\n\nPreorder\n0 1 2 3 4 5 6 7 8\nInorder\n2 1 3 0 6 5 7 4 8\nPostorder\n2 3 1 6 7 5 8 4 0\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "9\n0 1 4\n1 2 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n"}, "reference_outputs": ["Preorder\n 0 1 2 3 4 5 6 7 8\nInorder\n 2 1 3 0 6 5 7 4 8\nPostorder\n 2 3 1 6 7 5 8 4 0\n"], "source_document_id": "p02281", "source_text": "Tree Walk\n\nBinary trees are defined recursively. A binary tree T is a structure defined on a finite set of nodes that either\n\ncontains no nodes, or\n\nis composed of three disjoint sets of nodes:\n\n- a root node.\n\n- a binary tree called its left subtree.\n\n- a binary tree called its right subtree.\n\nYour task is to write a program which perform tree walks (systematically traverse all nodes in a tree) based on the following algorithms:\n\nPrint the root, the left subtree and right subtree (preorder).\n\nPrint the left subtree, the root and right subtree (inorder).\n\nPrint the left subtree, right subtree and the root (postorder).\n\nHere, the given binary tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nInput\n\nThe first line of the input includes an integer n, the number of nodes of the tree.\n\nIn the next n linen, the information of each node is given in the following format:\n\nid left right\n\nid is the node ID, left is ID of the left child and right is ID of the right child. If the node does not have the left (right) child, the left(right) is indicated by -1\n\nOutput\n\nIn the 1st line, print \"Preorder\", and in the 2nd line print a list of node IDs obtained by the preorder tree walk.\n\nIn the 3rd line, print \"Inorder\", and in the 4th line print a list of node IDs obtained by the inorder tree walk.\n\nIn the 5th line, print \"Postorder\", and in the 6th line print a list of node IDs obtained by the postorder tree walk.\n\nPrint a space character before each node ID.\n\nConstraints\n\n1 ≤ n ≤ 25\n\nSample Input 1\n\n9\n0 1 4\n1 2 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1\n\nSample Output 1\n\nPreorder\n0 1 2 3 4 5 6 7 8\nInorder\n2 1 3 0 6 5 7 4 8\nPostorder\n2 3 1 6 7 5 8 4 0\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9033, "cpu_time_ms": 30, "memory_kb": 24108}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s069420888", "group_id": "codeNet:p02283", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n class Main {\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint num = scanner.nextInt();\n\t\tNode root = null;\n\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tString element = scanner.next();\n\t\t\tif (!element.equals(\"print\")) {\n\t\t\t\tint key = scanner.nextInt();\n\t\t\t\tNode node = new Node(key);\n\t\t\t\tif (root == null) {\n\t\t\t\t\troot = node;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\ttreeInsert(root, node);\n\t\t\t} else {\n\t\t\t\tStringBuilder stringBuilder = new StringBuilder();\n\t\t\t\troot.inorderTreeWalk(stringBuilder);\n\t\t\t\tSystem.out.println(stringBuilder);\n\t\t\t\tstringBuilder = new StringBuilder();\n\t\t\t\troot.preorderTreeWalk(stringBuilder);\n\t\t\t\tSystem.out.println(stringBuilder);\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic void treeInsert(Node root, Node z) {\n\t\tNode y = null;\n\t\tNode x = root;\n\t\twhile (x != null) {\n\t\t\ty = x;\n\t\t\tif (z.key < x.key) {\n\t\t\t\tx = x.leftChild;\n\t\t\t} else {\n\t\t\t\tx = x.rightChild;\n\t\t\t}\n\t\t}\n\t\tz.parent = y;\n\n\t\tif (y == null) {\n\t\t\troot = z;\n\t\t} else if (z.key < y.key) {\n\t\t\ty.leftChild = z;\n\t\t} else {\n\t\t\ty.rightChild = z;\n\t\t}\n\t}\n}\n class Node {\n\t/** ????????????????????§??? */\n\tpublic Node parent;\n\t\n\t/** ???????????§??? */\n\tpublic Node rightChild;\n\t\n\t/** ???????????§??? */\n\tpublic Node leftChild;\n\t\n\t/** ?????????????????§??? */\n\tpublic int key;\n\t\n\tpublic Node(int key) {\n\t\tthis.key = key;\n\t}\n\t\n\t/** ??????????????????????????? */\n\tpublic void inorderTreeWalk(StringBuilder stringBuilder) {\n\t\tif (leftChild != null) {\n\t\t\tleftChild.inorderTreeWalk(stringBuilder);\n\t\t}\n\t\tstringBuilder.append(\" \" + String.valueOf(key));\n\t\tif (rightChild != null) {\n\t\t\trightChild.inorderTreeWalk(stringBuilder);\n\t\t}\n\t}\n\t\n\t/** ??????????????????????????? */\n\tpublic void preorderTreeWalk(StringBuilder stringBuilder) {\n\t\tstringBuilder.append(\" \" + String.valueOf(key));\n\t\tif (leftChild != null) {\n\t\t\tleftChild.preorderTreeWalk(stringBuilder);\n\t\t}\n\t\tif (rightChild != null) {\n\t\t\trightChild.preorderTreeWalk(stringBuilder);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1498020224, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02283.html", "problem_id": "p02283", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02283/input.txt", "sample_output_relpath": "derived/input_output/data/p02283/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02283/Java/s069420888.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s069420888", "user_id": "u381495450"}, "prompt_components": {"gold_output": " 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Scanner;\n class Main {\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint num = scanner.nextInt();\n\t\tNode root = null;\n\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tString element = scanner.next();\n\t\t\tif (!element.equals(\"print\")) {\n\t\t\t\tint key = scanner.nextInt();\n\t\t\t\tNode node = new Node(key);\n\t\t\t\tif (root == null) {\n\t\t\t\t\troot = node;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\ttreeInsert(root, node);\n\t\t\t} else {\n\t\t\t\tStringBuilder stringBuilder = new StringBuilder();\n\t\t\t\troot.inorderTreeWalk(stringBuilder);\n\t\t\t\tSystem.out.println(stringBuilder);\n\t\t\t\tstringBuilder = new StringBuilder();\n\t\t\t\troot.preorderTreeWalk(stringBuilder);\n\t\t\t\tSystem.out.println(stringBuilder);\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic void treeInsert(Node root, Node z) {\n\t\tNode y = null;\n\t\tNode x = root;\n\t\twhile (x != null) {\n\t\t\ty = x;\n\t\t\tif (z.key < x.key) {\n\t\t\t\tx = x.leftChild;\n\t\t\t} else {\n\t\t\t\tx = x.rightChild;\n\t\t\t}\n\t\t}\n\t\tz.parent = y;\n\n\t\tif (y == null) {\n\t\t\troot = z;\n\t\t} else if (z.key < y.key) {\n\t\t\ty.leftChild = z;\n\t\t} else {\n\t\t\ty.rightChild = z;\n\t\t}\n\t}\n}\n class Node {\n\t/** ????????????????????§??? */\n\tpublic Node parent;\n\t\n\t/** ???????????§??? */\n\tpublic Node rightChild;\n\t\n\t/** ???????????§??? */\n\tpublic Node leftChild;\n\t\n\t/** ?????????????????§??? */\n\tpublic int key;\n\t\n\tpublic Node(int key) {\n\t\tthis.key = key;\n\t}\n\t\n\t/** ??????????????????????????? */\n\tpublic void inorderTreeWalk(StringBuilder stringBuilder) {\n\t\tif (leftChild != null) {\n\t\t\tleftChild.inorderTreeWalk(stringBuilder);\n\t\t}\n\t\tstringBuilder.append(\" \" + String.valueOf(key));\n\t\tif (rightChild != null) {\n\t\t\trightChild.inorderTreeWalk(stringBuilder);\n\t\t}\n\t}\n\t\n\t/** ??????????????????????????? */\n\tpublic void preorderTreeWalk(StringBuilder stringBuilder) {\n\t\tstringBuilder.append(\" \" + String.valueOf(key));\n\t\tif (leftChild != null) {\n\t\t\tleftChild.preorderTreeWalk(stringBuilder);\n\t\t}\n\t\tif (rightChild != null) {\n\t\t\trightChild.preorderTreeWalk(stringBuilder);\n\t\t}\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nBinary Search Tree I\n\nSearch trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.\n\nBinary search tree is one of fundamental search trees. The keys in a binary search tree are always stored in such a way as to satisfy the following binary search tree property:\n\nLet $x$ be a node in a binary search tree. If $y$ is a node in the left subtree of $x$, then $y.key \\leq x.key$. If $y$ is a node in the right subtree of $x$, then $x.key \\leq y.key$.\n\nThe following figure shows an example of the binary search tree.\n\nFor example, keys of nodes which belong to the left sub-tree of the node containing 80 are less than or equal to 80, and keys of nodes which belong to the right sub-tree are more than or equal to 80. The binary search tree property allows us to print out all the keys in the tree in sorted order by an inorder tree walk.\n\nA binary search tree should be implemented in such a way that the binary search tree property continues to hold after modifications by insertions and deletions. A binary search tree can be represented by a linked data structure in which each node is an object. In addition to a key field and satellite data, each node contains fields left, right, and p that point to the nodes corresponding to its left child, its right child, and its parent, respectively.\n\nTo insert a new value $v$ into a binary search tree $T$, we can use the procedure insert as shown in the following pseudo code. The insert procedure is passed a node $z$ for which $z.key = v$, $z.left = NIL$, and $z.right = NIL$. The procedure modifies $T$ and some of the fields of $z$ in such a way that $z$ is inserted into an appropriate position in the tree.\n\n1 insert(T, z)\n2 y = NIL // parent of x\n3 x = 'the root of T'\n4 while x ≠ NIL\n5 y = x // set the parent\n6 if z.key < x.key\n7 x = x.left // move to the left child\n8 else\n9 x = x.right // move to the right child\n10 z.p = y\n11\n12 if y == NIL // T is empty\n13 'the root of T' = z\n14 else if z.key < y.key\n15 y.left = z // z is the left child of y\n16 else\n17 y.right = z // z is the right child of y\n\nWrite a program which performs the following operations to a binary search tree $T$.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nYou should use the above pseudo code to implement the insert operation. $T$ is empty at the initial state.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$ or print are given.\n\nOutput\n\nFor each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n8\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\ninsert 17\ninsert 25\nprint\n\nSample Output 1\n\n1 12 17 20 25 30 88\n30 12 1 20 17 25 88\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "8\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\ninsert 17\ninsert 25\nprint\n"}, "reference_outputs": [" 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n"], "source_document_id": "p02283", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nBinary Search Tree I\n\nSearch trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.\n\nBinary search tree is one of fundamental search trees. The keys in a binary search tree are always stored in such a way as to satisfy the following binary search tree property:\n\nLet $x$ be a node in a binary search tree. If $y$ is a node in the left subtree of $x$, then $y.key \\leq x.key$. If $y$ is a node in the right subtree of $x$, then $x.key \\leq y.key$.\n\nThe following figure shows an example of the binary search tree.\n\nFor example, keys of nodes which belong to the left sub-tree of the node containing 80 are less than or equal to 80, and keys of nodes which belong to the right sub-tree are more than or equal to 80. The binary search tree property allows us to print out all the keys in the tree in sorted order by an inorder tree walk.\n\nA binary search tree should be implemented in such a way that the binary search tree property continues to hold after modifications by insertions and deletions. A binary search tree can be represented by a linked data structure in which each node is an object. In addition to a key field and satellite data, each node contains fields left, right, and p that point to the nodes corresponding to its left child, its right child, and its parent, respectively.\n\nTo insert a new value $v$ into a binary search tree $T$, we can use the procedure insert as shown in the following pseudo code. The insert procedure is passed a node $z$ for which $z.key = v$, $z.left = NIL$, and $z.right = NIL$. The procedure modifies $T$ and some of the fields of $z$ in such a way that $z$ is inserted into an appropriate position in the tree.\n\n1 insert(T, z)\n2 y = NIL // parent of x\n3 x = 'the root of T'\n4 while x ≠ NIL\n5 y = x // set the parent\n6 if z.key < x.key\n7 x = x.left // move to the left child\n8 else\n9 x = x.right // move to the right child\n10 z.p = y\n11\n12 if y == NIL // T is empty\n13 'the root of T' = z\n14 else if z.key < y.key\n15 y.left = z // z is the left child of y\n16 else\n17 y.right = z // z is the right child of y\n\nWrite a program which performs the following operations to a binary search tree $T$.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nYou should use the above pseudo code to implement the insert operation. $T$ is empty at the initial state.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$ or print are given.\n\nOutput\n\nFor each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n8\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\ninsert 17\ninsert 25\nprint\n\nSample Output 1\n\n1 12 17 20 25 30 88\n30 12 1 20 17 25 88\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2082, "cpu_time_ms": 1510, "memory_kb": 310260}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s015423025", "group_id": "codeNet:p02283", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Node {\n\tint key;\n\tNode parent, left, right;\n\n\tpublic Node(int key) {\n\t\tsuper();\n\t\tthis.key = key;\n\t}\n\n}\n\nclass Tree {\n\tNode root;\n\n\n\n\tvoid insert(Node z) {\n\t\tNode y = null; // parent of x\n\t\tNode x = this.root; // the root of Tree\n\n\t\twhile (x != null) {\n\t\t\ty = x;\n\t\t\tif (z.key < x.key) {\n\t\t\t\tx = x.left;\n\t\t\t} else {\n\t\t\t\tx = x.right;\n\t\t\t}\n\t\t}\n\t\tz.parent = y;\n\n\t\tif (y == null) {\n\t\t\tthis.root = z;\n\t\t} else {\n\t\t\tif (z.key < y.key) {\n\t\t\t\ty.left = z;\n\t\t\t} else {\n\t\t\t\ty.right = z;\n\t\t\t}\n\t\t}\n\t}\n\n\n}\n\npublic class Main {\n\n\tstatic StringBuilder sb;\n\n\tpublic static void printPreOrder(Node node) {\n\t\tif (node == null) {\n\t\t\treturn;\n\t\t}\n\n\t\tsb.append(\" \" + node.key);\n\t\tprintPreOrder(node.left);\n\t\tprintPreOrder(node.right);\n\t}\n\n\tpublic static void printInOrder(Node node) {\n\t\tif (node == null) {\n\t\t\treturn;\n\t\t}\n\n\t\tprintInOrder(node.left);\n\t\tsb.append(\" \" + node.key);\n\t\tprintInOrder(node.right);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tint m = Integer.parseInt(br.readLine());\n\t\tString[] operation;\n\t\tint key;\n\t\tTree tree = new Tree();\n\t\tsb = new StringBuilder();\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\toperation = br.readLine().split(\" \");\n\t\t\tif (operation[0].equals(\"insert\")) {\n\t\t\t\tkey = Integer.parseInt(operation[1]);\n\t\t\t\ttree.insert(new Node(key));\n\t\t\t} else {\n\t\t\t\tprintInOrder(tree.root);\n\t\t\t\tsb.append(\"\\n\");\n\t\t\t\tprintPreOrder(tree.root);\n\t\t\t\tSystem.out.println(sb.toString());\n\t\t\t\tsb.setLength(0);\n\t\t\t}\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1537749268, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02283.html", "problem_id": "p02283", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02283/input.txt", "sample_output_relpath": "derived/input_output/data/p02283/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02283/Java/s015423025.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s015423025", "user_id": "u676874280"}, "prompt_components": {"gold_output": " 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Node {\n\tint key;\n\tNode parent, left, right;\n\n\tpublic Node(int key) {\n\t\tsuper();\n\t\tthis.key = key;\n\t}\n\n}\n\nclass Tree {\n\tNode root;\n\n\n\n\tvoid insert(Node z) {\n\t\tNode y = null; // parent of x\n\t\tNode x = this.root; // the root of Tree\n\n\t\twhile (x != null) {\n\t\t\ty = x;\n\t\t\tif (z.key < x.key) {\n\t\t\t\tx = x.left;\n\t\t\t} else {\n\t\t\t\tx = x.right;\n\t\t\t}\n\t\t}\n\t\tz.parent = y;\n\n\t\tif (y == null) {\n\t\t\tthis.root = z;\n\t\t} else {\n\t\t\tif (z.key < y.key) {\n\t\t\t\ty.left = z;\n\t\t\t} else {\n\t\t\t\ty.right = z;\n\t\t\t}\n\t\t}\n\t}\n\n\n}\n\npublic class Main {\n\n\tstatic StringBuilder sb;\n\n\tpublic static void printPreOrder(Node node) {\n\t\tif (node == null) {\n\t\t\treturn;\n\t\t}\n\n\t\tsb.append(\" \" + node.key);\n\t\tprintPreOrder(node.left);\n\t\tprintPreOrder(node.right);\n\t}\n\n\tpublic static void printInOrder(Node node) {\n\t\tif (node == null) {\n\t\t\treturn;\n\t\t}\n\n\t\tprintInOrder(node.left);\n\t\tsb.append(\" \" + node.key);\n\t\tprintInOrder(node.right);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tint m = Integer.parseInt(br.readLine());\n\t\tString[] operation;\n\t\tint key;\n\t\tTree tree = new Tree();\n\t\tsb = new StringBuilder();\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\toperation = br.readLine().split(\" \");\n\t\t\tif (operation[0].equals(\"insert\")) {\n\t\t\t\tkey = Integer.parseInt(operation[1]);\n\t\t\t\ttree.insert(new Node(key));\n\t\t\t} else {\n\t\t\t\tprintInOrder(tree.root);\n\t\t\t\tsb.append(\"\\n\");\n\t\t\t\tprintPreOrder(tree.root);\n\t\t\t\tSystem.out.println(sb.toString());\n\t\t\t\tsb.setLength(0);\n\t\t\t}\n\t\t}\n\t}\n}\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nBinary Search Tree I\n\nSearch trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.\n\nBinary search tree is one of fundamental search trees. The keys in a binary search tree are always stored in such a way as to satisfy the following binary search tree property:\n\nLet $x$ be a node in a binary search tree. If $y$ is a node in the left subtree of $x$, then $y.key \\leq x.key$. If $y$ is a node in the right subtree of $x$, then $x.key \\leq y.key$.\n\nThe following figure shows an example of the binary search tree.\n\nFor example, keys of nodes which belong to the left sub-tree of the node containing 80 are less than or equal to 80, and keys of nodes which belong to the right sub-tree are more than or equal to 80. The binary search tree property allows us to print out all the keys in the tree in sorted order by an inorder tree walk.\n\nA binary search tree should be implemented in such a way that the binary search tree property continues to hold after modifications by insertions and deletions. A binary search tree can be represented by a linked data structure in which each node is an object. In addition to a key field and satellite data, each node contains fields left, right, and p that point to the nodes corresponding to its left child, its right child, and its parent, respectively.\n\nTo insert a new value $v$ into a binary search tree $T$, we can use the procedure insert as shown in the following pseudo code. The insert procedure is passed a node $z$ for which $z.key = v$, $z.left = NIL$, and $z.right = NIL$. The procedure modifies $T$ and some of the fields of $z$ in such a way that $z$ is inserted into an appropriate position in the tree.\n\n1 insert(T, z)\n2 y = NIL // parent of x\n3 x = 'the root of T'\n4 while x ≠ NIL\n5 y = x // set the parent\n6 if z.key < x.key\n7 x = x.left // move to the left child\n8 else\n9 x = x.right // move to the right child\n10 z.p = y\n11\n12 if y == NIL // T is empty\n13 'the root of T' = z\n14 else if z.key < y.key\n15 y.left = z // z is the left child of y\n16 else\n17 y.right = z // z is the right child of y\n\nWrite a program which performs the following operations to a binary search tree $T$.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nYou should use the above pseudo code to implement the insert operation. $T$ is empty at the initial state.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$ or print are given.\n\nOutput\n\nFor each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n8\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\ninsert 17\ninsert 25\nprint\n\nSample Output 1\n\n1 12 17 20 25 30 88\n30 12 1 20 17 25 88\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "8\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\ninsert 17\ninsert 25\nprint\n"}, "reference_outputs": [" 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n"], "source_document_id": "p02283", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nBinary Search Tree I\n\nSearch trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.\n\nBinary search tree is one of fundamental search trees. The keys in a binary search tree are always stored in such a way as to satisfy the following binary search tree property:\n\nLet $x$ be a node in a binary search tree. If $y$ is a node in the left subtree of $x$, then $y.key \\leq x.key$. If $y$ is a node in the right subtree of $x$, then $x.key \\leq y.key$.\n\nThe following figure shows an example of the binary search tree.\n\nFor example, keys of nodes which belong to the left sub-tree of the node containing 80 are less than or equal to 80, and keys of nodes which belong to the right sub-tree are more than or equal to 80. The binary search tree property allows us to print out all the keys in the tree in sorted order by an inorder tree walk.\n\nA binary search tree should be implemented in such a way that the binary search tree property continues to hold after modifications by insertions and deletions. A binary search tree can be represented by a linked data structure in which each node is an object. In addition to a key field and satellite data, each node contains fields left, right, and p that point to the nodes corresponding to its left child, its right child, and its parent, respectively.\n\nTo insert a new value $v$ into a binary search tree $T$, we can use the procedure insert as shown in the following pseudo code. The insert procedure is passed a node $z$ for which $z.key = v$, $z.left = NIL$, and $z.right = NIL$. The procedure modifies $T$ and some of the fields of $z$ in such a way that $z$ is inserted into an appropriate position in the tree.\n\n1 insert(T, z)\n2 y = NIL // parent of x\n3 x = 'the root of T'\n4 while x ≠ NIL\n5 y = x // set the parent\n6 if z.key < x.key\n7 x = x.left // move to the left child\n8 else\n9 x = x.right // move to the right child\n10 z.p = y\n11\n12 if y == NIL // T is empty\n13 'the root of T' = z\n14 else if z.key < y.key\n15 y.left = z // z is the left child of y\n16 else\n17 y.right = z // z is the right child of y\n\nWrite a program which performs the following operations to a binary search tree $T$.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nYou should use the above pseudo code to implement the insert operation. $T$ is empty at the initial state.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$ or print are given.\n\nOutput\n\nFor each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n8\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\ninsert 17\ninsert 25\nprint\n\nSample Output 1\n\n1 12 17 20 25 30 88\n30 12 1 20 17 25 88\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1609, "cpu_time_ms": 760, "memory_kb": 139900}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s697863136", "group_id": "codeNet:p02294", "input_text": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\nclass Main {\n\n\tstatic int n;\n\tstatic double[] x1, y1, x2, y2;\n\tstatic double sx, sy, gx, gy;\n\tstatic ArrayList[] g;\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint q = sc.nextInt();\n\t\twhile (q-- > 0) {\n\t\t\tdouble x0, y0, x1, y1, x2, y2, x3, y3;\n\t\t\tx0 = sc.nextDouble();\n\t\t\ty0 = sc.nextDouble();\n\t\t\tx1 = sc.nextDouble();\n\t\t\ty1 = sc.nextDouble();\n\t\t\tx2 = sc.nextDouble();\n\t\t\ty2 = sc.nextDouble();\n\t\t\tx3 = sc.nextDouble();\n\t\t\ty3 = sc.nextDouble();\n\t\t\tPoint p0 = new Point(x0, y0);\n\t\t\tPoint p1 = new Point(x1, y1);\n\t\t\tPoint p2 = new Point(x2, y2);\n\t\t\tPoint p3 = new Point(x3, y3);\n\t\t\tif (linesIntersect(p0, p1, p2, p3)) {\n\t\t\t\tSystem.out.println(1);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(0);\n\t\t\t}\n\t\t}\n\t\t// ArrayList ps = new ArrayList<>();\n\t\t// n = sc.nextInt();\n\t\t// x1 = new double[n];\n\t\t// y1 = new double[n];\n\t\t// x2 = new double[n];\n\t\t// y2 = new double[n];\n\t\t// for (int i = 0; i < n; ++i) {\n\t\t// x1[i] = sc.nextDouble();\n\t\t// y1[i] = sc.nextDouble();\n\t\t// x2[i] = sc.nextDouble();\n\t\t// y2[i] = sc.nextDouble();\n\t\t// ps.add(new Point(x1[i], y1[i]));\n\t\t// ps.add(new Point(x2[i], y2[i]));\n\t\t// }\n\t\t//\n\t\t// for (int i = 0; i < n; ++i) {\n\t\t// for (int j = i + 1; j < n; ++j) {\n\t\t//\n\t\t// }\n\t\t// }\n\n\t}\n\n\tstatic class Point {\n\t\tdouble x, y;\n\t\tint id;\n\n\t\tpublic Point(double x, double y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\t}\n\n\tstatic boolean linesIntersect(Point s1, Point d1, Point s2, Point d2) {\n\t\treturn ((crossProduct(s1, d1, s1, d2) * crossProduct(s1, d1, s1, s2)) < 0)\n\t\t\t\t&& ((crossProduct(s2, d2, s2, s1) * crossProduct(s2, d2, s2, d1) < 0));\n\t}\n\n\tstatic double crossProduct(Point s1, Point d1, Point s2, Point d2) {\n\t\treturn (d1.x - s1.x) * (d2.y - s2.y) - (d1.y - s1.y) * (d2.x - s2.x);\n\t}\n\n\tstatic void tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n}", "language": "Java", "metadata": {"date": 1487952291, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02294.html", "problem_id": "p02294", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02294/input.txt", "sample_output_relpath": "derived/input_output/data/p02294/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02294/Java/s697863136.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s697863136", "user_id": "u323357326"}, "prompt_components": {"gold_output": "1\n1\n0\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\nclass Main {\n\n\tstatic int n;\n\tstatic double[] x1, y1, x2, y2;\n\tstatic double sx, sy, gx, gy;\n\tstatic ArrayList[] g;\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint q = sc.nextInt();\n\t\twhile (q-- > 0) {\n\t\t\tdouble x0, y0, x1, y1, x2, y2, x3, y3;\n\t\t\tx0 = sc.nextDouble();\n\t\t\ty0 = sc.nextDouble();\n\t\t\tx1 = sc.nextDouble();\n\t\t\ty1 = sc.nextDouble();\n\t\t\tx2 = sc.nextDouble();\n\t\t\ty2 = sc.nextDouble();\n\t\t\tx3 = sc.nextDouble();\n\t\t\ty3 = sc.nextDouble();\n\t\t\tPoint p0 = new Point(x0, y0);\n\t\t\tPoint p1 = new Point(x1, y1);\n\t\t\tPoint p2 = new Point(x2, y2);\n\t\t\tPoint p3 = new Point(x3, y3);\n\t\t\tif (linesIntersect(p0, p1, p2, p3)) {\n\t\t\t\tSystem.out.println(1);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(0);\n\t\t\t}\n\t\t}\n\t\t// ArrayList ps = new ArrayList<>();\n\t\t// n = sc.nextInt();\n\t\t// x1 = new double[n];\n\t\t// y1 = new double[n];\n\t\t// x2 = new double[n];\n\t\t// y2 = new double[n];\n\t\t// for (int i = 0; i < n; ++i) {\n\t\t// x1[i] = sc.nextDouble();\n\t\t// y1[i] = sc.nextDouble();\n\t\t// x2[i] = sc.nextDouble();\n\t\t// y2[i] = sc.nextDouble();\n\t\t// ps.add(new Point(x1[i], y1[i]));\n\t\t// ps.add(new Point(x2[i], y2[i]));\n\t\t// }\n\t\t//\n\t\t// for (int i = 0; i < n; ++i) {\n\t\t// for (int j = i + 1; j < n; ++j) {\n\t\t//\n\t\t// }\n\t\t// }\n\n\t}\n\n\tstatic class Point {\n\t\tdouble x, y;\n\t\tint id;\n\n\t\tpublic Point(double x, double y) {\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}\n\t}\n\n\tstatic boolean linesIntersect(Point s1, Point d1, Point s2, Point d2) {\n\t\treturn ((crossProduct(s1, d1, s1, d2) * crossProduct(s1, d1, s1, s2)) < 0)\n\t\t\t\t&& ((crossProduct(s2, d2, s2, s1) * crossProduct(s2, d2, s2, d1) < 0));\n\t}\n\n\tstatic double crossProduct(Point s1, Point d1, Point s2, Point d2) {\n\t\treturn (d1.x - s1.x) * (d2.y - s2.y) - (d1.y - s1.y) * (d2.x - s2.x);\n\t}\n\n\tstatic void tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n}", "problem_context": "Intersection\n\nFor given two segments s1 and s2, print \"1\" if they are intersect, \"0\" otherwise.\n\ns1 is formed by end points p0 and p1, and\ns2 is formed by end points p2 and p3.\n\nInput\n\nThe entire input looks like:\n\nq (the number of queries)\n1st query\n2nd query\n...\nqth query\n\nEach query consists of integer coordinates of end points of s1 and s2 in the following format:\n\nxp0 yp0 xp1 yp1 xp2 yp2 xp3 yp3\n\nOutput\n\nFor each query, print \"1\" or \"0\".\n\nConstraints\n\n1 ≤ q ≤ 1000\n\n-10000 ≤ xpi, ypi ≤ 10000\n\np0 ≠ p1 and\np2 ≠ p3.\n\nSample Input 1\n\n3\n0 0 3 0 1 1 2 -1\n0 0 3 0 3 1 3 -1\n0 0 3 0 3 -2 5 0\n\nSample Output 1\n\n1\n1\n0", "sample_input": "3\n0 0 3 0 1 1 2 -1\n0 0 3 0 3 1 3 -1\n0 0 3 0 3 -2 5 0\n"}, "reference_outputs": ["1\n1\n0\n"], "source_document_id": "p02294", "source_text": "Intersection\n\nFor given two segments s1 and s2, print \"1\" if they are intersect, \"0\" otherwise.\n\ns1 is formed by end points p0 and p1, and\ns2 is formed by end points p2 and p3.\n\nInput\n\nThe entire input looks like:\n\nq (the number of queries)\n1st query\n2nd query\n...\nqth query\n\nEach query consists of integer coordinates of end points of s1 and s2 in the following format:\n\nxp0 yp0 xp1 yp1 xp2 yp2 xp3 yp3\n\nOutput\n\nFor each query, print \"1\" or \"0\".\n\nConstraints\n\n1 ≤ q ≤ 1000\n\n-10000 ≤ xpi, ypi ≤ 10000\n\np0 ≠ p1 and\np2 ≠ p3.\n\nSample Input 1\n\n3\n0 0 3 0 1 1 2 -1\n0 0 3 0 3 1 3 -1\n0 0 3 0 3 -2 5 0\n\nSample Output 1\n\n1\n1\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1923, "cpu_time_ms": 70, "memory_kb": 28192}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s434422177", "group_id": "codeNet:p02314", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.math.BigDecimal;\nimport java.util.*;\nimport java.util.function.IntFunction;\nimport java.util.function.Supplier;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\nimport java.util.stream.Stream;\n\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner();\n int n=scanner.nextInt();\n int m=scanner.nextInt();\n int[] c=new int[m];\n for(int i=0;ival) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(a[mid]>val){\n return upper_bound(a,l,mid,val);\n }else{\n return upper_bound(a,mid,r,val);\n }\n }\n public static int lower_bound(int[] a,int val){\n return lower_bound(a,0,a.length,val);\n }\n public static int lower_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l] Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "language": "Java", "metadata": {"date": 1536483670, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02314.html", "problem_id": "p02314", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02314/input.txt", "sample_output_relpath": "derived/input_output/data/p02314/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02314/Java/s434422177.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s434422177", "user_id": "u514853553"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.math.BigDecimal;\nimport java.util.*;\nimport java.util.function.IntFunction;\nimport java.util.function.Supplier;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\nimport java.util.stream.Stream;\n\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner();\n int n=scanner.nextInt();\n int m=scanner.nextInt();\n int[] c=new int[m];\n for(int i=0;ival) return l;\n return r;\n }\n int mid=(l+r)/2;\n if(a[mid]>val){\n return upper_bound(a,l,mid,val);\n }else{\n return upper_bound(a,mid,r,val);\n }\n }\n public static int lower_bound(int[] a,int val){\n return lower_bound(a,0,a.length,val);\n }\n public static int lower_bound(int[] a,int l,int r,int val){\n if(r-l==1){\n if(a[l] Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "problem_context": "Coin Changing Problem\n\nFind the minimum number of coins to make change for n cents using coins of denominations d1, d2,.., dm. The coins can be used any number of times.\n\nInput\n\nn m\nd1 d2 ... dm\n\nTwo integers n and m are given in the first line. The available denominations are given in the second line.\n\nOutput\n\nPrint the minimum number of coins in a line.\n\nConstraints\n\n1 ≤ n ≤ 50000\n\n1 ≤ m ≤ 20\n\n1 ≤ denomination ≤ 10000\n\nThe denominations are all different and contain 1.\n\nSample Input 1\n\n55 4\n1 5 10 50\n\nSample Output 1\n\n2\n\nSample Input 2\n\n15 6\n1 2 7 8 12 50\n\nSample Output 2\n\n2\n\nSample Input 3\n\n65 6\n1 2 7 8 12 50\n\nSample Output 3\n\n3", "sample_input": "55 4\n1 5 10 50\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02314", "source_text": "Coin Changing Problem\n\nFind the minimum number of coins to make change for n cents using coins of denominations d1, d2,.., dm. The coins can be used any number of times.\n\nInput\n\nn m\nd1 d2 ... dm\n\nTwo integers n and m are given in the first line. The available denominations are given in the second line.\n\nOutput\n\nPrint the minimum number of coins in a line.\n\nConstraints\n\n1 ≤ n ≤ 50000\n\n1 ≤ m ≤ 20\n\n1 ≤ denomination ≤ 10000\n\nThe denominations are all different and contain 1.\n\nSample Input 1\n\n55 4\n1 5 10 50\n\nSample Output 1\n\n2\n\nSample Input 2\n\n15 6\n1 2 7 8 12 50\n\nSample Output 2\n\n2\n\nSample Input 3\n\n65 6\n1 2 7 8 12 50\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4661, "cpu_time_ms": 40, "memory_kb": 24940}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s061164010", "group_id": "codeNet:p02316", "input_text": "\nimport static java.lang.Math.*;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic int MOD = 1000000007;\n\tstatic int[] mh4 = { 0, -1, 1, 0 };\n\tstatic int[] mw4 = { -1, 0, 0, 1 };\n\tstatic int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\tstatic int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\n\tstatic class TaskX {\n\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt(), W = in.nextInt();\n\t\t\tint[][] dp = new int[n+1][W+1];\n\t\t\tint[] v = new int[n];\n\t\t\tint[] w = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tv[i] = in.nextInt();\n\t\t\t\tw[i] = in.nextInt();\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tfor (int j = 0; j < W+1; j++) {\n\t\t\t\t\tif (j-w[i] >= 0) {\n\t\t\t\t\t\tdp[i+1][j] = max(max(dp[i+1][j-w[i]] + v[i], dp[i][j-w[i]] + v[i]), dp[i][j]);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tdp[i+1][j] = dp[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tout.println(dp[n][W]);\n\n\t\t}\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\t}\n\n}\n\n", "language": "Java", "metadata": {"date": 1530016476, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02316.html", "problem_id": "p02316", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02316/input.txt", "sample_output_relpath": "derived/input_output/data/p02316/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02316/Java/s061164010.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s061164010", "user_id": "u836797982"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "\nimport static java.lang.Math.*;\n\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic int MOD = 1000000007;\n\tstatic int[] mh4 = { 0, -1, 1, 0 };\n\tstatic int[] mw4 = { -1, 0, 0, 1 };\n\tstatic int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\tstatic int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\n\tstatic class TaskX {\n\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt(), W = in.nextInt();\n\t\t\tint[][] dp = new int[n+1][W+1];\n\t\t\tint[] v = new int[n];\n\t\t\tint[] w = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tv[i] = in.nextInt();\n\t\t\t\tw[i] = in.nextInt();\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tfor (int j = 0; j < W+1; j++) {\n\t\t\t\t\tif (j-w[i] >= 0) {\n\t\t\t\t\t\tdp[i+1][j] = max(max(dp[i+1][j-w[i]] + v[i], dp[i][j-w[i]] + v[i]), dp[i][j]);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tdp[i+1][j] = dp[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tout.println(dp[n][W]);\n\n\t\t}\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\t}\n\n}\n\n", "problem_context": "Knapsack Problem\n\nYou have N kinds of items that you want to put them into a knapsack. Item i has value vi and weight wi.\n\nYou want to find a subset of items to put such that:\n\nThe total value of the items is as large as possible.\n\nThe items have combined weight at most W, that is capacity of the knapsack.\n\nYou can select as many items as possible into a knapsack for each kind.\n\nFind the maximum total value of items in the knapsack.\n\nInput\n\nN W\nv1 w1\nv2 w2\n:\nvN wN\n\nThe first line consists of the integers N and W. In the following lines, the value and weight of the i-th item are given.\n\nOutput\n\nPrint the maximum total values of the items in a line.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ vi ≤ 1000\n\n1 ≤ wi ≤ 1000\n\n1 ≤ W ≤ 10000\n\nSample Input 1\n\n4 8\n4 2\n5 2\n2 1\n8 3\n\nSample Output 1\n\n21\n\nSample Input 2\n\n2 20\n5 9\n4 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n3 9\n2 1\n3 1\n5 2\n\nSample Output 3\n\n27", "sample_input": "4 8\n4 2\n5 2\n2 1\n8 3\n"}, "reference_outputs": ["21\n"], "source_document_id": "p02316", "source_text": "Knapsack Problem\n\nYou have N kinds of items that you want to put them into a knapsack. Item i has value vi and weight wi.\n\nYou want to find a subset of items to put such that:\n\nThe total value of the items is as large as possible.\n\nThe items have combined weight at most W, that is capacity of the knapsack.\n\nYou can select as many items as possible into a knapsack for each kind.\n\nFind the maximum total value of items in the knapsack.\n\nInput\n\nN W\nv1 w1\nv2 w2\n:\nvN wN\n\nThe first line consists of the integers N and W. In the following lines, the value and weight of the i-th item are given.\n\nOutput\n\nPrint the maximum total values of the items in a line.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ vi ≤ 1000\n\n1 ≤ wi ≤ 1000\n\n1 ≤ W ≤ 10000\n\nSample Input 1\n\n4 8\n4 2\n5 2\n2 1\n8 3\n\nSample Output 1\n\n21\n\nSample Input 2\n\n2 20\n5 9\n4 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n3 9\n2 1\n3 1\n5 2\n\nSample Output 3\n\n27", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2441, "cpu_time_ms": 80, "memory_kb": 29200}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s050544573", "group_id": "codeNet:p02321", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.NoSuchElementException;\n \npublic class Main {\n\tprivate static FastScanner sc = new FastScanner();\n\t\n\tpublic static void main(String[] args) {\n\t\tint N = sc.nextInt();\n\t\tlong W = sc.nextLong();\n\t\tlong[] v = new long[N];\n\t\tlong[] w = new long[N];\n\t\tfor(int i=0; i> j & 1) == 1) {\n\t\t\t\t\t\tvsum += v[j];\n\t\t\t\t\t\twsum += w[j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(wsum <= W && vsum > max) {\n\t\t\t\t\tmax = vsum;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(max);\n\t\t} else {\n\t\t\tArrayList set1 = new ArrayList<>();\n\t\t\tfor(int i=0; i> j & 1) == 1) {\n\t\t\t\t\t\tvsum += v[j];\n\t\t\t\t\t\twsum += w[j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tset1.add(new Set(vsum, wsum, i));\n\t\t\t}\n\t\t\tArrayList set2 = new ArrayList<>();\n\t\t\tfor(int i=0; i> j & 1) == 1) {\n\t\t\t\t\t\tvsum += v[j+20];\n\t\t\t\t\t\twsum += w[j+20];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tset2.add(new Set(vsum, wsum, i));\n\t\t\t}\n\t\t\tCollections.sort(set2, (a, b) -> {\n\t\t\t\tif(a.wsum > b.wsum) {\n\t\t\t\t\treturn 1;\n\t\t\t\t} else if(a.wsum < b.wsum){\n\t\t\t\t\treturn -1;\n\t\t\t\t} else {\n\t\t\t\t\treturn a.id > b.id ? 1 : -1;\n\t\t\t\t}\n\t\t\t});\n\t\t\tlong temp = 0;\n\t\t\tfor(int i=0; i temp) {\n\t\t\t\t\ttemp = set2.get(i).vsum;\n\t\t\t\t} else if(set2.get(i).vsum < temp) {\n\t\t\t\t\tset2.get(i).vsum = temp;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong max = 0;\n\t\t\tfor(int i=0; i wrest) {\n\t\t\t\t\t\tr = m - 1;\n\t\t\t\t\t} else if(set2.get(m).wsum < wrest) {\n\t\t\t\t\t\tif(m+1 >= set2.size() || set2.get(m+1).wsum > wrest) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tl = m + 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\twhile(true) {\n\t\t\t\t\t\t\tif(m+1 >= set2.size()) break;\n\t\t\t\t\t\t\tif(set2.get(m+1).wsum == wrest) {\n\t\t\t\t\t\t\t\tm++;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(m < 0) m = 0;\n\t\t\t\tif(m >= set2.size()) m = set2.size() - 1;\n\t\t\t\tif(set1.get(i).vsum + set2.get(m).vsum > max) {\n//\t\t\t\t\tSystem.out.println(set1.get(i).vsum + \" \" + set2.get(m).vsum);\n\t\t\t\t\tmax = set1.get(i).vsum + set2.get(m).vsum;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(max);\n\t\t}\n\t}\n\t\n\tstatic class Set {\n\t\tint id;\n\t\tlong vsum;\n\t\tlong wsum;\n\t\tSet(long vsum, long wsum, int id) {\n\t\t\tthis.vsum = vsum;\n\t\t\tthis.wsum = wsum;\n\t\t\tthis.id = id;\n\t\t}\n\t}\n\t\n\tstatic class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if(ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch(IOException e) {\n e.printStackTrace();\n }\n if(buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n public boolean hasNext() { skipUnprintable(); return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public int nextInt(){\n return Integer.parseInt(next());\n }\n public double nextDouble(){\n return Double.parseDouble(next());\n }\n }\n}", "language": "Java", "metadata": {"date": 1506855751, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02321.html", "problem_id": "p02321", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02321/input.txt", "sample_output_relpath": "derived/input_output/data/p02321/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02321/Java/s050544573.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s050544573", "user_id": "u758581602"}, "prompt_components": {"gold_output": "13\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.NoSuchElementException;\n \npublic class Main {\n\tprivate static FastScanner sc = new FastScanner();\n\t\n\tpublic static void main(String[] args) {\n\t\tint N = sc.nextInt();\n\t\tlong W = sc.nextLong();\n\t\tlong[] v = new long[N];\n\t\tlong[] w = new long[N];\n\t\tfor(int i=0; i> j & 1) == 1) {\n\t\t\t\t\t\tvsum += v[j];\n\t\t\t\t\t\twsum += w[j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(wsum <= W && vsum > max) {\n\t\t\t\t\tmax = vsum;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(max);\n\t\t} else {\n\t\t\tArrayList set1 = new ArrayList<>();\n\t\t\tfor(int i=0; i> j & 1) == 1) {\n\t\t\t\t\t\tvsum += v[j];\n\t\t\t\t\t\twsum += w[j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tset1.add(new Set(vsum, wsum, i));\n\t\t\t}\n\t\t\tArrayList set2 = new ArrayList<>();\n\t\t\tfor(int i=0; i> j & 1) == 1) {\n\t\t\t\t\t\tvsum += v[j+20];\n\t\t\t\t\t\twsum += w[j+20];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tset2.add(new Set(vsum, wsum, i));\n\t\t\t}\n\t\t\tCollections.sort(set2, (a, b) -> {\n\t\t\t\tif(a.wsum > b.wsum) {\n\t\t\t\t\treturn 1;\n\t\t\t\t} else if(a.wsum < b.wsum){\n\t\t\t\t\treturn -1;\n\t\t\t\t} else {\n\t\t\t\t\treturn a.id > b.id ? 1 : -1;\n\t\t\t\t}\n\t\t\t});\n\t\t\tlong temp = 0;\n\t\t\tfor(int i=0; i temp) {\n\t\t\t\t\ttemp = set2.get(i).vsum;\n\t\t\t\t} else if(set2.get(i).vsum < temp) {\n\t\t\t\t\tset2.get(i).vsum = temp;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong max = 0;\n\t\t\tfor(int i=0; i wrest) {\n\t\t\t\t\t\tr = m - 1;\n\t\t\t\t\t} else if(set2.get(m).wsum < wrest) {\n\t\t\t\t\t\tif(m+1 >= set2.size() || set2.get(m+1).wsum > wrest) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tl = m + 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\twhile(true) {\n\t\t\t\t\t\t\tif(m+1 >= set2.size()) break;\n\t\t\t\t\t\t\tif(set2.get(m+1).wsum == wrest) {\n\t\t\t\t\t\t\t\tm++;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(m < 0) m = 0;\n\t\t\t\tif(m >= set2.size()) m = set2.size() - 1;\n\t\t\t\tif(set1.get(i).vsum + set2.get(m).vsum > max) {\n//\t\t\t\t\tSystem.out.println(set1.get(i).vsum + \" \" + set2.get(m).vsum);\n\t\t\t\t\tmax = set1.get(i).vsum + set2.get(m).vsum;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(max);\n\t\t}\n\t}\n\t\n\tstatic class Set {\n\t\tint id;\n\t\tlong vsum;\n\t\tlong wsum;\n\t\tSet(long vsum, long wsum, int id) {\n\t\t\tthis.vsum = vsum;\n\t\t\tthis.wsum = wsum;\n\t\t\tthis.id = id;\n\t\t}\n\t}\n\t\n\tstatic class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if(ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch(IOException e) {\n e.printStackTrace();\n }\n if(buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n public boolean hasNext() { skipUnprintable(); return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public int nextInt(){\n return Integer.parseInt(next());\n }\n public double nextDouble(){\n return Double.parseDouble(next());\n }\n }\n}", "problem_context": "Huge Knapsack Problem\n\nYou have N items that you want to put them into a knapsack. Item i has value vi and weight wi.\n\nYou want to find a subset of items to put such that:\n\nThe total value of the items is as large as possible.\n\nThe items have combined weight at most W, that is capacity of the knapsack.\n\nFind the maximum total value of items in the knapsack.\n\nInput\n\nN W\nv1 w1\nv2 w2\n:\nvN wN\n\nThe first line consists of the integers N and W. In the following N lines, the value and weight of the i-th item are given.\n\nOutput\n\nPrint the maximum total values of the items in a line.\n\nConstraints\n\n1 ≤ N ≤ 40\n\n1 ≤ vi ≤ 1015\n\n1 ≤ wi ≤ 1015\n\n1 ≤ W ≤ 1015\n\nSample Input 1\n\n4 5\n4 2\n5 2\n2 1\n8 3\n\nSample Output 1\n\n13\n\nSample Input 2\n\n2 20\n5 9\n4 10\n\nSample Output 2\n\n9", "sample_input": "4 5\n4 2\n5 2\n2 1\n8 3\n"}, "reference_outputs": ["13\n"], "source_document_id": "p02321", "source_text": "Huge Knapsack Problem\n\nYou have N items that you want to put them into a knapsack. Item i has value vi and weight wi.\n\nYou want to find a subset of items to put such that:\n\nThe total value of the items is as large as possible.\n\nThe items have combined weight at most W, that is capacity of the knapsack.\n\nFind the maximum total value of items in the knapsack.\n\nInput\n\nN W\nv1 w1\nv2 w2\n:\nvN wN\n\nThe first line consists of the integers N and W. In the following N lines, the value and weight of the i-th item are given.\n\nOutput\n\nPrint the maximum total values of the items in a line.\n\nConstraints\n\n1 ≤ N ≤ 40\n\n1 ≤ vi ≤ 1015\n\n1 ≤ wi ≤ 1015\n\n1 ≤ W ≤ 1015\n\nSample Input 1\n\n4 5\n4 2\n5 2\n2 1\n8 3\n\nSample Output 1\n\n13\n\nSample Input 2\n\n2 20\n5 9\n4 10\n\nSample Output 2\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4448, "cpu_time_ms": 20000, "memory_kb": 121068}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s817354551", "group_id": "codeNet:p02326", "input_text": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic int MOD = 1000000007;\n\tstatic int[] mh4 = { 0, -1, 1, 0 };\n\tstatic int[] mw4 = { -1, 0, 0, 1 };\n\tstatic int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\tstatic int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\n\tstatic class TaskX {\n\n\t\tint[][] sum;\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint h = in.nextInt();\n\t\t\tint w = in.nextInt();\n\n\t\t\tint[][] mat = new int[h+1][w+1];\n\t\t\tfor (int i = 0; i < h; i++) {\n\t\t\t\tfor (int j = 0; j < w; j++) {\n\t\t\t\t\tmat[i][j] = in.nextInt();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tsum = new int[h+1][w+1];\n\t\t\tfor (int i = 0; i <= h; i++) {\n\t\t\t\tfor (int j = 0; j <= w; j++) {\n\t\t\t\t\tsum[i][j] = mat[i][j];\n\t\t\t\t\tif (j - 1 >= 0) sum[i][j] += sum[i][j - 1];\n\t\t\t\t\tif (i - 1 >= 0) sum[i][j] += sum[i - 1][j];\n\t\t\t\t\tif (i - 1 >= 0 && j - 1 >= 0) sum[i][j] -= sum[i - 1][j - 1];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint k = Math.min(h, w)-1;\n\t\t\twhile (k >= 0) {\n\t\t\t\tfor (int i = 0; i+k < h; i++) {\n\t\t\t\t\tfor (int j = 0; j+k < w; j++) {\n\t\t\t\t\t\tif (get(i, j, i+k, j+k) == 0) {\n\t\t\t\t\t\t\tout.println((k+1)*(k+1));\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk--;\n\t\t\t}\n\n\t\t\tout.println(0);\n\t\t}\n\n\t\tint get(int x1, int y1, int x2, int y2) {\n\n\t\t\tint res = sum[x2][y2];\n\t\t\tif (x1 > 0) res -= sum[x1 - 1][y2];\n\t\t\tif (y1 > 0) res -= sum[x2][y1 - 1];\n\t\t\tif (x1 > 0 && y1 > 0) res += sum[x1 - 1][y1 - 1];\n\n\t\t\treturn res;\n\t\t}\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\t}\n\n}\n\n", "language": "Java", "metadata": {"date": 1530287381, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02326.html", "problem_id": "p02326", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02326/input.txt", "sample_output_relpath": "derived/input_output/data/p02326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02326/Java/s817354551.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s817354551", "user_id": "u836797982"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic int MOD = 1000000007;\n\tstatic int[] mh4 = { 0, -1, 1, 0 };\n\tstatic int[] mw4 = { -1, 0, 0, 1 };\n\tstatic int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\tstatic int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\n\tstatic class TaskX {\n\n\t\tint[][] sum;\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint h = in.nextInt();\n\t\t\tint w = in.nextInt();\n\n\t\t\tint[][] mat = new int[h+1][w+1];\n\t\t\tfor (int i = 0; i < h; i++) {\n\t\t\t\tfor (int j = 0; j < w; j++) {\n\t\t\t\t\tmat[i][j] = in.nextInt();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tsum = new int[h+1][w+1];\n\t\t\tfor (int i = 0; i <= h; i++) {\n\t\t\t\tfor (int j = 0; j <= w; j++) {\n\t\t\t\t\tsum[i][j] = mat[i][j];\n\t\t\t\t\tif (j - 1 >= 0) sum[i][j] += sum[i][j - 1];\n\t\t\t\t\tif (i - 1 >= 0) sum[i][j] += sum[i - 1][j];\n\t\t\t\t\tif (i - 1 >= 0 && j - 1 >= 0) sum[i][j] -= sum[i - 1][j - 1];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint k = Math.min(h, w)-1;\n\t\t\twhile (k >= 0) {\n\t\t\t\tfor (int i = 0; i+k < h; i++) {\n\t\t\t\t\tfor (int j = 0; j+k < w; j++) {\n\t\t\t\t\t\tif (get(i, j, i+k, j+k) == 0) {\n\t\t\t\t\t\t\tout.println((k+1)*(k+1));\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk--;\n\t\t\t}\n\n\t\t\tout.println(0);\n\t\t}\n\n\t\tint get(int x1, int y1, int x2, int y2) {\n\n\t\t\tint res = sum[x2][y2];\n\t\t\tif (x1 > 0) res -= sum[x1 - 1][y2];\n\t\t\tif (y1 > 0) res -= sum[x2][y1 - 1];\n\t\t\tif (x1 > 0 && y1 > 0) res += sum[x1 - 1][y1 - 1];\n\n\t\t\treturn res;\n\t\t}\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\t}\n\n}\n\n", "problem_context": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "sample_input": "4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02326", "source_text": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2924, "cpu_time_ms": 2120, "memory_kb": 100388}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s831372928", "group_id": "codeNet:p02345", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\nimport java.util.Arrays;\n\npublic class Main {\n\t/*\n\t TLE?????§????????¨. update???O(n)??\\???????????????????¢?????????????.\n\t ???????????§??? AC ???????????§, Verify?????????????????£?????????.\n\t*/\n\t\t\n\tpublic static class RMQ {\n\t\tlong[][] sparse_table; // query??? O(1)???????????????, k ????????¢????????????.\n\n\t\tpublic RMQ(long[] array){ // O(n log n)\n\t\t\tfinal int depth = Integer.numberOfTrailingZeros(Integer.highestOneBit(array.length));\n\t\t\tsparse_table = new long[depth + 1][]; sparse_table[0] = new long[array.length];\n\t\t\tSystem.arraycopy(array, 0, sparse_table[0], 0, array.length);\n\n\t\t\tfor(int k = 1; k < sparse_table.length; k++){\n\t\t\t\tsparse_table[k] = new long[array.length - (1 << k) + 1];\n\t\t\t\tfor(int i = 0; i + (1 << k) <= array.length; i++) { // [i, i + (1 << k))\n\t\t\t\t\t// [i, i + (1 << k) -> [i, i + (1 << k) / 2), [i + (1 << k) / 2, i << (k - 1))\n\t\t\t\t\tsparse_table[k][i] =\n\t\t\t\t\t\t\tMath.min(sparse_table[k-1][i], sparse_table[k-1][i + (1 << (k - 1))]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic void update(int index, long v){ // index: 0-index\n\t\t\t//update O(n log n) ??§???????????????. SegTree??§?????????.\n\t\t\tsparse_table[0][index] = v;\n\t\t\tfor(int k = 1; k < sparse_table.length; k++){\n\t\t\t\tfinal int begin = Math.max(0, index - (1 << k) + 1);\n\t\t\t\tfinal int end = Math.min(sparse_table[k].length, index + (1 << k));\n\t\t\t\t// ?????§??§ index + [-(1 << k) + 1, (1 << k)) ??????????????´??°?????????????????????\n\t\t\t\tfor(int i = begin; i < end; i++){\n\t\t\t\t\tsparse_table[k][i] =\n\t\t\t\t\t\t\tMath.min(sparse_table[k - 1][i], sparse_table[k-1][i + (1 << (k - 1))]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic long query(int l, int r){ // [l, r) O(log log n)\n\t\t\tfinal int k = Integer.numberOfTrailingZeros(Integer.highestOneBit(r - l));\n\t\t\t// k -> ???????????????????????????????????§???2?????????\n\t\t\t// left -> [i, i + (1 << k)), right -> [r - (1 << k)] (?????????????????§?±0)\n\t\t\treturn Math.min(sparse_table[k][l], sparse_table[k][r - (1 << k)]);\n\t\t}\n\t}\n\t\t\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tfinal int n = sc.nextInt();\n\t\tfinal int q = sc.nextInt();\n\t\t\n\t\tlong[] array = new long[n];\n\t\tArrays.fill(array, Integer.MAX_VALUE);\n\t\t\n\t\tRMQ rmq = new RMQ(array);\n\t\tfor(int tt = 0; tt < q; tt++){\n\t\t\tfinal int op = sc.nextInt();\n\t\t\tfinal int x = sc.nextInt();\n\t\t\tfinal int y = sc.nextInt();\n\n\t\t\tif(op == 0){\n\t\t\t\trmq.update(x, y);\n\t\t\t}else{\n\t\t\t\tSystem.out.println(rmq.query(x, y + 1));\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic static class Scanner {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tok;\n\n\t\tpublic Scanner(InputStream is) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\n\t\tprivate void getLine() {\n\t\t\ttry {\n\t\t\t\twhile (!hasNext()) {tok = new StringTokenizer(br.readLine());}\n\t\t\t} catch(IOException e){ /* ignore */ }\n\t\t}\n\n\t\tprivate boolean hasNext() {\n\t\t\treturn tok != null && tok.hasMoreTokens();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tgetLine(); return tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt(){\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t// ??????nextXXX???XXX.parseXXX()????????????????????£?????????????????§?????\\\n\n\t\tpublic void close() {\n\t\t\ttry{ br.close(); } catch (IOException e){ /*ignore*/ }\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1436546091, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02345.html", "problem_id": "p02345", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02345/input.txt", "sample_output_relpath": "derived/input_output/data/p02345/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02345/Java/s831372928.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s831372928", "user_id": "u197786702"}, "prompt_components": {"gold_output": "1\n2\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\nimport java.util.Arrays;\n\npublic class Main {\n\t/*\n\t TLE?????§????????¨. update???O(n)??\\???????????????????¢?????????????.\n\t ???????????§??? AC ???????????§, Verify?????????????????£?????????.\n\t*/\n\t\t\n\tpublic static class RMQ {\n\t\tlong[][] sparse_table; // query??? O(1)???????????????, k ????????¢????????????.\n\n\t\tpublic RMQ(long[] array){ // O(n log n)\n\t\t\tfinal int depth = Integer.numberOfTrailingZeros(Integer.highestOneBit(array.length));\n\t\t\tsparse_table = new long[depth + 1][]; sparse_table[0] = new long[array.length];\n\t\t\tSystem.arraycopy(array, 0, sparse_table[0], 0, array.length);\n\n\t\t\tfor(int k = 1; k < sparse_table.length; k++){\n\t\t\t\tsparse_table[k] = new long[array.length - (1 << k) + 1];\n\t\t\t\tfor(int i = 0; i + (1 << k) <= array.length; i++) { // [i, i + (1 << k))\n\t\t\t\t\t// [i, i + (1 << k) -> [i, i + (1 << k) / 2), [i + (1 << k) / 2, i << (k - 1))\n\t\t\t\t\tsparse_table[k][i] =\n\t\t\t\t\t\t\tMath.min(sparse_table[k-1][i], sparse_table[k-1][i + (1 << (k - 1))]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic void update(int index, long v){ // index: 0-index\n\t\t\t//update O(n log n) ??§???????????????. SegTree??§?????????.\n\t\t\tsparse_table[0][index] = v;\n\t\t\tfor(int k = 1; k < sparse_table.length; k++){\n\t\t\t\tfinal int begin = Math.max(0, index - (1 << k) + 1);\n\t\t\t\tfinal int end = Math.min(sparse_table[k].length, index + (1 << k));\n\t\t\t\t// ?????§??§ index + [-(1 << k) + 1, (1 << k)) ??????????????´??°?????????????????????\n\t\t\t\tfor(int i = begin; i < end; i++){\n\t\t\t\t\tsparse_table[k][i] =\n\t\t\t\t\t\t\tMath.min(sparse_table[k - 1][i], sparse_table[k-1][i + (1 << (k - 1))]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic long query(int l, int r){ // [l, r) O(log log n)\n\t\t\tfinal int k = Integer.numberOfTrailingZeros(Integer.highestOneBit(r - l));\n\t\t\t// k -> ???????????????????????????????????§???2?????????\n\t\t\t// left -> [i, i + (1 << k)), right -> [r - (1 << k)] (?????????????????§?±0)\n\t\t\treturn Math.min(sparse_table[k][l], sparse_table[k][r - (1 << k)]);\n\t\t}\n\t}\n\t\t\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tfinal int n = sc.nextInt();\n\t\tfinal int q = sc.nextInt();\n\t\t\n\t\tlong[] array = new long[n];\n\t\tArrays.fill(array, Integer.MAX_VALUE);\n\t\t\n\t\tRMQ rmq = new RMQ(array);\n\t\tfor(int tt = 0; tt < q; tt++){\n\t\t\tfinal int op = sc.nextInt();\n\t\t\tfinal int x = sc.nextInt();\n\t\t\tfinal int y = sc.nextInt();\n\n\t\t\tif(op == 0){\n\t\t\t\trmq.update(x, y);\n\t\t\t}else{\n\t\t\t\tSystem.out.println(rmq.query(x, y + 1));\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic static class Scanner {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tok;\n\n\t\tpublic Scanner(InputStream is) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\n\t\tprivate void getLine() {\n\t\t\ttry {\n\t\t\t\twhile (!hasNext()) {tok = new StringTokenizer(br.readLine());}\n\t\t\t} catch(IOException e){ /* ignore */ }\n\t\t}\n\n\t\tprivate boolean hasNext() {\n\t\t\treturn tok != null && tok.hasMoreTokens();\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tgetLine(); return tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt(){\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t// ??????nextXXX???XXX.parseXXX()????????????????????£?????????????????§?????\\\n\n\t\tpublic void close() {\n\t\t\ttry{ br.close(); } catch (IOException e){ /*ignore*/ }\n\t\t}\n\t}\n}", "problem_context": "Range Minimum Query (RMQ)\n\nWrite a program which manipulates a sequence A = {a0, a1, . . . , an-1} with the following operations:\n\nfind(s, t): report the minimum element in as, as+1, . . . ,at.\n\nupdate(i, x): change ai to x.\n\nNote that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.\n\nInput\n\nn q\ncom0 x0 y0\ncom1 x1 y1\n...\ncomq−1 xq−1 yq−1\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, q queries are given where com represents the type of queries. '0' denotes update(xi, yi) and '1' denotes find(xi, yi).\n\nOutput\n\nFor each find operation, print the minimum element.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\nIf comi is 0, then 0 ≤ xi < n, 0 ≤ yi < 231-1.\n\nIf comi is 1, then 0 ≤ xi < n, 0 ≤ yi < n.\n\nSample Input 1\n\n3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 2\n\nSample Output 1\n\n1\n2\n\nSample Input 2\n\n1 3\n1 0 0\n0 0 5\n1 0 0\n\nSample Output 2\n\n2147483647\n5", "sample_input": "3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 2\n"}, "reference_outputs": ["1\n2\n"], "source_document_id": "p02345", "source_text": "Range Minimum Query (RMQ)\n\nWrite a program which manipulates a sequence A = {a0, a1, . . . , an-1} with the following operations:\n\nfind(s, t): report the minimum element in as, as+1, . . . ,at.\n\nupdate(i, x): change ai to x.\n\nNote that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.\n\nInput\n\nn q\ncom0 x0 y0\ncom1 x1 y1\n...\ncomq−1 xq−1 yq−1\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, q queries are given where com represents the type of queries. '0' denotes update(xi, yi) and '1' denotes find(xi, yi).\n\nOutput\n\nFor each find operation, print the minimum element.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\nIf comi is 0, then 0 ≤ xi < n, 0 ≤ yi < 231-1.\n\nIf comi is 1, then 0 ≤ xi < n, 0 ≤ yi < n.\n\nSample Input 1\n\n3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 2\n\nSample Output 1\n\n1\n2\n\nSample Input 2\n\n1 3\n1 0 0\n0 0 5\n1 0 0\n\nSample Output 2\n\n2147483647\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3307, "cpu_time_ms": 7090, "memory_kb": 68528}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s988371670", "group_id": "codeNet:p02345", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tint[] a;\n\tint n=1;\n\tpublic static void main(String[] args){\n\t\tMain test = new Main();\n\t\tScanner inputScanner = new Scanner(System.in).useDelimiter(\"\\\\s\");\n\t\tint n1 = inputScanner.nextInt();\n\t\tint q = inputScanner.nextInt();\n\t\t\n\t\t\n\t\twhile (test.n < n1){\n\t\t\ttest.n *= 2;\n\t\t}\n\t//\tSystem.out.println(Integer.toString(test.n));\n\t\ttest.a = new int[(2 * test.n)-1 ]; \n\t//\tSystem.out.println(test.a.length);\n\t\tfor(int i=0;i 0){\n\t\t\tk = (k-1)/2;\n\t\t\ta[k] = Integer.min(a[(k*2)+1], a[(k*2)+2]);\n\t\t}\n\t}\n\t\n\tpublic int findMin(int b, int c){\n\t\t\n\t\treturn query(b,c+1,0,0,n);\n\t}\n\t\n\tpublic int query(int b, int c, int k, int l, int r){\n\t\tif (r <= b || c <= l)\n\t\t\treturn Integer.MAX_VALUE;\n\t\tif((b<=l && r<=c))\n\t\t\treturn a[k];\n\t\t\n\t\tint o1 = query(b,c,(k*2)+1,l,(l+r)/2);\n\t\tint o2 = query(b,c,(k*2)+2,(l+r)/2,r);\n\t\treturn Integer.min(o1, o2);\t\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1525037870, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02345.html", "problem_id": "p02345", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02345/input.txt", "sample_output_relpath": "derived/input_output/data/p02345/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02345/Java/s988371670.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s988371670", "user_id": "u978248297"}, "prompt_components": {"gold_output": "1\n2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tint[] a;\n\tint n=1;\n\tpublic static void main(String[] args){\n\t\tMain test = new Main();\n\t\tScanner inputScanner = new Scanner(System.in).useDelimiter(\"\\\\s\");\n\t\tint n1 = inputScanner.nextInt();\n\t\tint q = inputScanner.nextInt();\n\t\t\n\t\t\n\t\twhile (test.n < n1){\n\t\t\ttest.n *= 2;\n\t\t}\n\t//\tSystem.out.println(Integer.toString(test.n));\n\t\ttest.a = new int[(2 * test.n)-1 ]; \n\t//\tSystem.out.println(test.a.length);\n\t\tfor(int i=0;i 0){\n\t\t\tk = (k-1)/2;\n\t\t\ta[k] = Integer.min(a[(k*2)+1], a[(k*2)+2]);\n\t\t}\n\t}\n\t\n\tpublic int findMin(int b, int c){\n\t\t\n\t\treturn query(b,c+1,0,0,n);\n\t}\n\t\n\tpublic int query(int b, int c, int k, int l, int r){\n\t\tif (r <= b || c <= l)\n\t\t\treturn Integer.MAX_VALUE;\n\t\tif((b<=l && r<=c))\n\t\t\treturn a[k];\n\t\t\n\t\tint o1 = query(b,c,(k*2)+1,l,(l+r)/2);\n\t\tint o2 = query(b,c,(k*2)+2,(l+r)/2,r);\n\t\treturn Integer.min(o1, o2);\t\n\t}\n}\n\n", "problem_context": "Range Minimum Query (RMQ)\n\nWrite a program which manipulates a sequence A = {a0, a1, . . . , an-1} with the following operations:\n\nfind(s, t): report the minimum element in as, as+1, . . . ,at.\n\nupdate(i, x): change ai to x.\n\nNote that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.\n\nInput\n\nn q\ncom0 x0 y0\ncom1 x1 y1\n...\ncomq−1 xq−1 yq−1\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, q queries are given where com represents the type of queries. '0' denotes update(xi, yi) and '1' denotes find(xi, yi).\n\nOutput\n\nFor each find operation, print the minimum element.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\nIf comi is 0, then 0 ≤ xi < n, 0 ≤ yi < 231-1.\n\nIf comi is 1, then 0 ≤ xi < n, 0 ≤ yi < n.\n\nSample Input 1\n\n3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 2\n\nSample Output 1\n\n1\n2\n\nSample Input 2\n\n1 3\n1 0 0\n0 0 5\n1 0 0\n\nSample Output 2\n\n2147483647\n5", "sample_input": "3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 2\n"}, "reference_outputs": ["1\n2\n"], "source_document_id": "p02345", "source_text": "Range Minimum Query (RMQ)\n\nWrite a program which manipulates a sequence A = {a0, a1, . . . , an-1} with the following operations:\n\nfind(s, t): report the minimum element in as, as+1, . . . ,at.\n\nupdate(i, x): change ai to x.\n\nNote that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.\n\nInput\n\nn q\ncom0 x0 y0\ncom1 x1 y1\n...\ncomq−1 xq−1 yq−1\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, q queries are given where com represents the type of queries. '0' denotes update(xi, yi) and '1' denotes find(xi, yi).\n\nOutput\n\nFor each find operation, print the minimum element.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\nIf comi is 0, then 0 ≤ xi < n, 0 ≤ yi < 231-1.\n\nIf comi is 1, then 0 ≤ xi < n, 0 ≤ yi < n.\n\nSample Input 1\n\n3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 2\n\nSample Output 1\n\n1\n2\n\nSample Input 2\n\n1 3\n1 0 0\n0 0 5\n1 0 0\n\nSample Output 2\n\n2147483647\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1306, "cpu_time_ms": 840, "memory_kb": 109608}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s364811233", "group_id": "codeNet:p02347", "input_text": "import java.util.*;\n\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.LinkedList;\nimport java.util.List;\n\nclass Point {\n int id;\n long x;\n long y;\n\n Point(int id, long x, long y) {\n this.id = id;\n this.x = x;\n this.y = y;\n }\n}\n\nclass KDTree {\n private static final int K = 2;\n\n KDNode root;\n private Point[] points;\n private List answer;\n\n KDTree(Point[] points) {\n this.points = points;\n this.root = build(0, points.length, 0);\n }\n\n private KDNode build(int l, int r, int depth) {\n if (l >= r) return null;\n\n int mid = (l + r) / 2;\n if (depth % K == 0) {\n Arrays.sort(points, l, r, xComparator);\n } else if (depth % K == 1) {\n Arrays.sort(points, l, r, yComparator);\n } else {\n throw new RuntimeException();\n }\n\n KDNode node = new KDNode();\n\n node.location = mid;\n node.l = build(l, mid, depth + 1);\n node.r = build(mid + 1, r, depth + 1);\n\n return node;\n }\n\n List find(Point p1, Point p2) {\n answer = new LinkedList<>();\n long sx = Math.min(p1.x, p2.x);\n long sy = Math.min(p1.y, p2.y);\n long tx = Math.max(p1.x, p2.x);\n long ty = Math.max(p1.y, p2.y);\n find(root, sx, tx, sy, ty, 0);\n return answer;\n }\n\n private void find(KDNode v, long sx, long tx, long sy, long ty, int depth) {\n long x = points[v.location].x;\n long y = points[v.location].y;\n\n if (sx <= x && x <= tx && sy <= y && y <= ty) {\n answer.add(points[v.location]);\n }\n\n if (depth % K == 0) {\n if (v.l != null && sx <= x) find(v.l, sx, tx, sy, ty, depth + 1);\n if (v.r != null && x <= tx) find(v.r, sx, tx, sy, ty, depth + 1);\n } else if (depth % K == 1) {\n if (v.l != null && sy <= y) find(v.l, sx, tx, sy, ty, depth + 1);\n if (v.r != null && y <= ty) find(v.r, sx, tx, sy, ty, depth + 1);\n } else {\n throw new RuntimeException();\n }\n }\n\n private Comparator xComparator = new Comparator() {\n @Override\n public int compare(Point p1, Point p2) {\n return (int) Math.signum(p1.x - p2.x);\n }\n };\n\n private Comparator yComparator = new Comparator() {\n @Override\n public int compare(Point p1, Point p2) {\n return (int) Math.signum(p1.y - p2.y);\n }\n };\n\n class KDNode {\n int location;\n KDNode l, r;\n }\n}\n\n\npublic class Main {\n public static void main(String[] args) {\n new Solver().solve(new Scanner(System.in));\n// new Solver().solve(new Scanner(ex));\n }\n\n private static final String ex = \"6\\n\" +\n \"2 1\\n\" +\n \"2 2\\n\" +\n \"4 2\\n\" +\n \"6 2\\n\" +\n \"3 3\\n\" +\n \"5 4\\n\" +\n \"2\\n\" +\n \"2 4 0 4\\n\" +\n \"4 10 2 5\";\n}\n\nclass Solver {\n void solve(Scanner scanner) {\n int n = Integer.parseInt(scanner.nextLine());\n Point[] points = new Point[n];\n for (int i = 0; i < n; i ++) {\n long[] split = splitLong(scanner.nextLine());\n points[i] = new Point(i, split[0], split[1]);\n }\n KDTree tree = new KDTree(points);\n int q = Integer.parseInt(scanner.nextLine());\n for (int i = 0; i < q; i ++) {\n long[] split = splitLong(scanner.nextLine());\n long sx = split[0];\n long tx = split[1];\n long sy = split[2];\n long ty = split[3];\n List result = tree.find(new Point(-1, sx, sy), new Point(-1, tx, ty));\n result.stream().mapToInt(x -> x.id).sorted().forEach(System.out::println);\n System.out.println();\n }\n }\n\n private int[] splitInt(String s) {\n String[] split = s.split(\" \");\n int[] splitInt = new int[split.length];\n for (int i = 0; i < split.length; i ++) {\n splitInt[i] = Integer.parseInt(split[i]);\n }\n return splitInt;\n }\n\n private long[] splitLong(String s) {\n String[] split = s.split(\" \");\n long[] splitLong = new long[split.length];\n for (int i = 0; i < split.length; i ++) {\n splitLong[i] = Long.parseLong(split[i]);\n }\n return splitLong;\n }\n}", "language": "Java", "metadata": {"date": 1509279951, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02347.html", "problem_id": "p02347", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02347/input.txt", "sample_output_relpath": "derived/input_output/data/p02347/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02347/Java/s364811233.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s364811233", "user_id": "u564710701"}, "prompt_components": {"gold_output": "0\n1\n2\n4\n\n2\n3\n5\n", "input_to_evaluate": "import java.util.*;\n\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.LinkedList;\nimport java.util.List;\n\nclass Point {\n int id;\n long x;\n long y;\n\n Point(int id, long x, long y) {\n this.id = id;\n this.x = x;\n this.y = y;\n }\n}\n\nclass KDTree {\n private static final int K = 2;\n\n KDNode root;\n private Point[] points;\n private List answer;\n\n KDTree(Point[] points) {\n this.points = points;\n this.root = build(0, points.length, 0);\n }\n\n private KDNode build(int l, int r, int depth) {\n if (l >= r) return null;\n\n int mid = (l + r) / 2;\n if (depth % K == 0) {\n Arrays.sort(points, l, r, xComparator);\n } else if (depth % K == 1) {\n Arrays.sort(points, l, r, yComparator);\n } else {\n throw new RuntimeException();\n }\n\n KDNode node = new KDNode();\n\n node.location = mid;\n node.l = build(l, mid, depth + 1);\n node.r = build(mid + 1, r, depth + 1);\n\n return node;\n }\n\n List find(Point p1, Point p2) {\n answer = new LinkedList<>();\n long sx = Math.min(p1.x, p2.x);\n long sy = Math.min(p1.y, p2.y);\n long tx = Math.max(p1.x, p2.x);\n long ty = Math.max(p1.y, p2.y);\n find(root, sx, tx, sy, ty, 0);\n return answer;\n }\n\n private void find(KDNode v, long sx, long tx, long sy, long ty, int depth) {\n long x = points[v.location].x;\n long y = points[v.location].y;\n\n if (sx <= x && x <= tx && sy <= y && y <= ty) {\n answer.add(points[v.location]);\n }\n\n if (depth % K == 0) {\n if (v.l != null && sx <= x) find(v.l, sx, tx, sy, ty, depth + 1);\n if (v.r != null && x <= tx) find(v.r, sx, tx, sy, ty, depth + 1);\n } else if (depth % K == 1) {\n if (v.l != null && sy <= y) find(v.l, sx, tx, sy, ty, depth + 1);\n if (v.r != null && y <= ty) find(v.r, sx, tx, sy, ty, depth + 1);\n } else {\n throw new RuntimeException();\n }\n }\n\n private Comparator xComparator = new Comparator() {\n @Override\n public int compare(Point p1, Point p2) {\n return (int) Math.signum(p1.x - p2.x);\n }\n };\n\n private Comparator yComparator = new Comparator() {\n @Override\n public int compare(Point p1, Point p2) {\n return (int) Math.signum(p1.y - p2.y);\n }\n };\n\n class KDNode {\n int location;\n KDNode l, r;\n }\n}\n\n\npublic class Main {\n public static void main(String[] args) {\n new Solver().solve(new Scanner(System.in));\n// new Solver().solve(new Scanner(ex));\n }\n\n private static final String ex = \"6\\n\" +\n \"2 1\\n\" +\n \"2 2\\n\" +\n \"4 2\\n\" +\n \"6 2\\n\" +\n \"3 3\\n\" +\n \"5 4\\n\" +\n \"2\\n\" +\n \"2 4 0 4\\n\" +\n \"4 10 2 5\";\n}\n\nclass Solver {\n void solve(Scanner scanner) {\n int n = Integer.parseInt(scanner.nextLine());\n Point[] points = new Point[n];\n for (int i = 0; i < n; i ++) {\n long[] split = splitLong(scanner.nextLine());\n points[i] = new Point(i, split[0], split[1]);\n }\n KDTree tree = new KDTree(points);\n int q = Integer.parseInt(scanner.nextLine());\n for (int i = 0; i < q; i ++) {\n long[] split = splitLong(scanner.nextLine());\n long sx = split[0];\n long tx = split[1];\n long sy = split[2];\n long ty = split[3];\n List result = tree.find(new Point(-1, sx, sy), new Point(-1, tx, ty));\n result.stream().mapToInt(x -> x.id).sorted().forEach(System.out::println);\n System.out.println();\n }\n }\n\n private int[] splitInt(String s) {\n String[] split = s.split(\" \");\n int[] splitInt = new int[split.length];\n for (int i = 0; i < split.length; i ++) {\n splitInt[i] = Integer.parseInt(split[i]);\n }\n return splitInt;\n }\n\n private long[] splitLong(String s) {\n String[] split = s.split(\" \");\n long[] splitLong = new long[split.length];\n for (int i = 0; i < split.length; i ++) {\n splitLong[i] = Long.parseLong(split[i]);\n }\n return splitLong;\n }\n}", "problem_context": "Range Search (kD Tree)\n\nThe range search problem consists of a set of attributed records S to determine which records from S intersect with a given range.\n\nFor n points on a plane, report a set of points which are within in a given range. Note that you do not need to consider insert and delete operations for the set.\n\nInput\n\nn\nx0 y0\nx1 y1\n:\nxn-1 yn-1\nq\nsx0 tx0 sy0 ty0\nsx1 tx1 sy1 ty1\n:\nsxq-1 txq-1 syq-1 tyq-1\n\nThe first integer n is the number of points. In the following n lines, the coordinate of the i-th point is given by two integers xi and yi.\n\nThe next integer q is the number of queries. In the following q lines, each query is given by four integers,\nsxi,\ntxi,\nsyi,\ntyi.\n\nOutput\n\nFor each query, report IDs of points such that\nsxi ≤ x ≤ txi and\nsyi ≤ y ≤ tyi.\nThe IDs should be reported in ascending order. Print an ID in a line, and print a blank line at the end of output for the each query.\n\nConstraints\n\n0 ≤ n ≤ 500,000\n\n0 ≤ q ≤ 20,000\n\n-1,000,000,000 ≤ x, y, sx, tx, sy, ty ≤ 1,000,000,000\n\nsx ≤ tx\n\nsy ≤ ty\n\nFor each query, the number of points which are within the range is less than or equal to 100.\n\nSample Input 1\n\n6\n2 1\n2 2\n4 2\n6 2\n3 3\n5 4\n2\n2 4 0 4\n4 10 2 5\n\nSample Output 1\n\n0\n1\n2\n4\n\n2\n3\n5", "sample_input": "6\n2 1\n2 2\n4 2\n6 2\n3 3\n5 4\n2\n2 4 0 4\n4 10 2 5\n"}, "reference_outputs": ["0\n1\n2\n4\n\n2\n3\n5\n"], "source_document_id": "p02347", "source_text": "Range Search (kD Tree)\n\nThe range search problem consists of a set of attributed records S to determine which records from S intersect with a given range.\n\nFor n points on a plane, report a set of points which are within in a given range. Note that you do not need to consider insert and delete operations for the set.\n\nInput\n\nn\nx0 y0\nx1 y1\n:\nxn-1 yn-1\nq\nsx0 tx0 sy0 ty0\nsx1 tx1 sy1 ty1\n:\nsxq-1 txq-1 syq-1 tyq-1\n\nThe first integer n is the number of points. In the following n lines, the coordinate of the i-th point is given by two integers xi and yi.\n\nThe next integer q is the number of queries. In the following q lines, each query is given by four integers,\nsxi,\ntxi,\nsyi,\ntyi.\n\nOutput\n\nFor each query, report IDs of points such that\nsxi ≤ x ≤ txi and\nsyi ≤ y ≤ tyi.\nThe IDs should be reported in ascending order. Print an ID in a line, and print a blank line at the end of output for the each query.\n\nConstraints\n\n0 ≤ n ≤ 500,000\n\n0 ≤ q ≤ 20,000\n\n-1,000,000,000 ≤ x, y, sx, tx, sy, ty ≤ 1,000,000,000\n\nsx ≤ tx\n\nsy ≤ ty\n\nFor each query, the number of points which are within the range is less than or equal to 100.\n\nSample Input 1\n\n6\n2 1\n2 2\n4 2\n6 2\n3 3\n5 4\n2\n2 4 0 4\n4 10 2 5\n\nSample Output 1\n\n0\n1\n2\n4\n\n2\n3\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4418, "cpu_time_ms": 3780, "memory_kb": 483824}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s289857150", "group_id": "codeNet:p02363", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.lang.reflect.Array;\nimport java.util.ArrayList;\nimport java.util.Arrays;\n\npublic class Main {\n\n public static void main(String[] argv) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String[] str = br.readLine().split(\" \");\n int v = Integer.parseInt(str[0]);\n int e = Integer.parseInt(str[1]);\n\n long[][] map = new long[v][v];\n for(long[] obj: map)\n Arrays.fill(obj, Long.MAX_VALUE/2);\n for(int i=0; i map[i][k] + map[k][j])\n map[i][j] = map[i][k] + map[k][j];\n }\n }\n }\n\n for (int i=0; i map[i][k] + map[k][j])\n map[i][j] = map[i][k] + map[k][j];\n }\n }\n }\n\n for (int i=0; i> vEdges = new HashMap<>();\n\n for (int i = 0; i < e; i++) {\n String[] st = scanner.nextLine().split(\" \", 2);\n int s = Integer.parseInt(st[0]);\n int t = Integer.parseInt(st[1]);\n\n List edges = vEdges.get(s);\n if (edges == null) {\n edges = new ArrayList<>();\n vEdges.put(s, edges);\n }\n edges.add(t);\n }\n\n Set visited = new HashSet<>();\n List sorted = new ArrayList<>();\n for (int i = 0; i < v; i++) {\n visit(visited, sorted, vEdges, i, 0);\n }\n\n for (Integer vertex : sorted) {\n System.out.println(vertex);\n }\n }\n\n private static void visit(Set visited, List sorted, Map> vEdges, int vertex, int depth) {\n if (visited.contains(vertex)) return;\n visited.add(vertex);\n\n if (vEdges.containsKey(vertex)) {\n for (Integer edge : vEdges.get(vertex)) {\n visit(visited, sorted, vEdges, edge, depth + 1);\n }\n }\n sorted.add(0, vertex);\n }\n}\n\n", "language": "Java", "metadata": {"date": 1550393091, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02370.html", "problem_id": "p02370", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02370/input.txt", "sample_output_relpath": "derived/input_output/data/p02370/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02370/Java/s922459416.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s922459416", "user_id": "u249145870"}, "prompt_components": {"gold_output": "0\n3\n1\n4\n5\n2\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String[] ve = scanner.nextLine().split(\" \", 2);\n int v = Integer.parseInt(ve[0]);\n int e = Integer.parseInt(ve[1]);\n\n Map> vEdges = new HashMap<>();\n\n for (int i = 0; i < e; i++) {\n String[] st = scanner.nextLine().split(\" \", 2);\n int s = Integer.parseInt(st[0]);\n int t = Integer.parseInt(st[1]);\n\n List edges = vEdges.get(s);\n if (edges == null) {\n edges = new ArrayList<>();\n vEdges.put(s, edges);\n }\n edges.add(t);\n }\n\n Set visited = new HashSet<>();\n List sorted = new ArrayList<>();\n for (int i = 0; i < v; i++) {\n visit(visited, sorted, vEdges, i, 0);\n }\n\n for (Integer vertex : sorted) {\n System.out.println(vertex);\n }\n }\n\n private static void visit(Set visited, List sorted, Map> vEdges, int vertex, int depth) {\n if (visited.contains(vertex)) return;\n visited.add(vertex);\n\n if (vEdges.containsKey(vertex)) {\n for (Integer edge : vEdges.get(vertex)) {\n visit(visited, sorted, vEdges, edge, depth + 1);\n }\n }\n sorted.add(0, vertex);\n }\n}\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nTopological Sort\n\nA directed acyclic graph (DAG) can be used to represent the ordering of tasks. Tasks are represented by vertices and constraints where one task can begin before another, are represented by edges. For example, in the above example, you can undertake task B after both task A and task B are finished. You can obtain the proper sequence of all the tasks by a topological sort.\n\nGiven a DAG $G$, print the order of vertices after the topological sort.\n\nInput\n\nA directed graph $G$ is given in the following format:\n\n$|V|\\;|E|$\n\n$s_0 \\; t_0$\n\n$s_1 \\; t_1$\n\n:\n\n$s_{|E|-1} \\; t_{|E|-1}$\n\n$|V|$ is the number of vertices and $|E|$ is the number of edges in the graph. The graph vertices are named with the numbers $0, 1,..., |V|-1$ respectively.\n\n$s_i$ and $t_i$ represent source and target nodes of $i$-th edge (directed).\n\nOutput\n\nPrint the vertices numbers in order. Print a number in a line.\n\nIf there are multiple possible solutions, print any one of them (the solution is judged by a special validator).\n\nConstraints\n\n$1 \\leq |V| \\leq 10,000$\n\n$0 \\leq |E| \\leq 100,000$\n\nThere are no parallel edges in $G$\n\nThere are no self loops in $G$\n\nSample Input\n\n6 6\n0 1\n1 2\n3 1\n3 4\n4 5\n5 2\n\nSample Output\n\n0\n3\n1\n4\n5\n2", "sample_input": "6 6\n0 1\n1 2\n3 1\n3 4\n4 5\n5 2\n"}, "reference_outputs": ["0\n3\n1\n4\n5\n2\n"], "source_document_id": "p02370", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nTopological Sort\n\nA directed acyclic graph (DAG) can be used to represent the ordering of tasks. Tasks are represented by vertices and constraints where one task can begin before another, are represented by edges. For example, in the above example, you can undertake task B after both task A and task B are finished. You can obtain the proper sequence of all the tasks by a topological sort.\n\nGiven a DAG $G$, print the order of vertices after the topological sort.\n\nInput\n\nA directed graph $G$ is given in the following format:\n\n$|V|\\;|E|$\n\n$s_0 \\; t_0$\n\n$s_1 \\; t_1$\n\n:\n\n$s_{|E|-1} \\; t_{|E|-1}$\n\n$|V|$ is the number of vertices and $|E|$ is the number of edges in the graph. The graph vertices are named with the numbers $0, 1,..., |V|-1$ respectively.\n\n$s_i$ and $t_i$ represent source and target nodes of $i$-th edge (directed).\n\nOutput\n\nPrint the vertices numbers in order. Print a number in a line.\n\nIf there are multiple possible solutions, print any one of them (the solution is judged by a special validator).\n\nConstraints\n\n$1 \\leq |V| \\leq 10,000$\n\n$0 \\leq |E| \\leq 100,000$\n\nThere are no parallel edges in $G$\n\nThere are no self loops in $G$\n\nSample Input\n\n6 6\n0 1\n1 2\n3 1\n3 4\n4 5\n5 2\n\nSample Output\n\n0\n3\n1\n4\n5\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1464, "cpu_time_ms": 610, "memory_kb": 106820}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s185320887", "group_id": "codeNet:p02380", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n double a = sc.nextDouble();\n double b = sc.nextDouble();\n double angle = Math.toRadians(sc.nextDouble());\n double c = Math.sqrt(a*a + b*b - 2*a*b*Math.cos(angle));\n double L = a + b + c;\n double S = (a*b * Math.sin(angle))/2;\n double h = 2 * S / a;\n System.out.println(S);\n System.out.println(L);\n System.out.println(h);\n }\n}\n\n", "language": "Java", "metadata": {"date": 1537638190, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02380.html", "problem_id": "p02380", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02380/input.txt", "sample_output_relpath": "derived/input_output/data/p02380/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02380/Java/s185320887.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s185320887", "user_id": "u551828061"}, "prompt_components": {"gold_output": "6.00000000\n12.00000000\n3.00000000\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n double a = sc.nextDouble();\n double b = sc.nextDouble();\n double angle = Math.toRadians(sc.nextDouble());\n double c = Math.sqrt(a*a + b*b - 2*a*b*Math.cos(angle));\n double L = a + b + c;\n double S = (a*b * Math.sin(angle))/2;\n double h = 2 * S / a;\n System.out.println(S);\n System.out.println(L);\n System.out.println(h);\n }\n}\n\n", "problem_context": "Triangle\n\nFor given two sides of a triangle a and b and the angle C between them, calculate the following properties:\n\nS: Area of the triangle\n\nL: The length of the circumference of the triangle\n\nh: The height of the triangle with side a as a bottom edge\n\nInput\n\nThe length of a, the length of b and the angle C are given in integers.\n\nOutput\n\nPrint S, L and h in a line respectively. The output should not contain an absolute error greater than 10-4.\n\nSample Input\n\n4 3 90\n\nSample Output\n\n6.00000000\n12.00000000\n3.00000000", "sample_input": "4 3 90\n"}, "reference_outputs": ["6.00000000\n12.00000000\n3.00000000\n"], "source_document_id": "p02380", "source_text": "Triangle\n\nFor given two sides of a triangle a and b and the angle C between them, calculate the following properties:\n\nS: Area of the triangle\n\nL: The length of the circumference of the triangle\n\nh: The height of the triangle with side a as a bottom edge\n\nInput\n\nThe length of a, the length of b and the angle C are given in integers.\n\nOutput\n\nPrint S, L and h in a line respectively. The output should not contain an absolute error greater than 10-4.\n\nSample Input\n\n4 3 90\n\nSample Output\n\n6.00000000\n12.00000000\n3.00000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 538, "cpu_time_ms": 60, "memory_kb": 27916}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s852279130", "group_id": "codeNet:p02381", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\n Scanner scn = new Scanner(System.in);\n\n while(true){\n int count = scn.nextInt();\n\n if(count == 0) break;\n\n int [] array;\n array = new int[count];\n\n int sum = 0;\n Double ave = 0.0;\n Double ans = 0.0;\n Double answer = 0.0;\n\n\n for(int i = 0; i < count; i++){\n array[i] = scn.nextInt();\n sum += array[i];\n }\n\n ave = Double.valueOf(sum) / Double.valueOf(count);\n\n for(int i = 0; i < count; i++){\n ans += (array[i] - ave) * (array[i] - ave);\n }\n ans /= count;\n answer = Math.sqrt(ans);\n\n System.out.println(String.format(\"%.8f\", answer));\n\n }\n }\n}\n\n", "language": "Java", "metadata": {"date": 1556159921, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02381.html", "problem_id": "p02381", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02381/input.txt", "sample_output_relpath": "derived/input_output/data/p02381/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02381/Java/s852279130.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s852279130", "user_id": "u112516293"}, "prompt_components": {"gold_output": "27.85677655\n0.00000000\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\n Scanner scn = new Scanner(System.in);\n\n while(true){\n int count = scn.nextInt();\n\n if(count == 0) break;\n\n int [] array;\n array = new int[count];\n\n int sum = 0;\n Double ave = 0.0;\n Double ans = 0.0;\n Double answer = 0.0;\n\n\n for(int i = 0; i < count; i++){\n array[i] = scn.nextInt();\n sum += array[i];\n }\n\n ave = Double.valueOf(sum) / Double.valueOf(count);\n\n for(int i = 0; i < count; i++){\n ans += (array[i] - ave) * (array[i] - ave);\n }\n ans /= count;\n answer = Math.sqrt(ans);\n\n System.out.println(String.format(\"%.8f\", answer));\n\n }\n }\n}\n\n", "problem_context": "Standard Deviation\n\nYou have final scores of an examination for n students. Calculate standard deviation of the scores s1, s2 ... sn.\n\nThe variance α2 is defined by\n\nα2 = (∑ni=1(si - m)2)/n\n\nwhere m is an average of si.\n\nThe standard deviation of the scores is the square root of their variance.\n\nInput\n\nThe input consists of multiple datasets. Each dataset is given in the following format:\n\nn\ns1 s2 ... sn\n\nThe input ends with single zero for n.\n\nOutput\n\nFor each dataset, print the standard deviation in a line. The output should not contain an absolute error greater than 10-4.\n\nConstraints\n\nn ≤ 1000\n\n0 ≤ si ≤ 100\n\nSample Input\n\n5\n70 80 100 90 20\n3\n80 80 80\n0\n\nSample Output\n\n27.85677655\n0.00000000", "sample_input": "5\n70 80 100 90 20\n3\n80 80 80\n0\n"}, "reference_outputs": ["27.85677655\n0.00000000\n"], "source_document_id": "p02381", "source_text": "Standard Deviation\n\nYou have final scores of an examination for n students. Calculate standard deviation of the scores s1, s2 ... sn.\n\nThe variance α2 is defined by\n\nα2 = (∑ni=1(si - m)2)/n\n\nwhere m is an average of si.\n\nThe standard deviation of the scores is the square root of their variance.\n\nInput\n\nThe input consists of multiple datasets. Each dataset is given in the following format:\n\nn\ns1 s2 ... sn\n\nThe input ends with single zero for n.\n\nOutput\n\nFor each dataset, print the standard deviation in a line. The output should not contain an absolute error greater than 10-4.\n\nConstraints\n\nn ≤ 1000\n\n0 ≤ si ≤ 100\n\nSample Input\n\n5\n70 80 100 90 20\n3\n80 80 80\n0\n\nSample Output\n\n27.85677655\n0.00000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 882, "cpu_time_ms": 110, "memory_kb": 31448}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s814082908", "group_id": "codeNet:p02382", "input_text": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n;\n\t\tdouble[] data1 =new double[10];\n\t\tdouble[] data2 =new double[10];\n\t\tdouble[] ans =new double[10];\n\t\tdouble D=0,D2=0,D3=0,D4=Double.MIN_VALUE;\n\n\t\tn = sc.nextInt();\n\t\tfor(int i=0;iD4)D4=Math.abs(ans[i]);\n\t\t\t\n\t\t}\n\t\tSystem.out.println(D);\n\t\tSystem.out.println(Math.sqrt(D2));\n\t\tSystem.out.println(Math.cbrt(D3));\n\t\tSystem.out.println(D4);\n\t\t\n\t\tsc.close();\n\n\t}\n\n}\n\n", "language": "Java", "metadata": {"date": 1527587449, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02382.html", "problem_id": "p02382", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02382/input.txt", "sample_output_relpath": "derived/input_output/data/p02382/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02382/Java/s814082908.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s814082908", "user_id": "u779656282"}, "prompt_components": {"gold_output": "4.000000\n2.449490\n2.154435\n2.000000\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n;\n\t\tdouble[] data1 =new double[10];\n\t\tdouble[] data2 =new double[10];\n\t\tdouble[] ans =new double[10];\n\t\tdouble D=0,D2=0,D3=0,D4=Double.MIN_VALUE;\n\n\t\tn = sc.nextInt();\n\t\tfor(int i=0;iD4)D4=Math.abs(ans[i]);\n\t\t\t\n\t\t}\n\t\tSystem.out.println(D);\n\t\tSystem.out.println(Math.sqrt(D2));\n\t\tSystem.out.println(Math.cbrt(D3));\n\t\tSystem.out.println(D4);\n\t\t\n\t\tsc.close();\n\n\t}\n\n}\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDistance II\n\nYour task is to calculate the distance between two $n$ dimensional vectors $x = \\{x_1, x_2, ..., x_n\\}$ and $y = \\{y_1, y_2, ..., y_n\\}$.\n\nThe Minkowski's distance defined below is a metric which is a generalization of both the Manhattan distance and the Euclidean distance.\n\n\\[\nD_{xy} = (\\sum_{i=1}^n |x_i - y_i|^p)^{\\frac{1}{p}}\n\\]\n\nIt can be the Manhattan distance\n\n\\[\nD_{xy} = |x_1 - y_1| + |x_2 - y_2| + ... + |x_n - y_n|\n\\]\n\nwhere $p = 1 $.\n\nIt can be the Euclidean distance\n\n\\[\nD_{xy} = \\sqrt{(|x_1 - y_1|)^{2} + (|x_2 - y_2|)^{2} + ... + (|x_n - y_n|)^{2}}\n\\]\n\nwhere $p = 2 $.\n\nAlso, it can be the Chebyshev distance\n\n\\[\nD_{xy} = max_{i=1}^n (|x_i - y_i|)\n\\]\n\nwhere $p = \\infty$\n\nWrite a program which reads two $n$ dimensional vectors $x$ and $y$, and calculates Minkowski's distance where $p = 1, 2, 3, \\infty$ respectively.\n\nInput\n\nIn the first line, an integer $n$ is given. In the second and third line, $x = \\{x_1, x_2, ... x_n\\}$ and $y = \\{y_1, y_2, ... y_n\\}$ are given respectively. The elements in $x$ and $y$ are given in integers.\n\nOutput\n\nPrint the distance where $p = 1, 2, 3$ and $\\infty$ in a line respectively.\nThe output should not contain an absolute error greater than 10-5.\n\nConstraints\n\n$1 \\leq n \\leq 100$\n\n$0 \\leq x_i, y_i \\leq 1000$\n\nSample Input\n\n3\n1 2 3\n2 0 4\n\nSample Output\n\n4.000000\n2.449490\n2.154435\n2.000000", "sample_input": "3\n1 2 3\n2 0 4\n"}, "reference_outputs": ["4.000000\n2.449490\n2.154435\n2.000000\n"], "source_document_id": "p02382", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDistance II\n\nYour task is to calculate the distance between two $n$ dimensional vectors $x = \\{x_1, x_2, ..., x_n\\}$ and $y = \\{y_1, y_2, ..., y_n\\}$.\n\nThe Minkowski's distance defined below is a metric which is a generalization of both the Manhattan distance and the Euclidean distance.\n\n\\[\nD_{xy} = (\\sum_{i=1}^n |x_i - y_i|^p)^{\\frac{1}{p}}\n\\]\n\nIt can be the Manhattan distance\n\n\\[\nD_{xy} = |x_1 - y_1| + |x_2 - y_2| + ... + |x_n - y_n|\n\\]\n\nwhere $p = 1 $.\n\nIt can be the Euclidean distance\n\n\\[\nD_{xy} = \\sqrt{(|x_1 - y_1|)^{2} + (|x_2 - y_2|)^{2} + ... + (|x_n - y_n|)^{2}}\n\\]\n\nwhere $p = 2 $.\n\nAlso, it can be the Chebyshev distance\n\n\\[\nD_{xy} = max_{i=1}^n (|x_i - y_i|)\n\\]\n\nwhere $p = \\infty$\n\nWrite a program which reads two $n$ dimensional vectors $x$ and $y$, and calculates Minkowski's distance where $p = 1, 2, 3, \\infty$ respectively.\n\nInput\n\nIn the first line, an integer $n$ is given. In the second and third line, $x = \\{x_1, x_2, ... x_n\\}$ and $y = \\{y_1, y_2, ... y_n\\}$ are given respectively. The elements in $x$ and $y$ are given in integers.\n\nOutput\n\nPrint the distance where $p = 1, 2, 3$ and $\\infty$ in a line respectively.\nThe output should not contain an absolute error greater than 10-5.\n\nConstraints\n\n$1 \\leq n \\leq 100$\n\n$0 \\leq x_i, y_i \\leq 1000$\n\nSample Input\n\n3\n1 2 3\n2 0 4\n\nSample Output\n\n4.000000\n2.449490\n2.154435\n2.000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 777, "cpu_time_ms": 80, "memory_kb": 28176}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s340363385", "group_id": "codeNet:p02383", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n \tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String[] line = br.readLine().split(\" \");\n\n int[] data = new int[line.length];\n for (int i = 0; i < data.length; i++) {\n \tdata[i] = Integer.parseInt(line[i]);\n\t\t}\n\n Dice dice = new Dice(data);\n\n char[] moveData = br.readLine().toCharArray();\n for (int i = 0; i < moveData.length; i++) {\n \tdice.move(moveData[i]);\n }\n\n System.out.println(dice.getTop());\n }\n}\n\nclass Dice {\n\tprivate int top;\n\tprivate int bottom;\n\tprivate int left;\n\tprivate int right;\n\tprivate int front;\n\tprivate int back;\n\n\n\tDice(int[] data) {\n\t\tthis.top = data[1 - 1];\n\t\tthis.bottom = data[6 - 1];\n\t\tthis.left = data[4 - 1];\n\t\tthis.right = data[3 - 1];\n\t\tthis.front = data[2 - 1];\n\t\tthis.back = data[5 - 1];\n\t}\n\n\tpublic void move(char m) {\n\t\tint temp = -1;\n\t\tswitch (m) {\n\t\tcase 'N':\n\t\t\ttemp = this.top;\n\t\t\tthis.top = this.front;\n\t\t\tthis.front = this.bottom;\n\t\t\tthis.bottom = this.back;\n\t\t\tthis.back = temp;\n\n\t\t\tbreak;\n\n\t\tcase 'E':\n\t\t\ttemp = this.top;\n\t\t\tthis.top = this.left;\n\t\t\tthis.left = this.bottom;\n\t\t\tthis.bottom = this.right;\n\t\t\tthis.right = temp;\n\n\t\t\tbreak;\n\n\t\tcase 'W':\n\t\t\ttemp = this.top;\n\t\t\tthis.top = this.right;\n\t\t\tthis.right = this.bottom;\n\t\t\tthis.bottom = this.left;\n\t\t\tthis.left = temp;\n\n\t\t\tbreak;\n\n\t\tcase 'S':\n\t\t\ttemp = this.top;\n\t\t\tthis.top = this.back;\n\t\t\tthis.back = this.bottom;\n\t\t\tthis.bottom = this.front;\n\t\t\tthis.front = temp;\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tpublic int getTop() {\n\t\treturn this.top;\n\t}\n}", "language": "Java", "metadata": {"date": 1503677385, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02383.html", "problem_id": "p02383", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02383/input.txt", "sample_output_relpath": "derived/input_output/data/p02383/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02383/Java/s340363385.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s340363385", "user_id": "u746972160"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n \tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String[] line = br.readLine().split(\" \");\n\n int[] data = new int[line.length];\n for (int i = 0; i < data.length; i++) {\n \tdata[i] = Integer.parseInt(line[i]);\n\t\t}\n\n Dice dice = new Dice(data);\n\n char[] moveData = br.readLine().toCharArray();\n for (int i = 0; i < moveData.length; i++) {\n \tdice.move(moveData[i]);\n }\n\n System.out.println(dice.getTop());\n }\n}\n\nclass Dice {\n\tprivate int top;\n\tprivate int bottom;\n\tprivate int left;\n\tprivate int right;\n\tprivate int front;\n\tprivate int back;\n\n\n\tDice(int[] data) {\n\t\tthis.top = data[1 - 1];\n\t\tthis.bottom = data[6 - 1];\n\t\tthis.left = data[4 - 1];\n\t\tthis.right = data[3 - 1];\n\t\tthis.front = data[2 - 1];\n\t\tthis.back = data[5 - 1];\n\t}\n\n\tpublic void move(char m) {\n\t\tint temp = -1;\n\t\tswitch (m) {\n\t\tcase 'N':\n\t\t\ttemp = this.top;\n\t\t\tthis.top = this.front;\n\t\t\tthis.front = this.bottom;\n\t\t\tthis.bottom = this.back;\n\t\t\tthis.back = temp;\n\n\t\t\tbreak;\n\n\t\tcase 'E':\n\t\t\ttemp = this.top;\n\t\t\tthis.top = this.left;\n\t\t\tthis.left = this.bottom;\n\t\t\tthis.bottom = this.right;\n\t\t\tthis.right = temp;\n\n\t\t\tbreak;\n\n\t\tcase 'W':\n\t\t\ttemp = this.top;\n\t\t\tthis.top = this.right;\n\t\t\tthis.right = this.bottom;\n\t\t\tthis.bottom = this.left;\n\t\t\tthis.left = temp;\n\n\t\t\tbreak;\n\n\t\tcase 'S':\n\t\t\ttemp = this.top;\n\t\t\tthis.top = this.back;\n\t\t\tthis.back = this.bottom;\n\t\t\tthis.bottom = this.front;\n\t\t\tthis.front = temp;\n\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tpublic int getTop() {\n\t\treturn this.top;\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDice I\n\nWrite a program to simulate rolling a dice, which can be constructed by the following net.\n\nAs shown in the figures, each face is identified by a different label from 1 to 6.\n\nWrite a program which reads integers assigned to each face identified by the label and a sequence of commands to roll the dice, and prints the integer on the top face. At the initial state, the dice is located as shown in the above figures.\n\nInput\n\nIn the first line, six integers assigned to faces are given in ascending order of their corresponding labels.\n\nIn the second line, a string which represents a sequence of commands, is given. The command is one of 'E', 'N', 'S' and 'W' representing four directions shown in the above figures.\n\nOutput\n\nPrint the integer which appears on the top face after the simulation.\n\nConstraints\n\n$0 \\leq $ the integer assigned to a face $ \\leq 100$\n\n$0 \\leq $ the length of the command $\\leq 100$\n\nSample Input 1\n\n1 2 4 8 16 32\nSE\n\nSample Output 1\n\n8\n\nYou are given a dice where 1, 2, 4, 8, 16 are 32 are assigned to a face labeled by 1, 2, ..., 6 respectively. After you roll the dice to the direction S and then to the direction E, you can see 8 on the top face.\n\nSample Input 2\n\n1 2 4 8 16 32\nEESWN\n\nSample Output 2\n\n32", "sample_input": "1 2 4 8 16 32\nSE\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02383", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDice I\n\nWrite a program to simulate rolling a dice, which can be constructed by the following net.\n\nAs shown in the figures, each face is identified by a different label from 1 to 6.\n\nWrite a program which reads integers assigned to each face identified by the label and a sequence of commands to roll the dice, and prints the integer on the top face. At the initial state, the dice is located as shown in the above figures.\n\nInput\n\nIn the first line, six integers assigned to faces are given in ascending order of their corresponding labels.\n\nIn the second line, a string which represents a sequence of commands, is given. The command is one of 'E', 'N', 'S' and 'W' representing four directions shown in the above figures.\n\nOutput\n\nPrint the integer which appears on the top face after the simulation.\n\nConstraints\n\n$0 \\leq $ the integer assigned to a face $ \\leq 100$\n\n$0 \\leq $ the length of the command $\\leq 100$\n\nSample Input 1\n\n1 2 4 8 16 32\nSE\n\nSample Output 1\n\n8\n\nYou are given a dice where 1, 2, 4, 8, 16 are 32 are assigned to a face labeled by 1, 2, ..., 6 respectively. After you roll the dice to the direction S and then to the direction E, you can see 8 on the top face.\n\nSample Input 2\n\n1 2 4 8 16 32\nEESWN\n\nSample Output 2\n\n32", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1719, "cpu_time_ms": 30, "memory_kb": 24360}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s204016690", "group_id": "codeNet:p02384", "input_text": "import java.util.Random;\nimport java.util.Scanner;\n\npublic class Main \n{\t\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner scanner = new Scanner(System.in);\n\n\t\tint[] n = new int[6];\n\t\tfor(int i=0; i<6; i++)\n\t\t{\n\t\t\tn[i] = scanner.nextInt();\n\t\t}\n\t\t\n\t\tint q = scanner.nextInt();\n\t\t\n\t\tfor(int i=0; i list = new ArrayList();\n\t\tint[] d = new int[6];\n\t\tfor(int i = 0; i < 6; i++){\n\t\t\td[i] = scan.nextInt();\n\t\t}\n\t\tDice dice = new Dice(d);\n\t\tint q = scan.nextInt();\n\t\tfor(int i = 0; i < q; i++){\n\t\t\tint n = scan.nextInt();\n\t\t\tint m = scan.nextInt();\n\t\t\tdice.setTop(n);\n\t\t\tdice.setSouth(m);\n\t\t\tlist.add(dice.show(Dice.EAST));\n\t\t}\n\n\t\tfor(int n : list){\n\t\t\tSystem.out.println(n);\n\t\t}\n\t}\n}\n\nclass Dice{\n\tint[] d_ = new int[6];\n\tpublic static final int\n\t\tTOP = 0, SOUTH = 1, EAST = 2,\n\t\tWEST = 3, NORTH = 4, BOTTOM = 5;\n\n\tpublic Dice(int[] d){\n\t\tfor(int i = 0; i < 6; i++){\n\t\t\td_[i] = d[i];\n\t\t}\n\t}\n\n\tpublic void setTop(int num){\n\t\tif(num == d_[EAST]){\n\t\t\tthis.rollWest();\n\t\t} else if(num == d_[WEST]){\n\t\t\tthis.rollEast();\n\t\t} else if(num == d_[SOUTH]){\n\t\t\tthis.rollNorth();\n\t\t} else if(num == d_[NORTH]){\n\t\t\tthis.rollSouth();\n\t\t} else if(num == d_[BOTTOM]){\n\t\t\tthis.rollEast();\n\t\t\tthis.rollEast();\n\t\t}\n\t}\n\n\tpublic void setSouth(int num){\n\t\tif(num == d_[EAST]){\n\t\t\tthis.rollRight();\n\t\t\tthis.rollRight();\n\t\t\tthis.rollRight();\n\t\t} else if(num == d_[WEST]){\n\t\t\tthis.rollRight();\n\t\t} else if(num == d_[NORTH]){\n\t\t\tthis.rollRight();\n\t\t\tthis.rollRight();\n\t\t}\n\t}\n\n\tpublic int show(int side){\n\t\treturn d_[side];\n\t}\n\n\tpublic void rollEast(){\n\t\tint work = d_[TOP];\n\t\td_[TOP] = d_[WEST];\n\t\td_[WEST] = d_[BOTTOM];\n\t\td_[BOTTOM] = d_[EAST];\n\t\td_[EAST] = work;\n\t}\n\n\tpublic void rollWest(){\n\t\tint work = d_[TOP];\n\t\td_[TOP] = d_[EAST];\n\t\td_[EAST] = d_[BOTTOM];\n\t\td_[BOTTOM] = d_[WEST];\n\t\td_[WEST] = work;\n\t}\n\n\tpublic void rollSouth(){\n\t\tint work = d_[TOP];\n\t\td_[TOP] = d_[NORTH];\n\t\td_[NORTH] = d_[BOTTOM];\n\t\td_[BOTTOM] = d_[SOUTH];\n\t\td_[SOUTH] = work;\n\t}\n\n\tpublic void rollNorth(){\n\t\tint work = d_[TOP];\n\t\td_[TOP] = d_[SOUTH];\n\t\td_[SOUTH] = d_[BOTTOM];\n\t\td_[BOTTOM] = d_[NORTH];\n\t\td_[NORTH] = work;\n\t}\n\n\tpublic void rollRight(){\n\t\tint work = d_[SOUTH];\n\t\td_[SOUTH] = d_[WEST];\n\t\td_[WEST] = d_[NORTH];\n\t\td_[NORTH] = d_[EAST];\n\t\td_[EAST] = work;\n\t}\n}", "language": "Java", "metadata": {"date": 1479964739, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02384.html", "problem_id": "p02384", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02384/input.txt", "sample_output_relpath": "derived/input_output/data/p02384/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02384/Java/s619878048.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s619878048", "user_id": "u910402677"}, "prompt_components": {"gold_output": "3\n5\n6\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n\n\tprivate static final Scanner scan = new Scanner(System.in);\n\n\tpublic static void main(String[] args){\n\t\tList list = new ArrayList();\n\t\tint[] d = new int[6];\n\t\tfor(int i = 0; i < 6; i++){\n\t\t\td[i] = scan.nextInt();\n\t\t}\n\t\tDice dice = new Dice(d);\n\t\tint q = scan.nextInt();\n\t\tfor(int i = 0; i < q; i++){\n\t\t\tint n = scan.nextInt();\n\t\t\tint m = scan.nextInt();\n\t\t\tdice.setTop(n);\n\t\t\tdice.setSouth(m);\n\t\t\tlist.add(dice.show(Dice.EAST));\n\t\t}\n\n\t\tfor(int n : list){\n\t\t\tSystem.out.println(n);\n\t\t}\n\t}\n}\n\nclass Dice{\n\tint[] d_ = new int[6];\n\tpublic static final int\n\t\tTOP = 0, SOUTH = 1, EAST = 2,\n\t\tWEST = 3, NORTH = 4, BOTTOM = 5;\n\n\tpublic Dice(int[] d){\n\t\tfor(int i = 0; i < 6; i++){\n\t\t\td_[i] = d[i];\n\t\t}\n\t}\n\n\tpublic void setTop(int num){\n\t\tif(num == d_[EAST]){\n\t\t\tthis.rollWest();\n\t\t} else if(num == d_[WEST]){\n\t\t\tthis.rollEast();\n\t\t} else if(num == d_[SOUTH]){\n\t\t\tthis.rollNorth();\n\t\t} else if(num == d_[NORTH]){\n\t\t\tthis.rollSouth();\n\t\t} else if(num == d_[BOTTOM]){\n\t\t\tthis.rollEast();\n\t\t\tthis.rollEast();\n\t\t}\n\t}\n\n\tpublic void setSouth(int num){\n\t\tif(num == d_[EAST]){\n\t\t\tthis.rollRight();\n\t\t\tthis.rollRight();\n\t\t\tthis.rollRight();\n\t\t} else if(num == d_[WEST]){\n\t\t\tthis.rollRight();\n\t\t} else if(num == d_[NORTH]){\n\t\t\tthis.rollRight();\n\t\t\tthis.rollRight();\n\t\t}\n\t}\n\n\tpublic int show(int side){\n\t\treturn d_[side];\n\t}\n\n\tpublic void rollEast(){\n\t\tint work = d_[TOP];\n\t\td_[TOP] = d_[WEST];\n\t\td_[WEST] = d_[BOTTOM];\n\t\td_[BOTTOM] = d_[EAST];\n\t\td_[EAST] = work;\n\t}\n\n\tpublic void rollWest(){\n\t\tint work = d_[TOP];\n\t\td_[TOP] = d_[EAST];\n\t\td_[EAST] = d_[BOTTOM];\n\t\td_[BOTTOM] = d_[WEST];\n\t\td_[WEST] = work;\n\t}\n\n\tpublic void rollSouth(){\n\t\tint work = d_[TOP];\n\t\td_[TOP] = d_[NORTH];\n\t\td_[NORTH] = d_[BOTTOM];\n\t\td_[BOTTOM] = d_[SOUTH];\n\t\td_[SOUTH] = work;\n\t}\n\n\tpublic void rollNorth(){\n\t\tint work = d_[TOP];\n\t\td_[TOP] = d_[SOUTH];\n\t\td_[SOUTH] = d_[BOTTOM];\n\t\td_[BOTTOM] = d_[NORTH];\n\t\td_[NORTH] = work;\n\t}\n\n\tpublic void rollRight(){\n\t\tint work = d_[SOUTH];\n\t\td_[SOUTH] = d_[WEST];\n\t\td_[WEST] = d_[NORTH];\n\t\td_[NORTH] = d_[EAST];\n\t\td_[EAST] = work;\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDice II\n\nConstruct a dice from a given sequence of integers in the same way as Dice I.\n\nYou are given integers on the top face and the front face after the dice was rolled in the same way as Dice I. Write a program to print an integer on the right side face.\n\nInput\n\nIn the first line, six integers assigned to faces are given in ascending order of their corresponding labels.\nIn the second line, the number of questions $q$ is given.\n\nIn the following $q$ lines, $q$ questions are given. Each question consists of two integers on the top face and the front face respectively.\n\nOutput\n\nFor each question, print the integer on the right side face.\n\nConstraints\n\n$0 \\leq $ the integer assigned to a face $ \\leq 100$\n\nThe integers are all different\n\n$1 \\leq q \\leq 24$\n\nSample Input\n\n1 2 3 4 5 6\n3\n6 5\n1 3\n3 2\n\nSample Output\n\n3\n5\n6", "sample_input": "1 2 3 4 5 6\n3\n6 5\n1 3\n3 2\n"}, "reference_outputs": ["3\n5\n6\n"], "source_document_id": "p02384", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDice II\n\nConstruct a dice from a given sequence of integers in the same way as Dice I.\n\nYou are given integers on the top face and the front face after the dice was rolled in the same way as Dice I. Write a program to print an integer on the right side face.\n\nInput\n\nIn the first line, six integers assigned to faces are given in ascending order of their corresponding labels.\nIn the second line, the number of questions $q$ is given.\n\nIn the following $q$ lines, $q$ questions are given. Each question consists of two integers on the top face and the front face respectively.\n\nOutput\n\nFor each question, print the integer on the right side face.\n\nConstraints\n\n$0 \\leq $ the integer assigned to a face $ \\leq 100$\n\nThe integers are all different\n\n$1 \\leq q \\leq 24$\n\nSample Input\n\n1 2 3 4 5 6\n3\n6 5\n1 3\n3 2\n\nSample Output\n\n3\n5\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2089, "cpu_time_ms": 50, "memory_kb": 26008}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s721700463", "group_id": "codeNet:p02384", "input_text": "\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tDice d = new Dice();\n\t\tfor(int i = 0; i < 6; i++) {\n\t\t\td.side[i] = sc.nextInt();\n\t\t}\n\t\tint q = sc.nextInt();\n\t\tfor(int i = 0; i < q; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tint b = sc.nextInt();\n\t\t\td.getRightSide(a, b);\n\t\t}\n\t\t\n\t\tsc.close();\n\t}\n}\n\nclass Dice {\n\tint[] side = new int[6];\n\n\tpublic void getUpperSide() {\n\t\tSystem.out.println(this.side[0]);\n\t}\n\tpublic void getRightSide(int a, int b) {\n\t\tint[][] mtx = {{0, 3, 5, 2, 4, 0}, {4, 0, 1, 6, 0, 3}, \n{2, 6, 0, 0, 1, 5}, {5, 1, 0, 0, 6, 2}, {3, 0, 6, 1, 0, 4}, {0, 4, 2, 5, 3, 2, 0}};\n\t\tint aI = -1;\n\t\tint bI = -1;\n\t\tfor(int i = 0; i < 6; i++) {\n\t\t\tif(a==this.side[i]) {\n\t\t\t\taI = i;\n\t\t\t}\n\t\t\tif(b==this.side[i]) {\n\t\t\t\tbI = i;\n\t\t\t}\n\t\t\tif(aI>=0&&bI>=0) break;\n\t\t}\n\t\tSystem.out.println(this.side[mtx[aI][bI] - 1]);\n\t}\n\n\tpublic void rollE() {\n\t\tint w = this.side[5];\n\t\tthis.side[5] = this.side[2];\n\t\tthis.side[2] = this.side[0];\n\t\tthis.side[0] = this.side[3];\n\t\tthis.side[3] = w;\n\t}\n\tpublic void rollW() {\n\t\tint w = this.side[5];\n\t\tthis.side[5] = this.side[3];\n\t\tthis.side[3] = this.side[0];\n\t\tthis.side[0] = this.side[2];\n\t\tthis.side[2] = w;\n\t}\n\tpublic void rollN() {\n\t\tint w = this.side[5];\n\t\tthis.side[5] = this.side[4];\n\t\tthis.side[4] = this.side[0];\n\t\tthis.side[0] = this.side[1];\n\t\tthis.side[1] = w;\n\t}\n\tpublic void rollS() {\n\t\tint w = this.side[5];\n\t\tthis.side[5] = this.side[1];\n\t\tthis.side[1] = this.side[0];\n\t\tthis.side[0] = this.side[4];\n\t\tthis.side[4] = w;\n\t}\n}\n", "language": "Java", "metadata": {"date": 1589412537, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02384.html", "problem_id": "p02384", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02384/input.txt", "sample_output_relpath": "derived/input_output/data/p02384/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02384/Java/s721700463.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s721700463", "user_id": "u163615641"}, "prompt_components": {"gold_output": "3\n5\n6\n", "input_to_evaluate": "\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tDice d = new Dice();\n\t\tfor(int i = 0; i < 6; i++) {\n\t\t\td.side[i] = sc.nextInt();\n\t\t}\n\t\tint q = sc.nextInt();\n\t\tfor(int i = 0; i < q; i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tint b = sc.nextInt();\n\t\t\td.getRightSide(a, b);\n\t\t}\n\t\t\n\t\tsc.close();\n\t}\n}\n\nclass Dice {\n\tint[] side = new int[6];\n\n\tpublic void getUpperSide() {\n\t\tSystem.out.println(this.side[0]);\n\t}\n\tpublic void getRightSide(int a, int b) {\n\t\tint[][] mtx = {{0, 3, 5, 2, 4, 0}, {4, 0, 1, 6, 0, 3}, \n{2, 6, 0, 0, 1, 5}, {5, 1, 0, 0, 6, 2}, {3, 0, 6, 1, 0, 4}, {0, 4, 2, 5, 3, 2, 0}};\n\t\tint aI = -1;\n\t\tint bI = -1;\n\t\tfor(int i = 0; i < 6; i++) {\n\t\t\tif(a==this.side[i]) {\n\t\t\t\taI = i;\n\t\t\t}\n\t\t\tif(b==this.side[i]) {\n\t\t\t\tbI = i;\n\t\t\t}\n\t\t\tif(aI>=0&&bI>=0) break;\n\t\t}\n\t\tSystem.out.println(this.side[mtx[aI][bI] - 1]);\n\t}\n\n\tpublic void rollE() {\n\t\tint w = this.side[5];\n\t\tthis.side[5] = this.side[2];\n\t\tthis.side[2] = this.side[0];\n\t\tthis.side[0] = this.side[3];\n\t\tthis.side[3] = w;\n\t}\n\tpublic void rollW() {\n\t\tint w = this.side[5];\n\t\tthis.side[5] = this.side[3];\n\t\tthis.side[3] = this.side[0];\n\t\tthis.side[0] = this.side[2];\n\t\tthis.side[2] = w;\n\t}\n\tpublic void rollN() {\n\t\tint w = this.side[5];\n\t\tthis.side[5] = this.side[4];\n\t\tthis.side[4] = this.side[0];\n\t\tthis.side[0] = this.side[1];\n\t\tthis.side[1] = w;\n\t}\n\tpublic void rollS() {\n\t\tint w = this.side[5];\n\t\tthis.side[5] = this.side[1];\n\t\tthis.side[1] = this.side[0];\n\t\tthis.side[0] = this.side[4];\n\t\tthis.side[4] = w;\n\t}\n}\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDice II\n\nConstruct a dice from a given sequence of integers in the same way as Dice I.\n\nYou are given integers on the top face and the front face after the dice was rolled in the same way as Dice I. Write a program to print an integer on the right side face.\n\nInput\n\nIn the first line, six integers assigned to faces are given in ascending order of their corresponding labels.\nIn the second line, the number of questions $q$ is given.\n\nIn the following $q$ lines, $q$ questions are given. Each question consists of two integers on the top face and the front face respectively.\n\nOutput\n\nFor each question, print the integer on the right side face.\n\nConstraints\n\n$0 \\leq $ the integer assigned to a face $ \\leq 100$\n\nThe integers are all different\n\n$1 \\leq q \\leq 24$\n\nSample Input\n\n1 2 3 4 5 6\n3\n6 5\n1 3\n3 2\n\nSample Output\n\n3\n5\n6", "sample_input": "1 2 3 4 5 6\n3\n6 5\n1 3\n3 2\n"}, "reference_outputs": ["3\n5\n6\n"], "source_document_id": "p02384", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDice II\n\nConstruct a dice from a given sequence of integers in the same way as Dice I.\n\nYou are given integers on the top face and the front face after the dice was rolled in the same way as Dice I. Write a program to print an integer on the right side face.\n\nInput\n\nIn the first line, six integers assigned to faces are given in ascending order of their corresponding labels.\nIn the second line, the number of questions $q$ is given.\n\nIn the following $q$ lines, $q$ questions are given. Each question consists of two integers on the top face and the front face respectively.\n\nOutput\n\nFor each question, print the integer on the right side face.\n\nConstraints\n\n$0 \\leq $ the integer assigned to a face $ \\leq 100$\n\nThe integers are all different\n\n$1 \\leq q \\leq 24$\n\nSample Input\n\n1 2 3 4 5 6\n3\n6 5\n1 3\n3 2\n\nSample Output\n\n3\n5\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1553, "cpu_time_ms": 80, "memory_kb": 26184}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s279712626", "group_id": "codeNet:p02385", "input_text": "// ???????????? ??¢\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO ?????????????????????????????????????????????\n\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\t// ???????????????2?????????\n\t\tDise3 dise = new Dise3();\n\t\t// ?????¢?????°??????????????????\n\t\tfor(int i = 0; i < 6; i++) {\n\t\t\tdise._values[i] = scan.nextInt();\n\t\t}\n\t\tDise3 dise2 = new Dise3();\n\t\t// ?????¢?????°??????????????????\n\t\tfor(int i = 0; i < 6; i++) {\n\t\t\tdise2._values[i] = scan.nextInt();\n\t\t}\n\t\t\n\t\t// ??????????????????????????????????´????????????°\n\t\tboolean result = false;\n\t\t\n\t\t// ?¢????\n\t\tfor(int i2 = 0; i2 <= 6; i2++) {\n\t\t\t// ?????¢????¢????\n\t\t\tif (dise._values[Dise3.ValueType.Front.getId()] == dise2._values[Dise3.ValueType.Front.getId()]) {\n\t\t\t\t// ?????¢????¢????\n\t\t\t\tresult = topVarueCheck(dise, dise2, result);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tdise2.MoveSouth();\n\t\t\t}\n\t\t\tif (result == true) break;\n\t\t\t// 4?????????????????±??¨?????????????????????????????¢????????????\n\t\t\tif (i2 == 3) {\n\t\t\t\tdise2.MoveEast();\n\t\t\t\tdise2.MoveSouth();\n\t\t\t}\n\t\t}\n\t\tif (result == true) System.out.println(\"Yes\");\n\t\telse System.out.println(\"No\");\n\t}\n\n\tprivate static boolean topVarueCheck(Dise3 dise, Dise3 dise2, boolean result) {\n\t\t// ?????¢????????£????????????????????¢??????????????§??±?????????\n\t\tfor(int i3 = 0; i3 < 4; i3++) {\n\t\t\tif (dise._values[Dise3.ValueType.Top.getId()] == dise2._values[Dise3.ValueType.Top.getId()]) {\n\t\t\t\t// ????????¢????????£????????????\n\t\t\t\tif ( (dise._values[Dise3.ValueType.Right.getId()] == dise2._values[Dise3.ValueType.Right.getId()]) &&\n\t\t\t\t\t (dise._values[Dise3.ValueType.Left.getId()] == dise2._values[Dise3.ValueType.Left.getId()]) &&\n\t\t\t\t\t (dise._values[Dise3.ValueType.Back.getId()] == dise2._values[Dise3.ValueType.Back.getId()]) &&\n\t\t\t\t\t (dise._values[Dise3.ValueType.Bottom.getId()] == dise2._values[Dise3.ValueType.Bottom.getId()]) ) {\n\t\t\t\t\tresult = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t// 6??¢????????´????????????????????°???????????????\n\t\t\t}\n\t\t\telse dise2.MoveEast();\n\t\t}\n\t\treturn result;\n\t}\n}\n\n// ??????????????????\nclass Dise3 {\n\n\tpublic int _values[] = new int[6];\n\t\n\tpublic void Dice(int values[]) {\n \tfor (int i = 0; i < values.length; i++)\n \tthis._values[i] = values[i];\n\t}\n \n public enum ValueType {\n Top(0),\n Front(1),\n Right(2),\n Left(3),\n Back(4),\n Bottom(5);\n private final int id;\n private ValueType (final int id) {\n this.id = id;\n }\n public int getId() {\n return id;\n }\n }\n \n public void MoveWest()\n {\n int tmp = this._values[ValueType.Top.getId()];\n this._values[ValueType.Top.getId()] = this._values[ValueType.Right.getId()];\n this._values[ValueType.Right.getId()] = this._values[ValueType.Bottom.getId()];\n this._values[ValueType.Bottom.getId()] = this._values[ValueType.Left.getId()];\n this._values[ValueType.Left.getId()] = tmp;\n }\n public void MoveEast()\n {\n int tmp = this._values[ValueType.Top.getId()];\n this._values[ValueType.Top.getId()] = this._values[ValueType.Left.getId()];\n this._values[ValueType.Left.getId()] = this._values[ValueType.Bottom.getId()];\n this._values[ValueType.Bottom.getId()] = this._values[ValueType.Right.getId()];\n this._values[ValueType.Right.getId()] = tmp;\n }\n public void MoveNorth()\n {\n int tmp = this._values[ValueType.Top.getId()];\n this._values[ValueType.Top.getId()] = this._values[ValueType.Front.getId()];\n this._values[ValueType.Front.getId()] = this._values[ValueType.Bottom.getId()];\n this._values[ValueType.Bottom.getId()] = this._values[ValueType.Back.getId()];\n this._values[ValueType.Back.getId()] = tmp;\n }\n public void MoveSouth()\n {\n int tmp = this._values[ValueType.Top.getId()];\n this._values[ValueType.Top.getId()] = this._values[ValueType.Back.getId()];\n this._values[ValueType.Back.getId()] = this._values[ValueType.Bottom.getId()];\n this._values[ValueType.Bottom.getId()] = this._values[ValueType.Front.getId()];\n this._values[ValueType.Front.getId()] = tmp;\n }\n\n\n}", "language": "Java", "metadata": {"date": 1453352443, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02385.html", "problem_id": "p02385", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02385/input.txt", "sample_output_relpath": "derived/input_output/data/p02385/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02385/Java/s279712626.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s279712626", "user_id": "u787849418"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "// ???????????? ??¢\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO ?????????????????????????????????????????????\n\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\t// ???????????????2?????????\n\t\tDise3 dise = new Dise3();\n\t\t// ?????¢?????°??????????????????\n\t\tfor(int i = 0; i < 6; i++) {\n\t\t\tdise._values[i] = scan.nextInt();\n\t\t}\n\t\tDise3 dise2 = new Dise3();\n\t\t// ?????¢?????°??????????????????\n\t\tfor(int i = 0; i < 6; i++) {\n\t\t\tdise2._values[i] = scan.nextInt();\n\t\t}\n\t\t\n\t\t// ??????????????????????????????????´????????????°\n\t\tboolean result = false;\n\t\t\n\t\t// ?¢????\n\t\tfor(int i2 = 0; i2 <= 6; i2++) {\n\t\t\t// ?????¢????¢????\n\t\t\tif (dise._values[Dise3.ValueType.Front.getId()] == dise2._values[Dise3.ValueType.Front.getId()]) {\n\t\t\t\t// ?????¢????¢????\n\t\t\t\tresult = topVarueCheck(dise, dise2, result);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tdise2.MoveSouth();\n\t\t\t}\n\t\t\tif (result == true) break;\n\t\t\t// 4?????????????????±??¨?????????????????????????????¢????????????\n\t\t\tif (i2 == 3) {\n\t\t\t\tdise2.MoveEast();\n\t\t\t\tdise2.MoveSouth();\n\t\t\t}\n\t\t}\n\t\tif (result == true) System.out.println(\"Yes\");\n\t\telse System.out.println(\"No\");\n\t}\n\n\tprivate static boolean topVarueCheck(Dise3 dise, Dise3 dise2, boolean result) {\n\t\t// ?????¢????????£????????????????????¢??????????????§??±?????????\n\t\tfor(int i3 = 0; i3 < 4; i3++) {\n\t\t\tif (dise._values[Dise3.ValueType.Top.getId()] == dise2._values[Dise3.ValueType.Top.getId()]) {\n\t\t\t\t// ????????¢????????£????????????\n\t\t\t\tif ( (dise._values[Dise3.ValueType.Right.getId()] == dise2._values[Dise3.ValueType.Right.getId()]) &&\n\t\t\t\t\t (dise._values[Dise3.ValueType.Left.getId()] == dise2._values[Dise3.ValueType.Left.getId()]) &&\n\t\t\t\t\t (dise._values[Dise3.ValueType.Back.getId()] == dise2._values[Dise3.ValueType.Back.getId()]) &&\n\t\t\t\t\t (dise._values[Dise3.ValueType.Bottom.getId()] == dise2._values[Dise3.ValueType.Bottom.getId()]) ) {\n\t\t\t\t\tresult = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t// 6??¢????????´????????????????????°???????????????\n\t\t\t}\n\t\t\telse dise2.MoveEast();\n\t\t}\n\t\treturn result;\n\t}\n}\n\n// ??????????????????\nclass Dise3 {\n\n\tpublic int _values[] = new int[6];\n\t\n\tpublic void Dice(int values[]) {\n \tfor (int i = 0; i < values.length; i++)\n \tthis._values[i] = values[i];\n\t}\n \n public enum ValueType {\n Top(0),\n Front(1),\n Right(2),\n Left(3),\n Back(4),\n Bottom(5);\n private final int id;\n private ValueType (final int id) {\n this.id = id;\n }\n public int getId() {\n return id;\n }\n }\n \n public void MoveWest()\n {\n int tmp = this._values[ValueType.Top.getId()];\n this._values[ValueType.Top.getId()] = this._values[ValueType.Right.getId()];\n this._values[ValueType.Right.getId()] = this._values[ValueType.Bottom.getId()];\n this._values[ValueType.Bottom.getId()] = this._values[ValueType.Left.getId()];\n this._values[ValueType.Left.getId()] = tmp;\n }\n public void MoveEast()\n {\n int tmp = this._values[ValueType.Top.getId()];\n this._values[ValueType.Top.getId()] = this._values[ValueType.Left.getId()];\n this._values[ValueType.Left.getId()] = this._values[ValueType.Bottom.getId()];\n this._values[ValueType.Bottom.getId()] = this._values[ValueType.Right.getId()];\n this._values[ValueType.Right.getId()] = tmp;\n }\n public void MoveNorth()\n {\n int tmp = this._values[ValueType.Top.getId()];\n this._values[ValueType.Top.getId()] = this._values[ValueType.Front.getId()];\n this._values[ValueType.Front.getId()] = this._values[ValueType.Bottom.getId()];\n this._values[ValueType.Bottom.getId()] = this._values[ValueType.Back.getId()];\n this._values[ValueType.Back.getId()] = tmp;\n }\n public void MoveSouth()\n {\n int tmp = this._values[ValueType.Top.getId()];\n this._values[ValueType.Top.getId()] = this._values[ValueType.Back.getId()];\n this._values[ValueType.Back.getId()] = this._values[ValueType.Bottom.getId()];\n this._values[ValueType.Bottom.getId()] = this._values[ValueType.Front.getId()];\n this._values[ValueType.Front.getId()] = tmp;\n }\n\n\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDice III\n\nWrite a program which reads the two dices constructed in the same way as Dice I, and determines whether these two dices are identical. You can roll a dice in the same way as Dice I, and if all integers observed from the six directions are the same as that of another dice, these dices can be considered as identical.\n\nInput\n\nIn the first line, six integers assigned to faces of a dice are given in ascending order of their corresponding labels.\n\nIn the second line, six integers assigned to faces of another dice are given in ascending order of their corresponding labels.\n\nOutput\n\nPrint \"Yes\" if two dices are identical, otherwise \"No\" in a line.\n\nConstraints\n\n$0 \\leq $ the integer assigned to a face $ \\leq 100$\n\nSample Input 1\n\n1 2 3 4 5 6\n6 2 4 3 5 1\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n1 2 3 4 5 6\n6 5 4 3 2 1\n\nSample Output 2\n\nNo", "sample_input": "1 2 3 4 5 6\n6 2 4 3 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02385", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nDice III\n\nWrite a program which reads the two dices constructed in the same way as Dice I, and determines whether these two dices are identical. You can roll a dice in the same way as Dice I, and if all integers observed from the six directions are the same as that of another dice, these dices can be considered as identical.\n\nInput\n\nIn the first line, six integers assigned to faces of a dice are given in ascending order of their corresponding labels.\n\nIn the second line, six integers assigned to faces of another dice are given in ascending order of their corresponding labels.\n\nOutput\n\nPrint \"Yes\" if two dices are identical, otherwise \"No\" in a line.\n\nConstraints\n\n$0 \\leq $ the integer assigned to a face $ \\leq 100$\n\nSample Input 1\n\n1 2 3 4 5 6\n6 2 4 3 5 1\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n1 2 3 4 5 6\n6 5 4 3 2 1\n\nSample Output 2\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4199, "cpu_time_ms": 100, "memory_kb": 26424}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s856142872", "group_id": "codeNet:p02386", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\n\npublic class Main {\n\n public static void main(String[] args) throws IOException {\n \n try(BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {\n\n int n = Integer.parseInt(br.readLine());\n Dice[] aDices = new Dice[n];\n\n for ( int i=0; i= 1 && b <= 100) {\n int lapLength = a * 2 + b * 2;\n int squareMeasure = a*b;\n \n System.out.println(squareMeasure + \" \" + lapLength);\n }\n } \n}\n", "language": "Java", "metadata": {"date": 1594966472, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02389.html", "problem_id": "p02389", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02389/input.txt", "sample_output_relpath": "derived/input_output/data/p02389/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02389/Java/s065477018.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s065477018", "user_id": "u202607760"}, "prompt_components": {"gold_output": "15 16\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n \n Scanner scan = new Scanner(System.in);\n int a = scan.nextInt();\n int b = scan.nextInt();\n \n if (a >= 1 && b <= 100) {\n int lapLength = a * 2 + b * 2;\n int squareMeasure = a*b;\n \n System.out.println(squareMeasure + \" \" + lapLength);\n }\n } \n}\n", "problem_context": "Rectangle\n\nWrite a program which calculates the area and perimeter of a given rectangle.\n\nInput\n\nThe length a and breadth b of the rectangle are given in a line separated by a single space.\n\nOutput\n\nPrint the area and perimeter of the rectangle in a line. The two integers should be separated by a single space.\n\nConstraints\n\n1 ≤ a, b ≤ 100\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n15 16", "sample_input": "3 5\n"}, "reference_outputs": ["15 16\n"], "source_document_id": "p02389", "source_text": "Rectangle\n\nWrite a program which calculates the area and perimeter of a given rectangle.\n\nInput\n\nThe length a and breadth b of the rectangle are given in a line separated by a single space.\n\nOutput\n\nPrint the area and perimeter of the rectangle in a line. The two integers should be separated by a single space.\n\nConstraints\n\n1 ≤ a, b ≤ 100\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n15 16", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 428, "cpu_time_ms": 70, "memory_kb": 26276}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s112689739", "group_id": "codeNet:p02389", "input_text": "import java.util.Scanner;\n\nclass Main {\n static public void main(String[] av) {\n\tScanner sc = new Scanner(System.in);\n\tint a = sc.nextInt();\n\tint b = sc.nextInt();\n\tint s = a*b;\n\tint l = a*2+b*2;\n\n\tSystem.out.println(s+\" \"+l);\n }\n}\n\n", "language": "Java", "metadata": {"date": 1569467181, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02389.html", "problem_id": "p02389", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02389/input.txt", "sample_output_relpath": "derived/input_output/data/p02389/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02389/Java/s112689739.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s112689739", "user_id": "u143213093"}, "prompt_components": {"gold_output": "15 16\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main {\n static public void main(String[] av) {\n\tScanner sc = new Scanner(System.in);\n\tint a = sc.nextInt();\n\tint b = sc.nextInt();\n\tint s = a*b;\n\tint l = a*2+b*2;\n\n\tSystem.out.println(s+\" \"+l);\n }\n}\n\n", "problem_context": "Rectangle\n\nWrite a program which calculates the area and perimeter of a given rectangle.\n\nInput\n\nThe length a and breadth b of the rectangle are given in a line separated by a single space.\n\nOutput\n\nPrint the area and perimeter of the rectangle in a line. The two integers should be separated by a single space.\n\nConstraints\n\n1 ≤ a, b ≤ 100\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n15 16", "sample_input": "3 5\n"}, "reference_outputs": ["15 16\n"], "source_document_id": "p02389", "source_text": "Rectangle\n\nWrite a program which calculates the area and perimeter of a given rectangle.\n\nInput\n\nThe length a and breadth b of the rectangle are given in a line separated by a single space.\n\nOutput\n\nPrint the area and perimeter of the rectangle in a line. The two integers should be separated by a single space.\n\nConstraints\n\n1 ≤ a, b ≤ 100\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n15 16", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 239, "cpu_time_ms": 80, "memory_kb": 26144}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s459952549", "group_id": "codeNet:p02390", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n int sec=Integer.parseInt(reader.readLine());\n int h=sec/3600;\n int m=(sec%3600)/60;\n int s=(sec%60);\n System.out.println(Integer.toString(h) + \":\" + Integer.toString(m) +\":\" +Integer.toString(s));\n\t}\n}", "language": "Java", "metadata": {"date": 1506312446, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02390.html", "problem_id": "p02390", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02390/input.txt", "sample_output_relpath": "derived/input_output/data/p02390/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02390/Java/s459952549.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s459952549", "user_id": "u339341496"}, "prompt_components": {"gold_output": "13:2:59\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n int sec=Integer.parseInt(reader.readLine());\n int h=sec/3600;\n int m=(sec%3600)/60;\n int s=(sec%60);\n System.out.println(Integer.toString(h) + \":\" + Integer.toString(m) +\":\" +Integer.toString(s));\n\t}\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nWatch\n\nWrite a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.\n\nInput\n\nAn integer $S$ is given in a line.\n\nOutput\n\nPrint $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.\n\nConstraints\n\n$0 \\leq S \\leq 86400$\n\nSample Input 1\n\n46979\n\nSample Output 1\n\n13:2:59", "sample_input": "46979\n"}, "reference_outputs": ["13:2:59\n"], "source_document_id": "p02390", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nWatch\n\nWrite a program which reads an integer $S$ [second] and converts it to $h:m:s$ where $h$, $m$, $s$ denote hours, minutes (less than 60) and seconds (less than 60) respectively.\n\nInput\n\nAn integer $S$ is given in a line.\n\nOutput\n\nPrint $h$, $m$ and $s$ separated by ':'. You do not need to put '0' for a value, which consists of a digit.\n\nConstraints\n\n$0 \\leq S \\leq 86400$\n\nSample Input 1\n\n46979\n\nSample Output 1\n\n13:2:59", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 498, "cpu_time_ms": 50, "memory_kb": 24428}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s896307832", "group_id": "codeNet:p02391", "input_text": "import java.util.Scanner;\n\npublic class Main{\n private static int a, b;\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n Main ain = new Main();\n Main.a = scan.nextInt();\n Main.b = scan.nextInt();\n if(Main.a < Main.b){\n System.out.println(\"a < b\");\n }\n else if(Main.a > Main.b){\n System.out.println(\"a > b\");\n }\n else{\n System.out.println(\"a == b\");\n }\n }\n}\n\n\n", "language": "Java", "metadata": {"date": 1530885122, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02391.html", "problem_id": "p02391", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02391/input.txt", "sample_output_relpath": "derived/input_output/data/p02391/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02391/Java/s896307832.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s896307832", "user_id": "u022289170"}, "prompt_components": {"gold_output": "a\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main{\n private static int a, b;\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n Main ain = new Main();\n Main.a = scan.nextInt();\n Main.b = scan.nextInt();\n if(Main.a < Main.b){\n System.out.println(\"a < b\");\n }\n else if(Main.a > Main.b){\n System.out.println(\"a > b\");\n }\n else{\n System.out.println(\"a == b\");\n }\n }\n}\n\n\n", "problem_context": "Small, Large, or Equal\n\nWrite a program which prints small/large/equal relation of given two integers a and b.\n\nInput\n\nTwo integers a and b separated by a single space are given in a line.\n\nOutput\n\nFor given two integers a and b, print\n\na < b\n\nif a is less than b,\n\na > b\n\nif a is greater than b, and\n\na == b\n\nif a equals to b.\n\nConstraints\n\n-1000 ≤ a, b ≤ 1000\n\nSample Input 1\n\n1 2\n\nSample Output 1\n\na < b\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\na > b\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\na == b", "sample_input": "1 2\n"}, "reference_outputs": ["a\n"], "source_document_id": "p02391", "source_text": "Small, Large, or Equal\n\nWrite a program which prints small/large/equal relation of given two integers a and b.\n\nInput\n\nTwo integers a and b separated by a single space are given in a line.\n\nOutput\n\nFor given two integers a and b, print\n\na < b\n\nif a is less than b,\n\na > b\n\nif a is greater than b, and\n\na == b\n\nif a equals to b.\n\nConstraints\n\n-1000 ≤ a, b ≤ 1000\n\nSample Input 1\n\n1 2\n\nSample Output 1\n\na < b\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\na > b\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\na == b", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 504, "cpu_time_ms": 70, "memory_kb": 26144}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s575640350", "group_id": "codeNet:p02391", "input_text": "import java.util.*;\nclass Main{\n\tpublic static void main(String args[]){\n\t\tScanner s = new Scanner(System.in);\n\t\tString indata = s.next();\n\t\tint a = Integer.parseInt(indata);\n\t\tindata=s.next();\n\t\tint b = Integer.parseInt(indata);\n\t\tif(a==b)System.out.println(\"a == b\");\n\t\telse if(a>b)System.out.println(\"a > b\");\n\t\telse System.out.println(\"a < b\");\n\t}\n}", "language": "Java", "metadata": {"date": 1502362834, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02391.html", "problem_id": "p02391", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02391/input.txt", "sample_output_relpath": "derived/input_output/data/p02391/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02391/Java/s575640350.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s575640350", "user_id": "u681371370"}, "prompt_components": {"gold_output": "a\n", "input_to_evaluate": "import java.util.*;\nclass Main{\n\tpublic static void main(String args[]){\n\t\tScanner s = new Scanner(System.in);\n\t\tString indata = s.next();\n\t\tint a = Integer.parseInt(indata);\n\t\tindata=s.next();\n\t\tint b = Integer.parseInt(indata);\n\t\tif(a==b)System.out.println(\"a == b\");\n\t\telse if(a>b)System.out.println(\"a > b\");\n\t\telse System.out.println(\"a < b\");\n\t}\n}", "problem_context": "Small, Large, or Equal\n\nWrite a program which prints small/large/equal relation of given two integers a and b.\n\nInput\n\nTwo integers a and b separated by a single space are given in a line.\n\nOutput\n\nFor given two integers a and b, print\n\na < b\n\nif a is less than b,\n\na > b\n\nif a is greater than b, and\n\na == b\n\nif a equals to b.\n\nConstraints\n\n-1000 ≤ a, b ≤ 1000\n\nSample Input 1\n\n1 2\n\nSample Output 1\n\na < b\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\na > b\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\na == b", "sample_input": "1 2\n"}, "reference_outputs": ["a\n"], "source_document_id": "p02391", "source_text": "Small, Large, or Equal\n\nWrite a program which prints small/large/equal relation of given two integers a and b.\n\nInput\n\nTwo integers a and b separated by a single space are given in a line.\n\nOutput\n\nFor given two integers a and b, print\n\na < b\n\nif a is less than b,\n\na > b\n\nif a is greater than b, and\n\na == b\n\nif a equals to b.\n\nConstraints\n\n-1000 ≤ a, b ≤ 1000\n\nSample Input 1\n\n1 2\n\nSample Output 1\n\na < b\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\na > b\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\na == b", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 353, "cpu_time_ms": 50, "memory_kb": 26196}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s951356059", "group_id": "codeNet:p02391", "input_text": "import java.util.*;\n\npublic class Main{\n public static void main(String args[]){\n Scanner scanner = new Scanner(System.in);\n int inputA = scanner.nextInt();\n int inputB = scanner.nextInt();\n\n if(inputAinputB){\n System.out.println(\"a > b\");\n }else{\n System.out.println(\"a == b\");\n }\n }\n}", "language": "Java", "metadata": {"date": 1511971132, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02391.html", "problem_id": "p02391", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02391/input.txt", "sample_output_relpath": "derived/input_output/data/p02391/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02391/Java/s951356059.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s951356059", "user_id": "u699160354"}, "prompt_components": {"gold_output": "a\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String args[]){\n Scanner scanner = new Scanner(System.in);\n int inputA = scanner.nextInt();\n int inputB = scanner.nextInt();\n\n if(inputAinputB){\n System.out.println(\"a > b\");\n }else{\n System.out.println(\"a == b\");\n }\n }\n}", "problem_context": "Small, Large, or Equal\n\nWrite a program which prints small/large/equal relation of given two integers a and b.\n\nInput\n\nTwo integers a and b separated by a single space are given in a line.\n\nOutput\n\nFor given two integers a and b, print\n\na < b\n\nif a is less than b,\n\na > b\n\nif a is greater than b, and\n\na == b\n\nif a equals to b.\n\nConstraints\n\n-1000 ≤ a, b ≤ 1000\n\nSample Input 1\n\n1 2\n\nSample Output 1\n\na < b\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\na > b\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\na == b", "sample_input": "1 2\n"}, "reference_outputs": ["a\n"], "source_document_id": "p02391", "source_text": "Small, Large, or Equal\n\nWrite a program which prints small/large/equal relation of given two integers a and b.\n\nInput\n\nTwo integers a and b separated by a single space are given in a line.\n\nOutput\n\nFor given two integers a and b, print\n\na < b\n\nif a is less than b,\n\na > b\n\nif a is greater than b, and\n\na == b\n\nif a equals to b.\n\nConstraints\n\n-1000 ≤ a, b ≤ 1000\n\nSample Input 1\n\n1 2\n\nSample Output 1\n\na < b\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\na > b\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\na == b", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 70, "memory_kb": 26084}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s510123097", "group_id": "codeNet:p02391", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n \n int x = scanner.nextInt();\n int y = scanner.nextInt();\n String s = \"\";\n\n if (x > y) {\n s = \">\";\n }\n else if (x < y) {\n s = \"<\";\n }\n else {\n s = \"==\";\n }\n System.out.print(\"a\");\n System.out.print(\" \");\n System.out.print(s);\n System.out.print(\" \");\n System.out.println(\"b\");\n }\n}\n", "language": "Java", "metadata": {"date": 1563725728, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02391.html", "problem_id": "p02391", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02391/input.txt", "sample_output_relpath": "derived/input_output/data/p02391/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02391/Java/s510123097.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s510123097", "user_id": "u196669489"}, "prompt_components": {"gold_output": "a\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n \n int x = scanner.nextInt();\n int y = scanner.nextInt();\n String s = \"\";\n\n if (x > y) {\n s = \">\";\n }\n else if (x < y) {\n s = \"<\";\n }\n else {\n s = \"==\";\n }\n System.out.print(\"a\");\n System.out.print(\" \");\n System.out.print(s);\n System.out.print(\" \");\n System.out.println(\"b\");\n }\n}\n", "problem_context": "Small, Large, or Equal\n\nWrite a program which prints small/large/equal relation of given two integers a and b.\n\nInput\n\nTwo integers a and b separated by a single space are given in a line.\n\nOutput\n\nFor given two integers a and b, print\n\na < b\n\nif a is less than b,\n\na > b\n\nif a is greater than b, and\n\na == b\n\nif a equals to b.\n\nConstraints\n\n-1000 ≤ a, b ≤ 1000\n\nSample Input 1\n\n1 2\n\nSample Output 1\n\na < b\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\na > b\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\na == b", "sample_input": "1 2\n"}, "reference_outputs": ["a\n"], "source_document_id": "p02391", "source_text": "Small, Large, or Equal\n\nWrite a program which prints small/large/equal relation of given two integers a and b.\n\nInput\n\nTwo integers a and b separated by a single space are given in a line.\n\nOutput\n\nFor given two integers a and b, print\n\na < b\n\nif a is less than b,\n\na > b\n\nif a is greater than b, and\n\na == b\n\nif a equals to b.\n\nConstraints\n\n-1000 ≤ a, b ≤ 1000\n\nSample Input 1\n\n1 2\n\nSample Output 1\n\na < b\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\na > b\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\na == b", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 560, "cpu_time_ms": 50, "memory_kb": 26228}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s418240239", "group_id": "codeNet:p02392", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\t\n\t\tif(a < b){\n\t\t\tif(b < c){\n\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t}else{\n\t\t\t\tSystem.out.println(\"No\");\n\t\t\t}\n\t\t}else{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1429941213, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02392.html", "problem_id": "p02392", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02392/input.txt", "sample_output_relpath": "derived/input_output/data/p02392/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02392/Java/s418240239.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s418240239", "user_id": "u645367856"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\t\n\t\tif(a < b){\n\t\t\tif(b < c){\n\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t}else{\n\t\t\t\tSystem.out.println(\"No\");\n\t\t\t}\n\t\t}else{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n}", "problem_context": "Range\n\nWrite a program which reads three integers a, b and c, and prints \"Yes\" if a < b < c, otherwise \"No\".\n\nInput\n\nThree integers a, b and c separated by a single space are given in a line.\n\nOutput\n\nPrint \"Yes\" or \"No\" in a line.\n\nConstraints\n\n0 ≤ a, b, c ≤ 100\n\nSample Input 1\n\n1 3 8\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n3 8 1\n\nSample Output 2\n\nNo", "sample_input": "1 3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02392", "source_text": "Range\n\nWrite a program which reads three integers a, b and c, and prints \"Yes\" if a < b < c, otherwise \"No\".\n\nInput\n\nThree integers a, b and c separated by a single space are given in a line.\n\nOutput\n\nPrint \"Yes\" or \"No\" in a line.\n\nConstraints\n\n0 ≤ a, b, c ≤ 100\n\nSample Input 1\n\n1 3 8\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n3 8 1\n\nSample Output 2\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 351, "cpu_time_ms": 50, "memory_kb": 17156}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s831203708", "group_id": "codeNet:p02392", "input_text": "\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\nimport java.util.Scanner;\n\nclass Main\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tif(a <= b && b <= c)\n\t\t{\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}else{\n\t\t\tSystem.out.println(\"No\");\t\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1491203823, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02392.html", "problem_id": "p02392", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02392/input.txt", "sample_output_relpath": "derived/input_output/data/p02392/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02392/Java/s831203708.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s831203708", "user_id": "u191507672"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\nimport java.util.Scanner;\n\nclass Main\n{\n\tpublic static void main (String[] args) throws java.lang.Exception\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tif(a <= b && b <= c)\n\t\t{\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}else{\n\t\t\tSystem.out.println(\"No\");\t\n\t\t}\n\t}\n}", "problem_context": "Range\n\nWrite a program which reads three integers a, b and c, and prints \"Yes\" if a < b < c, otherwise \"No\".\n\nInput\n\nThree integers a, b and c separated by a single space are given in a line.\n\nOutput\n\nPrint \"Yes\" or \"No\" in a line.\n\nConstraints\n\n0 ≤ a, b, c ≤ 100\n\nSample Input 1\n\n1 3 8\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n3 8 1\n\nSample Output 2\n\nNo", "sample_input": "1 3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02392", "source_text": "Range\n\nWrite a program which reads three integers a, b and c, and prints \"Yes\" if a < b < c, otherwise \"No\".\n\nInput\n\nThree integers a, b and c separated by a single space are given in a line.\n\nOutput\n\nPrint \"Yes\" or \"No\" in a line.\n\nConstraints\n\n0 ≤ a, b, c ≤ 100\n\nSample Input 1\n\n1 3 8\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n3 8 1\n\nSample Output 2\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 385, "cpu_time_ms": 60, "memory_kb": 25984}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s859978030", "group_id": "codeNet:p02392", "input_text": "import java.io.*;\nclass Main {\n public static void main( String[] args ) throws IOException {\n BufferedReader br = new BufferedReader( new InputStreamReader( System.in ) );\n String line = br.readLine();\n String[] p = line.split( \" \", 0 );\n boolean flg = false;\n for( int i = 1 ; i < p.length ; i++ ) {\n if( Integer.parseInt( p[ i - 1 ] ) >= Integer.parseInt( p[ i ] ) ) {\n flg = true;\n break;\n }\n }\n if( flg ) {\n System.out.println( \"Yes\" );\n } else {\n System.out.println( \"No\" );\n }\n }\n}", "language": "Java", "metadata": {"date": 1501324980, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02392.html", "problem_id": "p02392", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02392/input.txt", "sample_output_relpath": "derived/input_output/data/p02392/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02392/Java/s859978030.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s859978030", "user_id": "u076000289"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.*;\nclass Main {\n public static void main( String[] args ) throws IOException {\n BufferedReader br = new BufferedReader( new InputStreamReader( System.in ) );\n String line = br.readLine();\n String[] p = line.split( \" \", 0 );\n boolean flg = false;\n for( int i = 1 ; i < p.length ; i++ ) {\n if( Integer.parseInt( p[ i - 1 ] ) >= Integer.parseInt( p[ i ] ) ) {\n flg = true;\n break;\n }\n }\n if( flg ) {\n System.out.println( \"Yes\" );\n } else {\n System.out.println( \"No\" );\n }\n }\n}", "problem_context": "Range\n\nWrite a program which reads three integers a, b and c, and prints \"Yes\" if a < b < c, otherwise \"No\".\n\nInput\n\nThree integers a, b and c separated by a single space are given in a line.\n\nOutput\n\nPrint \"Yes\" or \"No\" in a line.\n\nConstraints\n\n0 ≤ a, b, c ≤ 100\n\nSample Input 1\n\n1 3 8\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n3 8 1\n\nSample Output 2\n\nNo", "sample_input": "1 3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02392", "source_text": "Range\n\nWrite a program which reads three integers a, b and c, and prints \"Yes\" if a < b < c, otherwise \"No\".\n\nInput\n\nThree integers a, b and c separated by a single space are given in a line.\n\nOutput\n\nPrint \"Yes\" or \"No\" in a line.\n\nConstraints\n\n0 ≤ a, b, c ≤ 100\n\nSample Input 1\n\n1 3 8\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n3 8 1\n\nSample Output 2\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 631, "cpu_time_ms": 30, "memory_kb": 24188}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s093309043", "group_id": "codeNet:p02392", "input_text": "import java.util.Scanner;\n\nclass Main {\n\n\tpublic static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\n\n\t\tif(a < b && b < c)\n\t\t\tSystem.out.println(\"Yes\");\n\t\telse\n\t\t\tSystem.out.println(\"No\");\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1576636413, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02392.html", "problem_id": "p02392", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02392/input.txt", "sample_output_relpath": "derived/input_output/data/p02392/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02392/Java/s093309043.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s093309043", "user_id": "u165134527"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main {\n\n\tpublic static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\n\n\t\tif(a < b && b < c)\n\t\t\tSystem.out.println(\"Yes\");\n\t\telse\n\t\t\tSystem.out.println(\"No\");\n\t}\n\n}\n", "problem_context": "Range\n\nWrite a program which reads three integers a, b and c, and prints \"Yes\" if a < b < c, otherwise \"No\".\n\nInput\n\nThree integers a, b and c separated by a single space are given in a line.\n\nOutput\n\nPrint \"Yes\" or \"No\" in a line.\n\nConstraints\n\n0 ≤ a, b, c ≤ 100\n\nSample Input 1\n\n1 3 8\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n3 8 1\n\nSample Output 2\n\nNo", "sample_input": "1 3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02392", "source_text": "Range\n\nWrite a program which reads three integers a, b and c, and prints \"Yes\" if a < b < c, otherwise \"No\".\n\nInput\n\nThree integers a, b and c separated by a single space are given in a line.\n\nOutput\n\nPrint \"Yes\" or \"No\" in a line.\n\nConstraints\n\n0 ≤ a, b, c ≤ 100\n\nSample Input 1\n\n1 3 8\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n3 8 1\n\nSample Output 2\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 80, "memory_kb": 26268}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s019842032", "group_id": "codeNet:p02393", "input_text": "import java.util.Scanner;\n\n\npublic class Main {\n Main(){\n\n int table[] = new int[3];\n Scanner sc = new Scanner(System.in);\n\n table[0] = sc.nextInt();\n table[1] = sc.nextInt();\n table[2] = sc.nextInt();\n\n java.util.Arrays.sort(table);\n System.out.println(table[0] + \" \" + table[1] + \" \" + table[2]);\n }\n\n public static void main(String[] args){\n new Main();\n }\n}\n\n", "language": "Java", "metadata": {"date": 1522054257, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02393.html", "problem_id": "p02393", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02393/input.txt", "sample_output_relpath": "derived/input_output/data/p02393/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02393/Java/s019842032.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s019842032", "user_id": "u718625247"}, "prompt_components": {"gold_output": "1 3 8\n", "input_to_evaluate": "import java.util.Scanner;\n\n\npublic class Main {\n Main(){\n\n int table[] = new int[3];\n Scanner sc = new Scanner(System.in);\n\n table[0] = sc.nextInt();\n table[1] = sc.nextInt();\n table[2] = sc.nextInt();\n\n java.util.Arrays.sort(table);\n System.out.println(table[0] + \" \" + table[1] + \" \" + table[2]);\n }\n\n public static void main(String[] args){\n new Main();\n }\n}\n\n", "problem_context": "Sorting Three Numbers\n\nWrite a program which reads three integers, and prints them in ascending order.\n\nInput\n\nThree integers separated by a single space are given in a line.\n\nOutput\n\nPrint the given integers in ascending order in a line. Put a single space between two integers.\n\nConstraints\n\n1 ≤ the three integers ≤ 10000\n\nSample Input 1\n\n3 8 1\n\nSample Output 1\n\n1 3 8", "sample_input": "3 8 1\n"}, "reference_outputs": ["1 3 8\n"], "source_document_id": "p02393", "source_text": "Sorting Three Numbers\n\nWrite a program which reads three integers, and prints them in ascending order.\n\nInput\n\nThree integers separated by a single space are given in a line.\n\nOutput\n\nPrint the given integers in ascending order in a line. Put a single space between two integers.\n\nConstraints\n\n1 ≤ the three integers ≤ 10000\n\nSample Input 1\n\n3 8 1\n\nSample Output 1\n\n1 3 8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 431, "cpu_time_ms": 70, "memory_kb": 26312}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s490473349", "group_id": "codeNet:p02393", "input_text": "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n\n if(a <= b && b <= c){\n System.out.println(a + \" \" + b + \" \" + c);\n }\n else if(a <= c && c <= b){\n System.out.println(a + \" \" + c + \" \" + b);\n }\n else if(b <= a && b <= c){\n System.out.println(b + \" \" + a + \" \" + c);\n }\n else if(b <= c && c <= a){\n System.out.println(b + \" \" + c + \" \" + a);\n }\n else if(c <= a && a <= b){\n System.out.println(c + \" \" + a + \" \" + b);\n }\n else{\n System.out.println(c + \" \" + b + \" \" + a);\n }\n }\n}\n\n", "language": "Java", "metadata": {"date": 1523856269, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02393.html", "problem_id": "p02393", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02393/input.txt", "sample_output_relpath": "derived/input_output/data/p02393/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02393/Java/s490473349.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s490473349", "user_id": "u415714413"}, "prompt_components": {"gold_output": "1 3 8\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n\n if(a <= b && b <= c){\n System.out.println(a + \" \" + b + \" \" + c);\n }\n else if(a <= c && c <= b){\n System.out.println(a + \" \" + c + \" \" + b);\n }\n else if(b <= a && b <= c){\n System.out.println(b + \" \" + a + \" \" + c);\n }\n else if(b <= c && c <= a){\n System.out.println(b + \" \" + c + \" \" + a);\n }\n else if(c <= a && a <= b){\n System.out.println(c + \" \" + a + \" \" + b);\n }\n else{\n System.out.println(c + \" \" + b + \" \" + a);\n }\n }\n}\n\n", "problem_context": "Sorting Three Numbers\n\nWrite a program which reads three integers, and prints them in ascending order.\n\nInput\n\nThree integers separated by a single space are given in a line.\n\nOutput\n\nPrint the given integers in ascending order in a line. Put a single space between two integers.\n\nConstraints\n\n1 ≤ the three integers ≤ 10000\n\nSample Input 1\n\n3 8 1\n\nSample Output 1\n\n1 3 8", "sample_input": "3 8 1\n"}, "reference_outputs": ["1 3 8\n"], "source_document_id": "p02393", "source_text": "Sorting Three Numbers\n\nWrite a program which reads three integers, and prints them in ascending order.\n\nInput\n\nThree integers separated by a single space are given in a line.\n\nOutput\n\nPrint the given integers in ascending order in a line. Put a single space between two integers.\n\nConstraints\n\n1 ≤ the three integers ≤ 10000\n\nSample Input 1\n\n3 8 1\n\nSample Output 1\n\n1 3 8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 809, "cpu_time_ms": 60, "memory_kb": 26116}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s406141774", "group_id": "codeNet:p02393", "input_text": "import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main {\n public static void main(String args[]) {\n Scanner in = new Scanner(System.in);\n int a = in.nextInt();\n int b = in.nextInt();\n int c = in.nextInt();\n int[] array = {a, b, c};\n Arrays.sort(array);\n System.out.println(array[0] + \" \" + array[1] + \" \" + array[2]);\n }\n}", "language": "Java", "metadata": {"date": 1364872663, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02393.html", "problem_id": "p02393", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02393/input.txt", "sample_output_relpath": "derived/input_output/data/p02393/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02393/Java/s406141774.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s406141774", "user_id": "u441419639"}, "prompt_components": {"gold_output": "1 3 8\n", "input_to_evaluate": "import java.util.Scanner;\nimport java.util.Arrays;\n\npublic class Main {\n public static void main(String args[]) {\n Scanner in = new Scanner(System.in);\n int a = in.nextInt();\n int b = in.nextInt();\n int c = in.nextInt();\n int[] array = {a, b, c};\n Arrays.sort(array);\n System.out.println(array[0] + \" \" + array[1] + \" \" + array[2]);\n }\n}", "problem_context": "Sorting Three Numbers\n\nWrite a program which reads three integers, and prints them in ascending order.\n\nInput\n\nThree integers separated by a single space are given in a line.\n\nOutput\n\nPrint the given integers in ascending order in a line. Put a single space between two integers.\n\nConstraints\n\n1 ≤ the three integers ≤ 10000\n\nSample Input 1\n\n3 8 1\n\nSample Output 1\n\n1 3 8", "sample_input": "3 8 1\n"}, "reference_outputs": ["1 3 8\n"], "source_document_id": "p02393", "source_text": "Sorting Three Numbers\n\nWrite a program which reads three integers, and prints them in ascending order.\n\nInput\n\nThree integers separated by a single space are given in a line.\n\nOutput\n\nPrint the given integers in ascending order in a line. Put a single space between two integers.\n\nConstraints\n\n1 ≤ the three integers ≤ 10000\n\nSample Input 1\n\n3 8 1\n\nSample Output 1\n\n1 3 8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 392, "cpu_time_ms": 50, "memory_kb": 17348}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s661905565", "group_id": "codeNet:p02393", "input_text": "import java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.stream.Collectors;\n\npublic class Main {\n public static void main(String[] args) {\n String input = new Scanner(System.in).nextLine();\n String[] inputs = input.split(\"\\\\s+\");\n List sorted = Arrays.stream(inputs).sorted().collect(Collectors.toList());\n System.out.println(sorted.get(0) + \" \" + sorted.get(1) + \" \" + sorted.get(2));\n }\n}\n", "language": "Java", "metadata": {"date": 1545201427, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02393.html", "problem_id": "p02393", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02393/input.txt", "sample_output_relpath": "derived/input_output/data/p02393/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02393/Java/s661905565.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s661905565", "user_id": "u584615724"}, "prompt_components": {"gold_output": "1 3 8\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.stream.Collectors;\n\npublic class Main {\n public static void main(String[] args) {\n String input = new Scanner(System.in).nextLine();\n String[] inputs = input.split(\"\\\\s+\");\n List sorted = Arrays.stream(inputs).sorted().collect(Collectors.toList());\n System.out.println(sorted.get(0) + \" \" + sorted.get(1) + \" \" + sorted.get(2));\n }\n}\n", "problem_context": "Sorting Three Numbers\n\nWrite a program which reads three integers, and prints them in ascending order.\n\nInput\n\nThree integers separated by a single space are given in a line.\n\nOutput\n\nPrint the given integers in ascending order in a line. Put a single space between two integers.\n\nConstraints\n\n1 ≤ the three integers ≤ 10000\n\nSample Input 1\n\n3 8 1\n\nSample Output 1\n\n1 3 8", "sample_input": "3 8 1\n"}, "reference_outputs": ["1 3 8\n"], "source_document_id": "p02393", "source_text": "Sorting Three Numbers\n\nWrite a program which reads three integers, and prints them in ascending order.\n\nInput\n\nThree integers separated by a single space are given in a line.\n\nOutput\n\nPrint the given integers in ascending order in a line. Put a single space between two integers.\n\nConstraints\n\n1 ≤ the three integers ≤ 10000\n\nSample Input 1\n\n3 8 1\n\nSample Output 1\n\n1 3 8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 467, "cpu_time_ms": 130, "memory_kb": 31876}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s352771947", "group_id": "codeNet:p02394", "input_text": "\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int W = scanner.nextInt();\n int H = scanner.nextInt();\n int x = scanner.nextInt();\n int y = scanner.nextInt();\n int r = scanner.nextInt();\n if(x+r<=W&&x-r>=0&&y+r<=H&&y-r>=0){System.out.println(\"Yes\");}\n else if(x+r>W){System.out.println(\"No\");}\n else if(y+r>H){System.out.println(\"No\");}\n else if(x+r<0){System.out.println(\"No\");}\n else if(y+r<0){System.out.println(\"No\");}\n }\n }", "language": "Java", "metadata": {"date": 1461583802, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02394.html", "problem_id": "p02394", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02394/input.txt", "sample_output_relpath": "derived/input_output/data/p02394/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02394/Java/s352771947.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s352771947", "user_id": "u635302206"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int W = scanner.nextInt();\n int H = scanner.nextInt();\n int x = scanner.nextInt();\n int y = scanner.nextInt();\n int r = scanner.nextInt();\n if(x+r<=W&&x-r>=0&&y+r<=H&&y-r>=0){System.out.println(\"Yes\");}\n else if(x+r>W){System.out.println(\"No\");}\n else if(y+r>H){System.out.println(\"No\");}\n else if(x+r<0){System.out.println(\"No\");}\n else if(y+r<0){System.out.println(\"No\");}\n }\n }", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nCircle in a Rectangle\n\nWrite a program which reads a rectangle and a circle, and determines whether the circle is arranged inside the rectangle. As shown in the following figures, the upper right coordinate $(W, H)$ of the rectangle and the central coordinate $(x, y)$ and radius $r$ of the circle are given.\n\nInput\n\nFive integers $W$, $H$, $x$, $y$ and $r$ separated by a single space are given in a line.\n\nOutput\n\nPrint \"Yes\" if the circle is placed inside the rectangle, otherwise \"No\" in a line.\n\nConstraints\n\n$ -100 \\leq x, y \\leq 100$\n\n$ 0 < W, H, r \\leq 100$\n\nSample Input 1\n\n5 4 2 2 1\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n5 4 2 4 1\n\nSample Output 2\n\nNo", "sample_input": "5 4 2 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02394", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nCircle in a Rectangle\n\nWrite a program which reads a rectangle and a circle, and determines whether the circle is arranged inside the rectangle. As shown in the following figures, the upper right coordinate $(W, H)$ of the rectangle and the central coordinate $(x, y)$ and radius $r$ of the circle are given.\n\nInput\n\nFive integers $W$, $H$, $x$, $y$ and $r$ separated by a single space are given in a line.\n\nOutput\n\nPrint \"Yes\" if the circle is placed inside the rectangle, otherwise \"No\" in a line.\n\nConstraints\n\n$ -100 \\leq x, y \\leq 100$\n\n$ 0 < W, H, r \\leq 100$\n\nSample Input 1\n\n5 4 2 2 1\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n5 4 2 4 1\n\nSample Output 2\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 605, "cpu_time_ms": 60, "memory_kb": 26108}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s107422084", "group_id": "codeNet:p02396", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n\npublic class Main{\n\tpublic static void main(String args[]) throws IOException{\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringBuilder builder = new StringBuilder();\n\t\tint i = 1;\n\t\twhile(true){\n\t\t\tint data = Integer.parseInt(reader.readLine());\n\t\t\tif (data == 0)\n\t\t\t\tbreak;\n\t\t\tbuilder.append(\"Case \").append(Integer.toString(i++)).append(\": \").append(Integer.toString(data)).append(\"\\n\");\n\t\t}\n\t\tSystem.out.print(builder);\n\t}\n}", "language": "Java", "metadata": {"date": 1460986673, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02396.html", "problem_id": "p02396", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02396/input.txt", "sample_output_relpath": "derived/input_output/data/p02396/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02396/Java/s107422084.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s107422084", "user_id": "u994064546"}, "prompt_components": {"gold_output": "Case 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\n\npublic class Main{\n\tpublic static void main(String args[]) throws IOException{\n\t\tBufferedReader reader = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringBuilder builder = new StringBuilder();\n\t\tint i = 1;\n\t\twhile(true){\n\t\t\tint data = Integer.parseInt(reader.readLine());\n\t\t\tif (data == 0)\n\t\t\t\tbreak;\n\t\t\tbuilder.append(\"Case \").append(Integer.toString(i++)).append(\": \").append(Integer.toString(data)).append(\"\\n\");\n\t\t}\n\t\tSystem.out.print(builder);\n\t}\n}", "problem_context": "Print Test Cases\n\nIn the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.\n\nWrite a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of an integer x in a line.\n\nThe input ends with an integer 0. You program should not process (print) for this terminal symbol.\n\nOutput\n\nFor each dataset, print x in the following format:\n\nCase i: x\n\nwhere i is the case number which starts with 1. Put a single space between \"Case\" and i. Also, put a single space between ':' and x.\n\nConstraints\n\n1 ≤ x ≤ 10000\n\nThe number of datasets ≤ 10000\n\nSample Input\n\n3\n5\n11\n7\n8\n19\n0\n\nSample Output\n\nCase 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19", "sample_input": "3\n5\n11\n7\n8\n19\n0\n"}, "reference_outputs": ["Case 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19\n"], "source_document_id": "p02396", "source_text": "Print Test Cases\n\nIn the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.\n\nWrite a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of an integer x in a line.\n\nThe input ends with an integer 0. You program should not process (print) for this terminal symbol.\n\nOutput\n\nFor each dataset, print x in the following format:\n\nCase i: x\n\nwhere i is the case number which starts with 1. Put a single space between \"Case\" and i. Also, put a single space between ':' and x.\n\nConstraints\n\n1 ≤ x ≤ 10000\n\nThe number of datasets ≤ 10000\n\nSample Input\n\n3\n5\n11\n7\n8\n19\n0\n\nSample Output\n\nCase 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 561, "cpu_time_ms": 100, "memory_kb": 31256}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s638054594", "group_id": "codeNet:p02396", "input_text": "import java.util.*;\nclass Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i = 1;\n\t\twhile(true){\n\t\t\tint temp = sc.nextInt();\n\t\t\tif(temp == 0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tSystem.out.println(\"Case\" + i++ + \": \" + temp);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1476504354, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02396.html", "problem_id": "p02396", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02396/input.txt", "sample_output_relpath": "derived/input_output/data/p02396/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02396/Java/s638054594.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s638054594", "user_id": "u553148578"}, "prompt_components": {"gold_output": "Case 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19\n", "input_to_evaluate": "import java.util.*;\nclass Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i = 1;\n\t\twhile(true){\n\t\t\tint temp = sc.nextInt();\n\t\t\tif(temp == 0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tSystem.out.println(\"Case\" + i++ + \": \" + temp);\n\t\t}\n\t}\n}", "problem_context": "Print Test Cases\n\nIn the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.\n\nWrite a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of an integer x in a line.\n\nThe input ends with an integer 0. You program should not process (print) for this terminal symbol.\n\nOutput\n\nFor each dataset, print x in the following format:\n\nCase i: x\n\nwhere i is the case number which starts with 1. Put a single space between \"Case\" and i. Also, put a single space between ':' and x.\n\nConstraints\n\n1 ≤ x ≤ 10000\n\nThe number of datasets ≤ 10000\n\nSample Input\n\n3\n5\n11\n7\n8\n19\n0\n\nSample Output\n\nCase 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19", "sample_input": "3\n5\n11\n7\n8\n19\n0\n"}, "reference_outputs": ["Case 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19\n"], "source_document_id": "p02396", "source_text": "Print Test Cases\n\nIn the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.\n\nWrite a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of an integer x in a line.\n\nThe input ends with an integer 0. You program should not process (print) for this terminal symbol.\n\nOutput\n\nFor each dataset, print x in the following format:\n\nCase i: x\n\nwhere i is the case number which starts with 1. Put a single space between \"Case\" and i. Also, put a single space between ':' and x.\n\nConstraints\n\n1 ≤ x ≤ 10000\n\nThe number of datasets ≤ 10000\n\nSample Input\n\n3\n5\n11\n7\n8\n19\n0\n\nSample Output\n\nCase 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 290, "memory_kb": 45248}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s122753999", "group_id": "codeNet:p02396", "input_text": "import java.io.*;\n \nclass Main {\n public static void main(String[] args) throws java.io.IOException {\n \n BufferedReader input = new BufferedReader(new InputStreamReader(\n System.in));\n StringBuilder str = new StringBuilder();\n \n int i = 0;\n \n while (true) {\n i++;\n String tmp = input.readLine();\n int x = Integer.parseInt(tmp);\n \n if (x == 0)\n break;\n \n str.append(\"Case \" + i + \": \" + x + \"\\n\");\n \n }\n \n System.out.print(str);\n \n }\n}", "language": "Java", "metadata": {"date": 1485784735, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02396.html", "problem_id": "p02396", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02396/input.txt", "sample_output_relpath": "derived/input_output/data/p02396/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02396/Java/s122753999.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s122753999", "user_id": "u451272713"}, "prompt_components": {"gold_output": "Case 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19\n", "input_to_evaluate": "import java.io.*;\n \nclass Main {\n public static void main(String[] args) throws java.io.IOException {\n \n BufferedReader input = new BufferedReader(new InputStreamReader(\n System.in));\n StringBuilder str = new StringBuilder();\n \n int i = 0;\n \n while (true) {\n i++;\n String tmp = input.readLine();\n int x = Integer.parseInt(tmp);\n \n if (x == 0)\n break;\n \n str.append(\"Case \" + i + \": \" + x + \"\\n\");\n \n }\n \n System.out.print(str);\n \n }\n}", "problem_context": "Print Test Cases\n\nIn the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.\n\nWrite a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of an integer x in a line.\n\nThe input ends with an integer 0. You program should not process (print) for this terminal symbol.\n\nOutput\n\nFor each dataset, print x in the following format:\n\nCase i: x\n\nwhere i is the case number which starts with 1. Put a single space between \"Case\" and i. Also, put a single space between ':' and x.\n\nConstraints\n\n1 ≤ x ≤ 10000\n\nThe number of datasets ≤ 10000\n\nSample Input\n\n3\n5\n11\n7\n8\n19\n0\n\nSample Output\n\nCase 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19", "sample_input": "3\n5\n11\n7\n8\n19\n0\n"}, "reference_outputs": ["Case 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19\n"], "source_document_id": "p02396", "source_text": "Print Test Cases\n\nIn the online judge system, a judge file may include multiple datasets to check whether the submitted program outputs a correct answer for each test case. This task is to practice solving a problem with multiple datasets.\n\nWrite a program which reads an integer x and print it as is. Note that multiple datasets are given for this problem.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of an integer x in a line.\n\nThe input ends with an integer 0. You program should not process (print) for this terminal symbol.\n\nOutput\n\nFor each dataset, print x in the following format:\n\nCase i: x\n\nwhere i is the case number which starts with 1. Put a single space between \"Case\" and i. Also, put a single space between ':' and x.\n\nConstraints\n\n1 ≤ x ≤ 10000\n\nThe number of datasets ≤ 10000\n\nSample Input\n\n3\n5\n11\n7\n8\n19\n0\n\nSample Output\n\nCase 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 7\nCase 5: 8\nCase 6: 19", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 567, "cpu_time_ms": 100, "memory_kb": 31984}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s728085948", "group_id": "codeNet:p02396", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.*;\nclass Main{\n\tpublic static void main(String[] args){\n\tint x =0;\n\tScanner scan = new Scanner(System.in);\n\tArrayList list = new ArrayList();\n\tint ii = 0;\n\t\twhile(ii>0){\n\t\t\tx = scan.nextInt();\t\t\t\n\t\t\tif(x == 0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tlist.add(x);\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i list = new ArrayList();\n\tint ii = 0;\n\t\twhile(ii>0){\n\t\t\tx = scan.nextInt();\t\t\t\n\t\t\tif(x == 0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tlist.add(x);\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;iy) {\n int n = x;\n x = y;\n y = n;\n } else if (x == 0 && y == 0) {\n break;\n }\n\n sb.append(x).append(\" \").append(y).append(\"\\n\");\n }\n System.out.println(sb);\n }\n}", "language": "Java", "metadata": {"date": 1463377286, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02397.html", "problem_id": "p02397", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02397/input.txt", "sample_output_relpath": "derived/input_output/data/p02397/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02397/Java/s861690615.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s861690615", "user_id": "u662295338"}, "prompt_components": {"gold_output": "2 3\n2 2\n3 5\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner stdIn = new Scanner(System.in);\n StringBuilder sb = new StringBuilder();\n\n while(true) {\n int x = stdIn.nextInt();\n int y = stdIn.nextInt();\n\n if (x>y) {\n int n = x;\n x = y;\n y = n;\n } else if (x == 0 && y == 0) {\n break;\n }\n\n sb.append(x).append(\" \").append(y).append(\"\\n\");\n }\n System.out.println(sb);\n }\n}", "problem_context": "Swapping Two Numbers\n\nWrite a program which reads two integers x and y, and prints them in ascending order.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers x and y separated by a single space.\n\nThe input ends with two 0 (when both x and y are zero). Your program should not process for these terminal symbols.\n\nOutput\n\nFor each dataset, print x and y in ascending order in a line. Put a single space between x and y.\n\nConstraints\n\n0 ≤ x, y ≤ 10000\n\nthe number of datasets ≤ 3000\n\nSample Input\n\n3 2\n2 2\n5 3\n0 0\n\nSample Output\n\n2 3\n2 2\n3 5", "sample_input": "3 2\n2 2\n5 3\n0 0\n"}, "reference_outputs": ["2 3\n2 2\n3 5\n"], "source_document_id": "p02397", "source_text": "Swapping Two Numbers\n\nWrite a program which reads two integers x and y, and prints them in ascending order.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers x and y separated by a single space.\n\nThe input ends with two 0 (when both x and y are zero). Your program should not process for these terminal symbols.\n\nOutput\n\nFor each dataset, print x and y in ascending order in a line. Put a single space between x and y.\n\nConstraints\n\n0 ≤ x, y ≤ 10000\n\nthe number of datasets ≤ 3000\n\nSample Input\n\n3 2\n2 2\n5 3\n0 0\n\nSample Output\n\n2 3\n2 2\n3 5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 566, "cpu_time_ms": 140, "memory_kb": 34932}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s931715255", "group_id": "codeNet:p02397", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\t\n\t\twhile(true) {\n\t\t\tint x = s.nextInt();\n\t\t\tint y = s.nextInt();\n\t\t\tif(x == 0 && y == 0) {\n\t\t\t\treturn;\n\t\t\t} else if(x <= y) {\n\t\t\t\tSystem.out.println(x + \" \" + y);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(y + \" \" + x);\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\n}", "language": "Java", "metadata": {"date": 1494408729, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02397.html", "problem_id": "p02397", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02397/input.txt", "sample_output_relpath": "derived/input_output/data/p02397/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02397/Java/s931715255.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s931715255", "user_id": "u758581602"}, "prompt_components": {"gold_output": "2 3\n2 2\n3 5\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\t\n\t\twhile(true) {\n\t\t\tint x = s.nextInt();\n\t\t\tint y = s.nextInt();\n\t\t\tif(x == 0 && y == 0) {\n\t\t\t\treturn;\n\t\t\t} else if(x <= y) {\n\t\t\t\tSystem.out.println(x + \" \" + y);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(y + \" \" + x);\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\n}", "problem_context": "Swapping Two Numbers\n\nWrite a program which reads two integers x and y, and prints them in ascending order.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers x and y separated by a single space.\n\nThe input ends with two 0 (when both x and y are zero). Your program should not process for these terminal symbols.\n\nOutput\n\nFor each dataset, print x and y in ascending order in a line. Put a single space between x and y.\n\nConstraints\n\n0 ≤ x, y ≤ 10000\n\nthe number of datasets ≤ 3000\n\nSample Input\n\n3 2\n2 2\n5 3\n0 0\n\nSample Output\n\n2 3\n2 2\n3 5", "sample_input": "3 2\n2 2\n5 3\n0 0\n"}, "reference_outputs": ["2 3\n2 2\n3 5\n"], "source_document_id": "p02397", "source_text": "Swapping Two Numbers\n\nWrite a program which reads two integers x and y, and prints them in ascending order.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers x and y separated by a single space.\n\nThe input ends with two 0 (when both x and y are zero). Your program should not process for these terminal symbols.\n\nOutput\n\nFor each dataset, print x and y in ascending order in a line. Put a single space between x and y.\n\nConstraints\n\n0 ≤ x, y ≤ 10000\n\nthe number of datasets ≤ 3000\n\nSample Input\n\n3 2\n2 2\n5 3\n0 0\n\nSample Output\n\n2 3\n2 2\n3 5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 360, "cpu_time_ms": 180, "memory_kb": 36512}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s276604148", "group_id": "codeNet:p02397", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i = 0;\n\n\t\twhile(true) {\n\t\t\tint x = sc.nextInt();\n\t\t\tint y = sc.nextInt();\n\n\t\t\tif((x == 0 && y == 0) || i > 3000) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(x < y) {\n\t\t\t\tSystem.out.println(x + \" \" + y);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(y + \" \" + x);\n\t\t\t}\n\t\t\ti++;\n\t\t}\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1589943256, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02397.html", "problem_id": "p02397", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02397/input.txt", "sample_output_relpath": "derived/input_output/data/p02397/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02397/Java/s276604148.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s276604148", "user_id": "u360320034"}, "prompt_components": {"gold_output": "2 3\n2 2\n3 5\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint i = 0;\n\n\t\twhile(true) {\n\t\t\tint x = sc.nextInt();\n\t\t\tint y = sc.nextInt();\n\n\t\t\tif((x == 0 && y == 0) || i > 3000) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(x < y) {\n\t\t\t\tSystem.out.println(x + \" \" + y);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(y + \" \" + x);\n\t\t\t}\n\t\t\ti++;\n\t\t}\n\t}\n\n}\n", "problem_context": "Swapping Two Numbers\n\nWrite a program which reads two integers x and y, and prints them in ascending order.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers x and y separated by a single space.\n\nThe input ends with two 0 (when both x and y are zero). Your program should not process for these terminal symbols.\n\nOutput\n\nFor each dataset, print x and y in ascending order in a line. Put a single space between x and y.\n\nConstraints\n\n0 ≤ x, y ≤ 10000\n\nthe number of datasets ≤ 3000\n\nSample Input\n\n3 2\n2 2\n5 3\n0 0\n\nSample Output\n\n2 3\n2 2\n3 5", "sample_input": "3 2\n2 2\n5 3\n0 0\n"}, "reference_outputs": ["2 3\n2 2\n3 5\n"], "source_document_id": "p02397", "source_text": "Swapping Two Numbers\n\nWrite a program which reads two integers x and y, and prints them in ascending order.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers x and y separated by a single space.\n\nThe input ends with two 0 (when both x and y are zero). Your program should not process for these terminal symbols.\n\nOutput\n\nFor each dataset, print x and y in ascending order in a line. Put a single space between x and y.\n\nConstraints\n\n0 ≤ x, y ≤ 10000\n\nthe number of datasets ≤ 3000\n\nSample Input\n\n3 2\n2 2\n5 3\n0 0\n\nSample Output\n\n2 3\n2 2\n3 5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 447, "cpu_time_ms": 190, "memory_kb": 36004}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s665491307", "group_id": "codeNet:p02398", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t\tScanner a = new Scanner(System.in);\n\t\tint b = a.nextInt();\n\t\tint c = a.nextInt();\n\t\tint d = a.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = b;i < c;i++){\n\t\t\tif((d % i) == 0){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}", "language": "Java", "metadata": {"date": 1432174997, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02398.html", "problem_id": "p02398", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02398/input.txt", "sample_output_relpath": "derived/input_output/data/p02398/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02398/Java/s665491307.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s665491307", "user_id": "u267351132"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t\tScanner a = new Scanner(System.in);\n\t\tint b = a.nextInt();\n\t\tint c = a.nextInt();\n\t\tint d = a.nextInt();\n\t\tint count = 0;\n\t\tfor(int i = b;i < c;i++){\n\t\t\tif((d % i) == 0){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}", "problem_context": "How Many Divisors?\n\nWrite a program which reads three integers a, b and c, and prints the number of divisors of c between a and b.\n\nInput\n\nThree integers a, b and c are given in a line separated by a single space.\n\nOutput\n\nPrint the number of divisors in a line.\n\nConstraints\n\n1 ≤ a, b, c ≤ 10000\n\na ≤ b\n\nSample Input 1\n\n5 14 80\n\nSample Output 1\n\n3", "sample_input": "5 14 80\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02398", "source_text": "How Many Divisors?\n\nWrite a program which reads three integers a, b and c, and prints the number of divisors of c between a and b.\n\nInput\n\nThree integers a, b and c are given in a line separated by a single space.\n\nOutput\n\nPrint the number of divisors in a line.\n\nConstraints\n\n1 ≤ a, b, c ≤ 10000\n\na ≤ b\n\nSample Input 1\n\n5 14 80\n\nSample Output 1\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 317, "cpu_time_ms": 50, "memory_kb": 17160}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s571622296", "group_id": "codeNet:p02398", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main{\n\n\n\tpublic static void main(String[] args){\n\n\t\tBufferedReader reader=new BufferedReader(new InputStreamReader(System.in));\n\n\t\ttry{\n\n\t\t\tString str=reader.readLine();\n\t\t\tString[] str_Array=str.split(\" \");\n\n\t\t\tint a=Integer.parseInt(str_Array[0]);\n\t\t\tint b=Integer.parseInt(str_Array[1]);\n\t\t\tint c=Integer.parseInt(str_Array[2]);\n\t\t\tint count=0;\n\t\t\tfor(int i=a;i= max){\n max = a[i];\n }else{\n continue;\n }\n \n }\n System.out.println(min + \" \" + max + \" \" + sam);\n }\n public static void main(String[] args){\n new Main().solve();\n }\n}", "language": "Java", "metadata": {"date": 1423025894, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02402.html", "problem_id": "p02402", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02402/input.txt", "sample_output_relpath": "derived/input_output/data/p02402/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02402/Java/s391806601.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s391806601", "user_id": "u367059629"}, "prompt_components": {"gold_output": "1 17 37\n", "input_to_evaluate": "import java.util.Scanner;\nclass Main{\n int n,i;\n int max = -999999;\n int min = 999999;\n int sam = 0;\n\n public void solve(){\n Scanner sc = new Scanner(System.in);\n n = sc.nextInt();\n int a[] = new int[n+1];\n for(i = 0; i < n; i++){\n a[i] = sc.nextInt();\n sam += a[i];\n if(n == 0){\n min = 0;\n max = 0;\n }else if(n == 1){\n max = a[i];\n min = a[i];\n }else if(a[i] < min){\n min = a[i];\n }else if(a[i] >= max){\n max = a[i];\n }else{\n continue;\n }\n \n }\n System.out.println(min + \" \" + max + \" \" + sam);\n }\n public static void main(String[] args){\n new Main().solve();\n }\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMin, Max and Sum\n\nWrite a program which reads a sequence of $n$ integers $a_i (i = 1, 2, ... n)$, and prints the minimum value, maximum value and sum of the sequence.\n\nInput\n\nIn the first line, an integer $n$ is given. In the next line, $n$ integers $a_i$ are given in a line.\n\nOutput\n\nPrint the minimum value, maximum value and sum in a line. Put a single space between the values.\n\nConstraints\n\n$0 < n \\leq 10000$\n\n$-1000000 \\leq a_i \\leq 1000000$\n\nSample Input\n\n5\n10 1 5 4 17\n\nSample Output\n\n1 17 37", "sample_input": "5\n10 1 5 4 17\n"}, "reference_outputs": ["1 17 37\n"], "source_document_id": "p02402", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMin, Max and Sum\n\nWrite a program which reads a sequence of $n$ integers $a_i (i = 1, 2, ... n)$, and prints the minimum value, maximum value and sum of the sequence.\n\nInput\n\nIn the first line, an integer $n$ is given. In the next line, $n$ integers $a_i$ are given in a line.\n\nOutput\n\nPrint the minimum value, maximum value and sum in a line. Put a single space between the values.\n\nConstraints\n\n$0 < n \\leq 10000$\n\n$-1000000 \\leq a_i \\leq 1000000$\n\nSample Input\n\n5\n10 1 5 4 17\n\nSample Output\n\n1 17 37", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 836, "cpu_time_ms": 210, "memory_kb": 31760}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s679695209", "group_id": "codeNet:p02402", "input_text": "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n \tScanner scan = new Scanner(System.in);\n \tint n = scan.nextInt();\n \tint[] values = new int[n];\n\n for(int i = 0; i < n; i++){\n \tvalues[i] = scan.nextInt();\n }\n\n int min = values[0];\n int max = values[0];\n int sum = 0;\n\n for(int i = 0; i < values.length; i++){\n \tif(min > values[i]){\n \t\tmin = values[i];\n \t}\n \tif(max < values[i]){\n \t\tmax = values[i];\n \t}\n \tsum += values[i];\n }\n System.out.printf(\"%d %d %d\", min,max,sum);\n }\n}", "language": "Java", "metadata": {"date": 1464850357, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02402.html", "problem_id": "p02402", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02402/input.txt", "sample_output_relpath": "derived/input_output/data/p02402/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02402/Java/s679695209.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s679695209", "user_id": "u178753893"}, "prompt_components": {"gold_output": "1 17 37\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n \tScanner scan = new Scanner(System.in);\n \tint n = scan.nextInt();\n \tint[] values = new int[n];\n\n for(int i = 0; i < n; i++){\n \tvalues[i] = scan.nextInt();\n }\n\n int min = values[0];\n int max = values[0];\n int sum = 0;\n\n for(int i = 0; i < values.length; i++){\n \tif(min > values[i]){\n \t\tmin = values[i];\n \t}\n \tif(max < values[i]){\n \t\tmax = values[i];\n \t}\n \tsum += values[i];\n }\n System.out.printf(\"%d %d %d\", min,max,sum);\n }\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMin, Max and Sum\n\nWrite a program which reads a sequence of $n$ integers $a_i (i = 1, 2, ... n)$, and prints the minimum value, maximum value and sum of the sequence.\n\nInput\n\nIn the first line, an integer $n$ is given. In the next line, $n$ integers $a_i$ are given in a line.\n\nOutput\n\nPrint the minimum value, maximum value and sum in a line. Put a single space between the values.\n\nConstraints\n\n$0 < n \\leq 10000$\n\n$-1000000 \\leq a_i \\leq 1000000$\n\nSample Input\n\n5\n10 1 5 4 17\n\nSample Output\n\n1 17 37", "sample_input": "5\n10 1 5 4 17\n"}, "reference_outputs": ["1 17 37\n"], "source_document_id": "p02402", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMin, Max and Sum\n\nWrite a program which reads a sequence of $n$ integers $a_i (i = 1, 2, ... n)$, and prints the minimum value, maximum value and sum of the sequence.\n\nInput\n\nIn the first line, an integer $n$ is given. In the next line, $n$ integers $a_i$ are given in a line.\n\nOutput\n\nPrint the minimum value, maximum value and sum in a line. Put a single space between the values.\n\nConstraints\n\n$0 < n \\leq 10000$\n\n$-1000000 \\leq a_i \\leq 1000000$\n\nSample Input\n\n5\n10 1 5 4 17\n\nSample Output\n\n1 17 37", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 633, "cpu_time_ms": 70, "memory_kb": 26188}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s409052821", "group_id": "codeNet:p02402", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n \n int min = a[0];\n int max = a[0];\n long sum = a[0];\n \n for (int i = 1; i < n; i++) {\n min = Math.min(min, a[i]);\n max = Math.max(max, a[i]);\n sum += a[i];\n }\n \n System.out.println(min + \" \" + max + \" \" + sum);\n }\n\n}\n", "language": "Java", "metadata": {"date": 1583045046, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02402.html", "problem_id": "p02402", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02402/input.txt", "sample_output_relpath": "derived/input_output/data/p02402/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02402/Java/s409052821.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s409052821", "user_id": "u800467831"}, "prompt_components": {"gold_output": "1 17 37\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n \n int min = a[0];\n int max = a[0];\n long sum = a[0];\n \n for (int i = 1; i < n; i++) {\n min = Math.min(min, a[i]);\n max = Math.max(max, a[i]);\n sum += a[i];\n }\n \n System.out.println(min + \" \" + max + \" \" + sum);\n }\n\n}\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMin, Max and Sum\n\nWrite a program which reads a sequence of $n$ integers $a_i (i = 1, 2, ... n)$, and prints the minimum value, maximum value and sum of the sequence.\n\nInput\n\nIn the first line, an integer $n$ is given. In the next line, $n$ integers $a_i$ are given in a line.\n\nOutput\n\nPrint the minimum value, maximum value and sum in a line. Put a single space between the values.\n\nConstraints\n\n$0 < n \\leq 10000$\n\n$-1000000 \\leq a_i \\leq 1000000$\n\nSample Input\n\n5\n10 1 5 4 17\n\nSample Output\n\n1 17 37", "sample_input": "5\n10 1 5 4 17\n"}, "reference_outputs": ["1 17 37\n"], "source_document_id": "p02402", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMin, Max and Sum\n\nWrite a program which reads a sequence of $n$ integers $a_i (i = 1, 2, ... n)$, and prints the minimum value, maximum value and sum of the sequence.\n\nInput\n\nIn the first line, an integer $n$ is given. In the next line, $n$ integers $a_i$ are given in a line.\n\nOutput\n\nPrint the minimum value, maximum value and sum in a line. Put a single space between the values.\n\nConstraints\n\n$0 < n \\leq 10000$\n\n$-1000000 \\leq a_i \\leq 1000000$\n\nSample Input\n\n5\n10 1 5 4 17\n\nSample Output\n\n1 17 37", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 597, "cpu_time_ms": 200, "memory_kb": 43068}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s931194202", "group_id": "codeNet:p02403", "input_text": "import java.util.Scanner;\nclass Main {\n\tint W = 0,H = 0,I = 0,F = 0;\n\tpublic void pr() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tH = sc.nextInt();\n\t\tW = sc.nextInt();\n\t\twhile(H != 0 || W != 0) {\n\t\t\tfor(I = 0;I < H; I++) {\n\t\t\t\tfor(F = 0;F < W; F++) {\n\t\t\t\t\tSystem.out.print(\"#\");\n\t\t\t\t\tif(F == W-1) {\n\t\t\t\t\t\tSystem.out.println();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\tH = sc.nextInt();\n\t\t\tW = sc.nextInt();\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tnew Main().pr();\n\t}\n}", "language": "Java", "metadata": {"date": 1423275106, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02403.html", "problem_id": "p02403", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02403/input.txt", "sample_output_relpath": "derived/input_output/data/p02403/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02403/Java/s931194202.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s931194202", "user_id": "u991553323"}, "prompt_components": {"gold_output": "####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##\n", "input_to_evaluate": "import java.util.Scanner;\nclass Main {\n\tint W = 0,H = 0,I = 0,F = 0;\n\tpublic void pr() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tH = sc.nextInt();\n\t\tW = sc.nextInt();\n\t\twhile(H != 0 || W != 0) {\n\t\t\tfor(I = 0;I < H; I++) {\n\t\t\t\tfor(F = 0;F < W; F++) {\n\t\t\t\t\tSystem.out.print(\"#\");\n\t\t\t\t\tif(F == W-1) {\n\t\t\t\t\t\tSystem.out.println();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\tH = sc.nextInt();\n\t\t\tW = sc.nextInt();\n\t\t}\n\t}\n\tpublic static void main(String[] args) {\n\t\tnew Main().pr();\n\t}\n}", "problem_context": "Print a Rectangle\n\nDraw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers H and W separated by a single space.\n\nThe input ends with two 0 (when both H and W are zero).\n\nOutput\n\nFor each dataset, print the rectangle made of H × W '#'.\n\nPrint a blank line after each dataset.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n1 ≤ W ≤ 300\n\nSample Input\n\n3 4\n5 6\n2 2\n0 0\n\nSample Output\n\n####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##", "sample_input": "3 4\n5 6\n2 2\n0 0\n"}, "reference_outputs": ["####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##\n"], "source_document_id": "p02403", "source_text": "Print a Rectangle\n\nDraw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers H and W separated by a single space.\n\nThe input ends with two 0 (when both H and W are zero).\n\nOutput\n\nFor each dataset, print the rectangle made of H × W '#'.\n\nPrint a blank line after each dataset.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n1 ≤ W ≤ 300\n\nSample Input\n\n3 4\n5 6\n2 2\n0 0\n\nSample Output\n\n####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 485, "cpu_time_ms": 260, "memory_kb": 26792}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s536614323", "group_id": "codeNet:p02403", "input_text": "import java.io.BufferedInputStream;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(new BufferedInputStream(System.in));\n\t\tList output = new ArrayList();\n\t\twhile (scan.hasNext()) {\n\t\t\tString input = scan.nextLine();\n\t\t\tString[] in = input.split(\" \");\n\t\t\tint H = Integer.parseInt(in[0]);\n\t\t\tint W = Integer.parseInt(in[1]);\n\t\t\tif (H == 0 && W == 0) {\n\t\t\t\tbreak;\n\t\t\t} else {\n\t\t\t\tif (H >= 1 && H <= 300 && W >= 1 && W <= 300) {\n\t\t\t\t\tfor (int i = 1; i <= H; i++) {\n\t\t\t\t\t\tString result = \"\";\n\t\t\t\t\t\tfor (int j = 1; j <= W; j++) {\n\t\t\t\t\t\t\tresult += \"#\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\toutput.add(result);\n\t\t\t\t\t}\n\t\t\t\t\toutput.add(System.lineSeparator());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (String out : output) {\n\t\t\tSystem.out.println(out);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1509343854, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02403.html", "problem_id": "p02403", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02403/input.txt", "sample_output_relpath": "derived/input_output/data/p02403/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02403/Java/s536614323.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s536614323", "user_id": "u869220797"}, "prompt_components": {"gold_output": "####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##\n", "input_to_evaluate": "import java.io.BufferedInputStream;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(new BufferedInputStream(System.in));\n\t\tList output = new ArrayList();\n\t\twhile (scan.hasNext()) {\n\t\t\tString input = scan.nextLine();\n\t\t\tString[] in = input.split(\" \");\n\t\t\tint H = Integer.parseInt(in[0]);\n\t\t\tint W = Integer.parseInt(in[1]);\n\t\t\tif (H == 0 && W == 0) {\n\t\t\t\tbreak;\n\t\t\t} else {\n\t\t\t\tif (H >= 1 && H <= 300 && W >= 1 && W <= 300) {\n\t\t\t\t\tfor (int i = 1; i <= H; i++) {\n\t\t\t\t\t\tString result = \"\";\n\t\t\t\t\t\tfor (int j = 1; j <= W; j++) {\n\t\t\t\t\t\t\tresult += \"#\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\toutput.add(result);\n\t\t\t\t\t}\n\t\t\t\t\toutput.add(System.lineSeparator());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (String out : output) {\n\t\t\tSystem.out.println(out);\n\t\t}\n\t}\n}", "problem_context": "Print a Rectangle\n\nDraw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers H and W separated by a single space.\n\nThe input ends with two 0 (when both H and W are zero).\n\nOutput\n\nFor each dataset, print the rectangle made of H × W '#'.\n\nPrint a blank line after each dataset.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n1 ≤ W ≤ 300\n\nSample Input\n\n3 4\n5 6\n2 2\n0 0\n\nSample Output\n\n####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##", "sample_input": "3 4\n5 6\n2 2\n0 0\n"}, "reference_outputs": ["####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##\n"], "source_document_id": "p02403", "source_text": "Print a Rectangle\n\nDraw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers H and W separated by a single space.\n\nThe input ends with two 0 (when both H and W are zero).\n\nOutput\n\nFor each dataset, print the rectangle made of H × W '#'.\n\nPrint a blank line after each dataset.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n1 ≤ W ≤ 300\n\nSample Input\n\n3 4\n5 6\n2 2\n0 0\n\nSample Output\n\n####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 846, "cpu_time_ms": 60, "memory_kb": 25956}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s829657740", "group_id": "codeNet:p02403", "input_text": "import java.util.Scanner;\n\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint[] h = new int[100];\n\t\tint[] w = new int[100];\n\n\t\tint numData;\n\t\tfor (int i = 0; ; i++)\n\t\t{\n\t\t\tint tempH = sc.nextInt();\n\t\t\tint tempW = sc.nextInt();\n\n\t\t\tif (tempH == 0 && tempW == 0)\n\t\t\t{\n\t\t\t\tnumData = i;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\th[i] = tempH;\n\t\t\tw[i] = tempW;\n\t\t}\n\n\t\tfor (int i = 0; i < numData; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < h[i]; j++)\n\t\t\t{\n\t\t\t\tfor (int k = 0; k < w[i]; k++)\n\t\t\t\t{\n\t\t\t\t\tSystem.out.print(\"#\");\n\t\t\t\t}\n\t\t\t\tSystem.out.println(\"\");\n\t\t\t}\n\t\t\tSystem.out.println(\"\");\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1523853513, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02403.html", "problem_id": "p02403", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02403/input.txt", "sample_output_relpath": "derived/input_output/data/p02403/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02403/Java/s829657740.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s829657740", "user_id": "u688860661"}, "prompt_components": {"gold_output": "####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint[] h = new int[100];\n\t\tint[] w = new int[100];\n\n\t\tint numData;\n\t\tfor (int i = 0; ; i++)\n\t\t{\n\t\t\tint tempH = sc.nextInt();\n\t\t\tint tempW = sc.nextInt();\n\n\t\t\tif (tempH == 0 && tempW == 0)\n\t\t\t{\n\t\t\t\tnumData = i;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\th[i] = tempH;\n\t\t\tw[i] = tempW;\n\t\t}\n\n\t\tfor (int i = 0; i < numData; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < h[i]; j++)\n\t\t\t{\n\t\t\t\tfor (int k = 0; k < w[i]; k++)\n\t\t\t\t{\n\t\t\t\t\tSystem.out.print(\"#\");\n\t\t\t\t}\n\t\t\t\tSystem.out.println(\"\");\n\t\t\t}\n\t\t\tSystem.out.println(\"\");\n\t\t}\n\t}\n}\n", "problem_context": "Print a Rectangle\n\nDraw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers H and W separated by a single space.\n\nThe input ends with two 0 (when both H and W are zero).\n\nOutput\n\nFor each dataset, print the rectangle made of H × W '#'.\n\nPrint a blank line after each dataset.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n1 ≤ W ≤ 300\n\nSample Input\n\n3 4\n5 6\n2 2\n0 0\n\nSample Output\n\n####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##", "sample_input": "3 4\n5 6\n2 2\n0 0\n"}, "reference_outputs": ["####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##\n"], "source_document_id": "p02403", "source_text": "Print a Rectangle\n\nDraw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers H and W separated by a single space.\n\nThe input ends with two 0 (when both H and W are zero).\n\nOutput\n\nFor each dataset, print the rectangle made of H × W '#'.\n\nPrint a blank line after each dataset.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n1 ≤ W ≤ 300\n\nSample Input\n\n3 4\n5 6\n2 2\n0 0\n\nSample Output\n\n####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 620, "cpu_time_ms": 250, "memory_kb": 35472}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s586569424", "group_id": "codeNet:p02403", "input_text": "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[]args){\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint width, height;\n\t\tint w, h;\n\n\t\theight = sc.nextInt();\n\t\twidth = sc.nextInt();\n\n\t\twhile(height != 0 || width != 0){\n\t\t\tfor(h = 0;h < height;h++){\n\t\t\t\tfor(w = 0;w < width;w++){\n\t\t\t\t\tSystem.out.print(\"#\");\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t\theight = sc.nextInt();\n\t\t\twidth = sc.nextInt();\n\t\t}\n\t\tSystem.out.println();\n\n\t}\n}\n", "language": "Java", "metadata": {"date": 1523853615, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02403.html", "problem_id": "p02403", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02403/input.txt", "sample_output_relpath": "derived/input_output/data/p02403/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02403/Java/s586569424.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s586569424", "user_id": "u313021086"}, "prompt_components": {"gold_output": "####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main{\n\tpublic static void main(String[]args){\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint width, height;\n\t\tint w, h;\n\n\t\theight = sc.nextInt();\n\t\twidth = sc.nextInt();\n\n\t\twhile(height != 0 || width != 0){\n\t\t\tfor(h = 0;h < height;h++){\n\t\t\t\tfor(w = 0;w < width;w++){\n\t\t\t\t\tSystem.out.print(\"#\");\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t\theight = sc.nextInt();\n\t\t\twidth = sc.nextInt();\n\t\t}\n\t\tSystem.out.println();\n\n\t}\n}\n", "problem_context": "Print a Rectangle\n\nDraw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers H and W separated by a single space.\n\nThe input ends with two 0 (when both H and W are zero).\n\nOutput\n\nFor each dataset, print the rectangle made of H × W '#'.\n\nPrint a blank line after each dataset.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n1 ≤ W ≤ 300\n\nSample Input\n\n3 4\n5 6\n2 2\n0 0\n\nSample Output\n\n####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##", "sample_input": "3 4\n5 6\n2 2\n0 0\n"}, "reference_outputs": ["####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##\n"], "source_document_id": "p02403", "source_text": "Print a Rectangle\n\nDraw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers H and W separated by a single space.\n\nThe input ends with two 0 (when both H and W are zero).\n\nOutput\n\nFor each dataset, print the rectangle made of H × W '#'.\n\nPrint a blank line after each dataset.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n1 ≤ W ≤ 300\n\nSample Input\n\n3 4\n5 6\n2 2\n0 0\n\nSample Output\n\n####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 481, "cpu_time_ms": 60, "memory_kb": 26228}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s469499512", "group_id": "codeNet:p02403", "input_text": "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner stdInt = new Scanner(System.in);\n\n int[][] ans = new int[300][2]; //int[][] の方にh,w代入\n int i = 0;\n while(true) {\n int h, w;\n h = stdInt.nextInt();\n w = stdInt.nextInt();\n if (h == 0 && w == 0) break;\n ans[i][0] = h;\n ans[i++][1] = w;\n }\n\n for (int j = 0; j < i; j++) {\n for (int k = 0; k < ans[j][0]; k++) {\n for (int l = 0; l < ans[j][1]; l++) {\n System.out.print(\"#\");\n }\n System.out.println();\n }\n System.out.println();\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1589778477, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02403.html", "problem_id": "p02403", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02403/input.txt", "sample_output_relpath": "derived/input_output/data/p02403/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02403/Java/s469499512.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s469499512", "user_id": "u450543015"}, "prompt_components": {"gold_output": "####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner stdInt = new Scanner(System.in);\n\n int[][] ans = new int[300][2]; //int[][] の方にh,w代入\n int i = 0;\n while(true) {\n int h, w;\n h = stdInt.nextInt();\n w = stdInt.nextInt();\n if (h == 0 && w == 0) break;\n ans[i][0] = h;\n ans[i++][1] = w;\n }\n\n for (int j = 0; j < i; j++) {\n for (int k = 0; k < ans[j][0]; k++) {\n for (int l = 0; l < ans[j][1]; l++) {\n System.out.print(\"#\");\n }\n System.out.println();\n }\n System.out.println();\n }\n }\n}\n", "problem_context": "Print a Rectangle\n\nDraw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers H and W separated by a single space.\n\nThe input ends with two 0 (when both H and W are zero).\n\nOutput\n\nFor each dataset, print the rectangle made of H × W '#'.\n\nPrint a blank line after each dataset.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n1 ≤ W ≤ 300\n\nSample Input\n\n3 4\n5 6\n2 2\n0 0\n\nSample Output\n\n####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##", "sample_input": "3 4\n5 6\n2 2\n0 0\n"}, "reference_outputs": ["####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##\n"], "source_document_id": "p02403", "source_text": "Print a Rectangle\n\nDraw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.\n\nInput\n\nThe input consists of multiple datasets. Each dataset consists of two integers H and W separated by a single space.\n\nThe input ends with two 0 (when both H and W are zero).\n\nOutput\n\nFor each dataset, print the rectangle made of H × W '#'.\n\nPrint a blank line after each dataset.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n1 ≤ W ≤ 300\n\nSample Input\n\n3 4\n5 6\n2 2\n0 0\n\nSample Output\n\n####\n####\n####\n\n######\n######\n######\n######\n######\n\n##\n##", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 625, "cpu_time_ms": 240, "memory_kb": 35144}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s640184477", "group_id": "codeNet:p02404", "input_text": "import java.io.*;\npublic class Main{\n\tpublic static void main(String[] args)throws Exception{\n\t\tBufferedReader input=new BufferedReader(new InputStreamReader(System.in));\n\t\tStringBuilder sb=new StringBuilder();\n\t\twhile(true){\n\t\tString str=input.readLine();\n\t\tString[] arr=str.split(\" \");\n\t\tint h=Integer.parseInt(arr[0]);\t\n\t\tint w=Integer.parseInt(arr[1]);\n\t\tif(h==0&&w==0){\n\t\t\tbreak;\n\t\t}\n\t\n\t\tfor(int i=0;i0);\n}\nSystem.out.println(); \n}}\n\n", "language": "Java", "metadata": {"date": 1530682506, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02406.html", "problem_id": "p02406", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02406/input.txt", "sample_output_relpath": "derived/input_output/data/p02406/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02406/Java/s382628085.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s382628085", "user_id": "u359846519"}, "prompt_components": {"gold_output": " 3 6 9 12 13 15 18 21 23 24 27 30\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main {\n private static int a,in;\n public static void main(String[] args){\n \n Scanner s = new Scanner(System.in);\n \nin= s.nextInt();\nfor(int i= 1;i<=in;i=i++)\n{\n a=i;\nif(a%3==0){\n System.out.print(\" \"+a);\n continue;\n \n}do{\n if(a%10 == 3){\n System.out.print(\" \"+i);\n break;\n }\n a/=10;\n}while(a>0);\n}\nSystem.out.println(); \n}}\n\n", "problem_context": "Structured Programming\n\nIn programming languages like C/C++, a goto statement provides an unconditional jump from the \"goto\" to a labeled statement. For example, a statement \"goto CHECK_NUM;\" is executed, control of the program jumps to CHECK_NUM. Using these constructs, you can implement, for example, loops.\n\nNote that use of goto statement is highly discouraged, because it is difficult to trace the control flow of a program which includes goto.\n\nWrite a program which does precisely the same thing as the following program (this example is wrtten in C++). Let's try to write the program without goto statements.\n\nvoid call(int n){\nint i = 1;\nCHECK_NUM:\nint x = i;\nif ( x % 3 == 0 ){\ncout << \" \" << i;\ngoto END_CHECK_NUM;\n}\nINCLUDE3:\nif ( x % 10 == 3 ){\ncout << \" \" << i;\ngoto END_CHECK_NUM;\n}\nx /= 10;\nif ( x ) goto INCLUDE3;\nEND_CHECK_NUM:\nif ( ++i <= n ) goto CHECK_NUM;\n\ncout << endl;\n}\n\nInput\n\nAn integer n is given in a line.\n\nOutput\n\nPrint the output result of the above program for given integer n.\n\nConstraints\n\n3 ≤ n ≤ 10000\n\nSample Input\n\n30\n\nSample Output\n\n3 6 9 12 13 15 18 21 23 24 27 30\n\nPut a single space character before each element.", "sample_input": "30\n"}, "reference_outputs": [" 3 6 9 12 13 15 18 21 23 24 27 30\n"], "source_document_id": "p02406", "source_text": "Structured Programming\n\nIn programming languages like C/C++, a goto statement provides an unconditional jump from the \"goto\" to a labeled statement. For example, a statement \"goto CHECK_NUM;\" is executed, control of the program jumps to CHECK_NUM. Using these constructs, you can implement, for example, loops.\n\nNote that use of goto statement is highly discouraged, because it is difficult to trace the control flow of a program which includes goto.\n\nWrite a program which does precisely the same thing as the following program (this example is wrtten in C++). Let's try to write the program without goto statements.\n\nvoid call(int n){\nint i = 1;\nCHECK_NUM:\nint x = i;\nif ( x % 3 == 0 ){\ncout << \" \" << i;\ngoto END_CHECK_NUM;\n}\nINCLUDE3:\nif ( x % 10 == 3 ){\ncout << \" \" << i;\ngoto END_CHECK_NUM;\n}\nx /= 10;\nif ( x ) goto INCLUDE3;\nEND_CHECK_NUM:\nif ( ++i <= n ) goto CHECK_NUM;\n\ncout << endl;\n}\n\nInput\n\nAn integer n is given in a line.\n\nOutput\n\nPrint the output result of the above program for given integer n.\n\nConstraints\n\n3 ≤ n ≤ 10000\n\nSample Input\n\n30\n\nSample Output\n\n3 6 9 12 13 15 18 21 23 24 27 30\n\nPut a single space character before each element.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 413, "cpu_time_ms": 4000, "memory_kb": 26528}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s368846041", "group_id": "codeNet:p02407", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\n\nclass Main {\n public static void main(String args[]) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringBuilder sb = new StringBuilder();\n\n int n = Integer.parseInt(br.readLine());\n String[] str = br.readLine().split(\" \");\n\n for (int i = n - 1; i >= 0; i--) {\n sb.append(str[i] + \" \");\n }\n int a = sb.length();\n sb.deleteCharAt(a-1);\n System.out.println(sb);\n }\n}", "language": "Java", "metadata": {"date": 1460513357, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02407.html", "problem_id": "p02407", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02407/input.txt", "sample_output_relpath": "derived/input_output/data/p02407/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02407/Java/s368846041.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s368846041", "user_id": "u527848444"}, "prompt_components": {"gold_output": "5 4 3 2 1\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\n\nclass Main {\n public static void main(String args[]) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringBuilder sb = new StringBuilder();\n\n int n = Integer.parseInt(br.readLine());\n String[] str = br.readLine().split(\" \");\n\n for (int i = n - 1; i >= 0; i--) {\n sb.append(str[i] + \" \");\n }\n int a = sb.length();\n sb.deleteCharAt(a-1);\n System.out.println(sb);\n }\n}", "problem_context": "Reversing Numbers\n\nWrite a program which reads a sequence and prints it in the reverse order.\n\nInput\n\nThe input is given in the following format:\n\nn\na1 a2 . . . an\n\nn is the size of the sequence and ai is the ith element of the sequence.\n\nOutput\n\nPrint the reversed sequence in a line. Print a single space character between adjacent elements (Note that your program should not put a space character after the last element).\n\nConstraints\n\nn ≤ 100\n\n0 ≤ ai < 1000\n\nSample Input 1\n\n5\n1 2 3 4 5\n\nSample Output 1\n\n5 4 3 2 1\n\nSample Input 2\n\n8\n3 3 4 4 5 8 7 9\n\nSample Output 2\n\n9 7 8 5 4 4 3 3\n\nNote\n\n      解説", "sample_input": "5\n1 2 3 4 5\n"}, "reference_outputs": ["5 4 3 2 1\n"], "source_document_id": "p02407", "source_text": "Reversing Numbers\n\nWrite a program which reads a sequence and prints it in the reverse order.\n\nInput\n\nThe input is given in the following format:\n\nn\na1 a2 . . . an\n\nn is the size of the sequence and ai is the ith element of the sequence.\n\nOutput\n\nPrint the reversed sequence in a line. Print a single space character between adjacent elements (Note that your program should not put a space character after the last element).\n\nConstraints\n\nn ≤ 100\n\n0 ≤ ai < 1000\n\nSample Input 1\n\n5\n1 2 3 4 5\n\nSample Output 1\n\n5 4 3 2 1\n\nSample Input 2\n\n8\n3 3 4 4 5 8 7 9\n\nSample Output 2\n\n9 7 8 5 4 4 3 3\n\nNote\n\n      解説", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 589, "cpu_time_ms": 40, "memory_kb": 24268}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s937330739", "group_id": "codeNet:p02409", "input_text": "import java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int[][] tow1 = new int[3][10];\n int[][] tow2 = new int[3][10];\n int[][] tow3 = new int[3][10];\n int[][] tow4 = new int[3][10];\n int b = 0, f = 0, r = 0, v = 0;\n int num = sc.nextInt();\n\n for (int i = 0; i < num; i++) {\n b = sc.nextInt();\n f = sc.nextInt()-1;\n r = sc.nextInt()-1;\n v = sc.nextInt();\n if (b == 1) {\n tow1[f][r] += v;\n } else if (b == 2) {\n tow2[f][r] += v;\n } else if (b == 3) {\n tow3[f][r] += v;\n } else if (b == 4) {\n tow4[f][r] += v;\n }\n \n }\n for (int i = 2; i <= 0; i--) {\n for (int j = 0; j < 10; j++) {\n System.out.printf(\"%d\", tow1[i][j]);\n }\n System.out.println();\n }\n System.out.println(\"####################\");\n for (int i = 2; i <= 0; i--) {\n for (int j = 0; j < 10; j++) {\n System.out.printf(\"%d\", tow2[i][j]);\n }\n System.out.println();\n }\n System.out.println(\"####################\");\n for (int i = 2; i <= 0; i--) {\n for (int j = 0; j < 10; j++) {\n System.out.printf(\"%d\", tow3[i][j]);\n }\n System.out.println();\n }\n System.out.println(\"####################\");\n for (int i = 2; i <= 0; i--) {\n for (int j = 0; j < 10; j++) {\n System.out.printf(\"%d\", tow4[i][j]);\n }\n System.out.println();\n }\n\n sc.close();\n }\n}\n", "language": "Java", "metadata": {"date": 1556614178, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02409.html", "problem_id": "p02409", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02409/input.txt", "sample_output_relpath": "derived/input_output/data/p02409/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02409/Java/s937330739.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s937330739", "user_id": "u191528184"}, "prompt_components": {"gold_output": " 0 0 8 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 7 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 1 0 0\n", "input_to_evaluate": "import java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int[][] tow1 = new int[3][10];\n int[][] tow2 = new int[3][10];\n int[][] tow3 = new int[3][10];\n int[][] tow4 = new int[3][10];\n int b = 0, f = 0, r = 0, v = 0;\n int num = sc.nextInt();\n\n for (int i = 0; i < num; i++) {\n b = sc.nextInt();\n f = sc.nextInt()-1;\n r = sc.nextInt()-1;\n v = sc.nextInt();\n if (b == 1) {\n tow1[f][r] += v;\n } else if (b == 2) {\n tow2[f][r] += v;\n } else if (b == 3) {\n tow3[f][r] += v;\n } else if (b == 4) {\n tow4[f][r] += v;\n }\n \n }\n for (int i = 2; i <= 0; i--) {\n for (int j = 0; j < 10; j++) {\n System.out.printf(\"%d\", tow1[i][j]);\n }\n System.out.println();\n }\n System.out.println(\"####################\");\n for (int i = 2; i <= 0; i--) {\n for (int j = 0; j < 10; j++) {\n System.out.printf(\"%d\", tow2[i][j]);\n }\n System.out.println();\n }\n System.out.println(\"####################\");\n for (int i = 2; i <= 0; i--) {\n for (int j = 0; j < 10; j++) {\n System.out.printf(\"%d\", tow3[i][j]);\n }\n System.out.println();\n }\n System.out.println(\"####################\");\n for (int i = 2; i <= 0; i--) {\n for (int j = 0; j < 10; j++) {\n System.out.printf(\"%d\", tow4[i][j]);\n }\n System.out.println();\n }\n\n sc.close();\n }\n}\n", "problem_context": "Official House\n\nYou manage 4 buildings, each of which has 3 floors, each of which consists of 10 rooms. Write a program which reads a sequence of tenant/leaver notices, and reports the number of tenants for each room.\n\nFor each notice, you are given four integers b, f, r and v which represent that v persons entered to room r of fth floor at building b. If v is negative, it means that −v persons left.\n\nAssume that initially no person lives in the building.\n\nInput\n\nIn the first line, the number of notices n is given. In the following n lines, a set of four integers b, f, r and v which represents ith notice is given in a line.\n\nOutput\n\nFor each building, print the information of 1st, 2nd and 3rd floor in this order. For each floor information, print the number of tenants of 1st, 2nd, .. and 10th room in this order. Print a single space character before the number of tenants. Print \"####################\" (20 '#') between buildings.\n\nConstraints\n\nNo incorrect building, floor and room numbers are given.\n\n0 ≤ the number of tenants during the management ≤ 9\n\nSample Input\n\n3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n\nSample Output\n\n0 0 8 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 7 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 1 0 0", "sample_input": "3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n"}, "reference_outputs": [" 0 0 8 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 7 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 1 0 0\n"], "source_document_id": "p02409", "source_text": "Official House\n\nYou manage 4 buildings, each of which has 3 floors, each of which consists of 10 rooms. Write a program which reads a sequence of tenant/leaver notices, and reports the number of tenants for each room.\n\nFor each notice, you are given four integers b, f, r and v which represent that v persons entered to room r of fth floor at building b. If v is negative, it means that −v persons left.\n\nAssume that initially no person lives in the building.\n\nInput\n\nIn the first line, the number of notices n is given. In the following n lines, a set of four integers b, f, r and v which represents ith notice is given in a line.\n\nOutput\n\nFor each building, print the information of 1st, 2nd and 3rd floor in this order. For each floor information, print the number of tenants of 1st, 2nd, .. and 10th room in this order. Print a single space character before the number of tenants. Print \"####################\" (20 '#') between buildings.\n\nConstraints\n\nNo incorrect building, floor and room numbers are given.\n\n0 ≤ the number of tenants during the management ≤ 9\n\nSample Input\n\n3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n\nSample Output\n\n0 0 8 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 7 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 1 0 0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1778, "cpu_time_ms": 50, "memory_kb": 26172}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s491297312", "group_id": "codeNet:p02409", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint[][][] ar = new int[4][3][10];\n\t\tfor ( int i = 0; i < n; i++) {\n\t\t\tint b = scan.nextInt();\n\t\t\tint f = scan.nextInt();\n\t\t\tint r = scan.nextInt();\n\t\t\tint v = scan.nextInt();\n\t\t\tar[b-1][f-1][r-1] += v;\n\t\t}\n\t\tfor (int b = 0; b < 4; b++) {\n\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\tfor(int j = 0; j < 10; j++){\n\t\t\t\t\tif (j != 9) {\n\t\t\t\t\t\tSystem.out.print(ar[b][i][j] + \" \");\n\t\t\t\t\t}else {\n\t\t\t\t\t\tSystem.out.print(ar[b][i][j] + \"\\n\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(\"####################\");\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1477116098, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02409.html", "problem_id": "p02409", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02409/input.txt", "sample_output_relpath": "derived/input_output/data/p02409/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02409/Java/s491297312.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s491297312", "user_id": "u938767283"}, "prompt_components": {"gold_output": " 0 0 8 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 7 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 1 0 0\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tint[][][] ar = new int[4][3][10];\n\t\tfor ( int i = 0; i < n; i++) {\n\t\t\tint b = scan.nextInt();\n\t\t\tint f = scan.nextInt();\n\t\t\tint r = scan.nextInt();\n\t\t\tint v = scan.nextInt();\n\t\t\tar[b-1][f-1][r-1] += v;\n\t\t}\n\t\tfor (int b = 0; b < 4; b++) {\n\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\tfor(int j = 0; j < 10; j++){\n\t\t\t\t\tif (j != 9) {\n\t\t\t\t\t\tSystem.out.print(ar[b][i][j] + \" \");\n\t\t\t\t\t}else {\n\t\t\t\t\t\tSystem.out.print(ar[b][i][j] + \"\\n\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(\"####################\");\n\t\t}\n\t}\n}", "problem_context": "Official House\n\nYou manage 4 buildings, each of which has 3 floors, each of which consists of 10 rooms. Write a program which reads a sequence of tenant/leaver notices, and reports the number of tenants for each room.\n\nFor each notice, you are given four integers b, f, r and v which represent that v persons entered to room r of fth floor at building b. If v is negative, it means that −v persons left.\n\nAssume that initially no person lives in the building.\n\nInput\n\nIn the first line, the number of notices n is given. In the following n lines, a set of four integers b, f, r and v which represents ith notice is given in a line.\n\nOutput\n\nFor each building, print the information of 1st, 2nd and 3rd floor in this order. For each floor information, print the number of tenants of 1st, 2nd, .. and 10th room in this order. Print a single space character before the number of tenants. Print \"####################\" (20 '#') between buildings.\n\nConstraints\n\nNo incorrect building, floor and room numbers are given.\n\n0 ≤ the number of tenants during the management ≤ 9\n\nSample Input\n\n3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n\nSample Output\n\n0 0 8 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 7 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 1 0 0", "sample_input": "3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n"}, "reference_outputs": [" 0 0 8 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 7 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 1 0 0\n"], "source_document_id": "p02409", "source_text": "Official House\n\nYou manage 4 buildings, each of which has 3 floors, each of which consists of 10 rooms. Write a program which reads a sequence of tenant/leaver notices, and reports the number of tenants for each room.\n\nFor each notice, you are given four integers b, f, r and v which represent that v persons entered to room r of fth floor at building b. If v is negative, it means that −v persons left.\n\nAssume that initially no person lives in the building.\n\nInput\n\nIn the first line, the number of notices n is given. In the following n lines, a set of four integers b, f, r and v which represents ith notice is given in a line.\n\nOutput\n\nFor each building, print the information of 1st, 2nd and 3rd floor in this order. For each floor information, print the number of tenants of 1st, 2nd, .. and 10th room in this order. Print a single space character before the number of tenants. Print \"####################\" (20 '#') between buildings.\n\nConstraints\n\nNo incorrect building, floor and room numbers are given.\n\n0 ≤ the number of tenants during the management ≤ 9\n\nSample Input\n\n3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n\nSample Output\n\n0 0 8 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 7 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 1 0 0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 654, "cpu_time_ms": 60, "memory_kb": 26252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s365451930", "group_id": "codeNet:p02409", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n String line = br.readLine();\n int num = Integer.parseInt(line);\n int[][][] numAry = new int[4][3][10];\n\n //????????????\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < 3; j++) {\n for (int k = 0; k < 10; k++) {\n numAry[i][j][k] = 0;\n }\n }\n }\n\n //input?????£??\\\n for (int i = 0; i < num; i ++) {\n String[] aryInput = br.readLine().split(\" \");\n\n int a = Integer.parseInt(aryInput[0]);\n int b = Integer.parseInt(aryInput[1]);\n int c = Integer.parseInt(aryInput[2]);\n\n numAry[a - 1][b - 1][c - 1] = Integer.parseInt(aryInput[3]);\n }\n\n for(int i = 0; i < 4; i++){\n for (int j = 0; j < 3; j++) {\n for (int k = 0; k < 10; k++) {\n System.out.print(numAry[i][j][k]);\n }\n System.out.println(\"\");\n }\n if(i != 3){\n System.out.println(\"##########\");\n }\n }\n\n }\n}", "language": "Java", "metadata": {"date": 1484042712, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02409.html", "problem_id": "p02409", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02409/input.txt", "sample_output_relpath": "derived/input_output/data/p02409/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02409/Java/s365451930.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s365451930", "user_id": "u111312636"}, "prompt_components": {"gold_output": " 0 0 8 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 7 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 1 0 0\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n String line = br.readLine();\n int num = Integer.parseInt(line);\n int[][][] numAry = new int[4][3][10];\n\n //????????????\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < 3; j++) {\n for (int k = 0; k < 10; k++) {\n numAry[i][j][k] = 0;\n }\n }\n }\n\n //input?????£??\\\n for (int i = 0; i < num; i ++) {\n String[] aryInput = br.readLine().split(\" \");\n\n int a = Integer.parseInt(aryInput[0]);\n int b = Integer.parseInt(aryInput[1]);\n int c = Integer.parseInt(aryInput[2]);\n\n numAry[a - 1][b - 1][c - 1] = Integer.parseInt(aryInput[3]);\n }\n\n for(int i = 0; i < 4; i++){\n for (int j = 0; j < 3; j++) {\n for (int k = 0; k < 10; k++) {\n System.out.print(numAry[i][j][k]);\n }\n System.out.println(\"\");\n }\n if(i != 3){\n System.out.println(\"##########\");\n }\n }\n\n }\n}", "problem_context": "Official House\n\nYou manage 4 buildings, each of which has 3 floors, each of which consists of 10 rooms. Write a program which reads a sequence of tenant/leaver notices, and reports the number of tenants for each room.\n\nFor each notice, you are given four integers b, f, r and v which represent that v persons entered to room r of fth floor at building b. If v is negative, it means that −v persons left.\n\nAssume that initially no person lives in the building.\n\nInput\n\nIn the first line, the number of notices n is given. In the following n lines, a set of four integers b, f, r and v which represents ith notice is given in a line.\n\nOutput\n\nFor each building, print the information of 1st, 2nd and 3rd floor in this order. For each floor information, print the number of tenants of 1st, 2nd, .. and 10th room in this order. Print a single space character before the number of tenants. Print \"####################\" (20 '#') between buildings.\n\nConstraints\n\nNo incorrect building, floor and room numbers are given.\n\n0 ≤ the number of tenants during the management ≤ 9\n\nSample Input\n\n3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n\nSample Output\n\n0 0 8 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 7 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 1 0 0", "sample_input": "3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n"}, "reference_outputs": [" 0 0 8 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 7 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 1 0 0\n"], "source_document_id": "p02409", "source_text": "Official House\n\nYou manage 4 buildings, each of which has 3 floors, each of which consists of 10 rooms. Write a program which reads a sequence of tenant/leaver notices, and reports the number of tenants for each room.\n\nFor each notice, you are given four integers b, f, r and v which represent that v persons entered to room r of fth floor at building b. If v is negative, it means that −v persons left.\n\nAssume that initially no person lives in the building.\n\nInput\n\nIn the first line, the number of notices n is given. In the following n lines, a set of four integers b, f, r and v which represents ith notice is given in a line.\n\nOutput\n\nFor each building, print the information of 1st, 2nd and 3rd floor in this order. For each floor information, print the number of tenants of 1st, 2nd, .. and 10th room in this order. Print a single space character before the number of tenants. Print \"####################\" (20 '#') between buildings.\n\nConstraints\n\nNo incorrect building, floor and room numbers are given.\n\n0 ≤ the number of tenants during the management ≤ 9\n\nSample Input\n\n3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n\nSample Output\n\n0 0 8 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 7 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 1 0 0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1313, "cpu_time_ms": 40, "memory_kb": 24036}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s587763831", "group_id": "codeNet:p02409", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[][][] room = new int[4][3][10];\n for (int i = 0; i < n; i++) {\n int[] a = new int[]{sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt()};\n room[a[0] - 1][a[1] - 1][a[2] - 1] = a[3];\n }\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < 3; j++) {\n for (int k = 0; k < 10; k++) {\n System.out.print(\" \" + room[i][j][k]);\n }\n System.out.println();\n }\n if (i != 3) {\n System.out.println(\"####################\");\n }\n }\n }\n}", "language": "Java", "metadata": {"date": 1510400770, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02409.html", "problem_id": "p02409", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02409/input.txt", "sample_output_relpath": "derived/input_output/data/p02409/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02409/Java/s587763831.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s587763831", "user_id": "u734178800"}, "prompt_components": {"gold_output": " 0 0 8 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 7 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 1 0 0\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[][][] room = new int[4][3][10];\n for (int i = 0; i < n; i++) {\n int[] a = new int[]{sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt()};\n room[a[0] - 1][a[1] - 1][a[2] - 1] = a[3];\n }\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < 3; j++) {\n for (int k = 0; k < 10; k++) {\n System.out.print(\" \" + room[i][j][k]);\n }\n System.out.println();\n }\n if (i != 3) {\n System.out.println(\"####################\");\n }\n }\n }\n}", "problem_context": "Official House\n\nYou manage 4 buildings, each of which has 3 floors, each of which consists of 10 rooms. Write a program which reads a sequence of tenant/leaver notices, and reports the number of tenants for each room.\n\nFor each notice, you are given four integers b, f, r and v which represent that v persons entered to room r of fth floor at building b. If v is negative, it means that −v persons left.\n\nAssume that initially no person lives in the building.\n\nInput\n\nIn the first line, the number of notices n is given. In the following n lines, a set of four integers b, f, r and v which represents ith notice is given in a line.\n\nOutput\n\nFor each building, print the information of 1st, 2nd and 3rd floor in this order. For each floor information, print the number of tenants of 1st, 2nd, .. and 10th room in this order. Print a single space character before the number of tenants. Print \"####################\" (20 '#') between buildings.\n\nConstraints\n\nNo incorrect building, floor and room numbers are given.\n\n0 ≤ the number of tenants during the management ≤ 9\n\nSample Input\n\n3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n\nSample Output\n\n0 0 8 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 7 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 1 0 0", "sample_input": "3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n"}, "reference_outputs": [" 0 0 8 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 7 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n####################\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 0 0 0\n 0 0 0 0 0 0 0 1 0 0\n"], "source_document_id": "p02409", "source_text": "Official House\n\nYou manage 4 buildings, each of which has 3 floors, each of which consists of 10 rooms. Write a program which reads a sequence of tenant/leaver notices, and reports the number of tenants for each room.\n\nFor each notice, you are given four integers b, f, r and v which represent that v persons entered to room r of fth floor at building b. If v is negative, it means that −v persons left.\n\nAssume that initially no person lives in the building.\n\nInput\n\nIn the first line, the number of notices n is given. In the following n lines, a set of four integers b, f, r and v which represents ith notice is given in a line.\n\nOutput\n\nFor each building, print the information of 1st, 2nd and 3rd floor in this order. For each floor information, print the number of tenants of 1st, 2nd, .. and 10th room in this order. Print a single space character before the number of tenants. Print \"####################\" (20 '#') between buildings.\n\nConstraints\n\nNo incorrect building, floor and room numbers are given.\n\n0 ≤ the number of tenants during the management ≤ 9\n\nSample Input\n\n3\n1 1 3 8\n3 2 2 7\n4 3 8 1\n\nSample Output\n\n0 0 8 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 7 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n####################\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 1 0 0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 777, "cpu_time_ms": 80, "memory_kb": 26356}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s370953278", "group_id": "codeNet:p02409", "input_text": "import java.util.Scanner;\n\npublic class Main{\n public static void main (String[] args){\n try(Scanner sc = new Scanner(System.in)){\n int n = sc.nextInt();\n int [] rooms = new int[500];\n for(int i=0;i=x) ||(p1==p2)) break;\n\t\t\t\t\tfor(p3=(p2+1);p3<=n;p3++){\n\t\t\t\t\t\tif(((p1+p2+p3)>x)||(p2==p3)){\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}else if((p1+p2+p3)==x){\n\t\t\t\t\t\t\tcnt++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}//for\t\n\t\t\t\t}//for\n\t\t\t}//for\n\t\t\tSystem.out.println(cnt);\n\t\t\tcnt=0;\n\t\t\tn=sc.nextInt();\n\t\t\tx=sc.nextInt();\n\t\t}//while\n\t}\n}", "language": "Java", "metadata": {"date": 1413872730, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02412.html", "problem_id": "p02412", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02412/input.txt", "sample_output_relpath": "derived/input_output/data/p02412/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02412/Java/s909685077.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s909685077", "user_id": "u222807116"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\t\n\t\tint n=sc.nextInt();\n\t\tint x=sc.nextInt();\n\t\tint p1,p2,p3;\n\t\tint cnt=0;\n\t\twhile(n!=0 || x!=0){\n\t\t\tfor(p1=1;p1<=n;p1++){\n\t\t\t\tfor(p2=(p1+1);p2<=n;p2++){\n\t\t\t\t\tif(((p1+p2)>=x) ||(p1==p2)) break;\n\t\t\t\t\tfor(p3=(p2+1);p3<=n;p3++){\n\t\t\t\t\t\tif(((p1+p2+p3)>x)||(p2==p3)){\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}else if((p1+p2+p3)==x){\n\t\t\t\t\t\t\tcnt++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}//for\t\n\t\t\t\t}//for\n\t\t\t}//for\n\t\t\tSystem.out.println(cnt);\n\t\t\tcnt=0;\n\t\t\tn=sc.nextInt();\n\t\t\tx=sc.nextInt();\n\t\t}//while\n\t}\n}", "problem_context": "How many ways?\n\nWrite a program which identifies the number of combinations of three integers which satisfy the following conditions:\n\nYou should select three distinct integers from 1 to n.\n\nA total sum of the three integers is x.\n\nFor example, there are two combinations for n = 5 and x = 9.\n\n1 + 3 + 5 = 9\n\n2 + 3 + 4 = 9\n\nInput\n\nThe input consists of multiple datasets. For each dataset, two integers n and x are given in a line.\n\nThe input ends with two zeros for n and x respectively. Your program should not process for these terminal symbols.\n\nConstraints\n\n3 ≤ n ≤ 100\n\n0 ≤ x ≤ 300\n\nOutput\n\nFor each dataset, print the number of combinations in a line.\n\nSample Input\n\n5 9\n0 0\n\nSample Output\n\n2\n\nNote\n\n      解説", "sample_input": "5 9\n0 0\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02412", "source_text": "How many ways?\n\nWrite a program which identifies the number of combinations of three integers which satisfy the following conditions:\n\nYou should select three distinct integers from 1 to n.\n\nA total sum of the three integers is x.\n\nFor example, there are two combinations for n = 5 and x = 9.\n\n1 + 3 + 5 = 9\n\n2 + 3 + 4 = 9\n\nInput\n\nThe input consists of multiple datasets. For each dataset, two integers n and x are given in a line.\n\nThe input ends with two zeros for n and x respectively. Your program should not process for these terminal symbols.\n\nConstraints\n\n3 ≤ n ≤ 100\n\n0 ≤ x ≤ 300\n\nOutput\n\nFor each dataset, print the number of combinations in a line.\n\nSample Input\n\n5 9\n0 0\n\nSample Output\n\n2\n\nNote\n\n      解説", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 580, "cpu_time_ms": 70, "memory_kb": 19748}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s134963539", "group_id": "codeNet:p02413", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tStringBuilder output = new StringBuilder();\n\t\tint r = scan.nextInt();\n\t\tint c = scan.nextInt();\n\t\tint[][] sheet = new int[r+1][c+1];\n\t\t\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++) {\n\t\t\t\tsheet[i][j] = scan.nextInt();\n\t\t\t}\n\t\t}\n\t\t\n\t\t// 表の端に合計を記録\n\t\tint sum_r = 0;\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++) {\n\t\t\t\tsum_r += sheet[i][j];\n\t\t\t}\n\t\t\tsheet[i][c] = sum_r;\n\t\t\tsum_r = 0;\n\t\t}\n\t\tint sum_c = 0;\n\t\tfor (int j = 0; j < c; j++) {\n\t\t\tfor (int i = 0; i < r; i++) {\n\t\t\t\tsum_c += sheet[i][j];\n\t\t\t}\n\t\t\tsheet[r][j] = sum_c;\n\t\t\tsum_c = 0;\n\t\t}\n\t\tint sum_all = 0;\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tsum_all += sheet[i][c];\n\t\t}\n\t\tsheet[r][c] = sum_all;\n\t\t\n\t\t// 出力\n\t\tfor (int i = 0; i < r+1; i++) {\n\t\t\tfor (int j = 0; j < c+1; j++) {\n\t\t\t\toutput.append(\" \").append(sheet[i][j]);\n\t\t\t}\n\t\t\toutput.append('\\n');\n\t\t}\n\t\tSystem.out.print(output);\n\t\tscan.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1425109418, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02413.html", "problem_id": "p02413", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02413/input.txt", "sample_output_relpath": "derived/input_output/data/p02413/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02413/Java/s134963539.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s134963539", "user_id": "u128811851"}, "prompt_components": {"gold_output": "1 1 3 4 5 14\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 6 19\n8 9 9 13 17 56\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tStringBuilder output = new StringBuilder();\n\t\tint r = scan.nextInt();\n\t\tint c = scan.nextInt();\n\t\tint[][] sheet = new int[r+1][c+1];\n\t\t\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++) {\n\t\t\t\tsheet[i][j] = scan.nextInt();\n\t\t\t}\n\t\t}\n\t\t\n\t\t// 表の端に合計を記録\n\t\tint sum_r = 0;\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++) {\n\t\t\t\tsum_r += sheet[i][j];\n\t\t\t}\n\t\t\tsheet[i][c] = sum_r;\n\t\t\tsum_r = 0;\n\t\t}\n\t\tint sum_c = 0;\n\t\tfor (int j = 0; j < c; j++) {\n\t\t\tfor (int i = 0; i < r; i++) {\n\t\t\t\tsum_c += sheet[i][j];\n\t\t\t}\n\t\t\tsheet[r][j] = sum_c;\n\t\t\tsum_c = 0;\n\t\t}\n\t\tint sum_all = 0;\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tsum_all += sheet[i][c];\n\t\t}\n\t\tsheet[r][c] = sum_all;\n\t\t\n\t\t// 出力\n\t\tfor (int i = 0; i < r+1; i++) {\n\t\t\tfor (int j = 0; j < c+1; j++) {\n\t\t\t\toutput.append(\" \").append(sheet[i][j]);\n\t\t\t}\n\t\t\toutput.append('\\n');\n\t\t}\n\t\tSystem.out.print(output);\n\t\tscan.close();\n\t}\n}", "problem_context": "Spreadsheet\n\nYour task is to perform a simple table calculation.\n\nWrite a program which reads the number of rows r, columns c and a table of r × c elements, and prints a new table, which includes the total sum for each row and column.\n\nInput\n\nIn the first line, two integers r and c are given. Next, the table is given by r lines, each of which consists of c integers separated by space characters.\n\nOutput\n\nPrint the new table of (r+1) × (c+1) elements. Put a single space character between adjacent elements. For each row, print the sum of it's elements in the last column. For each column, print the sum of it's elements in the last row. Print the total sum of the elements at the bottom right corner of the table.\n\nConstraints\n\n1 ≤ r, c ≤ 100\n\n0 ≤ an element of the table ≤ 100\n\nSample Input\n\n4 5\n1 1 3 4 5\n2 2 2 4 5\n3 3 0 1 1\n2 3 4 4 6\n\nSample Output\n\n1 1 3 4 5 14\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 6 19\n8 9 9 13 17 56", "sample_input": "4 5\n1 1 3 4 5\n2 2 2 4 5\n3 3 0 1 1\n2 3 4 4 6\n"}, "reference_outputs": ["1 1 3 4 5 14\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 6 19\n8 9 9 13 17 56\n"], "source_document_id": "p02413", "source_text": "Spreadsheet\n\nYour task is to perform a simple table calculation.\n\nWrite a program which reads the number of rows r, columns c and a table of r × c elements, and prints a new table, which includes the total sum for each row and column.\n\nInput\n\nIn the first line, two integers r and c are given. Next, the table is given by r lines, each of which consists of c integers separated by space characters.\n\nOutput\n\nPrint the new table of (r+1) × (c+1) elements. Put a single space character between adjacent elements. For each row, print the sum of it's elements in the last column. For each column, print the sum of it's elements in the last row. Print the total sum of the elements at the bottom right corner of the table.\n\nConstraints\n\n1 ≤ r, c ≤ 100\n\n0 ≤ an element of the table ≤ 100\n\nSample Input\n\n4 5\n1 1 3 4 5\n2 2 2 4 5\n3 3 0 1 1\n2 3 4 4 6\n\nSample Output\n\n1 1 3 4 5 14\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 6 19\n8 9 9 13 17 56", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1038, "cpu_time_ms": 40, "memory_kb": 15344}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s011444027", "group_id": "codeNet:p02413", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint r,c;\n\t\tint[][] A = new int[100][100];\n\n\t\tr = sc.nextInt();\n\t\tc = sc.nextInt();\n\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++){\n\t\t\t\tA[i][j] = sc.nextInt();\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++){\n\t\t\t\tA[i][c] += A[i][j];\n\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++){\n\t\t\t\tA[r][j] += A[i][j];\n\t\t\t}\n\n\t\t}\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++){\n\t\t\t\tA[r][c] += A[i][j];\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i <= r; i++) {\n\n\t\t\tfor (int j = 0; j <= c; j++){\n\t\t\t\tSystem.out.print(A[i][j] + \" \");\n\t\t\t}\n\t\t\tSystem.out.println();\n\n\t\t}\n\n\t}\n\n}", "language": "Java", "metadata": {"date": 1463028395, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02413.html", "problem_id": "p02413", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02413/input.txt", "sample_output_relpath": "derived/input_output/data/p02413/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02413/Java/s011444027.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s011444027", "user_id": "u122134364"}, "prompt_components": {"gold_output": "1 1 3 4 5 14\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 6 19\n8 9 9 13 17 56\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint r,c;\n\t\tint[][] A = new int[100][100];\n\n\t\tr = sc.nextInt();\n\t\tc = sc.nextInt();\n\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++){\n\t\t\t\tA[i][j] = sc.nextInt();\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++){\n\t\t\t\tA[i][c] += A[i][j];\n\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++){\n\t\t\t\tA[r][j] += A[i][j];\n\t\t\t}\n\n\t\t}\n\t\tfor (int i = 0; i < r; i++) {\n\t\t\tfor (int j = 0; j < c; j++){\n\t\t\t\tA[r][c] += A[i][j];\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i <= r; i++) {\n\n\t\t\tfor (int j = 0; j <= c; j++){\n\t\t\t\tSystem.out.print(A[i][j] + \" \");\n\t\t\t}\n\t\t\tSystem.out.println();\n\n\t\t}\n\n\t}\n\n}", "problem_context": "Spreadsheet\n\nYour task is to perform a simple table calculation.\n\nWrite a program which reads the number of rows r, columns c and a table of r × c elements, and prints a new table, which includes the total sum for each row and column.\n\nInput\n\nIn the first line, two integers r and c are given. Next, the table is given by r lines, each of which consists of c integers separated by space characters.\n\nOutput\n\nPrint the new table of (r+1) × (c+1) elements. Put a single space character between adjacent elements. For each row, print the sum of it's elements in the last column. For each column, print the sum of it's elements in the last row. Print the total sum of the elements at the bottom right corner of the table.\n\nConstraints\n\n1 ≤ r, c ≤ 100\n\n0 ≤ an element of the table ≤ 100\n\nSample Input\n\n4 5\n1 1 3 4 5\n2 2 2 4 5\n3 3 0 1 1\n2 3 4 4 6\n\nSample Output\n\n1 1 3 4 5 14\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 6 19\n8 9 9 13 17 56", "sample_input": "4 5\n1 1 3 4 5\n2 2 2 4 5\n3 3 0 1 1\n2 3 4 4 6\n"}, "reference_outputs": ["1 1 3 4 5 14\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 6 19\n8 9 9 13 17 56\n"], "source_document_id": "p02413", "source_text": "Spreadsheet\n\nYour task is to perform a simple table calculation.\n\nWrite a program which reads the number of rows r, columns c and a table of r × c elements, and prints a new table, which includes the total sum for each row and column.\n\nInput\n\nIn the first line, two integers r and c are given. Next, the table is given by r lines, each of which consists of c integers separated by space characters.\n\nOutput\n\nPrint the new table of (r+1) × (c+1) elements. Put a single space character between adjacent elements. For each row, print the sum of it's elements in the last column. For each column, print the sum of it's elements in the last row. Print the total sum of the elements at the bottom right corner of the table.\n\nConstraints\n\n1 ≤ r, c ≤ 100\n\n0 ≤ an element of the table ≤ 100\n\nSample Input\n\n4 5\n1 1 3 4 5\n2 2 2 4 5\n3 3 0 1 1\n2 3 4 4 6\n\nSample Output\n\n1 1 3 4 5 14\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 6 19\n8 9 9 13 17 56", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 755, "cpu_time_ms": 60, "memory_kb": 26044}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s132704240", "group_id": "codeNet:p02415", "input_text": "import java.io.*;\n\nclass Main{\n\tpublic static void main(String[] args)throws IOException{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString str = br.readLine();\n\t\tchar[] cr = str.toCharArray();\n\t\tfor(int i=0;i 0) {\n\t\ttaro += 3;\n\t }\n\t}\n\tSystem.out.println(taro + \" \" + hanako);\n }\n}", "language": "Java", "metadata": {"date": 1454649356, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02421.html", "problem_id": "p02421", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02421/input.txt", "sample_output_relpath": "derived/input_output/data/p02421/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02421/Java/s035889173.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s035889173", "user_id": "u377778881"}, "prompt_components": {"gold_output": "1 7\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args){\n\tScanner scan = new Scanner(System.in);\n\tString n = scan.nextLine();\n\tint cnt = Integer.valueOf(n);\n\tint taro = 0;\n\tint hanako = 0;\n\tfor (int i = 0; i < cnt; i++) {\n\t String fuda = scan.nextLine();\n\t String[] cards = fuda.split(\" \");\n\t if (cards[0].compareTo(cards[1]) == 0) {\n\t\ttaro += 1;\n\t\thanako += 1;\n\t } else if (cards[0].compareTo(cards[1]) < 0) {\n\t\thanako += 3;\n\t } else if (cards[0].compareTo(cards[1]) > 0) {\n\t\ttaro += 3;\n\t }\n\t}\n\tSystem.out.println(taro + \" \" + hanako);\n }\n}", "problem_context": "Card Game\n\nTaro and Hanako are playing card games. They have n cards each, and they compete n turns. At each turn Taro and Hanako respectively puts out a card.\nThe name of the animal consisting of alphabetical letters is written on each card, and the bigger one in lexicographical order becomes the winner of that turn. The winner obtains 3 points. In the case of a draw, they obtain 1 point each.\n\nWrite a program which reads a sequence of cards Taro and Hanako have and reports the final scores of the game.\n\nInput\n\nIn the first line, the number of cards n is given. In the following n lines, the cards for n turns are given respectively. For each line, the first string represents the Taro's card and the second one represents Hanako's card.\n\nConstraints\n\nn ≤ 1000\n\nThe length of the string ≤ 100\n\nOutput\n\nPrint the final scores of Taro and Hanako respectively. Put a single space character between them.\n\nSample Input\n\n3\ncat dog\nfish fish\nlion tiger\n\nSample Output\n\n1 7", "sample_input": "3\ncat dog\nfish fish\nlion tiger\n"}, "reference_outputs": ["1 7\n"], "source_document_id": "p02421", "source_text": "Card Game\n\nTaro and Hanako are playing card games. They have n cards each, and they compete n turns. At each turn Taro and Hanako respectively puts out a card.\nThe name of the animal consisting of alphabetical letters is written on each card, and the bigger one in lexicographical order becomes the winner of that turn. The winner obtains 3 points. In the case of a draw, they obtain 1 point each.\n\nWrite a program which reads a sequence of cards Taro and Hanako have and reports the final scores of the game.\n\nInput\n\nIn the first line, the number of cards n is given. In the following n lines, the cards for n turns are given respectively. For each line, the first string represents the Taro's card and the second one represents Hanako's card.\n\nConstraints\n\nn ≤ 1000\n\nThe length of the string ≤ 100\n\nOutput\n\nPrint the final scores of Taro and Hanako respectively. Put a single space character between them.\n\nSample Input\n\n3\ncat dog\nfish fish\nlion tiger\n\nSample Output\n\n1 7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 594, "cpu_time_ms": 90, "memory_kb": 30972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s838433839", "group_id": "codeNet:p02433", "input_text": "import java.util.*;\nimport java.io.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in=new Scanner(System.in);\n\t\tmylist ml=new mylist();\n\t\tint q=in.nextInt();\n\t\tfor(int i=0;i map = new HashMap<>();\n\n\t\tfor(int i = 0; i < q; i++) {\n\t\t\tint query = sc.nextInt();\n\t\t\tString key = sc.next();\n\n\t\t\tif(query == 0) { //insert\n\t\t\t\tint x = sc.nextInt();\n\t\t\t\tmap.put(key, x);\n\t\t\t}\n\t\t\telse if(query == 1){ //get\n\t\t\t\tSystem.out.println(map.getOrDefault(key, 0));\n\t\t\t}\n\t\t\telse map.remove(key);\n\t\t}\n\t}\n\n}\n\n", "language": "Java", "metadata": {"date": 1555409727, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02460.html", "problem_id": "p02460", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02460/input.txt", "sample_output_relpath": "derived/input_output/data/p02460/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02460/Java/s731619693.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s731619693", "user_id": "u638296675"}, "prompt_components": {"gold_output": "1\n4\n0\n0\n", "input_to_evaluate": "import java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\t\tint q = sc.nextInt();\n\t\tMap map = new HashMap<>();\n\n\t\tfor(int i = 0; i < q; i++) {\n\t\t\tint query = sc.nextInt();\n\t\t\tString key = sc.next();\n\n\t\t\tif(query == 0) { //insert\n\t\t\t\tint x = sc.nextInt();\n\t\t\t\tmap.put(key, x);\n\t\t\t}\n\t\t\telse if(query == 1){ //get\n\t\t\t\tSystem.out.println(map.getOrDefault(key, 0));\n\t\t\t}\n\t\t\telse map.remove(key);\n\t\t}\n\t}\n\n}\n\n", "problem_context": "Map: Delete\n\nFor a dictionary $M$ that stores elements formed by a pair of a string key and an integer value, perform a sequence of the following operations. Note that each key in $M$ must be unique.\n\ninsert($key$, $x$): Insert an element formed by a pair of $key$ and $x$ to $M$.\n\nget($key$): Print the value with the specified $key$. Print 0 if there is no such element.\n\ndelete($key$): Delete the element with the specified $key$.\n\nInput\n\nThe input is given in the following format.\n\n$q$\n$query_1$\n$query_2$\n:\n$query_q$\n\nEach query $query_i$ is given by\n\n0 $key$ $x$\n\nor\n\n1 $key$\n\nor\n\n2 $key$\n\nwhere the first digits 0, 1 and 2 represent insert, get and delete operations respectively.\n\nOutput\n\nFor each get operation, print an integer in a line.\n\nConstraints\n\n$1 \\leq q \\leq 200,000$\n\n$1 \\leq x \\leq 1,000,000,000$\n\n$1 \\leq $ length of $key$ $ \\leq 20$\n\n$key$ consits of lower case letters\n\nSample Input 1\n\n8\n0 blue 4\n0 red 1\n0 white 5\n1 red\n1 blue\n2 red\n1 black\n1 red\n\nSample Output 1\n\n1\n4\n0\n0", "sample_input": "8\n0 blue 4\n0 red 1\n0 white 5\n1 red\n1 blue\n2 red\n1 black\n1 red\n"}, "reference_outputs": ["1\n4\n0\n0\n"], "source_document_id": "p02460", "source_text": "Map: Delete\n\nFor a dictionary $M$ that stores elements formed by a pair of a string key and an integer value, perform a sequence of the following operations. Note that each key in $M$ must be unique.\n\ninsert($key$, $x$): Insert an element formed by a pair of $key$ and $x$ to $M$.\n\nget($key$): Print the value with the specified $key$. Print 0 if there is no such element.\n\ndelete($key$): Delete the element with the specified $key$.\n\nInput\n\nThe input is given in the following format.\n\n$q$\n$query_1$\n$query_2$\n:\n$query_q$\n\nEach query $query_i$ is given by\n\n0 $key$ $x$\n\nor\n\n1 $key$\n\nor\n\n2 $key$\n\nwhere the first digits 0, 1 and 2 represent insert, get and delete operations respectively.\n\nOutput\n\nFor each get operation, print an integer in a line.\n\nConstraints\n\n$1 \\leq q \\leq 200,000$\n\n$1 \\leq x \\leq 1,000,000,000$\n\n$1 \\leq $ length of $key$ $ \\leq 20$\n\n$key$ consits of lower case letters\n\nSample Input 1\n\n8\n0 blue 4\n0 red 1\n0 white 5\n1 red\n1 blue\n2 red\n1 black\n1 red\n\nSample Output 1\n\n1\n4\n0\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 596, "cpu_time_ms": 1290, "memory_kb": 195388}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s786956024", "group_id": "codeNet:p02467", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n\n static BufferedReader in;\n static PrintWriter out;\n static StringTokenizer tok;\n\n void solve() throws IOException {\n int n = ni();\n\n HashMap map = primeFactorize(n);\n\n out.print(n + \":\");\n Set set = map.keySet();\n for (int x : set) {\n for (int i = 0; i < map.get(x); i++) {\n out.print(\" \" + x);\n }\n }\n out.println();\n }\n\n HashMap primeFactorize(int n) {\n Prime p = new Prime(n + 1);\n\n HashMap ret = new HashMap<>();\n int idx = 0;\n while (n > 1) {\n int x = p.get(idx);\n if (n % x == 0) {\n int cnt = 0;\n while (n % x == 0) {\n cnt++;\n n /= x;\n }\n ret.put(x, cnt);\n }\n idx++;\n }\n\n return ret;\n }\n\n class Prime {\n int primeMax;\n int pidx = 0;\n int[] prime, divp;\n\n Prime(int primeMax) {\n this.primeMax = primeMax;\n prime = new int[primeMax];\n divp = new int[primeMax];\n eratosthenes();\n }\n\n void eratosthenes() {\n for (int i = 2; i < primeMax; i++) {\n if (divp[i] == 0) {\n prime[pidx++] = i;\n for (long j = (long) i * i; j < primeMax; j += i) {\n divp[(int) j] = i;\n }\n }\n }\n }\n\n int get(int idx) {\n return prime[idx];\n }\n }\n\n String ns() throws IOException {\n while (!tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine(), \" \");\n }\n return tok.nextToken();\n }\n\n int ni() throws IOException {\n return Integer.parseInt(ns());\n }\n\n long nl() throws IOException {\n return Long.parseLong(ns());\n }\n\n double nd() throws IOException {\n return Double.parseDouble(ns());\n }\n\n String[] nsa(int n) throws IOException {\n String[] res = new String[n];\n for (int i = 0; i < n; i++) {\n res[i] = ns();\n }\n return res;\n }\n\n int[] nia(int n) throws IOException {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = ni();\n }\n return res;\n }\n\n long[] nla(int n) throws IOException {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nl();\n }\n return res;\n }\n\n public static void main(String[] args) throws IOException {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n tok = new StringTokenizer(\"\");\n Main main = new Main();\n main.solve();\n out.close();\n }\n}", "language": "Java", "metadata": {"date": 1482144000, "filename_ext": "java", "original_language": "JAVA", "problem_description_relpath": "problem_descriptions/p02467.html", "problem_id": "p02467", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02467/input.txt", "sample_output_relpath": "derived/input_output/data/p02467/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02467/Java/s786956024.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s786956024", "user_id": "u771186507"}, "prompt_components": {"gold_output": "12: 2 2 3\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n\n static BufferedReader in;\n static PrintWriter out;\n static StringTokenizer tok;\n\n void solve() throws IOException {\n int n = ni();\n\n HashMap map = primeFactorize(n);\n\n out.print(n + \":\");\n Set set = map.keySet();\n for (int x : set) {\n for (int i = 0; i < map.get(x); i++) {\n out.print(\" \" + x);\n }\n }\n out.println();\n }\n\n HashMap primeFactorize(int n) {\n Prime p = new Prime(n + 1);\n\n HashMap ret = new HashMap<>();\n int idx = 0;\n while (n > 1) {\n int x = p.get(idx);\n if (n % x == 0) {\n int cnt = 0;\n while (n % x == 0) {\n cnt++;\n n /= x;\n }\n ret.put(x, cnt);\n }\n idx++;\n }\n\n return ret;\n }\n\n class Prime {\n int primeMax;\n int pidx = 0;\n int[] prime, divp;\n\n Prime(int primeMax) {\n this.primeMax = primeMax;\n prime = new int[primeMax];\n divp = new int[primeMax];\n eratosthenes();\n }\n\n void eratosthenes() {\n for (int i = 2; i < primeMax; i++) {\n if (divp[i] == 0) {\n prime[pidx++] = i;\n for (long j = (long) i * i; j < primeMax; j += i) {\n divp[(int) j] = i;\n }\n }\n }\n }\n\n int get(int idx) {\n return prime[idx];\n }\n }\n\n String ns() throws IOException {\n while (!tok.hasMoreTokens()) {\n tok = new StringTokenizer(in.readLine(), \" \");\n }\n return tok.nextToken();\n }\n\n int ni() throws IOException {\n return Integer.parseInt(ns());\n }\n\n long nl() throws IOException {\n return Long.parseLong(ns());\n }\n\n double nd() throws IOException {\n return Double.parseDouble(ns());\n }\n\n String[] nsa(int n) throws IOException {\n String[] res = new String[n];\n for (int i = 0; i < n; i++) {\n res[i] = ns();\n }\n return res;\n }\n\n int[] nia(int n) throws IOException {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = ni();\n }\n return res;\n }\n\n long[] nla(int n) throws IOException {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nl();\n }\n return res;\n }\n\n public static void main(String[] args) throws IOException {\n in = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n tok = new StringTokenizer(\"\");\n Main main = new Main();\n main.solve();\n out.close();\n }\n}", "problem_context": "Prime Factorization\n\nFactorize a given integer n.\n\nInput\n\nn\n\nAn integer n is given in a line.\n\nOutput\n\nPrint the given integer n and :. Then, print prime factors in ascending order. If n is divisible by a prime factor several times, the prime factor should be printed according to the number of times. Print a space before each prime factor.\n\nConstraints\n\n2 ≤ n ≤ 109\n\nSample Input 1\n\n12\n\nSample Output 1\n\n12: 2 2 3\n\nSample Input 2\n\n126\n\nSample Output 2\n\n126: 2 3 3 7", "sample_input": "12\n"}, "reference_outputs": ["12: 2 2 3\n"], "source_document_id": "p02467", "source_text": "Prime Factorization\n\nFactorize a given integer n.\n\nInput\n\nn\n\nAn integer n is given in a line.\n\nOutput\n\nPrint the given integer n and :. Then, print prime factors in ascending order. If n is divisible by a prime factor several times, the prime factor should be printed according to the number of times. Print a space before each prime factor.\n\nConstraints\n\n2 ≤ n ≤ 109\n\nSample Input 1\n\n12\n\nSample Output 1\n\n12: 2 2 3\n\nSample Input 2\n\n126\n\nSample Output 2\n\n126: 2 3 3 7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3057, "cpu_time_ms": 40, "memory_kb": 24372}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s738018134", "group_id": "codeNet:p02537", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\nimport static java.lang.Double.parseDouble;\nimport static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\nimport static java.lang.Math.*;\nimport static java.lang.System.in;\nimport static java.lang.System.out;\n\nimport java.util.*;\n\npublic class Main {\n static FastScanner in = new FastScanner();\n static PrintWriter out = new PrintWriter(System.out);\n\n static class Segment_Tree {\n int[] sgt;\n int[] ar;\n int N;\n\n Segment_Tree(int n, int[] a) {\n sgt = new int[1500005];\n ar = new int[n];\n Arrays.fill(sgt, 0);\n N = n;\n for (int i = 0; i < a.length; ++i) {\n ar[i] = a[i];\n }\n }\n\n void build(int v, int lt, int rt) {\n if (lt == rt) {\n sgt[v] = ar[lt];\n return;\n }\n int mid = (lt + rt) / 2;\n build(2 * v, lt, mid);\n build((2 * v) + 1, mid + 1, rt);\n sgt[v] = max(sgt[2 * v], sgt[(2 * v) + 1]);\n }\n\n void update(int v, int lt, int rt, int pos, int value) {\n if (lt == rt) {\n sgt[v] = value;\n return;\n }\n int mid = (lt + rt) / 2;\n if (pos > mid) update((2 * v) + 1, mid + 1, rt, pos, value);\n else update((2 * v), lt, mid, pos, value);\n sgt[v] = max(sgt[2 * v], sgt[(2 * v) + 1]);\n }\n\n int query(int v, int lt, int rt, int lq, int rq) {\n //out.println(lq + \" \" + rq);\n if (lq > rq) {\n return 0;\n }\n if (lt == lq && rt == rq) {\n return sgt[v];\n }\n int mid = (lt + rt) / 2;\n return max(query(2 * v, lt, mid, lq, min(rq, mid)), query((2 * v) + 1, mid + 1, rt, max(mid + 1, lq), rq));\n }\n }\n\n public static void main(String[] args) {\n int n = in.nextInt(), k = in.nextInt();\n int[] a = ria(n);\n Segment_Tree sgt = new Segment_Tree(n, a);\n //out.println(sgt.query(1, 0, n - 1, 2, 5));\n //sgt.update(1, 0, n-1, 4, 2);\n //out.println(sgt.query(1, 0, n - 1, 4, 4));\n a = reverse(a);\n int ans = 1;\n for (int i = 0; i < n; ++i) {\n int x = a[i];\n int left = max(0, x - k);\n int right = min(700000, x + k);\n //out.println(\"The left and right limits are : \" + left + \" \" + right);\n int max_value = sgt.query(1, 0, 700000, left, right);\n ans = max(ans, max_value + 1);\n sgt.update(1, 0, 700000, x, ans);\n //out.println(\"The answer right now : \" + ans);\n }\n out.println(ans);\n out.flush();\n out.close();\n }\n\n static class FastScanner {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n String next() {\n while (!st.hasMoreTokens())\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return parseInt(next());\n }\n\n int[] readArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = nextInt();\n return a;\n }\n\n long nextLong() {\n return parseLong(next());\n }\n\n double nextDouble() {\n return parseDouble(next());\n }\n }\n\n static final int IBIG = 1000000007;\n static final int IMAX = 2147483647;\n static final int IMIN = -2147483648;\n static final long LMAX = 9223372036854775807L;\n static final long LMIN = -9223372036854775808L;\n\n static int ri() {\n return in.nextInt();\n }\n\n static double rd() {\n return in.nextDouble();\n }\n\n static long rl() {\n return in.nextLong();\n }\n\n static String rs() {\n return in.next();\n }\n\n static double[] rda(int n) {\n double[] a = new double[n];\n for (int i = 0; i < n; ++i) a[i] = in.nextDouble();\n return a;\n }\n\n static int[] ria(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; ++i) a[i] = in.nextInt();\n return a;\n }\n\n static long[] rla(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; ++i) a[i] = in.nextLong();\n return a;\n }\n\n static char[] rca() {\n return in.next().toCharArray();\n }\n\n static long powmod(long a, long b, long mod) {\n long res = 1;\n while (b > 0) {\n if ((b & 1) != 0) res *= a;\n a *= a;\n res %= mod;\n a %= mod;\n b = b >> 2;\n }\n return res;\n }\n\n static long powmod(int a, int b, long mod) {\n long res = 1;\n long a_copy = a;\n long b_copy = b;\n while (b_copy > 0) {\n if ((b_copy & 1) != 0) res *= a_copy;\n a_copy *= a_copy;\n res %= mod;\n a_copy %= mod;\n b_copy = b_copy >> 2;\n }\n return res;\n }\n\n static void pr(int n) {\n out.print(n);\n }\n\n static void pr(long n) {\n out.print(n);\n }\n\n static void pr(String n) {\n out.print(n);\n }\n\n static void pr(char n) {\n out.print(n);\n }\n\n static void pr(char[] a) {\n out.print(a.toString());\n }\n\n static void prln(int n) {\n out.println(n);\n }\n\n static void prln(long n) {\n out.println(n);\n }\n\n static void prln(String n) {\n out.println(n);\n }\n\n static void prln(char n) {\n out.println(n);\n }\n\n static void prln(char[] a) {\n out.println(a.toString());\n }\n\n static int[] copy(int[] a) {\n int[] b = new int[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[i] = a[i];\n }\n return b;\n }\n\n static long[] copy(long[] a) {\n long[] b = new long[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[i] = a[i];\n }\n return b;\n }\n\n static char[] copy(char[] a) {\n char[] b = new char[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[i] = a[i];\n }\n return b;\n }\n\n static int[] reverse(int[] a) {\n int[] b = new int[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[a.length - 1 - i] = a[i];\n }\n return b;\n }\n\n static long[] reverse(long[] a) {\n long[] b = new long[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[a.length - 1 - i] = a[i];\n }\n return b;\n }\n\n static char[] reverse(char[] a) {\n char[] b = new char[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[a.length - 1 - i] = a[i];\n }\n return b;\n }\n}\n", "language": "Java", "metadata": {"date": 1601576289, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02537.html", "problem_id": "p02537", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02537/input.txt", "sample_output_relpath": "derived/input_output/data/p02537/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02537/Java/s738018134.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s738018134", "user_id": "u947263228"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Random;\nimport java.util.StringTokenizer;\n\nimport static java.lang.Double.parseDouble;\nimport static java.lang.Integer.parseInt;\nimport static java.lang.Long.parseLong;\nimport static java.lang.Math.*;\nimport static java.lang.System.in;\nimport static java.lang.System.out;\n\nimport java.util.*;\n\npublic class Main {\n static FastScanner in = new FastScanner();\n static PrintWriter out = new PrintWriter(System.out);\n\n static class Segment_Tree {\n int[] sgt;\n int[] ar;\n int N;\n\n Segment_Tree(int n, int[] a) {\n sgt = new int[1500005];\n ar = new int[n];\n Arrays.fill(sgt, 0);\n N = n;\n for (int i = 0; i < a.length; ++i) {\n ar[i] = a[i];\n }\n }\n\n void build(int v, int lt, int rt) {\n if (lt == rt) {\n sgt[v] = ar[lt];\n return;\n }\n int mid = (lt + rt) / 2;\n build(2 * v, lt, mid);\n build((2 * v) + 1, mid + 1, rt);\n sgt[v] = max(sgt[2 * v], sgt[(2 * v) + 1]);\n }\n\n void update(int v, int lt, int rt, int pos, int value) {\n if (lt == rt) {\n sgt[v] = value;\n return;\n }\n int mid = (lt + rt) / 2;\n if (pos > mid) update((2 * v) + 1, mid + 1, rt, pos, value);\n else update((2 * v), lt, mid, pos, value);\n sgt[v] = max(sgt[2 * v], sgt[(2 * v) + 1]);\n }\n\n int query(int v, int lt, int rt, int lq, int rq) {\n //out.println(lq + \" \" + rq);\n if (lq > rq) {\n return 0;\n }\n if (lt == lq && rt == rq) {\n return sgt[v];\n }\n int mid = (lt + rt) / 2;\n return max(query(2 * v, lt, mid, lq, min(rq, mid)), query((2 * v) + 1, mid + 1, rt, max(mid + 1, lq), rq));\n }\n }\n\n public static void main(String[] args) {\n int n = in.nextInt(), k = in.nextInt();\n int[] a = ria(n);\n Segment_Tree sgt = new Segment_Tree(n, a);\n //out.println(sgt.query(1, 0, n - 1, 2, 5));\n //sgt.update(1, 0, n-1, 4, 2);\n //out.println(sgt.query(1, 0, n - 1, 4, 4));\n a = reverse(a);\n int ans = 1;\n for (int i = 0; i < n; ++i) {\n int x = a[i];\n int left = max(0, x - k);\n int right = min(700000, x + k);\n //out.println(\"The left and right limits are : \" + left + \" \" + right);\n int max_value = sgt.query(1, 0, 700000, left, right);\n ans = max(ans, max_value + 1);\n sgt.update(1, 0, 700000, x, ans);\n //out.println(\"The answer right now : \" + ans);\n }\n out.println(ans);\n out.flush();\n out.close();\n }\n\n static class FastScanner {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(\"\");\n\n String next() {\n while (!st.hasMoreTokens())\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return parseInt(next());\n }\n\n int[] readArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = nextInt();\n return a;\n }\n\n long nextLong() {\n return parseLong(next());\n }\n\n double nextDouble() {\n return parseDouble(next());\n }\n }\n\n static final int IBIG = 1000000007;\n static final int IMAX = 2147483647;\n static final int IMIN = -2147483648;\n static final long LMAX = 9223372036854775807L;\n static final long LMIN = -9223372036854775808L;\n\n static int ri() {\n return in.nextInt();\n }\n\n static double rd() {\n return in.nextDouble();\n }\n\n static long rl() {\n return in.nextLong();\n }\n\n static String rs() {\n return in.next();\n }\n\n static double[] rda(int n) {\n double[] a = new double[n];\n for (int i = 0; i < n; ++i) a[i] = in.nextDouble();\n return a;\n }\n\n static int[] ria(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; ++i) a[i] = in.nextInt();\n return a;\n }\n\n static long[] rla(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; ++i) a[i] = in.nextLong();\n return a;\n }\n\n static char[] rca() {\n return in.next().toCharArray();\n }\n\n static long powmod(long a, long b, long mod) {\n long res = 1;\n while (b > 0) {\n if ((b & 1) != 0) res *= a;\n a *= a;\n res %= mod;\n a %= mod;\n b = b >> 2;\n }\n return res;\n }\n\n static long powmod(int a, int b, long mod) {\n long res = 1;\n long a_copy = a;\n long b_copy = b;\n while (b_copy > 0) {\n if ((b_copy & 1) != 0) res *= a_copy;\n a_copy *= a_copy;\n res %= mod;\n a_copy %= mod;\n b_copy = b_copy >> 2;\n }\n return res;\n }\n\n static void pr(int n) {\n out.print(n);\n }\n\n static void pr(long n) {\n out.print(n);\n }\n\n static void pr(String n) {\n out.print(n);\n }\n\n static void pr(char n) {\n out.print(n);\n }\n\n static void pr(char[] a) {\n out.print(a.toString());\n }\n\n static void prln(int n) {\n out.println(n);\n }\n\n static void prln(long n) {\n out.println(n);\n }\n\n static void prln(String n) {\n out.println(n);\n }\n\n static void prln(char n) {\n out.println(n);\n }\n\n static void prln(char[] a) {\n out.println(a.toString());\n }\n\n static int[] copy(int[] a) {\n int[] b = new int[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[i] = a[i];\n }\n return b;\n }\n\n static long[] copy(long[] a) {\n long[] b = new long[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[i] = a[i];\n }\n return b;\n }\n\n static char[] copy(char[] a) {\n char[] b = new char[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[i] = a[i];\n }\n return b;\n }\n\n static int[] reverse(int[] a) {\n int[] b = new int[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[a.length - 1 - i] = a[i];\n }\n return b;\n }\n\n static long[] reverse(long[] a) {\n long[] b = new long[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[a.length - 1 - i] = a[i];\n }\n return b;\n }\n\n static char[] reverse(char[] a) {\n char[] b = new char[a.length];\n for (int i = 0; i < a.length; ++i) {\n b[a.length - 1 - i] = a[i];\n }\n return b;\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a sequence A_1, A_2, ..., A_N and an integer K.\n\nPrint the maximum possible length of a sequence B that satisfies the following conditions:\n\nB is a (not necessarily continuous) subsequence of A.\n\nFor each pair of adjacents elements of B, the absolute difference of the elements is at most K.\n\nConstraints\n\n1 \\leq N \\leq 300,000\n\n0 \\leq A_i \\leq 300,000\n\n0 \\leq K \\leq 300,000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1\nA_2\n:\nA_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n10 3\n1\n5\n4\n3\n8\n6\n9\n7\n2\n4\n\nSample Output 1\n\n7\n\nFor example, B = (1, 4, 3, 6, 9, 7, 4) satisfies the conditions.\n\nIt is a subsequence of A = (1, 5, 4, 3, 8, 6, 9, 7, 2, 4).\n\nAll of the absolute differences between two adjacent elements (|1-4|, |4-3|, |3-6|, |6-9|, |9-7|, |7-4|) are at most K = 3.", "sample_input": "10 3\n1\n5\n4\n3\n8\n6\n9\n7\n2\n4\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02537", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a sequence A_1, A_2, ..., A_N and an integer K.\n\nPrint the maximum possible length of a sequence B that satisfies the following conditions:\n\nB is a (not necessarily continuous) subsequence of A.\n\nFor each pair of adjacents elements of B, the absolute difference of the elements is at most K.\n\nConstraints\n\n1 \\leq N \\leq 300,000\n\n0 \\leq A_i \\leq 300,000\n\n0 \\leq K \\leq 300,000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1\nA_2\n:\nA_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n10 3\n1\n5\n4\n3\n8\n6\n9\n7\n2\n4\n\nSample Output 1\n\n7\n\nFor example, B = (1, 4, 3, 6, 9, 7, 4) satisfies the conditions.\n\nIt is a subsequence of A = (1, 5, 4, 3, 8, 6, 9, 7, 2, 4).\n\nAll of the absolute differences between two adjacent elements (|1-4|, |4-3|, |3-6|, |6-9|, |9-7|, |7-4|) are at most K = 3.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7192, "cpu_time_ms": 291, "memory_kb": 61204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s805194197", "group_id": "codeNet:p02538", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n \npublic class Main {\n\tstatic final long MOD1=1000000007;\n\tstatic final long MOD2=998244353;\n\tpublic static void main(String[] args) {\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tInputReader sc=new InputReader(System.in);\n\t\tint N=sc.nextInt();\n\t\tint Q=sc.nextInt();\n\t\tS[] dat=new S[N];\n\t\tArrays.setAll(dat, i->new S(modPow(10L, N-i-1),i,i));\n\t\tLazySegTree lazySegTree=new LazySegTree(dat, S::op, S.E,S::map,F::composite,F.I);\n\t\tfor (int j = 0; j < Q; j++) {\n\t\t\tint l=sc.nextInt()-1;\n\t\t\tint r=sc.nextInt()-1;\n\t\t\tlong D=sc.nextLong();\n\t\t\tlazySegTree.apply(l,r+1,new F(D,N));\n\t\t\tout.println(lazySegTree.allProd().sum);\n\t\t}\n\t\tout.flush();\n\t}\n\t//LazySegTree lazySegTree=new LazySegTree(dat, S::op, S.E,S::map,F::composite,F.I);\n\t//f(a*b)!=f(a)*f(b)の場合Sを集合その作用素をmergeとみなして集合の各要素に対して作用するものをfとすればf(a*b)=f(a)*f(b)となる。\n\t//その場合Sには必要な情報だけを持たせる（和だったらsumと要素数があれば十分）\n\tstatic class S {\n\t static final S E = new S(0,Long.MAX_VALUE/2,Long.MIN_VALUE/2);\n\t long sum;\n\t long l;\n\t long r;\n\t public S (long sum,long l,long r) {\n\t super();\n\t this.sum = sum;\n\t this.l=l;\n\t this.r=r;\n\t }\n\t public static S op(S s1, S s2) {\n\t return new S((s1.sum+s2.sum)%MOD2,Math.min(s1.l, s2.l),Math.max(s1.r, s2.r));\n\t }\n\t static S map(F f, S s) {\n\t return new S(((f.D*((modPow(10,f.N-s.l)-modPow(10, f.N-s.r-1)+MOD2)%MOD2))%MOD2*modInv(9))%MOD2, s.l,s.r);\n\t }\n\t }\n\tstatic class F {\n\t static final F I = new F(0,0);\n\t long D;\n\t long N;\n\t public F (long D,long N) {\n\t super();\n\t this.D = D;\n\t this.N= N;\n\t }\n\t public static F composite(F f, F g) {\n\t return new F(f.D,f.N);\n\t }\n\t }\n\tstatic long modInv(long x) {\n return modPow(x, MOD2 - 2);\n }\n\tstatic long modPow(long x, long y) {\n long z = 1;\n while (y > 0) {\n if (y % 2 == 0) {\n x = (x * x) % MOD2;\n y /= 2;\n } else {\n z = (z * x) % MOD2;\n y--;\n }\n }\n return z;\n }\n\tstatic class LazySegTree {\n\t final int MAX;\n\n\t final int N;\n\t final int Log;\n\t final java.util.function.BinaryOperator Op;\n\t final S E;\n\t final java.util.function.BiFunction Mapping;\n\t final java.util.function.BinaryOperator Composition;\n\t final F Id;\n\n\t final S[] Dat;\n\t final F[] Laz;\n\n\t @SuppressWarnings(\"unchecked\")\n\t public LazySegTree(int n, java.util.function.BinaryOperator op, S e, java.util.function.BiFunction mapping, java.util.function.BinaryOperator composition, F id) {\n\t this.MAX = n;\n\t int k = 1;\n\t while (k < n) k <<= 1;\n\t this.N = k;\n\t this.Log = Integer.numberOfTrailingZeros(N);\n\t this.Op = op;\n\t this.E = e;\n\t this.Mapping = mapping;\n\t this.Composition = composition;\n\t this.Id = id;\n\t this.Dat = (S[]) new Object[N << 1];\n\t this.Laz = (F[]) new Object[N];\n\t java.util.Arrays.fill(Dat, E);\n\t java.util.Arrays.fill(Laz, Id);\n\t }\n\n\t public LazySegTree(S[] dat, java.util.function.BinaryOperator op, S e, java.util.function.BiFunction mapping, java.util.function.BinaryOperator composition, F id) {\n\t this(dat.length, op, e, mapping, composition, id);\n\t build(dat);\n\t }\n\n\t private void build(S[] dat) {\n\t int l = dat.length;\n\t System.arraycopy(dat, 0, Dat, N, l);\n\t for (int i = N - 1; i > 0; i--) {\n\t Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);\n\t }\n\t }\n\n\t private void push(int k) {\n\t if (Laz[k] == Id) return;\n\t int lk = k << 1 | 0, rk = k << 1 | 1;\n\t Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);\n\t Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);\n\t if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);\n\t if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);\n\t Laz[k] = Id;\n\t }\n\n\t private void pushTo(int k) {\n\t for (int i = Log; i > 0; i--) push(k >> i);\n\t }\n\n\t private void pushTo(int lk, int rk) {\n\t for (int i = Log; i > 0; i--) {\n\t if (((lk >> i) << i) != lk) push(lk >> i);\n\t if (((rk >> i) << i) != rk) push(rk >> i);\n\t }\n\t }\n\n\t private void updateFrom(int k) {\n\t k >>= 1;\n\t while (k > 0) {\n\t Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);\n\t k >>= 1;\n\t }\n\t }\n\n\t private void updateFrom(int lk, int rk) {\n\t for (int i = 1; i <= Log; i++) {\n\t if (((lk >> i) << i) != lk) {\n\t int lki = lk >> i;\n\t Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);\n\t }\n\t if (((rk >> i) << i) != rk) {\n\t int rki = (rk - 1) >> i;\n\t Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);\n\t }\n\t }\n\t }\n\n\t public void set(int p, S x) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t Dat[p] = x;\n\t updateFrom(p);\n\t }\n\n\t public S get(int p) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t return Dat[p];\n\t }\n\n\t public S prod(int l, int r) {\n\t if (l > r) {\n\t throw new IllegalArgumentException(\n\t String.format(\"Invalid range: [%d, %d)\", l, r)\n\t );\n\t }\n\t inclusiveRangeCheck(l);\n\t inclusiveRangeCheck(r);\n\t if (l == r) return E;\n\t l += N; r += N;\n\t pushTo(l, r);\n\t S sumLeft = E, sumRight = E;\n\t while (l < r) {\n\t if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);\n\t if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);\n\t l >>= 1; r >>= 1;\n\t }\n\t return Op.apply(sumLeft, sumRight);\n\t }\n\n\t public S allProd() {\n\t return Dat[1];\n\t }\n\n\t public void apply(int p, F f) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t Dat[p] = Mapping.apply(f, Dat[p]);\n\t updateFrom(p);\n\t }\n\n\t public void apply(int l, int r, F f) {\n\t if (l > r) {\n\t throw new IllegalArgumentException(\n\t String.format(\"Invalid range: [%d, %d)\", l, r)\n\t );\n\t }\n\t inclusiveRangeCheck(l);\n\t inclusiveRangeCheck(r);\n\t if (l == r) return;\n\t l += N; r += N;\n\t pushTo(l, r);\n\t for (int l2 = l, r2 = r; l2 < r2;) {\n\t if ((l2 & 1) == 1) {\n\t Dat[l2] = Mapping.apply(f, Dat[l2]);\n\t if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);\n\t l2++;\n\t }\n\t if ((r2 & 1) == 1) {\n\t r2--;\n\t Dat[r2] = Mapping.apply(f, Dat[r2]);\n\t if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);\n\t }\n\t l2 >>= 1; r2 >>= 1;\n\t }\n\t updateFrom(l, r);\n\t }\n\n\t public int maxRight(int l, java.util.function.Predicate g) {\n\t inclusiveRangeCheck(l);\n\t if (!g.test(E)) {\n\t throw new IllegalArgumentException(\"Identity element must satisfy the condition.\");\n\t }\n\t if (l == MAX) return MAX;\n\t l += N;\n\t pushTo(l);\n\t S sum = E;\n\t do {\n\t l >>= Integer.numberOfTrailingZeros(l);\n\t if (!g.test(Op.apply(sum, Dat[l]))) {\n\t while (l < N) {\n\t push(l);\n\t l = l << 1;\n\t if (g.test(Op.apply(sum, Dat[l]))) {\n\t sum = Op.apply(sum, Dat[l]);\n\t l++;\n\t }\n\t }\n\t return l - N;\n\t }\n\t sum = Op.apply(sum, Dat[l]);\n\t l++;\n\t } while ((l & -l) != l);\n\t return MAX;\n\t }\n\n\t public int minLeft(int r, java.util.function.Predicate g) {\n\t inclusiveRangeCheck(r);\n\t if (!g.test(E)) {\n\t throw new IllegalArgumentException(\"Identity element must satisfy the condition.\");\n\t }\n\t if (r == 0) return 0;\n\t r += N;\n\t pushTo(r - 1);\n\t S sum = E;\n\t do {\n\t r--;\n\t while (r > 1 && (r & 1) == 1) r >>= 1;\n\t if (!g.test(Op.apply(Dat[r], sum))) {\n\t while (r < N) {\n\t push(r);\n\t r = r << 1 | 1;\n\t if (g.test(Op.apply(Dat[r], sum))) {\n\t sum = Op.apply(Dat[r], sum);\n\t r--;\n\t }\n\t }\n\t return r + 1 - N;\n\t }\n\t sum = Op.apply(Dat[r], sum);\n\t } while ((r & -r) != r);\n\t return 0;\n\t }\n\n\t private void exclusiveRangeCheck(int p) {\n\t if (p < 0 || p >= MAX) {\n\t throw new IndexOutOfBoundsException(\n\t String.format(\"Index %d is not in [%d, %d).\", p, 0, MAX)\n\t );\n\t }\n\t }\n\n\t private void inclusiveRangeCheck(int p) {\n\t if (p < 0 || p > MAX) {\n\t throw new IndexOutOfBoundsException(\n\t String.format(\"Index %d is not in [%d, %d].\", p, 0, MAX)\n\t );\n\t }\n\t }\n\n\t // **************** DEBUG **************** //\n\n\t private int indent = 6;\n\n\t public void setIndent(int newIndent) {\n\t this.indent = newIndent;\n\t }\n\n\t @Override\n\t public String toString() {\n\t return toString(1, 0);\n\t }\n\n\t private String toString(int k, int sp) {\n\t if (k >= N) return indent(sp) + Dat[k];\n\t String s = \"\";\n\t s += toString(k << 1 | 1, sp + indent);\n\t s += \"\\n\";\n\t s += indent(sp) + Dat[k] + \"/\" + Laz[k];\n\t s += \"\\n\";\n\t s += toString(k << 1 | 0, sp + indent);\n\t return s;\n\t }\n\n\t private static String indent(int n) {\n\t StringBuilder sb = new StringBuilder();\n\t while (n --> 0) sb.append(' ');\n\t return sb.toString();\n\t }\n\t}\n\t\tstatic class InputReader { \n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n \n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n \n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n \n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n \n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n \n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n \n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n \n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1601172489, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02538.html", "problem_id": "p02538", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02538/input.txt", "sample_output_relpath": "derived/input_output/data/p02538/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02538/Java/s805194197.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s805194197", "user_id": "u596758817"}, "prompt_components": {"gold_output": "11222211\n77772211\n77333333\n72333333\n72311333\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n \npublic class Main {\n\tstatic final long MOD1=1000000007;\n\tstatic final long MOD2=998244353;\n\tpublic static void main(String[] args) {\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tInputReader sc=new InputReader(System.in);\n\t\tint N=sc.nextInt();\n\t\tint Q=sc.nextInt();\n\t\tS[] dat=new S[N];\n\t\tArrays.setAll(dat, i->new S(modPow(10L, N-i-1),i,i));\n\t\tLazySegTree lazySegTree=new LazySegTree(dat, S::op, S.E,S::map,F::composite,F.I);\n\t\tfor (int j = 0; j < Q; j++) {\n\t\t\tint l=sc.nextInt()-1;\n\t\t\tint r=sc.nextInt()-1;\n\t\t\tlong D=sc.nextLong();\n\t\t\tlazySegTree.apply(l,r+1,new F(D,N));\n\t\t\tout.println(lazySegTree.allProd().sum);\n\t\t}\n\t\tout.flush();\n\t}\n\t//LazySegTree lazySegTree=new LazySegTree(dat, S::op, S.E,S::map,F::composite,F.I);\n\t//f(a*b)!=f(a)*f(b)の場合Sを集合その作用素をmergeとみなして集合の各要素に対して作用するものをfとすればf(a*b)=f(a)*f(b)となる。\n\t//その場合Sには必要な情報だけを持たせる（和だったらsumと要素数があれば十分）\n\tstatic class S {\n\t static final S E = new S(0,Long.MAX_VALUE/2,Long.MIN_VALUE/2);\n\t long sum;\n\t long l;\n\t long r;\n\t public S (long sum,long l,long r) {\n\t super();\n\t this.sum = sum;\n\t this.l=l;\n\t this.r=r;\n\t }\n\t public static S op(S s1, S s2) {\n\t return new S((s1.sum+s2.sum)%MOD2,Math.min(s1.l, s2.l),Math.max(s1.r, s2.r));\n\t }\n\t static S map(F f, S s) {\n\t return new S(((f.D*((modPow(10,f.N-s.l)-modPow(10, f.N-s.r-1)+MOD2)%MOD2))%MOD2*modInv(9))%MOD2, s.l,s.r);\n\t }\n\t }\n\tstatic class F {\n\t static final F I = new F(0,0);\n\t long D;\n\t long N;\n\t public F (long D,long N) {\n\t super();\n\t this.D = D;\n\t this.N= N;\n\t }\n\t public static F composite(F f, F g) {\n\t return new F(f.D,f.N);\n\t }\n\t }\n\tstatic long modInv(long x) {\n return modPow(x, MOD2 - 2);\n }\n\tstatic long modPow(long x, long y) {\n long z = 1;\n while (y > 0) {\n if (y % 2 == 0) {\n x = (x * x) % MOD2;\n y /= 2;\n } else {\n z = (z * x) % MOD2;\n y--;\n }\n }\n return z;\n }\n\tstatic class LazySegTree {\n\t final int MAX;\n\n\t final int N;\n\t final int Log;\n\t final java.util.function.BinaryOperator Op;\n\t final S E;\n\t final java.util.function.BiFunction Mapping;\n\t final java.util.function.BinaryOperator Composition;\n\t final F Id;\n\n\t final S[] Dat;\n\t final F[] Laz;\n\n\t @SuppressWarnings(\"unchecked\")\n\t public LazySegTree(int n, java.util.function.BinaryOperator op, S e, java.util.function.BiFunction mapping, java.util.function.BinaryOperator composition, F id) {\n\t this.MAX = n;\n\t int k = 1;\n\t while (k < n) k <<= 1;\n\t this.N = k;\n\t this.Log = Integer.numberOfTrailingZeros(N);\n\t this.Op = op;\n\t this.E = e;\n\t this.Mapping = mapping;\n\t this.Composition = composition;\n\t this.Id = id;\n\t this.Dat = (S[]) new Object[N << 1];\n\t this.Laz = (F[]) new Object[N];\n\t java.util.Arrays.fill(Dat, E);\n\t java.util.Arrays.fill(Laz, Id);\n\t }\n\n\t public LazySegTree(S[] dat, java.util.function.BinaryOperator op, S e, java.util.function.BiFunction mapping, java.util.function.BinaryOperator composition, F id) {\n\t this(dat.length, op, e, mapping, composition, id);\n\t build(dat);\n\t }\n\n\t private void build(S[] dat) {\n\t int l = dat.length;\n\t System.arraycopy(dat, 0, Dat, N, l);\n\t for (int i = N - 1; i > 0; i--) {\n\t Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);\n\t }\n\t }\n\n\t private void push(int k) {\n\t if (Laz[k] == Id) return;\n\t int lk = k << 1 | 0, rk = k << 1 | 1;\n\t Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);\n\t Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);\n\t if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);\n\t if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);\n\t Laz[k] = Id;\n\t }\n\n\t private void pushTo(int k) {\n\t for (int i = Log; i > 0; i--) push(k >> i);\n\t }\n\n\t private void pushTo(int lk, int rk) {\n\t for (int i = Log; i > 0; i--) {\n\t if (((lk >> i) << i) != lk) push(lk >> i);\n\t if (((rk >> i) << i) != rk) push(rk >> i);\n\t }\n\t }\n\n\t private void updateFrom(int k) {\n\t k >>= 1;\n\t while (k > 0) {\n\t Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);\n\t k >>= 1;\n\t }\n\t }\n\n\t private void updateFrom(int lk, int rk) {\n\t for (int i = 1; i <= Log; i++) {\n\t if (((lk >> i) << i) != lk) {\n\t int lki = lk >> i;\n\t Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);\n\t }\n\t if (((rk >> i) << i) != rk) {\n\t int rki = (rk - 1) >> i;\n\t Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);\n\t }\n\t }\n\t }\n\n\t public void set(int p, S x) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t Dat[p] = x;\n\t updateFrom(p);\n\t }\n\n\t public S get(int p) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t return Dat[p];\n\t }\n\n\t public S prod(int l, int r) {\n\t if (l > r) {\n\t throw new IllegalArgumentException(\n\t String.format(\"Invalid range: [%d, %d)\", l, r)\n\t );\n\t }\n\t inclusiveRangeCheck(l);\n\t inclusiveRangeCheck(r);\n\t if (l == r) return E;\n\t l += N; r += N;\n\t pushTo(l, r);\n\t S sumLeft = E, sumRight = E;\n\t while (l < r) {\n\t if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);\n\t if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);\n\t l >>= 1; r >>= 1;\n\t }\n\t return Op.apply(sumLeft, sumRight);\n\t }\n\n\t public S allProd() {\n\t return Dat[1];\n\t }\n\n\t public void apply(int p, F f) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t Dat[p] = Mapping.apply(f, Dat[p]);\n\t updateFrom(p);\n\t }\n\n\t public void apply(int l, int r, F f) {\n\t if (l > r) {\n\t throw new IllegalArgumentException(\n\t String.format(\"Invalid range: [%d, %d)\", l, r)\n\t );\n\t }\n\t inclusiveRangeCheck(l);\n\t inclusiveRangeCheck(r);\n\t if (l == r) return;\n\t l += N; r += N;\n\t pushTo(l, r);\n\t for (int l2 = l, r2 = r; l2 < r2;) {\n\t if ((l2 & 1) == 1) {\n\t Dat[l2] = Mapping.apply(f, Dat[l2]);\n\t if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);\n\t l2++;\n\t }\n\t if ((r2 & 1) == 1) {\n\t r2--;\n\t Dat[r2] = Mapping.apply(f, Dat[r2]);\n\t if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);\n\t }\n\t l2 >>= 1; r2 >>= 1;\n\t }\n\t updateFrom(l, r);\n\t }\n\n\t public int maxRight(int l, java.util.function.Predicate g) {\n\t inclusiveRangeCheck(l);\n\t if (!g.test(E)) {\n\t throw new IllegalArgumentException(\"Identity element must satisfy the condition.\");\n\t }\n\t if (l == MAX) return MAX;\n\t l += N;\n\t pushTo(l);\n\t S sum = E;\n\t do {\n\t l >>= Integer.numberOfTrailingZeros(l);\n\t if (!g.test(Op.apply(sum, Dat[l]))) {\n\t while (l < N) {\n\t push(l);\n\t l = l << 1;\n\t if (g.test(Op.apply(sum, Dat[l]))) {\n\t sum = Op.apply(sum, Dat[l]);\n\t l++;\n\t }\n\t }\n\t return l - N;\n\t }\n\t sum = Op.apply(sum, Dat[l]);\n\t l++;\n\t } while ((l & -l) != l);\n\t return MAX;\n\t }\n\n\t public int minLeft(int r, java.util.function.Predicate g) {\n\t inclusiveRangeCheck(r);\n\t if (!g.test(E)) {\n\t throw new IllegalArgumentException(\"Identity element must satisfy the condition.\");\n\t }\n\t if (r == 0) return 0;\n\t r += N;\n\t pushTo(r - 1);\n\t S sum = E;\n\t do {\n\t r--;\n\t while (r > 1 && (r & 1) == 1) r >>= 1;\n\t if (!g.test(Op.apply(Dat[r], sum))) {\n\t while (r < N) {\n\t push(r);\n\t r = r << 1 | 1;\n\t if (g.test(Op.apply(Dat[r], sum))) {\n\t sum = Op.apply(Dat[r], sum);\n\t r--;\n\t }\n\t }\n\t return r + 1 - N;\n\t }\n\t sum = Op.apply(Dat[r], sum);\n\t } while ((r & -r) != r);\n\t return 0;\n\t }\n\n\t private void exclusiveRangeCheck(int p) {\n\t if (p < 0 || p >= MAX) {\n\t throw new IndexOutOfBoundsException(\n\t String.format(\"Index %d is not in [%d, %d).\", p, 0, MAX)\n\t );\n\t }\n\t }\n\n\t private void inclusiveRangeCheck(int p) {\n\t if (p < 0 || p > MAX) {\n\t throw new IndexOutOfBoundsException(\n\t String.format(\"Index %d is not in [%d, %d].\", p, 0, MAX)\n\t );\n\t }\n\t }\n\n\t // **************** DEBUG **************** //\n\n\t private int indent = 6;\n\n\t public void setIndent(int newIndent) {\n\t this.indent = newIndent;\n\t }\n\n\t @Override\n\t public String toString() {\n\t return toString(1, 0);\n\t }\n\n\t private String toString(int k, int sp) {\n\t if (k >= N) return indent(sp) + Dat[k];\n\t String s = \"\";\n\t s += toString(k << 1 | 1, sp + indent);\n\t s += \"\\n\";\n\t s += indent(sp) + Dat[k] + \"/\" + Laz[k];\n\t s += \"\\n\";\n\t s += toString(k << 1 | 0, sp + indent);\n\t return s;\n\t }\n\n\t private static String indent(int n) {\n\t StringBuilder sb = new StringBuilder();\n\t while (n --> 0) sb.append(' ');\n\t return sb.toString();\n\t }\n\t}\n\t\tstatic class InputReader { \n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n \n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n \n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n \n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n \n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n \n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n \n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n \n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou have a string S of length N.\nInitially, all characters in S are 1s.\n\nYou will perform queries Q times.\nIn the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit).\nThen, you must replace all characters from the L_i-th to the R_i-th (inclusive) with D_i.\n\nAfter each query, read the string S as a decimal integer, and print its value modulo 998,244,353.\n\nConstraints\n\n1 \\leq N, Q \\leq 200,000\n\n1 \\leq L_i \\leq R_i \\leq N\n\n1 \\leq D_i \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nL_1 R_1 D_1\n:\nL_Q R_Q D_Q\n\nOutput\n\nPrint Q lines.\nIn the i-th line print the value of S after the i-th query, modulo 998,244,353.\n\nSample Input 1\n\n8 5\n3 6 2\n1 4 7\n3 8 3\n2 2 2\n4 5 1\n\nSample Output 1\n\n11222211\n77772211\n77333333\n72333333\n72311333\n\nSample Input 2\n\n200000 1\n123 456 7\n\nSample Output 2\n\n641437905\n\nDon't forget to take the modulo.", "sample_input": "8 5\n3 6 2\n1 4 7\n3 8 3\n2 2 2\n4 5 1\n"}, "reference_outputs": ["11222211\n77772211\n77333333\n72333333\n72311333\n"], "source_document_id": "p02538", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou have a string S of length N.\nInitially, all characters in S are 1s.\n\nYou will perform queries Q times.\nIn the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit).\nThen, you must replace all characters from the L_i-th to the R_i-th (inclusive) with D_i.\n\nAfter each query, read the string S as a decimal integer, and print its value modulo 998,244,353.\n\nConstraints\n\n1 \\leq N, Q \\leq 200,000\n\n1 \\leq L_i \\leq R_i \\leq N\n\n1 \\leq D_i \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nL_1 R_1 D_1\n:\nL_Q R_Q D_Q\n\nOutput\n\nPrint Q lines.\nIn the i-th line print the value of S after the i-th query, modulo 998,244,353.\n\nSample Input 1\n\n8 5\n3 6 2\n1 4 7\n3 8 3\n2 2 2\n4 5 1\n\nSample Output 1\n\n11222211\n77772211\n77333333\n72333333\n72311333\n\nSample Input 2\n\n200000 1\n123 456 7\n\nSample Output 2\n\n641437905\n\nDon't forget to take the modulo.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 12923, "cpu_time_ms": 2209, "memory_kb": 113524}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s764469932", "group_id": "codeNet:p02542", "input_text": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.util.function.*;\npublic class Main implements Runnable {\n\tstatic boolean DEBUG;\n\tpublic static void main(String[] args) {\n\t\tDEBUG = args.length > 0 && args[0].equals(\"-DEBUG\");\n\t\tThread.setDefaultUncaughtExceptionHandler((t, e) -> { e.printStackTrace(); System.exit(1); });\n\t\tnew Thread(null, new Main(), \"\", 1 << 31).start();\n\t}\n\n\tpublic void run() {\n\t\tSolver solver = new Solver();\n\t\tsolver.solve();\n\t\tsolver.exit();\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate final InputStream in = System.in;\n\t\tprivate final byte[] buffer = new byte[1024];\n\t\tprivate int pointer = 0;\n\t\tprivate int buflen = 0;\n\t\tprivate boolean hasNextByte() {\n\t\t\tif(pointer < buflen) return true;\n\t\t\telse {\n\t\t\t\tpointer = 0;\n\t\t\t\ttry {\n\t\t\t\t\tbuflen = in.read(buffer);\n\t\t\t\t}catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\treturn buflen > 0;\n\t\t\t}\n\t\t}\n\t\tprivate int readByte() { if(hasNextByte()) return buffer[pointer ++]; else return -1; }\n\t\tprivate boolean isPrintableChar(int c) { return isPrintableChar(c, false); }\n\t\tprivate boolean isPrintableChar(int c, boolean includingSpace) { return (includingSpace ? 32 : 33) <= c && c <= 126; }\n\t\tprivate void skipUnprintable() { skipUnprintable(false); }\n\t\tprivate void skipUnprintable(boolean includingSpace) { while(hasNextByte() && !isPrintableChar(buffer[pointer], includingSpace)) pointer++; }\n\t\tprivate boolean hasNext() { return hasNext(false); }\n\t\tprivate boolean hasNext(boolean includingSpace) { skipUnprintable(includingSpace); return hasNextByte(); }\n\t\tprivate StringBuilder sb = new StringBuilder();\n\t\tpublic String next() { return next(false); }\n\t\tpublic String next(boolean includingSpace) {\n\t\t\tif(!hasNext(includingSpace)) throw new NoSuchElementException();\n\t\t\tsb.setLength(0);\n\t\t\tint b = readByte();\n\t\t\twhile(isPrintableChar(b, includingSpace)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tif(!hasNext()) throw new NoSuchElementException();\n\t\t\tlong n = 0;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif(b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\tif(b < '0' || '9' < b) throw new NumberFormatException();\n\t\t\twhile(true) {\n\t\t\t\tif('0' <= b && b <= '9') n = n * 10 + b - '0';\n\t\t\t\telse if(b == -1 || !isPrintableChar(b)) return minus ? -n : n;\n\t\t\t\telse throw new NumberFormatException();\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Solver {\n\t\tFastScanner sc = new FastScanner();\n\t\tpublic Solver() { }\n\n\t\tString ns() { return ns(false); }\n\t\tString ns(boolean includingSpace) { return sc.next(includingSpace); }\n\t\tString[] ns(int n) { return ns(n, false); }\n\t\tString[] ns(int n, boolean includingSpace) {\n\t\t\tString a[] = new String[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ns(includingSpace);\n\t\t\treturn a;\n\t\t}\n\t\tString[][] ns(int n, int m) { return ns(n, m, false); }\n\t\tString[][] ns(int n, int m, boolean includingSpace) {\n\t\t\tString a[][] = new String[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ns(m, includingSpace);\n\t\t\treturn a;\n\t\t}\n\t\tchar nc() { return ns().charAt(0); }\n\t\tchar[] nc(int n) {\n\t\t\tString str = ns();\n\t\t\tif(n < 0) n = str.length();\n\t\t\tchar a[] = new char[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = str.charAt(i);\n\t\t\treturn a;\n\t\t}\n\t\tchar[][] nc(int n, int m) {\n\t\t\tchar a[][] = new char[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nc(m);\n\t\t\treturn a;\n\t\t}\n\t\tboolean[] nb(int n, char t) {\n\t\t\tchar c[] = nc(-1);\n\t\t\tif(n < 0) n = c.length;\n\t\t\tboolean a[] = new boolean[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = c[i] == t;\n\t\t\treturn a;\n\t\t}\n\t\tboolean[][] nb(int n, int m, char t) {\n\t\t\tboolean a[][] = new boolean[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nb(m, t);\n\t\t\treturn a;\n\t\t}\n\t\tint ni() { return Math.toIntExact(sc.nextLong()); }\n\t\tint[] ni(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ni();\n\t\t\treturn a;\n\t\t}\n\t\tint[][] ni(int n, int m) {\n\t\t\tint a[][] = new int[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ni(m);\n\t\t\treturn a;\n\t\t}\n\t\tlong nl() { return sc.nextLong(); }\n\t\tlong[] nl(int n) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nl();\n\t\t\treturn a;\n\t\t}\n\t\tlong[][] nl(int n, int m) {\n\t\t\tlong a[][] = new long[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nl(m);\n\t\t\treturn a;\n\t\t}\n\t\tdouble nd() { return Double.parseDouble(sc.next()); }\n\t\tdouble[] nd(int n) {\n\t\t\tdouble a[] = new double[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nd();\n\t\t\treturn a;\n\t\t}\n\t\tdouble[][] nd(int n, int m) {\n\t\t\tdouble a[][] = new double[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nd(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairII npii() { return new PairII(ni(), ni()); }\n\t\tPairII[] npii(int n) {\n\t\t\tPairII a[] = new PairII[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npii();\n\t\t\treturn a;\n\t\t}\n\t\tPairII[][] npii(int n, int m) {\n\t\t\tPairII a[][] = new PairII[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npii(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairIL npil() { return new PairIL(ni(), nl()); }\n\t\tPairIL[] npil(int n) {\n\t\t\tPairIL a[] = new PairIL[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npil();\n\t\t\treturn a;\n\t\t}\n\t\tPairIL[][] npil(int n, int m) {\n\t\t\tPairIL a[][] = new PairIL[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npil(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairID npid() { return new PairID(ni(), nd()); }\n\t\tPairID[] npid(int n) {\n\t\t\tPairID a[] = new PairID[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npid();\n\t\t\treturn a;\n\t\t}\n\t\tPairID[][] npid(int n, int m) {\n\t\t\tPairID a[][] = new PairID[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npid(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairLI npli() { return new PairLI(nl(), ni()); }\n\t\tPairLI[] npli(int n) {\n\t\t\tPairLI a[] = new PairLI[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npli();\n\t\t\treturn a;\n\t\t}\n\t\tPairLI[][] npli(int n, int m) {\n\t\t\tPairLI a[][] = new PairLI[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npli(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairLL npll() { return new PairLL(nl(), nl()); }\n\t\tPairLL[] npll(int n) {\n\t\t\tPairLL a[] = new PairLL[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npll();\n\t\t\treturn a;\n\t\t}\n\t\tPairLL[][] npll(int n, int m) {\n\t\t\tPairLL a[][] = new PairLL[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npll(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairLD npld() { return new PairLD(nl(), nd()); }\n\t\tPairLD[] npld(int n) {\n\t\t\tPairLD a[] = new PairLD[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npld();\n\t\t\treturn a;\n\t\t}\n\t\tPairLD[][] npld(int n, int m) {\n\t\t\tPairLD a[][] = new PairLD[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npld(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairDI npdi() { return new PairDI(nd(), ni()); }\n\t\tPairDI[] npdi(int n) {\n\t\t\tPairDI a[] = new PairDI[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdi();\n\t\t\treturn a;\n\t\t}\n\t\tPairDI[][] npdi(int n, int m) {\n\t\t\tPairDI a[][] = new PairDI[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdi(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairDL npdl() { return new PairDL(nd(), nl()); }\n\t\tPairDL[] npdl(int n) {\n\t\t\tPairDL a[] = new PairDL[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdl();\n\t\t\treturn a;\n\t\t}\n\t\tPairDL[][] npdl(int n, int m) {\n\t\t\tPairDL a[][] = new PairDL[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdl(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairDD npdd() { return new PairDD(nd(), nd()); }\n\t\tPairDD[] npdd(int n) {\n\t\t\tPairDD a[] = new PairDD[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdd();\n\t\t\treturn a;\n\t\t}\n\t\tPairDD[][] npdd(int n, int m) {\n\t\t\tPairDD a[][] = new PairDD[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdd(m);\n\t\t\treturn a;\n\t\t}\n\n\t\tString booleanToString(boolean b) { return b ? \"#\" : \".\"; }\n\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tPrintWriter err = new PrintWriter(System.err);\n\t\tStringBuilder sb4prtln = new StringBuilder();\n\t\tvoid prt() { out.print(\"\"); }\n\t\t void prt(T a) { out.print(a); }\n\t\tvoid prtln() { out.println(\"\"); }\n\t\t void prtln(T a) { out.println(a); }\n\t\tvoid prtln(int... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(int element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(long... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(long element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(double... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(double element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(String... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(String element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(char... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(char element : a) sb4prtln.append(element);\n\t\t\tprtln(sb4prtln.toString());\n\t\t}\n\t\tvoid prtln(boolean... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(boolean element : a) sb4prtln.append(booleanToString(element));\n\t\t\tprtln(sb4prtln.toString());\n\t\t}\n\t\tvoid prtln(int[][] a) { for(int[] element : a) prtln(element); }\n\t\tvoid prtln(long[][] a) { for(long[] element : a) prtln(element); }\n\t\tvoid prtln(double[][] a) { for(double[] element : a) prtln(element); }\n\t\tvoid prtln(String[][] a) { for(String[] element : a) prtln(element); }\n\t\tvoid prtln(char[][] a) { for(char[] element : a) prtln(element); }\n\t\tvoid prtln(boolean[][] a) { for(boolean[] element : a) prtln(element); }\n\n\t\tString errconvert(int a) { return isINF(a) ? \"_\" : String.valueOf(a); }\n\t\tString errconvert(long a) { return isINF(a) ? \"_\" : String.valueOf(a); }\n\t\tvoid errprt(int a) { if(DEBUG) err.print(errconvert(a)); }\n\t\tvoid errprt(long a) { if(DEBUG) err.print(errconvert(a)); }\n\t\tvoid errprt() { if(DEBUG) err.print(\"\"); }\n\t\t void errprt(T a) { if(DEBUG) err.print(a); }\n\t\tvoid errprt(boolean a) { if(DEBUG) errprt(booleanToString(a)); }\n\t\tvoid errprtln() { if(DEBUG) err.println(\"\"); }\n\t\tvoid errprtln(int a) { if(DEBUG) err.println(errconvert(a)); }\n\t\tvoid errprtln(long a) { if(DEBUG) err.println(errconvert(a)); }\n\t\t void errprtln(T a) { if(DEBUG) err.println(a); }\n\t\tvoid errprtln(boolean a) { if(DEBUG) errprtln(booleanToString(a)); }\n\t\tvoid errprtln(int... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(int element : a) sb4prtln.append(errconvert(element)+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(long... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(long element : a) sb4prtln.append(errconvert(element)+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(double... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(double element : a) sb4prtln.append(element+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(String... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(String element : a) sb4prtln.append(element+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(char... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(char element : a) sb4prtln.append(element);\n\t\t\t\terrprtln(sb4prtln.toString());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(boolean... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(boolean element : a) sb4prtln.append(booleanToString(element));\n\t\t\t\terrprtln(sb4prtln.toString());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(Object[] a) { if(DEBUG) for(Object element : a) errprtln(element); }\n\t\tvoid errprtln(int[][] a) { if(DEBUG) for(int[] element : a) errprtln(element); }\n\t\tvoid errprtln(long[][] a) { if(DEBUG) for(long[] element : a) errprtln(element); }\n\t\tvoid errprtln(double[][] a) { if(DEBUG) for(double[] element : a) errprtln(element); }\n\t\tvoid errprtln(String[][] a) { if(DEBUG) for(String[] element : a) errprtln(element); }\n\t\tvoid errprtln(char[][] a) { if(DEBUG) for(char[] element : a) errprtln(element); }\n\t\tvoid errprtln(boolean[][] a) { if(DEBUG) for(boolean[] element : a) errprtln(element); }\n\t\tvoid errprtln(Object[][] a) { if(DEBUG) for(Object element : a) { errprtln(element); errprtln(); } }\n\n\t\tvoid reply(boolean b) { prtln(b ? \"Yes\" : \"No\"); }\n\t\tvoid REPLY(boolean b) { prtln(b ? \"YES\" : \"NO\"); }\n\n\t\tvoid flush() { out.flush(); if(DEBUG) err.flush(); }\n\t\tvoid assertion(boolean b) { if(!b) { flush(); throw new AssertionError(); } }\n\n\t\tvoid exit() { flush(); System.exit(0); }\n\t\t void exit(T a) { prtln(a); exit(); }\n\t\tvoid exit(int... a) { prtln(a); exit(); }\n\t\tvoid exit(long... a) { prtln(a); exit(); }\n\t\tvoid exit(double... a) { prtln(a); exit(); }\n\t\tvoid exit(String... a) { prtln(a); exit(); }\n\t\tvoid exit(char... a) { prtln(a); exit(); }\n\t\tvoid exit(boolean... a) { prtln(a); exit(); }\n\t\tvoid exit(int[][] a) { prtln(a); exit(); }\n\t\tvoid exit(long[][] a) { prtln(a); exit(); }\n\t\tvoid exit(double[][] a) { prtln(a); exit(); }\n\t\tvoid exit(String[][] a) { prtln(a); exit(); }\n\t\tvoid exit(char[][] a) { prtln(a); exit(); }\n\t\tvoid exit(boolean[][] a) { prtln(a); exit(); }\n\n\n\t\tfinal long INF = (long)1e18 + 7;\n\t\tboolean isPlusINF(long a) { return a > INF / 10; }\n\t\tboolean isMinusINF(long a) { return isPlusINF(- a); }\n\t\tboolean isINF(long a) { return isPlusINF(a) || isMinusINF(a); }\n\t\tfinal int I_INF = (int)1e9 + 7;\n\t\tboolean isPlusINF(int a) { return a > I_INF / 10; }\n\t\tboolean isMinusINF(int a) { return isPlusINF(- a); }\n\t\tboolean isINF(int a) { return isPlusINF(a) || isMinusINF(a); }\n\n\n\t\tint min(int a, int b) { return Math.min(a, b); }\n\t\tlong min(long a, long b) { return Math.min(a, b); }\n\t\tdouble min(double a, double b) { return Math.min(a, b); }\n\t\t> T min(T a, T b) { return a.compareTo(b) <= 0 ? a : b; }\n\t\tint min(int... x) {\n\t\t\tint min = x[0];\n\t\t\tfor(int val : x) min = min(min, val);\n\t\t\treturn min;\n\t\t}\n\t\tlong min(long... x) {\n\t\t\tlong min = x[0];\n\t\t\tfor(long val : x) min = min(min, val);\n\t\t\treturn min;\n\t\t}\n\t\tdouble min(double... x) {\n\t\t\tdouble min = x[0];\n\t\t\tfor(double val : x) min = min(min, val);\n\t\t\treturn min;\n\t\t}\n\t\tint max(int a, int b) { return Math.max(a, b); }\n\t\tlong max(long a, long b) { return Math.max(a, b); }\n\t\tdouble max(double a, double b) { return Math.max(a, b); }\n\t\t> T max(T a, T b) { return a.compareTo(b) >= 0 ? a : b; }\n\t\tint max(int... x) {\n\t\t\tint max = x[0];\n\t\t\tfor(int val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\tlong max(long... x) {\n\t\t\tlong max = x[0];\n\t\t\tfor(long val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\tdouble max(double... x) {\n\t\t\tdouble max = x[0];\n\t\t\tfor(double val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\t> T max(T[] x) {\n\t\t\tT max = x[0];\n\t\t\tfor(T val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\tint max(int[][] a) {\n\t\t\tint max = a[0][0];\n\t\t\tfor(int[] ele : a) max = max(max, max(ele));\n\t\t\treturn max;\n\t\t}\n\t\tlong max(long[][] a) {\n\t\t\tlong max = a[0][0];\n\t\t\tfor(long[] ele : a) max = max(max, max(ele));\n\t\t\treturn max;\n\t\t}\n\t\tdouble max(double[][] a) {\n\t\t\tdouble max = a[0][0];\n\t\t\tfor(double[] ele : a) max = max(max, max(ele));\n\t\t\treturn max;\n\t\t}\n\t\t> T max(T[][] a) {\n\t\t\tT max = a[0][0];\n\t\t\tfor(T[] ele : a) max = max(max, max(ele));\n\t\t\treturn max;\n\t\t}\n\t\tlong sum(int... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(int element : a) sum += element;\n\t\t\treturn sum;\n\t\t}\n\t\tlong sum(long... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(long element : a) sum += element;\n\t\t\treturn sum;\n\t\t}\n\t\tdouble sum(double... a) {\n\t\t\tdouble sum = 0;\n\t\t\tfor(double element : a) sum += element;\n\t\t\treturn sum;\n\t\t}\n\t\tlong sum(boolean... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(boolean element : a) sum += element ? 1 : 0;\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(int[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i];\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(long[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i];\n\t\t\treturn sum;\n\t\t}\n\t\tdouble[] sums(double[] a) {\n\t\t\tdouble sum[] = new double[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i];\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(boolean[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + (a[i] ? 1 : 0);\n\t\t\treturn sum;\n\t\t}\n\t\tlong[][] sums(int[][] a) {\n\t\t\tlong sum[][] = new long[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tlong[][] sums(long[][] a) {\n\t\t\tlong sum[][] = new long[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tdouble[][] sums(double[][] a) {\n\t\t\tdouble sum[][] = new double[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tlong[][] sums(boolean[][] a) {\n\t\t\tlong sum[][] = new long[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + (a[i][j] ? 1 : 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tint constrain(int x, int l, int r) { return min(max(x, min(l, r)), max(l, r)); }\n\t\tlong constrain(long x, long l, long r) { return min(max(x, min(l, r)), max(l, r)); }\n\t\tdouble constrain(double x, double l, double r) { return min(max(x, min(l, r)), max(l, r)); }\n\t\tint abs(int x) { return x >= 0 ? x : - x; }\n\t\tlong abs(long x) { return x >= 0 ? x : - x; }\n\t\tdouble abs(double x) { return x >= 0 ? x : - x; }\n\t\tint signum(int x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }\n\t\tint signum(long x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }\n\t\tint signum(double x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }\n\t\tlong round(double x) { return Math.round(x); }\n\t\tlong floor(double x) { return (long)Math.floor(x); }\n\t\tint divfloor(int a, int b) { return signum(a) == signum(b) ? a / b : - divceil(abs(a), abs(b)); }\n\t\tlong divfloor(long a, long b) { return signum(a) == signum(b) ? a / b : - divceil(abs(a), abs(b)); }\n\t\tlong ceil(double x) { return (long)Math.ceil(x); }\n\t\tint divceil(int a, int b) { return a >= 0 && b > 0 ? (a + b - 1) / b\n\t\t\t\t\t\t\t\t\t\t\t: a < 0 && b < 0 ? divceil(abs(a), abs(b))\n\t\t\t\t\t\t\t\t\t\t\t: - divfloor(abs(a), abs(b)); }\n\t\tlong divceil(long a, long b) { return a >= 0 && b > 0 ? (a + b - 1) / b\n\t\t\t\t\t\t\t\t\t\t\t: a < 0 && b < 0 ? divceil(abs(a), abs(b))\n\t\t\t\t\t\t\t\t\t\t\t: - divfloor(abs(a), abs(b)); }\n\t\tdouble sqrt(int x) { return Math.sqrt((double)x); }\n\t\tdouble sqrt(long x) { return Math.sqrt((double)x); }\n\t\tdouble sqrt(double x) { return Math.sqrt(x); }\n\t\tlong fact(int n) {\n\t\t\tlong ans = 1;\n\t\t\tfor(int i = 1; i <= n; i ++) ans = Math.multiplyExact(ans, i);\n\t\t\treturn ans;\n\t\t}\n\t\tdouble pow(double x, double y) { return Math.pow(x, y); }\n\t\tlong pow(long x, long y) {\n\t\t\tlong ans = 1;\n\t\t\twhile(true) {\n\t\t\t\tif(y % 2 != 0) ans = Math.multiplyExact(ans, x);\n\t\t\t\ty /= 2;\n\t\t\t\tif(y <= 0) return ans;\n\t\t\t\tx = Math.multiplyExact(x, x);\n\t\t\t}\n\t\t}\n\t\tint gcd(int a, int b) {\n\t\t\twhile(true) {\n\t\t\t\tif(b == 0) return a;\n\t\t\t\tint tmp = a;\n\t\t\t\ta = b;\n\t\t\t\tb = tmp % b;\n\t\t\t}\n\t\t}\n\t\tlong gcd(long a, long b) {\n\t\t\twhile(true) {\n\t\t\t\tif(b == 0) return a;\n\t\t\t\tlong tmp = a;\n\t\t\t\ta = b;\n\t\t\t\tb = tmp % b;\n\t\t\t}\n\t\t}\n\t\tlong lcm(long a, long b) { return a / gcd(a, b) * b; }\n\t\tint gcd(int... a) {\n\t\t\tint gcd = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) gcd = gcd(gcd, a[i]);\n\t\t\treturn gcd;\n\t\t}\n\t\tlong gcd(long... a) {\n\t\t\tlong gcd = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) gcd = gcd(gcd, a[i]);\n\t\t\treturn gcd;\n\t\t}\n\t\tdouble random() { return Math.random(); }\n\t\tint random(int max) { return (int)floor(random() * max); }\n\t\tlong random(long max) { return floor(random() * max); }\n\t\tdouble random(double max) { return random() * max; }\n\t\tint random(int min, int max) { return random(max - min) + min; }\n\t\tlong random(long min, long max) { return random(max - min) + min; }\n\t\tdouble random(double min, double max) { return random(max - min) + min; }\n\n\t\tboolean isUpper(char a) { return a >= 'A' && a <= 'Z'; }\n\t\tboolean isLower(char a) { return a >= 'a' && a <= 'z'; }\n\t\tint upperToInt(char a) { return a - 'A'; }\n\t\tint lowerToInt(char a) { return a - 'a'; }\n\t\tint numToInt(char a) { return a - '0'; }\n\t\tint charToInt(char a) { return a >= 'a' ? lowerToInt(a) : a >= 'A' ? upperToInt(a) : numToInt(a); }\n\t\tchar intToUpper(int a) { return (char)(a + 'A'); }\n\t\tchar intToLower(int a) { return (char)(a + 'a'); }\n\t\tchar intToNum(int a) { return (char)(a + '0'); }\n\t\tint[] charToInt(char[] a) {\n\t\t\tint array[] = new int[a.length];\n\t\t\tfor(int i = 0; i < a.length; i ++) array[i] = charToInt(a[i]);\n\t\t\treturn array;\n\t\t}\n\n\t\tlong[] div(long a) {\n\t\t\tList divList = new ArrayList<>();\n\t\t\tfor(long i = 1; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tdivList.add(i);\n\t\t\t\t\tif(i * i != a) divList.add(a / i);\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong div[] = new long[divList.size()];\n\t\t\tfor(int i = 0; i < divList.size(); i ++) div[i] = divList.get(i);\n\t\t\tArrays.sort(div);\n\t\t\treturn div;\n\t\t}\n\n\t\tPairLL[] factor(long a) {\n\t\t\tList factorList = new ArrayList<>();\n\t\t\tfor(long i = 2; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tlong cnt = 0;\n\t\t\t\t\twhile(a % i == 0) { a /= i; cnt ++; }\n\t\t\t\t\tfactorList.add(new PairLL(i, cnt));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(a > 1) factorList.add(new PairLL(a, 1));\n\t\t\tPairLL factor[] = new PairLL[factorList.size()];\n\t\t\tfor(int i = 0; i < factorList.size(); i ++) factor[i] = factorList.get(i);\n\t\t\tArrays.sort(factor);\n\t\t\treturn factor;\n\t\t}\n\n\t\tboolean isPrime(long x) {\n\t\t\tboolean ok = x > 1;\n\t\t\tfor(long i = 2; i * i <= x; i ++) {\n\t\t\t\tok &= x % i != 0;\n\t\t\t\tif(!ok) return ok;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean[] prime(int num) {\n\t\t\tboolean prime[] = new boolean[num];\n\t\t\tfill(prime, true);\n\t\t\tif(num > 0) prime[0] = false;\n\t\t\tif(num > 1) prime[1] = false;\n\t\t\tfor(int i = 2; i < num; i ++) if(prime[i]) for(int j = 2; i * j < num; j ++) prime[i * j] = false;\n\t\t\treturn prime;\n\t\t}\n\n\t\tlong[][] countElements(long[] a, boolean sort) {\n\t\t\tint len = a.length;\n\t\t\tlong array[] = new long[len];\n\t\t\tfor(int i = 0; i < len; i ++) array[i] = a[i];\n\t\t\tif(sort) Arrays.sort(array);\n\t\t\tList elem = new ArrayList();\n\t\t\tList cnt = new ArrayList();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add(array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else tmp ++;\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\t\tlong[][] countElements(String str, boolean sort) {\n\t\t\tint len = str.length();\n\t\t\tchar array[] = str.toCharArray();\n\t\t\tif(sort) Arrays.sort(array);\n\t\t\tList elem = new ArrayList();\n\t\t\tList cnt = new ArrayList();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add((long)array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else tmp ++;\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\n\t\tint[] baseConvert(long x, int n, int len) {\n\t\t\tint digit[] = new int[len];\n\t\t\tint i = 0;\n\t\t\tlong tmp = x;\n\t\t\twhile(tmp > 0 && i < len) { digit[i ++] = (int)(tmp % n); tmp /= n; }\n\t\t\treturn digit;\n\t\t}\n\t\tint[] baseConvert(long x, int n) {\n\t\t\tlong tmp = x;\n\t\t\tint len = 0;\n\t\t\twhile(tmp > 0) { tmp /= n; len ++; }\n\t\t\treturn baseConvert(x, n, len);\n\t\t}\n\t\tint[] baseConvert(int x, int n, int len) {\n\t\t\tint digit[] = new int[len];\n\t\t\tint i = 0;\n\t\t\tint tmp = x;\n\t\t\twhile(tmp > 0 && i < len) { digit[i ++] = (int)(tmp % n); tmp /= n; }\n\t\t\treturn digit;\n\t\t}\n\t\tint[] baseConvert(int x, int n) {\n\t\t\tint tmp = x;\n\t\t\tint len = 0;\n\t\t\twhile(tmp > 0) { tmp /= n; len ++; }\n\t\t\treturn baseConvert(x, n, len);\n\t\t}\n\t\tlong[] baseConvert(long x, long n, int len) {\n\t\t\tlong digit[] = new long[len];\n\t\t\tint i = 0;\n\t\t\tlong tmp = x;\n\t\t\twhile(tmp > 0 && i < len) { digit[i ++] = tmp % n; tmp /= n; }\n\t\t\treturn digit;\n\t\t}\n\t\tlong[] baseConvert(long x, long n) {\n\t\t\tlong tmp = x;\n\t\t\tint len = 0;\n\t\t\twhile(tmp > 0) { tmp /= n; len ++; }\n\t\t\treturn baseConvert(x, n, len);\n\t\t}\n\n\t\tint numDigits(long a) { return Long.toString(a).length(); }\n\t\tlong bitFlag(int a) { return 1L << (long)a; }\n\t\tboolean isFlagged(long x, int a) { return (x & bitFlag(a)) != 0; }\n\n\t\tlong countString(String str, String a) { return (str.length() - str.replace(a, \"\").length()) / a.length(); }\n\t\tlong countStringAll(String str, String a) { return str.length() - str.replaceAll(a, \"\").length(); }\n\n\n\t\tString reverse(String str) { return (new StringBuilder(str)).reverse().toString(); }\n\t\tvoid reverse(String[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(int[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(long[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(double[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(char[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(boolean[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\t void reverse(T[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid fill(int[] array, int x) { Arrays.fill(array, x); }\n\t\tvoid fill(long[] array, long x) { Arrays.fill(array, x); }\n\t\tvoid fill(double[] array, double x) { Arrays.fill(array, x); }\n\t\tvoid fill(char[] array, char x) { Arrays.fill(array, x); }\n\t\tvoid fill(boolean[] array, boolean x) { Arrays.fill(array, x); }\n\t\tvoid fill(int[][] array, int x) { for(int[] a : array) fill(a, x); }\n\t\tvoid fill(long[][] array, long x) { for(long[] a : array) fill(a, x); }\n\t\tvoid fill(double[][] array, double x) { for(double[] a : array) fill(a, x); }\n\t\tvoid fill(char[][] array, char x) { for(char[] a : array) fill(a, x); }\n\t\tvoid fill(boolean[][] array, boolean x) { for(boolean[] a : array) fill(a, x); }\n\t\tvoid fill(int[][][] array, int x) { for(int[][] a : array) fill(a, x); }\n\t\tvoid fill(long[][][] array, long x) { for(long[][] a : array) fill(a, x); }\n\t\tvoid fill(double[][][] array, double x) { for(double[][] a : array) fill(a, x); }\n\t\tvoid fill(char[][][] array, char x) { for(char[][] a : array) fill(a, x); }\n\t\tvoid fill(boolean[][][] array, boolean x) { for(boolean[][] a : array) fill(a, x); }\n\n\t\tint[] resize(int[] array, int m, int x) {\n\t\t\tint resized[] = new int[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tlong[] resize(long[] array, int m, int x) {\n\t\t\tlong resized[] = new long[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tdouble[] resize(double[] array, int m, int x) {\n\t\t\tdouble resized[] = new double[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tchar[] resize(char[] array, int m, int x) {\n\t\t\tchar resized[] = new char[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tboolean[] resize(boolean[] array, int m, int x) {\n\t\t\tboolean resized[] = new boolean[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tObject[] resize(Object[] array, int m, int x) {\n\t\t\tObject resized[] = new Object[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\n\t\tvoid shuffleArray(int[] array){\n\t\t\tfor(int i = 0; i < array.length; i ++){\n\t\t\t\tint tmp = array[i];\n\t\t\t\tint randomPos = random(i, array.length);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\t\tvoid shuffleArray(long[] array){\n\t\t\tfor(int i = 0; i < array.length; i ++){\n\t\t\t\tlong tmp = array[i];\n\t\t\t\tint randomPos = random(i, array.length);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\t\tvoid shuffleArray(double[] array){\n\t\t\tfor(int i = 0; i < array.length; i ++){\n\t\t\t\tdouble tmp = array[i];\n\t\t\t\tint randomPos = random(i, array.length);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\t\tint[] randomi(int num, int max){\n\t\t\tint array[] = new int[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(max);\n\t\t\treturn array;\n\t\t}\n\t\tlong[] randoml(int num, long max){\n\t\t\tlong array[] = new long[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(max);\n\t\t\treturn array;\n\t\t}\n\t\tdouble[] randomd(int num, double max){\n\t\t\tdouble array[] = new double[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(max);\n\t\t\treturn array;\n\t\t}\n\t\tint[] randomi(int num, int min, int max){\n\t\t\tint array[] = new int[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(min, max);\n\t\t\treturn array;\n\t\t}\n\t\tlong[] randoml(int num, long min, long max){\n\t\t\tlong array[] = new long[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(min, max);\n\t\t\treturn array;\n\t\t}\n\t\tdouble[] randomd(int num, double min, double max){\n\t\t\tdouble array[] = new double[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(min, max);\n\t\t\treturn array;\n\t\t}\n\n\t\tvoid swap(String[] array, int i, int j) {\n\t\t\tString tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(int[] array, int i, int j) {\n\t\t\tint tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(long[] array, int i, int j) {\n\t\t\tlong tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(double[] array, int i, int j) {\n\t\t\tdouble tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(char[] array, int i, int j) {\n\t\t\tchar tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(boolean[] array, int i, int j) {\n\t\t\tboolean tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\t void swap(T[] array, int i, int j) {\n\t\t\tT tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\n\t\tint[] compress(int[] a) {\n\t\t\tint num = a.length;\n\t\t\tSet ss = new TreeSet<>();\n\t\t\tfor(int i = 0; i < num; i ++) ss.add(a[i]);\n\t\t\tint compressed[] = new int[ss.size()];\n\t\t\tint j = 0;\n\t\t\tfor(Integer x : ss) compressed[j ++] = x;\n\t\t\tfor(int i = 0; i < num; i ++) a[i] = lowerBound(compressed, a[i]);\n\t\t\treturn compressed;\n\t\t}\n\t\tlong[] compress(long[] a) {\n\t\t\tint num = a.length;\n\t\t\tSet ss = new TreeSet<>();\n\t\t\tfor(int i = 0; i < num; i ++) ss.add(a[i]);\n\t\t\tlong compressed[] = new long[ss.size()];\n\t\t\tint j = 0;\n\t\t\tfor(Long x : ss) compressed[j ++] = x;\n\t\t\tfor(int i = 0; i < num; i ++) a[i] = lowerBound(compressed, a[i]);\n\t\t\treturn compressed;\n\t\t}\n\t\tdouble[] compress(double[] a) {\n\t\t\tint num = a.length;\n\t\t\tSet ss = new TreeSet<>();\n\t\t\tfor(int i = 0; i < num; i ++) ss.add(a[i]);\n\t\t\tdouble compressed[] = new double[ss.size()];\n\t\t\tint j = 0;\n\t\t\tfor(Double x : ss) compressed[j ++] = x;\n\t\t\tfor(int i = 0; i < num; i ++) a[i] = lowerBound(compressed, a[i]);\n\t\t\treturn compressed;\n\t\t}\n\n\n\t\tint lowerBound(int[] array, int key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\tint lowerBound(int[] array, int key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\tint upperBound(int[] array, int key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\tint upperBound(int[] array, int key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\tint cntBS(int[] array, int key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\tint cntBS(int[] array, int key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\tint binarySearch(int[] array, int key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean isOKforBinarySearch(int[] array, int index, int key, boolean greater, boolean equals) {\n\t\t\treturn (array[index] > key && greater) || (array[index] < key && !greater) || (array[index] == key && equals);\n\t\t}\n\t\tint lowerBound(long[] array, long key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\tint lowerBound(long[] array, long key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\tint upperBound(long[] array, long key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\tint upperBound(long[] array, long key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\tint cntBS(long[] array, long key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\tint cntBS(long[] array, long key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\tint binarySearch(long[] array, long key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean isOKforBinarySearch(long[] array, int index, long key, boolean greater, boolean equals) {\n\t\t\treturn (array[index] > key && greater) || (array[index] < key && !greater) || (array[index] == key && equals);\n\t\t}\n\t\tint lowerBound(double[] array, double key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\tint lowerBound(double[] array, double key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\tint upperBound(double[] array, double key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\tint upperBound(double[] array, double key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\tint cntBS(double[] array, double key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\tint cntBS(double[] array, double key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\tint binarySearch(double[] array, double key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean isOKforBinarySearch(double[] array, int index, double key, boolean greater, boolean equals) {\n\t\t\treturn (array[index] > key && greater) || (array[index] < key && !greater) || (array[index] == key && equals);\n\t\t}\n\t\t> int lowerBound(T[] array, T key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\t> int lowerBound(T[] array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\t> int upperBound(T[] array, T key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\t> int upperBound(T[] array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\t> int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\t> int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\t> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\t> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\t> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\t> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t> int binarySearch(T[] array, T key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t> boolean isOKforBinarySearch(T[] array, int index, T key, boolean greater, boolean equals) {\n\t\t\tint compare = array[index].compareTo(key);\n\t\t\treturn (compare > 0 && greater) || (compare < 0 && !greater) || (compare == 0 && equals);\n\t\t}\n\t\t int lowerBound(T[] array, T key, Comparator c) {\n\t\t\treturn BS(array, key, true, true, true, c);\n\t\t}\n\t\t int lowerBound(T[] array, T key, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok, c);\n\t\t}\n\t\t int upperBound(T[] array, T key, Comparator c) {\n\t\t\treturn BS(array, key, true, true, false, c);\n\t\t}\n\t\t int upperBound(T[] array, T key, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok, c);\n\t\t}\n\t\t int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, c);\n\t\t}\n\t\t int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok, c);\n\t\t}\n\t\t int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, c);\n\t\t}\n\t\t int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok, c);\n\t\t}\n\t\t int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count, Comparator c) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok, c);\n\t\t}\n\t\t int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok, Comparator c) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok, c);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t int binarySearch(T[] array, T key, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals, c)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t boolean isOKforBinarySearch(T[] array, int index, T key, boolean greater, boolean equals, Comparator c) {\n\t\t\tint compare = c.compare(array[index], key);\n\t\t\treturn (compare > 0 && greater) || (compare < 0 && !greater) || (compare == 0 && equals);\n\t\t}\n\t\t> int lowerBound(List array, T key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\t> int lowerBound(List array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\t> int upperBound(List array, T key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\t> int upperBound(List array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\t> int cntBS(List array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\t> int cntBS(List array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\t> int BS(List array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\t> int BS(List array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\t> int BS(List array, T key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.size() : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.size();\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\t> int BS(List array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t> int binarySearch(List array, T key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t> boolean isOKforBinarySearch(List array, int index, T key, boolean greater, boolean equals) {\n\t\t\tint compare = array.get(index).compareTo(key);\n\t\t\treturn (compare > 0 && greater) || (compare < 0 && !greater) || (compare == 0 && equals);\n\t\t}\n\t\t int lowerBound(List array, T key, Comparator c) {\n\t\t\treturn BS(array, key, true, true, true, c);\n\t\t}\n\t\t int lowerBound(List array, T key, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok, c);\n\t\t}\n\t\t int upperBound(List array, T key, Comparator c) {\n\t\t\treturn BS(array, key, true, true, false, c);\n\t\t}\n\t\t int upperBound(List array, T key, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok, c);\n\t\t}\n\t\t int cntBS(List array, T key, boolean ascending, boolean greater, boolean equals, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, c);\n\t\t}\n\t\t int cntBS(List array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok, c);\n\t\t}\n\t\t int BS(List array, T key, boolean ascending, boolean greater, boolean equals, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, c);\n\t\t}\n\t\t int BS(List array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok, c);\n\t\t}\n\t\t int BS(List array, T key, boolean ascending, boolean greater, boolean equals, boolean count, Comparator c) {\n\t\t\tint ng = ascending ^ greater ? array.size() : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.size();\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok, c);\n\t\t}\n\t\t int BS(List array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok, Comparator c) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok, c);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t int binarySearch(List array, T key, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals, c)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t boolean isOKforBinarySearch(List array, int index, T key, boolean greater, boolean equals, Comparator c) {\n\t\t\tint compare = c.compare(array.get(index), key);\n\t\t\treturn (compare > 0 && greater) || (compare < 0 && !greater) || (compare == 0 && equals);\n\t\t}\n\n\t\tPairLL binaryRangeSearch(long left, long right, UnaryOperator op, boolean minimize) {\n\t\t\tlong ok1 = right, ng1 = left;\n\t\t\twhile(abs(ok1 - ng1) > 1) {\n\t\t\t\tlong mid = (ok1 + ng1) / 2;\n\t\t\t\tboolean isOK = (op.apply(mid + 1) - op.apply(mid)) * (minimize ? 1 : -1) >= 0;\n\t\t\t\tif(isOK) ok1 = mid; else ng1 = mid;\n\t\t\t}\n\t\t\tlong ok2 = left, ng2 = right;\n\t\t\twhile(abs(ok2 - ng2) > 1) {\n\t\t\t\tlong mid = (ok2 + ng2) / 2;\n\t\t\t\tboolean isOK = (op.apply(mid - 1) - op.apply(mid)) * (minimize ? 1 : -1) >= 0;\n\t\t\t\tif(isOK) ok2 = mid; else ng2 = mid;\n\t\t\t}\n\t\t\treturn new PairLL(ok1, ok2); //[l, r]\n\t\t}\n\n\t\tdouble ternarySearch(double left, double right, UnaryOperator op, boolean minimize, int loop) {\n\t\t\tfor(int cnt = 0; cnt < loop; cnt ++) {\n\t\t\t\tdouble m1 = (left * 2 + right) / 3.0;\n\t\t\t\tdouble m2 = (left + right * 2) / 3.0;\n\t\t\t\tif(op.apply(m1) > op.apply(m2) ^ minimize) right = m2; else left = m1;\n\t\t\t}\n\t\t\treturn (left + right) / 2.0;\n\t\t}\n\n\n\t\t// mods\n\t\tfinal long MOD = (long)1e9 + 7; // 998244353;\n\t\tlong mod(long x) { x %= MOD; return x + (x < 0 ? MOD : 0); }\n\t\tvoid mod(long[] a) { for(int i = 0; i < a.length; i ++) a[i] = mod(a[i]); }\n\t\tvoid mod(long[][] a) { for(int i = 0; i < a.length; i ++) mod(a[i]); }\n\t\tvoid mod(long[][][] a) { for(int i = 0; i < a.length; i ++) mod(a[i]); }\n\n\t\tlong pow_m(long x, long y) {\n\t\t\tx = mod(x);\n\t\t\tlong ans = 1;\n\t\t\tfor(; y > 0; y /= 2) {\n\t\t\t\tif(y % 2 != 0) ans = mod(ans * x);\n\t\t\t\tx = mod(x * x);\n\t\t\t}\n\t\t\treturn ans;\n\t\t}\n\t\tlong[] pows_m(long x, int max) {\n\t\t\tlong pow[] = new long[max + 1];\n\t\t\tpow[0] = 1;\n\t\t\tfor(int i = 0; i < max; i ++) pow[i + 1] = mod(pow[i] * x);\n\t\t\treturn pow;\n\t\t}\n\t\tlong fact_m(int n) {\n\t\t\tlong ans = 1;\n\t\t\tfor(int i = 1; i <= n; i ++) ans = mod(ans * i);\n\t\t\treturn ans;\n\t\t}\n\n\t\tfinal int MAX_INV_SIZE = 100_100;\n\t\tMap invMap = new HashMap<>();\n\t\tlong inv(long x) {\n\t\t\tx = mod(x);\n\t\t\tif(invMap.containsKey(x)) return invMap.get(x);\n\t\t\tif(invMap.size() >= MAX_INV_SIZE) return calInv(x);\n\t\t\tinvMap.put(x, calInv(x));\n\t\t\treturn invMap.get(x);\n\t\t}\n\t\tlong calInv(long x) { return pow_m(x, MOD - 2); }\n\n\t\tfinal int MAX_FACT = 5_000_100;\n\t\tlong fact[];\n\t\tlong invFact[];\n\t\tboolean isFactPrepared = false;\n\t\tMap factMap;\n\t\tvoid prepareFact() {\n\t\t\tfact = new long[MAX_FACT];\n\t\t\tfill(fact, 0);\n\t\t\tinvFact = new long[MAX_FACT];\n\t\t\tfill(invFact, 0);\n\t\t\tfact[0] = 1;\n\t\t\tint maxIndex = min(MAX_FACT, (int)MOD);\n\t\t\tfor(int i = 1; i < maxIndex; i ++) fact[i] = mod(fact[i - 1] * i);\n\t\t\tinvFact[maxIndex - 1] = inv(fact[maxIndex - 1]);\n\t\t\tfor(int i = maxIndex - 1; i > 0; i --) invFact[i - 1] = mod(invFact[i] * i);\n\n\t\t\tfactMap = new HashMap<>();\n\t\t\tisFactPrepared = true;\n\t\t}\n\n\t\tlong P(int n, int r) {\n\t\t\tif(!isFactPrepared) { prepareFact(); }\n\t\t\tif(n < 0 || r < 0 || n < r) { return 0; }\n\t\t\tif(n >= MAX_FACT) {\n\t\t\t\tif(!factMap.containsKey(n)) {\n\t\t\t\t\tlong largeFact[] = new long[MAX_FACT];\n\t\t\t\t\tfactMap.put(n, largeFact);\n\t\t\t\t\tfill(largeFact, -INF);\n\t\t\t\t\tlargeFact[0] = 1;\n\t\t\t\t}\n\t\t\t\tlong largeFact[] = factMap.get(n);\n\t\t\t\tint i = r;\n\t\t\t\twhile(isINF(largeFact[i])) i --;\n\t\t\t\tfor(; i < r; i ++) largeFact[i + 1] = mod(largeFact[i] * (n - i));\n\t\t\t\treturn largeFact[r];\n\t\t\t}\n\t\t\treturn mod(fact[n] * invFact[n - r]);\n\t\t}\n\t\tlong C(int n, int r) {\n\t\t\tif(!isFactPrepared) prepareFact();\n\t\t\tif(n < 0 || r < 0 || n < r) return 0;\n\t\t\treturn mod(P(n, r) * invFact[r]);\n\t\t}\n\t\tlong H(int n, int r) { return C((n - 1) + r, r); }\n\n\n\t\t// grid\n\t\tclass Grids {\n\t\t\tint h;\n\t\t\tint w;\n\t\t\tGrid[][] gs;\n\t\t\tGrid[] gi;\n\t\t\tGrids(int h, int w) {\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t\tgs = new Grid[h][w];\n\t\t\t\tgi = new Grid[h * w];\n\t\t\t\tfor(int i = 0; i < h; i ++) {\n\t\t\t\t\tfor(int j = 0; j < w; j ++) {\n\t\t\t\t\t\tgs[i][j] = new Grid(i, j, h, w);\n\t\t\t\t\t\tgi[gs[i][j].i] = gs[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid init(boolean[][] b) {\n\t\t\t\tfor(int i = 0; i < h; i ++) for(int j = 0; j < w; j ++) gs[i][j].b = b[i][j];\n\t\t\t}\n\t\t\tvoid init(long[][] val) {\n\t\t\t\tfor(int i = 0; i < h; i ++) for(int j = 0; j < w; j ++) gs[i][j].val = val[i][j];\n\t\t\t}\n\n\t\t\tGrid get(int x, int y) { return isValid(x, y, h, w) ? gs[x][y] : null; }\n\t\t\tGrid get(int i) { return get(i / w, i % w); }\n\n\t\t\tint dx[] = {0, -1, 1, 0, 0, -1, 1, -1, 1};\n\t\t\tint dy[] = {0, 0, 0, -1, 1, -1, -1, 1, 1};\n\t\t\tGrid next(int x, int y, int i) { return next(gs[x][y], i); }\n\t\t\tGrid next(Grid g, int i) {\n\t\t\t\treturn isValid(g.x + dx[i], g.y + dy[i], g.h, g.w)\n\t\t\t\t\t? gs[g.x + dx[i]][g.y + dy[i]]\n\t\t\t\t\t: null;\n\t\t\t}\n\t\t}\n\t\tclass Grid implements Comparable {\n\t\t\tint x;\n\t\t\tint y;\n\t\t\tint h;\n\t\t\tint w;\n\t\t\tint i;\n\t\t\tboolean b;\n\t\t\tlong val;\n\n\t\t\tGrid() { }\n\t\t\tGrid(int x, int y, int h, int w) { init(x, y, h, w, false, 0); }\n\t\t\tGrid(int x, int y, int h, int w, boolean b) { init(x, y, h, w, b, 0); }\n\t\t\tGrid(int x, int y, int h, int w, long val) { init(x, y, h, w, false, val); }\n\t\t\tGrid(int x, int y, int h, int w, boolean b, long val) { init(x, y, h, w, b, val); }\n\n\t\t\tvoid init(int x, int y, int h, int w, boolean b, long val) {\n\t\t\t\tthis.x = x;\n\t\t\t\tthis.y = y;\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t\tthis.b = b;\n\t\t\t\tthis.val = val;\n\t\t\t\tthis.i = x * w + y;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+x+\", \"+y+\")\"+\" \"+booleanToString(b)+\" \"+val; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(x, y, h, w, b, val); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tGrid that = (Grid) obj;\n\t\t\t\tif(this.x != that.x) return false;\n\t\t\t\tif(this.y != that.y) return false;\n\t\t\t\tif(this.h != that.h) return false;\n\t\t\t\tif(this.w != that.w) return false;\n\t\t\t\tif(this.b != that.b) return false;\n\t\t\t\tif(this.val != that.val) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(Grid that) {\n\t\t\t\tint c = Long.compare(this.val, that.val);\n\t\t\t\tif(c == 0) c = Integer.compare(this.x, that.x);\n\t\t\t\tif(c == 0) c = Integer.compare(this.y, that.y);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\n\t\tboolean isValid(int x, int y, int h, int w) { return x >= 0 && x < h && y >= 0 && y < w; }\n\t\tboolean isValid(Grid g) { return isValid(g.x, g.y, g.h, g.w); }\n\n\t\t// graph\n\t\tclass Graph {\n\t\t\tint numNode;\n\t\t\tint numEdge;\n\t\t\tboolean directed;\n\t\t\tSet edges = new HashSet<>();\n\t\t\tNode nodes[];\n\t\t\tNode reversedNodes[];\n\n\t\t\tGraph(int numNode, int numEdge, boolean directed) {\n\t\t\t\tthis.numNode = numNode;\n\t\t\t\tthis.numEdge = numEdge;\n\t\t\t\tthis.directed = directed;\n\t\t\t\tnodes = new Node[numNode];\n\t\t\t\treversedNodes = new Node[numNode];\n\t\t\t\tfor(int i = 0; i < numNode; i ++) {\n\t\t\t\t\tnodes[i] = new Node(i);\n\t\t\t\t\treversedNodes[i] = new Node(i);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid init(Set edges) {\n\t\t\t\tthis.edges = edges;\n\t\t\t\tfor(Edge e : edges) add(e);\n\t\t\t}\n\n\t\t\tvoid add(Edge e) {\n\t\t\t\tedges.add(e);\n\t\t\t\tnodes[e.source].add(e.target, e.cost);\n\t\t\t\tif(directed) reversedNodes[e.target].add(e.source, e.cost);\n\t\t\t\telse nodes[e.target].add(e.source, e.cost);\n\t\t\t}\n\n\t\t\tvoid remove(Edge e) {\n\t\t\t\tedges.remove(e);\n\t\t\t\tnodes[e.source].remove(e.target, e.cost);\n\t\t\t\tif(directed) reversedNodes[e.target].remove(e.source, e.cost);\n\t\t\t\telse nodes[e.target].remove(e.source, e.cost);\n\t\t\t}\n\n\t\t\tvoid update(Edge e, long cost) {\n\t\t\t\tnodes[e.source].update(e.target, cost);\n\t\t\t\tif(directed) reversedNodes[e.target].update(e.source, cost);\n\t\t\t\telse nodes[e.target].update(e.source, cost);\n\t\t\t\te.cost = cost;\n\t\t\t}\n\t\t\tvoid update(int source, int target, long cost) { update(new Edge(source, target, cost), cost); }\n\n\t\t\tvoid clearNodes() {\n\t\t\t\tfor(Node n : nodes) n.clear();\n\t\t\t\tfor(Node n : reversedNodes) n.clear();\n\t\t\t}\n\t\t}\n\n\t\tclass Node extends HashSet {\n\t\t\tint id;\n\n\t\t\tNode(int id) { this.id = id; }\n\t\t\tvoid add(int target, long cost) { add(new Edge(id, target, cost)); }\n\t\t\tvoid remove(int target, long cost) { remove(new Edge(id, target, cost)); }\n\t\t\tvoid update(int target, long cost) { remove(target, cost); add(target, cost); }\n\t\t}\n\n\t\tclass Edge implements Comparable {\n\t\t\tint source;\n\t\t\tint target;\n\t\t\tlong cost;\n\t\t\tEdge(int source, int target, long cost) {\n\t\t\t\tthis.source = source;\n\t\t\t\tthis.target = target;\n\t\t\t\tthis.cost = cost;\n\t\t\t}\n\n\n\t\t\t@Override\n\t\t\tpublic String toString() { return source+\" - \"+cost+\" -> \"+target; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(source, target); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tEdge that = (Edge) obj;\n\t\t\t\tif(this.source != that.source) return false;\n\t\t\t\tif(this.target != that.target) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(Edge that) {\n\t\t\t\tint c = Long.compare(this.cost, that.cost);\n\t\t\t\tif(c == 0) c = Integer.compare(this.source, that.source);\n\t\t\t\tif(c == 0) c = Integer.compare(this.target, that.target);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\n\t\t// Pair, Tuple\n\t\tclass Pair, U extends Comparable> implements Comparable> {\n\t\t\tT a;\n\t\t\tU b;\n\t\t\tPair() { }\n\t\t\tPair(T a, U b) {\n\t\t\t\tthis.a = a;\n\t\t\t\tthis.b = b;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+a.toString()+\", \"+b.toString()+\")\"; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPair that = (Pair) obj;\n\t\t\t\tif(this.a.getClass() != that.a.getClass()) return false;\n\t\t\t\tif(this.b.getClass() != that.b.getClass()) return false;\n\t\t\t\tif(!this.a.equals(that.a)) return false;\n\t\t\t\tif(!this.b.equals(that.b)) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(Pair that) {\n\t\t\t\tint c = (this.a).compareTo(that.a);\n\t\t\t\tif(c == 0) c = (this.b).compareTo(that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairII implements Comparable {\n\t\t\tint a; int b;\n\t\t\tPairII() { }\n\t\t\tPairII(int a, int b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairII that = (PairII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairII that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairIL implements Comparable {\n\t\t\tint a; long b;\n\t\t\tPairIL() { }\n\t\t\tPairIL(int a, long b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairIL that = (PairIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairIL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairID implements Comparable {\n\t\t\tint a; double b;\n\t\t\tPairID() { }\n\t\t\tPairID(int a, double b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairID that = (PairID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairID that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairLI implements Comparable {\n\t\t\tlong a; int b;\n\t\t\tPairLI() { }\n\t\t\tPairLI(long a, int b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairLI that = (PairLI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairLI that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairLL implements Comparable {\n\t\t\tlong a; long b;\n\t\t\tPairLL() { }\n\t\t\tPairLL(long a, long b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairLL that = (PairLL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairLL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairLD implements Comparable {\n\t\t\tlong a; double b;\n\t\t\tPairLD() { }\n\t\t\tPairLD(long a, double b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairLD that = (PairLD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairLD that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairDI implements Comparable {\n\t\t\tdouble a; int b;\n\t\t\tPairDI() { }\n\t\t\tPairDI(double a, int b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairDI that = (PairDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairDI that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairDL implements Comparable {\n\t\t\tdouble a; long b;\n\t\t\tPairDL() { }\n\t\t\tPairDL(double a, long b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairDL that = (PairDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairDL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairDD implements Comparable {\n\t\t\tdouble a; double b;\n\t\t\tPairDD() { }\n\t\t\tPairDD(double a, double b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairDD that = (PairDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairDD that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\n\t\tinterface ITuple {\n\t\t\tpublic StringBuilder toStringBuilder();\n\t\t\t@Override\n\t\t\tpublic String toString();\n\t\t\t@Override\n\t\t\tpublic int hashCode();\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj);\n\t\t}\n\t\tclass BasicTuple, V extends Comparable> implements Comparable {\n\t\t\tT t;\n\t\t\tV a;\n\t\t\tBasicTuple() { }\n\n\t\t\tStringBuilder sbTuple = new StringBuilder();\n\t\t\tpublic StringBuilder toStringBuilder() {\n\t\t\t\tsbTuple.setLength(0);\n\t\t\t\treturn sbTuple.append(t.toStringBuilder()).append(\", \").append(a);\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+toStringBuilder().toString()+\")\"; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(t, a); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tBasicTuple that = (BasicTuple) obj;\n\t\t\t\tif(this.t.getClass() != that.t.getClass()) return false;\n\t\t\t\tif(this.a.getClass() != that.a.getClass()) return false;\n\t\t\t\tif(!this.t.equals(that.t)) return false;\n\t\t\t\tif(!this.a.equals(that.a)) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tpublic int compareTo(BasicTuple that) {\n\t\t\t\tint c = (this.t).compareTo((T) (Object) that.t);\n\t\t\t\tif(c == 0) c = (this.a).compareTo((V) (Object) that.a);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass UniqueTuple> implements ITuple, Comparable {\n\t\t\tV a;\n\t\t\tUniqueTuple() { }\n\n\t\t\tStringBuilder sbTuple = new StringBuilder();\n\t\t\tpublic StringBuilder toStringBuilder() {\n\t\t\t\tsbTuple.setLength(0);\n\t\t\t\treturn sbTuple.append(a);\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+toStringBuilder().toString()+\")\"; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(a); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tUniqueTuple that = (UniqueTuple) obj;\n\t\t\t\tif(this.a.getClass() != that.a.getClass()) return false;\n\t\t\t\tif(!this.a.equals(that.a)) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tpublic int compareTo(UniqueTuple that) {\n\t\t\t\treturn (this.a).compareTo((V) (Object) that.a);\n\t\t\t}\n\t\t}\n\n\t\tclass Tuple1> extends UniqueTuple implements ITuple {\n\t\t\tTuple1() { super(); }\n\t\t\tTuple1(T0 a0) {\n\t\t\t\tsuper();\n\t\t\t\tthis.a = a0;\n\t\t\t}\n\t\t\tT0 get0() { return a; }\n\t\t\tvoid set0(T0 x) { a = x; }\n\t\t}\n\t\tclass Tuple2<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable>\n\t\t\t\textends BasicTuple, T1> implements ITuple {\n\t\t\tTuple2() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple2(T0 a0, T1 a1) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple1(a0);\n\t\t\t\tthis.a = a1;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { a = x; }\n\t\t}\n\t\tclass Tuple3<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable>\n\t\t\t\textends BasicTuple, T2> implements ITuple {\n\t\t\tTuple3() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple3(T0 a0, T1 a1, T2 a2) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple2(a0, a1);\n\t\t\t\tthis.a = a2;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { a = x; }\n\t\t}\n\t\tclass Tuple4<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable,\n\t\t\t\tT3 extends Comparable>\n\t\t\t\textends BasicTuple, T3> implements ITuple {\n\t\t\tTuple4() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple4(T0 a0, T1 a1, T2 a2, T3 a3) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple3(a0, a1, a2);\n\t\t\t\tthis.a = a3;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { a = x; }\n\t\t}\n\t\tclass Tuple5<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable,\n\t\t\t\tT3 extends Comparable,\n\t\t\t\tT4 extends Comparable>\n\t\t\t\textends BasicTuple, T4> implements ITuple {\n\t\t\tTuple5() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple5(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple4(a0, a1, a2, a3);\n\t\t\t\tthis.a = a4;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { a = x; }\n\t\t}\n\t\tclass Tuple6<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable,\n\t\t\t\tT3 extends Comparable,\n\t\t\t\tT4 extends Comparable,\n\t\t\t\tT5 extends Comparable>\n\t\t\t\textends BasicTuple, T5> implements ITuple {\n\t\t\tTuple6() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple6(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4, T5 a5) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple5(a0, a1, a2, a3, a4);\n\t\t\t\tthis.a = a5;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return t.get4(); }\n\t\t\tT5 get5() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { t.set4(x); }\n\t\t\tvoid set5(T5 x) { a = x; }\n\t\t}\n\t\tclass Tuple7<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable,\n\t\t\t\tT3 extends Comparable,\n\t\t\t\tT4 extends Comparable,\n\t\t\t\tT5 extends Comparable,\n\t\t\t\tT6 extends Comparable>\n\t\t\t\textends BasicTuple, T6> implements ITuple {\n\t\t\tTuple7() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple7(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4, T5 a5, T6 a6) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple6(a0, a1, a2, a3, a4, a5);\n\t\t\t\tthis.a = a6;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return t.get4(); }\n\t\t\tT5 get5() { return t.get5(); }\n\t\t\tT6 get6() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { t.set4(x); }\n\t\t\tvoid set5(T5 x) { t.set5(x); }\n\t\t\tvoid set6(T6 x) { a = x; }\n\t\t}\n\t\tclass Tuple8<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable,\n\t\t\t\tT3 extends Comparable,\n\t\t\t\tT4 extends Comparable,\n\t\t\t\tT5 extends Comparable,\n\t\t\t\tT6 extends Comparable,\n\t\t\t\tT7 extends Comparable>\n\t\t\t\textends BasicTuple, T7> implements ITuple {\n\t\t\tTuple8() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple8(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4, T5 a5, T6 a6, T7 a7) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple7(a0, a1, a2, a3, a4, a5, a6);\n\t\t\t\tthis.a = a7;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return t.get4(); }\n\t\t\tT5 get5() { return t.get5(); }\n\t\t\tT6 get6() { return t.get6(); }\n\t\t\tT7 get7() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { t.set4(x); }\n\t\t\tvoid set5(T5 x) { t.set5(x); }\n\t\t\tvoid set6(T6 x) { t.set6(x); }\n\t\t\tvoid set7(T7 x) { a = x; }\n\t\t}\n\n\t\tclass TupleIII implements Comparable {\n\t\t\tint a; int b; int c;\n\t\t\tTupleIII() { }\n\t\t\tTupleIII(int a, int b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIII that = (TupleIII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIII that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIIL implements Comparable {\n\t\t\tint a; int b; long c;\n\t\t\tTupleIIL() { }\n\t\t\tTupleIIL(int a, int b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIIL that = (TupleIIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIIL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIID implements Comparable {\n\t\t\tint a; int b; double c;\n\t\t\tTupleIID() { }\n\t\t\tTupleIID(int a, int b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIID that = (TupleIID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIID that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleILI implements Comparable {\n\t\t\tint a; long b; int c;\n\t\t\tTupleILI() { }\n\t\t\tTupleILI(int a, long b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleILI that = (TupleILI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleILI that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleILL implements Comparable {\n\t\t\tint a; long b; long c;\n\t\t\tTupleILL() { }\n\t\t\tTupleILL(int a, long b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleILL that = (TupleILL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleILL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleILD implements Comparable {\n\t\t\tint a; long b; double c;\n\t\t\tTupleILD() { }\n\t\t\tTupleILD(int a, long b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleILD that = (TupleILD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleILD that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIDI implements Comparable {\n\t\t\tint a; double b; int c;\n\t\t\tTupleIDI() { }\n\t\t\tTupleIDI(int a, double b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIDI that = (TupleIDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIDI that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIDL implements Comparable {\n\t\t\tint a; double b; long c;\n\t\t\tTupleIDL() { }\n\t\t\tTupleIDL(int a, double b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIDL that = (TupleIDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIDL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIDD implements Comparable {\n\t\t\tint a; double b; double c;\n\t\t\tTupleIDD() { }\n\t\t\tTupleIDD(int a, double b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIDD that = (TupleIDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIDD that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLII implements Comparable {\n\t\t\tlong a; int b; int c;\n\t\t\tTupleLII() { }\n\t\t\tTupleLII(long a, int b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLII that = (TupleLII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLII that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLIL implements Comparable {\n\t\t\tlong a; int b; long c;\n\t\t\tTupleLIL() { }\n\t\t\tTupleLIL(long a, int b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLIL that = (TupleLIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLIL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLID implements Comparable {\n\t\t\tlong a; int b; double c;\n\t\t\tTupleLID() { }\n\t\t\tTupleLID(long a, int b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLID that = (TupleLID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLID that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLLI implements Comparable {\n\t\t\tlong a; long b; int c;\n\t\t\tTupleLLI() { }\n\t\t\tTupleLLI(long a, long b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLLI that = (TupleLLI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLLI that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLLL implements Comparable {\n\t\t\tlong a; long b; long c;\n\t\t\tTupleLLL() { }\n\t\t\tTupleLLL(long a, long b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLLL that = (TupleLLL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLLL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLLD implements Comparable {\n\t\t\tlong a; long b; double c;\n\t\t\tTupleLLD() { }\n\t\t\tTupleLLD(long a, long b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLLD that = (TupleLLD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLLD that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLDI implements Comparable {\n\t\t\tlong a; double b; int c;\n\t\t\tTupleLDI() { }\n\t\t\tTupleLDI(long a, double b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLDI that = (TupleLDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLDI that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLDL implements Comparable {\n\t\t\tlong a; double b; long c;\n\t\t\tTupleLDL() { }\n\t\t\tTupleLDL(long a, double b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLDL that = (TupleLDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLDL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLDD implements Comparable {\n\t\t\tlong a; double b; double c;\n\t\t\tTupleLDD() { }\n\t\t\tTupleLDD(long a, double b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLDD that = (TupleLDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLDD that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDII implements Comparable {\n\t\t\tdouble a; int b; int c;\n\t\t\tTupleDII() { }\n\t\t\tTupleDII(double a, int b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDII that = (TupleDII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDII that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDIL implements Comparable {\n\t\t\tdouble a; int b; long c;\n\t\t\tTupleDIL() { }\n\t\t\tTupleDIL(double a, int b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDIL that = (TupleDIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDIL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDID implements Comparable {\n\t\t\tdouble a; int b; double c;\n\t\t\tTupleDID() { }\n\t\t\tTupleDID(double a, int b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDID that = (TupleDID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDID that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDLI implements Comparable {\n\t\t\tdouble a; long b; int c;\n\t\t\tTupleDLI() { }\n\t\t\tTupleDLI(double a, long b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDLI that = (TupleDLI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDLI that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDLL implements Comparable {\n\t\t\tdouble a; long b; long c;\n\t\t\tTupleDLL() { }\n\t\t\tTupleDLL(double a, long b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDLL that = (TupleDLL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDLL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDLD implements Comparable {\n\t\t\tdouble a; long b; double c;\n\t\t\tTupleDLD() { }\n\t\t\tTupleDLD(double a, long b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDLD that = (TupleDLD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDLD that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDDI implements Comparable {\n\t\t\tdouble a; double b; int c;\n\t\t\tTupleDDI() { }\n\t\t\tTupleDDI(double a, double b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDDI that = (TupleDDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDDI that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDDL implements Comparable {\n\t\t\tdouble a; double b; long c;\n\t\t\tTupleDDL() { }\n\t\t\tTupleDDL(double a, double b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDDL that = (TupleDDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDDL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDDD implements Comparable {\n\t\t\tdouble a; double b; double c;\n\t\t\tTupleDDD() { }\n\t\t\tTupleDDD(double a, double b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDDD that = (TupleDDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDDD that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\npublic void solve() {\n\tint h = ni();\n\tint w = ni();\n\tGrids g = new Grids(h, w);\n\tchar c[][] = nc(h, w);\n\tboolean b[][] = new boolean[h][w];\n\tint start[][] = new int[h][w];\n\tfill(start, -1);\n\tint numStart = 0;\n\tfor(int i = 0; i < h; i ++) {\n\t\tfor(int j = 0; j < w; j ++) {\n\t\t\tb[i][j] = c[i][j] == '#';\n\t\t\tif(c[i][j] == 'o') start[i][j] = numStart ++;\n\t\t}\n\t}\n\tg.init(b);\n\n\tint numNode = numStart + h * w + 1;\n\tlong d[] = new long[numNode];\n\tfor(int i = 0; i < numStart; i ++) d[i] = 1;\n\td[numNode - 1] = - numStart;\n\tNormalizedMinCostFlow mcf = new NormalizedMinCostFlow(numNode, d);\n\tfor(int i = 0; i < h; i ++) {\n\t\tfor(int j = 0; j < w; j ++) {\n\t\t\tif(start[i][j] >= 0) {\n\t\t\t\tlong dist[] = bfs(g, g.get(i, j), h, w);\n\t\t\t\tfor(int i2 = 0; i2 < h; i2 ++) {\n\t\t\t\t\tfor(int j2 = 0; j2 < w; j2 ++) {\n\t\t\t\t\t\tint idx2 = g.get(i2, j2).i;\n\t\t\t\t\t\tif(isINF(dist[idx2])) continue;\n\t\t\t\t\t\tmcf.addEdge(start[i][j], idx2 + numStart, 1, - dist[idx2]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tmcf.addEdge(g.get(i, j).i + numStart, numNode - 1, 1, 0);\n\t\t}\n\t}\n\tPairLL p = mcf.minCostFlow();\n\tprtln(- p.b);\n}\n\nlong[] bfs(Grids g, Grid start, int h, int w) {\n\tlong dist[] = new long[h * w];\n\tfill(dist, INF);\n\t\n\tDeque s = new ArrayDeque<>();\n\ts.addLast(start);\n\tdist[start.i] = 0;\n\twhile(!s.isEmpty()) {\n\t\tGrid crt = s.removeFirst();\n\t\tfor(int add = 2; add <= 4; add += 2) {\n\t\t\tGrid next = g.next(crt, add);\n\t\t\tif(next == null || next.b) continue;\n\t\t\tif(isINF(dist[next.i])) {\n\t\t\t\tdist[next.i] = dist[crt.i] + 1;\n\t\t\t\ts.addLast(next);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn dist;\n}\n\n// WeightedCapEdge(source, target, cap, cost)\n// PairLL(flow, cost)\nclass NormalizedMinCostFlow extends MinCostFlow { // V=numNode, E=numEdge, F=in\n\tlong in;\n\tlong sum;\n\tint s;\n\tint t;\n\tlong d[];\n\tint idx[];\n\tint tsIdx;\n\tNormalizedMinCostFlow(int numNode, long[] d) { // O(V)\n\t\tsuper(numNode + 2);\n\t\tthis.d = d;\n\t\tin = 0;\n\t\tsum = 0;\n\t\ts = numNode;\n\t\tt = numNode + 1;\n\t\tidx = new int[numNode];\n\n\t\tfor(int i = 0; i < numNode; i++) {\n\t\t\tif(d[i] >= 0) {\n\t\t\t\tidx[i] = super.addEdge(s, i, d[i], 0);\n\t\t\t\tsuper.addEdge(i, t, 0, 0);\n\t\t\t\tin += d[i];\n\t\t\t}else {\n\t\t\t\tsuper.addEdge(s, i, 0, 0);\n\t\t\t\tidx[i] = super.addEdge(i, t, - d[i], 0);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid addDemand(int i, long addD) { if(i >= d.length) return; changeDemand(i, d[i] + addD); } // O(1)\n\tvoid changeDemand(int i, long newD) { // O(1)\n\t\tif(i >= d.length) return;\n\t\tif(d[i] > 0) in -= d[i];\n\t\tedgesList.get(idx[i]).cap = 0;\n\t\td[i] = newD;\n\t\tif(d[i] >= 0) idx[i] &= ~1; else idx[i] |= 1;\n\t\tif(d[i] > 0) in += d[i];\n\t\tedgesList.get(idx[i]).cap = abs(d[i]);\n\t}\n\n\tint addEdge(int source, int target, long cap, long cost) { return addEdge(source, target, 0, cap, cost); } // O(1)\n\tint addEdge(int source, int target, long minCap, long maxCap, long cost) { // O(1)\n\t\tif(cost < 0) {\n\t\t\tsum += cost * maxCap;\n\t\t\taddDemand(source, - maxCap);\n\t\t\taddDemand(target, maxCap);\n\t\t\treturn super.addEdge(target, source, maxCap - minCap, - cost);\n\t\t}else {\n\t\t\tsum += cost * minCap;\n\t\t\taddDemand(source, - minCap);\n\t\t\taddDemand(target, minCap);\n\t\t\treturn super.addEdge(source, target, maxCap - minCap, cost);\n\t\t}\n\t}\n\n\t// O(F(V+E)logV)\n\tPairLL minCostFlow() {\n\t\tPairLL ans = minCostFlow(s, t, in);\n\t\tans.b += sum;\n\t\treturn ans;\n\t}\n}\n\n// WeightedCapEdge(source, target, cap, cost)\n// PairLL(flow, cost)\nclass MinCostFlow { // V=numNode, E=numEdge\n\tclass WeightedCapEdge {\n\t\tint source;\n\t\tint target;\n\t\tlong cap;\n\t\tlong cost;\n\t\tint rev;\n\t\tWeightedCapEdge(int source, int target, long cap, long cost, int rev) {\n\t\t\tthis.source = source;\n\t\t\tthis.target = target;\n\t\t\tthis.cap = cap;\n\t\t\tthis.cost = cost;\n\t\t\tthis.rev = rev;\n\t\t}\n\n\t\tlong getFlow() { return edges[target][rev].cap; }\n\n\t\t@Override\n\t\tpublic String toString() { return source+\" - (\"+cap+\", \"+cost+\") -> \"+target; }\n\t\t@Override\n\t\tpublic int hashCode() { return Objects.hash(source, target); }\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif(this == obj) return true;\n\t\t\tif(obj == null) return false;\n\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\tEdge that = (Edge) obj;\n\t\t\tif(this.source != that.source) return false;\n\t\t\tif(this.target != that.target) return false;\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tint numNode;\n\tint numEdge;\n\tList edgesList;\n\tint len[];\n\tWeightedCapEdge edges[][];\n\tlong potential[];\n\n\tMinCostFlow(int numNode) { // O(V)\n\t\tthis.numNode = numNode;\n\t\tedgesList = new ArrayList<>();\n\t\tlen = new int[numNode];\n\t\tedges = new WeightedCapEdge[numNode][];\n\t\tpotential = new long[numNode];\n\t\tfill(potential, 0);\n\t}\n\n\tint addEdge(int source, int target, long cap, long cost) { // O(1)\n\t\tWeightedCapEdge e = new WeightedCapEdge(source, target, cap, cost, len[target]);\n\t\tlen[source] ++;\n\t\tlen[target] ++;\n\t\tedgesList.add(e);\n\t\treturn numEdge ++;\n\t}\n\n\tvoid init() { // O(E)\n\t\tfor(int i = 0; i < numNode; i ++) edges[i] = new WeightedCapEdge[len[i]];\n\t\tint idx[] = new int[numNode];\n\t\tfor(WeightedCapEdge e : edgesList) {\n\t\t\tedges[e.target][idx[e.target] ++] = new WeightedCapEdge(e.target, e.source, 0, - e.cost, idx[e.source]);\n\t\t\tedges[e.source][idx[e.source] ++] = e;\n\t\t}\n\t}\n\tvoid clearFlow() { // O(V+E)\n\t\tfill(potential, 0);\n\t\tfor(WeightedCapEdge e : edgesList) {\n\t\t\tlong flow = e.getFlow();\n\t\t\te.cap += flow;\n\t\t\tedges[e.target][e.rev].cap -= flow;\n\t\t}\n\t}\n\n\t// O(f(V+E)logV)\n\tPairLL minCostMaxFlow(int s, int t) { return minCostFlow(s, t, INF); }\n\tPairLL minCostFlow(int s, int t, long flowLimit) {\n\t\tPairLL[] slope = minCostSlope(s, t, flowLimit);\n\t\treturn slope[slope.length - 1];\n\t}\n\tPairLL[] minCostSlope(int s, int t) { return minCostSlope(s, t, INF); }\n\tPairLL[] minCostSlope(int s, int t, long flowLimit) {\n\t\tif(s == t) return null;\n\t\tinit();\n\t\tList slopeList = new ArrayList<>();\n\t\tlong prvCost = -1;\n\t\tlong flow = 0;\n\t\tlong cost = 0;\n\t\twhile(true) {\n\t\t\tslopeList.add(new PairLL(flow, cost));\n\t\t\tPairLL add = dijkstra(s, t, flowLimit - flow);\n\t\t\tif(add.a == 0) break;\n\t\t\tflow += add.a;\n\t\t\tcost += add.a * add.b;\n\t\t\tif(add.b == prvCost) slopeList.remove(slopeList.size() - 1);\n\t\t\tprvCost = add.b;\n\t\t}\n\t\tPairLL slope[] = new PairLL[slopeList.size()];\n\t\tfor(int i = 0; i < slopeList.size(); i ++) slope[i] = slopeList.get(i);\n\t\treturn slope;\n\t}\n\tPairLL dijkstra(int s, int t, long maxFlow) { // O((V+E)logV)\n\t\tlong dist[] = new long[numNode];\n\t\tfill(dist, INF);\n\t\tdist[s] = 0;\n\t\tWeightedCapEdge prv[] = new WeightedCapEdge[numNode];\n\n\t\tQueue pq = new PriorityQueue<>();\n\t\tpq.add(new Edge(s, s, dist[s]));\n\t\twhile(!pq.isEmpty()) {\n\t\t\tEdge crt = pq.poll();\n\t\t\tif(dist[crt.target] < crt.cost) continue;\n\t\t\tfor(WeightedCapEdge e : edges[crt.target]) {\n\t\t\t\tif(e.cap <= 0) continue;\n\t\t\t\tlong cost = dist[e.source] + e.cost + potential[e.source] - potential[e.target];\n\t\t\t\tif(dist[e.target] > cost) {\n\t\t\t\t\tdist[e.target] = cost;\n\t\t\t\t\tprv[e.target] = e;\n\t\t\t\t\tpq.add(new Edge(e.source, e.target, dist[e.target]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(dist[t] == INF) return new PairLL(0, INF);\n\t\tfor(int i = 0; i < numNode; i ++) potential[i] += dist[i];\n\t\tPairLL add = new PairLL(maxFlow, 0);\n\t\tfor(int v = t; v != s; ) {\n\t\t\tWeightedCapEdge e = prv[v];\n\t\t\tadd.b += e.cost;\n\t\t\tadd.a = min(add.a, e.cap);\n\t\t\tv = e.source;\n\t\t}\n\t\tfor(int v = t; v != s;) {\n\t\t\tWeightedCapEdge e = prv[v];\n\t\t\te.cap -= add.a;\n\t\t\tedges[v][e.rev].cap += add.a;\n\t\t\tv = e.source;\n\t\t}\n\t\treturn add;\n\t}\n}\n\n\t}\n}\n", "language": "Java", "metadata": {"date": 1600660512, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02542.html", "problem_id": "p02542", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02542/input.txt", "sample_output_relpath": "derived/input_output/data/p02542/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02542/Java/s764469932.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s764469932", "user_id": "u137087473"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\nimport java.util.function.*;\npublic class Main implements Runnable {\n\tstatic boolean DEBUG;\n\tpublic static void main(String[] args) {\n\t\tDEBUG = args.length > 0 && args[0].equals(\"-DEBUG\");\n\t\tThread.setDefaultUncaughtExceptionHandler((t, e) -> { e.printStackTrace(); System.exit(1); });\n\t\tnew Thread(null, new Main(), \"\", 1 << 31).start();\n\t}\n\n\tpublic void run() {\n\t\tSolver solver = new Solver();\n\t\tsolver.solve();\n\t\tsolver.exit();\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate final InputStream in = System.in;\n\t\tprivate final byte[] buffer = new byte[1024];\n\t\tprivate int pointer = 0;\n\t\tprivate int buflen = 0;\n\t\tprivate boolean hasNextByte() {\n\t\t\tif(pointer < buflen) return true;\n\t\t\telse {\n\t\t\t\tpointer = 0;\n\t\t\t\ttry {\n\t\t\t\t\tbuflen = in.read(buffer);\n\t\t\t\t}catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\treturn buflen > 0;\n\t\t\t}\n\t\t}\n\t\tprivate int readByte() { if(hasNextByte()) return buffer[pointer ++]; else return -1; }\n\t\tprivate boolean isPrintableChar(int c) { return isPrintableChar(c, false); }\n\t\tprivate boolean isPrintableChar(int c, boolean includingSpace) { return (includingSpace ? 32 : 33) <= c && c <= 126; }\n\t\tprivate void skipUnprintable() { skipUnprintable(false); }\n\t\tprivate void skipUnprintable(boolean includingSpace) { while(hasNextByte() && !isPrintableChar(buffer[pointer], includingSpace)) pointer++; }\n\t\tprivate boolean hasNext() { return hasNext(false); }\n\t\tprivate boolean hasNext(boolean includingSpace) { skipUnprintable(includingSpace); return hasNextByte(); }\n\t\tprivate StringBuilder sb = new StringBuilder();\n\t\tpublic String next() { return next(false); }\n\t\tpublic String next(boolean includingSpace) {\n\t\t\tif(!hasNext(includingSpace)) throw new NoSuchElementException();\n\t\t\tsb.setLength(0);\n\t\t\tint b = readByte();\n\t\t\twhile(isPrintableChar(b, includingSpace)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\tif(!hasNext()) throw new NoSuchElementException();\n\t\t\tlong n = 0;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif(b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\tif(b < '0' || '9' < b) throw new NumberFormatException();\n\t\t\twhile(true) {\n\t\t\t\tif('0' <= b && b <= '9') n = n * 10 + b - '0';\n\t\t\t\telse if(b == -1 || !isPrintableChar(b)) return minus ? -n : n;\n\t\t\t\telse throw new NumberFormatException();\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Solver {\n\t\tFastScanner sc = new FastScanner();\n\t\tpublic Solver() { }\n\n\t\tString ns() { return ns(false); }\n\t\tString ns(boolean includingSpace) { return sc.next(includingSpace); }\n\t\tString[] ns(int n) { return ns(n, false); }\n\t\tString[] ns(int n, boolean includingSpace) {\n\t\t\tString a[] = new String[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ns(includingSpace);\n\t\t\treturn a;\n\t\t}\n\t\tString[][] ns(int n, int m) { return ns(n, m, false); }\n\t\tString[][] ns(int n, int m, boolean includingSpace) {\n\t\t\tString a[][] = new String[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ns(m, includingSpace);\n\t\t\treturn a;\n\t\t}\n\t\tchar nc() { return ns().charAt(0); }\n\t\tchar[] nc(int n) {\n\t\t\tString str = ns();\n\t\t\tif(n < 0) n = str.length();\n\t\t\tchar a[] = new char[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = str.charAt(i);\n\t\t\treturn a;\n\t\t}\n\t\tchar[][] nc(int n, int m) {\n\t\t\tchar a[][] = new char[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nc(m);\n\t\t\treturn a;\n\t\t}\n\t\tboolean[] nb(int n, char t) {\n\t\t\tchar c[] = nc(-1);\n\t\t\tif(n < 0) n = c.length;\n\t\t\tboolean a[] = new boolean[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = c[i] == t;\n\t\t\treturn a;\n\t\t}\n\t\tboolean[][] nb(int n, int m, char t) {\n\t\t\tboolean a[][] = new boolean[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nb(m, t);\n\t\t\treturn a;\n\t\t}\n\t\tint ni() { return Math.toIntExact(sc.nextLong()); }\n\t\tint[] ni(int n) {\n\t\t\tint a[] = new int[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ni();\n\t\t\treturn a;\n\t\t}\n\t\tint[][] ni(int n, int m) {\n\t\t\tint a[][] = new int[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = ni(m);\n\t\t\treturn a;\n\t\t}\n\t\tlong nl() { return sc.nextLong(); }\n\t\tlong[] nl(int n) {\n\t\t\tlong a[] = new long[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nl();\n\t\t\treturn a;\n\t\t}\n\t\tlong[][] nl(int n, int m) {\n\t\t\tlong a[][] = new long[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nl(m);\n\t\t\treturn a;\n\t\t}\n\t\tdouble nd() { return Double.parseDouble(sc.next()); }\n\t\tdouble[] nd(int n) {\n\t\t\tdouble a[] = new double[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nd();\n\t\t\treturn a;\n\t\t}\n\t\tdouble[][] nd(int n, int m) {\n\t\t\tdouble a[][] = new double[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = nd(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairII npii() { return new PairII(ni(), ni()); }\n\t\tPairII[] npii(int n) {\n\t\t\tPairII a[] = new PairII[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npii();\n\t\t\treturn a;\n\t\t}\n\t\tPairII[][] npii(int n, int m) {\n\t\t\tPairII a[][] = new PairII[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npii(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairIL npil() { return new PairIL(ni(), nl()); }\n\t\tPairIL[] npil(int n) {\n\t\t\tPairIL a[] = new PairIL[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npil();\n\t\t\treturn a;\n\t\t}\n\t\tPairIL[][] npil(int n, int m) {\n\t\t\tPairIL a[][] = new PairIL[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npil(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairID npid() { return new PairID(ni(), nd()); }\n\t\tPairID[] npid(int n) {\n\t\t\tPairID a[] = new PairID[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npid();\n\t\t\treturn a;\n\t\t}\n\t\tPairID[][] npid(int n, int m) {\n\t\t\tPairID a[][] = new PairID[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npid(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairLI npli() { return new PairLI(nl(), ni()); }\n\t\tPairLI[] npli(int n) {\n\t\t\tPairLI a[] = new PairLI[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npli();\n\t\t\treturn a;\n\t\t}\n\t\tPairLI[][] npli(int n, int m) {\n\t\t\tPairLI a[][] = new PairLI[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npli(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairLL npll() { return new PairLL(nl(), nl()); }\n\t\tPairLL[] npll(int n) {\n\t\t\tPairLL a[] = new PairLL[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npll();\n\t\t\treturn a;\n\t\t}\n\t\tPairLL[][] npll(int n, int m) {\n\t\t\tPairLL a[][] = new PairLL[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npll(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairLD npld() { return new PairLD(nl(), nd()); }\n\t\tPairLD[] npld(int n) {\n\t\t\tPairLD a[] = new PairLD[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npld();\n\t\t\treturn a;\n\t\t}\n\t\tPairLD[][] npld(int n, int m) {\n\t\t\tPairLD a[][] = new PairLD[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npld(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairDI npdi() { return new PairDI(nd(), ni()); }\n\t\tPairDI[] npdi(int n) {\n\t\t\tPairDI a[] = new PairDI[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdi();\n\t\t\treturn a;\n\t\t}\n\t\tPairDI[][] npdi(int n, int m) {\n\t\t\tPairDI a[][] = new PairDI[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdi(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairDL npdl() { return new PairDL(nd(), nl()); }\n\t\tPairDL[] npdl(int n) {\n\t\t\tPairDL a[] = new PairDL[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdl();\n\t\t\treturn a;\n\t\t}\n\t\tPairDL[][] npdl(int n, int m) {\n\t\t\tPairDL a[][] = new PairDL[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdl(m);\n\t\t\treturn a;\n\t\t}\n\t\tPairDD npdd() { return new PairDD(nd(), nd()); }\n\t\tPairDD[] npdd(int n) {\n\t\t\tPairDD a[] = new PairDD[n];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdd();\n\t\t\treturn a;\n\t\t}\n\t\tPairDD[][] npdd(int n, int m) {\n\t\t\tPairDD a[][] = new PairDD[n][m];\n\t\t\tfor(int i = 0; i < n; i ++) a[i] = npdd(m);\n\t\t\treturn a;\n\t\t}\n\n\t\tString booleanToString(boolean b) { return b ? \"#\" : \".\"; }\n\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tPrintWriter err = new PrintWriter(System.err);\n\t\tStringBuilder sb4prtln = new StringBuilder();\n\t\tvoid prt() { out.print(\"\"); }\n\t\t void prt(T a) { out.print(a); }\n\t\tvoid prtln() { out.println(\"\"); }\n\t\t void prtln(T a) { out.println(a); }\n\t\tvoid prtln(int... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(int element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(long... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(long element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(double... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(double element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(String... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(String element : a) sb4prtln.append(element+\" \");\n\t\t\tprtln(sb4prtln.toString().trim());\n\t\t}\n\t\tvoid prtln(char... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(char element : a) sb4prtln.append(element);\n\t\t\tprtln(sb4prtln.toString());\n\t\t}\n\t\tvoid prtln(boolean... a) {\n\t\t\tsb4prtln.setLength(0);\n\t\t\tfor(boolean element : a) sb4prtln.append(booleanToString(element));\n\t\t\tprtln(sb4prtln.toString());\n\t\t}\n\t\tvoid prtln(int[][] a) { for(int[] element : a) prtln(element); }\n\t\tvoid prtln(long[][] a) { for(long[] element : a) prtln(element); }\n\t\tvoid prtln(double[][] a) { for(double[] element : a) prtln(element); }\n\t\tvoid prtln(String[][] a) { for(String[] element : a) prtln(element); }\n\t\tvoid prtln(char[][] a) { for(char[] element : a) prtln(element); }\n\t\tvoid prtln(boolean[][] a) { for(boolean[] element : a) prtln(element); }\n\n\t\tString errconvert(int a) { return isINF(a) ? \"_\" : String.valueOf(a); }\n\t\tString errconvert(long a) { return isINF(a) ? \"_\" : String.valueOf(a); }\n\t\tvoid errprt(int a) { if(DEBUG) err.print(errconvert(a)); }\n\t\tvoid errprt(long a) { if(DEBUG) err.print(errconvert(a)); }\n\t\tvoid errprt() { if(DEBUG) err.print(\"\"); }\n\t\t void errprt(T a) { if(DEBUG) err.print(a); }\n\t\tvoid errprt(boolean a) { if(DEBUG) errprt(booleanToString(a)); }\n\t\tvoid errprtln() { if(DEBUG) err.println(\"\"); }\n\t\tvoid errprtln(int a) { if(DEBUG) err.println(errconvert(a)); }\n\t\tvoid errprtln(long a) { if(DEBUG) err.println(errconvert(a)); }\n\t\t void errprtln(T a) { if(DEBUG) err.println(a); }\n\t\tvoid errprtln(boolean a) { if(DEBUG) errprtln(booleanToString(a)); }\n\t\tvoid errprtln(int... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(int element : a) sb4prtln.append(errconvert(element)+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(long... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(long element : a) sb4prtln.append(errconvert(element)+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(double... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(double element : a) sb4prtln.append(element+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(String... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(String element : a) sb4prtln.append(element+\" \");\n\t\t\t\terrprtln(sb4prtln.toString().trim());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(char... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(char element : a) sb4prtln.append(element);\n\t\t\t\terrprtln(sb4prtln.toString());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(boolean... a) {\n\t\t\tif(DEBUG) {\n\t\t\t\tsb4prtln.setLength(0);\n\t\t\t\tfor(boolean element : a) sb4prtln.append(booleanToString(element));\n\t\t\t\terrprtln(sb4prtln.toString());\n\t\t\t}\n\t\t}\n\t\tvoid errprtln(Object[] a) { if(DEBUG) for(Object element : a) errprtln(element); }\n\t\tvoid errprtln(int[][] a) { if(DEBUG) for(int[] element : a) errprtln(element); }\n\t\tvoid errprtln(long[][] a) { if(DEBUG) for(long[] element : a) errprtln(element); }\n\t\tvoid errprtln(double[][] a) { if(DEBUG) for(double[] element : a) errprtln(element); }\n\t\tvoid errprtln(String[][] a) { if(DEBUG) for(String[] element : a) errprtln(element); }\n\t\tvoid errprtln(char[][] a) { if(DEBUG) for(char[] element : a) errprtln(element); }\n\t\tvoid errprtln(boolean[][] a) { if(DEBUG) for(boolean[] element : a) errprtln(element); }\n\t\tvoid errprtln(Object[][] a) { if(DEBUG) for(Object element : a) { errprtln(element); errprtln(); } }\n\n\t\tvoid reply(boolean b) { prtln(b ? \"Yes\" : \"No\"); }\n\t\tvoid REPLY(boolean b) { prtln(b ? \"YES\" : \"NO\"); }\n\n\t\tvoid flush() { out.flush(); if(DEBUG) err.flush(); }\n\t\tvoid assertion(boolean b) { if(!b) { flush(); throw new AssertionError(); } }\n\n\t\tvoid exit() { flush(); System.exit(0); }\n\t\t void exit(T a) { prtln(a); exit(); }\n\t\tvoid exit(int... a) { prtln(a); exit(); }\n\t\tvoid exit(long... a) { prtln(a); exit(); }\n\t\tvoid exit(double... a) { prtln(a); exit(); }\n\t\tvoid exit(String... a) { prtln(a); exit(); }\n\t\tvoid exit(char... a) { prtln(a); exit(); }\n\t\tvoid exit(boolean... a) { prtln(a); exit(); }\n\t\tvoid exit(int[][] a) { prtln(a); exit(); }\n\t\tvoid exit(long[][] a) { prtln(a); exit(); }\n\t\tvoid exit(double[][] a) { prtln(a); exit(); }\n\t\tvoid exit(String[][] a) { prtln(a); exit(); }\n\t\tvoid exit(char[][] a) { prtln(a); exit(); }\n\t\tvoid exit(boolean[][] a) { prtln(a); exit(); }\n\n\n\t\tfinal long INF = (long)1e18 + 7;\n\t\tboolean isPlusINF(long a) { return a > INF / 10; }\n\t\tboolean isMinusINF(long a) { return isPlusINF(- a); }\n\t\tboolean isINF(long a) { return isPlusINF(a) || isMinusINF(a); }\n\t\tfinal int I_INF = (int)1e9 + 7;\n\t\tboolean isPlusINF(int a) { return a > I_INF / 10; }\n\t\tboolean isMinusINF(int a) { return isPlusINF(- a); }\n\t\tboolean isINF(int a) { return isPlusINF(a) || isMinusINF(a); }\n\n\n\t\tint min(int a, int b) { return Math.min(a, b); }\n\t\tlong min(long a, long b) { return Math.min(a, b); }\n\t\tdouble min(double a, double b) { return Math.min(a, b); }\n\t\t> T min(T a, T b) { return a.compareTo(b) <= 0 ? a : b; }\n\t\tint min(int... x) {\n\t\t\tint min = x[0];\n\t\t\tfor(int val : x) min = min(min, val);\n\t\t\treturn min;\n\t\t}\n\t\tlong min(long... x) {\n\t\t\tlong min = x[0];\n\t\t\tfor(long val : x) min = min(min, val);\n\t\t\treturn min;\n\t\t}\n\t\tdouble min(double... x) {\n\t\t\tdouble min = x[0];\n\t\t\tfor(double val : x) min = min(min, val);\n\t\t\treturn min;\n\t\t}\n\t\tint max(int a, int b) { return Math.max(a, b); }\n\t\tlong max(long a, long b) { return Math.max(a, b); }\n\t\tdouble max(double a, double b) { return Math.max(a, b); }\n\t\t> T max(T a, T b) { return a.compareTo(b) >= 0 ? a : b; }\n\t\tint max(int... x) {\n\t\t\tint max = x[0];\n\t\t\tfor(int val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\tlong max(long... x) {\n\t\t\tlong max = x[0];\n\t\t\tfor(long val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\tdouble max(double... x) {\n\t\t\tdouble max = x[0];\n\t\t\tfor(double val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\t> T max(T[] x) {\n\t\t\tT max = x[0];\n\t\t\tfor(T val : x) max = max(max, val);\n\t\t\treturn max;\n\t\t}\n\t\tint max(int[][] a) {\n\t\t\tint max = a[0][0];\n\t\t\tfor(int[] ele : a) max = max(max, max(ele));\n\t\t\treturn max;\n\t\t}\n\t\tlong max(long[][] a) {\n\t\t\tlong max = a[0][0];\n\t\t\tfor(long[] ele : a) max = max(max, max(ele));\n\t\t\treturn max;\n\t\t}\n\t\tdouble max(double[][] a) {\n\t\t\tdouble max = a[0][0];\n\t\t\tfor(double[] ele : a) max = max(max, max(ele));\n\t\t\treturn max;\n\t\t}\n\t\t> T max(T[][] a) {\n\t\t\tT max = a[0][0];\n\t\t\tfor(T[] ele : a) max = max(max, max(ele));\n\t\t\treturn max;\n\t\t}\n\t\tlong sum(int... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(int element : a) sum += element;\n\t\t\treturn sum;\n\t\t}\n\t\tlong sum(long... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(long element : a) sum += element;\n\t\t\treturn sum;\n\t\t}\n\t\tdouble sum(double... a) {\n\t\t\tdouble sum = 0;\n\t\t\tfor(double element : a) sum += element;\n\t\t\treturn sum;\n\t\t}\n\t\tlong sum(boolean... a) {\n\t\t\tlong sum = 0;\n\t\t\tfor(boolean element : a) sum += element ? 1 : 0;\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(int[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i];\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(long[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i];\n\t\t\treturn sum;\n\t\t}\n\t\tdouble[] sums(double[] a) {\n\t\t\tdouble sum[] = new double[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i];\n\t\t\treturn sum;\n\t\t}\n\t\tlong[] sums(boolean[] a) {\n\t\t\tlong sum[] = new long[a.length + 1];\n\t\t\tsum[0] = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + (a[i] ? 1 : 0);\n\t\t\treturn sum;\n\t\t}\n\t\tlong[][] sums(int[][] a) {\n\t\t\tlong sum[][] = new long[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tlong[][] sums(long[][] a) {\n\t\t\tlong sum[][] = new long[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tdouble[][] sums(double[][] a) {\n\t\t\tdouble sum[][] = new double[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tlong[][] sums(boolean[][] a) {\n\t\t\tlong sum[][] = new long[a.length + 1][a[0].length + 1];\n\t\t\tfill(sum, 0);\n\t\t\tfor(int i = 0; i < a.length; i ++) {\n\t\t\t\tfor(int j = 0; j < a[i].length; j ++) {\n\t\t\t\t\tsum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + (a[i][j] ? 1 : 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t\tint constrain(int x, int l, int r) { return min(max(x, min(l, r)), max(l, r)); }\n\t\tlong constrain(long x, long l, long r) { return min(max(x, min(l, r)), max(l, r)); }\n\t\tdouble constrain(double x, double l, double r) { return min(max(x, min(l, r)), max(l, r)); }\n\t\tint abs(int x) { return x >= 0 ? x : - x; }\n\t\tlong abs(long x) { return x >= 0 ? x : - x; }\n\t\tdouble abs(double x) { return x >= 0 ? x : - x; }\n\t\tint signum(int x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }\n\t\tint signum(long x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }\n\t\tint signum(double x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }\n\t\tlong round(double x) { return Math.round(x); }\n\t\tlong floor(double x) { return (long)Math.floor(x); }\n\t\tint divfloor(int a, int b) { return signum(a) == signum(b) ? a / b : - divceil(abs(a), abs(b)); }\n\t\tlong divfloor(long a, long b) { return signum(a) == signum(b) ? a / b : - divceil(abs(a), abs(b)); }\n\t\tlong ceil(double x) { return (long)Math.ceil(x); }\n\t\tint divceil(int a, int b) { return a >= 0 && b > 0 ? (a + b - 1) / b\n\t\t\t\t\t\t\t\t\t\t\t: a < 0 && b < 0 ? divceil(abs(a), abs(b))\n\t\t\t\t\t\t\t\t\t\t\t: - divfloor(abs(a), abs(b)); }\n\t\tlong divceil(long a, long b) { return a >= 0 && b > 0 ? (a + b - 1) / b\n\t\t\t\t\t\t\t\t\t\t\t: a < 0 && b < 0 ? divceil(abs(a), abs(b))\n\t\t\t\t\t\t\t\t\t\t\t: - divfloor(abs(a), abs(b)); }\n\t\tdouble sqrt(int x) { return Math.sqrt((double)x); }\n\t\tdouble sqrt(long x) { return Math.sqrt((double)x); }\n\t\tdouble sqrt(double x) { return Math.sqrt(x); }\n\t\tlong fact(int n) {\n\t\t\tlong ans = 1;\n\t\t\tfor(int i = 1; i <= n; i ++) ans = Math.multiplyExact(ans, i);\n\t\t\treturn ans;\n\t\t}\n\t\tdouble pow(double x, double y) { return Math.pow(x, y); }\n\t\tlong pow(long x, long y) {\n\t\t\tlong ans = 1;\n\t\t\twhile(true) {\n\t\t\t\tif(y % 2 != 0) ans = Math.multiplyExact(ans, x);\n\t\t\t\ty /= 2;\n\t\t\t\tif(y <= 0) return ans;\n\t\t\t\tx = Math.multiplyExact(x, x);\n\t\t\t}\n\t\t}\n\t\tint gcd(int a, int b) {\n\t\t\twhile(true) {\n\t\t\t\tif(b == 0) return a;\n\t\t\t\tint tmp = a;\n\t\t\t\ta = b;\n\t\t\t\tb = tmp % b;\n\t\t\t}\n\t\t}\n\t\tlong gcd(long a, long b) {\n\t\t\twhile(true) {\n\t\t\t\tif(b == 0) return a;\n\t\t\t\tlong tmp = a;\n\t\t\t\ta = b;\n\t\t\t\tb = tmp % b;\n\t\t\t}\n\t\t}\n\t\tlong lcm(long a, long b) { return a / gcd(a, b) * b; }\n\t\tint gcd(int... a) {\n\t\t\tint gcd = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) gcd = gcd(gcd, a[i]);\n\t\t\treturn gcd;\n\t\t}\n\t\tlong gcd(long... a) {\n\t\t\tlong gcd = 0;\n\t\t\tfor(int i = 0; i < a.length; i ++) gcd = gcd(gcd, a[i]);\n\t\t\treturn gcd;\n\t\t}\n\t\tdouble random() { return Math.random(); }\n\t\tint random(int max) { return (int)floor(random() * max); }\n\t\tlong random(long max) { return floor(random() * max); }\n\t\tdouble random(double max) { return random() * max; }\n\t\tint random(int min, int max) { return random(max - min) + min; }\n\t\tlong random(long min, long max) { return random(max - min) + min; }\n\t\tdouble random(double min, double max) { return random(max - min) + min; }\n\n\t\tboolean isUpper(char a) { return a >= 'A' && a <= 'Z'; }\n\t\tboolean isLower(char a) { return a >= 'a' && a <= 'z'; }\n\t\tint upperToInt(char a) { return a - 'A'; }\n\t\tint lowerToInt(char a) { return a - 'a'; }\n\t\tint numToInt(char a) { return a - '0'; }\n\t\tint charToInt(char a) { return a >= 'a' ? lowerToInt(a) : a >= 'A' ? upperToInt(a) : numToInt(a); }\n\t\tchar intToUpper(int a) { return (char)(a + 'A'); }\n\t\tchar intToLower(int a) { return (char)(a + 'a'); }\n\t\tchar intToNum(int a) { return (char)(a + '0'); }\n\t\tint[] charToInt(char[] a) {\n\t\t\tint array[] = new int[a.length];\n\t\t\tfor(int i = 0; i < a.length; i ++) array[i] = charToInt(a[i]);\n\t\t\treturn array;\n\t\t}\n\n\t\tlong[] div(long a) {\n\t\t\tList divList = new ArrayList<>();\n\t\t\tfor(long i = 1; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tdivList.add(i);\n\t\t\t\t\tif(i * i != a) divList.add(a / i);\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong div[] = new long[divList.size()];\n\t\t\tfor(int i = 0; i < divList.size(); i ++) div[i] = divList.get(i);\n\t\t\tArrays.sort(div);\n\t\t\treturn div;\n\t\t}\n\n\t\tPairLL[] factor(long a) {\n\t\t\tList factorList = new ArrayList<>();\n\t\t\tfor(long i = 2; i * i <= a; i ++) {\n\t\t\t\tif(a % i == 0) {\n\t\t\t\t\tlong cnt = 0;\n\t\t\t\t\twhile(a % i == 0) { a /= i; cnt ++; }\n\t\t\t\t\tfactorList.add(new PairLL(i, cnt));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(a > 1) factorList.add(new PairLL(a, 1));\n\t\t\tPairLL factor[] = new PairLL[factorList.size()];\n\t\t\tfor(int i = 0; i < factorList.size(); i ++) factor[i] = factorList.get(i);\n\t\t\tArrays.sort(factor);\n\t\t\treturn factor;\n\t\t}\n\n\t\tboolean isPrime(long x) {\n\t\t\tboolean ok = x > 1;\n\t\t\tfor(long i = 2; i * i <= x; i ++) {\n\t\t\t\tok &= x % i != 0;\n\t\t\t\tif(!ok) return ok;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean[] prime(int num) {\n\t\t\tboolean prime[] = new boolean[num];\n\t\t\tfill(prime, true);\n\t\t\tif(num > 0) prime[0] = false;\n\t\t\tif(num > 1) prime[1] = false;\n\t\t\tfor(int i = 2; i < num; i ++) if(prime[i]) for(int j = 2; i * j < num; j ++) prime[i * j] = false;\n\t\t\treturn prime;\n\t\t}\n\n\t\tlong[][] countElements(long[] a, boolean sort) {\n\t\t\tint len = a.length;\n\t\t\tlong array[] = new long[len];\n\t\t\tfor(int i = 0; i < len; i ++) array[i] = a[i];\n\t\t\tif(sort) Arrays.sort(array);\n\t\t\tList elem = new ArrayList();\n\t\t\tList cnt = new ArrayList();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add(array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else tmp ++;\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\t\tlong[][] countElements(String str, boolean sort) {\n\t\t\tint len = str.length();\n\t\t\tchar array[] = str.toCharArray();\n\t\t\tif(sort) Arrays.sort(array);\n\t\t\tList elem = new ArrayList();\n\t\t\tList cnt = new ArrayList();\n\t\t\tlong tmp = 1;\n\t\t\tfor(int i = 1; i <= len; i ++) {\n\t\t\t\tif(i == len || array[i] != array[i - 1]) {\n\t\t\t\t\telem.add((long)array[i - 1]);\n\t\t\t\t\tcnt.add(tmp);\n\t\t\t\t\ttmp = 1;\n\t\t\t\t}else tmp ++;\n\t\t\t}\n\t\t\tlong counts[][] = new long[elem.size()][2];\n\t\t\tfor(int i = 0; i < elem.size(); i ++) {\n\t\t\t\tcounts[i][0] = elem.get(i);\n\t\t\t\tcounts[i][1] = cnt.get(i);\n\t\t\t}\n\t\t\treturn counts;\n\t\t}\n\n\t\tint[] baseConvert(long x, int n, int len) {\n\t\t\tint digit[] = new int[len];\n\t\t\tint i = 0;\n\t\t\tlong tmp = x;\n\t\t\twhile(tmp > 0 && i < len) { digit[i ++] = (int)(tmp % n); tmp /= n; }\n\t\t\treturn digit;\n\t\t}\n\t\tint[] baseConvert(long x, int n) {\n\t\t\tlong tmp = x;\n\t\t\tint len = 0;\n\t\t\twhile(tmp > 0) { tmp /= n; len ++; }\n\t\t\treturn baseConvert(x, n, len);\n\t\t}\n\t\tint[] baseConvert(int x, int n, int len) {\n\t\t\tint digit[] = new int[len];\n\t\t\tint i = 0;\n\t\t\tint tmp = x;\n\t\t\twhile(tmp > 0 && i < len) { digit[i ++] = (int)(tmp % n); tmp /= n; }\n\t\t\treturn digit;\n\t\t}\n\t\tint[] baseConvert(int x, int n) {\n\t\t\tint tmp = x;\n\t\t\tint len = 0;\n\t\t\twhile(tmp > 0) { tmp /= n; len ++; }\n\t\t\treturn baseConvert(x, n, len);\n\t\t}\n\t\tlong[] baseConvert(long x, long n, int len) {\n\t\t\tlong digit[] = new long[len];\n\t\t\tint i = 0;\n\t\t\tlong tmp = x;\n\t\t\twhile(tmp > 0 && i < len) { digit[i ++] = tmp % n; tmp /= n; }\n\t\t\treturn digit;\n\t\t}\n\t\tlong[] baseConvert(long x, long n) {\n\t\t\tlong tmp = x;\n\t\t\tint len = 0;\n\t\t\twhile(tmp > 0) { tmp /= n; len ++; }\n\t\t\treturn baseConvert(x, n, len);\n\t\t}\n\n\t\tint numDigits(long a) { return Long.toString(a).length(); }\n\t\tlong bitFlag(int a) { return 1L << (long)a; }\n\t\tboolean isFlagged(long x, int a) { return (x & bitFlag(a)) != 0; }\n\n\t\tlong countString(String str, String a) { return (str.length() - str.replace(a, \"\").length()) / a.length(); }\n\t\tlong countStringAll(String str, String a) { return str.length() - str.replaceAll(a, \"\").length(); }\n\n\n\t\tString reverse(String str) { return (new StringBuilder(str)).reverse().toString(); }\n\t\tvoid reverse(String[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(int[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(long[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(double[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(char[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid reverse(boolean[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\t void reverse(T[] array) { for(int i = 0; i < array.length / 2; i ++) swap(array, i, array.length - i - 1); }\n\t\tvoid fill(int[] array, int x) { Arrays.fill(array, x); }\n\t\tvoid fill(long[] array, long x) { Arrays.fill(array, x); }\n\t\tvoid fill(double[] array, double x) { Arrays.fill(array, x); }\n\t\tvoid fill(char[] array, char x) { Arrays.fill(array, x); }\n\t\tvoid fill(boolean[] array, boolean x) { Arrays.fill(array, x); }\n\t\tvoid fill(int[][] array, int x) { for(int[] a : array) fill(a, x); }\n\t\tvoid fill(long[][] array, long x) { for(long[] a : array) fill(a, x); }\n\t\tvoid fill(double[][] array, double x) { for(double[] a : array) fill(a, x); }\n\t\tvoid fill(char[][] array, char x) { for(char[] a : array) fill(a, x); }\n\t\tvoid fill(boolean[][] array, boolean x) { for(boolean[] a : array) fill(a, x); }\n\t\tvoid fill(int[][][] array, int x) { for(int[][] a : array) fill(a, x); }\n\t\tvoid fill(long[][][] array, long x) { for(long[][] a : array) fill(a, x); }\n\t\tvoid fill(double[][][] array, double x) { for(double[][] a : array) fill(a, x); }\n\t\tvoid fill(char[][][] array, char x) { for(char[][] a : array) fill(a, x); }\n\t\tvoid fill(boolean[][][] array, boolean x) { for(boolean[][] a : array) fill(a, x); }\n\n\t\tint[] resize(int[] array, int m, int x) {\n\t\t\tint resized[] = new int[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tlong[] resize(long[] array, int m, int x) {\n\t\t\tlong resized[] = new long[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tdouble[] resize(double[] array, int m, int x) {\n\t\t\tdouble resized[] = new double[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tchar[] resize(char[] array, int m, int x) {\n\t\t\tchar resized[] = new char[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tboolean[] resize(boolean[] array, int m, int x) {\n\t\t\tboolean resized[] = new boolean[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\t\tObject[] resize(Object[] array, int m, int x) {\n\t\t\tObject resized[] = new Object[m];\n\t\t\tfor(int i = max(0, - x); i < array.length && i + x < m; i ++) resized[i + x] = array[i];\n\t\t\treturn resized;\n\t\t}\n\n\t\tvoid shuffleArray(int[] array){\n\t\t\tfor(int i = 0; i < array.length; i ++){\n\t\t\t\tint tmp = array[i];\n\t\t\t\tint randomPos = random(i, array.length);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\t\tvoid shuffleArray(long[] array){\n\t\t\tfor(int i = 0; i < array.length; i ++){\n\t\t\t\tlong tmp = array[i];\n\t\t\t\tint randomPos = random(i, array.length);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\t\tvoid shuffleArray(double[] array){\n\t\t\tfor(int i = 0; i < array.length; i ++){\n\t\t\t\tdouble tmp = array[i];\n\t\t\t\tint randomPos = random(i, array.length);\n\t\t\t\tarray[i] = array[randomPos];\n\t\t\t\tarray[randomPos] = tmp;\n\t\t\t}\n\t\t}\n\t\tint[] randomi(int num, int max){\n\t\t\tint array[] = new int[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(max);\n\t\t\treturn array;\n\t\t}\n\t\tlong[] randoml(int num, long max){\n\t\t\tlong array[] = new long[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(max);\n\t\t\treturn array;\n\t\t}\n\t\tdouble[] randomd(int num, double max){\n\t\t\tdouble array[] = new double[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(max);\n\t\t\treturn array;\n\t\t}\n\t\tint[] randomi(int num, int min, int max){\n\t\t\tint array[] = new int[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(min, max);\n\t\t\treturn array;\n\t\t}\n\t\tlong[] randoml(int num, long min, long max){\n\t\t\tlong array[] = new long[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(min, max);\n\t\t\treturn array;\n\t\t}\n\t\tdouble[] randomd(int num, double min, double max){\n\t\t\tdouble array[] = new double[num];\n\t\t\tfor(int i = 0; i < num; i ++) array[i] = random(min, max);\n\t\t\treturn array;\n\t\t}\n\n\t\tvoid swap(String[] array, int i, int j) {\n\t\t\tString tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(int[] array, int i, int j) {\n\t\t\tint tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(long[] array, int i, int j) {\n\t\t\tlong tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(double[] array, int i, int j) {\n\t\t\tdouble tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(char[] array, int i, int j) {\n\t\t\tchar tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\tvoid swap(boolean[] array, int i, int j) {\n\t\t\tboolean tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\t\t void swap(T[] array, int i, int j) {\n\t\t\tT tmp = array[i];\n\t\t\tarray[i] = array[j];\n\t\t\tarray[j] = tmp;\n\t\t}\n\n\t\tint[] compress(int[] a) {\n\t\t\tint num = a.length;\n\t\t\tSet ss = new TreeSet<>();\n\t\t\tfor(int i = 0; i < num; i ++) ss.add(a[i]);\n\t\t\tint compressed[] = new int[ss.size()];\n\t\t\tint j = 0;\n\t\t\tfor(Integer x : ss) compressed[j ++] = x;\n\t\t\tfor(int i = 0; i < num; i ++) a[i] = lowerBound(compressed, a[i]);\n\t\t\treturn compressed;\n\t\t}\n\t\tlong[] compress(long[] a) {\n\t\t\tint num = a.length;\n\t\t\tSet ss = new TreeSet<>();\n\t\t\tfor(int i = 0; i < num; i ++) ss.add(a[i]);\n\t\t\tlong compressed[] = new long[ss.size()];\n\t\t\tint j = 0;\n\t\t\tfor(Long x : ss) compressed[j ++] = x;\n\t\t\tfor(int i = 0; i < num; i ++) a[i] = lowerBound(compressed, a[i]);\n\t\t\treturn compressed;\n\t\t}\n\t\tdouble[] compress(double[] a) {\n\t\t\tint num = a.length;\n\t\t\tSet ss = new TreeSet<>();\n\t\t\tfor(int i = 0; i < num; i ++) ss.add(a[i]);\n\t\t\tdouble compressed[] = new double[ss.size()];\n\t\t\tint j = 0;\n\t\t\tfor(Double x : ss) compressed[j ++] = x;\n\t\t\tfor(int i = 0; i < num; i ++) a[i] = lowerBound(compressed, a[i]);\n\t\t\treturn compressed;\n\t\t}\n\n\n\t\tint lowerBound(int[] array, int key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\tint lowerBound(int[] array, int key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\tint upperBound(int[] array, int key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\tint upperBound(int[] array, int key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\tint cntBS(int[] array, int key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\tint cntBS(int[] array, int key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\tint BS(int[] array, int key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\tint binarySearch(int[] array, int key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean isOKforBinarySearch(int[] array, int index, int key, boolean greater, boolean equals) {\n\t\t\treturn (array[index] > key && greater) || (array[index] < key && !greater) || (array[index] == key && equals);\n\t\t}\n\t\tint lowerBound(long[] array, long key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\tint lowerBound(long[] array, long key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\tint upperBound(long[] array, long key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\tint upperBound(long[] array, long key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\tint cntBS(long[] array, long key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\tint cntBS(long[] array, long key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\tint BS(long[] array, long key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\tint binarySearch(long[] array, long key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean isOKforBinarySearch(long[] array, int index, long key, boolean greater, boolean equals) {\n\t\t\treturn (array[index] > key && greater) || (array[index] < key && !greater) || (array[index] == key && equals);\n\t\t}\n\t\tint lowerBound(double[] array, double key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\tint lowerBound(double[] array, double key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\tint upperBound(double[] array, double key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\tint upperBound(double[] array, double key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\tint cntBS(double[] array, double key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\tint cntBS(double[] array, double key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\tint BS(double[] array, double key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\tint binarySearch(double[] array, double key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\tboolean isOKforBinarySearch(double[] array, int index, double key, boolean greater, boolean equals) {\n\t\t\treturn (array[index] > key && greater) || (array[index] < key && !greater) || (array[index] == key && equals);\n\t\t}\n\t\t> int lowerBound(T[] array, T key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\t> int lowerBound(T[] array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\t> int upperBound(T[] array, T key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\t> int upperBound(T[] array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\t> int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\t> int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\t> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\t> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\t> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\t> int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t> int binarySearch(T[] array, T key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t> boolean isOKforBinarySearch(T[] array, int index, T key, boolean greater, boolean equals) {\n\t\t\tint compare = array[index].compareTo(key);\n\t\t\treturn (compare > 0 && greater) || (compare < 0 && !greater) || (compare == 0 && equals);\n\t\t}\n\t\t int lowerBound(T[] array, T key, Comparator c) {\n\t\t\treturn BS(array, key, true, true, true, c);\n\t\t}\n\t\t int lowerBound(T[] array, T key, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok, c);\n\t\t}\n\t\t int upperBound(T[] array, T key, Comparator c) {\n\t\t\treturn BS(array, key, true, true, false, c);\n\t\t}\n\t\t int upperBound(T[] array, T key, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok, c);\n\t\t}\n\t\t int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, c);\n\t\t}\n\t\t int cntBS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok, c);\n\t\t}\n\t\t int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, c);\n\t\t}\n\t\t int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok, c);\n\t\t}\n\t\t int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count, Comparator c) {\n\t\t\tint ng = ascending ^ greater ? array.length : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.length;\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok, c);\n\t\t}\n\t\t int BS(T[] array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok, Comparator c) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok, c);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t int binarySearch(T[] array, T key, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals, c)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t boolean isOKforBinarySearch(T[] array, int index, T key, boolean greater, boolean equals, Comparator c) {\n\t\t\tint compare = c.compare(array[index], key);\n\t\t\treturn (compare > 0 && greater) || (compare < 0 && !greater) || (compare == 0 && equals);\n\t\t}\n\t\t> int lowerBound(List array, T key) {\n\t\t\treturn BS(array, key, true, true, true);\n\t\t}\n\t\t> int lowerBound(List array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok);\n\t\t}\n\t\t> int upperBound(List array, T key) {\n\t\t\treturn BS(array, key, true, true, false);\n\t\t}\n\t\t> int upperBound(List array, T key, int ng, int ok) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok);\n\t\t}\n\t\t> int cntBS(List array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true);\n\t\t}\n\t\t> int cntBS(List array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok);\n\t\t}\n\t\t> int BS(List array, T key, boolean ascending, boolean greater, boolean equals) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false);\n\t\t}\n\t\t> int BS(List array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok);\n\t\t}\n\t\t> int BS(List array, T key, boolean ascending, boolean greater, boolean equals, boolean count) {\n\t\t\tint ng = ascending ^ greater ? array.size() : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.size();\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok);\n\t\t}\n\t\t> int BS(List array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t> int binarySearch(List array, T key, boolean greater, boolean equals, int ng, int ok) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t> boolean isOKforBinarySearch(List array, int index, T key, boolean greater, boolean equals) {\n\t\t\tint compare = array.get(index).compareTo(key);\n\t\t\treturn (compare > 0 && greater) || (compare < 0 && !greater) || (compare == 0 && equals);\n\t\t}\n\t\t int lowerBound(List array, T key, Comparator c) {\n\t\t\treturn BS(array, key, true, true, true, c);\n\t\t}\n\t\t int lowerBound(List array, T key, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, true, true, true, ng, ok, c);\n\t\t}\n\t\t int upperBound(List array, T key, Comparator c) {\n\t\t\treturn BS(array, key, true, true, false, c);\n\t\t}\n\t\t int upperBound(List array, T key, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, true, true, false, ng, ok, c);\n\t\t}\n\t\t int cntBS(List array, T key, boolean ascending, boolean greater, boolean equals, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, c);\n\t\t}\n\t\t int cntBS(List array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, true, ng, ok, c);\n\t\t}\n\t\t int BS(List array, T key, boolean ascending, boolean greater, boolean equals, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, c);\n\t\t}\n\t\t int BS(List array, T key, boolean ascending, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\treturn BS(array, key, ascending, greater, equals, false, ng, ok, c);\n\t\t}\n\t\t int BS(List array, T key, boolean ascending, boolean greater, boolean equals, boolean count, Comparator c) {\n\t\t\tint ng = ascending ^ greater ? array.size() : -1;\n\t\t\tint ok = ascending ^ greater ? -1 : array.size();\n\t\t\treturn BS(array, key, ascending, greater, equals, count, ng, ok, c);\n\t\t}\n\t\t int BS(List array, T key, boolean ascending, boolean greater, boolean equals, boolean count, int ng, int ok, Comparator c) {\n\t\t\tint index = binarySearch(array, key, greater, equals, ng, ok, c);\n\t\t\treturn count ? (int)abs(ok - index) : index;\n\t\t}\n\t\t int binarySearch(List array, T key, boolean greater, boolean equals, int ng, int ok, Comparator c) {\n\t\t\twhile (abs(ok - ng) > 1) {\n\t\t\t\tint mid = (ok + ng) / 2;\n\t\t\t\tif(isOKforBinarySearch(array, mid, key, greater, equals, c)) ok = mid; else ng = mid;\n\t\t\t}\n\t\t\treturn ok;\n\t\t}\n\t\t boolean isOKforBinarySearch(List array, int index, T key, boolean greater, boolean equals, Comparator c) {\n\t\t\tint compare = c.compare(array.get(index), key);\n\t\t\treturn (compare > 0 && greater) || (compare < 0 && !greater) || (compare == 0 && equals);\n\t\t}\n\n\t\tPairLL binaryRangeSearch(long left, long right, UnaryOperator op, boolean minimize) {\n\t\t\tlong ok1 = right, ng1 = left;\n\t\t\twhile(abs(ok1 - ng1) > 1) {\n\t\t\t\tlong mid = (ok1 + ng1) / 2;\n\t\t\t\tboolean isOK = (op.apply(mid + 1) - op.apply(mid)) * (minimize ? 1 : -1) >= 0;\n\t\t\t\tif(isOK) ok1 = mid; else ng1 = mid;\n\t\t\t}\n\t\t\tlong ok2 = left, ng2 = right;\n\t\t\twhile(abs(ok2 - ng2) > 1) {\n\t\t\t\tlong mid = (ok2 + ng2) / 2;\n\t\t\t\tboolean isOK = (op.apply(mid - 1) - op.apply(mid)) * (minimize ? 1 : -1) >= 0;\n\t\t\t\tif(isOK) ok2 = mid; else ng2 = mid;\n\t\t\t}\n\t\t\treturn new PairLL(ok1, ok2); //[l, r]\n\t\t}\n\n\t\tdouble ternarySearch(double left, double right, UnaryOperator op, boolean minimize, int loop) {\n\t\t\tfor(int cnt = 0; cnt < loop; cnt ++) {\n\t\t\t\tdouble m1 = (left * 2 + right) / 3.0;\n\t\t\t\tdouble m2 = (left + right * 2) / 3.0;\n\t\t\t\tif(op.apply(m1) > op.apply(m2) ^ minimize) right = m2; else left = m1;\n\t\t\t}\n\t\t\treturn (left + right) / 2.0;\n\t\t}\n\n\n\t\t// mods\n\t\tfinal long MOD = (long)1e9 + 7; // 998244353;\n\t\tlong mod(long x) { x %= MOD; return x + (x < 0 ? MOD : 0); }\n\t\tvoid mod(long[] a) { for(int i = 0; i < a.length; i ++) a[i] = mod(a[i]); }\n\t\tvoid mod(long[][] a) { for(int i = 0; i < a.length; i ++) mod(a[i]); }\n\t\tvoid mod(long[][][] a) { for(int i = 0; i < a.length; i ++) mod(a[i]); }\n\n\t\tlong pow_m(long x, long y) {\n\t\t\tx = mod(x);\n\t\t\tlong ans = 1;\n\t\t\tfor(; y > 0; y /= 2) {\n\t\t\t\tif(y % 2 != 0) ans = mod(ans * x);\n\t\t\t\tx = mod(x * x);\n\t\t\t}\n\t\t\treturn ans;\n\t\t}\n\t\tlong[] pows_m(long x, int max) {\n\t\t\tlong pow[] = new long[max + 1];\n\t\t\tpow[0] = 1;\n\t\t\tfor(int i = 0; i < max; i ++) pow[i + 1] = mod(pow[i] * x);\n\t\t\treturn pow;\n\t\t}\n\t\tlong fact_m(int n) {\n\t\t\tlong ans = 1;\n\t\t\tfor(int i = 1; i <= n; i ++) ans = mod(ans * i);\n\t\t\treturn ans;\n\t\t}\n\n\t\tfinal int MAX_INV_SIZE = 100_100;\n\t\tMap invMap = new HashMap<>();\n\t\tlong inv(long x) {\n\t\t\tx = mod(x);\n\t\t\tif(invMap.containsKey(x)) return invMap.get(x);\n\t\t\tif(invMap.size() >= MAX_INV_SIZE) return calInv(x);\n\t\t\tinvMap.put(x, calInv(x));\n\t\t\treturn invMap.get(x);\n\t\t}\n\t\tlong calInv(long x) { return pow_m(x, MOD - 2); }\n\n\t\tfinal int MAX_FACT = 5_000_100;\n\t\tlong fact[];\n\t\tlong invFact[];\n\t\tboolean isFactPrepared = false;\n\t\tMap factMap;\n\t\tvoid prepareFact() {\n\t\t\tfact = new long[MAX_FACT];\n\t\t\tfill(fact, 0);\n\t\t\tinvFact = new long[MAX_FACT];\n\t\t\tfill(invFact, 0);\n\t\t\tfact[0] = 1;\n\t\t\tint maxIndex = min(MAX_FACT, (int)MOD);\n\t\t\tfor(int i = 1; i < maxIndex; i ++) fact[i] = mod(fact[i - 1] * i);\n\t\t\tinvFact[maxIndex - 1] = inv(fact[maxIndex - 1]);\n\t\t\tfor(int i = maxIndex - 1; i > 0; i --) invFact[i - 1] = mod(invFact[i] * i);\n\n\t\t\tfactMap = new HashMap<>();\n\t\t\tisFactPrepared = true;\n\t\t}\n\n\t\tlong P(int n, int r) {\n\t\t\tif(!isFactPrepared) { prepareFact(); }\n\t\t\tif(n < 0 || r < 0 || n < r) { return 0; }\n\t\t\tif(n >= MAX_FACT) {\n\t\t\t\tif(!factMap.containsKey(n)) {\n\t\t\t\t\tlong largeFact[] = new long[MAX_FACT];\n\t\t\t\t\tfactMap.put(n, largeFact);\n\t\t\t\t\tfill(largeFact, -INF);\n\t\t\t\t\tlargeFact[0] = 1;\n\t\t\t\t}\n\t\t\t\tlong largeFact[] = factMap.get(n);\n\t\t\t\tint i = r;\n\t\t\t\twhile(isINF(largeFact[i])) i --;\n\t\t\t\tfor(; i < r; i ++) largeFact[i + 1] = mod(largeFact[i] * (n - i));\n\t\t\t\treturn largeFact[r];\n\t\t\t}\n\t\t\treturn mod(fact[n] * invFact[n - r]);\n\t\t}\n\t\tlong C(int n, int r) {\n\t\t\tif(!isFactPrepared) prepareFact();\n\t\t\tif(n < 0 || r < 0 || n < r) return 0;\n\t\t\treturn mod(P(n, r) * invFact[r]);\n\t\t}\n\t\tlong H(int n, int r) { return C((n - 1) + r, r); }\n\n\n\t\t// grid\n\t\tclass Grids {\n\t\t\tint h;\n\t\t\tint w;\n\t\t\tGrid[][] gs;\n\t\t\tGrid[] gi;\n\t\t\tGrids(int h, int w) {\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t\tgs = new Grid[h][w];\n\t\t\t\tgi = new Grid[h * w];\n\t\t\t\tfor(int i = 0; i < h; i ++) {\n\t\t\t\t\tfor(int j = 0; j < w; j ++) {\n\t\t\t\t\t\tgs[i][j] = new Grid(i, j, h, w);\n\t\t\t\t\t\tgi[gs[i][j].i] = gs[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid init(boolean[][] b) {\n\t\t\t\tfor(int i = 0; i < h; i ++) for(int j = 0; j < w; j ++) gs[i][j].b = b[i][j];\n\t\t\t}\n\t\t\tvoid init(long[][] val) {\n\t\t\t\tfor(int i = 0; i < h; i ++) for(int j = 0; j < w; j ++) gs[i][j].val = val[i][j];\n\t\t\t}\n\n\t\t\tGrid get(int x, int y) { return isValid(x, y, h, w) ? gs[x][y] : null; }\n\t\t\tGrid get(int i) { return get(i / w, i % w); }\n\n\t\t\tint dx[] = {0, -1, 1, 0, 0, -1, 1, -1, 1};\n\t\t\tint dy[] = {0, 0, 0, -1, 1, -1, -1, 1, 1};\n\t\t\tGrid next(int x, int y, int i) { return next(gs[x][y], i); }\n\t\t\tGrid next(Grid g, int i) {\n\t\t\t\treturn isValid(g.x + dx[i], g.y + dy[i], g.h, g.w)\n\t\t\t\t\t? gs[g.x + dx[i]][g.y + dy[i]]\n\t\t\t\t\t: null;\n\t\t\t}\n\t\t}\n\t\tclass Grid implements Comparable {\n\t\t\tint x;\n\t\t\tint y;\n\t\t\tint h;\n\t\t\tint w;\n\t\t\tint i;\n\t\t\tboolean b;\n\t\t\tlong val;\n\n\t\t\tGrid() { }\n\t\t\tGrid(int x, int y, int h, int w) { init(x, y, h, w, false, 0); }\n\t\t\tGrid(int x, int y, int h, int w, boolean b) { init(x, y, h, w, b, 0); }\n\t\t\tGrid(int x, int y, int h, int w, long val) { init(x, y, h, w, false, val); }\n\t\t\tGrid(int x, int y, int h, int w, boolean b, long val) { init(x, y, h, w, b, val); }\n\n\t\t\tvoid init(int x, int y, int h, int w, boolean b, long val) {\n\t\t\t\tthis.x = x;\n\t\t\t\tthis.y = y;\n\t\t\t\tthis.h = h;\n\t\t\t\tthis.w = w;\n\t\t\t\tthis.b = b;\n\t\t\t\tthis.val = val;\n\t\t\t\tthis.i = x * w + y;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+x+\", \"+y+\")\"+\" \"+booleanToString(b)+\" \"+val; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(x, y, h, w, b, val); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tGrid that = (Grid) obj;\n\t\t\t\tif(this.x != that.x) return false;\n\t\t\t\tif(this.y != that.y) return false;\n\t\t\t\tif(this.h != that.h) return false;\n\t\t\t\tif(this.w != that.w) return false;\n\t\t\t\tif(this.b != that.b) return false;\n\t\t\t\tif(this.val != that.val) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(Grid that) {\n\t\t\t\tint c = Long.compare(this.val, that.val);\n\t\t\t\tif(c == 0) c = Integer.compare(this.x, that.x);\n\t\t\t\tif(c == 0) c = Integer.compare(this.y, that.y);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\n\t\tboolean isValid(int x, int y, int h, int w) { return x >= 0 && x < h && y >= 0 && y < w; }\n\t\tboolean isValid(Grid g) { return isValid(g.x, g.y, g.h, g.w); }\n\n\t\t// graph\n\t\tclass Graph {\n\t\t\tint numNode;\n\t\t\tint numEdge;\n\t\t\tboolean directed;\n\t\t\tSet edges = new HashSet<>();\n\t\t\tNode nodes[];\n\t\t\tNode reversedNodes[];\n\n\t\t\tGraph(int numNode, int numEdge, boolean directed) {\n\t\t\t\tthis.numNode = numNode;\n\t\t\t\tthis.numEdge = numEdge;\n\t\t\t\tthis.directed = directed;\n\t\t\t\tnodes = new Node[numNode];\n\t\t\t\treversedNodes = new Node[numNode];\n\t\t\t\tfor(int i = 0; i < numNode; i ++) {\n\t\t\t\t\tnodes[i] = new Node(i);\n\t\t\t\t\treversedNodes[i] = new Node(i);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid init(Set edges) {\n\t\t\t\tthis.edges = edges;\n\t\t\t\tfor(Edge e : edges) add(e);\n\t\t\t}\n\n\t\t\tvoid add(Edge e) {\n\t\t\t\tedges.add(e);\n\t\t\t\tnodes[e.source].add(e.target, e.cost);\n\t\t\t\tif(directed) reversedNodes[e.target].add(e.source, e.cost);\n\t\t\t\telse nodes[e.target].add(e.source, e.cost);\n\t\t\t}\n\n\t\t\tvoid remove(Edge e) {\n\t\t\t\tedges.remove(e);\n\t\t\t\tnodes[e.source].remove(e.target, e.cost);\n\t\t\t\tif(directed) reversedNodes[e.target].remove(e.source, e.cost);\n\t\t\t\telse nodes[e.target].remove(e.source, e.cost);\n\t\t\t}\n\n\t\t\tvoid update(Edge e, long cost) {\n\t\t\t\tnodes[e.source].update(e.target, cost);\n\t\t\t\tif(directed) reversedNodes[e.target].update(e.source, cost);\n\t\t\t\telse nodes[e.target].update(e.source, cost);\n\t\t\t\te.cost = cost;\n\t\t\t}\n\t\t\tvoid update(int source, int target, long cost) { update(new Edge(source, target, cost), cost); }\n\n\t\t\tvoid clearNodes() {\n\t\t\t\tfor(Node n : nodes) n.clear();\n\t\t\t\tfor(Node n : reversedNodes) n.clear();\n\t\t\t}\n\t\t}\n\n\t\tclass Node extends HashSet {\n\t\t\tint id;\n\n\t\t\tNode(int id) { this.id = id; }\n\t\t\tvoid add(int target, long cost) { add(new Edge(id, target, cost)); }\n\t\t\tvoid remove(int target, long cost) { remove(new Edge(id, target, cost)); }\n\t\t\tvoid update(int target, long cost) { remove(target, cost); add(target, cost); }\n\t\t}\n\n\t\tclass Edge implements Comparable {\n\t\t\tint source;\n\t\t\tint target;\n\t\t\tlong cost;\n\t\t\tEdge(int source, int target, long cost) {\n\t\t\t\tthis.source = source;\n\t\t\t\tthis.target = target;\n\t\t\t\tthis.cost = cost;\n\t\t\t}\n\n\n\t\t\t@Override\n\t\t\tpublic String toString() { return source+\" - \"+cost+\" -> \"+target; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(source, target); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tEdge that = (Edge) obj;\n\t\t\t\tif(this.source != that.source) return false;\n\t\t\t\tif(this.target != that.target) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(Edge that) {\n\t\t\t\tint c = Long.compare(this.cost, that.cost);\n\t\t\t\tif(c == 0) c = Integer.compare(this.source, that.source);\n\t\t\t\tif(c == 0) c = Integer.compare(this.target, that.target);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\n\t\t// Pair, Tuple\n\t\tclass Pair, U extends Comparable> implements Comparable> {\n\t\t\tT a;\n\t\t\tU b;\n\t\t\tPair() { }\n\t\t\tPair(T a, U b) {\n\t\t\t\tthis.a = a;\n\t\t\t\tthis.b = b;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+a.toString()+\", \"+b.toString()+\")\"; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPair that = (Pair) obj;\n\t\t\t\tif(this.a.getClass() != that.a.getClass()) return false;\n\t\t\t\tif(this.b.getClass() != that.b.getClass()) return false;\n\t\t\t\tif(!this.a.equals(that.a)) return false;\n\t\t\t\tif(!this.b.equals(that.b)) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(Pair that) {\n\t\t\t\tint c = (this.a).compareTo(that.a);\n\t\t\t\tif(c == 0) c = (this.b).compareTo(that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairII implements Comparable {\n\t\t\tint a; int b;\n\t\t\tPairII() { }\n\t\t\tPairII(int a, int b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairII that = (PairII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairII that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairIL implements Comparable {\n\t\t\tint a; long b;\n\t\t\tPairIL() { }\n\t\t\tPairIL(int a, long b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairIL that = (PairIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairIL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairID implements Comparable {\n\t\t\tint a; double b;\n\t\t\tPairID() { }\n\t\t\tPairID(int a, double b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairID that = (PairID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairID that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairLI implements Comparable {\n\t\t\tlong a; int b;\n\t\t\tPairLI() { }\n\t\t\tPairLI(long a, int b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairLI that = (PairLI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairLI that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairLL implements Comparable {\n\t\t\tlong a; long b;\n\t\t\tPairLL() { }\n\t\t\tPairLL(long a, long b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairLL that = (PairLL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairLL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairLD implements Comparable {\n\t\t\tlong a; double b;\n\t\t\tPairLD() { }\n\t\t\tPairLD(long a, double b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairLD that = (PairLD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairLD that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairDI implements Comparable {\n\t\t\tdouble a; int b;\n\t\t\tPairDI() { }\n\t\t\tPairDI(double a, int b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairDI that = (PairDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairDI that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairDL implements Comparable {\n\t\t\tdouble a; long b;\n\t\t\tPairDL() { }\n\t\t\tPairDL(double a, long b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairDL that = (PairDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairDL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass PairDD implements Comparable {\n\t\t\tdouble a; double b;\n\t\t\tPairDD() { }\n\t\t\tPairDD(double a, double b) { this.a = a; this.b = b; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tPairDD that = (PairDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(PairDD that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\n\t\tinterface ITuple {\n\t\t\tpublic StringBuilder toStringBuilder();\n\t\t\t@Override\n\t\t\tpublic String toString();\n\t\t\t@Override\n\t\t\tpublic int hashCode();\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj);\n\t\t}\n\t\tclass BasicTuple, V extends Comparable> implements Comparable {\n\t\t\tT t;\n\t\t\tV a;\n\t\t\tBasicTuple() { }\n\n\t\t\tStringBuilder sbTuple = new StringBuilder();\n\t\t\tpublic StringBuilder toStringBuilder() {\n\t\t\t\tsbTuple.setLength(0);\n\t\t\t\treturn sbTuple.append(t.toStringBuilder()).append(\", \").append(a);\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+toStringBuilder().toString()+\")\"; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(t, a); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tBasicTuple that = (BasicTuple) obj;\n\t\t\t\tif(this.t.getClass() != that.t.getClass()) return false;\n\t\t\t\tif(this.a.getClass() != that.a.getClass()) return false;\n\t\t\t\tif(!this.t.equals(that.t)) return false;\n\t\t\t\tif(!this.a.equals(that.a)) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tpublic int compareTo(BasicTuple that) {\n\t\t\t\tint c = (this.t).compareTo((T) (Object) that.t);\n\t\t\t\tif(c == 0) c = (this.a).compareTo((V) (Object) that.a);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass UniqueTuple> implements ITuple, Comparable {\n\t\t\tV a;\n\t\t\tUniqueTuple() { }\n\n\t\t\tStringBuilder sbTuple = new StringBuilder();\n\t\t\tpublic StringBuilder toStringBuilder() {\n\t\t\t\tsbTuple.setLength(0);\n\t\t\t\treturn sbTuple.append(a);\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic String toString() { return \"(\"+toStringBuilder().toString()+\")\"; }\n\t\t\t@Override\n\t\t\tpublic int hashCode() { return Objects.hash(a); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null) return false;\n\t\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\t\tUniqueTuple that = (UniqueTuple) obj;\n\t\t\t\tif(this.a.getClass() != that.a.getClass()) return false;\n\t\t\t\tif(!this.a.equals(that.a)) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tpublic int compareTo(UniqueTuple that) {\n\t\t\t\treturn (this.a).compareTo((V) (Object) that.a);\n\t\t\t}\n\t\t}\n\n\t\tclass Tuple1> extends UniqueTuple implements ITuple {\n\t\t\tTuple1() { super(); }\n\t\t\tTuple1(T0 a0) {\n\t\t\t\tsuper();\n\t\t\t\tthis.a = a0;\n\t\t\t}\n\t\t\tT0 get0() { return a; }\n\t\t\tvoid set0(T0 x) { a = x; }\n\t\t}\n\t\tclass Tuple2<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable>\n\t\t\t\textends BasicTuple, T1> implements ITuple {\n\t\t\tTuple2() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple2(T0 a0, T1 a1) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple1(a0);\n\t\t\t\tthis.a = a1;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { a = x; }\n\t\t}\n\t\tclass Tuple3<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable>\n\t\t\t\textends BasicTuple, T2> implements ITuple {\n\t\t\tTuple3() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple3(T0 a0, T1 a1, T2 a2) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple2(a0, a1);\n\t\t\t\tthis.a = a2;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { a = x; }\n\t\t}\n\t\tclass Tuple4<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable,\n\t\t\t\tT3 extends Comparable>\n\t\t\t\textends BasicTuple, T3> implements ITuple {\n\t\t\tTuple4() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple4(T0 a0, T1 a1, T2 a2, T3 a3) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple3(a0, a1, a2);\n\t\t\t\tthis.a = a3;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { a = x; }\n\t\t}\n\t\tclass Tuple5<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable,\n\t\t\t\tT3 extends Comparable,\n\t\t\t\tT4 extends Comparable>\n\t\t\t\textends BasicTuple, T4> implements ITuple {\n\t\t\tTuple5() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple5(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple4(a0, a1, a2, a3);\n\t\t\t\tthis.a = a4;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { a = x; }\n\t\t}\n\t\tclass Tuple6<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable,\n\t\t\t\tT3 extends Comparable,\n\t\t\t\tT4 extends Comparable,\n\t\t\t\tT5 extends Comparable>\n\t\t\t\textends BasicTuple, T5> implements ITuple {\n\t\t\tTuple6() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple6(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4, T5 a5) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple5(a0, a1, a2, a3, a4);\n\t\t\t\tthis.a = a5;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return t.get4(); }\n\t\t\tT5 get5() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { t.set4(x); }\n\t\t\tvoid set5(T5 x) { a = x; }\n\t\t}\n\t\tclass Tuple7<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable,\n\t\t\t\tT3 extends Comparable,\n\t\t\t\tT4 extends Comparable,\n\t\t\t\tT5 extends Comparable,\n\t\t\t\tT6 extends Comparable>\n\t\t\t\textends BasicTuple, T6> implements ITuple {\n\t\t\tTuple7() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple7(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4, T5 a5, T6 a6) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple6(a0, a1, a2, a3, a4, a5);\n\t\t\t\tthis.a = a6;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return t.get4(); }\n\t\t\tT5 get5() { return t.get5(); }\n\t\t\tT6 get6() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { t.set4(x); }\n\t\t\tvoid set5(T5 x) { t.set5(x); }\n\t\t\tvoid set6(T6 x) { a = x; }\n\t\t}\n\t\tclass Tuple8<\n\t\t\t\tT0 extends Comparable,\n\t\t\t\tT1 extends Comparable,\n\t\t\t\tT2 extends Comparable,\n\t\t\t\tT3 extends Comparable,\n\t\t\t\tT4 extends Comparable,\n\t\t\t\tT5 extends Comparable,\n\t\t\t\tT6 extends Comparable,\n\t\t\t\tT7 extends Comparable>\n\t\t\t\textends BasicTuple, T7> implements ITuple {\n\t\t\tTuple8() { super(); }\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tTuple8(T0 a0, T1 a1, T2 a2, T3 a3, T4 a4, T5 a5, T6 a6, T7 a7) {\n\t\t\t\tsuper();\n\t\t\t\tthis.t = new Tuple7(a0, a1, a2, a3, a4, a5, a6);\n\t\t\t\tthis.a = a7;\n\t\t\t}\n\t\t\tT0 get0() { return t.get0(); }\n\t\t\tT1 get1() { return t.get1(); }\n\t\t\tT2 get2() { return t.get2(); }\n\t\t\tT3 get3() { return t.get3(); }\n\t\t\tT4 get4() { return t.get4(); }\n\t\t\tT5 get5() { return t.get5(); }\n\t\t\tT6 get6() { return t.get6(); }\n\t\t\tT7 get7() { return a; }\n\t\t\tvoid set0(T0 x) { t.set0(x); }\n\t\t\tvoid set1(T1 x) { t.set1(x); }\n\t\t\tvoid set2(T2 x) { t.set2(x); }\n\t\t\tvoid set3(T3 x) { t.set3(x); }\n\t\t\tvoid set4(T4 x) { t.set4(x); }\n\t\t\tvoid set5(T5 x) { t.set5(x); }\n\t\t\tvoid set6(T6 x) { t.set6(x); }\n\t\t\tvoid set7(T7 x) { a = x; }\n\t\t}\n\n\t\tclass TupleIII implements Comparable {\n\t\t\tint a; int b; int c;\n\t\t\tTupleIII() { }\n\t\t\tTupleIII(int a, int b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIII that = (TupleIII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIII that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIIL implements Comparable {\n\t\t\tint a; int b; long c;\n\t\t\tTupleIIL() { }\n\t\t\tTupleIIL(int a, int b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIIL that = (TupleIIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIIL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIID implements Comparable {\n\t\t\tint a; int b; double c;\n\t\t\tTupleIID() { }\n\t\t\tTupleIID(int a, int b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIID that = (TupleIID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIID that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleILI implements Comparable {\n\t\t\tint a; long b; int c;\n\t\t\tTupleILI() { }\n\t\t\tTupleILI(int a, long b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleILI that = (TupleILI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleILI that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleILL implements Comparable {\n\t\t\tint a; long b; long c;\n\t\t\tTupleILL() { }\n\t\t\tTupleILL(int a, long b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleILL that = (TupleILL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleILL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleILD implements Comparable {\n\t\t\tint a; long b; double c;\n\t\t\tTupleILD() { }\n\t\t\tTupleILD(int a, long b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleILD that = (TupleILD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleILD that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIDI implements Comparable {\n\t\t\tint a; double b; int c;\n\t\t\tTupleIDI() { }\n\t\t\tTupleIDI(int a, double b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIDI that = (TupleIDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIDI that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIDL implements Comparable {\n\t\t\tint a; double b; long c;\n\t\t\tTupleIDL() { }\n\t\t\tTupleIDL(int a, double b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIDL that = (TupleIDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIDL that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleIDD implements Comparable {\n\t\t\tint a; double b; double c;\n\t\t\tTupleIDD() { }\n\t\t\tTupleIDD(int a, double b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleIDD that = (TupleIDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleIDD that) {\n\t\t\t\tint c = Integer.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLII implements Comparable {\n\t\t\tlong a; int b; int c;\n\t\t\tTupleLII() { }\n\t\t\tTupleLII(long a, int b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLII that = (TupleLII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLII that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLIL implements Comparable {\n\t\t\tlong a; int b; long c;\n\t\t\tTupleLIL() { }\n\t\t\tTupleLIL(long a, int b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLIL that = (TupleLIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLIL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLID implements Comparable {\n\t\t\tlong a; int b; double c;\n\t\t\tTupleLID() { }\n\t\t\tTupleLID(long a, int b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLID that = (TupleLID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLID that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLLI implements Comparable {\n\t\t\tlong a; long b; int c;\n\t\t\tTupleLLI() { }\n\t\t\tTupleLLI(long a, long b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLLI that = (TupleLLI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLLI that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLLL implements Comparable {\n\t\t\tlong a; long b; long c;\n\t\t\tTupleLLL() { }\n\t\t\tTupleLLL(long a, long b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLLL that = (TupleLLL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLLL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLLD implements Comparable {\n\t\t\tlong a; long b; double c;\n\t\t\tTupleLLD() { }\n\t\t\tTupleLLD(long a, long b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLLD that = (TupleLLD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLLD that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLDI implements Comparable {\n\t\t\tlong a; double b; int c;\n\t\t\tTupleLDI() { }\n\t\t\tTupleLDI(long a, double b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLDI that = (TupleLDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLDI that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLDL implements Comparable {\n\t\t\tlong a; double b; long c;\n\t\t\tTupleLDL() { }\n\t\t\tTupleLDL(long a, double b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLDL that = (TupleLDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLDL that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleLDD implements Comparable {\n\t\t\tlong a; double b; double c;\n\t\t\tTupleLDD() { }\n\t\t\tTupleLDD(long a, double b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleLDD that = (TupleLDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleLDD that) {\n\t\t\t\tint c = Long.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDII implements Comparable {\n\t\t\tdouble a; int b; int c;\n\t\t\tTupleDII() { }\n\t\t\tTupleDII(double a, int b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDII that = (TupleDII) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDII that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDIL implements Comparable {\n\t\t\tdouble a; int b; long c;\n\t\t\tTupleDIL() { }\n\t\t\tTupleDIL(double a, int b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDIL that = (TupleDIL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDIL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDID implements Comparable {\n\t\t\tdouble a; int b; double c;\n\t\t\tTupleDID() { }\n\t\t\tTupleDID(double a, int b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDID that = (TupleDID) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDID that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Integer.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDLI implements Comparable {\n\t\t\tdouble a; long b; int c;\n\t\t\tTupleDLI() { }\n\t\t\tTupleDLI(double a, long b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDLI that = (TupleDLI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDLI that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDLL implements Comparable {\n\t\t\tdouble a; long b; long c;\n\t\t\tTupleDLL() { }\n\t\t\tTupleDLL(double a, long b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDLL that = (TupleDLL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDLL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDLD implements Comparable {\n\t\t\tdouble a; long b; double c;\n\t\t\tTupleDLD() { }\n\t\t\tTupleDLD(double a, long b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDLD that = (TupleDLD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDLD that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Long.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDDI implements Comparable {\n\t\t\tdouble a; double b; int c;\n\t\t\tTupleDDI() { }\n\t\t\tTupleDDI(double a, double b, int c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDDI that = (TupleDDI) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDDI that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Integer.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDDL implements Comparable {\n\t\t\tdouble a; double b; long c;\n\t\t\tTupleDDL() { }\n\t\t\tTupleDDL(double a, double b, long c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDDL that = (TupleDDL) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDDL that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Long.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\t\tclass TupleDDD implements Comparable {\n\t\t\tdouble a; double b; double c;\n\t\t\tTupleDDD() { }\n\t\t\tTupleDDD(double a, double b, double c) { this.a = a; this.b = b; this.c = c; }\n\t\t\t@Override public String toString() { return \"(\"+a+\", \"+b+\", \"+c+\")\"; }\n\t\t\t@Override public int hashCode() { return Objects.hash(a, b, c); }\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif(this == obj) return true;\n\t\t\t\tif(obj == null || this.getClass() != obj.getClass()) return false;\n\t\t\t\tTupleDDD that = (TupleDDD) obj;\n\t\t\t\tif(this.a != that.a || this.b != that.b || this.c != that.c) return false;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic int compareTo(TupleDDD that) {\n\t\t\t\tint c = Double.compare(this.a, that.a);\n\t\t\t\tif(c == 0) c = Double.compare(this.b, that.b);\n\t\t\t\tif(c == 0) c = Double.compare(this.c, that.c);\n\t\t\t\treturn c;\n\t\t\t}\n\t\t}\n\npublic void solve() {\n\tint h = ni();\n\tint w = ni();\n\tGrids g = new Grids(h, w);\n\tchar c[][] = nc(h, w);\n\tboolean b[][] = new boolean[h][w];\n\tint start[][] = new int[h][w];\n\tfill(start, -1);\n\tint numStart = 0;\n\tfor(int i = 0; i < h; i ++) {\n\t\tfor(int j = 0; j < w; j ++) {\n\t\t\tb[i][j] = c[i][j] == '#';\n\t\t\tif(c[i][j] == 'o') start[i][j] = numStart ++;\n\t\t}\n\t}\n\tg.init(b);\n\n\tint numNode = numStart + h * w + 1;\n\tlong d[] = new long[numNode];\n\tfor(int i = 0; i < numStart; i ++) d[i] = 1;\n\td[numNode - 1] = - numStart;\n\tNormalizedMinCostFlow mcf = new NormalizedMinCostFlow(numNode, d);\n\tfor(int i = 0; i < h; i ++) {\n\t\tfor(int j = 0; j < w; j ++) {\n\t\t\tif(start[i][j] >= 0) {\n\t\t\t\tlong dist[] = bfs(g, g.get(i, j), h, w);\n\t\t\t\tfor(int i2 = 0; i2 < h; i2 ++) {\n\t\t\t\t\tfor(int j2 = 0; j2 < w; j2 ++) {\n\t\t\t\t\t\tint idx2 = g.get(i2, j2).i;\n\t\t\t\t\t\tif(isINF(dist[idx2])) continue;\n\t\t\t\t\t\tmcf.addEdge(start[i][j], idx2 + numStart, 1, - dist[idx2]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tmcf.addEdge(g.get(i, j).i + numStart, numNode - 1, 1, 0);\n\t\t}\n\t}\n\tPairLL p = mcf.minCostFlow();\n\tprtln(- p.b);\n}\n\nlong[] bfs(Grids g, Grid start, int h, int w) {\n\tlong dist[] = new long[h * w];\n\tfill(dist, INF);\n\t\n\tDeque s = new ArrayDeque<>();\n\ts.addLast(start);\n\tdist[start.i] = 0;\n\twhile(!s.isEmpty()) {\n\t\tGrid crt = s.removeFirst();\n\t\tfor(int add = 2; add <= 4; add += 2) {\n\t\t\tGrid next = g.next(crt, add);\n\t\t\tif(next == null || next.b) continue;\n\t\t\tif(isINF(dist[next.i])) {\n\t\t\t\tdist[next.i] = dist[crt.i] + 1;\n\t\t\t\ts.addLast(next);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn dist;\n}\n\n// WeightedCapEdge(source, target, cap, cost)\n// PairLL(flow, cost)\nclass NormalizedMinCostFlow extends MinCostFlow { // V=numNode, E=numEdge, F=in\n\tlong in;\n\tlong sum;\n\tint s;\n\tint t;\n\tlong d[];\n\tint idx[];\n\tint tsIdx;\n\tNormalizedMinCostFlow(int numNode, long[] d) { // O(V)\n\t\tsuper(numNode + 2);\n\t\tthis.d = d;\n\t\tin = 0;\n\t\tsum = 0;\n\t\ts = numNode;\n\t\tt = numNode + 1;\n\t\tidx = new int[numNode];\n\n\t\tfor(int i = 0; i < numNode; i++) {\n\t\t\tif(d[i] >= 0) {\n\t\t\t\tidx[i] = super.addEdge(s, i, d[i], 0);\n\t\t\t\tsuper.addEdge(i, t, 0, 0);\n\t\t\t\tin += d[i];\n\t\t\t}else {\n\t\t\t\tsuper.addEdge(s, i, 0, 0);\n\t\t\t\tidx[i] = super.addEdge(i, t, - d[i], 0);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid addDemand(int i, long addD) { if(i >= d.length) return; changeDemand(i, d[i] + addD); } // O(1)\n\tvoid changeDemand(int i, long newD) { // O(1)\n\t\tif(i >= d.length) return;\n\t\tif(d[i] > 0) in -= d[i];\n\t\tedgesList.get(idx[i]).cap = 0;\n\t\td[i] = newD;\n\t\tif(d[i] >= 0) idx[i] &= ~1; else idx[i] |= 1;\n\t\tif(d[i] > 0) in += d[i];\n\t\tedgesList.get(idx[i]).cap = abs(d[i]);\n\t}\n\n\tint addEdge(int source, int target, long cap, long cost) { return addEdge(source, target, 0, cap, cost); } // O(1)\n\tint addEdge(int source, int target, long minCap, long maxCap, long cost) { // O(1)\n\t\tif(cost < 0) {\n\t\t\tsum += cost * maxCap;\n\t\t\taddDemand(source, - maxCap);\n\t\t\taddDemand(target, maxCap);\n\t\t\treturn super.addEdge(target, source, maxCap - minCap, - cost);\n\t\t}else {\n\t\t\tsum += cost * minCap;\n\t\t\taddDemand(source, - minCap);\n\t\t\taddDemand(target, minCap);\n\t\t\treturn super.addEdge(source, target, maxCap - minCap, cost);\n\t\t}\n\t}\n\n\t// O(F(V+E)logV)\n\tPairLL minCostFlow() {\n\t\tPairLL ans = minCostFlow(s, t, in);\n\t\tans.b += sum;\n\t\treturn ans;\n\t}\n}\n\n// WeightedCapEdge(source, target, cap, cost)\n// PairLL(flow, cost)\nclass MinCostFlow { // V=numNode, E=numEdge\n\tclass WeightedCapEdge {\n\t\tint source;\n\t\tint target;\n\t\tlong cap;\n\t\tlong cost;\n\t\tint rev;\n\t\tWeightedCapEdge(int source, int target, long cap, long cost, int rev) {\n\t\t\tthis.source = source;\n\t\t\tthis.target = target;\n\t\t\tthis.cap = cap;\n\t\t\tthis.cost = cost;\n\t\t\tthis.rev = rev;\n\t\t}\n\n\t\tlong getFlow() { return edges[target][rev].cap; }\n\n\t\t@Override\n\t\tpublic String toString() { return source+\" - (\"+cap+\", \"+cost+\") -> \"+target; }\n\t\t@Override\n\t\tpublic int hashCode() { return Objects.hash(source, target); }\n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif(this == obj) return true;\n\t\t\tif(obj == null) return false;\n\t\t\tif(this.getClass() != obj.getClass()) return false;\n\t\t\tEdge that = (Edge) obj;\n\t\t\tif(this.source != that.source) return false;\n\t\t\tif(this.target != that.target) return false;\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tint numNode;\n\tint numEdge;\n\tList edgesList;\n\tint len[];\n\tWeightedCapEdge edges[][];\n\tlong potential[];\n\n\tMinCostFlow(int numNode) { // O(V)\n\t\tthis.numNode = numNode;\n\t\tedgesList = new ArrayList<>();\n\t\tlen = new int[numNode];\n\t\tedges = new WeightedCapEdge[numNode][];\n\t\tpotential = new long[numNode];\n\t\tfill(potential, 0);\n\t}\n\n\tint addEdge(int source, int target, long cap, long cost) { // O(1)\n\t\tWeightedCapEdge e = new WeightedCapEdge(source, target, cap, cost, len[target]);\n\t\tlen[source] ++;\n\t\tlen[target] ++;\n\t\tedgesList.add(e);\n\t\treturn numEdge ++;\n\t}\n\n\tvoid init() { // O(E)\n\t\tfor(int i = 0; i < numNode; i ++) edges[i] = new WeightedCapEdge[len[i]];\n\t\tint idx[] = new int[numNode];\n\t\tfor(WeightedCapEdge e : edgesList) {\n\t\t\tedges[e.target][idx[e.target] ++] = new WeightedCapEdge(e.target, e.source, 0, - e.cost, idx[e.source]);\n\t\t\tedges[e.source][idx[e.source] ++] = e;\n\t\t}\n\t}\n\tvoid clearFlow() { // O(V+E)\n\t\tfill(potential, 0);\n\t\tfor(WeightedCapEdge e : edgesList) {\n\t\t\tlong flow = e.getFlow();\n\t\t\te.cap += flow;\n\t\t\tedges[e.target][e.rev].cap -= flow;\n\t\t}\n\t}\n\n\t// O(f(V+E)logV)\n\tPairLL minCostMaxFlow(int s, int t) { return minCostFlow(s, t, INF); }\n\tPairLL minCostFlow(int s, int t, long flowLimit) {\n\t\tPairLL[] slope = minCostSlope(s, t, flowLimit);\n\t\treturn slope[slope.length - 1];\n\t}\n\tPairLL[] minCostSlope(int s, int t) { return minCostSlope(s, t, INF); }\n\tPairLL[] minCostSlope(int s, int t, long flowLimit) {\n\t\tif(s == t) return null;\n\t\tinit();\n\t\tList slopeList = new ArrayList<>();\n\t\tlong prvCost = -1;\n\t\tlong flow = 0;\n\t\tlong cost = 0;\n\t\twhile(true) {\n\t\t\tslopeList.add(new PairLL(flow, cost));\n\t\t\tPairLL add = dijkstra(s, t, flowLimit - flow);\n\t\t\tif(add.a == 0) break;\n\t\t\tflow += add.a;\n\t\t\tcost += add.a * add.b;\n\t\t\tif(add.b == prvCost) slopeList.remove(slopeList.size() - 1);\n\t\t\tprvCost = add.b;\n\t\t}\n\t\tPairLL slope[] = new PairLL[slopeList.size()];\n\t\tfor(int i = 0; i < slopeList.size(); i ++) slope[i] = slopeList.get(i);\n\t\treturn slope;\n\t}\n\tPairLL dijkstra(int s, int t, long maxFlow) { // O((V+E)logV)\n\t\tlong dist[] = new long[numNode];\n\t\tfill(dist, INF);\n\t\tdist[s] = 0;\n\t\tWeightedCapEdge prv[] = new WeightedCapEdge[numNode];\n\n\t\tQueue pq = new PriorityQueue<>();\n\t\tpq.add(new Edge(s, s, dist[s]));\n\t\twhile(!pq.isEmpty()) {\n\t\t\tEdge crt = pq.poll();\n\t\t\tif(dist[crt.target] < crt.cost) continue;\n\t\t\tfor(WeightedCapEdge e : edges[crt.target]) {\n\t\t\t\tif(e.cap <= 0) continue;\n\t\t\t\tlong cost = dist[e.source] + e.cost + potential[e.source] - potential[e.target];\n\t\t\t\tif(dist[e.target] > cost) {\n\t\t\t\t\tdist[e.target] = cost;\n\t\t\t\t\tprv[e.target] = e;\n\t\t\t\t\tpq.add(new Edge(e.source, e.target, dist[e.target]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(dist[t] == INF) return new PairLL(0, INF);\n\t\tfor(int i = 0; i < numNode; i ++) potential[i] += dist[i];\n\t\tPairLL add = new PairLL(maxFlow, 0);\n\t\tfor(int v = t; v != s; ) {\n\t\t\tWeightedCapEdge e = prv[v];\n\t\t\tadd.b += e.cost;\n\t\t\tadd.a = min(add.a, e.cap);\n\t\t\tv = e.source;\n\t\t}\n\t\tfor(int v = t; v != s;) {\n\t\t\tWeightedCapEdge e = prv[v];\n\t\t\te.cap -= add.a;\n\t\t\tedges[v][e.rev].cap += add.a;\n\t\t\tv = e.source;\n\t\t}\n\t\treturn add;\n\t}\n}\n\n\t}\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a board with N rows and M columns.\nThe information of this board is represented by N strings S_1,S_2,\\ldots,S_N.\nSpecifically, the state of the square at the i-th row from the top and the j-th column from the left is represented as follows:\n\nS_{i,j}=. : the square is empty.\n\nS_{i,j}=# : an obstacle is placed on the square.\n\nS_{i,j}=o : a piece is placed on the square.\n\nYosupo repeats the following operation:\n\nChoose a piece and move it to its right adjecent square or its down adjacent square.\nMoving a piece to squares with another piece or an obstacle is prohibited.\nMoving a piece out of the board is also prohibited.\n\nYosupo wants to perform the operation as many times as possible.\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq M \\leq 50\n\nS_i is a string of length M consisting of ., # and o.\n\n1 \\leq ( the number of pieces )\\leq 100.\nIn other words, the number of pairs (i, j) that satisfy S_{i,j}=o is between 1 and 100, both inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1\nS_2\n\\vdots\nS_N\n\nOutput\n\nPrint the maximum possible number of operations in a line.\n\nSample Input 1\n\n3 3\no..\n...\no.#\n\nSample Output 1\n\n4\n\nYosupo can perform operations 4 times as follows:\n\no.. .o. ..o ... ...\n... -> ... -> ... -> ..o -> ..o\no.# o.# o.# o.# .o#\n\nSample Input 2\n\n9 10\n.#....o#..\n.#..#..##o\n.....#o.##\n.###.#o..o\n#.#...##.#\n..#..#.###\n#o.....#..\n....###..o\no.......o#\n\nSample Output 2\n\n24", "sample_input": "3 3\no..\n...\no.#\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02542", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a board with N rows and M columns.\nThe information of this board is represented by N strings S_1,S_2,\\ldots,S_N.\nSpecifically, the state of the square at the i-th row from the top and the j-th column from the left is represented as follows:\n\nS_{i,j}=. : the square is empty.\n\nS_{i,j}=# : an obstacle is placed on the square.\n\nS_{i,j}=o : a piece is placed on the square.\n\nYosupo repeats the following operation:\n\nChoose a piece and move it to its right adjecent square or its down adjacent square.\nMoving a piece to squares with another piece or an obstacle is prohibited.\nMoving a piece out of the board is also prohibited.\n\nYosupo wants to perform the operation as many times as possible.\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq M \\leq 50\n\nS_i is a string of length M consisting of ., # and o.\n\n1 \\leq ( the number of pieces )\\leq 100.\nIn other words, the number of pairs (i, j) that satisfy S_{i,j}=o is between 1 and 100, both inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1\nS_2\n\\vdots\nS_N\n\nOutput\n\nPrint the maximum possible number of operations in a line.\n\nSample Input 1\n\n3 3\no..\n...\no.#\n\nSample Output 1\n\n4\n\nYosupo can perform operations 4 times as follows:\n\no.. .o. ..o ... ...\n... -> ... -> ... -> ..o -> ..o\no.# o.# o.# o.# .o#\n\nSample Input 2\n\n9 10\n.#....o#..\n.#..#..##o\n.....#o.##\n.###.#o..o\n#.#...##.#\n..#..#.###\n#o.....#..\n....###..o\no.......o#\n\nSample Output 2\n\n24", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 101085, "cpu_time_ms": 2208, "memory_kb": 69828}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s853026133", "group_id": "codeNet:p02546", "input_text": "import java.util.*;\n\n/**\n * A Main\n *\n * @date 2020.09.19\n * @author 焼き鮭 \n */\n\npublic class Main {\n Scanner sc;\n\n public static void main(String[] args) {\n new Main().execute();\n }\n\n public void execute() {\n this.sc = new Scanner(System.in);\n String _s = sc.next();\n String[] s = _s.split(\"\");\n System.out.println(_s + (s[s.length - 1].equals(\"s\") ? \"es\" : \"s\"));\n }\n}\n", "language": "Java", "metadata": {"date": 1600542129, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02546.html", "problem_id": "p02546", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02546/input.txt", "sample_output_relpath": "derived/input_output/data/p02546/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02546/Java/s853026133.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s853026133", "user_id": "u109534827"}, "prompt_components": {"gold_output": "apples\n", "input_to_evaluate": "import java.util.*;\n\n/**\n * A Main\n *\n * @date 2020.09.19\n * @author 焼き鮭 \n */\n\npublic class Main {\n Scanner sc;\n\n public static void main(String[] args) {\n new Main().execute();\n }\n\n public void execute() {\n this.sc = new Scanner(System.in);\n String _s = sc.next();\n String[] s = _s.split(\"\");\n System.out.println(_s + (s[s.length - 1].equals(\"s\") ? \"es\" : \"s\"));\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters.\n\nIn Taknese, the plural form of a noun is spelled based on the following rules:\n\nIf a noun's singular form does not end with s, append s to the end of the singular form.\n\nIf a noun's singular form ends with s, append es to the end of the singular form.\n\nYou are given the singular form S of a Taknese noun. Output its plural form.\n\nConstraints\n\nS is a string of length 1 between 1000, inclusive.\n\nS contains only lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the plural form of the given Taknese word.\n\nSample Input 1\n\napple\n\nSample Output 1\n\napples\n\napple ends with e, so its plural form is apples.\n\nSample Input 2\n\nbus\n\nSample Output 2\n\nbuses\n\nbus ends with s, so its plural form is buses.\n\nSample Input 3\n\nbox\n\nSample Output 3\n\nboxs", "sample_input": "apple\n"}, "reference_outputs": ["apples\n"], "source_document_id": "p02546", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters.\n\nIn Taknese, the plural form of a noun is spelled based on the following rules:\n\nIf a noun's singular form does not end with s, append s to the end of the singular form.\n\nIf a noun's singular form ends with s, append es to the end of the singular form.\n\nYou are given the singular form S of a Taknese noun. Output its plural form.\n\nConstraints\n\nS is a string of length 1 between 1000, inclusive.\n\nS contains only lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the plural form of the given Taknese word.\n\nSample Input 1\n\napple\n\nSample Output 1\n\napples\n\napple ends with e, so its plural form is apples.\n\nSample Input 2\n\nbus\n\nSample Output 2\n\nbuses\n\nbus ends with s, so its plural form is buses.\n\nSample Input 3\n\nbox\n\nSample Output 3\n\nboxs", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 417, "cpu_time_ms": 115, "memory_kb": 27144}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s849308705", "group_id": "codeNet:p02551", "input_text": "//package atcoder.beginner179;\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n static InputReader in;\n static PrintWriter out;\n\n public static void main(String[] args) {\n //initReaderPrinter(true);\n initReaderPrinter(false);\n //solve(in.nextInt());\n solve(1);\n }\n\n static void solve(int testCnt) {\n for (int testNumber = 0; testNumber < testCnt; testNumber++) {\n int n = in.nextInt();\n int q = in.nextInt();\n long total = ((long)(n - 2)) * (n - 2);\n TreeSet ts1 = new TreeSet<>(Comparator.comparingInt(a->a[1])), ts2 = new TreeSet<>(Comparator.comparingInt(a->a[1]));\n ts1.add(new int[]{2, n-1, n});\n ts2.add(new int[]{2, n-1, n});\n int min1 = n, min2 = n;\n\n for(int i = 0;i < q; i++) {\n int t = in.nextInt();\n int x = in.nextInt();\n\n if(t == 1) {\n int[] curr = ts1.ceiling(new int[]{x,x,0});\n total -= (curr[2] - 1 - 1);\n if(x < min1) {\n //update for type2 operation\n int[] head = ts2.pollFirst();\n if(2 <= min2 - 1) {\n ts2.add(new int[]{2, min2 - 1, x});\n }\n if(min2 + 1 <= head[1]) {\n ts2.add(new int[]{min2 + 1, head[1], head[2]});\n }\n min1 = x;\n }\n }\n else {\n int[] curr = ts2.ceiling(new int[]{x,x,0});\n total -= (curr[2] - 1 - 1);\n if(x < min2) {\n //update for type1 operation\n int[] head = ts1.pollFirst();\n if(2 <= min1 - 1) {\n ts1.add(new int[]{2, min1 - 1, x});\n }\n if(min1 + 1 <= head[1]) {\n ts1.add(new int[]{min1 + 1, head[1], head[2]});\n }\n min2 = x;\n }\n }\n }\n out.println(total);\n }\n out.close();\n }\n\n static void initReaderPrinter(boolean test) {\n if (test) {\n try {\n in = new InputReader(new FileInputStream(\"src/input.in\"));\n out = new PrintWriter(new FileOutputStream(\"src/output.out\"));\n } catch (IOException e) {\n e.printStackTrace();\n }\n } else {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out);\n }\n }\n\n static class InputReader {\n BufferedReader br;\n StringTokenizer st;\n\n InputReader(InputStream stream) {\n try {\n br = new BufferedReader(new InputStreamReader(stream), 32768);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n Integer[] nextIntArray(int n) {\n Integer[] a = new Integer[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n Long[] nextLongArray(int n) {\n Long[] a = new Long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n }\n}\n\n\n", "language": "Java", "metadata": {"date": 1600731384, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02551.html", "problem_id": "p02551", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02551/input.txt", "sample_output_relpath": "derived/input_output/data/p02551/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02551/Java/s849308705.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s849308705", "user_id": "u173265889"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "//package atcoder.beginner179;\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n static InputReader in;\n static PrintWriter out;\n\n public static void main(String[] args) {\n //initReaderPrinter(true);\n initReaderPrinter(false);\n //solve(in.nextInt());\n solve(1);\n }\n\n static void solve(int testCnt) {\n for (int testNumber = 0; testNumber < testCnt; testNumber++) {\n int n = in.nextInt();\n int q = in.nextInt();\n long total = ((long)(n - 2)) * (n - 2);\n TreeSet ts1 = new TreeSet<>(Comparator.comparingInt(a->a[1])), ts2 = new TreeSet<>(Comparator.comparingInt(a->a[1]));\n ts1.add(new int[]{2, n-1, n});\n ts2.add(new int[]{2, n-1, n});\n int min1 = n, min2 = n;\n\n for(int i = 0;i < q; i++) {\n int t = in.nextInt();\n int x = in.nextInt();\n\n if(t == 1) {\n int[] curr = ts1.ceiling(new int[]{x,x,0});\n total -= (curr[2] - 1 - 1);\n if(x < min1) {\n //update for type2 operation\n int[] head = ts2.pollFirst();\n if(2 <= min2 - 1) {\n ts2.add(new int[]{2, min2 - 1, x});\n }\n if(min2 + 1 <= head[1]) {\n ts2.add(new int[]{min2 + 1, head[1], head[2]});\n }\n min1 = x;\n }\n }\n else {\n int[] curr = ts2.ceiling(new int[]{x,x,0});\n total -= (curr[2] - 1 - 1);\n if(x < min2) {\n //update for type1 operation\n int[] head = ts1.pollFirst();\n if(2 <= min1 - 1) {\n ts1.add(new int[]{2, min1 - 1, x});\n }\n if(min1 + 1 <= head[1]) {\n ts1.add(new int[]{min1 + 1, head[1], head[2]});\n }\n min2 = x;\n }\n }\n }\n out.println(total);\n }\n out.close();\n }\n\n static void initReaderPrinter(boolean test) {\n if (test) {\n try {\n in = new InputReader(new FileInputStream(\"src/input.in\"));\n out = new PrintWriter(new FileOutputStream(\"src/output.out\"));\n } catch (IOException e) {\n e.printStackTrace();\n }\n } else {\n in = new InputReader(System.in);\n out = new PrintWriter(System.out);\n }\n }\n\n static class InputReader {\n BufferedReader br;\n StringTokenizer st;\n\n InputReader(InputStream stream) {\n try {\n br = new BufferedReader(new InputStreamReader(stream), 32768);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n Integer[] nextIntArray(int n) {\n Integer[] a = new Integer[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n Long[] nextLongArray(int n) {\n Long[] a = new Long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n }\n}\n\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a grid with N rows and N columns of squares. Let (i, j) be the square at the i-th row from the top and the j-th column from the left.\n\nEach of the central (N-2) \\times (N-2) squares in the grid has a black stone on it.\nEach of the 2N - 1 squares on the bottom side and the right side has a white stone on it.\n\nQ queries are given. We ask you to process them in order.\nThere are two kinds of queries. Their input format and description are as follows:\n\n1 x: Place a white stone on (1, x). After that, for each black stone between (1, x) and the first white stone you hit if you go down from (1, x), replace it with a white stone.\n\n2 x: Place a white stone on (x, 1). After that, for each black stone between (x, 1) and the first white stone you hit if you go right from (x, 1), replace it with a white stone.\n\nHow many black stones are there on the grid after processing all Q queries?\n\nConstraints\n\n3 \\leq N \\leq 2\\times 10^5\n\n0 \\leq Q \\leq \\min(2N-4,2\\times 10^5)\n\n2 \\leq x \\leq N-1\n\nQueries are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nQuery_1\n\\vdots\nQuery_Q\n\nOutput\n\nPrint how many black stones there are on the grid after processing all Q queries.\n\nSample Input 1\n\n5 5\n1 3\n2 3\n1 4\n2 2\n1 2\n\nSample Output 1\n\n1\n\nAfter each query, the grid changes in the following way:\n\nSample Input 2\n\n200000 0\n\nSample Output 2\n\n39999200004\n\nSample Input 3\n\n176527 15\n1 81279\n2 22308\n2 133061\n1 80744\n2 44603\n1 170938\n2 139754\n2 15220\n1 172794\n1 159290\n2 156968\n1 56426\n2 77429\n1 97459\n2 71282\n\nSample Output 3\n\n31159505795", "sample_input": "5 5\n1 3\n2 3\n1 4\n2 2\n1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02551", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a grid with N rows and N columns of squares. Let (i, j) be the square at the i-th row from the top and the j-th column from the left.\n\nEach of the central (N-2) \\times (N-2) squares in the grid has a black stone on it.\nEach of the 2N - 1 squares on the bottom side and the right side has a white stone on it.\n\nQ queries are given. We ask you to process them in order.\nThere are two kinds of queries. Their input format and description are as follows:\n\n1 x: Place a white stone on (1, x). After that, for each black stone between (1, x) and the first white stone you hit if you go down from (1, x), replace it with a white stone.\n\n2 x: Place a white stone on (x, 1). After that, for each black stone between (x, 1) and the first white stone you hit if you go right from (x, 1), replace it with a white stone.\n\nHow many black stones are there on the grid after processing all Q queries?\n\nConstraints\n\n3 \\leq N \\leq 2\\times 10^5\n\n0 \\leq Q \\leq \\min(2N-4,2\\times 10^5)\n\n2 \\leq x \\leq N-1\n\nQueries are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nQuery_1\n\\vdots\nQuery_Q\n\nOutput\n\nPrint how many black stones there are on the grid after processing all Q queries.\n\nSample Input 1\n\n5 5\n1 3\n2 3\n1 4\n2 2\n1 2\n\nSample Output 1\n\n1\n\nAfter each query, the grid changes in the following way:\n\nSample Input 2\n\n200000 0\n\nSample Output 2\n\n39999200004\n\nSample Input 3\n\n176527 15\n1 81279\n2 22308\n2 133061\n1 80744\n2 44603\n1 170938\n2 139754\n2 15220\n1 172794\n1 159290\n2 156968\n1 56426\n2 77429\n1 97459\n2 71282\n\nSample Output 3\n\n31159505795", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4287, "cpu_time_ms": 467, "memory_kb": 56480}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s741866999", "group_id": "codeNet:p02552", "input_text": "public class Main{\n\n\tpublic static void main(String[] args){\n\n\n\t\tlong a = Long.getLong(args[0]);\n\t\tlong b = Long.getLong(args[1]);\n\t\tlong c = Long.getLong(args[2]);\n\t\tlong d = Long.getLong(args[3]);\n\n\t\tlong answer=0;\n\n\t\tif(Math.multiplyExact(a, c) > answer) {\n\t\t\tanswer = Math.multiplyExact(a, c);\n\t\t}\n\t\tif(Math.multiplyExact(a, d) > answer) {\n\t\t\tanswer = Math.multiplyExact(a, d);\n\t\t}\n\n\t\tif(Math.multiplyExact(b, c) > answer) {\n\t\t\tanswer = Math.multiplyExact(a, c);\n\t\t}\n\t\tif(Math.multiplyExact(b, d) > answer) {\n\t\t\tanswer = Math.multiplyExact(a, d);\n\t\t}\n\t\tSystem.out.print(answer);\n\t}\n\n}", "language": "Java", "metadata": {"date": 1600029362, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02552.html", "problem_id": "p02552", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02552/input.txt", "sample_output_relpath": "derived/input_output/data/p02552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02552/Java/s741866999.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s741866999", "user_id": "u814216470"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "public class Main{\n\n\tpublic static void main(String[] args){\n\n\n\t\tlong a = Long.getLong(args[0]);\n\t\tlong b = Long.getLong(args[1]);\n\t\tlong c = Long.getLong(args[2]);\n\t\tlong d = Long.getLong(args[3]);\n\n\t\tlong answer=0;\n\n\t\tif(Math.multiplyExact(a, c) > answer) {\n\t\t\tanswer = Math.multiplyExact(a, c);\n\t\t}\n\t\tif(Math.multiplyExact(a, d) > answer) {\n\t\t\tanswer = Math.multiplyExact(a, d);\n\t\t}\n\n\t\tif(Math.multiplyExact(b, c) > answer) {\n\t\t\tanswer = Math.multiplyExact(a, c);\n\t\t}\n\t\tif(Math.multiplyExact(b, d) > answer) {\n\t\t\tanswer = Math.multiplyExact(a, d);\n\t\t}\n\t\tSystem.out.print(answer);\n\t}\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "sample_input": "1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02552", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 588, "cpu_time_ms": 82, "memory_kb": 32456}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s294378309", "group_id": "codeNet:p02552", "input_text": "import java.io.*;\nimport java.util.*;\n\n/**\n * Created by Ayushi on 13 Sep 2020.\n * Problem:\n * Round:\n */\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n StringTokenizer st;\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int t = Integer.parseInt(br.readLine());\n\n if (t == 0) System.out.println(1);\n else System.out.println(0);\n br.close();\n }\n}\n", "language": "Java", "metadata": {"date": 1600023662, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02552.html", "problem_id": "p02552", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02552/input.txt", "sample_output_relpath": "derived/input_output/data/p02552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02552/Java/s294378309.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s294378309", "user_id": "u121485613"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\n/**\n * Created by Ayushi on 13 Sep 2020.\n * Problem:\n * Round:\n */\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n StringTokenizer st;\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int t = Integer.parseInt(br.readLine());\n\n if (t == 0) System.out.println(1);\n else System.out.println(0);\n br.close();\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "sample_input": "1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02552", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 458, "cpu_time_ms": 81, "memory_kb": 32596}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s418126632", "group_id": "codeNet:p02553", "input_text": "import java.util.Scanner;\n\npublic class Main {\n \n public static void main(String[] args) {\n int num[] = new int[4]; \n Scanner scanner = new Scanner(System.in);\n for (int i = 0; i < 4; i++){\n num[i] = Integer.parseInt(scanner.next());\n }\n scanner.close();\n long max = -1000000000;\n long tmp = 0;\n\n for (int j = 0; j < 2; j++){\n for (int k = 2; k < 4; k++){\n tmp = (long)num[j] * (long)num[k];\n if (max < tmp){\n max = tmp;\n }\n }\n }\n System.out.println(max);\n }\n}", "language": "Java", "metadata": {"date": 1600024929, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02553.html", "problem_id": "p02553", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02553/input.txt", "sample_output_relpath": "derived/input_output/data/p02553/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02553/Java/s418126632.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s418126632", "user_id": "u524253154"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n \n public static void main(String[] args) {\n int num[] = new int[4]; \n Scanner scanner = new Scanner(System.in);\n for (int i = 0; i < 4; i++){\n num[i] = Integer.parseInt(scanner.next());\n }\n scanner.close();\n long max = -1000000000;\n long tmp = 0;\n\n for (int j = 0; j < 2; j++){\n for (int k = 2; k < 4; k++){\n tmp = (long)num[j] * (long)num[k];\n if (max < tmp){\n max = tmp;\n }\n }\n }\n System.out.println(max);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "sample_input": "1 2 1 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02553", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 540, "cpu_time_ms": 125, "memory_kb": 26948}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s416597752", "group_id": "codeNet:p02553", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong a = sc.nextLong();\n\t\tlong b = sc.nextLong();\n\t\tlong c = sc.nextLong();\n\t\tlong d = sc.nextLong();\n//\t\tString[] array = new String[n];\n//\t\tfor(int i=0;i 0)\n {\n solveOne(in, out);\n }\n }\n\n private void solveOne(Scanner in, PrintWriter out)\n {\n long MOD = 1_000_000_000 + 7;\n long N = in.nextInt();\n\n if (N == 1 || N == 2)\n {\n out.println(N == 1 ? 0 : 1);\n return;\n }\n\n long ans = CPUtils.modPower(10L, N, MOD);\n\n ans -= 2L * CPUtils.modPower(9L, N, MOD);\n ans += CPUtils.modPower(8L, N, MOD);\n\n ans %= MOD;\n if (ans < 0)\n ans += MOD;\n\n out.println(ans);\n }\n\n }\n\n static class CPUtils\n {\n public static long modPower(long base, long p, long m)\n {\n long ret = 1;\n for (; p > 0; p >>= 1, base = base * base % m)\n {\n if (p % 2 == 1)\n {\n ret = ret * base % m;\n }\n }\n return ret;\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1600035224, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02554.html", "problem_id": "p02554", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02554/input.txt", "sample_output_relpath": "derived/input_output/data/p02554/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02554/Java/s787483533.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s787483533", "user_id": "u541033696"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main\n{\n public static void main(String[] args)\n {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC\n {\n public void solve(int testNumber, Scanner in, PrintWriter out)\n {\n int T = 1;\n while (T-- > 0)\n {\n solveOne(in, out);\n }\n }\n\n private void solveOne(Scanner in, PrintWriter out)\n {\n long MOD = 1_000_000_000 + 7;\n long N = in.nextInt();\n\n if (N == 1 || N == 2)\n {\n out.println(N == 1 ? 0 : 1);\n return;\n }\n\n long ans = CPUtils.modPower(10L, N, MOD);\n\n ans -= 2L * CPUtils.modPower(9L, N, MOD);\n ans += CPUtils.modPower(8L, N, MOD);\n\n ans %= MOD;\n if (ans < 0)\n ans += MOD;\n\n out.println(ans);\n }\n\n }\n\n static class CPUtils\n {\n public static long modPower(long base, long p, long m)\n {\n long ret = 1;\n for (; p > 0; p >>= 1, base = base * base % m)\n {\n if (p % 2 == 1)\n {\n ret = ret * base % m;\n }\n }\n return ret;\n }\n\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHow many integer sequences A_1,A_2,\\ldots,A_N of length N satisfy all of the following conditions?\n\n0 \\leq A_i \\leq 9\n\nThere exists some i such that A_i=0 holds.\n\nThere exists some i such that A_i=9 holds.\n\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^9 + 7.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n2\n\nTwo sequences \\{0,9\\} and \\{9,0\\} satisfy all conditions.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n869121\n\nSample Output 3\n\n2511445", "sample_input": "2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02554", "source_text": "Score : 300 points\n\nProblem Statement\n\nHow many integer sequences A_1,A_2,\\ldots,A_N of length N satisfy all of the following conditions?\n\n0 \\leq A_i \\leq 9\n\nThere exists some i such that A_i=0 holds.\n\nThere exists some i such that A_i=9 holds.\n\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^9 + 7.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n2\n\nTwo sequences \\{0,9\\} and \\{9,0\\} satisfy all conditions.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n869121\n\nSample Output 3\n\n2511445", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1746, "cpu_time_ms": 104, "memory_kb": 27048}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s289743632", "group_id": "codeNet:p02555", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.math.BigInteger;\nimport java.util.stream.Stream;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Stream lines = new BufferedReader(new InputStreamReader(System.in)).lines()) {\n\t\t\tnew Main().exec(lines.toArray(String[]::new));\n\t\t}\n\t}\n\n\tvoid exec(String[] args) {\n\t\tint S = Integer.parseInt(args[0].split(\" \")[0]);\n\t\tBigInteger n = bi(0);\n\t\tfor (int i = 1; i <= S / 3; i++) {\n\t\t\tn = n.add(c(S, i));\n\t\t}\n\t\tSystem.out.println(n.remainder(bi(10).pow(9).add(bi(7))));\n\t}\n\n\tBigInteger bi(int n) {\n\t\treturn new BigInteger(String.valueOf(n));\n\t}\n\n\tBigInteger c(int s, int n) {\n\t\tint a = Math.min(s - 3 * n, n - 1);\n\t\treturn f(s - 2 * n - 1, a).divide(f(a, a));\n\t}\n\n\tBigInteger f(int a, int b) {\n\t\tBigInteger n = bi(1);\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\tn = n.multiply(bi(a).subtract(bi(i)));\n\t\t}\n\t\treturn n;\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1600368389, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02555.html", "problem_id": "p02555", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02555/input.txt", "sample_output_relpath": "derived/input_output/data/p02555/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02555/Java/s289743632.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s289743632", "user_id": "u118688733"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.math.BigInteger;\nimport java.util.stream.Stream;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Stream lines = new BufferedReader(new InputStreamReader(System.in)).lines()) {\n\t\t\tnew Main().exec(lines.toArray(String[]::new));\n\t\t}\n\t}\n\n\tvoid exec(String[] args) {\n\t\tint S = Integer.parseInt(args[0].split(\" \")[0]);\n\t\tBigInteger n = bi(0);\n\t\tfor (int i = 1; i <= S / 3; i++) {\n\t\t\tn = n.add(c(S, i));\n\t\t}\n\t\tSystem.out.println(n.remainder(bi(10).pow(9).add(bi(7))));\n\t}\n\n\tBigInteger bi(int n) {\n\t\treturn new BigInteger(String.valueOf(n));\n\t}\n\n\tBigInteger c(int s, int n) {\n\t\tint a = Math.min(s - 3 * n, n - 1);\n\t\treturn f(s - 2 * n - 1, a).divide(f(a, a));\n\t}\n\n\tBigInteger f(int a, int b) {\n\t\tBigInteger n = bi(1);\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\tn = n.multiply(bi(a).subtract(bi(i)));\n\t\t}\n\t\treturn n;\n\t}\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind how many sequences there are whose terms are all integers greater than or equal to 3, and whose sum is equal to S.\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq S \\leq 2000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n3\n\n3 sequences satisfy the condition: \\{3,4\\}, \\{4,3\\} and \\{7\\}.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nThere are no sequences that satisfy the condition.\n\nSample Input 3\n\n1729\n\nSample Output 3\n\n294867501", "sample_input": "7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02555", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind how many sequences there are whose terms are all integers greater than or equal to 3, and whose sum is equal to S.\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq S \\leq 2000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n3\n\n3 sequences satisfy the condition: \\{3,4\\}, \\{4,3\\} and \\{7\\}.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nThere are no sequences that satisfy the condition.\n\nSample Input 3\n\n1729\n\nSample Output 3\n\n294867501", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 914, "cpu_time_ms": 349, "memory_kb": 56896}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s404027435", "group_id": "codeNet:p02555", "input_text": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class Main {\n public static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter ou = new PrintWriter(System.out);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tsc.close();\n\t\tlong yono = 0;\n\t\tfor(int i = 1 ; i <= n / 3 ; i++){\n\t\t\tyono += c(n - 2 * i - 1 , i - 1);\n\t\t\tyono %= (int)(Math.pow(10 , 9) + 7);\n\t\t}\n\t\tou.println(yono);\n\t\tou.flush();\n\t}\n\tpublic static int c(int a , int b){\n\t\tif(b == 0) return 1;\n\t\telse if(a == b) return 1;\n\t\telse return (c(a - 1 , b - 1) + c(a - 1 , b)) % (int)(Math.pow(10 , 9) + 7);\n\t}\n}", "language": "Java", "metadata": {"date": 1600028082, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02555.html", "problem_id": "p02555", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02555/input.txt", "sample_output_relpath": "derived/input_output/data/p02555/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02555/Java/s404027435.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s404027435", "user_id": "u073879055"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class Main {\n public static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter ou = new PrintWriter(System.out);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tsc.close();\n\t\tlong yono = 0;\n\t\tfor(int i = 1 ; i <= n / 3 ; i++){\n\t\t\tyono += c(n - 2 * i - 1 , i - 1);\n\t\t\tyono %= (int)(Math.pow(10 , 9) + 7);\n\t\t}\n\t\tou.println(yono);\n\t\tou.flush();\n\t}\n\tpublic static int c(int a , int b){\n\t\tif(b == 0) return 1;\n\t\telse if(a == b) return 1;\n\t\telse return (c(a - 1 , b - 1) + c(a - 1 , b)) % (int)(Math.pow(10 , 9) + 7);\n\t}\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind how many sequences there are whose terms are all integers greater than or equal to 3, and whose sum is equal to S.\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq S \\leq 2000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n3\n\n3 sequences satisfy the condition: \\{3,4\\}, \\{4,3\\} and \\{7\\}.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nThere are no sequences that satisfy the condition.\n\nSample Input 3\n\n1729\n\nSample Output 3\n\n294867501", "sample_input": "7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02555", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind how many sequences there are whose terms are all integers greater than or equal to 3, and whose sum is equal to S.\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq S \\leq 2000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n3\n\n3 sequences satisfy the condition: \\{3,4\\}, \\{4,3\\} and \\{7\\}.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nThere are no sequences that satisfy the condition.\n\nSample Input 3\n\n1729\n\nSample Output 3\n\n294867501", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 605, "cpu_time_ms": 2207, "memory_kb": 36772}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s049100347", "group_id": "codeNet:p02556", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.Comparator;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n EDistMax solver = new EDistMax();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class EDistMax {\n public void solve(int testNumber, FastReader s, PrintWriter w) {\n int n = s.nextInt();\n pair[] p = new pair[n];\n for (int i = 0; i < n; i++)\n p[i] = new pair(s.nextInt(), s.nextInt());\n for (int i = 0; i < n; i++) {\n int x = p[i].x, y = p[i].y;\n p[i].x = x - y;\n p[i].y = x + y;\n }\n func.sort(p, Comparator.comparingInt(o -> o.x));\n int mx1 = p[n - 1].x - p[0].x;\n func.sort(p, Comparator.comparingInt(o -> o.y));\n w.println(Math.max(mx1, p[n - 1].y - p[0].y));\n }\n\n class pair {\n int x;\n int y;\n\n pair(int xx, int yy) {\n x = xx;\n y = yy;\n }\n\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n\n if (numChars == -1)\n throw new InputMismatchException();\n\n if (curChar >= numChars) {\n\n curChar = 0;\n\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if (numChars <= 0)\n return -1;\n }\n\n return buf[curChar++];\n }\n\n public int nextInt() {\n\n int c = read();\n\n while (isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n\n if (filter != null)\n return filter.isSpaceChar(c);\n\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class func {\n public static void sort(T[] arr, Comparator comp) {\n int n = arr.length, mid, h, s, l, i, j, k;\n T[] res = arr.clone();\n n--;\n for (s = 1; s <= n; s <<= 1) {\n for (l = 0; l < n; l += (s << 1)) {\n h = Math.min(l + (s << 1) - 1, n);\n mid = Math.min(l + s - 1, n);\n i = l;\n j = mid + 1;\n k = l;\n while (i <= mid && j <= h)\n res[k++] = comp.compare(arr[i], (arr[j])) <= 0 ? arr[i++] : arr[j++];\n while (i <= mid) res[k++] = arr[i++];\n while (j <= h) res[k++] = arr[j++];\n for (k = l; k <= h; k++) arr[k] = res[k];\n }\n }\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1600087180, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02556.html", "problem_id": "p02556", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02556/input.txt", "sample_output_relpath": "derived/input_output/data/p02556/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02556/Java/s049100347.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s049100347", "user_id": "u537747009"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.Comparator;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastReader in = new FastReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n EDistMax solver = new EDistMax();\n solver.solve(1, in, out);\n out.close();\n }\n }\n\n static class EDistMax {\n public void solve(int testNumber, FastReader s, PrintWriter w) {\n int n = s.nextInt();\n pair[] p = new pair[n];\n for (int i = 0; i < n; i++)\n p[i] = new pair(s.nextInt(), s.nextInt());\n for (int i = 0; i < n; i++) {\n int x = p[i].x, y = p[i].y;\n p[i].x = x - y;\n p[i].y = x + y;\n }\n func.sort(p, Comparator.comparingInt(o -> o.x));\n int mx1 = p[n - 1].x - p[0].x;\n func.sort(p, Comparator.comparingInt(o -> o.y));\n w.println(Math.max(mx1, p[n - 1].y - p[0].y));\n }\n\n class pair {\n int x;\n int y;\n\n pair(int xx, int yy) {\n x = xx;\n y = yy;\n }\n\n }\n\n }\n\n static class FastReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private FastReader.SpaceCharFilter filter;\n\n public FastReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n\n if (numChars == -1)\n throw new InputMismatchException();\n\n if (curChar >= numChars) {\n\n curChar = 0;\n\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if (numChars <= 0)\n return -1;\n }\n\n return buf[curChar++];\n }\n\n public int nextInt() {\n\n int c = read();\n\n while (isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n\n if (filter != null)\n return filter.isSpaceChar(c);\n\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class func {\n public static void sort(T[] arr, Comparator comp) {\n int n = arr.length, mid, h, s, l, i, j, k;\n T[] res = arr.clone();\n n--;\n for (s = 1; s <= n; s <<= 1) {\n for (l = 0; l < n; l += (s << 1)) {\n h = Math.min(l + (s << 1) - 1, n);\n mid = Math.min(l + s - 1, n);\n i = l;\n j = mid + 1;\n k = l;\n while (i <= mid && j <= h)\n res[k++] = comp.compare(arr[i], (arr[j])) <= 0 ? arr[i++] : arr[j++];\n while (i <= mid) res[k++] = arr[i++];\n while (j <= h) res[k++] = arr[j++];\n for (k = l; k <= h; k++) arr[k] = res[k];\n }\n }\n }\n\n }\n}\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N points on the 2D plane, i-th of which is located on (x_i, y_i).\nThere can be multiple points that share the same coordinate.\nWhat is the maximum possible Manhattan distance between two distinct points?\n\nHere, the Manhattan distance between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq x_i,y_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 1\n2 4\n3 2\n\nSample Output 1\n\n4\n\nThe Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.\n\nSample Input 2\n\n2\n1 1\n1 1\n\nSample Output 2\n\n0", "sample_input": "3\n1 1\n2 4\n3 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02556", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N points on the 2D plane, i-th of which is located on (x_i, y_i).\nThere can be multiple points that share the same coordinate.\nWhat is the maximum possible Manhattan distance between two distinct points?\n\nHere, the Manhattan distance between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq x_i,y_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 1\n2 4\n3 2\n\nSample Output 1\n\n4\n\nThe Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.\n\nSample Input 2\n\n2\n1 1\n1 1\n\nSample Output 2\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4368, "cpu_time_ms": 1048, "memory_kb": 51148}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s339336805", "group_id": "codeNet:p02556", "input_text": "import java.io.BufferedReader;\nimport java.io.EOFException;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.io.UncheckedIOException;\nimport java.lang.reflect.Array;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.Deque;\nimport java.util.Objects;\nimport java.util.regex.Pattern;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic class Main {\n public void exec() {\n int n = stdin.nextInt();\n long[] x = new long[n];\n long[] y = new long[n];\n for (int i = 0; i < n; i++) {\n x[i] = stdin.nextLong();\n y[i] = stdin.nextLong();\n }\n\n long wMax = IntStream.range(0, n).mapToLong(i -> x[i]-y[i]).max().getAsLong();\n long wMin = IntStream.range(0, n).mapToLong(i -> x[i]-y[i]).min().getAsLong();\n long zMax = IntStream.range(0, n).mapToLong(i -> x[i]+y[i]).max().getAsLong();\n long zMin = IntStream.range(0, n).mapToLong(i -> x[i]+y[i]).min().getAsLong();\n long ans = Math.max(wMax-wMin, zMax-zMin);\n stdout.println(ans);\n }\n\n private static final Stdin stdin = new Stdin();\n private static final Stdout stdout = new Stdout();\n\n public static void main(String[] args) {\n try {\n new Main().exec();\n } finally {\n stdout.flush();\n }\n }\n\n public static class Stdin {\n private BufferedReader stdin;\n private Deque tokens;\n private Pattern delim;\n\n public Stdin() {\n stdin = new BufferedReader(new InputStreamReader(System.in));\n tokens = new ArrayDeque<>();\n delim = Pattern.compile(\" \");\n }\n\n public String nextString() {\n try {\n if (tokens.isEmpty()) {\n String line = stdin.readLine();\n if (line == null) {\n throw new UncheckedIOException(new EOFException());\n }\n delim.splitAsStream(line).forEach(tokens::addLast);\n }\n return tokens.pollFirst();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n public double nextDouble() {\n return Double.parseDouble(nextString());\n }\n\n public long nextLong() {\n return Long.parseLong(nextString());\n }\n\n public String[] nextStringArray(int n) {\n String[] a = new String[n];\n for (int i = 0; i < n; i++) a[i] = nextString();\n return a;\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = nextInt();\n return a;\n }\n\n public double[] nextDoubleArray(int n) {\n double[] a = new double[n];\n for (int i = 0; i < n; i++) a[i] = nextDouble();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) a[i] = nextLong();\n return a;\n }\n }\n\n public static class Stdout {\n private PrintWriter stdout;\n\n public Stdout() {\n stdout = new PrintWriter(System.out, false);\n }\n\n public void printf(String format, Object ... args) {\n String line = String.format(format, args);\n if (line.endsWith(System.lineSeparator())) {\n stdout.print(line);\n } else {\n stdout.println(line);\n }\n }\n\n public void println(Object ... objs) {\n String line = Arrays.stream(objs).map(Objects::toString).collect(Collectors.joining(\" \"));\n stdout.println(line);\n }\n\n public void printDebug(Object ... objs) {\n String line = Arrays.stream(objs).map(this::deepToString).collect(Collectors.joining(\" \"));\n stdout.printf(\"DEBUG: %s%n\", line);\n stdout.flush();\n }\n\n private String deepToString(Object o) {\n if (o == null) {\n return \"null\";\n }\n\n // 配列の場合\n if (o.getClass().isArray()) {\n int len = Array.getLength(o);\n String[] tokens = new String[len];\n for (int i = 0; i < len; i++) {\n tokens[i] = deepToString(Array.get(o, i));\n }\n return \"{\" + String.join(\",\", tokens) + \"}\";\n }\n\n return Objects.toString(o);\n }\n\n private void flush() {\n stdout.flush();\n }\n }\n}", "language": "Java", "metadata": {"date": 1600079979, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02556.html", "problem_id": "p02556", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02556/input.txt", "sample_output_relpath": "derived/input_output/data/p02556/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02556/Java/s339336805.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s339336805", "user_id": "u794250528"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.EOFException;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.io.UncheckedIOException;\nimport java.lang.reflect.Array;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.Deque;\nimport java.util.Objects;\nimport java.util.regex.Pattern;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic class Main {\n public void exec() {\n int n = stdin.nextInt();\n long[] x = new long[n];\n long[] y = new long[n];\n for (int i = 0; i < n; i++) {\n x[i] = stdin.nextLong();\n y[i] = stdin.nextLong();\n }\n\n long wMax = IntStream.range(0, n).mapToLong(i -> x[i]-y[i]).max().getAsLong();\n long wMin = IntStream.range(0, n).mapToLong(i -> x[i]-y[i]).min().getAsLong();\n long zMax = IntStream.range(0, n).mapToLong(i -> x[i]+y[i]).max().getAsLong();\n long zMin = IntStream.range(0, n).mapToLong(i -> x[i]+y[i]).min().getAsLong();\n long ans = Math.max(wMax-wMin, zMax-zMin);\n stdout.println(ans);\n }\n\n private static final Stdin stdin = new Stdin();\n private static final Stdout stdout = new Stdout();\n\n public static void main(String[] args) {\n try {\n new Main().exec();\n } finally {\n stdout.flush();\n }\n }\n\n public static class Stdin {\n private BufferedReader stdin;\n private Deque tokens;\n private Pattern delim;\n\n public Stdin() {\n stdin = new BufferedReader(new InputStreamReader(System.in));\n tokens = new ArrayDeque<>();\n delim = Pattern.compile(\" \");\n }\n\n public String nextString() {\n try {\n if (tokens.isEmpty()) {\n String line = stdin.readLine();\n if (line == null) {\n throw new UncheckedIOException(new EOFException());\n }\n delim.splitAsStream(line).forEach(tokens::addLast);\n }\n return tokens.pollFirst();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n public double nextDouble() {\n return Double.parseDouble(nextString());\n }\n\n public long nextLong() {\n return Long.parseLong(nextString());\n }\n\n public String[] nextStringArray(int n) {\n String[] a = new String[n];\n for (int i = 0; i < n; i++) a[i] = nextString();\n return a;\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) a[i] = nextInt();\n return a;\n }\n\n public double[] nextDoubleArray(int n) {\n double[] a = new double[n];\n for (int i = 0; i < n; i++) a[i] = nextDouble();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) a[i] = nextLong();\n return a;\n }\n }\n\n public static class Stdout {\n private PrintWriter stdout;\n\n public Stdout() {\n stdout = new PrintWriter(System.out, false);\n }\n\n public void printf(String format, Object ... args) {\n String line = String.format(format, args);\n if (line.endsWith(System.lineSeparator())) {\n stdout.print(line);\n } else {\n stdout.println(line);\n }\n }\n\n public void println(Object ... objs) {\n String line = Arrays.stream(objs).map(Objects::toString).collect(Collectors.joining(\" \"));\n stdout.println(line);\n }\n\n public void printDebug(Object ... objs) {\n String line = Arrays.stream(objs).map(this::deepToString).collect(Collectors.joining(\" \"));\n stdout.printf(\"DEBUG: %s%n\", line);\n stdout.flush();\n }\n\n private String deepToString(Object o) {\n if (o == null) {\n return \"null\";\n }\n\n // 配列の場合\n if (o.getClass().isArray()) {\n int len = Array.getLength(o);\n String[] tokens = new String[len];\n for (int i = 0; i < len; i++) {\n tokens[i] = deepToString(Array.get(o, i));\n }\n return \"{\" + String.join(\",\", tokens) + \"}\";\n }\n\n return Objects.toString(o);\n }\n\n private void flush() {\n stdout.flush();\n }\n }\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N points on the 2D plane, i-th of which is located on (x_i, y_i).\nThere can be multiple points that share the same coordinate.\nWhat is the maximum possible Manhattan distance between two distinct points?\n\nHere, the Manhattan distance between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq x_i,y_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 1\n2 4\n3 2\n\nSample Output 1\n\n4\n\nThe Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.\n\nSample Input 2\n\n2\n1 1\n1 1\n\nSample Output 2\n\n0", "sample_input": "3\n1 1\n2 4\n3 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02556", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N points on the 2D plane, i-th of which is located on (x_i, y_i).\nThere can be multiple points that share the same coordinate.\nWhat is the maximum possible Manhattan distance between two distinct points?\n\nHere, the Manhattan distance between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq x_i,y_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 1\n2 4\n3 2\n\nSample Output 1\n\n4\n\nThe Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.\n\nSample Input 2\n\n2\n1 1\n1 1\n\nSample Output 2\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4774, "cpu_time_ms": 537, "memory_kb": 74384}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s688348328", "group_id": "codeNet:p02556", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n int n = sc.nextInt();\n long[] plus = new long[n];\n long[] minus = new long[n];\n for (int i=0;i Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n }\n public static class Basic {\n //math\n private final int MAX = 510000;\n private final long MOD = Main.MOD;\n private final long[] fac = new long[MAX];\n private final long[] finv = new long[MAX];\n private final long[] inv = new long[MAX];\n public long factorial(long num) {\n if (num < 2) return 1;\n else return num * factorial(num - 1);\n }\n public long modFactorial(long num) {\n if (num < 2) return 1;\n else return num*modFactorial(num-1)%MOD;\n }\n public int arraySum(int[] array) {\n int ans = 0;\n for (int value : array) ans += value;\n return ans;\n }\n public double log(double base, double antilogarithm) {\n return Math.log(antilogarithm) / Math.log(base);\n }\n public long gcd(long x, long y) {\n if (y == 0) return x;\n else return gcd(y, x % y);\n }\n public long lcm(long x, long y) {\n return x / gcd(x, y) * y;\n }\n public HashMap factorization(long num) {\n HashMap hash = new HashMap<>();\n long n = num;\n long count = 2;\n while (n > 1) {\n while (n % count == 0) {\n n /= count;\n if (hash.containsKey(count)) hash.put(count, hash.get(count) + 1);\n else hash.put(count, 1L);\n }\n count++;\n }\n return hash;\n }\n public int sum(int[] num) {\n int ans = 0;\n for (int i = 0; i < num.length; i++) {\n ans += num[i];\n }\n return ans;\n }\n public int[] reduce(int small, int big) {\n int ins = 2;\n while (ins <= small) {\n if (small % ins == 0 && big % ins == 0) {\n small /= ins;\n big /= ins;\n ins = 2;\n } else {\n ins++;\n }\n }\n return new int[]{small, big};\n }\n public int reduceCount(int small, int big) {\n int ins = 2;\n int ans = 0;\n while (ins <= small) {\n if (small % ins == 0 && big % ins == 0) {\n small /= ins;\n big /= ins;\n ins = 2;\n ans++;\n } else {\n ins++;\n }\n }\n return ans;\n }\n public int binarySearch(int[] array, int target) {\n int pos = -1;\n int left = 0;\n int right = array.length - 1;\n int middle;\n while (pos == -1 && left <= right) {\n middle = (left + right) / 2;\n if (array[middle] == target) pos = middle;\n else if (array[middle] > target) right = middle - 1;\n else left = middle + 1;\n }\n return pos;\n }\n public int upperBound(int[] ar, long d, int n, int f){\n int p = n;\n int q = f;\n while (p-q>1){\n int mid = (p+q)/2;\n if (ar[mid]==d){\n return mid+1;\n }\n if (ar[mid] 0) {\n if ((n & 1) != 0) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n }\n public long pow(long a, long n) {\n long res = 1;\n while (n > 0) {\n if ((n & 1) != 0) res = res * a;\n a = a * a;\n n >>= 1;\n }\n return res;\n }\n public long modinv(long a, long mod) {\n return modPow(a, mod - 2, mod);\n }\n public void COMinit() {\n fac[0] = 1;\n fac[1] = 1;\n finv[0] = 1;\n finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[(int)(MOD % i)] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n public long COM(int n, int k) {\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n-k]%MOD)% MOD;\n }\n public long PER(int n, int k){\n return fac[n]*finv[n-k]%MOD;\n }\n public long HCOM(int n, int k) {\n return COM(n + k - 1, k);\n }\n public boolean[] getIsPrimeArray(int max){\n boolean[] ret = new boolean[max+1];\n Arrays.fill(ret,true);\n ret[0]=false;\n ret[1]=false;\n for (int i=2;i<=max;i++){\n if (ret[i]){\n int c = 2*i;\n while (c<=max){\n ret[c]=false;\n c+=i;\n }\n }\n }\n return ret;\n }\n\n //array\n public int[] remove(int[] ar, int pos) {\n int[] ret = new int[ar.length - 1];\n for (int i = 0; i < pos; i++) ret[i] = ar[i];\n for (int i = pos + 1; i < ar.length; i++) ret[i - 1] = ar[i];\n return ret;\n }\n public int[] nextArray(int size,int cons){\n int[] ret = new int[size];\n for (int i=0;i ans[a[0]] + a[2]) {\n ans[a[1]] = ans[a[0]] + a[2];\n if (i == size - 1) {\n System.out.println(\"negative loop\");\n break;\n }\n }\n }\n }\n return ans;\n }//辺を配列の要素として管理。\n\n\n }\n public static class Queue{\n private final int max = 10000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){return (head == (tail+1)%max);}\n public void enqueue(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T dequeue(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n }\n public static class Deque{\n private final int max = 10000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){\n return (head == (tail+1)%max);\n }\n public void pushFirst(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n head--;\n if (head==-1)head=max-1;\n queue[head] = v;\n }\n public void pushLast(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T popFirst(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n public T popLast(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n if (--tail==-1)tail=max-1;\n return queue[tail];\n }\n\n public T peekFirst(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n return queue[head];\n }\n public T peekLast(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n return queue[tail];\n }\n }\n public static class Stack{\n private final int max = 100000;\n private final T[] stack =(T[]) new Object[max];\n private int top = 0;\n public boolean isEmpty(){return (top==0);}\n public boolean isFull(){return (top==max);}\n public void init(){top=0;}\n public void push(T v){\n if (isFull()){\n System.out.println(\"error: stack is full.\");\n return;\n }\n stack[top++] = v;\n }\n public T pop(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[--top];\n }\n public T peek(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[top];\n }\n }\n public static class Pair{\n private K A;\n private V B;\n Pair(K a,V b){\n A=a;\n B=b;\n }\n public void changeA(K a){A=a;}\n public void changeB(V b){B=b;}\n public void changeAB(K a,V b){A=a;B=b;}\n public static Comparator numberSortWithA = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A){\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B)return 0;\n else return 1;\n }\n else return 1;\n }\n };\n public static Comparator numberSortWithB = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B){\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A)return 0;\n else return 1;\n }\n else return 1;\n }\n };\n }\n public static class Graph{\n private final HashMap> graph = new HashMap<>();\n private final int Size;\n Graph(int size){\n for (int i=0;i());\n Size = size;\n }\n\n public void addEdge(int node1,int node2){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).add(node2);\n graph.get(node2).add(node1);\n }\n }\n public void addDirectEdge(int from,int to){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).add(to);\n }\n }\n public int[] depth(int root){\n Queue q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n int[] depth = new int[Size];\n Arrays.fill(depth,-1);\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v)){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+1;\n }\n }\n }\n return depth;\n }\n public HashSet getConnected(int pos){return graph.get(pos);}\n public boolean isConnected(int from,int to){return graph.get(from).contains(to);}\n }\n public static class WeightedGraph{\n private final HashMap> graph = new HashMap<>();\n private final int Size;\n private long[] Depth;\n WeightedGraph(int size){\n for (int i=0;i());\n Size = size;\n }\n\n public void addEdge(int node1,int node2,int weight){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).put(node2,weight);\n graph.get(node2).put(node1,weight);\n }\n }\n public void addDirectEdge(int from,int to,int weight){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).put(to,weight);\n }\n }\n public int[] dijkstra(int root){\n Comparator c = new Comparator() {\n @Override\n public int compare(int[] o1, int[] o2) {\n return Integer.compare(o1[1], o2[1]);\n }\n };\n PriorityQueue q = new PriorityQueue<>(c);\n q.add(new int[]{root,0});\n int[] ret = new int[Size];\n Arrays.fill(ret,Integer.MAX_VALUE);\n ret[root]=0;\n while (!q.isEmpty()){\n int[] v = q.poll();\n if (v[1]<=ret[v[0]]){\n HashMap h = graph.get(v[0]);\n for (int u : h.keySet()){\n if (ret[u]>v[1]+h.get(u)){\n ret[u]=v[1]+h.get(u);\n q.add(new int[]{u,ret[u]});\n }\n }\n }\n }\n return ret;\n }\n\n public long[] Depth(int root){\n Queue q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n long[] depth = new long[Size];\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v).keySet()){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+graph.get(v).get(u);\n }\n }\n }\n Depth = depth.clone();\n return depth;\n }\n\n }\n public static class UnionFindTree{\n int[] parent;\n int[] rank;\n int[] Size;\n int Number;\n public UnionFindTree(int size){\n this.parent = new int[size];\n this.rank = new int[size];\n this.Size = new int[size];\n makeSet();\n }\n public void makeSet(){\n for (int i=0;irank[yRoot]){\n parent[yRoot] = xRoot;\n Size[xRoot]+=Size[yRoot];\n Number--;\n }else if (rank[xRoot]{\n T[] Array;\n int Width;\n int Length;\n BitSearch(T[] t, int width){\n Array = t;\n Width = width;\n Length = Array.length;\n }\n void start(){\n long max = (long)Math.pow(Width,Length);\n for (long i=0;i Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n }\n public static class Basic {\n //math\n private final int MAX = 510000;\n private final long MOD = Main.MOD;\n private final long[] fac = new long[MAX];\n private final long[] finv = new long[MAX];\n private final long[] inv = new long[MAX];\n public long factorial(long num) {\n if (num < 2) return 1;\n else return num * factorial(num - 1);\n }\n public long modFactorial(long num) {\n if (num < 2) return 1;\n else return num*modFactorial(num-1)%MOD;\n }\n public int arraySum(int[] array) {\n int ans = 0;\n for (int value : array) ans += value;\n return ans;\n }\n public double log(double base, double antilogarithm) {\n return Math.log(antilogarithm) / Math.log(base);\n }\n public long gcd(long x, long y) {\n if (y == 0) return x;\n else return gcd(y, x % y);\n }\n public long lcm(long x, long y) {\n return x / gcd(x, y) * y;\n }\n public HashMap factorization(long num) {\n HashMap hash = new HashMap<>();\n long n = num;\n long count = 2;\n while (n > 1) {\n while (n % count == 0) {\n n /= count;\n if (hash.containsKey(count)) hash.put(count, hash.get(count) + 1);\n else hash.put(count, 1L);\n }\n count++;\n }\n return hash;\n }\n public int sum(int[] num) {\n int ans = 0;\n for (int i = 0; i < num.length; i++) {\n ans += num[i];\n }\n return ans;\n }\n public int[] reduce(int small, int big) {\n int ins = 2;\n while (ins <= small) {\n if (small % ins == 0 && big % ins == 0) {\n small /= ins;\n big /= ins;\n ins = 2;\n } else {\n ins++;\n }\n }\n return new int[]{small, big};\n }\n public int reduceCount(int small, int big) {\n int ins = 2;\n int ans = 0;\n while (ins <= small) {\n if (small % ins == 0 && big % ins == 0) {\n small /= ins;\n big /= ins;\n ins = 2;\n ans++;\n } else {\n ins++;\n }\n }\n return ans;\n }\n public int binarySearch(int[] array, int target) {\n int pos = -1;\n int left = 0;\n int right = array.length - 1;\n int middle;\n while (pos == -1 && left <= right) {\n middle = (left + right) / 2;\n if (array[middle] == target) pos = middle;\n else if (array[middle] > target) right = middle - 1;\n else left = middle + 1;\n }\n return pos;\n }\n public int upperBound(int[] ar, long d, int n, int f){\n int p = n;\n int q = f;\n while (p-q>1){\n int mid = (p+q)/2;\n if (ar[mid]==d){\n return mid+1;\n }\n if (ar[mid] 0) {\n if ((n & 1) != 0) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n }\n public long pow(long a, long n) {\n long res = 1;\n while (n > 0) {\n if ((n & 1) != 0) res = res * a;\n a = a * a;\n n >>= 1;\n }\n return res;\n }\n public long modinv(long a, long mod) {\n return modPow(a, mod - 2, mod);\n }\n public void COMinit() {\n fac[0] = 1;\n fac[1] = 1;\n finv[0] = 1;\n finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[(int)(MOD % i)] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n public long COM(int n, int k) {\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n-k]%MOD)% MOD;\n }\n public long PER(int n, int k){\n return fac[n]*finv[n-k]%MOD;\n }\n public long HCOM(int n, int k) {\n return COM(n + k - 1, k);\n }\n public boolean[] getIsPrimeArray(int max){\n boolean[] ret = new boolean[max+1];\n Arrays.fill(ret,true);\n ret[0]=false;\n ret[1]=false;\n for (int i=2;i<=max;i++){\n if (ret[i]){\n int c = 2*i;\n while (c<=max){\n ret[c]=false;\n c+=i;\n }\n }\n }\n return ret;\n }\n\n //array\n public int[] remove(int[] ar, int pos) {\n int[] ret = new int[ar.length - 1];\n for (int i = 0; i < pos; i++) ret[i] = ar[i];\n for (int i = pos + 1; i < ar.length; i++) ret[i - 1] = ar[i];\n return ret;\n }\n public int[] nextArray(int size,int cons){\n int[] ret = new int[size];\n for (int i=0;i ans[a[0]] + a[2]) {\n ans[a[1]] = ans[a[0]] + a[2];\n if (i == size - 1) {\n System.out.println(\"negative loop\");\n break;\n }\n }\n }\n }\n return ans;\n }//辺を配列の要素として管理。\n\n\n }\n public static class Queue{\n private final int max = 10000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){return (head == (tail+1)%max);}\n public void enqueue(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T dequeue(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n }\n public static class Deque{\n private final int max = 10000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){\n return (head == (tail+1)%max);\n }\n public void pushFirst(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n head--;\n if (head==-1)head=max-1;\n queue[head] = v;\n }\n public void pushLast(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T popFirst(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n public T popLast(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n if (--tail==-1)tail=max-1;\n return queue[tail];\n }\n\n public T peekFirst(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n return queue[head];\n }\n public T peekLast(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n return queue[tail];\n }\n }\n public static class Stack{\n private final int max = 100000;\n private final T[] stack =(T[]) new Object[max];\n private int top = 0;\n public boolean isEmpty(){return (top==0);}\n public boolean isFull(){return (top==max);}\n public void init(){top=0;}\n public void push(T v){\n if (isFull()){\n System.out.println(\"error: stack is full.\");\n return;\n }\n stack[top++] = v;\n }\n public T pop(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[--top];\n }\n public T peek(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[top];\n }\n }\n public static class Pair{\n private K A;\n private V B;\n Pair(K a,V b){\n A=a;\n B=b;\n }\n public void changeA(K a){A=a;}\n public void changeB(V b){B=b;}\n public void changeAB(K a,V b){A=a;B=b;}\n public static Comparator numberSortWithA = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A){\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B)return 0;\n else return 1;\n }\n else return 1;\n }\n };\n public static Comparator numberSortWithB = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B){\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A)return 0;\n else return 1;\n }\n else return 1;\n }\n };\n }\n public static class Graph{\n private final HashMap> graph = new HashMap<>();\n private final int Size;\n Graph(int size){\n for (int i=0;i());\n Size = size;\n }\n\n public void addEdge(int node1,int node2){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).add(node2);\n graph.get(node2).add(node1);\n }\n }\n public void addDirectEdge(int from,int to){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).add(to);\n }\n }\n public int[] depth(int root){\n Queue q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n int[] depth = new int[Size];\n Arrays.fill(depth,-1);\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v)){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+1;\n }\n }\n }\n return depth;\n }\n public HashSet getConnected(int pos){return graph.get(pos);}\n public boolean isConnected(int from,int to){return graph.get(from).contains(to);}\n }\n public static class WeightedGraph{\n private final HashMap> graph = new HashMap<>();\n private final int Size;\n private long[] Depth;\n WeightedGraph(int size){\n for (int i=0;i());\n Size = size;\n }\n\n public void addEdge(int node1,int node2,int weight){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).put(node2,weight);\n graph.get(node2).put(node1,weight);\n }\n }\n public void addDirectEdge(int from,int to,int weight){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).put(to,weight);\n }\n }\n public int[] dijkstra(int root){\n Comparator c = new Comparator() {\n @Override\n public int compare(int[] o1, int[] o2) {\n return Integer.compare(o1[1], o2[1]);\n }\n };\n PriorityQueue q = new PriorityQueue<>(c);\n q.add(new int[]{root,0});\n int[] ret = new int[Size];\n Arrays.fill(ret,Integer.MAX_VALUE);\n ret[root]=0;\n while (!q.isEmpty()){\n int[] v = q.poll();\n if (v[1]<=ret[v[0]]){\n HashMap h = graph.get(v[0]);\n for (int u : h.keySet()){\n if (ret[u]>v[1]+h.get(u)){\n ret[u]=v[1]+h.get(u);\n q.add(new int[]{u,ret[u]});\n }\n }\n }\n }\n return ret;\n }\n\n public long[] Depth(int root){\n Queue q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n long[] depth = new long[Size];\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v).keySet()){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+graph.get(v).get(u);\n }\n }\n }\n Depth = depth.clone();\n return depth;\n }\n\n }\n public static class UnionFindTree{\n int[] parent;\n int[] rank;\n int[] Size;\n int Number;\n public UnionFindTree(int size){\n this.parent = new int[size];\n this.rank = new int[size];\n this.Size = new int[size];\n makeSet();\n }\n public void makeSet(){\n for (int i=0;irank[yRoot]){\n parent[yRoot] = xRoot;\n Size[xRoot]+=Size[yRoot];\n Number--;\n }else if (rank[xRoot]{\n T[] Array;\n int Width;\n int Length;\n BitSearch(T[] t, int width){\n Array = t;\n Width = width;\n Length = Array.length;\n }\n void start(){\n long max = (long)Math.pow(Width,Length);\n for (long i=0;i lazySegTree=new LazySegTree(dat, S::op, S.E,S::map,F::composite,F.I);\n\t\tfor (int i = 0; i< Q; i++) {\n\t\t\tint c=sc.nextInt();\n\t\t\tint s=sc.nextInt();\n\t\t\tint t=sc.nextInt();\n\t\t\tif (c==0) {\n\t\t\t\tlong a=sc.nextLong();\n\t\t\t\tlong b=sc.nextLong();\n\t\t\t\tlazySegTree.apply(s, t, new F(a, b));\n\t\t\t\t\n\t\t\t}else {\n\t\t\t\tout.println(lazySegTree.prod(s, t).sum);\n\t\t\t}\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic class F {\n static final F I = new F(1,0);\n long a;\n long b;\n public F (long a, long b) {\n \tsuper();\n this.a = a;\n this.b = b;\n }\n public static F composite(F f, F g) {\n return new F((f.a*g.a)%MOD2,((g.a*f.b)%MOD2+g.b)%MOD2);\n }\n }\n\tstatic class S {\n static final S E = new S(0,0);\n long sum;\n long size;\n public S (long sum,long size) {\n \tsuper();\n this.sum = sum;\n this.size=size;\n }\n public static S op(S s1, S s2) {\n return new S((s1.sum+s2.sum)%MOD2,(s1.size+s2.size)%MOD2);\n }\n static S map(F f, S s) {\n \t\treturn new S(((s.sum*f.a)%MOD2 + (f.b * s.size)%MOD2)%MOD2, s.size);\n \t}\n }\n\tstatic class LazySegTree {\n\t final int MAX;\n\n\t final int N;\n\t final int Log;\n\t final java.util.function.BinaryOperator Op;\n\t final S E;\n\t final java.util.function.BiFunction Mapping;\n\t final java.util.function.BinaryOperator Composition;\n\t final F Id;\n\n\t final S[] Dat;\n\t final F[] Laz;\n\n\t @SuppressWarnings(\"unchecked\")\n\t public LazySegTree(int n, java.util.function.BinaryOperator op, S e, java.util.function.BiFunction mapping, java.util.function.BinaryOperator composition, F id) {\n\t this.MAX = n;\n\t int k = 1;\n\t while (k < n) k <<= 1;\n\t this.N = k;\n\t this.Log = Integer.numberOfTrailingZeros(N);\n\t this.Op = op;\n\t this.E = e;\n\t this.Mapping = mapping;\n\t this.Composition = composition;\n\t this.Id = id;\n\t this.Dat = (S[]) new Object[N << 1];\n\t this.Laz = (F[]) new Object[N];\n\t java.util.Arrays.fill(Dat, E);\n\t java.util.Arrays.fill(Laz, Id);\n\t }\n\n\t public LazySegTree(S[] dat, java.util.function.BinaryOperator op, S e, java.util.function.BiFunction mapping, java.util.function.BinaryOperator composition, F id) {\n\t this(dat.length, op, e, mapping, composition, id);\n\t build(dat);\n\t }\n\n\t private void build(S[] dat) {\n\t int l = dat.length;\n\t System.arraycopy(dat, 0, Dat, N, l);\n\t for (int i = N - 1; i > 0; i--) {\n\t Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);\n\t }\n\t }\n\n\t private void push(int k) {\n\t if (Laz[k] == Id) return;\n\t int lk = k << 1 | 0, rk = k << 1 | 1;\n\t Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);\n\t Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);\n\t if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);\n\t if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);\n\t Laz[k] = Id;\n\t }\n\n\t private void pushTo(int k) {\n\t for (int i = Log; i > 0; i--) push(k >> i);\n\t }\n\n\t private void pushTo(int lk, int rk) {\n\t for (int i = Log; i > 0; i--) {\n\t if (((lk >> i) << i) != lk) push(lk >> i);\n\t if (((rk >> i) << i) != rk) push(rk >> i);\n\t }\n\t }\n\n\t private void updateFrom(int k) {\n\t k >>= 1;\n\t while (k > 0) {\n\t Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);\n\t k >>= 1;\n\t }\n\t }\n\n\t private void updateFrom(int lk, int rk) {\n\t for (int i = 1; i <= Log; i++) {\n\t if (((lk >> i) << i) != lk) {\n\t int lki = lk >> i;\n\t Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);\n\t }\n\t if (((rk >> i) << i) != rk) {\n\t int rki = (rk - 1) >> i;\n\t Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);\n\t }\n\t }\n\t }\n\n\t public void set(int p, S x) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t Dat[p] = x;\n\t updateFrom(p);\n\t }\n\n\t public S get(int p) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t return Dat[p];\n\t }\n\n\t public S prod(int l, int r) {\n\t if (l > r) {\n\t throw new IllegalArgumentException(\n\t String.format(\"Invalid range: [%d, %d)\", l, r)\n\t );\n\t }\n\t inclusiveRangeCheck(l);\n\t inclusiveRangeCheck(r);\n\t if (l == r) return E;\n\t l += N; r += N;\n\t pushTo(l, r);\n\t S sumLeft = E, sumRight = E;\n\t while (l < r) {\n\t if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);\n\t if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);\n\t l >>= 1; r >>= 1;\n\t }\n\t return Op.apply(sumLeft, sumRight);\n\t }\n\n\t public S allProd() {\n\t return Dat[1];\n\t }\n\n\t public void apply(int p, F f) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t Dat[p] = Mapping.apply(f, Dat[p]);\n\t updateFrom(p);\n\t }\n\n\t public void apply(int l, int r, F f) {\n\t if (l > r) {\n\t throw new IllegalArgumentException(\n\t String.format(\"Invalid range: [%d, %d)\", l, r)\n\t );\n\t }\n\t inclusiveRangeCheck(l);\n\t inclusiveRangeCheck(r);\n\t if (l == r) return;\n\t l += N; r += N;\n\t pushTo(l, r);\n\t for (int l2 = l, r2 = r; l2 < r2;) {\n\t if ((l2 & 1) == 1) {\n\t Dat[l2] = Mapping.apply(f, Dat[l2]);\n\t if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);\n\t l2++;\n\t }\n\t if ((r2 & 1) == 1) {\n\t r2--;\n\t Dat[r2] = Mapping.apply(f, Dat[r2]);\n\t if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);\n\t }\n\t l2 >>= 1; r2 >>= 1;\n\t }\n\t updateFrom(l, r);\n\t }\n\n\t public int maxRight(int l, java.util.function.Predicate g) {\n\t inclusiveRangeCheck(l);\n\t if (!g.test(E)) {\n\t throw new IllegalArgumentException(\"Identity element must satisfy the condition.\");\n\t }\n\t if (l == MAX) return MAX;\n\t l += N;\n\t pushTo(l);\n\t S sum = E;\n\t do {\n\t l >>= Integer.numberOfTrailingZeros(l);\n\t if (!g.test(Op.apply(sum, Dat[l]))) {\n\t while (l < N) {\n\t push(l);\n\t l = l << 1;\n\t if (g.test(Op.apply(sum, Dat[l]))) {\n\t sum = Op.apply(sum, Dat[l]);\n\t l++;\n\t }\n\t }\n\t return l - N;\n\t }\n\t sum = Op.apply(sum, Dat[l]);\n\t l++;\n\t } while ((l & -l) != l);\n\t return MAX;\n\t }\n\n\t public int minLeft(int r, java.util.function.Predicate g) {\n\t inclusiveRangeCheck(r);\n\t if (!g.test(E)) {\n\t throw new IllegalArgumentException(\"Identity element must satisfy the condition.\");\n\t }\n\t if (r == 0) return 0;\n\t r += N;\n\t pushTo(r - 1);\n\t S sum = E;\n\t do {\n\t r--;\n\t while (r > 1 && (r & 1) == 1) r >>= 1;\n\t if (!g.test(Op.apply(Dat[r], sum))) {\n\t while (r < N) {\n\t push(r);\n\t r = r << 1 | 1;\n\t if (g.test(Op.apply(Dat[r], sum))) {\n\t sum = Op.apply(Dat[r], sum);\n\t r--;\n\t }\n\t }\n\t return r + 1 - N;\n\t }\n\t sum = Op.apply(Dat[r], sum);\n\t } while ((r & -r) != r);\n\t return 0;\n\t }\n\n\t private void exclusiveRangeCheck(int p) {\n\t if (p < 0 || p >= MAX) {\n\t throw new IndexOutOfBoundsException(\n\t String.format(\"Index %d is not in [%d, %d).\", p, 0, MAX)\n\t );\n\t }\n\t }\n\n\t private void inclusiveRangeCheck(int p) {\n\t if (p < 0 || p > MAX) {\n\t throw new IndexOutOfBoundsException(\n\t String.format(\"Index %d is not in [%d, %d].\", p, 0, MAX)\n\t );\n\t }\n\t }\n\n\t // **************** DEBUG **************** //\n\n\t private int indent = 6;\n\n\t public void setIndent(int newIndent) {\n\t this.indent = newIndent;\n\t }\n\n\t @Override\n\t public String toString() {\n\t return toString(1, 0);\n\t }\n\n\t private String toString(int k, int sp) {\n\t if (k >= N) return indent(sp) + Dat[k];\n\t String s = \"\";\n\t s += toString(k << 1 | 1, sp + indent);\n\t s += \"\\n\";\n\t s += indent(sp) + Dat[k] + \"/\" + Laz[k];\n\t s += \"\\n\";\n\t s += toString(k << 1 | 0, sp + indent);\n\t return s;\n\t }\n\n\t private static String indent(int n) {\n\t StringBuilder sb = new StringBuilder();\n\t while (n --> 0) sb.append(' ');\n\t return sb.toString();\n\t }\n\t}\n\t//funはlamda式で定義\n\t//prodで取得,setで更新(一点加算なら更新でおｋ)\n\t//二ブタンも出来る\n\n\t\tstatic class InputReader { \n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n \n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n \n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n \n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n \n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n \n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n \n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n \n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1600642189, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02568.html", "problem_id": "p02568", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02568/input.txt", "sample_output_relpath": "derived/input_output/data/p02568/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02568/Java/s606419359.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s606419359", "user_id": "u596758817"}, "prompt_components": {"gold_output": "15\n404\n41511\n4317767\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\nimport java.util.function.BinaryOperator;\nimport java.util.function.Function;\n\n \npublic class Main {\n\tstatic final long MOD1=1000000007;\n\tstatic final long MOD2=998244353;\n\tpublic static void main(String[] args) {\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tInputReader sc=new InputReader(System.in);\n\t\tint N=sc.nextInt();\n\t\tint Q=sc.nextInt();\n\t\tS[] dat = new S[N];\n\t\tfor (int i = 0; i < dat.length; i++) {\n\t\t\tdat[i]=new S(sc.nextLong(), 1L);\n\t\t}\n\t\tLazySegTree lazySegTree=new LazySegTree(dat, S::op, S.E,S::map,F::composite,F.I);\n\t\tfor (int i = 0; i< Q; i++) {\n\t\t\tint c=sc.nextInt();\n\t\t\tint s=sc.nextInt();\n\t\t\tint t=sc.nextInt();\n\t\t\tif (c==0) {\n\t\t\t\tlong a=sc.nextLong();\n\t\t\t\tlong b=sc.nextLong();\n\t\t\t\tlazySegTree.apply(s, t, new F(a, b));\n\t\t\t\t\n\t\t\t}else {\n\t\t\t\tout.println(lazySegTree.prod(s, t).sum);\n\t\t\t}\n\t\t}\n\t\tout.flush();\n\t}\n\tstatic class F {\n static final F I = new F(1,0);\n long a;\n long b;\n public F (long a, long b) {\n \tsuper();\n this.a = a;\n this.b = b;\n }\n public static F composite(F f, F g) {\n return new F((f.a*g.a)%MOD2,((g.a*f.b)%MOD2+g.b)%MOD2);\n }\n }\n\tstatic class S {\n static final S E = new S(0,0);\n long sum;\n long size;\n public S (long sum,long size) {\n \tsuper();\n this.sum = sum;\n this.size=size;\n }\n public static S op(S s1, S s2) {\n return new S((s1.sum+s2.sum)%MOD2,(s1.size+s2.size)%MOD2);\n }\n static S map(F f, S s) {\n \t\treturn new S(((s.sum*f.a)%MOD2 + (f.b * s.size)%MOD2)%MOD2, s.size);\n \t}\n }\n\tstatic class LazySegTree {\n\t final int MAX;\n\n\t final int N;\n\t final int Log;\n\t final java.util.function.BinaryOperator Op;\n\t final S E;\n\t final java.util.function.BiFunction Mapping;\n\t final java.util.function.BinaryOperator Composition;\n\t final F Id;\n\n\t final S[] Dat;\n\t final F[] Laz;\n\n\t @SuppressWarnings(\"unchecked\")\n\t public LazySegTree(int n, java.util.function.BinaryOperator op, S e, java.util.function.BiFunction mapping, java.util.function.BinaryOperator composition, F id) {\n\t this.MAX = n;\n\t int k = 1;\n\t while (k < n) k <<= 1;\n\t this.N = k;\n\t this.Log = Integer.numberOfTrailingZeros(N);\n\t this.Op = op;\n\t this.E = e;\n\t this.Mapping = mapping;\n\t this.Composition = composition;\n\t this.Id = id;\n\t this.Dat = (S[]) new Object[N << 1];\n\t this.Laz = (F[]) new Object[N];\n\t java.util.Arrays.fill(Dat, E);\n\t java.util.Arrays.fill(Laz, Id);\n\t }\n\n\t public LazySegTree(S[] dat, java.util.function.BinaryOperator op, S e, java.util.function.BiFunction mapping, java.util.function.BinaryOperator composition, F id) {\n\t this(dat.length, op, e, mapping, composition, id);\n\t build(dat);\n\t }\n\n\t private void build(S[] dat) {\n\t int l = dat.length;\n\t System.arraycopy(dat, 0, Dat, N, l);\n\t for (int i = N - 1; i > 0; i--) {\n\t Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);\n\t }\n\t }\n\n\t private void push(int k) {\n\t if (Laz[k] == Id) return;\n\t int lk = k << 1 | 0, rk = k << 1 | 1;\n\t Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);\n\t Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);\n\t if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);\n\t if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);\n\t Laz[k] = Id;\n\t }\n\n\t private void pushTo(int k) {\n\t for (int i = Log; i > 0; i--) push(k >> i);\n\t }\n\n\t private void pushTo(int lk, int rk) {\n\t for (int i = Log; i > 0; i--) {\n\t if (((lk >> i) << i) != lk) push(lk >> i);\n\t if (((rk >> i) << i) != rk) push(rk >> i);\n\t }\n\t }\n\n\t private void updateFrom(int k) {\n\t k >>= 1;\n\t while (k > 0) {\n\t Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);\n\t k >>= 1;\n\t }\n\t }\n\n\t private void updateFrom(int lk, int rk) {\n\t for (int i = 1; i <= Log; i++) {\n\t if (((lk >> i) << i) != lk) {\n\t int lki = lk >> i;\n\t Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);\n\t }\n\t if (((rk >> i) << i) != rk) {\n\t int rki = (rk - 1) >> i;\n\t Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);\n\t }\n\t }\n\t }\n\n\t public void set(int p, S x) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t Dat[p] = x;\n\t updateFrom(p);\n\t }\n\n\t public S get(int p) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t return Dat[p];\n\t }\n\n\t public S prod(int l, int r) {\n\t if (l > r) {\n\t throw new IllegalArgumentException(\n\t String.format(\"Invalid range: [%d, %d)\", l, r)\n\t );\n\t }\n\t inclusiveRangeCheck(l);\n\t inclusiveRangeCheck(r);\n\t if (l == r) return E;\n\t l += N; r += N;\n\t pushTo(l, r);\n\t S sumLeft = E, sumRight = E;\n\t while (l < r) {\n\t if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);\n\t if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);\n\t l >>= 1; r >>= 1;\n\t }\n\t return Op.apply(sumLeft, sumRight);\n\t }\n\n\t public S allProd() {\n\t return Dat[1];\n\t }\n\n\t public void apply(int p, F f) {\n\t exclusiveRangeCheck(p);\n\t p += N;\n\t pushTo(p);\n\t Dat[p] = Mapping.apply(f, Dat[p]);\n\t updateFrom(p);\n\t }\n\n\t public void apply(int l, int r, F f) {\n\t if (l > r) {\n\t throw new IllegalArgumentException(\n\t String.format(\"Invalid range: [%d, %d)\", l, r)\n\t );\n\t }\n\t inclusiveRangeCheck(l);\n\t inclusiveRangeCheck(r);\n\t if (l == r) return;\n\t l += N; r += N;\n\t pushTo(l, r);\n\t for (int l2 = l, r2 = r; l2 < r2;) {\n\t if ((l2 & 1) == 1) {\n\t Dat[l2] = Mapping.apply(f, Dat[l2]);\n\t if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);\n\t l2++;\n\t }\n\t if ((r2 & 1) == 1) {\n\t r2--;\n\t Dat[r2] = Mapping.apply(f, Dat[r2]);\n\t if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);\n\t }\n\t l2 >>= 1; r2 >>= 1;\n\t }\n\t updateFrom(l, r);\n\t }\n\n\t public int maxRight(int l, java.util.function.Predicate g) {\n\t inclusiveRangeCheck(l);\n\t if (!g.test(E)) {\n\t throw new IllegalArgumentException(\"Identity element must satisfy the condition.\");\n\t }\n\t if (l == MAX) return MAX;\n\t l += N;\n\t pushTo(l);\n\t S sum = E;\n\t do {\n\t l >>= Integer.numberOfTrailingZeros(l);\n\t if (!g.test(Op.apply(sum, Dat[l]))) {\n\t while (l < N) {\n\t push(l);\n\t l = l << 1;\n\t if (g.test(Op.apply(sum, Dat[l]))) {\n\t sum = Op.apply(sum, Dat[l]);\n\t l++;\n\t }\n\t }\n\t return l - N;\n\t }\n\t sum = Op.apply(sum, Dat[l]);\n\t l++;\n\t } while ((l & -l) != l);\n\t return MAX;\n\t }\n\n\t public int minLeft(int r, java.util.function.Predicate g) {\n\t inclusiveRangeCheck(r);\n\t if (!g.test(E)) {\n\t throw new IllegalArgumentException(\"Identity element must satisfy the condition.\");\n\t }\n\t if (r == 0) return 0;\n\t r += N;\n\t pushTo(r - 1);\n\t S sum = E;\n\t do {\n\t r--;\n\t while (r > 1 && (r & 1) == 1) r >>= 1;\n\t if (!g.test(Op.apply(Dat[r], sum))) {\n\t while (r < N) {\n\t push(r);\n\t r = r << 1 | 1;\n\t if (g.test(Op.apply(Dat[r], sum))) {\n\t sum = Op.apply(Dat[r], sum);\n\t r--;\n\t }\n\t }\n\t return r + 1 - N;\n\t }\n\t sum = Op.apply(Dat[r], sum);\n\t } while ((r & -r) != r);\n\t return 0;\n\t }\n\n\t private void exclusiveRangeCheck(int p) {\n\t if (p < 0 || p >= MAX) {\n\t throw new IndexOutOfBoundsException(\n\t String.format(\"Index %d is not in [%d, %d).\", p, 0, MAX)\n\t );\n\t }\n\t }\n\n\t private void inclusiveRangeCheck(int p) {\n\t if (p < 0 || p > MAX) {\n\t throw new IndexOutOfBoundsException(\n\t String.format(\"Index %d is not in [%d, %d].\", p, 0, MAX)\n\t );\n\t }\n\t }\n\n\t // **************** DEBUG **************** //\n\n\t private int indent = 6;\n\n\t public void setIndent(int newIndent) {\n\t this.indent = newIndent;\n\t }\n\n\t @Override\n\t public String toString() {\n\t return toString(1, 0);\n\t }\n\n\t private String toString(int k, int sp) {\n\t if (k >= N) return indent(sp) + Dat[k];\n\t String s = \"\";\n\t s += toString(k << 1 | 1, sp + indent);\n\t s += \"\\n\";\n\t s += indent(sp) + Dat[k] + \"/\" + Laz[k];\n\t s += \"\\n\";\n\t s += toString(k << 1 | 0, sp + indent);\n\t return s;\n\t }\n\n\t private static String indent(int n) {\n\t StringBuilder sb = new StringBuilder();\n\t while (n --> 0) sb.append(' ');\n\t return sb.toString();\n\t }\n\t}\n\t//funはlamda式で定義\n\t//prodで取得,setで更新(一点加算なら更新でおｋ)\n\t//二ブタンも出来る\n\n\t\tstatic class InputReader { \n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int curbuf;\n\t\tprivate int lenbuf;\n\t\tpublic InputReader(InputStream in) {\n\t\t\tthis.in = in;\n\t\t\tthis.curbuf = this.lenbuf = 0;\n\t\t}\n \n\t\tpublic boolean hasNextByte() {\n\t\t\tif (curbuf >= lenbuf) {\n\t\t\t\tcurbuf = 0;\n\t\t\t\ttry {\n\t\t\t\t\tlenbuf = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (lenbuf <= 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n \n\t\tprivate int readByte() {\n\t\t\tif (hasNextByte())\n\t\t\t\treturn buffer[curbuf++];\n\t\t\telse\n\t\t\t\treturn -1;\n\t\t}\n \n\t\tprivate boolean isSpaceChar(int c) {\n\t\t\treturn !(c >= 33 && c <= 126);\n\t\t}\n \n\t\tprivate void skip() {\n\t\t\twhile (hasNextByte() && isSpaceChar(buffer[curbuf]))\n\t\t\t\tcurbuf++;\n\t\t}\n \n\t\tpublic boolean hasNext() {\n\t\t\tskip();\n\t\t\treturn hasNextByte();\n\t\t}\n \n\t\tpublic String next() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (!isSpaceChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n \n\t\tpublic int nextInt() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tint res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext())\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\tint c = readByte();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = readByte();\n\t\t\tboolean minus = false;\n\t\t\tif (c == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tc = readByte();\n\t\t\t}\n\t\t\tlong res = 0;\n\t\t\tdo {\n\t\t\t\tif (c < '0' || c > '9')\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\tres = res * 10 + c - '0';\n\t\t\t\tc = readByte();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn (minus) ? -res : res;\n\t\t}\n \n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n \n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n \n\t\tpublic char[][] nextCharMap(int n, int m) {\n\t\t\tchar[][] map = new char[n][m];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tmap[i] = next().toCharArray();\n\t\t\treturn map;\n\t\t}\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.\n\n0 l r b c: For each i = l, l+1, \\dots, {r - 1}, set a_i \\gets b \\times a_i + c.\n\n1 l r: Print \\sum_{i = l}^{r - 1} a_i \\bmod 998244353.\n\nConstraints\n\n1 \\leq N, Q \\leq 500000\n\n0 \\leq a_i, c < 998244353\n\n1 \\leq b < 998244353\n\n0 \\leq l < r \\leq N\n\nAll values in Input are integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_0 a_1 ... a_{N - 1}\n\\textrm{Query}_0\n\\textrm{Query}_1\n:\n\\textrm{Query}_{Q - 1}\n\nOutput\n\nFor each query of the latter type, print the answer.\n\nSample Input 1\n\n5 7\n1 2 3 4 5\n1 0 5\n0 2 4 100 101\n1 0 3\n0 1 3 102 103\n1 2 5\n0 2 5 104 105\n1 0 5\n\nSample Output 1\n\n15\n404\n41511\n4317767", "sample_input": "5 7\n1 2 3 4 5\n1 0 5\n0 2 4 100 101\n1 0 3\n0 1 3 102 103\n1 2 5\n0 2 5 104 105\n1 0 5\n"}, "reference_outputs": ["15\n404\n41511\n4317767\n"], "source_document_id": "p02568", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.\n\n0 l r b c: For each i = l, l+1, \\dots, {r - 1}, set a_i \\gets b \\times a_i + c.\n\n1 l r: Print \\sum_{i = l}^{r - 1} a_i \\bmod 998244353.\n\nConstraints\n\n1 \\leq N, Q \\leq 500000\n\n0 \\leq a_i, c < 998244353\n\n1 \\leq b < 998244353\n\n0 \\leq l < r \\leq N\n\nAll values in Input are integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_0 a_1 ... a_{N - 1}\n\\textrm{Query}_0\n\\textrm{Query}_1\n:\n\\textrm{Query}_{Q - 1}\n\nOutput\n\nFor each query of the latter type, print the answer.\n\nSample Input 1\n\n5 7\n1 2 3 4 5\n1 0 5\n0 2 4 100 101\n1 0 3\n0 1 3 102 103\n1 2 5\n0 2 5 104 105\n1 0 5\n\nSample Output 1\n\n15\n404\n41511\n4317767", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 12353, "cpu_time_ms": 4255, "memory_kb": 176224}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s466552386", "group_id": "codeNet:p02570", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int D = sc.nextInt();\n int T = sc.nextInt();\n int S = sc.nextInt();\n \n if (D <= T * S) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}", "language": "Java", "metadata": {"date": 1598729663, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02570/input.txt", "sample_output_relpath": "derived/input_output/data/p02570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02570/Java/s466552386.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466552386", "user_id": "u330907398"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int D = sc.nextInt();\n int T = sc.nextInt();\n int S = sc.nextInt();\n \n if (D <= T * S) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "sample_input": "1000 15 80\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02570", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 319, "cpu_time_ms": 126, "memory_kb": 35596}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s714972918", "group_id": "codeNet:p02570", "input_text": "import java.io.*;\nimport java.util.*;\n\nimport static java.lang.Long.max;\n\npublic class Main {\n static class Pair {\n int num;\n int cut;\n\n Pair(int num, int cut) {\n this.num = num;\n this.cut = cut;\n }\n }\n public static void main(String[] args) throws IOException {\n sc = new MScanner(System.in);\n pw = new PrintWriter(System.out);\n int D = sc.nextInt();\n int T = sc.nextInt();\n int S = sc.nextInt();\n if(S * T >= D) {\n pw.println(\"Yes\");\n } else {\n pw.println(\"No\");\n }\n\n\n //pw.println();\n // pw.println(\"end\");\n // pw.println();\n\n pw.flush();\n // System.out.println(cnt);\n }\n\n /**\n * https://www.slideshare.net/hcpc_hokudai/binary-indexed-tree A space efficient version segment\n * tree. Usually for range sum. Or the required metric can be calulated in that:\n *\n *

right_metric = parant_metric - left_metric Only then, we can stop memoizing right_metric\n *\n *

The internal structure is a 1-base array, to simplify calculation of parent node's idx. lsb\n * = 3 & -3 = 2 (0x0011 & 0x1101 = 0x0001) lastParentOf3 = 3 - lsb = 2 curParentOf3 = 3 + lsb = 4\n */\n static class FenwickTree {\n private final long[] state;\n private final int size;\n\n FenwickTree(int size) {\n this.size = size;\n state = new long[size + 1];\n }\n\n @Override\n public String toString() {\n return Arrays.toString(state);\n }\n\n long queryRangeSumFromZeroTo(int idx) {\n long sum = 0;\n while (idx != 0) {\n sum += state[idx];\n idx -= (idx & -idx);\n }\n return sum;\n }\n\n /** @param val can be negative */\n void updateElement(int idx, long val) {\n while (idx <= size) {\n state[idx] += val;\n idx += (idx & -idx);\n }\n }\n }\n\n // sc.close();\n // pw.println(cnt);\n // pw.flush();\n\n static PrintWriter pw;\n static MScanner sc;\n\n static class MScanner {\n StringTokenizer st;\n BufferedReader br;\n\n public MScanner(InputStream system) {\n br = new BufferedReader(new InputStreamReader(system));\n }\n\n public MScanner(String file) throws Exception {\n br = new BufferedReader(new FileReader(file));\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int[] intArr(int n) throws IOException {\n int[] in = new int[n];\n for (int i = 0; i < n; i++) in[i] = nextInt();\n return in;\n }\n\n public long[] longArr(int n) throws IOException {\n long[] in = new long[n];\n for (int i = 0; i < n; i++) in[i] = nextLong();\n return in;\n }\n\n public int[] intSortedArr(int n) throws IOException {\n int[] in = new int[n];\n for (int i = 0; i < n; i++) in[i] = nextInt();\n shuffle(in);\n Arrays.sort(in);\n return in;\n }\n\n public long[] longSortedArr(int n) throws IOException {\n long[] in = new long[n];\n for (int i = 0; i < n; i++) in[i] = nextLong();\n shuffle(in);\n Arrays.sort(in);\n return in;\n }\n\n public Integer[] IntegerArr(int n) throws IOException {\n Integer[] in = new Integer[n];\n for (int i = 0; i < n; i++) in[i] = nextInt();\n return in;\n }\n\n public Long[] LongArr(int n) throws IOException {\n Long[] in = new Long[n];\n for (int i = 0; i < n; i++) in[i] = nextLong();\n return in;\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public char nextChar() throws IOException {\n return next().charAt(0);\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n\n public void waitForInput() throws InterruptedException {\n Thread.sleep(3000);\n }\n }\n\n static void shuffle(int[] in) {\n for (int i = 0; i < in.length; i++) {\n int idx = (int) (Math.random() * in.length);\n int tmp = in[i];\n in[i] = in[idx];\n in[idx] = tmp;\n }\n }\n\n static void shuffle(long[] in) {\n for (int i = 0; i < in.length; i++) {\n int idx = (int) (Math.random() * in.length);\n long tmp = in[i];\n in[i] = in[idx];\n in[idx] = tmp;\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1598727744, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02570/input.txt", "sample_output_relpath": "derived/input_output/data/p02570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02570/Java/s714972918.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s714972918", "user_id": "u708615801"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\nimport static java.lang.Long.max;\n\npublic class Main {\n static class Pair {\n int num;\n int cut;\n\n Pair(int num, int cut) {\n this.num = num;\n this.cut = cut;\n }\n }\n public static void main(String[] args) throws IOException {\n sc = new MScanner(System.in);\n pw = new PrintWriter(System.out);\n int D = sc.nextInt();\n int T = sc.nextInt();\n int S = sc.nextInt();\n if(S * T >= D) {\n pw.println(\"Yes\");\n } else {\n pw.println(\"No\");\n }\n\n\n //pw.println();\n // pw.println(\"end\");\n // pw.println();\n\n pw.flush();\n // System.out.println(cnt);\n }\n\n /**\n * https://www.slideshare.net/hcpc_hokudai/binary-indexed-tree A space efficient version segment\n * tree. Usually for range sum. Or the required metric can be calulated in that:\n *\n *

right_metric = parant_metric - left_metric Only then, we can stop memoizing right_metric\n *\n *

The internal structure is a 1-base array, to simplify calculation of parent node's idx. lsb\n * = 3 & -3 = 2 (0x0011 & 0x1101 = 0x0001) lastParentOf3 = 3 - lsb = 2 curParentOf3 = 3 + lsb = 4\n */\n static class FenwickTree {\n private final long[] state;\n private final int size;\n\n FenwickTree(int size) {\n this.size = size;\n state = new long[size + 1];\n }\n\n @Override\n public String toString() {\n return Arrays.toString(state);\n }\n\n long queryRangeSumFromZeroTo(int idx) {\n long sum = 0;\n while (idx != 0) {\n sum += state[idx];\n idx -= (idx & -idx);\n }\n return sum;\n }\n\n /** @param val can be negative */\n void updateElement(int idx, long val) {\n while (idx <= size) {\n state[idx] += val;\n idx += (idx & -idx);\n }\n }\n }\n\n // sc.close();\n // pw.println(cnt);\n // pw.flush();\n\n static PrintWriter pw;\n static MScanner sc;\n\n static class MScanner {\n StringTokenizer st;\n BufferedReader br;\n\n public MScanner(InputStream system) {\n br = new BufferedReader(new InputStreamReader(system));\n }\n\n public MScanner(String file) throws Exception {\n br = new BufferedReader(new FileReader(file));\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int[] intArr(int n) throws IOException {\n int[] in = new int[n];\n for (int i = 0; i < n; i++) in[i] = nextInt();\n return in;\n }\n\n public long[] longArr(int n) throws IOException {\n long[] in = new long[n];\n for (int i = 0; i < n; i++) in[i] = nextLong();\n return in;\n }\n\n public int[] intSortedArr(int n) throws IOException {\n int[] in = new int[n];\n for (int i = 0; i < n; i++) in[i] = nextInt();\n shuffle(in);\n Arrays.sort(in);\n return in;\n }\n\n public long[] longSortedArr(int n) throws IOException {\n long[] in = new long[n];\n for (int i = 0; i < n; i++) in[i] = nextLong();\n shuffle(in);\n Arrays.sort(in);\n return in;\n }\n\n public Integer[] IntegerArr(int n) throws IOException {\n Integer[] in = new Integer[n];\n for (int i = 0; i < n; i++) in[i] = nextInt();\n return in;\n }\n\n public Long[] LongArr(int n) throws IOException {\n Long[] in = new Long[n];\n for (int i = 0; i < n; i++) in[i] = nextLong();\n return in;\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() throws IOException {\n return Double.parseDouble(next());\n }\n\n public char nextChar() throws IOException {\n return next().charAt(0);\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n\n public void waitForInput() throws InterruptedException {\n Thread.sleep(3000);\n }\n }\n\n static void shuffle(int[] in) {\n for (int i = 0; i < in.length; i++) {\n int idx = (int) (Math.random() * in.length);\n int tmp = in[i];\n in[i] = in[idx];\n in[idx] = tmp;\n }\n }\n\n static void shuffle(long[] in) {\n for (int i = 0; i < in.length; i++) {\n int idx = (int) (Math.random() * in.length);\n long tmp = in[i];\n in[i] = in[idx];\n in[idx] = tmp;\n }\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "sample_input": "1000 15 80\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02570", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4481, "cpu_time_ms": 89, "memory_kb": 32924}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s302455236", "group_id": "codeNet:p02571", "input_text": "import java.util.*;\n\nclass Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\t\tint sol = t.length();\n\t\tfor (int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint count = 0;\n\t\t\tint k = i;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (s.charAt(k) != t.charAt(j)) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tsol = Math.min(count, sol);\n\t\t}\n\t\tSystem.out.println(sol);\n\t}\n\n}", "language": "Java", "metadata": {"date": 1599775197, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02571.html", "problem_id": "p02571", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02571/input.txt", "sample_output_relpath": "derived/input_output/data/p02571/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02571/Java/s302455236.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s302455236", "user_id": "u394689602"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\t\tint sol = t.length();\n\t\tfor (int i = 0; i <= s.length() - t.length(); i++) {\n\t\t\tint count = 0;\n\t\t\tint k = i;\n\t\t\tfor (int j = 0; j < t.length(); j++) {\n\t\t\t\tif (s.charAt(k) != t.charAt(j)) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tk++;\n\t\t\t}\n\t\t\tsol = Math.min(count, sol);\n\t\t}\n\t\tSystem.out.println(sol);\n\t}\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are two strings S and T.\n\nLet us change some of the characters in S so that T will be a substring of S.\n\nAt least how many characters do we need to change?\n\nHere, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.\n\nConstraints\n\nThe lengths of S and T are each at least 1 and at most 1000.\n\nThe length of T is at most that of S.\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the minimum number of characters in S that need to be changed.\n\nSample Input 1\n\ncabacc\nabc\n\nSample Output 1\n\n1\n\nFor example, changing the fourth character a in S to c will match the second through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one - is the minimum needed.\n\nSample Input 2\n\ncodeforces\natcoder\n\nSample Output 2\n\n6", "sample_input": "cabacc\nabc\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02571", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are two strings S and T.\n\nLet us change some of the characters in S so that T will be a substring of S.\n\nAt least how many characters do we need to change?\n\nHere, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.\n\nConstraints\n\nThe lengths of S and T are each at least 1 and at most 1000.\n\nThe length of T is at most that of S.\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the minimum number of characters in S that need to be changed.\n\nSample Input 1\n\ncabacc\nabc\n\nSample Output 1\n\n1\n\nFor example, changing the fourth character a in S to c will match the second through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one - is the minimum needed.\n\nSample Input 2\n\ncodeforces\natcoder\n\nSample Output 2\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 456, "cpu_time_ms": 128, "memory_kb": 35472}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s572233513", "group_id": "codeNet:p02571", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n\tScanner sc = new Scanner(System.in);\n\tString s = sc.next();\n\tString t = sc.next();\n\tint min = Integer.MAX_VALUE;\n\tint count = 0;\n\tfor (int i=0; i<=s.length()-t.length(); i++) {\n\t String sis = s.substring(i,i+t.length());\n\t count = 0;\n\t for (int j=0; j hs = new HashSet<>();\n\t\tArrayList> groups = new ArrayList<>();\n\t\tfor(int i=1;i<=n;i++)\n\t\t\ths.add(i);\n\t\tfor(int i=0;i hs2 = new HashSet();\n\t\t\t\t\ths2.add(a);\n\t\t\t\t\tgroups.add(hs2);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (hs.contains(b)){\n\t\t\t\tboolean added = false;\n\t\t\t\tfor(int j=0;j hs2 = new HashSet();\n\t\t\t\t\ths2.add(a);\n\t\t\t\t\tgroups.add(hs2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint max = 0;\n\t\tfor(int i=0;i hs = new HashSet<>();\n\t\tArrayList> groups = new ArrayList<>();\n\t\tfor(int i=1;i<=n;i++)\n\t\t\ths.add(i);\n\t\tfor(int i=0;i hs2 = new HashSet();\n\t\t\t\t\ths2.add(a);\n\t\t\t\t\tgroups.add(hs2);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (hs.contains(b)){\n\t\t\t\tboolean added = false;\n\t\t\t\tfor(int j=0;j hs2 = new HashSet();\n\t\t\t\t\ths2.add(a);\n\t\t\t\t\tgroups.add(hs2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint max = 0;\n\t\tfor(int i=0;i num2) {\n \t\tstep = num1 - num2;\n \t\tres += step;\n \t}else {\n \t\tstep = 0;\n \t}\n }\n\n System.out.println(res);\n\n }\n}", "language": "Java", "metadata": {"date": 1598126320, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02578.html", "problem_id": "p02578", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02578/input.txt", "sample_output_relpath": "derived/input_output/data/p02578/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02578/Java/s717227787.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s717227787", "user_id": "u273396603"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.nio.charset.StandardCharsets;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);\n BufferedReader in = new BufferedReader(reader);\n long size = Long.parseLong(in.readLine());\n String[] str = in.readLine().split(\" \");\n long num1 = 0;\n long num2 = 0;\n long step = 0;\n long res = 0;\n\n for(int i=0; i < size-1; i++) {\n \tnum1 = Long.parseLong(str[i]) + step;\n \tnum2 = Long.parseLong(str[i+1]);\n\n \tif(num1 > num2) {\n \t\tstep = num1 - num2;\n \t\tres += step;\n \t}else {\n \t\tstep = 0;\n \t}\n }\n\n System.out.println(res);\n\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "sample_input": "5\n2 1 5 4 3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02578", "source_text": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 871, "cpu_time_ms": 276, "memory_kb": 61080}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s289078394", "group_id": "codeNet:p02578", "input_text": "\nimport java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException{\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint[] A = new int[N];\n\t\tfor(int i=0; i= old_hight) {\n\t\t\t\t\told_hight=h;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tint s = h - old_hight;\n\t\t\t\t\tsum = sum + s;\n\t\t\t\t\told_hight = h;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(sum);\n\n\t}\n}", "language": "Java", "metadata": {"date": 1598124472, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02578.html", "problem_id": "p02578", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02578/input.txt", "sample_output_relpath": "derived/input_output/data/p02578/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02578/Java/s289078394.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s289078394", "user_id": "u951856302"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "\nimport java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException{\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint[] A = new int[N];\n\t\tfor(int i=0; i= old_hight) {\n\t\t\t\t\told_hight=h;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tint s = h - old_hight;\n\t\t\t\t\tsum = sum + s;\n\t\t\t\t\told_hight = h;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(sum);\n\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "sample_input": "5\n2 1 5 4 3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02578", "source_text": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 524, "cpu_time_ms": 504, "memory_kb": 50444}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s436746016", "group_id": "codeNet:p02578", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(final String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\t\tint r = 0;\n\t\tfor (int i=1;i c) && (a + c > b) && (c + b > a)) {\n return true;\n } else {\n return false;\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1597523288, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02583.html", "problem_id": "p02583", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02583/input.txt", "sample_output_relpath": "derived/input_output/data/p02583/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02583/Java/s594172512.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594172512", "user_id": "u319223480"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int count = 0;\n int N = sc.nextInt();\n int [] arr = new int[N];\n\n for(int i = 0; i < N; i++) {\n arr[i] = sc.nextInt();\n }\n\n for(int i = 0; i < N; i++) {\n for(int j = i + 1; j < N; j++) {\n if(arr[i] != arr[j]) {\n for(int k = j + 1; k < N; k++) {\n if(arr[k] != arr[i] && arr[k] != arr[j]) {\n if(isTriangle(arr[i], arr[j], arr[k])) {\n count++;\n }\n }\n }\n }\n }\n }\n\n\n\n\n System.out.println(count);\n }\n\n public static boolean isTriangle(int a, int b, int c) {\n if((a + b > c) && (a + c > b) && (c + b > a)) {\n return true;\n } else {\n return false;\n }\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have sticks numbered 1, \\cdots, N. The length of Stick i (1 \\leq i \\leq N) is L_i.\n\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\n\nThat is, find the number of triples of integers (i, j, k) (1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nL_i, L_j, and L_k are all different.\n\nThere exists a triangle whose sides have lengths L_i, L_j, and L_k.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 \\cdots L_N\n\nOutput\n\nPrint the number of ways to choose three of the sticks with different lengths that can form a triangle.\n\nSample Input 1\n\n5\n4 4 9 7 5\n\nSample Output 1\n\n5\n\nThe following five triples (i, j, k) satisfy the conditions: (1, 3, 4), (1, 4, 5), (2, 3, 4), (2, 4, 5), and (3, 4, 5).\n\nSample Input 2\n\n6\n4 5 4 3 3 5\n\nSample Output 2\n\n8\n\nWe have two sticks for each of the lengths 3, 4, and 5. To satisfy the first condition, we have to choose one from each length.\n\nThere is a triangle whose sides have lengths 3, 4, and 5, so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.\n\nSample Input 3\n\n10\n9 4 6 1 9 6 10 6 6 8\n\nSample Output 3\n\n39\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\n0\n\nNo triple (i, j, k) satisfies 1 \\leq i < j < k \\leq N, so we should print 0.", "sample_input": "5\n4 4 9 7 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02583", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have sticks numbered 1, \\cdots, N. The length of Stick i (1 \\leq i \\leq N) is L_i.\n\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\n\nThat is, find the number of triples of integers (i, j, k) (1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nL_i, L_j, and L_k are all different.\n\nThere exists a triangle whose sides have lengths L_i, L_j, and L_k.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 \\cdots L_N\n\nOutput\n\nPrint the number of ways to choose three of the sticks with different lengths that can form a triangle.\n\nSample Input 1\n\n5\n4 4 9 7 5\n\nSample Output 1\n\n5\n\nThe following five triples (i, j, k) satisfy the conditions: (1, 3, 4), (1, 4, 5), (2, 3, 4), (2, 4, 5), and (3, 4, 5).\n\nSample Input 2\n\n6\n4 5 4 3 3 5\n\nSample Output 2\n\n8\n\nWe have two sticks for each of the lengths 3, 4, and 5. To satisfy the first condition, we have to choose one from each length.\n\nThere is a triangle whose sides have lengths 3, 4, and 5, so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.\n\nSample Input 3\n\n10\n9 4 6 1 9 6 10 6 6 8\n\nSample Output 3\n\n39\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\n0\n\nNo triple (i, j, k) satisfies 1 \\leq i < j < k \\leq N, so we should print 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1027, "cpu_time_ms": 153, "memory_kb": 36632}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s177854744", "group_id": "codeNet:p02584", "input_text": "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong X = sc.nextLong();\n\t\tlong K = sc.nextLong();\n\t\tlong D = sc.nextLong();\n\t\tsc.close();\n\t\tlong c = 0;\n\t\tlong x_ = X;\n\t\t/*while(x_ != X%D){\n\t\t\tif(c == K){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(x_ > 0){\n\t\t\t\tx_ -= D;\n\t\t\t}else{\n\t\t\t\tx_ += D;\n\t\t\t}\n\t\t\tc++;\n\t\t\tSystem.out.println(\"[\"+c+\"]\"+x_);\n\t\t}*/\n\t\tc = (-(X % D) + x_) / D;\n\t\tx_ -= D*c;\n\t\tif(c==K){\n\t\t\tSystem.out.println(Math.abs(x_));\n\t\t}else if(c>K){\n\t\t\tx_ += D*(c-K);\n\t\t\tSystem.out.println(Math.abs(x_));\n\t\t}else{\n\t\t\tif((K-c) % 2 == 0){\n\t\t\t\tSystem.out.println(Math.abs(x_));\n\t\t\t}else{\n\t\t\t\tif(x_>0){\n\t\t\t\t\tSystem.out.println(Math.abs(x_-D));\n\t\t\t\t}else{\n\t\t\t\t\tSystem.out.println(Math.abs(x_+D));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1597524159, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02584.html", "problem_id": "p02584", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02584/input.txt", "sample_output_relpath": "derived/input_output/data/p02584/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02584/Java/s177854744.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s177854744", "user_id": "u064404510"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong X = sc.nextLong();\n\t\tlong K = sc.nextLong();\n\t\tlong D = sc.nextLong();\n\t\tsc.close();\n\t\tlong c = 0;\n\t\tlong x_ = X;\n\t\t/*while(x_ != X%D){\n\t\t\tif(c == K){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(x_ > 0){\n\t\t\t\tx_ -= D;\n\t\t\t}else{\n\t\t\t\tx_ += D;\n\t\t\t}\n\t\t\tc++;\n\t\t\tSystem.out.println(\"[\"+c+\"]\"+x_);\n\t\t}*/\n\t\tc = (-(X % D) + x_) / D;\n\t\tx_ -= D*c;\n\t\tif(c==K){\n\t\t\tSystem.out.println(Math.abs(x_));\n\t\t}else if(c>K){\n\t\t\tx_ += D*(c-K);\n\t\t\tSystem.out.println(Math.abs(x_));\n\t\t}else{\n\t\t\tif((K-c) % 2 == 0){\n\t\t\t\tSystem.out.println(Math.abs(x_));\n\t\t\t}else{\n\t\t\t\tif(x_>0){\n\t\t\t\t\tSystem.out.println(Math.abs(x_-D));\n\t\t\t\t}else{\n\t\t\t\t\tSystem.out.println(Math.abs(x_+D));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, who lives on the number line, is now at coordinate X. He will make exactly K moves of distance D in the positive or negative direction.\n\nMore specifically, in one move, he can go from coordinate x to x + D or x - D.\n\nHe wants to make K moves so that the absolute value of the coordinate of the destination will be the smallest possible.\n\nFind the minimum possible absolute value of the coordinate of the destination.\n\nConstraints\n\n-10^{15} \\leq X \\leq 10^{15}\n\n1 \\leq K \\leq 10^{15}\n\n1 \\leq D \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX K D\n\nOutput\n\nPrint the minimum possible absolute value of the coordinate of the destination.\n\nSample Input 1\n\n6 2 4\n\nSample Output 1\n\n2\n\nTakahashi is now at coordinate 6. It is optimal to make the following moves:\n\nMove from coordinate 6 to (6 - 4 =) 2.\n\nMove from coordinate 2 to (2 - 4 =) -2.\n\nHere, the absolute value of the coordinate of the destination is 2, and we cannot make it smaller.\n\nSample Input 2\n\n7 4 3\n\nSample Output 2\n\n1\n\nTakahashi is now at coordinate 7. It is optimal to make, for example, the following moves:\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 7.\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 1.\n\nHere, the absolute value of the coordinate of the destination is 1, and we cannot make it smaller.\n\nSample Input 3\n\n10 1 2\n\nSample Output 3\n\n8\n\nSample Input 4\n\n1000000000000000 1000000000000000 1000000000000000\n\nSample Output 4\n\n1000000000000000\n\nThe answer can be enormous.", "sample_input": "6 2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02584", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, who lives on the number line, is now at coordinate X. He will make exactly K moves of distance D in the positive or negative direction.\n\nMore specifically, in one move, he can go from coordinate x to x + D or x - D.\n\nHe wants to make K moves so that the absolute value of the coordinate of the destination will be the smallest possible.\n\nFind the minimum possible absolute value of the coordinate of the destination.\n\nConstraints\n\n-10^{15} \\leq X \\leq 10^{15}\n\n1 \\leq K \\leq 10^{15}\n\n1 \\leq D \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX K D\n\nOutput\n\nPrint the minimum possible absolute value of the coordinate of the destination.\n\nSample Input 1\n\n6 2 4\n\nSample Output 1\n\n2\n\nTakahashi is now at coordinate 6. It is optimal to make the following moves:\n\nMove from coordinate 6 to (6 - 4 =) 2.\n\nMove from coordinate 2 to (2 - 4 =) -2.\n\nHere, the absolute value of the coordinate of the destination is 2, and we cannot make it smaller.\n\nSample Input 2\n\n7 4 3\n\nSample Output 2\n\n1\n\nTakahashi is now at coordinate 7. It is optimal to make, for example, the following moves:\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 7.\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 1.\n\nHere, the absolute value of the coordinate of the destination is 1, and we cannot make it smaller.\n\nSample Input 3\n\n10 1 2\n\nSample Output 3\n\n8\n\nSample Input 4\n\n1000000000000000 1000000000000000 1000000000000000\n\nSample Output 4\n\n1000000000000000\n\nThe answer can be enormous.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 765, "cpu_time_ms": 125, "memory_kb": 35640}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s050162241", "group_id": "codeNet:p02584", "input_text": "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n Scanner sc=new Scanner(System.in);\n long x=sc.nextLong();\n long k=sc.nextLong();\n long d=sc.nextLong();\n if(x==k && k==d)\n {\n \tSystem.out.println(x);\n \t\n System.exit(0);\n }\n x=Math.abs(x);\n k=k-(x/d);\n x=x%d;\n if(k<=0)\n {\n \tSystem.out.println((x-(k*d)));\n \tSystem.exit(0);\n }\n else\n {\n \tif(k%2==1)\n \t\tSystem.out.println(Math.abs(x-d));\n \telse\n \t\tSystem.out.println(x);\n }\n \n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1597524061, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02584.html", "problem_id": "p02584", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02584/input.txt", "sample_output_relpath": "derived/input_output/data/p02584/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02584/Java/s050162241.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s050162241", "user_id": "u053570263"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n Scanner sc=new Scanner(System.in);\n long x=sc.nextLong();\n long k=sc.nextLong();\n long d=sc.nextLong();\n if(x==k && k==d)\n {\n \tSystem.out.println(x);\n \t\n System.exit(0);\n }\n x=Math.abs(x);\n k=k-(x/d);\n x=x%d;\n if(k<=0)\n {\n \tSystem.out.println((x-(k*d)));\n \tSystem.exit(0);\n }\n else\n {\n \tif(k%2==1)\n \t\tSystem.out.println(Math.abs(x-d));\n \telse\n \t\tSystem.out.println(x);\n }\n \n\t}\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, who lives on the number line, is now at coordinate X. He will make exactly K moves of distance D in the positive or negative direction.\n\nMore specifically, in one move, he can go from coordinate x to x + D or x - D.\n\nHe wants to make K moves so that the absolute value of the coordinate of the destination will be the smallest possible.\n\nFind the minimum possible absolute value of the coordinate of the destination.\n\nConstraints\n\n-10^{15} \\leq X \\leq 10^{15}\n\n1 \\leq K \\leq 10^{15}\n\n1 \\leq D \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX K D\n\nOutput\n\nPrint the minimum possible absolute value of the coordinate of the destination.\n\nSample Input 1\n\n6 2 4\n\nSample Output 1\n\n2\n\nTakahashi is now at coordinate 6. It is optimal to make the following moves:\n\nMove from coordinate 6 to (6 - 4 =) 2.\n\nMove from coordinate 2 to (2 - 4 =) -2.\n\nHere, the absolute value of the coordinate of the destination is 2, and we cannot make it smaller.\n\nSample Input 2\n\n7 4 3\n\nSample Output 2\n\n1\n\nTakahashi is now at coordinate 7. It is optimal to make, for example, the following moves:\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 7.\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 1.\n\nHere, the absolute value of the coordinate of the destination is 1, and we cannot make it smaller.\n\nSample Input 3\n\n10 1 2\n\nSample Output 3\n\n8\n\nSample Input 4\n\n1000000000000000 1000000000000000 1000000000000000\n\nSample Output 4\n\n1000000000000000\n\nThe answer can be enormous.", "sample_input": "6 2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02584", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, who lives on the number line, is now at coordinate X. He will make exactly K moves of distance D in the positive or negative direction.\n\nMore specifically, in one move, he can go from coordinate x to x + D or x - D.\n\nHe wants to make K moves so that the absolute value of the coordinate of the destination will be the smallest possible.\n\nFind the minimum possible absolute value of the coordinate of the destination.\n\nConstraints\n\n-10^{15} \\leq X \\leq 10^{15}\n\n1 \\leq K \\leq 10^{15}\n\n1 \\leq D \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX K D\n\nOutput\n\nPrint the minimum possible absolute value of the coordinate of the destination.\n\nSample Input 1\n\n6 2 4\n\nSample Output 1\n\n2\n\nTakahashi is now at coordinate 6. It is optimal to make the following moves:\n\nMove from coordinate 6 to (6 - 4 =) 2.\n\nMove from coordinate 2 to (2 - 4 =) -2.\n\nHere, the absolute value of the coordinate of the destination is 2, and we cannot make it smaller.\n\nSample Input 2\n\n7 4 3\n\nSample Output 2\n\n1\n\nTakahashi is now at coordinate 7. It is optimal to make, for example, the following moves:\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 7.\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 1.\n\nHere, the absolute value of the coordinate of the destination is 1, and we cannot make it smaller.\n\nSample Input 3\n\n10 1 2\n\nSample Output 3\n\n8\n\nSample Input 4\n\n1000000000000000 1000000000000000 1000000000000000\n\nSample Output 4\n\n1000000000000000\n\nThe answer can be enormous.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 687, "cpu_time_ms": 126, "memory_kb": 35648}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s103848420", "group_id": "codeNet:p02585", "input_text": "import java.util.*;\n\npublic class Main{\n static Scanner sc = new Scanner(System.in);\n \n public static void main(String[] args){\n int n = Integer.parseInt(sc.next());\n int k = Integer.parseInt(sc.next());\n \n int[] p = new int[n];\n int[] c = new int[n];\n for(int i=0; i 0){\n if(t%2==1){\n ans += dbgc[idx][now];\n now = dbgp[idx][now];\n }\n t/=2;\n idx++;\n }\n max = Math.max(max, ans);\n }\n }\n \n System.out.println(max);\n }\n}\n", "language": "Java", "metadata": {"date": 1597547267, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02585.html", "problem_id": "p02585", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02585/input.txt", "sample_output_relpath": "derived/input_output/data/p02585/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02585/Java/s103848420.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s103848420", "user_id": "u397763977"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n static Scanner sc = new Scanner(System.in);\n \n public static void main(String[] args){\n int n = Integer.parseInt(sc.next());\n int k = Integer.parseInt(sc.next());\n \n int[] p = new int[n];\n int[] c = new int[n];\n for(int i=0; i 0){\n if(t%2==1){\n ans += dbgc[idx][now];\n now = dbgp[idx][now];\n }\n t/=2;\n idx++;\n }\n max = Math.max(max, ans);\n }\n }\n \n System.out.println(max);\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "sample_input": "5 2\n2 4 5 1 3\n3 4 -10 -8 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02585", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1746, "cpu_time_ms": 3310, "memory_kb": 46224}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s189598073", "group_id": "codeNet:p02585", "input_text": "import java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\npublic class Main {\n\tpublic static void main(String[] args)throws Exception{\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tint N=nextInt();\n\t\tlong K=nextInt();\n\t\tint P[]=new int[N];\n\t\tlong C[]=new long[N];\n\t\tlong ans=(long)Math.pow(-10,18)*-1-3,U=K;\n\t\tfor(int i=0;iK)\n\t\t\t\t\t\tfor(int k=0;k=key) return true;\n\t else return false;\n\t}\n\tstatic int binary_search(int key,int[] a) {\n\t int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1\n\t int ok = (int)a.length; // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は a.size()\n\t while (Math.abs(ok - ng) > 1) {\n\t int mid = (ok + ng) / 2;\n\t if (isOK(mid,key,a)) ok = mid;\n\t else ng = mid;\n\t }\n\t return ok;\n\t}\n\t//FastScanner\n\tstatic InputStream in = System.in;\n\tstatic byte[] buffer = new byte[1024];\n\tstatic int length = 0, p = 0;\n\tpublic static boolean hasNextByte () {\n\t\tif (p < length) return true;\n\t\telse {\n\t\t\tp = 0;\n\t\t\ttry {length = in.read(buffer);}\n\t\t\tcatch (Exception e) {e.printStackTrace();}\n\t\t\tif (length == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static int readByte () {\n\t\tif (hasNextByte() == true) return buffer[p++];\n\t\treturn -1;\n\t}\n\tpublic static boolean isPrintable (int n) {return 33<=n&&n<=126;}\n\tpublic static void skip () {\n\t\twhile (hasNextByte() && !isPrintable(buffer[p])) p++;\n\t}\n\tpublic static boolean hasNext () {skip(); return hasNextByte();}\n\tpublic static String next () {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint temp = readByte();\n\t\twhile (isPrintable(temp)) {\n\t\t\tsb.appendCodePoint(temp);\n\t\t\ttemp = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tpublic static int nextInt () {return Math.toIntExact(nextLong());}\n\tpublic static int[] nextInts (int n) {\n\t\tint[] ar = new int[n];\n\t\tfor (int i=0; iK)\n\t\t\t\t\t\tfor(int k=0;k=key) return true;\n\t else return false;\n\t}\n\tstatic int binary_search(int key,int[] a) {\n\t int ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1\n\t int ok = (int)a.length; // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は a.size()\n\t while (Math.abs(ok - ng) > 1) {\n\t int mid = (ok + ng) / 2;\n\t if (isOK(mid,key,a)) ok = mid;\n\t else ng = mid;\n\t }\n\t return ok;\n\t}\n\t//FastScanner\n\tstatic InputStream in = System.in;\n\tstatic byte[] buffer = new byte[1024];\n\tstatic int length = 0, p = 0;\n\tpublic static boolean hasNextByte () {\n\t\tif (p < length) return true;\n\t\telse {\n\t\t\tp = 0;\n\t\t\ttry {length = in.read(buffer);}\n\t\t\tcatch (Exception e) {e.printStackTrace();}\n\t\t\tif (length == 0) return false;\n\t\t}\n\t\treturn true;\n\t}\n\tpublic static int readByte () {\n\t\tif (hasNextByte() == true) return buffer[p++];\n\t\treturn -1;\n\t}\n\tpublic static boolean isPrintable (int n) {return 33<=n&&n<=126;}\n\tpublic static void skip () {\n\t\twhile (hasNextByte() && !isPrintable(buffer[p])) p++;\n\t}\n\tpublic static boolean hasNext () {skip(); return hasNextByte();}\n\tpublic static String next () {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint temp = readByte();\n\t\twhile (isPrintable(temp)) {\n\t\t\tsb.appendCodePoint(temp);\n\t\t\ttemp = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\tpublic static int nextInt () {return Math.toIntExact(nextLong());}\n\tpublic static int[] nextInts (int n) {\n\t\tint[] ar = new int[n];\n\t\tfor (int i=0; i= 0; j--) {\n if (((1L << j) & k) == 0) continue;\n res += c[now][j];\n now = p[now][j];\n }\n return res;\n }\n\n }\n\n static final class IntUnionFind {\n private int groups;\n private final int[] nodes;\n private final int[] rank;\n\n public IntUnionFind(int n) {\n groups = n;\n nodes = new int[n];\n Arrays.fill(nodes, -1);\n rank = new int[n];\n }\n\n public int find(int i) {\n int ans = nodes[i];\n if (ans < 0) {\n return i;\n } else {\n return nodes[i] = find(ans);\n }\n }\n\n public int size(int i) {\n return -nodes[find(i)];\n }\n\n public boolean union(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y) {\n return false;\n } else if (rank[x] < rank[y]) {\n nodes[y] += nodes[x];\n nodes[x] = y;\n } else if (rank[x] == rank[y]) {\n rank[x]++;\n nodes[x] += nodes[y];\n nodes[y] = x;\n } else {\n nodes[x] += nodes[y];\n nodes[y] = x;\n }\n groups--;\n return true;\n }\n\n }\n\n static class LightScanner implements AutoCloseable {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n public long longs() {\n return Long.parseLong(string());\n }\n\n public long[] longs(int length) {\n return IntStream.range(0, length).mapToLong(x -> longs()).toArray();\n }\n\n public void close() {\n try {\n this.reader.close();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n\n }\n\n static class LightWriter implements AutoCloseable {\n private final Writer out;\n private boolean autoflush = false;\n private boolean breaked = true;\n\n public LightWriter(Writer out) {\n this.out = out;\n }\n\n public LightWriter(OutputStream out) {\n this(new OutputStreamWriter(new BufferedOutputStream(out), Charset.defaultCharset()));\n }\n\n public LightWriter print(char c) {\n try {\n out.write(c);\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter print(String s) {\n try {\n out.write(s, 0, s.length());\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter ans(String s) {\n if (!breaked) {\n print(' ');\n }\n return print(s);\n }\n\n public LightWriter ans(long l) {\n return ans(Long.toString(l));\n }\n\n public LightWriter ln() {\n print(System.lineSeparator());\n breaked = true;\n if (autoflush) {\n try {\n out.flush();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n return this;\n }\n\n public void close() {\n try {\n out.close();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1597542639, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02585.html", "problem_id": "p02585", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02585/input.txt", "sample_output_relpath": "derived/input_output/data/p02585/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02585/Java/s611706161.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s611706161", "user_id": "u183509493"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.stream.IntStream;\nimport java.util.Arrays;\nimport java.util.stream.LongStream;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.BufferedOutputStream;\nimport java.io.UncheckedIOException;\nimport java.nio.charset.Charset;\nimport java.util.StringTokenizer;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author mikit\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n LightScanner in = new LightScanner(inputStream);\n LightWriter out = new LightWriter(outputStream);\n DMovingPiece solver = new DMovingPiece();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DMovingPiece {\n static int n;\n static int[][] p;\n static long[][] c;\n\n public void solve(int testNumber, LightScanner in, LightWriter out) {\n n = in.ints();\n p = new int[n][30];\n c = new long[n][30];\n IntUnionFind uf = new IntUnionFind(n);\n long k = in.longs();\n for (int i = 0; i < n; i++) {\n p[i][0] = in.ints() - 1;\n uf.union(i, p[i][0]);\n }\n long[] c0 = in.longs(n);\n for (int i = 0; i < n; i++) c[i][0] = c0[p[i][0]];\n for (int i = 1; i < 30; i++) {\n for (int j = 0; j < n; j++) {\n int t = p[j][i - 1];\n p[j][i] = p[t][i - 1];\n c[j][i] = c[j][i - 1] + c[t][i - 1];\n }\n }\n\n long ans = Long.MIN_VALUE;\n for (int i = 0; i < n; i++) {\n ans = Math.max(ans, sum(i, k));\n for (int j = 1; j <= uf.size(i); j++) {\n ans = Math.max(ans, sum(i, j));\n ans = Math.max(ans, sum(i, k - j));\n }\n }\n out.ans(ans).ln();\n }\n\n private static long sum(int now, long k) {\n if (k <= 0) return Long.MIN_VALUE;\n long res = 0;\n for (int j = 29; j >= 0; j--) {\n if (((1L << j) & k) == 0) continue;\n res += c[now][j];\n now = p[now][j];\n }\n return res;\n }\n\n }\n\n static final class IntUnionFind {\n private int groups;\n private final int[] nodes;\n private final int[] rank;\n\n public IntUnionFind(int n) {\n groups = n;\n nodes = new int[n];\n Arrays.fill(nodes, -1);\n rank = new int[n];\n }\n\n public int find(int i) {\n int ans = nodes[i];\n if (ans < 0) {\n return i;\n } else {\n return nodes[i] = find(ans);\n }\n }\n\n public int size(int i) {\n return -nodes[find(i)];\n }\n\n public boolean union(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y) {\n return false;\n } else if (rank[x] < rank[y]) {\n nodes[y] += nodes[x];\n nodes[x] = y;\n } else if (rank[x] == rank[y]) {\n rank[x]++;\n nodes[x] += nodes[y];\n nodes[y] = x;\n } else {\n nodes[x] += nodes[y];\n nodes[y] = x;\n }\n groups--;\n return true;\n }\n\n }\n\n static class LightScanner implements AutoCloseable {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n public long longs() {\n return Long.parseLong(string());\n }\n\n public long[] longs(int length) {\n return IntStream.range(0, length).mapToLong(x -> longs()).toArray();\n }\n\n public void close() {\n try {\n this.reader.close();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n\n }\n\n static class LightWriter implements AutoCloseable {\n private final Writer out;\n private boolean autoflush = false;\n private boolean breaked = true;\n\n public LightWriter(Writer out) {\n this.out = out;\n }\n\n public LightWriter(OutputStream out) {\n this(new OutputStreamWriter(new BufferedOutputStream(out), Charset.defaultCharset()));\n }\n\n public LightWriter print(char c) {\n try {\n out.write(c);\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter print(String s) {\n try {\n out.write(s, 0, s.length());\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter ans(String s) {\n if (!breaked) {\n print(' ');\n }\n return print(s);\n }\n\n public LightWriter ans(long l) {\n return ans(Long.toString(l));\n }\n\n public LightWriter ln() {\n print(System.lineSeparator());\n breaked = true;\n if (autoflush) {\n try {\n out.flush();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n return this;\n }\n\n public void close() {\n try {\n out.close();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n\n }\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "sample_input": "5 2\n2 4 5 1 3\n3 4 -10 -8 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02585", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6679, "cpu_time_ms": 3309, "memory_kb": 41624}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s116354376", "group_id": "codeNet:p02595", "input_text": "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n \tScanner scanner = new Scanner(System.in);\n int count=0;\n\tint num1= scanner.nextInt();\n int num2= scanner.nextInt();\n \n int[][] a = new int[2][num1];\n for(int i=0;i= num2) count++;\n System.out.println(count);\n }\n}", "language": "Java", "metadata": {"date": 1598215124, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02595.html", "problem_id": "p02595", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02595/input.txt", "sample_output_relpath": "derived/input_output/data/p02595/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02595/Java/s116354376.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s116354376", "user_id": "u401860298"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n \tScanner scanner = new Scanner(System.in);\n int count=0;\n\tint num1= scanner.nextInt();\n int num2= scanner.nextInt();\n \n int[][] a = new int[2][num1];\n for(int i=0;i= num2) count++;\n System.out.println(count);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "sample_input": "4 5\n0 5\n-2 4\n3 4\n4 -4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02595", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 488, "cpu_time_ms": 119, "memory_kb": 37352}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s383579801", "group_id": "codeNet:p02596", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.Deque;\nimport java.util.NoSuchElementException;\nimport java.util.Objects;\nimport java.util.Random;\nimport java.util.Scanner;\n\nclass BIT {\n\tlong bit[] = new long[0];\n\tint N = 0;\n\n\tBIT(int n) {\n\t\tbit = new long[n + 1];\n\t\tN = n;\n\t}\n\n\tvoid add(int a, long w) {\n\t\tfor (int x = a; x < N; x += (x & -x))\n\t\t\tbit[x] += w;\n\t}\n\n\tlong sum(int a) {\n\t\tlong ret = 0;\n\t\tfor (int x = a; x > 0; x -= x & -x)\n\t\t\tret += bit[x];\n\t\treturn ret;\n\t}\n\n\tlong modsum(int a, int mod) {\n\t\tlong ret = 0;\n\t\tfor (int x = a; x > 0; x -= x & -x) {\n\t\t\tret += bit[x];\n\t\t\tret %= mod;\n\t\t}\n\t\treturn ret;\n\t}\n}\n\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tpublic char nextchar() {\n\t\treturn next().charAt(0);\n\t}\n}\n\nclass UnionFind {\n\tint Parent[];\n\n\tUnionFind(int n) {// Initialize by -1\n\t\tParent = new int[n];\n\t\tArrays.fill(Parent, -1);\n\t}\n\n\tint root(int A) {// In which tree is A?\n\t\tif (Parent[A] < 0)\n\t\t\treturn A;\n\t\treturn Parent[A] = root(Parent[A]);\n\t}\n\n\tint size(int A) {// size of tree which is include A\n\t\treturn -Parent[root(A)];\n\t}\n\n\tboolean connect(int A, int B) {// Connect A and B\n\t\tA = root(A);\n\t\tB = root(B);\n\t\tif (A == B)\n\t\t\treturn false;\n\t\tif (size(A) < size(B)) {\n\t\t\tint C = 0;\n\t\t\tC = B;\n\t\t\tB = A;\n\t\t\tA = C;\n\t\t} // SWAP\n\t\tParent[A] += Parent[B];\n\t\tParent[B] = A;\n\t\treturn true;\n\t}\n}\n\nclass Pair {\n\tpublic T first;\n\tpublic E second;\n\n\tvoid set(T x, E y) {\n\t\tfirst = x;\n\t\tsecond = y;\n\t}\n}\n\nclass Pint {\n\t@Override\n\tpublic boolean equals(Object obj) {\n\t\tif (obj instanceof Pint) {\n\t\t\tPint other = (Pint) obj;\n\t\t\treturn other.first == this.first && other.second == this.second;\n\t\t}\n\t\treturn false;\n\t}\n\n\t@Override\n\tpublic int hashCode() {\n\t\treturn Objects.hash(this.first, this.second);\n\t}\n\n\tpublic int first;\n\tpublic int second;\n\n\tPint(int x, int y) {\n\t\tfirst = x;\n\t\tsecond = y;\n\t}\n\n\tvoid set(int x, int y) {\n\t\tfirst = x;\n\t\tsecond = y;\n\t}\n}\n\nclass Tpair {\n\tpublic int first;\n\tpublic int second;\n\tpublic long third;\n\n\tTpair(int x, int y, long z) {\n\t\tfirst = x;\n\t\tsecond = y;\n\t\tthird = z;\n\t}\n\n\tvoid set(int x, int y, long z) {\n\t\tfirst = x;\n\t\tsecond = y;\n\t\tthird = z;\n\t}\n}\n\npublic class Main {\n\tstatic FastScanner scan = new FastScanner();\n\tstatic Scanner scanner = new Scanner(System.in);\n\tstatic Random rand = new Random();\n\tstatic long mod = 1000000007;\n\tstatic double eps = 1.0E-14;\n\tstatic int big = Integer.MAX_VALUE;\n\tstatic double PI = 3.141592653589793;\n\n\tstatic long modlcm(long a, long b) {\n\t\treturn a * b * modinv(GCD(a, b), mod);\n\t}\n\n\tstatic long GCD(long a, long b) {\n\t\treturn b > 0 ? GCD(b, a % b) : a;\n\t}\n\n\tstatic long lcm(long a, long b) {\n\t\treturn a * b / GCD(a, b);\n\t}\n\n\tstatic int min(int a, int b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic long factorial(int i) {\n\t\treturn i == 1 ? 1 : i * factorial(i - 1);\n\t}\n\n\tstatic int max(int... i) {\n\t\tint x = i[0];\n\t\tfor (int e : i)\n\t\t\tx = Math.max(x, e);\n\t\treturn x;\n\t}\n\n\tstatic int min(int... i) {\n\t\tint x = i[0];\n\t\tfor (int e : i)\n\t\t\tx = Math.min(x, e);\n\t\treturn x;\n\t}\n\n\tstatic long gcd(long... i) {\n\t\tlong x = i[0];\n\t\tfor (long e : i)\n\t\t\tx = GCD(x, e);\n\t\treturn x;\n\t}\n\n\tstatic long lmax(long... i) {\n\t\tlong x = i[0];\n\t\tfor (long e : i)\n\t\t\tx = Math.max(x, e);\n\t\treturn x;\n\t}\n\n\tstatic long lmin(long... i) {\n\t\tlong x = i[0];\n\t\tfor (long e : i)\n\t\t\tx = Math.min(x, e);\n\t\treturn x;\n\t}\n\n\tstatic long nCr(long n, long r, long m) {\n\t\tlong ans = 1;\n\t\tfor (long i = 0; i < r; i++) {\n\t\t\tans *= (n - i);\n\t\t\tans %= m;\n\t\t}\n\t\tfor (long i = 0; i <= r; i++) {\n\t\t\tans *= modinv(i, m);\n\t\t\tans %= mod;\n\t\t}\n\t\treturn ans;\n\t}\n\n\tstatic int lower_bound(long[] b, long cost) {\n\t\tint ok = b.length;\n\t\tint ng = -1;\n\t\twhile (Math.abs(ok - ng) > 1) {\n\t\t\tint mid = (ok + ng) / 2;\n\t\t\tif (b[mid] >= cost)\n\t\t\t\tok = mid;\n\t\t\telse\n\t\t\t\tng = mid;\n\t\t}\n\t\treturn ok;\n\t}\n\n\tstatic int upper_bound(int[] b, int cost) {\n\t\tint ok = b.length;\n\t\tint ng = -1;\n\t\twhile (Math.abs(ok - ng) > 1) {\n\t\t\tint mid = (ok + ng) / 2;\n\t\t\tif (b[mid] > cost)\n\t\t\t\tok = mid;\n\t\t\telse\n\t\t\t\tng = mid;\n\t\t}\n\t\treturn ok;\n\t}\n\n\tstatic boolean isPrime(long n) {\n\t\tif (n == 2)\n\t\t\treturn true;\n\t\tif (n < 2 || n % 2 == 0)\n\t\t\treturn false;\n\t\tdouble d = Math.sqrt(n);\n\t\tfor (int i = 3; i <= d; i += 2)\n\t\t\tif (n % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\treturn true;\n\t}\n\n\tstatic int upper_division(int a, int b) {\n\t\tif (a % b == 0) {\n\t\t\treturn a / b;\n\t\t} else {\n\t\t\treturn a / b + 1;\n\t\t}\n\t}\n\n\tstatic long lupper_division(long a, long b) {\n\t\tif (a % b == 0) {\n\t\t\treturn a / b;\n\t\t} else {\n\t\t\treturn a / b + 1;\n\t\t}\n\t}\n\n\tstatic int[] setArray(int a) {\n\t\tint b[] = new int[a];\n\t\tfor (int i = 0; i < a; i++) {\n\t\t\tb[i] = scan.nextInt();\n\t\t}\n\t\treturn b;\n\t}\n\n\tstatic long[] lsetArray(int a) {\n\t\tlong b[] = new long[a];\n\t\tfor (int i = 0; i < a; i++) {\n\t\t\tb[i] = scan.nextLong();\n\t\t}\n\t\treturn b;\n\t}\n\n\tstatic String reverse(String str) {\n\t\tchar ch[] = new char[str.length()];\n\t\tchar chch[] = str.toCharArray();\n\t\tint a = str.length();\n\t\tfor (int i = 0; i < upper_division(a, 2); i++) {\n\t\t\tch[i] = chch[ch.length - i - 1];\n\t\t\tch[ch.length - 1 - i] = chch[i];\n\t\t}\n\t\treturn String.valueOf(ch);\n\t}\n\n\tpublic static void printArray(int[] que) {\n\t\tfor (int i = 0; i < que.length - 1; i++) {\n\t\t\tSystem.out.print(que[i] + \" \");\n\t\t}\n\t\tSystem.out.println(que[que.length - 1]);\n\t}\n\n\tpublic static void lprintArray(long[] que) {\n\t\tfor (int i = 0; i < que.length - 1; i++) {\n\t\t\tSystem.out.print(que[i] + \" \");\n\t\t}\n\t\tSystem.out.println(que[que.length - 1]);\n\t}\n\n\tpublic static int[][] doublesort(int[][] a) {\n\t\tArrays.sort(a, (x, y) -> Integer.compare(x[0], y[0]));\n\t\treturn a;\n\t}\n\n\tpublic static long[][] ldoublesort(long[][] a) {\n\t\tArrays.sort(a, (x, y) -> Long.compare(x[0], y[0]));\n\t\treturn a;\n\t}\n\n\tstatic long modpow(long x, long n, long mo) {\n\t\tlong sum = 1;\n\t\twhile (n > 0) {\n\t\t\tif ((n & 1) == 1) {\n\t\t\t\tsum = sum * x % mo;\n\t\t\t}\n\t\t\tx = x * x % mo;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn sum;\n\t}\n\n\tpublic static char[] revch(char ch[]) {\n\t\tchar ret[] = new char[ch.length];\n\t\tfor (int i = ch.length - 1, j = 0; i >= 0; i--, j++) {\n\t\t\tret[j] = ch[i];\n\t\t}\n\t\treturn ret;\n\t}\n\n\tpublic static int[] revint(int ch[]) {\n\t\tint ret[] = new int[ch.length];\n\t\tfor (int i = ch.length - 1, j = 0; i >= 0; i--, j++) {\n\t\t\tret[j] = ch[i];\n\t\t}\n\t\treturn ret;\n\t}\n\n\tpublic static void warshall_floyd(long v[][]) {\n\t\tint n = v[0].length;\n\t\tfor (int k = 0; k < n; k++)\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t\t\tv[i][j] = lmin(v[i][j], v[i][k] + v[k][j]);\n\t}\n\n\tpublic static long modinv(long a, long m) {\n\t\tlong b = m, u = 1, v = 0;\n\t\twhile (b != 0) {\n\t\t\tlong t = a / b;\n\t\t\ta -= t * b;\n\t\t\tlong x = a;\n\t\t\ta = b;\n\t\t\tb = x;\n\t\t\tu -= t * v;\n\t\t\tx = u;\n\t\t\tu = v;\n\t\t\tv = x;\n\t\t}\n\t\tu %= m;\n\t\tif (u < 0)\n\t\t\tu += m;\n\t\treturn u;\n\t}\n\n\tpublic static long lmod(long i, long j) {\n\t\treturn (i % j) < 0 ? (i % j) + 0 + (j < 0 ? -j : j) : (i % j + 0);\n\t}\n\n\tpublic static int next_combination(int sub) {\n\t\tint x = sub & -sub, y = sub + x;\n\t\treturn (((sub & ~y) / x) >> 1) | y;\n\t}\n\n\tpublic static void main(String[] $) throws IOException {\n\t\tint k=scan.nextInt();\n\t\tint now=7;\n\t\tfor(int i=1;i<=k+10;i++) {\n\t\t\tif(now%k==0) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tnow*=10;\n\t\t\tnow+=7;\n\t\t\tnow%=k;\n\t\t}\n\t\tSystem.out.println(-1);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1598303335, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02596.html", "problem_id": "p02596", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02596/input.txt", "sample_output_relpath": "derived/input_output/data/p02596/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02596/Java/s383579801.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s383579801", "user_id": "u274962354"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.ArrayDeque;\nimport java.util.Arrays;\nimport java.util.Deque;\nimport java.util.NoSuchElementException;\nimport java.util.Objects;\nimport java.util.Random;\nimport java.util.Scanner;\n\nclass BIT {\n\tlong bit[] = new long[0];\n\tint N = 0;\n\n\tBIT(int n) {\n\t\tbit = new long[n + 1];\n\t\tN = n;\n\t}\n\n\tvoid add(int a, long w) {\n\t\tfor (int x = a; x < N; x += (x & -x))\n\t\t\tbit[x] += w;\n\t}\n\n\tlong sum(int a) {\n\t\tlong ret = 0;\n\t\tfor (int x = a; x > 0; x -= x & -x)\n\t\t\tret += bit[x];\n\t\treturn ret;\n\t}\n\n\tlong modsum(int a, int mod) {\n\t\tlong ret = 0;\n\t\tfor (int x = a; x > 0; x -= x & -x) {\n\t\t\tret += bit[x];\n\t\t\tret %= mod;\n\t\t}\n\t\treturn ret;\n\t}\n}\n\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tpublic char nextchar() {\n\t\treturn next().charAt(0);\n\t}\n}\n\nclass UnionFind {\n\tint Parent[];\n\n\tUnionFind(int n) {// Initialize by -1\n\t\tParent = new int[n];\n\t\tArrays.fill(Parent, -1);\n\t}\n\n\tint root(int A) {// In which tree is A?\n\t\tif (Parent[A] < 0)\n\t\t\treturn A;\n\t\treturn Parent[A] = root(Parent[A]);\n\t}\n\n\tint size(int A) {// size of tree which is include A\n\t\treturn -Parent[root(A)];\n\t}\n\n\tboolean connect(int A, int B) {// Connect A and B\n\t\tA = root(A);\n\t\tB = root(B);\n\t\tif (A == B)\n\t\t\treturn false;\n\t\tif (size(A) < size(B)) {\n\t\t\tint C = 0;\n\t\t\tC = B;\n\t\t\tB = A;\n\t\t\tA = C;\n\t\t} // SWAP\n\t\tParent[A] += Parent[B];\n\t\tParent[B] = A;\n\t\treturn true;\n\t}\n}\n\nclass Pair {\n\tpublic T first;\n\tpublic E second;\n\n\tvoid set(T x, E y) {\n\t\tfirst = x;\n\t\tsecond = y;\n\t}\n}\n\nclass Pint {\n\t@Override\n\tpublic boolean equals(Object obj) {\n\t\tif (obj instanceof Pint) {\n\t\t\tPint other = (Pint) obj;\n\t\t\treturn other.first == this.first && other.second == this.second;\n\t\t}\n\t\treturn false;\n\t}\n\n\t@Override\n\tpublic int hashCode() {\n\t\treturn Objects.hash(this.first, this.second);\n\t}\n\n\tpublic int first;\n\tpublic int second;\n\n\tPint(int x, int y) {\n\t\tfirst = x;\n\t\tsecond = y;\n\t}\n\n\tvoid set(int x, int y) {\n\t\tfirst = x;\n\t\tsecond = y;\n\t}\n}\n\nclass Tpair {\n\tpublic int first;\n\tpublic int second;\n\tpublic long third;\n\n\tTpair(int x, int y, long z) {\n\t\tfirst = x;\n\t\tsecond = y;\n\t\tthird = z;\n\t}\n\n\tvoid set(int x, int y, long z) {\n\t\tfirst = x;\n\t\tsecond = y;\n\t\tthird = z;\n\t}\n}\n\npublic class Main {\n\tstatic FastScanner scan = new FastScanner();\n\tstatic Scanner scanner = new Scanner(System.in);\n\tstatic Random rand = new Random();\n\tstatic long mod = 1000000007;\n\tstatic double eps = 1.0E-14;\n\tstatic int big = Integer.MAX_VALUE;\n\tstatic double PI = 3.141592653589793;\n\n\tstatic long modlcm(long a, long b) {\n\t\treturn a * b * modinv(GCD(a, b), mod);\n\t}\n\n\tstatic long GCD(long a, long b) {\n\t\treturn b > 0 ? GCD(b, a % b) : a;\n\t}\n\n\tstatic long lcm(long a, long b) {\n\t\treturn a * b / GCD(a, b);\n\t}\n\n\tstatic int min(int a, int b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic long factorial(int i) {\n\t\treturn i == 1 ? 1 : i * factorial(i - 1);\n\t}\n\n\tstatic int max(int... i) {\n\t\tint x = i[0];\n\t\tfor (int e : i)\n\t\t\tx = Math.max(x, e);\n\t\treturn x;\n\t}\n\n\tstatic int min(int... i) {\n\t\tint x = i[0];\n\t\tfor (int e : i)\n\t\t\tx = Math.min(x, e);\n\t\treturn x;\n\t}\n\n\tstatic long gcd(long... i) {\n\t\tlong x = i[0];\n\t\tfor (long e : i)\n\t\t\tx = GCD(x, e);\n\t\treturn x;\n\t}\n\n\tstatic long lmax(long... i) {\n\t\tlong x = i[0];\n\t\tfor (long e : i)\n\t\t\tx = Math.max(x, e);\n\t\treturn x;\n\t}\n\n\tstatic long lmin(long... i) {\n\t\tlong x = i[0];\n\t\tfor (long e : i)\n\t\t\tx = Math.min(x, e);\n\t\treturn x;\n\t}\n\n\tstatic long nCr(long n, long r, long m) {\n\t\tlong ans = 1;\n\t\tfor (long i = 0; i < r; i++) {\n\t\t\tans *= (n - i);\n\t\t\tans %= m;\n\t\t}\n\t\tfor (long i = 0; i <= r; i++) {\n\t\t\tans *= modinv(i, m);\n\t\t\tans %= mod;\n\t\t}\n\t\treturn ans;\n\t}\n\n\tstatic int lower_bound(long[] b, long cost) {\n\t\tint ok = b.length;\n\t\tint ng = -1;\n\t\twhile (Math.abs(ok - ng) > 1) {\n\t\t\tint mid = (ok + ng) / 2;\n\t\t\tif (b[mid] >= cost)\n\t\t\t\tok = mid;\n\t\t\telse\n\t\t\t\tng = mid;\n\t\t}\n\t\treturn ok;\n\t}\n\n\tstatic int upper_bound(int[] b, int cost) {\n\t\tint ok = b.length;\n\t\tint ng = -1;\n\t\twhile (Math.abs(ok - ng) > 1) {\n\t\t\tint mid = (ok + ng) / 2;\n\t\t\tif (b[mid] > cost)\n\t\t\t\tok = mid;\n\t\t\telse\n\t\t\t\tng = mid;\n\t\t}\n\t\treturn ok;\n\t}\n\n\tstatic boolean isPrime(long n) {\n\t\tif (n == 2)\n\t\t\treturn true;\n\t\tif (n < 2 || n % 2 == 0)\n\t\t\treturn false;\n\t\tdouble d = Math.sqrt(n);\n\t\tfor (int i = 3; i <= d; i += 2)\n\t\t\tif (n % i == 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\treturn true;\n\t}\n\n\tstatic int upper_division(int a, int b) {\n\t\tif (a % b == 0) {\n\t\t\treturn a / b;\n\t\t} else {\n\t\t\treturn a / b + 1;\n\t\t}\n\t}\n\n\tstatic long lupper_division(long a, long b) {\n\t\tif (a % b == 0) {\n\t\t\treturn a / b;\n\t\t} else {\n\t\t\treturn a / b + 1;\n\t\t}\n\t}\n\n\tstatic int[] setArray(int a) {\n\t\tint b[] = new int[a];\n\t\tfor (int i = 0; i < a; i++) {\n\t\t\tb[i] = scan.nextInt();\n\t\t}\n\t\treturn b;\n\t}\n\n\tstatic long[] lsetArray(int a) {\n\t\tlong b[] = new long[a];\n\t\tfor (int i = 0; i < a; i++) {\n\t\t\tb[i] = scan.nextLong();\n\t\t}\n\t\treturn b;\n\t}\n\n\tstatic String reverse(String str) {\n\t\tchar ch[] = new char[str.length()];\n\t\tchar chch[] = str.toCharArray();\n\t\tint a = str.length();\n\t\tfor (int i = 0; i < upper_division(a, 2); i++) {\n\t\t\tch[i] = chch[ch.length - i - 1];\n\t\t\tch[ch.length - 1 - i] = chch[i];\n\t\t}\n\t\treturn String.valueOf(ch);\n\t}\n\n\tpublic static void printArray(int[] que) {\n\t\tfor (int i = 0; i < que.length - 1; i++) {\n\t\t\tSystem.out.print(que[i] + \" \");\n\t\t}\n\t\tSystem.out.println(que[que.length - 1]);\n\t}\n\n\tpublic static void lprintArray(long[] que) {\n\t\tfor (int i = 0; i < que.length - 1; i++) {\n\t\t\tSystem.out.print(que[i] + \" \");\n\t\t}\n\t\tSystem.out.println(que[que.length - 1]);\n\t}\n\n\tpublic static int[][] doublesort(int[][] a) {\n\t\tArrays.sort(a, (x, y) -> Integer.compare(x[0], y[0]));\n\t\treturn a;\n\t}\n\n\tpublic static long[][] ldoublesort(long[][] a) {\n\t\tArrays.sort(a, (x, y) -> Long.compare(x[0], y[0]));\n\t\treturn a;\n\t}\n\n\tstatic long modpow(long x, long n, long mo) {\n\t\tlong sum = 1;\n\t\twhile (n > 0) {\n\t\t\tif ((n & 1) == 1) {\n\t\t\t\tsum = sum * x % mo;\n\t\t\t}\n\t\t\tx = x * x % mo;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn sum;\n\t}\n\n\tpublic static char[] revch(char ch[]) {\n\t\tchar ret[] = new char[ch.length];\n\t\tfor (int i = ch.length - 1, j = 0; i >= 0; i--, j++) {\n\t\t\tret[j] = ch[i];\n\t\t}\n\t\treturn ret;\n\t}\n\n\tpublic static int[] revint(int ch[]) {\n\t\tint ret[] = new int[ch.length];\n\t\tfor (int i = ch.length - 1, j = 0; i >= 0; i--, j++) {\n\t\t\tret[j] = ch[i];\n\t\t}\n\t\treturn ret;\n\t}\n\n\tpublic static void warshall_floyd(long v[][]) {\n\t\tint n = v[0].length;\n\t\tfor (int k = 0; k < n; k++)\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t\t\tv[i][j] = lmin(v[i][j], v[i][k] + v[k][j]);\n\t}\n\n\tpublic static long modinv(long a, long m) {\n\t\tlong b = m, u = 1, v = 0;\n\t\twhile (b != 0) {\n\t\t\tlong t = a / b;\n\t\t\ta -= t * b;\n\t\t\tlong x = a;\n\t\t\ta = b;\n\t\t\tb = x;\n\t\t\tu -= t * v;\n\t\t\tx = u;\n\t\t\tu = v;\n\t\t\tv = x;\n\t\t}\n\t\tu %= m;\n\t\tif (u < 0)\n\t\t\tu += m;\n\t\treturn u;\n\t}\n\n\tpublic static long lmod(long i, long j) {\n\t\treturn (i % j) < 0 ? (i % j) + 0 + (j < 0 ? -j : j) : (i % j + 0);\n\t}\n\n\tpublic static int next_combination(int sub) {\n\t\tint x = sub & -sub, y = sub + x;\n\t\treturn (((sub & ~y) / x) >> 1) | y;\n\t}\n\n\tpublic static void main(String[] $) throws IOException {\n\t\tint k=scan.nextInt();\n\t\tint now=7;\n\t\tfor(int i=1;i<=k+10;i++) {\n\t\t\tif(now%k==0) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tnow*=10;\n\t\t\tnow+=7;\n\t\t\tnow%=k;\n\t\t}\n\t\tSystem.out.println(-1);\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi loves the number 7 and multiples of K.\n\nWhere is the first occurrence of a multiple of K in the sequence 7,77,777,\\ldots? (Also see Output and Sample Input/Output below.)\n\nIf the sequence contains no multiples of K, print -1 instead.\n\nConstraints\n\n1 \\leq K \\leq 10^6\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint an integer representing the position of the first occurrence of a multiple of K. (For example, if the first occurrence is the fourth element of the sequence, print 4.)\n\nSample Input 1\n\n101\n\nSample Output 1\n\n4\n\nNone of 7, 77, and 777 is a multiple of 101, but 7777 is.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n-1\n\nAll elements in the sequence are odd numbers; there are no multiples of 2.\n\nSample Input 3\n\n999983\n\nSample Output 3\n\n999982", "sample_input": "101\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02596", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi loves the number 7 and multiples of K.\n\nWhere is the first occurrence of a multiple of K in the sequence 7,77,777,\\ldots? (Also see Output and Sample Input/Output below.)\n\nIf the sequence contains no multiples of K, print -1 instead.\n\nConstraints\n\n1 \\leq K \\leq 10^6\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint an integer representing the position of the first occurrence of a multiple of K. (For example, if the first occurrence is the fourth element of the sequence, print 4.)\n\nSample Input 1\n\n101\n\nSample Output 1\n\n4\n\nNone of 7, 77, and 777 is a multiple of 101, but 7777 is.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n-1\n\nAll elements in the sequence are odd numbers; there are no multiples of 2.\n\nSample Input 3\n\n999983\n\nSample Output 3\n\n999982", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8831, "cpu_time_ms": 126, "memory_kb": 35652}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s233467720", "group_id": "codeNet:p02597", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tSolution sol = new Solution();\n\t\tsol.solve(in, out);\n\t\tout.close();\n\t}\n\n\tprivate static class Solution {\n\t\tprivate void solve(InputReader in, PrintWriter out) {\n\t\t\tint n=in.ni(), ans=0;\n\t\t\tchar[] stones=in.n().toCharArray();\n\t\t\tint l=0, r=n-1;\n\t\t\twhile (l < r) {\n\t\t\t\twhile (stones[l] == 'R') l++;\n\t\t\t\twhile (stones[r] == 'W') r--;\n\t\t\t\tif (l < r) {\n\t\t\t\t\t++ans; ++l; --r;\n\t\t\t\t}\n\t\t\t}\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\n\tprivate static class InputReader {\n\t\tprivate BufferedReader reader;\n\t\tprivate StringTokenizer tokenizer;\n\n\t\tprivate InputReader(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream), 32768);\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tprivate String n() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tprivate int ni() {\n\t\t\treturn Integer.parseInt(n());\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1596422722, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02597.html", "problem_id": "p02597", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02597/input.txt", "sample_output_relpath": "derived/input_output/data/p02597/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02597/Java/s233467720.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s233467720", "user_id": "u681013601"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tSolution sol = new Solution();\n\t\tsol.solve(in, out);\n\t\tout.close();\n\t}\n\n\tprivate static class Solution {\n\t\tprivate void solve(InputReader in, PrintWriter out) {\n\t\t\tint n=in.ni(), ans=0;\n\t\t\tchar[] stones=in.n().toCharArray();\n\t\t\tint l=0, r=n-1;\n\t\t\twhile (l < r) {\n\t\t\t\twhile (stones[l] == 'R') l++;\n\t\t\t\twhile (stones[r] == 'W') r--;\n\t\t\t\tif (l < r) {\n\t\t\t\t\t++ans; ++l; --r;\n\t\t\t\t}\n\t\t\t}\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\n\tprivate static class InputReader {\n\t\tprivate BufferedReader reader;\n\t\tprivate StringTokenizer tokenizer;\n\n\t\tprivate InputReader(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream), 32768);\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tprivate String n() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tprivate int ni() {\n\t\t\treturn Integer.parseInt(n());\n\t\t}\n\t}\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAn altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \\leq i \\leq N) is given to you as a character c_i; R stands for red and W stands for white.\n\nYou can do the following two kinds of operations any number of times in any order:\n\nChoose two stones (not necessarily adjacent) and swap them.\n\nChoose one stone and change its color (from red to white and vice versa).\n\nAccording to a fortune-teller, a white stone placed to the immediate left of a red stone will bring a disaster. At least how many operations are needed to reach a situation without such a white stone?\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nc_i is R or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_{1}c_{2}...c_{N}\n\nOutput\n\nPrint an integer representing the minimum number of operations needed.\n\nSample Input 1\n\n4\nWWRR\n\nSample Output 1\n\n2\n\nFor example, the two operations below will achieve the objective.\n\nSwap the 1-st and 3-rd stones from the left, resulting in RWWR.\n\nChange the color of the 4-th stone from the left, resulting in RWWW.\n\nSample Input 2\n\n2\nRR\n\nSample Output 2\n\n0\n\nIt can be the case that no operation is needed.\n\nSample Input 3\n\n8\nWRWWRWRR\n\nSample Output 3\n\n3", "sample_input": "4\nWWRR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02597", "source_text": "Score : 400 points\n\nProblem Statement\n\nAn altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \\leq i \\leq N) is given to you as a character c_i; R stands for red and W stands for white.\n\nYou can do the following two kinds of operations any number of times in any order:\n\nChoose two stones (not necessarily adjacent) and swap them.\n\nChoose one stone and change its color (from red to white and vice versa).\n\nAccording to a fortune-teller, a white stone placed to the immediate left of a red stone will bring a disaster. At least how many operations are needed to reach a situation without such a white stone?\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nc_i is R or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_{1}c_{2}...c_{N}\n\nOutput\n\nPrint an integer representing the minimum number of operations needed.\n\nSample Input 1\n\n4\nWWRR\n\nSample Output 1\n\n2\n\nFor example, the two operations below will achieve the objective.\n\nSwap the 1-st and 3-rd stones from the left, resulting in RWWR.\n\nChange the color of the 4-th stone from the left, resulting in RWWW.\n\nSample Input 2\n\n2\nRR\n\nSample Output 2\n\n0\n\nIt can be the case that no operation is needed.\n\nSample Input 3\n\n8\nWRWWRWRR\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1445, "cpu_time_ms": 145, "memory_kb": 37276}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s007813229", "group_id": "codeNet:p02598", "input_text": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tLinkedList list = new LinkedList<>();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tlist.add(sc.nextInt());\n\t\t}\n\t\tCollections.sort(list);\n\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tint a = list.removeLast();\n\t\t\tint j = 2;\n\t\t\t//System.out.println(a);\n\t\t\tfor (;i < K-1; j++) {\n\t\t\t\tif (a/j < list.getLast() || a/(j+1) > list.getLast()) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tint aa = a;\n\t\t\tfor (int k = 0; k < j-1; k++) {\n\t\t\t\tlist.add(a/j);\n\t\t\t\taa -= a/j;\n\t\t\t}\n\t\t\tlist.add(aa);\n\t\t\tCollections.sort(list);\n\t\t}\n\t\tSystem.out.println(list.getLast());\n\t}\n}", "language": "Java", "metadata": {"date": 1596422365, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02598.html", "problem_id": "p02598", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02598/input.txt", "sample_output_relpath": "derived/input_output/data/p02598/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02598/Java/s007813229.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s007813229", "user_id": "u642105898"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tLinkedList list = new LinkedList<>();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tlist.add(sc.nextInt());\n\t\t}\n\t\tCollections.sort(list);\n\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tint a = list.removeLast();\n\t\t\tint j = 2;\n\t\t\t//System.out.println(a);\n\t\t\tfor (;i < K-1; j++) {\n\t\t\t\tif (a/j < list.getLast() || a/(j+1) > list.getLast()) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tint aa = a;\n\t\t\tfor (int k = 0; k < j-1; k++) {\n\t\t\t\tlist.add(a/j);\n\t\t\t\taa -= a/j;\n\t\t\t}\n\t\t\tlist.add(aa);\n\t\t\tCollections.sort(list);\n\t\t}\n\t\tSystem.out.println(list.getLast());\n\t}\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N logs of lengths A_1,A_2,\\cdots A_N.\n\nWe can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0= 1800) out.println(\"1\");\n else if (t >= 1600) out.println(\"2\");\n else if (t >= 1400) out.println(\"3\");\n else if (t >= 1200) out.println(\"4\");\n else if (t >= 1000) out.println(\"5\");\n else if (t >= 800) out.println(\"6\");\n else if (t >= 600) out.println(\"7\");\n else out.println(\"8\");\n //Solution end\n out.close();\n }\n\n\n //-----------PrintWriter for faster output---------------------------------\n public static PrintWriter out;\n\n //-----------MyScanner class for faster input----------\n public static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n }\n //--------------------------------------------------------\n}\n", "language": "Java", "metadata": {"date": 1595725457, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Java/s009382866.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s009382866", "user_id": "u701063973"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n MyScanner scn = new MyScanner();\n out = new PrintWriter(new BufferedOutputStream(System.out));\n // Solution Start\n int t = scn.nextInt();\n if (t >= 1800) out.println(\"1\");\n else if (t >= 1600) out.println(\"2\");\n else if (t >= 1400) out.println(\"3\");\n else if (t >= 1200) out.println(\"4\");\n else if (t >= 1000) out.println(\"5\");\n else if (t >= 800) out.println(\"6\");\n else if (t >= 600) out.println(\"7\");\n else out.println(\"8\");\n //Solution end\n out.close();\n }\n\n\n //-----------PrintWriter for faster output---------------------------------\n public static PrintWriter out;\n\n //-----------MyScanner class for faster input----------\n public static class MyScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String next() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n\n }\n //--------------------------------------------------------\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1976, "cpu_time_ms": 91, "memory_kb": 32932}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s174219144", "group_id": "codeNet:p02600", "input_text": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n\tstatic final int INF = (int) (1e9 + 10);\n\tstatic final long MOD = (int) (1e9 + 7);\n\tstatic final int N = (int) (4e5 + 5);\n\t// static ArrayList[] graph;\n\t// static boolean visited[];\n\t// static long size[];\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tFastReader sc = new FastReader();\n\t\tPrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t// Scanner scn = new Scanner(System.in);\n\t\t//\n\t\tint x=sc.nextInt();\n\t\tif(x<600)\n\t\t\tpr.println(\"8\");\n\t\telse if(x<800)\n\t\t\tpr.println(\"7\");\n\t\telse if(x<1000)\n\t\t\tpr.println(\"6\");\n\t\t\n\t\telse if(x<1200)\n\t\t\tpr.println(\"5\");\n\t\telse if(x<1400)\n\t\t\tpr.println(\"4\");\n\t\telse if(x<1600)\n\t\t\tpr.println(\"3\");\n\t\telse if(x<1800)\n\t\t\tpr.println(\"2\");\n\t\telse\n\t\t\tpr.println(\"1\");\n\t\t//\n\t\t// Coded to Perfection by Rohan Mukhija\n\n\t\tpr.flush();\n\t\tpr.close();\n\n\t}\n\n\t/*\n\t * Template From Here\n\t */\n\tprivate static boolean possible(long[] arr, long mid, long k, long t) {\n\t\tlong c = 1;\n\t\tlong tot = 0;\n\t\tfor (int i = 0; i < arr.length; i++) {\n\t\t\ttot += (arr[i]);\n\t\t\tif (tot > mid) {\n\t\t\t\ttot = arr[i];\n\t\t\t\tc++;\n\t\t\t}\n\t\t}\n\t\t// System.out.println(mid+\" \"+c);\n\t\tif (c <= k)\n\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tpublic static class Pair implements Comparable {\n\t\tint u;\n\t\tint v;\n\n\t\tPair(int u, int v) {\n\t\t\tthis.u = u;\n\t\t\tthis.v = v;\n\n\t\t}\n\n\t\tpublic int compareTo(Pair compareEdge) {\n\t\t\treturn Long.compare(this.v, compareEdge.v);\n\t\t}\n\t};\n\n\tstatic void sort(long[] a) {\n\t\tArrayList l = new ArrayList<>();\n\t\tfor (long i : a)\n\t\t\tl.add(i);\n\t\tCollections.sort(l);\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ta[i] = l.get(i);\n\t}\n\n\tstatic void sort(int[] a) {\n\t\tArrayList l = new ArrayList<>();\n\t\tfor (int i : a)\n\t\t\tl.add(i);\n\t\tCollections.sort(l);\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ta[i] = l.get(i);\n\t}\n\n\tpublic static int lowerBound(ArrayList array, int length, long value) {\n\t\tint low = 0;\n\t\tint high = length;\n\t\twhile (low < high) {\n\t\t\tfinal int mid = (low + high) / 2;\n\t\t\tif (value <= array.get(mid)) {\n\t\t\t\thigh = mid;\n\t\t\t} else {\n\t\t\t\tlow = mid + 1;\n\t\t\t}\n\t\t}\n\t\treturn low;\n\t}\n\n\tpublic static long mul(long a, long b) {\n\t\treturn (a * b) % MOD;\n\t}\n\n\tstatic class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\t}\n\n\tstatic long gcd(long a, long b) {\n\t\tif (a == 0)\n\t\t\treturn b;\n\t\treturn gcd(b % a, a);\n\t}\n\n\tstatic long lcm(long a, long b) {\n\t\treturn (a * b) / gcd(a, b);\n\t}\n\n\tpublic static void sortbyColumn(int[][] att, int col) {\n\t\t// Using built-in sort function Arrays.sort\n\t\tArrays.sort(att, new Comparator() {\n\n\t\t\t@Override\n\t\t\t// Compare values according to columns\n\t\t\tpublic int compare(final int[] entry1, final int[] entry2) {\n\n\t\t\t\t// To sort in descending order revert\n\t\t\t\t// the '>' Operator\n\t\t\t\t// if (entry1[col] > entry2[col])\n\t\t\t\t// return 1;\n\t\t\t\t// else //(entry1[col] >= entry2[col])\n\t\t\t\t// return -1;\n\t\t\t\treturn new Integer(entry1[col]).compareTo(entry2[col]);\n\t\t\t\t// return entry1[col].\n\t\t\t}\n\t\t}); // End of function call sort().\n\t}\n\n\tpublic static void sortbyColumn(double[][] att, int col) {\n\t\t// Using built-in sort function Arrays.sort\n\t\tArrays.sort(att, new Comparator() {\n\n\t\t\t@Override\n\t\t\t// Compare values according to columns\n\t\t\tpublic int compare(final double[] entry1, final double[] entry2) {\n\n\t\t\t\t// To sort in descending order revert\n\t\t\t\t// the '>' Operator\n\t\t\t\t// if (entry1[col] > entry2[col])\n\t\t\t\t// return 1;\n\t\t\t\t// else //(entry1[col] >= entry2[col])\n\t\t\t\t// return -1;\n\t\t\t\treturn new Double(entry1[col]).compareTo(entry2[col]);\n\t\t\t\t// return entry1[col].\n\t\t\t}\n\t\t}); // End of function call sort().\n\t}\n\n\tstatic class pair {\n\t\tint V, I;\n\n\t\tpair(int v, int i) {\n\t\t\tV = v;\n\t\t\tI = i;\n\t\t}\n\t}\n\n\tpublic static int[] swap(int data[], int left, int right) {\n\t\tint temp = data[left];\n\t\tdata[left] = data[right];\n\t\tdata[right] = temp;\n\t\treturn data;\n\t}\n\n\tpublic static int[] reverse(int data[], int left, int right) {\n\t\twhile (left < right) {\n\t\t\tint temp = data[left];\n\t\t\tdata[left++] = data[right];\n\t\t\tdata[right--] = temp;\n\t\t}\n\t\treturn data;\n\t}\n\n\tpublic static boolean findNextPermutation(int data[]) {\n\t\tif (data.length <= 1)\n\t\t\treturn false;\n\n\t\tint last = data.length - 2;\n\t\twhile (last >= 0) {\n\t\t\tif (data[last] < data[last + 1]) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tlast--;\n\t\t}\n\t\tif (last < 0)\n\t\t\treturn false;\n\n\t\tint nextGreater = data.length - 1;\n\t\tfor (int i = data.length - 1; i > last; i--) {\n\t\t\tif (data[i] > data[last]) {\n\t\t\t\tnextGreater = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tdata = swap(data, nextGreater, last);\n\t\tdata = reverse(data, last + 1, data.length - 1);\n\t\treturn true;\n\t}\n\n\tstatic long ncr(long a, long b) {\n\t\tif (b > a - b)\n\t\t\treturn ncr(a, a - b);\n\t\tlong ansMul = 1;\n\t\tlong ansDiv = 1;\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\tansMul *= (a - i);\n\t\t\tansDiv *= (i + 1);\n\t\t\tansMul %= MOD;\n\t\t\tansDiv %= MOD;\n\t\t}\n\n\t\tlong ans = ansMul * power(ansDiv, MOD - 2, MOD) % MOD;\n\n\t\treturn ans;\n\t}\n\n\tstatic long __gcd(long n1, long n2) {\n\t\tlong gcd = 1;\n\n\t\tfor (int i = 1; i <= n1 && i <= n2; ++i) {\n\t\t\t// Checks if i is factor of both integers\n\t\t\tif (n1 % i == 0 && n2 % i == 0) {\n\t\t\t\tgcd = i;\n\t\t\t}\n\t\t}\n\t\treturn gcd;\n\t}\n\n\tstatic long power(long prev, long n2, long mod2) {\n\t\tlong res = 1;\n\n\t\tprev = prev % mod2;\n\n\t\tif (prev == 0)\n\t\t\treturn 0;\n\t\twhile (n2 > 0) {\n\n\t\t\tif ((n2 & 1) == 1)\n\t\t\t\tres = (res * prev) % mod2;\n\n\t\t\tn2 = n2 >> 1;\n\t\t\tprev = (prev * prev) % mod2;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic long modInverse(long fac2, int p) {\n\t\treturn power(fac2, p - 2, p);\n\t}\n\n\tstatic boolean isPrime(int n) {\n\t\t// Corner cases\n\t\tif (n <= 1)\n\t\t\treturn false;\n\t\tif (n <= 3)\n\t\t\treturn true;\n\n\t\t// This is checked so that we can skip\n\t\t// middle five numbers in below loop\n\t\tif (n % 2 == 0 || n % 3 == 0)\n\t\t\treturn false;\n\n\t\tfor (int i = 5; i * i <= n; i = i + 6)\n\t\t\tif (n % i == 0 || n % (i + 2) == 0)\n\t\t\t\treturn false;\n\n\t\treturn true;\n\t}\n\n\tpublic static BigInteger lcmm(String a, String b) {\n\t\tBigInteger s = new BigInteger(a);\n\t\tBigInteger s1 = new BigInteger(b);\n\t\tBigInteger mul = s.multiply(s1);\n\t\tBigInteger gcd = s.gcd(s1);\n\t\tBigInteger lcm = mul.divide(gcd);\n\t\treturn lcm;\n\t}\n\t/*\n\t * static boolean prime[] = new boolean[10000007]; static int spf[] = new\n\t * int[10000007];\n\t * \n\t * public static void sieveOfEratosthenes(int n) { for (int i = 2; i < n;\n\t * i++) prime[i] = true; for (int p = 2; p * p <= n; p++) {\n\t * \n\t * if (prime[p] == true) {\n\t * \n\t * for (int i = p * p; i <= n; i += p) { prime[i] = false; spf[i] = p; } } }\n\t * }\n\t */\n}\n", "language": "Java", "metadata": {"date": 1595725383, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Java/s174219144.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s174219144", "user_id": "u225470629"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n\tstatic final int INF = (int) (1e9 + 10);\n\tstatic final long MOD = (int) (1e9 + 7);\n\tstatic final int N = (int) (4e5 + 5);\n\t// static ArrayList[] graph;\n\t// static boolean visited[];\n\t// static long size[];\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tFastReader sc = new FastReader();\n\t\tPrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t// Scanner scn = new Scanner(System.in);\n\t\t//\n\t\tint x=sc.nextInt();\n\t\tif(x<600)\n\t\t\tpr.println(\"8\");\n\t\telse if(x<800)\n\t\t\tpr.println(\"7\");\n\t\telse if(x<1000)\n\t\t\tpr.println(\"6\");\n\t\t\n\t\telse if(x<1200)\n\t\t\tpr.println(\"5\");\n\t\telse if(x<1400)\n\t\t\tpr.println(\"4\");\n\t\telse if(x<1600)\n\t\t\tpr.println(\"3\");\n\t\telse if(x<1800)\n\t\t\tpr.println(\"2\");\n\t\telse\n\t\t\tpr.println(\"1\");\n\t\t//\n\t\t// Coded to Perfection by Rohan Mukhija\n\n\t\tpr.flush();\n\t\tpr.close();\n\n\t}\n\n\t/*\n\t * Template From Here\n\t */\n\tprivate static boolean possible(long[] arr, long mid, long k, long t) {\n\t\tlong c = 1;\n\t\tlong tot = 0;\n\t\tfor (int i = 0; i < arr.length; i++) {\n\t\t\ttot += (arr[i]);\n\t\t\tif (tot > mid) {\n\t\t\t\ttot = arr[i];\n\t\t\t\tc++;\n\t\t\t}\n\t\t}\n\t\t// System.out.println(mid+\" \"+c);\n\t\tif (c <= k)\n\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tpublic static class Pair implements Comparable {\n\t\tint u;\n\t\tint v;\n\n\t\tPair(int u, int v) {\n\t\t\tthis.u = u;\n\t\t\tthis.v = v;\n\n\t\t}\n\n\t\tpublic int compareTo(Pair compareEdge) {\n\t\t\treturn Long.compare(this.v, compareEdge.v);\n\t\t}\n\t};\n\n\tstatic void sort(long[] a) {\n\t\tArrayList l = new ArrayList<>();\n\t\tfor (long i : a)\n\t\t\tl.add(i);\n\t\tCollections.sort(l);\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ta[i] = l.get(i);\n\t}\n\n\tstatic void sort(int[] a) {\n\t\tArrayList l = new ArrayList<>();\n\t\tfor (int i : a)\n\t\t\tl.add(i);\n\t\tCollections.sort(l);\n\t\tfor (int i = 0; i < a.length; i++)\n\t\t\ta[i] = l.get(i);\n\t}\n\n\tpublic static int lowerBound(ArrayList array, int length, long value) {\n\t\tint low = 0;\n\t\tint high = length;\n\t\twhile (low < high) {\n\t\t\tfinal int mid = (low + high) / 2;\n\t\t\tif (value <= array.get(mid)) {\n\t\t\t\thigh = mid;\n\t\t\t} else {\n\t\t\t\tlow = mid + 1;\n\t\t\t}\n\t\t}\n\t\treturn low;\n\t}\n\n\tpublic static long mul(long a, long b) {\n\t\treturn (a * b) % MOD;\n\t}\n\n\tstatic class FastReader {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\n\t\tpublic FastReader() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tString next() {\n\t\t\twhile (st == null || !st.hasMoreElements()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tString str = \"\";\n\t\t\ttry {\n\t\t\t\tstr = br.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\t}\n\n\tstatic long gcd(long a, long b) {\n\t\tif (a == 0)\n\t\t\treturn b;\n\t\treturn gcd(b % a, a);\n\t}\n\n\tstatic long lcm(long a, long b) {\n\t\treturn (a * b) / gcd(a, b);\n\t}\n\n\tpublic static void sortbyColumn(int[][] att, int col) {\n\t\t// Using built-in sort function Arrays.sort\n\t\tArrays.sort(att, new Comparator() {\n\n\t\t\t@Override\n\t\t\t// Compare values according to columns\n\t\t\tpublic int compare(final int[] entry1, final int[] entry2) {\n\n\t\t\t\t// To sort in descending order revert\n\t\t\t\t// the '>' Operator\n\t\t\t\t// if (entry1[col] > entry2[col])\n\t\t\t\t// return 1;\n\t\t\t\t// else //(entry1[col] >= entry2[col])\n\t\t\t\t// return -1;\n\t\t\t\treturn new Integer(entry1[col]).compareTo(entry2[col]);\n\t\t\t\t// return entry1[col].\n\t\t\t}\n\t\t}); // End of function call sort().\n\t}\n\n\tpublic static void sortbyColumn(double[][] att, int col) {\n\t\t// Using built-in sort function Arrays.sort\n\t\tArrays.sort(att, new Comparator() {\n\n\t\t\t@Override\n\t\t\t// Compare values according to columns\n\t\t\tpublic int compare(final double[] entry1, final double[] entry2) {\n\n\t\t\t\t// To sort in descending order revert\n\t\t\t\t// the '>' Operator\n\t\t\t\t// if (entry1[col] > entry2[col])\n\t\t\t\t// return 1;\n\t\t\t\t// else //(entry1[col] >= entry2[col])\n\t\t\t\t// return -1;\n\t\t\t\treturn new Double(entry1[col]).compareTo(entry2[col]);\n\t\t\t\t// return entry1[col].\n\t\t\t}\n\t\t}); // End of function call sort().\n\t}\n\n\tstatic class pair {\n\t\tint V, I;\n\n\t\tpair(int v, int i) {\n\t\t\tV = v;\n\t\t\tI = i;\n\t\t}\n\t}\n\n\tpublic static int[] swap(int data[], int left, int right) {\n\t\tint temp = data[left];\n\t\tdata[left] = data[right];\n\t\tdata[right] = temp;\n\t\treturn data;\n\t}\n\n\tpublic static int[] reverse(int data[], int left, int right) {\n\t\twhile (left < right) {\n\t\t\tint temp = data[left];\n\t\t\tdata[left++] = data[right];\n\t\t\tdata[right--] = temp;\n\t\t}\n\t\treturn data;\n\t}\n\n\tpublic static boolean findNextPermutation(int data[]) {\n\t\tif (data.length <= 1)\n\t\t\treturn false;\n\n\t\tint last = data.length - 2;\n\t\twhile (last >= 0) {\n\t\t\tif (data[last] < data[last + 1]) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tlast--;\n\t\t}\n\t\tif (last < 0)\n\t\t\treturn false;\n\n\t\tint nextGreater = data.length - 1;\n\t\tfor (int i = data.length - 1; i > last; i--) {\n\t\t\tif (data[i] > data[last]) {\n\t\t\t\tnextGreater = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tdata = swap(data, nextGreater, last);\n\t\tdata = reverse(data, last + 1, data.length - 1);\n\t\treturn true;\n\t}\n\n\tstatic long ncr(long a, long b) {\n\t\tif (b > a - b)\n\t\t\treturn ncr(a, a - b);\n\t\tlong ansMul = 1;\n\t\tlong ansDiv = 1;\n\t\tfor (int i = 0; i < b; i++) {\n\t\t\tansMul *= (a - i);\n\t\t\tansDiv *= (i + 1);\n\t\t\tansMul %= MOD;\n\t\t\tansDiv %= MOD;\n\t\t}\n\n\t\tlong ans = ansMul * power(ansDiv, MOD - 2, MOD) % MOD;\n\n\t\treturn ans;\n\t}\n\n\tstatic long __gcd(long n1, long n2) {\n\t\tlong gcd = 1;\n\n\t\tfor (int i = 1; i <= n1 && i <= n2; ++i) {\n\t\t\t// Checks if i is factor of both integers\n\t\t\tif (n1 % i == 0 && n2 % i == 0) {\n\t\t\t\tgcd = i;\n\t\t\t}\n\t\t}\n\t\treturn gcd;\n\t}\n\n\tstatic long power(long prev, long n2, long mod2) {\n\t\tlong res = 1;\n\n\t\tprev = prev % mod2;\n\n\t\tif (prev == 0)\n\t\t\treturn 0;\n\t\twhile (n2 > 0) {\n\n\t\t\tif ((n2 & 1) == 1)\n\t\t\t\tres = (res * prev) % mod2;\n\n\t\t\tn2 = n2 >> 1;\n\t\t\tprev = (prev * prev) % mod2;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic long modInverse(long fac2, int p) {\n\t\treturn power(fac2, p - 2, p);\n\t}\n\n\tstatic boolean isPrime(int n) {\n\t\t// Corner cases\n\t\tif (n <= 1)\n\t\t\treturn false;\n\t\tif (n <= 3)\n\t\t\treturn true;\n\n\t\t// This is checked so that we can skip\n\t\t// middle five numbers in below loop\n\t\tif (n % 2 == 0 || n % 3 == 0)\n\t\t\treturn false;\n\n\t\tfor (int i = 5; i * i <= n; i = i + 6)\n\t\t\tif (n % i == 0 || n % (i + 2) == 0)\n\t\t\t\treturn false;\n\n\t\treturn true;\n\t}\n\n\tpublic static BigInteger lcmm(String a, String b) {\n\t\tBigInteger s = new BigInteger(a);\n\t\tBigInteger s1 = new BigInteger(b);\n\t\tBigInteger mul = s.multiply(s1);\n\t\tBigInteger gcd = s.gcd(s1);\n\t\tBigInteger lcm = mul.divide(gcd);\n\t\treturn lcm;\n\t}\n\t/*\n\t * static boolean prime[] = new boolean[10000007]; static int spf[] = new\n\t * int[10000007];\n\t * \n\t * public static void sieveOfEratosthenes(int n) { for (int i = 2; i < n;\n\t * i++) prime[i] = true; for (int p = 2; p * p <= n; p++) {\n\t * \n\t * if (prime[p] == true) {\n\t * \n\t * for (int i = p * p; i <= n; i += p) { prime[i] = false; spf[i] = p; } } }\n\t * }\n\t */\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7470, "cpu_time_ms": 92, "memory_kb": 33224}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s215034270", "group_id": "codeNet:p02601", "input_text": "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner scan = new Scanner(System.in);\n\t\tint a = scan.nextInt(); //red\n\t\tint b = scan.nextInt(); //green\n\t\tint c = scan.nextInt(); //blue\n\t\tint k = scan.nextInt();\n\n\t\tfor(int i = 1; i <= k; i++) {\n\t\t\tif(a > b || a == b) {\n\t\t\t\tb = 2 * b;\n\t\t\t\tk = k - 1;\n\t\t\t}\n\n\t\t}\n\n\n\n\t if(k != 0) {\n\t\t\tfor(int j =\n\t\t\t\t\t0; j < k; j++) {\n\t\t\t\tif(b > c || b == c) {\n\t\t\t\t\tc = 2 * c;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(a < b && b < c) {\n\t\t\tSystem.out.println(\"Yes\");\n\n\t\t}else {\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1595731026, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02601.html", "problem_id": "p02601", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02601/input.txt", "sample_output_relpath": "derived/input_output/data/p02601/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02601/Java/s215034270.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s215034270", "user_id": "u125155118"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner scan = new Scanner(System.in);\n\t\tint a = scan.nextInt(); //red\n\t\tint b = scan.nextInt(); //green\n\t\tint c = scan.nextInt(); //blue\n\t\tint k = scan.nextInt();\n\n\t\tfor(int i = 1; i <= k; i++) {\n\t\t\tif(a > b || a == b) {\n\t\t\t\tb = 2 * b;\n\t\t\t\tk = k - 1;\n\t\t\t}\n\n\t\t}\n\n\n\n\t if(k != 0) {\n\t\t\tfor(int j =\n\t\t\t\t\t0; j < k; j++) {\n\t\t\t\tif(b > c || b == c) {\n\t\t\t\t\tc = 2 * c;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(a < b && b < c) {\n\t\t\tSystem.out.println(\"Yes\");\n\n\t\t}else {\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nM-kun has the following three cards:\n\nA red card with the integer A.\n\nA green card with the integer B.\n\nA blue card with the integer C.\n\nHe is a genius magician who can do the following operation at most K times:\n\nChoose one of the three cards and multiply the written integer by 2.\n\nHis magic is successful if both of the following conditions are satisfied after the operations:\n\nThe integer on the green card is strictly greater than the integer on the red card.\n\nThe integer on the blue card is strictly greater than the integer on the green card.\n\nDetermine whether the magic can be successful.\n\nConstraints\n\n1 \\leq A, B, C \\leq 7\n\n1 \\leq K \\leq 7\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nIf the magic can be successful, print Yes; otherwise, print No.\n\nSample Input 1\n\n7 2 5\n3\n\nSample Output 1\n\nYes\n\nThe magic will be successful if, for example, he does the following operations:\n\nFirst, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.\n\nSecond, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.\n\nThird, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.\n\nSample Input 2\n\n7 4 2\n3\n\nSample Output 2\n\nNo\n\nHe has no way to succeed in the magic with at most three operations.", "sample_input": "7 2 5\n3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02601", "source_text": "Score: 200 points\n\nProblem Statement\n\nM-kun has the following three cards:\n\nA red card with the integer A.\n\nA green card with the integer B.\n\nA blue card with the integer C.\n\nHe is a genius magician who can do the following operation at most K times:\n\nChoose one of the three cards and multiply the written integer by 2.\n\nHis magic is successful if both of the following conditions are satisfied after the operations:\n\nThe integer on the green card is strictly greater than the integer on the red card.\n\nThe integer on the blue card is strictly greater than the integer on the green card.\n\nDetermine whether the magic can be successful.\n\nConstraints\n\n1 \\leq A, B, C \\leq 7\n\n1 \\leq K \\leq 7\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nIf the magic can be successful, print Yes; otherwise, print No.\n\nSample Input 1\n\n7 2 5\n3\n\nSample Output 1\n\nYes\n\nThe magic will be successful if, for example, he does the following operations:\n\nFirst, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.\n\nSecond, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.\n\nThird, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.\n\nSample Input 2\n\n7 4 2\n3\n\nSample Output 2\n\nNo\n\nHe has no way to succeed in the magic with at most three operations.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 627, "cpu_time_ms": 122, "memory_kb": 35572}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s219255768", "group_id": "codeNet:p02601", "input_text": "import java.util.Scanner;\n\npublic class Main {\n static Scanner stdIn = new Scanner(System.in);\n public static void main(String[] args){\n int a = stdIn.nextInt();\n int b = stdIn.nextInt();\n int c = stdIn.nextInt();\n int k = stdIn.nextInt();\n\n for(int i=0; ib) {\n b*=2;\n } else if (b>c) {\n c*=2;\n }\n if(ab) {\n b*=2;\n } else if (b>c) {\n c*=2;\n }\n if(a= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1595725700, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02601.html", "problem_id": "p02601", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02601/input.txt", "sample_output_relpath": "derived/input_output/data/p02601/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02601/Java/s761409762.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s761409762", "user_id": "u768031280"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author New User\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n BMagic2 solver = new BMagic2();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class BMagic2 {\n public void solve(int testNumber, InputReader c, OutputWriter w) {\n int a = c.readInt(), b = c.readInt(), cc = c.readInt();\n\n int k = c.readInt();\n int res = 0;\n while (b <= a) {\n res++;\n b *= 2;\n }\n\n while (cc <= b) {\n res++;\n cc *= 2;\n }\n if (res <= k) {\n w.printLine(\"Yes\");\n } else {\n w.printLine(\"No\");\n }\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void printLine(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nM-kun has the following three cards:\n\nA red card with the integer A.\n\nA green card with the integer B.\n\nA blue card with the integer C.\n\nHe is a genius magician who can do the following operation at most K times:\n\nChoose one of the three cards and multiply the written integer by 2.\n\nHis magic is successful if both of the following conditions are satisfied after the operations:\n\nThe integer on the green card is strictly greater than the integer on the red card.\n\nThe integer on the blue card is strictly greater than the integer on the green card.\n\nDetermine whether the magic can be successful.\n\nConstraints\n\n1 \\leq A, B, C \\leq 7\n\n1 \\leq K \\leq 7\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nIf the magic can be successful, print Yes; otherwise, print No.\n\nSample Input 1\n\n7 2 5\n3\n\nSample Output 1\n\nYes\n\nThe magic will be successful if, for example, he does the following operations:\n\nFirst, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.\n\nSecond, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.\n\nThird, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.\n\nSample Input 2\n\n7 4 2\n3\n\nSample Output 2\n\nNo\n\nHe has no way to succeed in the magic with at most three operations.", "sample_input": "7 2 5\n3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02601", "source_text": "Score: 200 points\n\nProblem Statement\n\nM-kun has the following three cards:\n\nA red card with the integer A.\n\nA green card with the integer B.\n\nA blue card with the integer C.\n\nHe is a genius magician who can do the following operation at most K times:\n\nChoose one of the three cards and multiply the written integer by 2.\n\nHis magic is successful if both of the following conditions are satisfied after the operations:\n\nThe integer on the green card is strictly greater than the integer on the red card.\n\nThe integer on the blue card is strictly greater than the integer on the green card.\n\nDetermine whether the magic can be successful.\n\nConstraints\n\n1 \\leq A, B, C \\leq 7\n\n1 \\leq K \\leq 7\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nIf the magic can be successful, print Yes; otherwise, print No.\n\nSample Input 1\n\n7 2 5\n3\n\nSample Output 1\n\nYes\n\nThe magic will be successful if, for example, he does the following operations:\n\nFirst, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.\n\nSecond, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.\n\nThird, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.\n\nSample Input 2\n\n7 4 2\n3\n\nSample Output 2\n\nNo\n\nHe has no way to succeed in the magic with at most three operations.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4031, "cpu_time_ms": 89, "memory_kb": 32420}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s783010299", "group_id": "codeNet:p02601", "input_text": "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tfor(int i = 0; i <= K; i++) {\n\t\t\tfor(int j = 0; j <= K - i; j++) {\n\t\t\t\tif(A < B * Math.pow(2, i) && B * Math.pow(2, i) < C * Math.pow(2, j)) {\n\t\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"No\");\n\t}\n\n}", "language": "Java", "metadata": {"date": 1595725525, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02601.html", "problem_id": "p02601", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02601/input.txt", "sample_output_relpath": "derived/input_output/data/p02601/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02601/Java/s783010299.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s783010299", "user_id": "u912599273"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tfor(int i = 0; i <= K; i++) {\n\t\t\tfor(int j = 0; j <= K - i; j++) {\n\t\t\t\tif(A < B * Math.pow(2, i) && B * Math.pow(2, i) < C * Math.pow(2, j)) {\n\t\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"No\");\n\t}\n\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nM-kun has the following three cards:\n\nA red card with the integer A.\n\nA green card with the integer B.\n\nA blue card with the integer C.\n\nHe is a genius magician who can do the following operation at most K times:\n\nChoose one of the three cards and multiply the written integer by 2.\n\nHis magic is successful if both of the following conditions are satisfied after the operations:\n\nThe integer on the green card is strictly greater than the integer on the red card.\n\nThe integer on the blue card is strictly greater than the integer on the green card.\n\nDetermine whether the magic can be successful.\n\nConstraints\n\n1 \\leq A, B, C \\leq 7\n\n1 \\leq K \\leq 7\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nIf the magic can be successful, print Yes; otherwise, print No.\n\nSample Input 1\n\n7 2 5\n3\n\nSample Output 1\n\nYes\n\nThe magic will be successful if, for example, he does the following operations:\n\nFirst, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.\n\nSecond, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.\n\nThird, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.\n\nSample Input 2\n\n7 4 2\n3\n\nSample Output 2\n\nNo\n\nHe has no way to succeed in the magic with at most three operations.", "sample_input": "7 2 5\n3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02601", "source_text": "Score: 200 points\n\nProblem Statement\n\nM-kun has the following three cards:\n\nA red card with the integer A.\n\nA green card with the integer B.\n\nA blue card with the integer C.\n\nHe is a genius magician who can do the following operation at most K times:\n\nChoose one of the three cards and multiply the written integer by 2.\n\nHis magic is successful if both of the following conditions are satisfied after the operations:\n\nThe integer on the green card is strictly greater than the integer on the red card.\n\nThe integer on the blue card is strictly greater than the integer on the green card.\n\nDetermine whether the magic can be successful.\n\nConstraints\n\n1 \\leq A, B, C \\leq 7\n\n1 \\leq K \\leq 7\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nIf the magic can be successful, print Yes; otherwise, print No.\n\nSample Input 1\n\n7 2 5\n3\n\nSample Output 1\n\nYes\n\nThe magic will be successful if, for example, he does the following operations:\n\nFirst, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.\n\nSecond, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.\n\nThird, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.\n\nSample Input 2\n\n7 4 2\n3\n\nSample Output 2\n\nNo\n\nHe has no way to succeed in the magic with at most three operations.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 456, "cpu_time_ms": 158, "memory_kb": 35696}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s230081431", "group_id": "codeNet:p02602", "input_text": "\nimport java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\npublic class Main{\n\tstatic BufferedReader br;\n\tstatic int in() throws Exception\n\t{\n\t\treturn Integer.valueOf(br.readLine());\n\t}\n\tstatic int[] split() throws Exception\n\t{\n\t\tString[] cmd=br.readLine().split(\" \");\n\t\tint[] ans=new int[cmd.length];\n\t\tfor(int i=0;iarr[i-k])\n \t\tSystem.out.println(\"Yes\");\n \telse\n \t\tSystem.out.println(\"No\");\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1595726432, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02602.html", "problem_id": "p02602", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02602/input.txt", "sample_output_relpath": "derived/input_output/data/p02602/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02602/Java/s230081431.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s230081431", "user_id": "u424457386"}, "prompt_components": {"gold_output": "Yes\nNo\n", "input_to_evaluate": "\nimport java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\npublic class Main{\n\tstatic BufferedReader br;\n\tstatic int in() throws Exception\n\t{\n\t\treturn Integer.valueOf(br.readLine());\n\t}\n\tstatic int[] split() throws Exception\n\t{\n\t\tString[] cmd=br.readLine().split(\" \");\n\t\tint[] ans=new int[cmd.length];\n\t\tfor(int i=0;iarr[i-k])\n \t\tSystem.out.println(\"Yes\");\n \telse\n \t\tSystem.out.println(\"No\");\n }\n }\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "sample_input": "5 3\n96 98 95 100 20\n"}, "reference_outputs": ["Yes\nNo\n"], "source_document_id": "p02602", "source_text": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 981, "cpu_time_ms": 1027, "memory_kb": 65068}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s355780006", "group_id": "codeNet:p02606", "input_text": "import java.util.*;\n\npublic class Main {\n\n private static void solve(int L, int R, int d) {\n int res = 0;\n for (int i = L; i <= R; i++) {\n if (i % d == 0) {\n res++;\n }\n }\n System.out.println(res);\n }\n\n public static void main(String[] args) {\n int L = scanner.nextInt();\n int R = scanner.nextInt();\n int d = scanner.nextInt();\n solve(L, R, d);\n }\n\n private static final Scanner scanner = new Scanner(System.in);\n}\n", "language": "Java", "metadata": {"date": 1594516250, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02606.html", "problem_id": "p02606", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02606/input.txt", "sample_output_relpath": "derived/input_output/data/p02606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02606/Java/s355780006.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s355780006", "user_id": "u486475063"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n private static void solve(int L, int R, int d) {\n int res = 0;\n for (int i = L; i <= R; i++) {\n if (i % d == 0) {\n res++;\n }\n }\n System.out.println(res);\n }\n\n public static void main(String[] args) {\n int L = scanner.nextInt();\n int R = scanner.nextInt();\n int d = scanner.nextInt();\n solve(L, R, d);\n }\n\n private static final Scanner scanner = new Scanner(System.in);\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "sample_input": "5 10 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02606", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 460, "cpu_time_ms": 165, "memory_kb": 35672}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s943591373", "group_id": "codeNet:p02606", "input_text": "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\nScanner sc=new Scanner(System.in);\nint l=sc.nextInt();\nint r=sc.nextInt();\nint d=sc.nextInt();\nint a[]=new int [101];\nfor(int i=d;i<101;i+=d) {\n\ta[i]++;\n}\nint count=0;\nfor(int i=l;i<=r;i++) {\n\tif(a[i]>=1) {\n\t\tcount++;\n\t}\n}\nSystem.out.println(count);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1594515917, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02606.html", "problem_id": "p02606", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02606/input.txt", "sample_output_relpath": "derived/input_output/data/p02606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02606/Java/s943591373.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s943591373", "user_id": "u358894498"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\nScanner sc=new Scanner(System.in);\nint l=sc.nextInt();\nint r=sc.nextInt();\nint d=sc.nextInt();\nint a[]=new int [101];\nfor(int i=d;i<101;i+=d) {\n\ta[i]++;\n}\nint count=0;\nfor(int i=l;i<=r;i++) {\n\tif(a[i]>=1) {\n\t\tcount++;\n\t}\n}\nSystem.out.println(count);\n\t}\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "sample_input": "5 10 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02606", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 127, "memory_kb": 35600}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s410199142", "group_id": "codeNet:p02606", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString str[] = br.readLine().split(\" \");\n\n\t\tlong a = Long.parseLong(str[0]);\n\t\tlong b = Long.parseLong(str[1]);\n\t\tlong c = Long.parseLong(str[2]);\n\n\t\tint ans = 0;\n\t\tfor (long i = a; i <= b; i++) {\n\t\t\tif (i % c == 0) {\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n}", "language": "Java", "metadata": {"date": 1594515664, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02606.html", "problem_id": "p02606", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02606/input.txt", "sample_output_relpath": "derived/input_output/data/p02606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02606/Java/s410199142.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s410199142", "user_id": "u043263787"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString str[] = br.readLine().split(\" \");\n\n\t\tlong a = Long.parseLong(str[0]);\n\t\tlong b = Long.parseLong(str[1]);\n\t\tlong c = Long.parseLong(str[2]);\n\n\t\tint ans = 0;\n\t\tfor (long i = a; i <= b; i++) {\n\t\t\tif (i % c == 0) {\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "sample_input": "5 10 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02606", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 525, "cpu_time_ms": 83, "memory_kb": 32580}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s701078988", "group_id": "codeNet:p02608", "input_text": "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n for(int i=1; i<=n; i++) {\n int ans = 0;\n for(int x=1; x<=1000; x++) {\n int x1 = (int) Math.pow(x, 2);\n int y1 = (int) Math.pow(1, 2);\n int z1 = (int) Math.pow(1, 2);\n int xy1 = x * 1;\n int yz1 = 1 * 1;\n int zx1 = 1 * x;\n int sum1 = x1 + y1 + z1 + xy1 + yz1 + zx1;\n if(i < sum1)break;\n for(int y=1; y<=1000; y++) {\n int x2 = (int) Math.pow(x, 2);\n int y2 = (int) Math.pow(y, 2);\n int z2 = (int) Math.pow(1, 2);\n int xy2 = x * y;\n int yz2 = y * 1;\n int zx2 = 1 * x;\n int sum2 = x2 + y2 + z2 + xy2 + yz2 + zx2;\n if(i < sum2)break;\n for(int z=1; z<=1000; z++) {\n int x3 = (int) Math.pow(x, 2);\n int y3 = (int) Math.pow(y, 2);\n int z3 = (int) Math.pow(z, 2);\n int xy3 = x * y;\n int yz3 = y * z;\n int zx3 = z * x;\n int sum3 = x3 + y3 + z3 + xy3 + yz3 + zx3;\n if(i == sum3) ans++;\n if(i < sum3)break;\n }\n }\n }\n System.out.println(ans);\n }\n }\n}", "language": "Java", "metadata": {"date": 1594518668, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02608.html", "problem_id": "p02608", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02608/input.txt", "sample_output_relpath": "derived/input_output/data/p02608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02608/Java/s701078988.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s701078988", "user_id": "u934782869"}, "prompt_components": {"gold_output": "0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n for(int i=1; i<=n; i++) {\n int ans = 0;\n for(int x=1; x<=1000; x++) {\n int x1 = (int) Math.pow(x, 2);\n int y1 = (int) Math.pow(1, 2);\n int z1 = (int) Math.pow(1, 2);\n int xy1 = x * 1;\n int yz1 = 1 * 1;\n int zx1 = 1 * x;\n int sum1 = x1 + y1 + z1 + xy1 + yz1 + zx1;\n if(i < sum1)break;\n for(int y=1; y<=1000; y++) {\n int x2 = (int) Math.pow(x, 2);\n int y2 = (int) Math.pow(y, 2);\n int z2 = (int) Math.pow(1, 2);\n int xy2 = x * y;\n int yz2 = y * 1;\n int zx2 = 1 * x;\n int sum2 = x2 + y2 + z2 + xy2 + yz2 + zx2;\n if(i < sum2)break;\n for(int z=1; z<=1000; z++) {\n int x3 = (int) Math.pow(x, 2);\n int y3 = (int) Math.pow(y, 2);\n int z3 = (int) Math.pow(z, 2);\n int xy3 = x * y;\n int yz3 = y * z;\n int zx3 = z * x;\n int sum3 = x3 + y3 + z3 + xy3 + yz3 + zx3;\n if(i == sum3) ans++;\n if(i < sum3)break;\n }\n }\n }\n System.out.println(ans);\n }\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "sample_input": "20\n"}, "reference_outputs": ["0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n"], "source_document_id": "p02608", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1611, "cpu_time_ms": 2207, "memory_kb": 39840}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s194720654", "group_id": "codeNet:p02608", "input_text": "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n \tint N = sc.nextInt();\n \n \tInteger a[] = new Integer[N+1];\n for (int i=1; i<=N; i++) {\n a[i] = 0;\n }\n for (int i=1; i<=N; i++) {\n \tfor(int x = 1; x<=20;x++){\n \tfor(int y = x; y<=100;y++){\n \t for(int z = y; z<=100;z++){\n if((x * x) + (y * y) + (z * z) + (x * y) + (y * z) + (z * x) == i){\n if(x == y && y == z){\n a[i] += 1;\n } else {\n a[i] += 3;\n }\n } \n \t\t }\n \t}\n }\n }\n \n \tfor (int i=1; i<=N; i++) {\n System.out.println(a[i]);\n }\n \n }\n}", "language": "Java", "metadata": {"date": 1594518333, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02608.html", "problem_id": "p02608", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02608/input.txt", "sample_output_relpath": "derived/input_output/data/p02608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02608/Java/s194720654.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s194720654", "user_id": "u857143297"}, "prompt_components": {"gold_output": "0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n \tint N = sc.nextInt();\n \n \tInteger a[] = new Integer[N+1];\n for (int i=1; i<=N; i++) {\n a[i] = 0;\n }\n for (int i=1; i<=N; i++) {\n \tfor(int x = 1; x<=20;x++){\n \tfor(int y = x; y<=100;y++){\n \t for(int z = y; z<=100;z++){\n if((x * x) + (y * y) + (z * z) + (x * y) + (y * z) + (z * x) == i){\n if(x == y && y == z){\n a[i] += 1;\n } else {\n a[i] += 3;\n }\n } \n \t\t }\n \t}\n }\n }\n \n \tfor (int i=1; i<=N; i++) {\n System.out.println(a[i]);\n }\n \n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "sample_input": "20\n"}, "reference_outputs": ["0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n"], "source_document_id": "p02608", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 889, "cpu_time_ms": 2045, "memory_kb": 39040}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s148818792", "group_id": "codeNet:p02609", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.StringTokenizer;\n\npublic class Main {\n private static class FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n }\n\n private static int powmod(int a, int n, int mod) {\n if (n == 0) return 1;\n int half = powmod(a, n / 2, mod) % mod;\n if (n % 2 == 0) return (half * half) % mod;\n return (a * ((half * half) % mod)) % mod;\n }\n\n private static int mod(String bin, int mod) {\n int val = 0;\n for (int i = bin.length() - 1; i >= 0; i--) {\n if (bin.charAt(i) == '0') continue;\n int n = bin.length() - 1 - i;\n val += powmod(2, n, mod);\n val %= mod;\n }\n return val;\n }\n\n private static int getF(String bin, int mod, Map f) {\n if (f.containsKey(bin)) return f.get(bin);\n if (mod == 0) {\n f.put(bin, 0);\n return f.get(bin);\n }\n int m = mod(bin, mod);\n String mbin = Integer.toString(m, 2);\n int count = 0;\n for (int i = 0; i < mbin.length(); i++) {\n if (mbin.charAt(i) == '1') count++;\n }\n f.put(bin, 1 + getF(mbin, count, f));\n return f.get(bin);\n }\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n int n = sc.nextInt();\n String x = sc.next();\n int ones = 0;\n for (int i = 0; i < n; i++) {\n if (x.charAt(i) == '1') ones++;\n }\n Map f = new HashMap<>();\n StringBuilder sb = new StringBuilder();\n for (int i = 0; i < n; i++) {\n if (sb.length() > 0) sb.append(\"\\n\");\n String xi;\n int m;\n if (x.charAt(i) == '0') {\n m = ones + 1;\n xi = x.substring(0, i) + '1' + x.substring(i + 1);\n } else {\n m = ones - 1;\n xi = x.substring(0, i) + '0' + x.substring(i + 1);\n }\n int count = getF(xi, m, f);\n sb.append(count);\n }\n System.out.println(sb.toString());\n }\n}", "language": "Java", "metadata": {"date": 1594519829, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02609.html", "problem_id": "p02609", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02609/input.txt", "sample_output_relpath": "derived/input_output/data/p02609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02609/Java/s148818792.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s148818792", "user_id": "u562002567"}, "prompt_components": {"gold_output": "2\n1\n1\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.StringTokenizer;\n\npublic class Main {\n private static class FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n }\n\n private static int powmod(int a, int n, int mod) {\n if (n == 0) return 1;\n int half = powmod(a, n / 2, mod) % mod;\n if (n % 2 == 0) return (half * half) % mod;\n return (a * ((half * half) % mod)) % mod;\n }\n\n private static int mod(String bin, int mod) {\n int val = 0;\n for (int i = bin.length() - 1; i >= 0; i--) {\n if (bin.charAt(i) == '0') continue;\n int n = bin.length() - 1 - i;\n val += powmod(2, n, mod);\n val %= mod;\n }\n return val;\n }\n\n private static int getF(String bin, int mod, Map f) {\n if (f.containsKey(bin)) return f.get(bin);\n if (mod == 0) {\n f.put(bin, 0);\n return f.get(bin);\n }\n int m = mod(bin, mod);\n String mbin = Integer.toString(m, 2);\n int count = 0;\n for (int i = 0; i < mbin.length(); i++) {\n if (mbin.charAt(i) == '1') count++;\n }\n f.put(bin, 1 + getF(mbin, count, f));\n return f.get(bin);\n }\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n int n = sc.nextInt();\n String x = sc.next();\n int ones = 0;\n for (int i = 0; i < n; i++) {\n if (x.charAt(i) == '1') ones++;\n }\n Map f = new HashMap<>();\n StringBuilder sb = new StringBuilder();\n for (int i = 0; i < n; i++) {\n if (sb.length() > 0) sb.append(\"\\n\");\n String xi;\n int m;\n if (x.charAt(i) == '0') {\n m = ones + 1;\n xi = x.substring(0, i) + '1' + x.substring(i + 1);\n } else {\n m = ones - 1;\n xi = x.substring(0, i) + '0' + x.substring(i + 1);\n }\n int count = getF(xi, m, f);\n sb.append(count);\n }\n System.out.println(sb.toString());\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "sample_input": "3\n011\n"}, "reference_outputs": ["2\n1\n1\n"], "source_document_id": "p02609", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3302, "cpu_time_ms": 2233, "memory_kb": 815912}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s719760335", "group_id": "codeNet:p02613", "input_text": "import java.util.Scanner;\n \npublic class Main {\n \n public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();//データ数\n \tString[] result=new String[n];\n \tint count_Ac=0;\n \tint count_Wc=0;\n \tint count_Tle=0;\n \tint count_Re=0;\n \t\n \tfor(int i=0;i list1 = new ArrayList();\n ArrayList list2 = new ArrayList();\n for(int i = 0; i < n; i++) {\n long a = sc.nextLong();\n if(a >= 0) {\n list1.add(a);\n } else {\n list2.add(a);\n }\n }\n Collections.sort(list1);\n Collections.sort(list2);\n long ans = 1;\n int p1 = list1.size() - 1;\n int p2 = 0;\n if(list1.size() == 0) {\n if((k % 2) == 1) {\n for(int i = list2.size() - 1; i >= list2.size() - k; i--) {\n long d = list2.get(i);\n d += MOD;\n ans = (ans * d) % MOD;\n }\n } else {\n for(int i = 0; i < k; i++) {\n long d = list2.get(i);\n d += MOD;\n ans = (ans * d) % MOD;\n }\n }\n } else if(list2.size() == 0) {\n for(int i = list1.size() - 1; i >= list1.size() - k; i--) {\n ans = (ans * list1.get(i)) % MOD;\n }\n } else {\n \n for(int i = 0; i < k; i++) {\n if(p2 < list2.size() - 1) {\n long s1 = list1.get(p1);\n if(p1 > 0) s1 *= list1.get(p1 - 1);\n // long s2 = list2.get(p2) * list2.get(p2 + 1);\n long s2 = 1;\n if((s1 >= s2) || (i == (k - 1))) {\n ans = (ans * list1.get(p1)) % MOD;\n p1--;\n } else {\n s2 = (s2 % MOD);\n ans = (ans * s2) % MOD;\n i++;\n p2 += 2;\n }\n } else {\n if(p1 >= 0) {\n long d = list1.get(p1);\n ans = (ans * d) % MOD;\n p1--; \n } else {\n long d = list2.get(p2);\n d += MOD;\n ans = (ans * d) % MOD;\n p2++; \n }\n }\n } \n }\n System.out.println(ans);\n }\n}\n", "language": "Java", "metadata": {"date": 1594246346, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02616.html", "problem_id": "p02616", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02616/input.txt", "sample_output_relpath": "derived/input_output/data/p02616/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02616/Java/s613156428.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s613156428", "user_id": "u653981267"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int k = sc.nextInt();\n long MOD = (long)Math.pow(10, 9) + 7;\n ArrayList list1 = new ArrayList();\n ArrayList list2 = new ArrayList();\n for(int i = 0; i < n; i++) {\n long a = sc.nextLong();\n if(a >= 0) {\n list1.add(a);\n } else {\n list2.add(a);\n }\n }\n Collections.sort(list1);\n Collections.sort(list2);\n long ans = 1;\n int p1 = list1.size() - 1;\n int p2 = 0;\n if(list1.size() == 0) {\n if((k % 2) == 1) {\n for(int i = list2.size() - 1; i >= list2.size() - k; i--) {\n long d = list2.get(i);\n d += MOD;\n ans = (ans * d) % MOD;\n }\n } else {\n for(int i = 0; i < k; i++) {\n long d = list2.get(i);\n d += MOD;\n ans = (ans * d) % MOD;\n }\n }\n } else if(list2.size() == 0) {\n for(int i = list1.size() - 1; i >= list1.size() - k; i--) {\n ans = (ans * list1.get(i)) % MOD;\n }\n } else {\n \n for(int i = 0; i < k; i++) {\n if(p2 < list2.size() - 1) {\n long s1 = list1.get(p1);\n if(p1 > 0) s1 *= list1.get(p1 - 1);\n // long s2 = list2.get(p2) * list2.get(p2 + 1);\n long s2 = 1;\n if((s1 >= s2) || (i == (k - 1))) {\n ans = (ans * list1.get(p1)) % MOD;\n p1--;\n } else {\n s2 = (s2 % MOD);\n ans = (ans * s2) % MOD;\n i++;\n p2 += 2;\n }\n } else {\n if(p1 >= 0) {\n long d = list1.get(p1);\n ans = (ans * d) % MOD;\n p1--; \n } else {\n long d = list2.get(p2);\n d += MOD;\n ans = (ans * d) % MOD;\n p2++; \n }\n }\n } \n }\n System.out.println(ans);\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nWe will choose exactly K of these elements. Find the maximum possible product of the chosen elements.\n\nThen, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2\\times 10^5\n\n|A_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 \\ldots A_N\n\nOutput\n\nPrint the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nSample Input 1\n\n4 2\n1 2 -3 -4\n\nSample Output 1\n\n12\n\nThe possible products of the two chosen elements are 2, -3, -4, -6, -8, and 12, so the maximum product is 12.\n\nSample Input 2\n\n4 3\n-1 -2 -3 -4\n\nSample Output 2\n\n1000000001\n\nThe possible products of the three chosen elements are -24, -12, -8, and -6, so the maximum product is -6.\n\nWe print this value modulo (10^9+7), that is, 1000000001.\n\nSample Input 3\n\n2 1\n-1 1000000000\n\nSample Output 3\n\n1000000000\n\nThe possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.\n\nSample Input 4\n\n10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n\nSample Output 4\n\n999983200\n\nBe sure to print the product modulo (10^9+7).", "sample_input": "4 2\n1 2 -3 -4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02616", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nWe will choose exactly K of these elements. Find the maximum possible product of the chosen elements.\n\nThen, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2\\times 10^5\n\n|A_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 \\ldots A_N\n\nOutput\n\nPrint the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nSample Input 1\n\n4 2\n1 2 -3 -4\n\nSample Output 1\n\n12\n\nThe possible products of the two chosen elements are 2, -3, -4, -6, -8, and 12, so the maximum product is 12.\n\nSample Input 2\n\n4 3\n-1 -2 -3 -4\n\nSample Output 2\n\n1000000001\n\nThe possible products of the three chosen elements are -24, -12, -8, and -6, so the maximum product is -6.\n\nWe print this value modulo (10^9+7), that is, 1000000001.\n\nSample Input 3\n\n2 1\n-1 1000000000\n\nSample Output 3\n\n1000000000\n\nThe possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.\n\nSample Input 4\n\n10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n\nSample Output 4\n\n999983200\n\nBe sure to print the product modulo (10^9+7).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1895, "cpu_time_ms": 772, "memory_kb": 66116}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s237436348", "group_id": "codeNet:p02622", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n // 文字列の入力1\n String str1 = sc.nextLine();\n // 文字列の入力1\n String str2 = sc.nextLine();\n if(!str1.equals(str2)) {\n int count = 0;\n for(int i = 0;i='A'&&c<='Z') {\n\t\t\tSystem.out.println(\"A\");\n\t\t} else {\n\t\t\tSystem.out.println(\"a\");\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1592787711, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02627.html", "problem_id": "p02627", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02627/input.txt", "sample_output_relpath": "derived/input_output/data/p02627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02627/Java/s517428331.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517428331", "user_id": "u476635134"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar c = sc.next().toCharArray()[0];\n\t\tif (c>='A'&&c<='Z') {\n\t\t\tSystem.out.println(\"A\");\n\t\t} else {\n\t\t\tSystem.out.println(\"a\");\n\t\t}\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "sample_input": "B\n"}, "reference_outputs": ["A\n"], "source_document_id": "p02627", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 267, "cpu_time_ms": 137, "memory_kb": 35660}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s211945559", "group_id": "codeNet:p02630", "input_text": "import java.util.*;\nimport java.io.*;\nimport java.util.Scanner;\nimport java.util.HashMap;\n\npublic class Main{\n\tpublic static void main(String[] args)\n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] arr = new int[n];\n\t\tlong sum = 0;\n\t\tHashMap map= new HashMap<>();\n\t\tfor(int i=0;i map= new HashMap<>();\n\t\tfor(int i=0;i0) {\n\t\t\tint b=sc.nextInt(),c=sc.nextInt();\n\t\t\tint cnt=occ[b];\n\t\t\tocc[c]+=cnt;\n\t\t\tocc[b]=0;\n\t\t\tsum+=(1l*cnt*c);\n\t\t\tsum-=(1l*cnt*b);\n\t\t\tpw.println(sum);\n\t\t}\n\t}\n\tpublic static void main(String[] args) throws Exception{\n\t\tpw=new PrintWriter(System.out);\n\t\tsc = new MScanner(System.in);\n\t\tint tc=1;\n//\t\ttc=sc.nextInt();\n\t\twhile(tc-->0)\n\t\t\tmain();\n\t\tpw.flush();\n\t}\n\tstatic PrintWriter pw;\n\tstatic MScanner sc;\n\tstatic class MScanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\t\tpublic MScanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n \n\t\tpublic MScanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n \n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tpublic int[] intArr(int n) throws IOException {\n\t int[]in=new int[n];for(int i=0;i0) {\n\t\t\tint b=sc.nextInt(),c=sc.nextInt();\n\t\t\tint cnt=occ[b];\n\t\t\tocc[c]+=cnt;\n\t\t\tocc[b]=0;\n\t\t\tsum+=(1l*cnt*c);\n\t\t\tsum-=(1l*cnt*b);\n\t\t\tpw.println(sum);\n\t\t}\n\t}\n\tpublic static void main(String[] args) throws Exception{\n\t\tpw=new PrintWriter(System.out);\n\t\tsc = new MScanner(System.in);\n\t\tint tc=1;\n//\t\ttc=sc.nextInt();\n\t\twhile(tc-->0)\n\t\t\tmain();\n\t\tpw.flush();\n\t}\n\tstatic PrintWriter pw;\n\tstatic MScanner sc;\n\tstatic class MScanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\t\tpublic MScanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n \n\t\tpublic MScanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n \n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\t\tpublic int[] intArr(int n) throws IOException {\n\t int[]in=new int[n];for(int i=0;i map = new HashMap<>();\n for (int a : A) {\n map.put(a, map.getOrDefault(a, 0) + 1);\n }\n\n int Q = in.Int();\n for (int i = 0; i < Q; i++) {\n int B = in.Int();\n int C = in.Int();\n if (map.containsKey(B)) {\n int cnt = map.get(B);\n if (cnt > 0) {\n sum += ((long) C * cnt) - ((long) B * cnt);\n map.put(C, map.getOrDefault(C, 0) + cnt);\n map.put(B, 0);\n }\n }\n out.println(sum);\n }\n }\n\n }\n\n static class MyScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public MyScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n String rl = in.readLine();\n if (rl == null) {\n return null;\n }\n st = new StringTokenizer(rl);\n } catch (IOException e) {\n return null;\n }\n }\n return st.nextToken();\n }\n\n public int Int() {\n return Integer.parseInt(next());\n }\n\n public int[] Int(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = Int();\n }\n return a;\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1592788732, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02630.html", "problem_id": "p02630", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02630/input.txt", "sample_output_relpath": "derived/input_output/data/p02630/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02630/Java/s813373054.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s813373054", "user_id": "u305384049"}, "prompt_components": {"gold_output": "11\n12\n16\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.stream.IntStream;\nimport java.util.StringTokenizer;\nimport java.util.Map;\nimport java.util.HashMap;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyScanner in = new MyScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n D solver = new D();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class D {\n public void solve(int testNumber, MyScanner in, PrintWriter out) {\n int N = in.Int();\n int[] A = in.Int(N);\n\n long sum = IntStream.of(A).sum();\n Map map = new HashMap<>();\n for (int a : A) {\n map.put(a, map.getOrDefault(a, 0) + 1);\n }\n\n int Q = in.Int();\n for (int i = 0; i < Q; i++) {\n int B = in.Int();\n int C = in.Int();\n if (map.containsKey(B)) {\n int cnt = map.get(B);\n if (cnt > 0) {\n sum += ((long) C * cnt) - ((long) B * cnt);\n map.put(C, map.getOrDefault(C, 0) + cnt);\n map.put(B, 0);\n }\n }\n out.println(sum);\n }\n }\n\n }\n\n static class MyScanner {\n private BufferedReader in;\n private StringTokenizer st;\n\n public MyScanner(InputStream stream) {\n in = new BufferedReader(new InputStreamReader(stream));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n String rl = in.readLine();\n if (rl == null) {\n return null;\n }\n st = new StringTokenizer(rl);\n } catch (IOException e) {\n return null;\n }\n }\n return st.nextToken();\n }\n\n public int Int() {\n return Integer.parseInt(next());\n }\n\n public int[] Int(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = Int();\n }\n return a;\n }\n\n }\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have a sequence A composed of N positive integers: A_{1}, A_{2}, \\cdots, A_{N}.\n\nYou will now successively do the following Q operations:\n\nIn the i-th operation, you replace every element whose value is B_{i} with C_{i}.\n\nFor each i (1 \\leq i \\leq Q), find S_{i}: the sum of all elements in A just after the i-th operation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, Q, A_{i}, B_{i}, C_{i} \\leq 10^{5}\n\nB_{i} \\neq C_{i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1} A_{2} \\cdots A_{N}\nQ\nB_{1} C_{1}\nB_{2} C_{2}\n\\vdots\nB_{Q} C_{Q}\n\nOutput\n\nPrint Q integers S_{i} to Standard Output in the following format:\n\nS_{1}\nS_{2}\n\\vdots\nS_{Q}\n\nNote that S_{i} may not fit into a 32-bit integer.\n\nSample Input 1\n\n4\n1 2 3 4\n3\n1 2\n3 4\n2 4\n\nSample Output 1\n\n11\n12\n16\n\nInitially, the sequence A is 1,2,3,4.\n\nAfter each operation, it becomes the following:\n\n2, 2, 3, 4\n\n2, 2, 4, 4\n\n4, 4, 4, 4\n\nSample Input 2\n\n4\n1 1 1 1\n3\n1 2\n2 1\n3 5\n\nSample Output 2\n\n8\n4\n4\n\nNote that the sequence A may not contain an element whose value is B_{i}.\n\nSample Input 3\n\n2\n1 2\n3\n1 100\n2 100\n100 1000\n\nSample Output 3\n\n102\n200\n2000", "sample_input": "4\n1 2 3 4\n3\n1 2\n3 4\n2 4\n"}, "reference_outputs": ["11\n12\n16\n"], "source_document_id": "p02630", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have a sequence A composed of N positive integers: A_{1}, A_{2}, \\cdots, A_{N}.\n\nYou will now successively do the following Q operations:\n\nIn the i-th operation, you replace every element whose value is B_{i} with C_{i}.\n\nFor each i (1 \\leq i \\leq Q), find S_{i}: the sum of all elements in A just after the i-th operation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, Q, A_{i}, B_{i}, C_{i} \\leq 10^{5}\n\nB_{i} \\neq C_{i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1} A_{2} \\cdots A_{N}\nQ\nB_{1} C_{1}\nB_{2} C_{2}\n\\vdots\nB_{Q} C_{Q}\n\nOutput\n\nPrint Q integers S_{i} to Standard Output in the following format:\n\nS_{1}\nS_{2}\n\\vdots\nS_{Q}\n\nNote that S_{i} may not fit into a 32-bit integer.\n\nSample Input 1\n\n4\n1 2 3 4\n3\n1 2\n3 4\n2 4\n\nSample Output 1\n\n11\n12\n16\n\nInitially, the sequence A is 1,2,3,4.\n\nAfter each operation, it becomes the following:\n\n2, 2, 3, 4\n\n2, 2, 4, 4\n\n4, 4, 4, 4\n\nSample Input 2\n\n4\n1 1 1 1\n3\n1 2\n2 1\n3 5\n\nSample Output 2\n\n8\n4\n4\n\nNote that the sequence A may not contain an element whose value is B_{i}.\n\nSample Input 3\n\n2\n1 2\n3\n1 100\n2 100\n100 1000\n\nSample Output 3\n\n102\n200\n2000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2644, "cpu_time_ms": 497, "memory_kb": 61660}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s344586573", "group_id": "codeNet:p02631", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n try (Scanner s = new Scanner(System.in)) {\n int n = Integer.parseInt(s.nextLine());\n int[] a = Arrays.stream(s.nextLine().split(\" \"))\n .mapToInt(Integer::parseInt)\n .toArray();\n int[] b = new int[n];\n int x = 0;\n for (int i = 1; i < n; i++) {\n b[i] = a[0] ^ a[i];\n x ^= b[i];\n }\n \n int flag = a[0] ^ x;\n for (int i = 0; i < n; i++) {\n b[i] ^= flag;\n }\n System.out.print(a[0]);\n for (int i = 1; i < n; i++) {\n System.out.print(\" \" + b[i]);\n }\n System.out.println();\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1592793508, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02631.html", "problem_id": "p02631", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02631/input.txt", "sample_output_relpath": "derived/input_output/data/p02631/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02631/Java/s344586573.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s344586573", "user_id": "u238398597"}, "prompt_components": {"gold_output": "26 5 7 22\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n try (Scanner s = new Scanner(System.in)) {\n int n = Integer.parseInt(s.nextLine());\n int[] a = Arrays.stream(s.nextLine().split(\" \"))\n .mapToInt(Integer::parseInt)\n .toArray();\n int[] b = new int[n];\n int x = 0;\n for (int i = 1; i < n; i++) {\n b[i] = a[0] ^ a[i];\n x ^= b[i];\n }\n \n int flag = a[0] ^ x;\n for (int i = 0; i < n; i++) {\n b[i] ^= flag;\n }\n System.out.print(a[0]);\n for (int i = 1; i < n; i++) {\n System.out.print(\" \" + b[i]);\n }\n System.out.println();\n }\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N Snuke Cats numbered 1, 2, \\ldots, N, where N is even.\n\nEach Snuke Cat wears a red scarf, on which his favorite non-negative integer is written.\n\nRecently, they learned the operation called xor (exclusive OR).\n\nWhat is xor?\n\nFor n non-negative integers x_1, x_2, \\ldots, x_n, their xor, x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is defined as follows:\n\nWhen x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3~\\textrm{xor}~5 = 6.\n\nThey wanted to use this operation quickly, so each of them calculated the xor of the integers written on their scarfs except his scarf.\n\nWe know that the xor calculated by Snuke Cat i, that is, the xor of the integers written on the scarfs except the scarf of Snuke Cat i is a_i.\nUsing this information, restore the integer written on the scarf of each Snuke Cat.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n0 \\leq a_i \\leq 10^9\n\nThere exists a combination of integers on the scarfs that is consistent with the given information.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_N\n\nOutput\n\nPrint a line containing N integers separated with space.\n\nThe i-th of the integers from the left should represent the integer written on the scarf of Snuke Cat i.\n\nIf there are multiple possible solutions, you may print any of them.\n\nSample Input 1\n\n4\n20 11 9 24\n\nSample Output 1\n\n26 5 7 22\n\n5~\\textrm{xor}~7~\\textrm{xor}~22 = 20\n\n26~\\textrm{xor}~7~\\textrm{xor}~22 = 11\n\n26~\\textrm{xor}~5~\\textrm{xor}~22 = 9\n\n26~\\textrm{xor}~5~\\textrm{xor}~7 = 24\n\nThus, this output is consistent with the given information.", "sample_input": "4\n20 11 9 24\n"}, "reference_outputs": ["26 5 7 22\n"], "source_document_id": "p02631", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N Snuke Cats numbered 1, 2, \\ldots, N, where N is even.\n\nEach Snuke Cat wears a red scarf, on which his favorite non-negative integer is written.\n\nRecently, they learned the operation called xor (exclusive OR).\n\nWhat is xor?\n\nFor n non-negative integers x_1, x_2, \\ldots, x_n, their xor, x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is defined as follows:\n\nWhen x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3~\\textrm{xor}~5 = 6.\n\nThey wanted to use this operation quickly, so each of them calculated the xor of the integers written on their scarfs except his scarf.\n\nWe know that the xor calculated by Snuke Cat i, that is, the xor of the integers written on the scarfs except the scarf of Snuke Cat i is a_i.\nUsing this information, restore the integer written on the scarf of each Snuke Cat.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n0 \\leq a_i \\leq 10^9\n\nThere exists a combination of integers on the scarfs that is consistent with the given information.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_N\n\nOutput\n\nPrint a line containing N integers separated with space.\n\nThe i-th of the integers from the left should represent the integer written on the scarf of Snuke Cat i.\n\nIf there are multiple possible solutions, you may print any of them.\n\nSample Input 1\n\n4\n20 11 9 24\n\nSample Output 1\n\n26 5 7 22\n\n5~\\textrm{xor}~7~\\textrm{xor}~22 = 20\n\n26~\\textrm{xor}~7~\\textrm{xor}~22 = 11\n\n26~\\textrm{xor}~5~\\textrm{xor}~22 = 9\n\n26~\\textrm{xor}~5~\\textrm{xor}~7 = 24\n\nThus, this output is consistent with the given information.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 837, "cpu_time_ms": 966, "memory_kb": 84908}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s300497221", "group_id": "codeNet:p02631", "input_text": "import java.math.BigInteger;\nimport java.util.*;\nimport java.util.stream.Collectors;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long n = sc.nextLong();\n Map a = new HashMap<>();\n BigInteger xor = BigInteger.ZERO;\n for (long i = 0; i < n; i++) {\n BigInteger ai = new BigInteger(sc.next());\n xor = xor.xor(ai);\n a.put(i, ai);\n }\n for (long i = 0; i < n; i++) {\n BigInteger bigInteger = a.get(i);\n System.out.print(bigInteger.xor(xor));\n if (i != n - 1) {\n System.out.print(\" \");\n }\n }\n System.out.println();\n }\n}\n", "language": "Java", "metadata": {"date": 1592791344, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02631.html", "problem_id": "p02631", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02631/input.txt", "sample_output_relpath": "derived/input_output/data/p02631/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02631/Java/s300497221.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s300497221", "user_id": "u324739185"}, "prompt_components": {"gold_output": "26 5 7 22\n", "input_to_evaluate": "import java.math.BigInteger;\nimport java.util.*;\nimport java.util.stream.Collectors;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long n = sc.nextLong();\n Map a = new HashMap<>();\n BigInteger xor = BigInteger.ZERO;\n for (long i = 0; i < n; i++) {\n BigInteger ai = new BigInteger(sc.next());\n xor = xor.xor(ai);\n a.put(i, ai);\n }\n for (long i = 0; i < n; i++) {\n BigInteger bigInteger = a.get(i);\n System.out.print(bigInteger.xor(xor));\n if (i != n - 1) {\n System.out.print(\" \");\n }\n }\n System.out.println();\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N Snuke Cats numbered 1, 2, \\ldots, N, where N is even.\n\nEach Snuke Cat wears a red scarf, on which his favorite non-negative integer is written.\n\nRecently, they learned the operation called xor (exclusive OR).\n\nWhat is xor?\n\nFor n non-negative integers x_1, x_2, \\ldots, x_n, their xor, x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is defined as follows:\n\nWhen x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3~\\textrm{xor}~5 = 6.\n\nThey wanted to use this operation quickly, so each of them calculated the xor of the integers written on their scarfs except his scarf.\n\nWe know that the xor calculated by Snuke Cat i, that is, the xor of the integers written on the scarfs except the scarf of Snuke Cat i is a_i.\nUsing this information, restore the integer written on the scarf of each Snuke Cat.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n0 \\leq a_i \\leq 10^9\n\nThere exists a combination of integers on the scarfs that is consistent with the given information.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_N\n\nOutput\n\nPrint a line containing N integers separated with space.\n\nThe i-th of the integers from the left should represent the integer written on the scarf of Snuke Cat i.\n\nIf there are multiple possible solutions, you may print any of them.\n\nSample Input 1\n\n4\n20 11 9 24\n\nSample Output 1\n\n26 5 7 22\n\n5~\\textrm{xor}~7~\\textrm{xor}~22 = 20\n\n26~\\textrm{xor}~7~\\textrm{xor}~22 = 11\n\n26~\\textrm{xor}~5~\\textrm{xor}~22 = 9\n\n26~\\textrm{xor}~5~\\textrm{xor}~7 = 24\n\nThus, this output is consistent with the given information.", "sample_input": "4\n20 11 9 24\n"}, "reference_outputs": ["26 5 7 22\n"], "source_document_id": "p02631", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N Snuke Cats numbered 1, 2, \\ldots, N, where N is even.\n\nEach Snuke Cat wears a red scarf, on which his favorite non-negative integer is written.\n\nRecently, they learned the operation called xor (exclusive OR).\n\nWhat is xor?\n\nFor n non-negative integers x_1, x_2, \\ldots, x_n, their xor, x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is defined as follows:\n\nWhen x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3~\\textrm{xor}~5 = 6.\n\nThey wanted to use this operation quickly, so each of them calculated the xor of the integers written on their scarfs except his scarf.\n\nWe know that the xor calculated by Snuke Cat i, that is, the xor of the integers written on the scarfs except the scarf of Snuke Cat i is a_i.\nUsing this information, restore the integer written on the scarf of each Snuke Cat.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n0 \\leq a_i \\leq 10^9\n\nThere exists a combination of integers on the scarfs that is consistent with the given information.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_N\n\nOutput\n\nPrint a line containing N integers separated with space.\n\nThe i-th of the integers from the left should represent the integer written on the scarf of Snuke Cat i.\n\nIf there are multiple possible solutions, you may print any of them.\n\nSample Input 1\n\n4\n20 11 9 24\n\nSample Output 1\n\n26 5 7 22\n\n5~\\textrm{xor}~7~\\textrm{xor}~22 = 20\n\n26~\\textrm{xor}~7~\\textrm{xor}~22 = 11\n\n26~\\textrm{xor}~5~\\textrm{xor}~22 = 9\n\n26~\\textrm{xor}~5~\\textrm{xor}~7 = 24\n\nThus, this output is consistent with the given information.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 658, "cpu_time_ms": 1750, "memory_kb": 86296}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s124386425", "group_id": "codeNet:p02633", "input_text": "import java.util.*;\nclass Main{\n \n\tpublic static void main (String[] args) throws java.lang.Exception{\n Scanner scan = new Scanner(System.in);\n int x = scan.nextInt();\n if(360%x!=0) return;\n else\n System.out.println(360/x);}\n}", "language": "Java", "metadata": {"date": 1600030258, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02633.html", "problem_id": "p02633", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02633/input.txt", "sample_output_relpath": "derived/input_output/data/p02633/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02633/Java/s124386425.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s124386425", "user_id": "u018679195"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*;\nclass Main{\n \n\tpublic static void main (String[] args) throws java.lang.Exception{\n Scanner scan = new Scanner(System.in);\n int x = scan.nextInt();\n if(360%x!=0) return;\n else\n System.out.println(360/x);}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is standing on a two-dimensional plane, facing north. Find the minimum positive integer K such that Takahashi will be at the starting position again after he does the following action K times:\n\nGo one meter in the direction he is facing. Then, turn X degrees counter-clockwise.\n\nConstraints\n\n1 \\leq X \\leq 179\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of times Takahashi will do the action before he is at the starting position again.\n\nSample Input 1\n\n90\n\nSample Output 1\n\n4\n\nTakahashi's path is a square.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n360", "sample_input": "90\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02633", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is standing on a two-dimensional plane, facing north. Find the minimum positive integer K such that Takahashi will be at the starting position again after he does the following action K times:\n\nGo one meter in the direction he is facing. Then, turn X degrees counter-clockwise.\n\nConstraints\n\n1 \\leq X \\leq 179\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of times Takahashi will do the action before he is at the starting position again.\n\nSample Input 1\n\n90\n\nSample Output 1\n\n4\n\nTakahashi's path is a square.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n360", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 266, "cpu_time_ms": 116, "memory_kb": 35640}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s299486870", "group_id": "codeNet:p02636", "input_text": "import java.util.*;\nimport java.io.*;\n\nclass Main {\n public static void main(String [] args) {\n Reader in = new Reader();\n char [] s = in.next().toCharArray();\n StringProcessor solver = new StringProcessor(s);\n System.out.println(solver.countWays());\n }\n}\nclass StringProcessor {\n char [] s;\n int n;\n final int mod = 998244353;\n boolean [][][] vis;\n int [][][] mem;\n int [] cnt;\n int [][] opt;\n\n StringProcessor(char [] s) {\n this.s = s.clone();\n this.n = this.s.length;\n vis = new boolean [this.n + 1][this.n + 1][this.n + 1];\n cnt = new int [this.n + 1];\n opt = new int [this.n + 1][this.n + 1];\n mem = new int [this.n + 1][this.n + 1][this.n + 1];\n cnt[n] = 0;\n for(int i = n - 1; i >= 0; i--) {\n cnt[i] = cnt[i + 1];\n if(s[i] == '1') cnt[i] = cnt[i] + 1;\n }\n for(int i = 0; i <= n; i++) {\n for(int j = 0; j <= n; j++) {\n for(int k = 0; k <= n; k++) {\n mem[i][j][k] = -1;\n vis[i][j][k] = false;\n }\n opt[i][j] = -1;\n }\n }\n }\n void dfs(int cur, int cntMove, int cntOne) {\n if(vis[cur][cntMove][cntOne]) return ;\n vis[cur][cntMove][cntOne] = true;\n opt[cntMove][cntOne + cnt[cur]] = Math.max(opt[cntMove][cntOne + cnt[cur]], cur);\n int cntZero = cur - cntMove - cntOne;\n if(cntOne >= 2) {\n dfs(cur, cntMove + 1, cntOne - 1);\n }\n if(cntZero >= 2) {\n dfs(cur, cntMove + 1, cntOne);\n }\n if(cntOne >= 1 && cntZero >= 1) {\n dfs(cur, cntMove + 1, cntOne - 1);\n dfs(cur, cntMove + 1, cntOne);\n }\n if(cur + 2 <= n) {\n if(s[cur] == '0' || s[cur + 1] == '0') {\n dfs(cur + 2, cntMove + 1, cntOne);\n }\n if(s[cur] == '1' || s[cur + 1] == '1') {\n dfs(cur + 2, cntMove + 1, cntOne + 1);\n }\n }\n if(cur + 1 <= n) {\n if(s[cur] == '0') {\n if(cntOne > 0) dfs(cur + 1, cntMove + 1, cntOne - 1);\n if(cntZero > 0) dfs(cur + 1, cntMove + 1, cntOne);\n } else {\n if(cntZero > 0) dfs(cur + 1, cntMove + 1, cntOne + 1);\n if(cntOne > 0) dfs(cur + 1, cntMove + 1, cntOne);\n }\n }\n }\n int dp(int cur, int cntOne, int cntZero) {\n if(cntOne == 0 && cntZero == 0) {\n return (cur == n) ? 1 : 0;\n }\n if(mem[cur][cntOne][cntZero] != -1) {\n return mem[cur][cntOne][cntZero];\n }\n int ans = 0;\n if(cur < n) {\n if(s[cur] == '0') {\n if(cntZero > 0) ans += dp(cur + 1, cntOne, cntZero - 1);\n if(cntOne > 0) ans += dp(cur, cntOne - 1, cntZero);\n } else {\n if(cntOne > 0) ans += dp(cur + 1, cntOne - 1, cntZero);\n if(cntZero > 0) ans += dp(cur, cntOne, cntZero - 1);\n }\n ans %= mod;\n } else {\n if(cntOne > 0) {\n ans += dp(cur, cntOne - 1, cntZero);\n }\n if(cntZero > 0) {\n ans += dp(cur, cntOne, cntZero - 1);\n }\n ans %= mod;\n }\n return mem[cur][cntOne][cntZero] = ans;\n } \n int countWays() {\n dfs(0, 0, 0);\n int ans = 1;\n for(int i = 1; i <= n; i++) {\n for(int j = 0; j <= n; j++) {\n int idx = opt[i][j];\n if(idx < 0) continue;\n ans += dp(idx, j, n - i - j);\n ans %= mod;\n }\n }\n return ans;\n }\n}\n\nclass Reader {\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer s = new StringTokenizer(\"\");\n Reader () {}\n String nextLine() {\n try {\n return in.readLine();\n } catch (Exception e) {\n e.printStackTrace();\n return \"Error\";\n }\n }\n String next() {\n while(!s.hasMoreTokens()) {\n s = new StringTokenizer(nextLine());\n }\n return s.nextToken();\n }\n int nextInt() {\n return Integer.parseInt(next());\n }\n}\n\n", "language": "Java", "metadata": {"date": 1597987044, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02636.html", "problem_id": "p02636", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02636/input.txt", "sample_output_relpath": "derived/input_output/data/p02636/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02636/Java/s299486870.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s299486870", "user_id": "u669432519"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\n\nclass Main {\n public static void main(String [] args) {\n Reader in = new Reader();\n char [] s = in.next().toCharArray();\n StringProcessor solver = new StringProcessor(s);\n System.out.println(solver.countWays());\n }\n}\nclass StringProcessor {\n char [] s;\n int n;\n final int mod = 998244353;\n boolean [][][] vis;\n int [][][] mem;\n int [] cnt;\n int [][] opt;\n\n StringProcessor(char [] s) {\n this.s = s.clone();\n this.n = this.s.length;\n vis = new boolean [this.n + 1][this.n + 1][this.n + 1];\n cnt = new int [this.n + 1];\n opt = new int [this.n + 1][this.n + 1];\n mem = new int [this.n + 1][this.n + 1][this.n + 1];\n cnt[n] = 0;\n for(int i = n - 1; i >= 0; i--) {\n cnt[i] = cnt[i + 1];\n if(s[i] == '1') cnt[i] = cnt[i] + 1;\n }\n for(int i = 0; i <= n; i++) {\n for(int j = 0; j <= n; j++) {\n for(int k = 0; k <= n; k++) {\n mem[i][j][k] = -1;\n vis[i][j][k] = false;\n }\n opt[i][j] = -1;\n }\n }\n }\n void dfs(int cur, int cntMove, int cntOne) {\n if(vis[cur][cntMove][cntOne]) return ;\n vis[cur][cntMove][cntOne] = true;\n opt[cntMove][cntOne + cnt[cur]] = Math.max(opt[cntMove][cntOne + cnt[cur]], cur);\n int cntZero = cur - cntMove - cntOne;\n if(cntOne >= 2) {\n dfs(cur, cntMove + 1, cntOne - 1);\n }\n if(cntZero >= 2) {\n dfs(cur, cntMove + 1, cntOne);\n }\n if(cntOne >= 1 && cntZero >= 1) {\n dfs(cur, cntMove + 1, cntOne - 1);\n dfs(cur, cntMove + 1, cntOne);\n }\n if(cur + 2 <= n) {\n if(s[cur] == '0' || s[cur + 1] == '0') {\n dfs(cur + 2, cntMove + 1, cntOne);\n }\n if(s[cur] == '1' || s[cur + 1] == '1') {\n dfs(cur + 2, cntMove + 1, cntOne + 1);\n }\n }\n if(cur + 1 <= n) {\n if(s[cur] == '0') {\n if(cntOne > 0) dfs(cur + 1, cntMove + 1, cntOne - 1);\n if(cntZero > 0) dfs(cur + 1, cntMove + 1, cntOne);\n } else {\n if(cntZero > 0) dfs(cur + 1, cntMove + 1, cntOne + 1);\n if(cntOne > 0) dfs(cur + 1, cntMove + 1, cntOne);\n }\n }\n }\n int dp(int cur, int cntOne, int cntZero) {\n if(cntOne == 0 && cntZero == 0) {\n return (cur == n) ? 1 : 0;\n }\n if(mem[cur][cntOne][cntZero] != -1) {\n return mem[cur][cntOne][cntZero];\n }\n int ans = 0;\n if(cur < n) {\n if(s[cur] == '0') {\n if(cntZero > 0) ans += dp(cur + 1, cntOne, cntZero - 1);\n if(cntOne > 0) ans += dp(cur, cntOne - 1, cntZero);\n } else {\n if(cntOne > 0) ans += dp(cur + 1, cntOne - 1, cntZero);\n if(cntZero > 0) ans += dp(cur, cntOne, cntZero - 1);\n }\n ans %= mod;\n } else {\n if(cntOne > 0) {\n ans += dp(cur, cntOne - 1, cntZero);\n }\n if(cntZero > 0) {\n ans += dp(cur, cntOne, cntZero - 1);\n }\n ans %= mod;\n }\n return mem[cur][cntOne][cntZero] = ans;\n } \n int countWays() {\n dfs(0, 0, 0);\n int ans = 1;\n for(int i = 1; i <= n; i++) {\n for(int j = 0; j <= n; j++) {\n int idx = opt[i][j];\n if(idx < 0) continue;\n ans += dp(idx, j, n - i - j);\n ans %= mod;\n }\n }\n return ans;\n }\n}\n\nclass Reader {\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer s = new StringTokenizer(\"\");\n Reader () {}\n String nextLine() {\n try {\n return in.readLine();\n } catch (Exception e) {\n e.printStackTrace();\n return \"Error\";\n }\n }\n String next() {\n while(!s.hasMoreTokens()) {\n s = new StringTokenizer(nextLine());\n }\n return s.nextToken();\n }\n int nextInt() {\n return Integer.parseInt(next());\n }\n}\n\n", "problem_context": "Score : 1100 points\n\nProblem Statement\n\nGiven is a string S consisting of 0 and 1. Find the number of strings, modulo 998244353, that can result from applying the following operation on S zero or more times:\n\nRemove the two characters at the beginning of S, erase one of them, and reinsert the other somewhere in S. This operation can be applied only when S has two or more characters.\n\nConstraints\n\n1 \\leq |S| \\leq 300\n\nS consists of 0 and 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of strings, modulo 998244353, that can result from applying the operation on S zero or more times.\n\nSample Input 1\n\n0001\n\nSample Output 1\n\n8\n\nEight strings, 0001, 001, 010, 00, 01, 10, 0, and 1, can result.\n\nSample Input 2\n\n110001\n\nSample Output 2\n\n24\n\nSample Input 3\n\n11101111011111000000000110000001111100011111000000001111111110000000111111111\n\nSample Output 3\n\n697354558", "sample_input": "0001\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02636", "source_text": "Score : 1100 points\n\nProblem Statement\n\nGiven is a string S consisting of 0 and 1. Find the number of strings, modulo 998244353, that can result from applying the following operation on S zero or more times:\n\nRemove the two characters at the beginning of S, erase one of them, and reinsert the other somewhere in S. This operation can be applied only when S has two or more characters.\n\nConstraints\n\n1 \\leq |S| \\leq 300\n\nS consists of 0 and 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of strings, modulo 998244353, that can result from applying the operation on S zero or more times.\n\nSample Input 1\n\n0001\n\nSample Output 1\n\n8\n\nEight strings, 0001, 001, 010, 00, 01, 10, 0, and 1, can result.\n\nSample Input 2\n\n110001\n\nSample Output 2\n\n24\n\nSample Input 3\n\n11101111011111000000000110000001111100011111000000001111111110000000111111111\n\nSample Output 3\n\n697354558", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3679, "cpu_time_ms": 575, "memory_kb": 192900}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s757702105", "group_id": "codeNet:p02639", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n for (int i = 0; i < 5; i++) {\n if(scanner.nextInt() == 0){\n System.out.println(i + 1);\n break;\n }\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1592682643, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02639.html", "problem_id": "p02639", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02639/input.txt", "sample_output_relpath": "derived/input_output/data/p02639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02639/Java/s757702105.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s757702105", "user_id": "u921044712"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n for (int i = 0; i < 5; i++) {\n if(scanner.nextInt() == 0){\n System.out.println(i + 1);\n break;\n }\n }\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "sample_input": "0 2 3 4 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02639", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 318, "cpu_time_ms": 113, "memory_kb": 35624}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s610417386", "group_id": "codeNet:p02639", "input_text": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.lang.reflect.Array;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic class Main {\n public static void main(final String[] args) {\n final FastScanner scanner = new FastScanner(System.in);\n final int answer = IntStream.rangeClosed(1, 5)\n .mapToObj(i -> scanner.nextInt())\n .collect(Collectors.toList())\n .indexOf(0) + 1;\n System.out.println(answer);\n }\n\n private static class FastScanner {\n private final BufferedReader reader;\n private StringTokenizer tokenizer;\n\n FastScanner(final InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (final IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (final IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1592182919, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02639.html", "problem_id": "p02639", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02639/input.txt", "sample_output_relpath": "derived/input_output/data/p02639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02639/Java/s610417386.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s610417386", "user_id": "u476482490"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.lang.reflect.Array;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic class Main {\n public static void main(final String[] args) {\n final FastScanner scanner = new FastScanner(System.in);\n final int answer = IntStream.rangeClosed(1, 5)\n .mapToObj(i -> scanner.nextInt())\n .collect(Collectors.toList())\n .indexOf(0) + 1;\n System.out.println(answer);\n }\n\n private static class FastScanner {\n private final BufferedReader reader;\n private StringTokenizer tokenizer;\n\n FastScanner(final InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (final IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (final IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "sample_input": "0 2 3 4 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02639", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1862, "cpu_time_ms": 86, "memory_kb": 34264}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s455005939", "group_id": "codeNet:p02640", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n if((x * 2 <= y) && (y <= x * 4) && (y % 2 == 0)) {\n\t\tSystem.out.println(\"Yes\");\n\t\t}else{\n\t\tSystem.out.println(\"No\");\n\t\t}\n }\n}", "language": "Java", "metadata": {"date": 1594326386, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02640/input.txt", "sample_output_relpath": "derived/input_output/data/p02640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02640/Java/s455005939.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s455005939", "user_id": "u926352007"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n if((x * 2 <= y) && (y <= x * 4) && (y % 2 == 0)) {\n\t\tSystem.out.println(\"Yes\");\n\t\t}else{\n\t\tSystem.out.println(\"No\");\n\t\t}\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 327, "cpu_time_ms": 120, "memory_kb": 35584}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s472950033", "group_id": "codeNet:p02640", "input_text": "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\tint n=in.nextInt();\n\t\tint k=in.nextInt();\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tif((k-(i*2))%4==0)\n\t\t\t{\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"NO\");\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1592190724, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02640/input.txt", "sample_output_relpath": "derived/input_output/data/p02640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02640/Java/s472950033.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s472950033", "user_id": "u597558557"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\tScanner in = new Scanner(System.in);\n\t\tint n=in.nextInt();\n\t\tint k=in.nextInt();\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tif((k-(i*2))%4==0)\n\t\t\t{\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"NO\");\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 352, "cpu_time_ms": 130, "memory_kb": 35840}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s655331419", "group_id": "codeNet:p02640", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\t//スキャナー\n\t\tScanner s = new Scanner(System.in);\n\n\t\tint numx = s.nextInt();\n\t\tint numy = s.nextInt();\n\t\t\n\t\ts.close();\n\t\t\n\t\t//true=Yes\n\t\tboolean ans = true;\n\t\t\n\t\tif(numy % 2 == 1) {\n\t\t\tans = false;\n\t\t}\n\t\tif(numy < numx * 2 || numy > numx * 4 ) {\n\t\t\tans = false;\n\t\t}\n\t\t\n\t\tif(ans) {\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}else {\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1592184619, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02640/input.txt", "sample_output_relpath": "derived/input_output/data/p02640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02640/Java/s655331419.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s655331419", "user_id": "u795990458"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\t//スキャナー\n\t\tScanner s = new Scanner(System.in);\n\n\t\tint numx = s.nextInt();\n\t\tint numy = s.nextInt();\n\t\t\n\t\ts.close();\n\t\t\n\t\t//true=Yes\n\t\tboolean ans = true;\n\t\t\n\t\tif(numy % 2 == 1) {\n\t\t\tans = false;\n\t\t}\n\t\tif(numy < numx * 2 || numy > numx * 4 ) {\n\t\t\tans = false;\n\t\t}\n\t\t\n\t\tif(ans) {\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}else {\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 459, "cpu_time_ms": 104, "memory_kb": 35748}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s036294107", "group_id": "codeNet:p02640", "input_text": "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc= new Scanner(System.in);\n int X = sc.nextInt();\n int Y = sc.nextInt();\n String ans = \"No\";\n if(X < 51){\n for(int i = 0; i <= X; i++){\n int j = X - i;\n int leg = 2 * i + 4 * j;\n System.out.println(leg);\n if(leg == Y) ans = \"Yes\";\n }\n }\n System.out.println(ans);\n } \n}", "language": "Java", "metadata": {"date": 1592184229, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02640/input.txt", "sample_output_relpath": "derived/input_output/data/p02640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02640/Java/s036294107.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s036294107", "user_id": "u950333884"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc= new Scanner(System.in);\n int X = sc.nextInt();\n int Y = sc.nextInt();\n String ans = \"No\";\n if(X < 51){\n for(int i = 0; i <= X; i++){\n int j = X - i;\n int leg = 2 * i + 4 * j;\n System.out.println(leg);\n if(leg == Y) ans = \"Yes\";\n }\n }\n System.out.println(ans);\n } \n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 459, "cpu_time_ms": 85, "memory_kb": 27036}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s287876045", "group_id": "codeNet:p02640", "input_text": "\nimport java.util.Scanner;\n\npublic class Main {\n static Scanner sc = new Scanner(System.in);\n public static void main(String[] args) {\n int x = sc.nextInt();//头数量\n int y = sc.nextInt();//脚数量\n boolean flag = false;\n for(int i = 0; i <= x; i++){\n if ((x-i)*4+i*2==y) {\n flag = true;\n break;\n }\n }\n\n System.out.println(flag?\"Yes\":\"No\");\n }\n}", "language": "Java", "metadata": {"date": 1592183654, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02640/input.txt", "sample_output_relpath": "derived/input_output/data/p02640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02640/Java/s287876045.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s287876045", "user_id": "u226917791"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nimport java.util.Scanner;\n\npublic class Main {\n static Scanner sc = new Scanner(System.in);\n public static void main(String[] args) {\n int x = sc.nextInt();//头数量\n int y = sc.nextInt();//脚数量\n boolean flag = false;\n for(int i = 0; i <= x; i++){\n if ((x-i)*4+i*2==y) {\n flag = true;\n break;\n }\n }\n\n System.out.println(flag?\"Yes\":\"No\");\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 453, "cpu_time_ms": 82, "memory_kb": 27004}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s564606815", "group_id": "codeNet:p02640", "input_text": "import java.util.*;\nimport java.util.stream.Collectors;\nimport java.io.*;\nimport java.nio.charset.StandardCharsets;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);\n\t\tBufferedReader in = new BufferedReader(reader);\n\t\tMain ins = new Main(in);\n\t\tins.calc();\n\t\tins.showResult();\n\t}\n\n\tMain(BufferedReader in) throws IOException {\n\t\tString[] tokens = in.readLine().split(\" \");\n\t\tint X = Integer.parseInt(tokens[0]);\n\t\tint Y = Integer.parseInt(tokens[1]);\n\n\t\tint temp = Y - (X * 2);\n\t\tif (temp % 2 != 0) {\n\t\t\tSystem.out.println(\"No\");\n\t\t} else {\n\t\t\ttemp /= 2;\n\t\t\tif (temp <= X) {\n\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"No\");\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid calc() {\n\t}\n\n\tvoid showResult() {\n\t}\n}\n", "language": "Java", "metadata": {"date": 1592183121, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02640/input.txt", "sample_output_relpath": "derived/input_output/data/p02640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02640/Java/s564606815.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s564606815", "user_id": "u655125439"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\nimport java.util.stream.Collectors;\nimport java.io.*;\nimport java.nio.charset.StandardCharsets;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);\n\t\tBufferedReader in = new BufferedReader(reader);\n\t\tMain ins = new Main(in);\n\t\tins.calc();\n\t\tins.showResult();\n\t}\n\n\tMain(BufferedReader in) throws IOException {\n\t\tString[] tokens = in.readLine().split(\" \");\n\t\tint X = Integer.parseInt(tokens[0]);\n\t\tint Y = Integer.parseInt(tokens[1]);\n\n\t\tint temp = Y - (X * 2);\n\t\tif (temp % 2 != 0) {\n\t\t\tSystem.out.println(\"No\");\n\t\t} else {\n\t\t\ttemp /= 2;\n\t\t\tif (temp <= X) {\n\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"No\");\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid calc() {\n\t}\n\n\tvoid showResult() {\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 825, "cpu_time_ms": 70, "memory_kb": 32668}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s480212576", "group_id": "codeNet:p02641", "input_text": "\n\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint x = sc.nextInt();\n\t\tint n = sc.nextInt();\n\t\tint p;\n\n\t\tArrayList array = new ArrayList();\n\t\tfor(int i=0 ; i<100 ; i++) {\n\t\t\tarray.add(i+1);\n\t\t}\n\n\t\tfor(int i=0; i array = new ArrayList();\n\t\tfor(int i=0 ; i<100 ; i++) {\n\t\t\tarray.add(i+1);\n\t\t}\n\n\t\tfor(int i=0; i del_list;\n\n AtCoder(FastScanner sc) {\n X = sc.nextInt();\n N = sc.nextInt();\n if (N != 0) {\n del_list = new ArrayList<>();\n for (int i = 0; i < N; i++) {\n del_list.add(sc.nextInt());\n }\n }\n }\n\n void solve(PrintWriter out) {\n if (N == 0) {\n out.println(X);\n return;\n }\n List list = new ArrayList<>();\n for (int i = -10000; i <= 10000; i++) {\n list.add(i);\n }\n list.removeAll(del_list);\n int min = Integer.MAX_VALUE;\n int ans = 0;\n for (int i : list) {\n int abs = Math.abs(X - i);\n// out.println(i + \" \" + abs);\n if (min > abs) {\n min = abs;\n ans = i;\n }\n }\n out.println(ans);\n }\n\n}\n\nclass FastScanner {\n\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] arrayInt(int N) {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n\n public long[] arrayLong(int N) {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n\n public double[] arrayDouble(int N) {\n double[] array = new double[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n public String[] arrayString(int N) {\n String[] array = new String[N];\n for (int i = 0; i < N; i++) {\n array[i] = next();\n }\n return array;\n }\n}\n\nclass My {\n\n static void ans(boolean b) {\n System.out.println(b ? \"Yes\" : \"No\");\n }\n\n static void ANS(boolean b) {\n System.out.println(b ? \"YES\" : \"NO\");\n }\n\n static String sort(String s) {\n char[] ch = s.toCharArray();\n Arrays.sort(ch);\n return String.valueOf(ch);\n }\n\n static String reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n static int[] reverse(int[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long[] reverse(long[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static double[] reverse(double[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static String[] reverse(String[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static char[] reverse(char[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long min(long... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static int min(int... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static double min(double... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static long max(long... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int max(int... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static double max(double... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int sum(long number) {\n int sum = 0;\n while (number > 0) {\n sum += number % 10;\n number /= 10;\n }\n return sum;\n }\n\n static Map tally(int[] array) {\n Map map = new TreeMap<>();\n for (int k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(long[] array) {\n Map map = new TreeMap<>();\n for (long k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(double[] array) {\n Map map = new TreeMap<>();\n for (double k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(String[] array) {\n Map map = new TreeMap<>();\n for (String k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(char[] array) {\n Map map = new TreeMap<>();\n for (char k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n}\n", "language": "Java", "metadata": {"date": 1592185556, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02641.html", "problem_id": "p02641", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02641/input.txt", "sample_output_relpath": "derived/input_output/data/p02641/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02641/Java/s832085724.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s832085724", "user_id": "u871244227"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "\nimport java.text.DecimalFormat;\nimport java.util.stream.LongStream;\nimport java.util.stream.IntStream;\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n\n AtCoder problem = new AtCoder(sc);\n problem.solve(out);\n\n out.flush();\n }\n\n}\n\nclass AtCoder {\n\n int X, N;\n List del_list;\n\n AtCoder(FastScanner sc) {\n X = sc.nextInt();\n N = sc.nextInt();\n if (N != 0) {\n del_list = new ArrayList<>();\n for (int i = 0; i < N; i++) {\n del_list.add(sc.nextInt());\n }\n }\n }\n\n void solve(PrintWriter out) {\n if (N == 0) {\n out.println(X);\n return;\n }\n List list = new ArrayList<>();\n for (int i = -10000; i <= 10000; i++) {\n list.add(i);\n }\n list.removeAll(del_list);\n int min = Integer.MAX_VALUE;\n int ans = 0;\n for (int i : list) {\n int abs = Math.abs(X - i);\n// out.println(i + \" \" + abs);\n if (min > abs) {\n min = abs;\n ans = i;\n }\n }\n out.println(ans);\n }\n\n}\n\nclass FastScanner {\n\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] arrayInt(int N) {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n\n public long[] arrayLong(int N) {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n\n public double[] arrayDouble(int N) {\n double[] array = new double[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n public String[] arrayString(int N) {\n String[] array = new String[N];\n for (int i = 0; i < N; i++) {\n array[i] = next();\n }\n return array;\n }\n}\n\nclass My {\n\n static void ans(boolean b) {\n System.out.println(b ? \"Yes\" : \"No\");\n }\n\n static void ANS(boolean b) {\n System.out.println(b ? \"YES\" : \"NO\");\n }\n\n static String sort(String s) {\n char[] ch = s.toCharArray();\n Arrays.sort(ch);\n return String.valueOf(ch);\n }\n\n static String reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n static int[] reverse(int[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long[] reverse(long[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static double[] reverse(double[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static String[] reverse(String[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static char[] reverse(char[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long min(long... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static int min(int... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static double min(double... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static long max(long... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int max(int... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static double max(double... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int sum(long number) {\n int sum = 0;\n while (number > 0) {\n sum += number % 10;\n number /= 10;\n }\n return sum;\n }\n\n static Map tally(int[] array) {\n Map map = new TreeMap<>();\n for (int k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(long[] array) {\n Map map = new TreeMap<>();\n for (long k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(double[] array) {\n Map map = new TreeMap<>();\n for (double k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(String[] array) {\n Map map = new TreeMap<>();\n for (String k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(char[] array) {\n Map map = new TreeMap<>();\n for (char k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "sample_input": "6 5\n4 7 10 6 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02641", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8257, "cpu_time_ms": 128, "memory_kb": 34036}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s879006116", "group_id": "codeNet:p02641", "input_text": "import java.util.*;\n\npublic class Main{\n public static void main(String args[]){\n Scanner sn = new Scanner(System.in);\n int X = sn.nextInt();\n int N = sn.nextInt();\n List pList = new ArrayList<>();\n\n if(N == 0) System.out.println(X);\n else{\n for(int i=0; i pList = new ArrayList<>();\n\n if(N == 0) System.out.println(X);\n else{\n for(int i=0; i q = new LinkedList<>();\n q.add(new pair(x1, y1));\n dist[x1][y1] = 0;\n vis[x1][y1] = true;\n int ans = Integer.MAX_VALUE;\n while (q.size() > 0) {\n pair cur = q.poll();\n if (cur.a == x2 && cur.b == y2) {\n ans = Math.min(ans, dist[x2][y2]);\n break;\n }\n for (int i = 0; i < 4; i++) {\n for (int c = 1; c <= k; c++) {\n// if(cur.a ==0&&cur.b==3){\n// pw.println(cur.a+c*dx[i]+\" \"+(cur.b+c*dy[i]));\n// }\n if (valid(cur.a + c * dx[i], cur.b + c * dy[i], n, m) && grid[cur.a + c * dx[i]][cur.b + c * dy[i]] == 0) {\n if (!vis[cur.a + c * dx[i]][cur.b + c * dy[i]])\n if (1 + dist[cur.a][cur.b] < dist[cur.a + c * dx[i]][cur.b + c * dy[i]]) {\n vis[cur.a + c * dx[i]][cur.b + c * dy[i]] = true;\n dist[cur.a + c * dx[i]][cur.b + c * dy[i]] = 1 + dist[cur.a][cur.b];\n q.add(new pair(cur.a + c * dx[i], cur.b + c * dy[i]));\n } else break;\n } else break;\n }\n }\n }\n// for(int []x:dist){\n// for(int y :x){\n// pw.print((y==1000000?-1:y)+\" \");\n// }pw.println();\n// }\n pw.println(ans == Integer.MAX_VALUE ? -1 : ans);\n\n }\n\n boolean valid(int i, int j, int n, int m) {\n if (i < 0) return false;\n if (i >= n) return false;\n if (j < 0) return false;\n if (j >= m) return false;\n return true;\n }\n\n public class pair implements Comparable {\n int a;\n int b;\n\n public pair(int a, int b) {\n this.a = a;\n this.b = b;\n }\n\n public int compareTo(pair pair) {\n return a - pair.a == 0 ? b - pair.b : a - pair.a;\n }\n\n }\n\n }\n\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(FileReader r) {\n br = new BufferedReader(r);\n }\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public String nextLine() {\n try {\n return br.readLine();\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1594416615, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02644.html", "problem_id": "p02644", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02644/input.txt", "sample_output_relpath": "derived/input_output/data/p02644/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02644/Java/s289245155.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s289245155", "user_id": "u089230684"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\nimport java.util.Queue;\nimport java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.util.LinkedList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n APondSkater solver = new APondSkater();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class APondSkater {\n public void solve(int testNumber, Scanner sc, PrintWriter pw) {\n int n = sc.nextInt();\n int m = sc.nextInt();\n int k = sc.nextInt();\n int[][] grid = new int[n][m];\n int[][] dist = new int[n][m];\n for (int[] x : dist) Arrays.fill(x, 1000000);\n int[] dx = {-1, 0, 1, 0};\n int[] dy = {0, -1, 0, 1};\n int x1 = sc.nextInt() - 1;\n int y1 = sc.nextInt() - 1;\n int x2 = sc.nextInt() - 1;\n int y2 = sc.nextInt() - 1;\n for (int i = 0; i < n; i++) {\n char[] tmp = sc.nextLine().toCharArray();\n for (int j = 0; j < m; j++) {\n grid[i][j] = (tmp[j] == '@' ? 1 : 0);\n }\n }\n boolean[][] vis = new boolean[n][m];\n Queue q = new LinkedList<>();\n q.add(new pair(x1, y1));\n dist[x1][y1] = 0;\n vis[x1][y1] = true;\n int ans = Integer.MAX_VALUE;\n while (q.size() > 0) {\n pair cur = q.poll();\n if (cur.a == x2 && cur.b == y2) {\n ans = Math.min(ans, dist[x2][y2]);\n break;\n }\n for (int i = 0; i < 4; i++) {\n for (int c = 1; c <= k; c++) {\n// if(cur.a ==0&&cur.b==3){\n// pw.println(cur.a+c*dx[i]+\" \"+(cur.b+c*dy[i]));\n// }\n if (valid(cur.a + c * dx[i], cur.b + c * dy[i], n, m) && grid[cur.a + c * dx[i]][cur.b + c * dy[i]] == 0) {\n if (!vis[cur.a + c * dx[i]][cur.b + c * dy[i]])\n if (1 + dist[cur.a][cur.b] < dist[cur.a + c * dx[i]][cur.b + c * dy[i]]) {\n vis[cur.a + c * dx[i]][cur.b + c * dy[i]] = true;\n dist[cur.a + c * dx[i]][cur.b + c * dy[i]] = 1 + dist[cur.a][cur.b];\n q.add(new pair(cur.a + c * dx[i], cur.b + c * dy[i]));\n } else break;\n } else break;\n }\n }\n }\n// for(int []x:dist){\n// for(int y :x){\n// pw.print((y==1000000?-1:y)+\" \");\n// }pw.println();\n// }\n pw.println(ans == Integer.MAX_VALUE ? -1 : ans);\n\n }\n\n boolean valid(int i, int j, int n, int m) {\n if (i < 0) return false;\n if (i >= n) return false;\n if (j < 0) return false;\n if (j >= m) return false;\n return true;\n }\n\n public class pair implements Comparable {\n int a;\n int b;\n\n public pair(int a, int b) {\n this.a = a;\n this.b = b;\n }\n\n public int compareTo(pair pair) {\n return a - pair.a == 0 ? b - pair.b : a - pair.a;\n }\n\n }\n\n }\n\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(FileReader r) {\n br = new BufferedReader(r);\n }\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public String next() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public String nextLine() {\n try {\n return br.readLine();\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n\n }\n}\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.\n\nSome of the squares have a lotus leaf on it and cannot be entered.\nThe square (i,j) has a lotus leaf on it if c_{ij} is @, and it does not if c_{ij} is ..\n\nIn one stroke, Snuke can move between 1 and K squares (inclusive) toward one of the four directions: north, east, south, and west.\nThe move may not pass through a square with a lotus leaf. Moving to such a square or out of the pond is also forbidden.\n\nFind the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2).\nIf the travel from (x_1,y_1) to (x_2,y_2) is impossible, point out that fact.\n\nConstraints\n\n1 \\leq H,W,K \\leq 10^6\n\nH \\times W \\leq 10^6\n\n1 \\leq x_1,x_2 \\leq H\n\n1 \\leq y_1,y_2 \\leq W\n\nx_1 \\neq x_2 or y_1 \\neq y_2.\n\nc_{i,j} is . or @.\n\nc_{x_1,y_1} = .\n\nc_{x_2,y_2} = .\n\nAll numbers in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nx_1 y_1 x_2 y_2\nc_{1,1}c_{1,2} .. c_{1,W}\nc_{2,1}c_{2,2} .. c_{2,W}\n:\nc_{H,1}c_{H,2} .. c_{H,W}\n\nOutput\n\nPrint the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2), or print -1 if the travel is impossible.\n\nSample Input 1\n\n3 5 2\n3 2 3 4\n.....\n.@..@\n..@..\n\nSample Output 1\n\n5\n\nInitially, Snuke is at the square (3,2).\nHe can reach the square (3, 4) by making five strokes as follows:\n\nFrom (3, 2), go west one square to (3, 1).\n\nFrom (3, 1), go north two squares to (1, 1).\n\nFrom (1, 1), go east two squares to (1, 3).\n\nFrom (1, 3), go east one square to (1, 4).\n\nFrom (1, 4), go south two squares to (3, 4).\n\nSample Input 2\n\n1 6 4\n1 1 1 6\n......\n\nSample Output 2\n\n2\n\nSample Input 3\n\n3 3 1\n2 1 2 3\n.@.\n.@.\n.@.\n\nSample Output 3\n\n-1", "sample_input": "3 5 2\n3 2 3 4\n.....\n.@..@\n..@..\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02644", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.\n\nSome of the squares have a lotus leaf on it and cannot be entered.\nThe square (i,j) has a lotus leaf on it if c_{ij} is @, and it does not if c_{ij} is ..\n\nIn one stroke, Snuke can move between 1 and K squares (inclusive) toward one of the four directions: north, east, south, and west.\nThe move may not pass through a square with a lotus leaf. Moving to such a square or out of the pond is also forbidden.\n\nFind the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2).\nIf the travel from (x_1,y_1) to (x_2,y_2) is impossible, point out that fact.\n\nConstraints\n\n1 \\leq H,W,K \\leq 10^6\n\nH \\times W \\leq 10^6\n\n1 \\leq x_1,x_2 \\leq H\n\n1 \\leq y_1,y_2 \\leq W\n\nx_1 \\neq x_2 or y_1 \\neq y_2.\n\nc_{i,j} is . or @.\n\nc_{x_1,y_1} = .\n\nc_{x_2,y_2} = .\n\nAll numbers in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nx_1 y_1 x_2 y_2\nc_{1,1}c_{1,2} .. c_{1,W}\nc_{2,1}c_{2,2} .. c_{2,W}\n:\nc_{H,1}c_{H,2} .. c_{H,W}\n\nOutput\n\nPrint the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2), or print -1 if the travel is impossible.\n\nSample Input 1\n\n3 5 2\n3 2 3 4\n.....\n.@..@\n..@..\n\nSample Output 1\n\n5\n\nInitially, Snuke is at the square (3,2).\nHe can reach the square (3, 4) by making five strokes as follows:\n\nFrom (3, 2), go west one square to (3, 1).\n\nFrom (3, 1), go north two squares to (1, 1).\n\nFrom (1, 1), go east two squares to (1, 3).\n\nFrom (1, 3), go east one square to (1, 4).\n\nFrom (1, 4), go south two squares to (3, 4).\n\nSample Input 2\n\n1 6 4\n1 1 1 6\n......\n\nSample Output 2\n\n2\n\nSample Input 3\n\n3 3 1\n2 1 2 3\n.@.\n.@.\n.@.\n\nSample Output 3\n\n-1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4832, "cpu_time_ms": 3310, "memory_kb": 56520}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s857013154", "group_id": "codeNet:p02646", "input_text": "import java.io.*;\nimport java.util.*;\nclass Main{\n\tstatic final long MOD = 1_000_000_007; // 10^9+7\n static final int MAX = 2_147_483_646; // intMax \n static final int INF = 1_000_000_000; // 10^9 \n public static void main(String[] args) throws Exception {\n\t\thayami saori = new hayami();\n\t\tlong a = saori.saorihayami();\n\t\tlong v = saori.saorihayami();\n\t\tlong b = saori.saorihayami();\n\t\tlong w = saori.saorihayami();\n\t\tlong t = saori.saorihayami();\n\t\tif(a < b){\n\t\t\tif(a+v*t >= b+w*t){\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t}\n\t\t} else {\n\t\t\tif(a+v*t <= b+w*t){\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t}\n\t\t}\n\n\t\tsaori.close();\n }\n}\n\nclass hayami implements Closeable {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] hayami = new byte[1024];\n\tprivate int Hayami = 0;\n\tprivate int saori = 0;\n\tprivate boolean HayamiSaori() {\n\t\tif (Hayami < saori) {\n\t\t\treturn true;\n\t\t}else{\n\t\t\tHayami = 0;\n\t\t\ttry {\n\t\t\t\tsaori = in.read(hayami);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (saori <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tprivate int SaoriHayami() { \n\t\tif (HayamiSaori()) {\n return hayami[Hayami++];\n }else{\n return -1;\n }\n\t}\n\tprivate static boolean hayami_saori(int hayami) { \n\t\treturn 33 <= hayami && hayami <= 126;\n\t}\n\tpublic boolean hayamisaori() { \n\t\twhile(HayamiSaori() && !hayami_saori(hayami[Hayami])) Hayami++; return HayamiSaori();\n\t}\n\tpublic String nextHayami() {\n\t\tif (!hayamisaori()) throw new NoSuchElementException();\n\t\tStringBuilder hayamin = new StringBuilder();\n\t\tint saori = SaoriHayami();\n\t\twhile(hayami_saori(saori)) {\n\t\t\thayamin.appendCodePoint(saori);\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t\treturn hayamin.toString();\n\t}\n\tpublic long saorihayami() {//nextLong\n\t\tif (!hayamisaori()) throw new NoSuchElementException();\n\t\tlong hayami = 0;\n\t\tboolean misao = false;\n\t\tint saori = SaoriHayami();\n\t\tif (saori == '-') {\n\t\t\tmisao = true;\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t\tif (saori < '0' || '9' < saori) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= saori && saori <= '9') {\n\t\t\t\thayami *= 10;\n\t\t\t\thayami += saori - '0';\n\t\t\t}else if(saori == -1 || !hayami_saori(saori)){\n\t\t\t\treturn misao ? -hayami : hayami;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t}\n\tpublic int saori_hayami() {//nextInt\n\t\tlong hayami = saorihayami();\n\t\tif (hayami < Integer.MIN_VALUE || hayami > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) hayami;\n\t}\n\tpublic double Hayamin() { //nextDouble\n\t\treturn Double.parseDouble(nextHayami());\n\t}\n\tpublic void close() {\n\t\ttry {\n\t\t\tin.close();\n\t\t} catch (IOException e) {\n\t\t}\n }\n \n}", "language": "Java", "metadata": {"date": 1592176228, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02646.html", "problem_id": "p02646", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02646/input.txt", "sample_output_relpath": "derived/input_output/data/p02646/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02646/Java/s857013154.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s857013154", "user_id": "u676749446"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nclass Main{\n\tstatic final long MOD = 1_000_000_007; // 10^9+7\n static final int MAX = 2_147_483_646; // intMax \n static final int INF = 1_000_000_000; // 10^9 \n public static void main(String[] args) throws Exception {\n\t\thayami saori = new hayami();\n\t\tlong a = saori.saorihayami();\n\t\tlong v = saori.saorihayami();\n\t\tlong b = saori.saorihayami();\n\t\tlong w = saori.saorihayami();\n\t\tlong t = saori.saorihayami();\n\t\tif(a < b){\n\t\t\tif(a+v*t >= b+w*t){\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t}\n\t\t} else {\n\t\t\tif(a+v*t <= b+w*t){\n\t\t\t\tSystem.out.println(\"YES\");\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"NO\");\n\t\t\t}\n\t\t}\n\n\t\tsaori.close();\n }\n}\n\nclass hayami implements Closeable {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] hayami = new byte[1024];\n\tprivate int Hayami = 0;\n\tprivate int saori = 0;\n\tprivate boolean HayamiSaori() {\n\t\tif (Hayami < saori) {\n\t\t\treturn true;\n\t\t}else{\n\t\t\tHayami = 0;\n\t\t\ttry {\n\t\t\t\tsaori = in.read(hayami);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (saori <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tprivate int SaoriHayami() { \n\t\tif (HayamiSaori()) {\n return hayami[Hayami++];\n }else{\n return -1;\n }\n\t}\n\tprivate static boolean hayami_saori(int hayami) { \n\t\treturn 33 <= hayami && hayami <= 126;\n\t}\n\tpublic boolean hayamisaori() { \n\t\twhile(HayamiSaori() && !hayami_saori(hayami[Hayami])) Hayami++; return HayamiSaori();\n\t}\n\tpublic String nextHayami() {\n\t\tif (!hayamisaori()) throw new NoSuchElementException();\n\t\tStringBuilder hayamin = new StringBuilder();\n\t\tint saori = SaoriHayami();\n\t\twhile(hayami_saori(saori)) {\n\t\t\thayamin.appendCodePoint(saori);\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t\treturn hayamin.toString();\n\t}\n\tpublic long saorihayami() {//nextLong\n\t\tif (!hayamisaori()) throw new NoSuchElementException();\n\t\tlong hayami = 0;\n\t\tboolean misao = false;\n\t\tint saori = SaoriHayami();\n\t\tif (saori == '-') {\n\t\t\tmisao = true;\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t\tif (saori < '0' || '9' < saori) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= saori && saori <= '9') {\n\t\t\t\thayami *= 10;\n\t\t\t\thayami += saori - '0';\n\t\t\t}else if(saori == -1 || !hayami_saori(saori)){\n\t\t\t\treturn misao ? -hayami : hayami;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t}\n\tpublic int saori_hayami() {//nextInt\n\t\tlong hayami = saorihayami();\n\t\tif (hayami < Integer.MIN_VALUE || hayami > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) hayami;\n\t}\n\tpublic double Hayamin() { //nextDouble\n\t\treturn Double.parseDouble(nextHayami());\n\t}\n\tpublic void close() {\n\t\ttry {\n\t\t\tin.close();\n\t\t} catch (IOException e) {\n\t\t}\n }\n \n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTwo children are playing tag on a number line. (In the game of tag, the child called \"it\" tries to catch the other child.) The child who is \"it\" is now at coordinate A, and he can travel the distance of V per second.\nThe other child is now at coordinate B, and she can travel the distance of W per second.\n\nHe can catch her when his coordinate is the same as hers.\nDetermine whether he can catch her within T seconds (including exactly T seconds later).\nWe assume that both children move optimally.\n\nConstraints\n\n-10^9 \\leq A,B \\leq 10^9\n\n1 \\leq V,W \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA V\nB W\nT\n\nOutput\n\nIf \"it\" can catch the other child, print YES; otherwise, print NO.\n\nSample Input 1\n\n1 2\n3 1\n3\n\nSample Output 1\n\nYES\n\nSample Input 2\n\n1 2\n3 2\n3\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n1 2\n3 3\n3\n\nSample Output 3\n\nNO", "sample_input": "1 2\n3 1\n3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02646", "source_text": "Score : 200 points\n\nProblem Statement\n\nTwo children are playing tag on a number line. (In the game of tag, the child called \"it\" tries to catch the other child.) The child who is \"it\" is now at coordinate A, and he can travel the distance of V per second.\nThe other child is now at coordinate B, and she can travel the distance of W per second.\n\nHe can catch her when his coordinate is the same as hers.\nDetermine whether he can catch her within T seconds (including exactly T seconds later).\nWe assume that both children move optimally.\n\nConstraints\n\n-10^9 \\leq A,B \\leq 10^9\n\n1 \\leq V,W \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA V\nB W\nT\n\nOutput\n\nIf \"it\" can catch the other child, print YES; otherwise, print NO.\n\nSample Input 1\n\n1 2\n3 1\n3\n\nSample Output 1\n\nYES\n\nSample Input 2\n\n1 2\n3 2\n3\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n1 2\n3 3\n3\n\nSample Output 3\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2765, "cpu_time_ms": 69, "memory_kb": 32504}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s303978829", "group_id": "codeNet:p02646", "input_text": "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner scn = new Scanner(System.in);\n \tint A,B,V,W,T,tmp;\n A = scn.nextInt();\n V = scn.nextInt();\n B = scn.nextInt();\n W = scn.nextInt();\n T = scn.nextInt();\n if (A == B){\n System.out.print(\"YES\");\n }else if (V > W){\n tmp = V-W;\n if (tmp*(T+1)+A >= B){\n\t\tSystem.out.print(\"YES\");\n }else{\n System.out.print(\"NO\");\n }\n }else{\n System.out.print(\"NO\");\n }\n }\n}", "language": "Java", "metadata": {"date": 1592101840, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02646.html", "problem_id": "p02646", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02646/input.txt", "sample_output_relpath": "derived/input_output/data/p02646/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02646/Java/s303978829.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s303978829", "user_id": "u254809296"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner scn = new Scanner(System.in);\n \tint A,B,V,W,T,tmp;\n A = scn.nextInt();\n V = scn.nextInt();\n B = scn.nextInt();\n W = scn.nextInt();\n T = scn.nextInt();\n if (A == B){\n System.out.print(\"YES\");\n }else if (V > W){\n tmp = V-W;\n if (tmp*(T+1)+A >= B){\n\t\tSystem.out.print(\"YES\");\n }else{\n System.out.print(\"NO\");\n }\n }else{\n System.out.print(\"NO\");\n }\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTwo children are playing tag on a number line. (In the game of tag, the child called \"it\" tries to catch the other child.) The child who is \"it\" is now at coordinate A, and he can travel the distance of V per second.\nThe other child is now at coordinate B, and she can travel the distance of W per second.\n\nHe can catch her when his coordinate is the same as hers.\nDetermine whether he can catch her within T seconds (including exactly T seconds later).\nWe assume that both children move optimally.\n\nConstraints\n\n-10^9 \\leq A,B \\leq 10^9\n\n1 \\leq V,W \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA V\nB W\nT\n\nOutput\n\nIf \"it\" can catch the other child, print YES; otherwise, print NO.\n\nSample Input 1\n\n1 2\n3 1\n3\n\nSample Output 1\n\nYES\n\nSample Input 2\n\n1 2\n3 2\n3\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n1 2\n3 3\n3\n\nSample Output 3\n\nNO", "sample_input": "1 2\n3 1\n3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02646", "source_text": "Score : 200 points\n\nProblem Statement\n\nTwo children are playing tag on a number line. (In the game of tag, the child called \"it\" tries to catch the other child.) The child who is \"it\" is now at coordinate A, and he can travel the distance of V per second.\nThe other child is now at coordinate B, and she can travel the distance of W per second.\n\nHe can catch her when his coordinate is the same as hers.\nDetermine whether he can catch her within T seconds (including exactly T seconds later).\nWe assume that both children move optimally.\n\nConstraints\n\n-10^9 \\leq A,B \\leq 10^9\n\n1 \\leq V,W \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA V\nB W\nT\n\nOutput\n\nIf \"it\" can catch the other child, print YES; otherwise, print NO.\n\nSample Input 1\n\n1 2\n3 1\n3\n\nSample Output 1\n\nYES\n\nSample Input 2\n\n1 2\n3 2\n3\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n1 2\n3 3\n3\n\nSample Output 3\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 508, "cpu_time_ms": 107, "memory_kb": 35820}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s664128426", "group_id": "codeNet:p02646", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n double A = sc.nextDouble();\n double V = sc.nextDouble();\n double B = sc.nextDouble();\n double W = sc.nextDouble();\n double T = sc.nextDouble();\n\n for (int i = 1; i <= T; i++) {\n if (A == B) {\n System.out.println(\"YES\");\n return;\n }\n if (A < B) {\n A = A + V;\n B = B + W;\n } else if (A > B) {\n A = A;\n B = B + W * i;\n }\n }\n System.out.println(\"NO\");\n }\n}", "language": "Java", "metadata": {"date": 1592099411, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02646.html", "problem_id": "p02646", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02646/input.txt", "sample_output_relpath": "derived/input_output/data/p02646/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02646/Java/s664128426.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s664128426", "user_id": "u832598826"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n double A = sc.nextDouble();\n double V = sc.nextDouble();\n double B = sc.nextDouble();\n double W = sc.nextDouble();\n double T = sc.nextDouble();\n\n for (int i = 1; i <= T; i++) {\n if (A == B) {\n System.out.println(\"YES\");\n return;\n }\n if (A < B) {\n A = A + V;\n B = B + W;\n } else if (A > B) {\n A = A;\n B = B + W * i;\n }\n }\n System.out.println(\"NO\");\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTwo children are playing tag on a number line. (In the game of tag, the child called \"it\" tries to catch the other child.) The child who is \"it\" is now at coordinate A, and he can travel the distance of V per second.\nThe other child is now at coordinate B, and she can travel the distance of W per second.\n\nHe can catch her when his coordinate is the same as hers.\nDetermine whether he can catch her within T seconds (including exactly T seconds later).\nWe assume that both children move optimally.\n\nConstraints\n\n-10^9 \\leq A,B \\leq 10^9\n\n1 \\leq V,W \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA V\nB W\nT\n\nOutput\n\nIf \"it\" can catch the other child, print YES; otherwise, print NO.\n\nSample Input 1\n\n1 2\n3 1\n3\n\nSample Output 1\n\nYES\n\nSample Input 2\n\n1 2\n3 2\n3\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n1 2\n3 3\n3\n\nSample Output 3\n\nNO", "sample_input": "1 2\n3 1\n3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02646", "source_text": "Score : 200 points\n\nProblem Statement\n\nTwo children are playing tag on a number line. (In the game of tag, the child called \"it\" tries to catch the other child.) The child who is \"it\" is now at coordinate A, and he can travel the distance of V per second.\nThe other child is now at coordinate B, and she can travel the distance of W per second.\n\nHe can catch her when his coordinate is the same as hers.\nDetermine whether he can catch her within T seconds (including exactly T seconds later).\nWe assume that both children move optimally.\n\nConstraints\n\n-10^9 \\leq A,B \\leq 10^9\n\n1 \\leq V,W \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA V\nB W\nT\n\nOutput\n\nIf \"it\" can catch the other child, print YES; otherwise, print NO.\n\nSample Input 1\n\n1 2\n3 1\n3\n\nSample Output 1\n\nYES\n\nSample Input 2\n\n1 2\n3 2\n3\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n1 2\n3 3\n3\n\nSample Output 3\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 694, "cpu_time_ms": 2207, "memory_kb": 38072}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s239162242", "group_id": "codeNet:p02647", "input_text": "import java.util.*;\nimport java.io.*;\npublic class Main{\n public static void main(String[] main) throws Exception{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(br.readLine());\n PrintWriter out = new PrintWriter(System.out);\n int n = Integer.parseInt(st.nextToken());\n int k = Integer.parseInt(st.nextToken());\n st = new StringTokenizer(br.readLine());\n int[] a = new int[n];\n for(int i = 0; i < n; i++)\n \t a[i] = Integer.parseInt(st.nextToken());\n StringJoiner sj = new StringJoiner(\" \");\n if(k > Math.log(n)+1) {\n \t for(int i = 0; i < n; i++)\n \t\t sj.add(Integer.toString(n));\n }\n else {\n \t for(int i = 0; i < k; i++) {\n \t\t int[] b = new int[n];\n \t\t for(int j = 0; j < n; j++) {\n \t\t\t b[Math.max(0,j - a[j])]++;\n \t\t\t if(j + a[j] < n-1)\n \t\t\t\t b[j + a[j]+1]--;\n \t\t }\n \t\t for(int j = 1; j < n; j++) {\n \t\t\t b[j] += b[j-1];\n \t\t }\n \t\t a = b;\n \t }\n \t for(int i = 0; i < n; i++)\n \t\t sj.add(Integer.toString(a[i]));\n }\n out.println(sj);\n out.close();\n }\n}", "language": "Java", "metadata": {"date": 1593760236, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02647.html", "problem_id": "p02647", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02647/input.txt", "sample_output_relpath": "derived/input_output/data/p02647/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02647/Java/s239162242.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s239162242", "user_id": "u926632269"}, "prompt_components": {"gold_output": "1 2 2 1 2\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\npublic class Main{\n public static void main(String[] main) throws Exception{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(br.readLine());\n PrintWriter out = new PrintWriter(System.out);\n int n = Integer.parseInt(st.nextToken());\n int k = Integer.parseInt(st.nextToken());\n st = new StringTokenizer(br.readLine());\n int[] a = new int[n];\n for(int i = 0; i < n; i++)\n \t a[i] = Integer.parseInt(st.nextToken());\n StringJoiner sj = new StringJoiner(\" \");\n if(k > Math.log(n)+1) {\n \t for(int i = 0; i < n; i++)\n \t\t sj.add(Integer.toString(n));\n }\n else {\n \t for(int i = 0; i < k; i++) {\n \t\t int[] b = new int[n];\n \t\t for(int j = 0; j < n; j++) {\n \t\t\t b[Math.max(0,j - a[j])]++;\n \t\t\t if(j + a[j] < n-1)\n \t\t\t\t b[j + a[j]+1]--;\n \t\t }\n \t\t for(int j = 1; j < n; j++) {\n \t\t\t b[j] += b[j-1];\n \t\t }\n \t\t a = b;\n \t }\n \t for(int i = 0; i < n; i++)\n \t\t sj.add(Integer.toString(a[i]));\n }\n out.println(sj);\n out.close();\n }\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N bulbs arranged on a number line, numbered 1 to N from left to right.\nBulb i is at coordinate i.\n\nEach bulb has a non-negative integer parameter called intensity.\nWhen there is a bulb of intensity d at coordinate x, the bulb illuminates the segment from coordinate x-d-0.5 to x+d+0.5.\nInitially, the intensity of Bulb i is A_i. We will now do the following operation K times in a row:\n\nFor each integer i between 1 and N (inclusive), let B_i be the number of bulbs illuminating coordinate i. Then, change the intensity of each bulb i to B_i.\n\nFind the intensity of each bulb after the K operations.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the intensity A{'}_i of each bulb i after the K operations to Standard Output in the following format:\n\nA{'}_1 A{'}_2 \\ldots A{'}_N\n\nSample Input 1\n\n5 1\n1 0 0 1 0\n\nSample Output 1\n\n1 2 2 1 2\n\nInitially, only Bulb 1 illuminates coordinate 1, so the intensity of Bulb 1 becomes 1 after the operation.\nSimilarly, the bulbs initially illuminating coordinate 2 are Bulb 1 and 2, so the intensity of Bulb 2 becomes 2.\n\nSample Input 2\n\n5 2\n1 0 0 1 0\n\nSample Output 2\n\n3 3 4 4 3", "sample_input": "5 1\n1 0 0 1 0\n"}, "reference_outputs": ["1 2 2 1 2\n"], "source_document_id": "p02647", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N bulbs arranged on a number line, numbered 1 to N from left to right.\nBulb i is at coordinate i.\n\nEach bulb has a non-negative integer parameter called intensity.\nWhen there is a bulb of intensity d at coordinate x, the bulb illuminates the segment from coordinate x-d-0.5 to x+d+0.5.\nInitially, the intensity of Bulb i is A_i. We will now do the following operation K times in a row:\n\nFor each integer i between 1 and N (inclusive), let B_i be the number of bulbs illuminating coordinate i. Then, change the intensity of each bulb i to B_i.\n\nFind the intensity of each bulb after the K operations.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the intensity A{'}_i of each bulb i after the K operations to Standard Output in the following format:\n\nA{'}_1 A{'}_2 \\ldots A{'}_N\n\nSample Input 1\n\n5 1\n1 0 0 1 0\n\nSample Output 1\n\n1 2 2 1 2\n\nInitially, only Bulb 1 illuminates coordinate 1, so the intensity of Bulb 1 becomes 1 after the operation.\nSimilarly, the bulbs initially illuminating coordinate 2 are Bulb 1 and 2, so the intensity of Bulb 2 becomes 2.\n\nSample Input 2\n\n5 2\n1 0 0 1 0\n\nSample Output 2\n\n3 3 4 4 3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1164, "cpu_time_ms": 332, "memory_kb": 59444}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s509407028", "group_id": "codeNet:p02657", "input_text": "import java.util.Scanner;\nimport java.util.ArrayList;\n \npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int A,B;\n String an = scan.nextLine();\n String atai[] = an.split(\" \",0);\n A = Integer.parseInt(atai[0]);\n B = Integer.parseInt(atai[1]);\n //System.out.println(N);\n cal(A,B);\n scan.close();\n }\n \n public static void cal(int a,int b){\n int s = 0;\n s = a*b;\n System.out.println(s);\n return;\n }\n}", "language": "Java", "metadata": {"date": 1590973423, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02657.html", "problem_id": "p02657", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02657/input.txt", "sample_output_relpath": "derived/input_output/data/p02657/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02657/Java/s509407028.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s509407028", "user_id": "u302203300"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.util.Scanner;\nimport java.util.ArrayList;\n \npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n int A,B;\n String an = scan.nextLine();\n String atai[] = an.split(\" \",0);\n A = Integer.parseInt(atai[0]);\n B = Integer.parseInt(atai[1]);\n //System.out.println(N);\n cal(A,B);\n scan.close();\n }\n \n public static void cal(int a,int b){\n int s = 0;\n s = a*b;\n System.out.println(s);\n return;\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02657", "source_text": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 520, "cpu_time_ms": 103, "memory_kb": 35808}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s253906445", "group_id": "codeNet:p02660", "input_text": "import java.math.BigDecimal;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long n = sc.nextLong();\n Map primeList = primeFactorizationAsMap(n);\n if (primeList.size() == 0) {\n System.out.println(0);\n } else {\n int result = primeList.values().stream()\n .mapToInt(v -> {\n int count = 0;\n while (v > 0) {\n v = v - count - 1;\n if (v >= 0) {\n count++;\n }\n }\n return count;\n })\n .sum();\n System.out.println(result);\n }\n }\n\n private static Map primeFactorizationAsMap(long num) {\n if (num < 2) {\n return new HashMap<>();\n } else {\n Map result = new HashMap<>();\n long temp = num;\n double sqrt = Math.sqrt(num);\n for (int i = 2; i <= sqrt; i++) {\n int count = 0;\n while (temp % i == 0) {\n count++;\n temp = temp / i;\n }\n if (count != 0) {\n result.put((long) i, count);\n }\n }\n if (result.size() == 0) {\n result.put(num, 1);\n }\n return result;\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1590981686, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02660.html", "problem_id": "p02660", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02660/input.txt", "sample_output_relpath": "derived/input_output/data/p02660/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02660/Java/s253906445.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s253906445", "user_id": "u095434379"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.math.BigDecimal;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long n = sc.nextLong();\n Map primeList = primeFactorizationAsMap(n);\n if (primeList.size() == 0) {\n System.out.println(0);\n } else {\n int result = primeList.values().stream()\n .mapToInt(v -> {\n int count = 0;\n while (v > 0) {\n v = v - count - 1;\n if (v >= 0) {\n count++;\n }\n }\n return count;\n })\n .sum();\n System.out.println(result);\n }\n }\n\n private static Map primeFactorizationAsMap(long num) {\n if (num < 2) {\n return new HashMap<>();\n } else {\n Map result = new HashMap<>();\n long temp = num;\n double sqrt = Math.sqrt(num);\n for (int i = 2; i <= sqrt; i++) {\n int count = 0;\n while (temp % i == 0) {\n count++;\n temp = temp / i;\n }\n if (count != 0) {\n result.put((long) i, count);\n }\n }\n if (result.size() == 0) {\n result.put(num, 1);\n }\n return result;\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N. Consider repeatedly applying the operation below on N:\n\nFirst, choose a positive integer z satisfying all of the conditions below:\n\nz can be represented as z=p^e, where p is a prime number and e is a positive integer;\n\nz divides N;\n\nz is different from all integers chosen in previous operations.\n\nThen, replace N with N/z.\n\nFind the maximum number of times the operation can be applied.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum number of times the operation can be applied.\n\nSample Input 1\n\n24\n\nSample Output 1\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=12.)\n\nChoose z=3 (=3^1). (Now we have N=4.)\n\nChoose z=4 (=2^2). (Now we have N=1.)\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nWe cannot apply the operation at all.\n\nSample Input 3\n\n64\n\nSample Output 3\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=32.)\n\nChoose z=4 (=2^2). (Now we have N=8.)\n\nChoose z=8 (=2^3). (Now we have N=1.)\n\nSample Input 4\n\n1000000007\n\nSample Output 4\n\n1\n\nWe can apply the operation once by, for example, making the following choice:\n\nz=1000000007 (=1000000007^1). (Now we have N=1.)\n\nSample Input 5\n\n997764507000\n\nSample Output 5\n\n7", "sample_input": "24\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02660", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N. Consider repeatedly applying the operation below on N:\n\nFirst, choose a positive integer z satisfying all of the conditions below:\n\nz can be represented as z=p^e, where p is a prime number and e is a positive integer;\n\nz divides N;\n\nz is different from all integers chosen in previous operations.\n\nThen, replace N with N/z.\n\nFind the maximum number of times the operation can be applied.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum number of times the operation can be applied.\n\nSample Input 1\n\n24\n\nSample Output 1\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=12.)\n\nChoose z=3 (=3^1). (Now we have N=4.)\n\nChoose z=4 (=2^2). (Now we have N=1.)\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nWe cannot apply the operation at all.\n\nSample Input 3\n\n64\n\nSample Output 3\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=32.)\n\nChoose z=4 (=2^2). (Now we have N=8.)\n\nChoose z=8 (=2^3). (Now we have N=1.)\n\nSample Input 4\n\n1000000007\n\nSample Output 4\n\n1\n\nWe can apply the operation once by, for example, making the following choice:\n\nz=1000000007 (=1000000007^1). (Now we have N=1.)\n\nSample Input 5\n\n997764507000\n\nSample Output 5\n\n7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1630, "cpu_time_ms": 130, "memory_kb": 37400}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s519757428", "group_id": "codeNet:p02660", "input_text": "import java.util.*;\n\npublic class Main {\n\n private static final int MAX = 1000000;\n private static final long[] lp = new long[MAX + 1];\n private static final List pr = new ArrayList<>();\n\n static {\n for (int i = 2; i <= MAX; ++i) {\n if (lp[i] == 0) {\n lp[i] = i;\n pr.add(i);\n }\n for (int j = 0; j < pr.size() && pr.get(j) <= lp[i] && i*pr.get(j) <= MAX; ++j) {\n lp[i * pr.get(j)] = pr.get(j);\n }\n }\n }\n\n public static void main (String[] args) throws Exception {\n\n final Scanner in = new Scanner(System.in);\n long N = in.nextLong();\n final long NN = N;\n\n int count = 0;\n\n for (long prime = 2; prime*prime <= NN; ++prime) {\n if (lp[(int) prime] == prime && (N % prime == 0)) {\n int cnt = 0;\n while (N % prime == 0) {\n cnt++;\n N = N/prime;\n }\n int k = 0;\n int term = 1;\n\n while (cnt >= 0) {\n if (cnt >= term) {\n k++;\n cnt -= term;\n term++;\n } else {\n break;\n }\n }\n\n count += k;\n }\n }\n\n System.out.println(count);\n\n }\n}", "language": "Java", "metadata": {"date": 1590976483, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02660.html", "problem_id": "p02660", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02660/input.txt", "sample_output_relpath": "derived/input_output/data/p02660/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02660/Java/s519757428.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s519757428", "user_id": "u623384956"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n private static final int MAX = 1000000;\n private static final long[] lp = new long[MAX + 1];\n private static final List pr = new ArrayList<>();\n\n static {\n for (int i = 2; i <= MAX; ++i) {\n if (lp[i] == 0) {\n lp[i] = i;\n pr.add(i);\n }\n for (int j = 0; j < pr.size() && pr.get(j) <= lp[i] && i*pr.get(j) <= MAX; ++j) {\n lp[i * pr.get(j)] = pr.get(j);\n }\n }\n }\n\n public static void main (String[] args) throws Exception {\n\n final Scanner in = new Scanner(System.in);\n long N = in.nextLong();\n final long NN = N;\n\n int count = 0;\n\n for (long prime = 2; prime*prime <= NN; ++prime) {\n if (lp[(int) prime] == prime && (N % prime == 0)) {\n int cnt = 0;\n while (N % prime == 0) {\n cnt++;\n N = N/prime;\n }\n int k = 0;\n int term = 1;\n\n while (cnt >= 0) {\n if (cnt >= term) {\n k++;\n cnt -= term;\n term++;\n } else {\n break;\n }\n }\n\n count += k;\n }\n }\n\n System.out.println(count);\n\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N. Consider repeatedly applying the operation below on N:\n\nFirst, choose a positive integer z satisfying all of the conditions below:\n\nz can be represented as z=p^e, where p is a prime number and e is a positive integer;\n\nz divides N;\n\nz is different from all integers chosen in previous operations.\n\nThen, replace N with N/z.\n\nFind the maximum number of times the operation can be applied.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum number of times the operation can be applied.\n\nSample Input 1\n\n24\n\nSample Output 1\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=12.)\n\nChoose z=3 (=3^1). (Now we have N=4.)\n\nChoose z=4 (=2^2). (Now we have N=1.)\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nWe cannot apply the operation at all.\n\nSample Input 3\n\n64\n\nSample Output 3\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=32.)\n\nChoose z=4 (=2^2). (Now we have N=8.)\n\nChoose z=8 (=2^3). (Now we have N=1.)\n\nSample Input 4\n\n1000000007\n\nSample Output 4\n\n1\n\nWe can apply the operation once by, for example, making the following choice:\n\nz=1000000007 (=1000000007^1). (Now we have N=1.)\n\nSample Input 5\n\n997764507000\n\nSample Output 5\n\n7", "sample_input": "24\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02660", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N. Consider repeatedly applying the operation below on N:\n\nFirst, choose a positive integer z satisfying all of the conditions below:\n\nz can be represented as z=p^e, where p is a prime number and e is a positive integer;\n\nz divides N;\n\nz is different from all integers chosen in previous operations.\n\nThen, replace N with N/z.\n\nFind the maximum number of times the operation can be applied.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum number of times the operation can be applied.\n\nSample Input 1\n\n24\n\nSample Output 1\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=12.)\n\nChoose z=3 (=3^1). (Now we have N=4.)\n\nChoose z=4 (=2^2). (Now we have N=1.)\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nWe cannot apply the operation at all.\n\nSample Input 3\n\n64\n\nSample Output 3\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=32.)\n\nChoose z=4 (=2^2). (Now we have N=8.)\n\nChoose z=8 (=2^3). (Now we have N=1.)\n\nSample Input 4\n\n1000000007\n\nSample Output 4\n\n1\n\nWe can apply the operation once by, for example, making the following choice:\n\nz=1000000007 (=1000000007^1). (Now we have N=1.)\n\nSample Input 5\n\n997764507000\n\nSample Output 5\n\n7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1428, "cpu_time_ms": 264, "memory_kb": 47912}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s059475732", "group_id": "codeNet:p02664", "input_text": "import java.util.*;\nimport java.io.*;\nimport java.util.function.*;\n// import lib.util.*;\n// import lib.graph.*;\n// import lib.io.*;\n// import lib.math.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n // FastScanner sc = new FastScanner();\n Scanner sc = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n char[] t = sc.next().toCharArray();\n char prev = 'x';\n String res = \"\";\n for (int i = 0; i < t.length; i++) {\n if (t[i] == '?') {\n t[i] = 'D';\n if (i + 1 >= t.length) {\n out.print(t[i]);\n break;\n }\n if ((t[i + 1] == '?' || t[i + 1] == 'D') && prev != 'P') {\n t[i] = 'P';\n }\n }\n prev = t[i];\n out.print(t[i]);\n }\n out.println();\n out.flush();\n\n }\n\n}\n\nclass UnionFindTree {\n int[] root;\n int[] rank;\n int[] size;\n int m;\n\n public UnionFindTree(int n) {\n this.root = new int[n];\n this.rank = new int[n];\n this.size = new int[n];\n this.m = n;\n for (int i = 0; i < n; i++) {\n root[i] = i;\n size[i] = 1;\n }\n }\n\n public int find(int x) {\n if (root[x] == x)\n return x;\n else {\n return root[x] = find(root[x]);\n }\n }\n\n public void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y)\n return;\n if (rank[x] < rank[y]) {\n size[find(y)] = size[find(x)];\n root[x] = y;\n } else {\n size[find(x)] = size[find(y)];\n root[y] = x;\n if (rank[x] == rank[y])\n rank[x]++;\n }\n m--;\n }\n\n public boolean same(int x, int y) {\n return find(x) == find(y);\n }\n\n public int size(int i) {\n return this.size[find(i)];\n }\n}\n\nclass Dijkstra {\n private static int prev[];\n private static long dist[];\n\n public Dijkstra(AbstractGraph graph, int s) {\n prev = new int[graph.n];\n dist = new long[graph.n];\n Arrays.fill(prev, -1);\n Arrays.fill(dist, Long.MAX_VALUE);\n PriorityQueue searching = new PriorityQueue<>((x, y) -> Long.compare(dist[x], dist[y]));\n dist[s] = 0;\n searching.add(s);\n while (searching.size() > 0) {\n int now = searching.poll();\n for (Edge e : graph.getEdges(now)) {\n int next = e.to;\n long c = e.cost;\n if (dist[now] + c < dist[next]) {\n dist[next] = dist[now] + c;\n prev[next] = now;\n searching.add(next);\n }\n }\n }\n }\n\n public int[] path(int to) {\n ArrayList rev = new ArrayList<>();\n for (int now = to; now != -1; now = this.prev[now]) {\n rev.add(now);\n }\n int[] path = new int[rev.size()];\n for (int i = 0; i < path.length; i++) {\n path[i] = rev.get(path.length - i - 1);\n }\n return path;\n }\n\n public long getDist(int t) {\n return dist[t];\n }\n}\n\nclass WF {\n private static long[][] dist;\n\n public WF(AbstractGraph graph) {\n dist = new long[graph.n][graph.n];\n for (int i = 0; i < dist.length; i++) {\n Arrays.fill(dist[i], Integer.MAX_VALUE);\n }\n for (int i = 0; i < graph.n; i++) {\n for (Edge e : graph.getEdges(i)) {\n dist[i][e.to] = e.cost;\n }\n dist[i][i] = 0;\n }\n for (int k = 0; k < graph.n; k++) {\n for (int i = 0; i < graph.n; i++) {\n for (int j = 0; j < graph.n; j++) {\n if (dist[i][k] != Integer.MAX_VALUE && dist[k][j] != Integer.MAX_VALUE) {\n dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n }\n }\n\n public static long getShortest(int s, int t) {\n return dist[s][t];\n }\n\n public static long[][] getAllDist() {\n return dist;\n }\n\n public static boolean isNegativeLoop() {\n for (int i = 0; i < dist.length; i++) {\n if (dist[i][i] < 0) {\n return true;\n }\n }\n return false;\n }\n}\n\nclass Edge {\n int from, to;\n long cost;\n\n public Edge(int from, int to, long cost) {\n this.from = from;\n this.to = to;\n this.cost = cost;\n }\n\n public Edge(int from, int to) {\n this.from = from;\n this.to = to;\n this.cost = 1;\n }\n\n public Edge reverse() {\n return new Edge(to, from, cost);\n }\n}\n\n@SuppressWarnings(\"unchecked\")\nabstract class AbstractGraph {\n int n;\n int m;\n ArrayList[] edges;\n\n public AbstractGraph(int n) {\n this.n = n;\n this.m = 0;\n this.edges = new ArrayList[n];\n for (int i = 0; i < n; i++) {\n this.edges[i] = new ArrayList();\n }\n }\n\n public void addEdge(Edge e) {\n this.m++;\n this.edges[e.from].add(e);\n }\n\n public int getV() {\n return this.n;\n }\n\n public int getE() {\n return this.m;\n }\n\n public ArrayList getEdges(int v) {\n return this.edges[v];\n }\n\n abstract public boolean isBipartite();\n\n public boolean isTree() {\n // require Modifying.\n return false;\n }\n}\n\nclass Graph extends AbstractGraph {\n int n;\n int m;\n // array of edges which is connect to the node\n ArrayList[] edges;\n\n public Graph(int n) {\n super(n);\n }\n\n public void addEdge(int from, int to, int cost) {\n Edge e = new Edge(from, to, cost);\n super.addEdge(e);\n super.addEdge(e.reverse());\n this.m++;\n }\n\n @Override\n public void addEdge(Edge e) {\n this.edges[e.from].add(e);\n this.edges[e.to].add(e.reverse());\n this.m++;\n }\n\n public int getV(int v) {\n return n;\n }\n\n public int getE() {\n return m;\n }\n\n public boolean isBipartite() {\n int[] color = new int[n];\n PriorityQueue queue = new PriorityQueue<>();\n HashSet visited = new HashSet<>();\n queue.add(0);\n color[0] = 1;\n while (queue.size() > 0) {\n int now = queue.poll();\n visited.add(now);\n for (Edge e : getEdges(now)) {\n if (visited.contains(e.to)) {\n continue;\n }\n if (color[e.to] == color[now])\n return false;\n queue.add(e.to);\n if (color[e.to] == 0)\n color[e.to] = -1 * color[now];\n }\n }\n return true;\n }\n}\n\nclass DirectedGraph extends AbstractGraph {\n int n;\n int m;\n // array of edges which is connect to the node\n ArrayList[] edges;\n\n public DirectedGraph(int n) {\n super(n);\n }\n\n public void addEdge(int from, int to, int cost) {\n Edge e = new Edge(from, to, cost);\n super.addEdge(e);\n this.m++;\n }\n\n @Override\n public void addEdge(Edge e) {\n this.edges[e.from].add(e);\n this.m++;\n }\n\n public int getV(int v) {\n return this.n;\n }\n\n public int getE() {\n return this.m;\n }\n\n public boolean isBipartite() {\n // need to rewrite to work\n return false;\n }\n\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n\nclass MyMath {\n public static long gcm(long a, long b) {\n\n // if (a < b)\n // return gcm(b, a);\n\n // if (b == 0 || a % b == 0)\n // return b;\n\n // return gcm(b, a % b);\n if (a < b) {\n long tmp = a;\n a = b;\n b = tmp;\n }\n long r = -1;\n while (r != 0) {\n r = a % b;\n a = b;\n b = r;\n }\n return a;\n }\n\n public static long summation(long a, long b) {\n return b * (b + 1) / 2 - a * (a - 1) / 2;\n }\n\n public static long factorial(long n) {\n\n if (n <= 1)\n return 1;\n else\n return factorial(n - 1) * n;\n }\n\n public static long[][] binomialTable(int a, long m) {\n long[][] table = new long[a + 1][a + 1];\n for (int i = 0; i < a + 1; i++) {\n table[0][a] = 0;\n table[i][0] = 1;\n table[i][i] = 1;\n }\n for (int i = 1; i < a + 1; i++) {\n for (int j = 1; j < a + 1; j++) {\n if (i < j)\n table[i][j] = 0;\n else {\n table[i][j] = (table[i - 1][j - 1] + table[i - 1][j]) % m;\n }\n }\n }\n return table;\n }\n\n public static long binomial(int n, int k, long m) {\n long res = 1;\n for (int l = n - k + 1; l <= n; l++) {\n res = (res % m) * (l % m) % m;\n }\n for (int r = 1; r <= k; r++) {\n res = (res % m) * modinv(r, m) % m;\n }\n return res;\n }\n\n public static long pow(long a, long n, long p) {\n if (n == 0)\n return 1;\n if (n == 1)\n return a % p;\n if (n % 2 == 1)\n return a * pow(a, n - 1, p) % p;\n long tmp = pow(a, n / 2, p) % p;\n return tmp * tmp % p;\n }\n\n public static long modinv(long a, long p) {\n long b, x, u, q, abs_p, tmp;\n abs_p = Math.abs(p);\n b = p;\n x = 1;\n u = 0;\n while (b > 0) {\n q = a / b;\n tmp = u;\n u = x - q * u;\n x = tmp;\n tmp = b;\n b = a - q * b;\n a = tmp;\n }\n return (x < 0) ? abs_p + x : x;\n }\n\n public static Long[] eratosthenes(int n) {\n Long[] factor_table = new Long[n];\n for (long i = 1; i <= n; i++) {\n factor_table[(int) (i - 1)] = i;\n }\n for (long i = 1; i <= n; i++) {\n if (factor_table[(int) (i - 1)] == i) {\n int j = 2;\n while (i * j <= n) {\n factor_table[(int) (i * j - 1)] = i;\n j++;\n }\n }\n }\n\n return factor_table;\n }\n\n public static HashMap primeFactorization(long n) {\n HashMap primes = new HashMap<>();\n for (long p = 2; p * p <= n; p++) {\n int q = 0;\n while (n % p == 0) {\n n /= p;\n q++;\n }\n if (q > 0)\n primes.put(p, q);\n }\n if (n > 1)\n primes.put(n, 1);\n return primes;\n }\n\n public static ArrayList divisor(int n) {\n ArrayList ret = new ArrayList();\n for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n ret.add(i);\n // n=PQ+0→ PもQも約数. ただし、Q=Pは↑で登録済みなので登録しない\n if (i != n / i)\n ret.add(n / i);\n }\n }\n return ret;\n }\n}\n\nclass nextPermutation {\n public static int[] swap(int data[], int left, int right) {\n\n // Swap the data\n int temp = data[left];\n data[left] = data[right];\n data[right] = temp;\n\n // Return the updated array\n return data;\n }\n\n // Function to reverse the sub-array\n // starting from left to the right\n // both inclusive\n public static int[] reverse(int data[], int left, int right) {\n\n // Reverse the sub-array\n while (left < right) {\n int temp = data[left];\n data[left++] = data[right];\n data[right--] = temp;\n }\n\n // Return the updated array\n return data;\n }\n\n // Function to find the next permutation\n // of the given integer array\n public static boolean findNextPermutation(int data[]) {\n\n // If the given dataset is empty\n // or contains only one element\n // next_permutation is not possible\n if (data.length <= 1)\n return false;\n\n int last = data.length - 2;\n\n // find the longest non-increasing suffix\n // and find the pivot\n while (last >= 0) {\n if (data[last] < data[last + 1]) {\n break;\n }\n last--;\n }\n\n // If there is no increasing pair\n // there is no higher order permutation\n if (last < 0)\n return false;\n\n int nextGreater = data.length - 1;\n\n // Find the rightmost successor to the pivot\n for (int i = data.length - 1; i > last; i--) {\n if (data[i] > data[last]) {\n nextGreater = i;\n break;\n }\n }\n\n // Swap the successor and the pivot\n data = swap(data, nextGreater, last);\n\n // Reverse the suffix\n data = reverse(data, last + 1, data.length - 1);\n\n // Return true as the next_permutation is done\n return true;\n }\n}\n\nclass ArrayUtil {\n private static long INF = 1_000_000_000_0L;\n\n public static int UpperBound(long[] array, long obj) {\n int l = 0, r = array.length - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj < array[c]) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n\n public static int LowerBound(long[] array, long obj) {\n int l = 0, r = array.length - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj <= array[c]) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n\n // return the length of array's LIS\n public static int LIS(long[] array) {\n long[] dp = new long[array.length + 1];\n Arrays.fill(dp, INF);\n for (int i = 0; i < array.length; i++) {\n int idx = LowerBound(dp, array[i]);\n dp[idx] = array[i];\n }\n return LowerBound(dp, INF - 1);\n }\n\n public static int StrictLIS(long[] array) {\n long[] dp = new long[array.length + 1];\n Arrays.fill(dp, INF);\n for (int i = 0; i < array.length; i++) {\n int idx = UpperBound(dp, array[i]);\n dp[idx] = array[i];\n }\n return UpperBound(dp, INF - 1);\n }\n\n public static void debug(int[][] A) {\n for (int i = 0; i < A.length; i++) {\n for (int j = 0; j < A[0].length; j++) {\n System.out.print(A[i][j] + \" \");\n }\n System.out.println();\n }\n }\n}\n\nclass BinaryIndexedTree {\n int[] data;\n long[] tree;\n int n;\n\n public BinaryIndexedTree(int[] data) {\n this.data = data;\n this.n = data.length;\n this.tree = new long[n + 1];\n buildTree();\n }\n\n public void buildTree() {\n for (int i = 0; i < n; i++) {\n add(i + 1, data[i]);\n }\n }\n\n public void add(int index, int value) {\n for (int i = index; i <= n; i += i & -i) {\n tree[i] += value;\n }\n }\n\n public long sum(int from, int to) {\n return sum(to) - sum(from - 1);\n }\n\n public long sum(int index) {\n int sum = 0;\n for (int i = index; i > 0; i -= i & -i) {\n sum += tree[i];\n }\n return sum;\n }\n}", "language": "Java", "metadata": {"date": 1590887978, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02664.html", "problem_id": "p02664", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02664/input.txt", "sample_output_relpath": "derived/input_output/data/p02664/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02664/Java/s059475732.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s059475732", "user_id": "u288042356"}, "prompt_components": {"gold_output": "PDPDPDP\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\nimport java.util.function.*;\n// import lib.util.*;\n// import lib.graph.*;\n// import lib.io.*;\n// import lib.math.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n // FastScanner sc = new FastScanner();\n Scanner sc = new Scanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n char[] t = sc.next().toCharArray();\n char prev = 'x';\n String res = \"\";\n for (int i = 0; i < t.length; i++) {\n if (t[i] == '?') {\n t[i] = 'D';\n if (i + 1 >= t.length) {\n out.print(t[i]);\n break;\n }\n if ((t[i + 1] == '?' || t[i + 1] == 'D') && prev != 'P') {\n t[i] = 'P';\n }\n }\n prev = t[i];\n out.print(t[i]);\n }\n out.println();\n out.flush();\n\n }\n\n}\n\nclass UnionFindTree {\n int[] root;\n int[] rank;\n int[] size;\n int m;\n\n public UnionFindTree(int n) {\n this.root = new int[n];\n this.rank = new int[n];\n this.size = new int[n];\n this.m = n;\n for (int i = 0; i < n; i++) {\n root[i] = i;\n size[i] = 1;\n }\n }\n\n public int find(int x) {\n if (root[x] == x)\n return x;\n else {\n return root[x] = find(root[x]);\n }\n }\n\n public void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y)\n return;\n if (rank[x] < rank[y]) {\n size[find(y)] = size[find(x)];\n root[x] = y;\n } else {\n size[find(x)] = size[find(y)];\n root[y] = x;\n if (rank[x] == rank[y])\n rank[x]++;\n }\n m--;\n }\n\n public boolean same(int x, int y) {\n return find(x) == find(y);\n }\n\n public int size(int i) {\n return this.size[find(i)];\n }\n}\n\nclass Dijkstra {\n private static int prev[];\n private static long dist[];\n\n public Dijkstra(AbstractGraph graph, int s) {\n prev = new int[graph.n];\n dist = new long[graph.n];\n Arrays.fill(prev, -1);\n Arrays.fill(dist, Long.MAX_VALUE);\n PriorityQueue searching = new PriorityQueue<>((x, y) -> Long.compare(dist[x], dist[y]));\n dist[s] = 0;\n searching.add(s);\n while (searching.size() > 0) {\n int now = searching.poll();\n for (Edge e : graph.getEdges(now)) {\n int next = e.to;\n long c = e.cost;\n if (dist[now] + c < dist[next]) {\n dist[next] = dist[now] + c;\n prev[next] = now;\n searching.add(next);\n }\n }\n }\n }\n\n public int[] path(int to) {\n ArrayList rev = new ArrayList<>();\n for (int now = to; now != -1; now = this.prev[now]) {\n rev.add(now);\n }\n int[] path = new int[rev.size()];\n for (int i = 0; i < path.length; i++) {\n path[i] = rev.get(path.length - i - 1);\n }\n return path;\n }\n\n public long getDist(int t) {\n return dist[t];\n }\n}\n\nclass WF {\n private static long[][] dist;\n\n public WF(AbstractGraph graph) {\n dist = new long[graph.n][graph.n];\n for (int i = 0; i < dist.length; i++) {\n Arrays.fill(dist[i], Integer.MAX_VALUE);\n }\n for (int i = 0; i < graph.n; i++) {\n for (Edge e : graph.getEdges(i)) {\n dist[i][e.to] = e.cost;\n }\n dist[i][i] = 0;\n }\n for (int k = 0; k < graph.n; k++) {\n for (int i = 0; i < graph.n; i++) {\n for (int j = 0; j < graph.n; j++) {\n if (dist[i][k] != Integer.MAX_VALUE && dist[k][j] != Integer.MAX_VALUE) {\n dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n }\n }\n\n public static long getShortest(int s, int t) {\n return dist[s][t];\n }\n\n public static long[][] getAllDist() {\n return dist;\n }\n\n public static boolean isNegativeLoop() {\n for (int i = 0; i < dist.length; i++) {\n if (dist[i][i] < 0) {\n return true;\n }\n }\n return false;\n }\n}\n\nclass Edge {\n int from, to;\n long cost;\n\n public Edge(int from, int to, long cost) {\n this.from = from;\n this.to = to;\n this.cost = cost;\n }\n\n public Edge(int from, int to) {\n this.from = from;\n this.to = to;\n this.cost = 1;\n }\n\n public Edge reverse() {\n return new Edge(to, from, cost);\n }\n}\n\n@SuppressWarnings(\"unchecked\")\nabstract class AbstractGraph {\n int n;\n int m;\n ArrayList[] edges;\n\n public AbstractGraph(int n) {\n this.n = n;\n this.m = 0;\n this.edges = new ArrayList[n];\n for (int i = 0; i < n; i++) {\n this.edges[i] = new ArrayList();\n }\n }\n\n public void addEdge(Edge e) {\n this.m++;\n this.edges[e.from].add(e);\n }\n\n public int getV() {\n return this.n;\n }\n\n public int getE() {\n return this.m;\n }\n\n public ArrayList getEdges(int v) {\n return this.edges[v];\n }\n\n abstract public boolean isBipartite();\n\n public boolean isTree() {\n // require Modifying.\n return false;\n }\n}\n\nclass Graph extends AbstractGraph {\n int n;\n int m;\n // array of edges which is connect to the node\n ArrayList[] edges;\n\n public Graph(int n) {\n super(n);\n }\n\n public void addEdge(int from, int to, int cost) {\n Edge e = new Edge(from, to, cost);\n super.addEdge(e);\n super.addEdge(e.reverse());\n this.m++;\n }\n\n @Override\n public void addEdge(Edge e) {\n this.edges[e.from].add(e);\n this.edges[e.to].add(e.reverse());\n this.m++;\n }\n\n public int getV(int v) {\n return n;\n }\n\n public int getE() {\n return m;\n }\n\n public boolean isBipartite() {\n int[] color = new int[n];\n PriorityQueue queue = new PriorityQueue<>();\n HashSet visited = new HashSet<>();\n queue.add(0);\n color[0] = 1;\n while (queue.size() > 0) {\n int now = queue.poll();\n visited.add(now);\n for (Edge e : getEdges(now)) {\n if (visited.contains(e.to)) {\n continue;\n }\n if (color[e.to] == color[now])\n return false;\n queue.add(e.to);\n if (color[e.to] == 0)\n color[e.to] = -1 * color[now];\n }\n }\n return true;\n }\n}\n\nclass DirectedGraph extends AbstractGraph {\n int n;\n int m;\n // array of edges which is connect to the node\n ArrayList[] edges;\n\n public DirectedGraph(int n) {\n super(n);\n }\n\n public void addEdge(int from, int to, int cost) {\n Edge e = new Edge(from, to, cost);\n super.addEdge(e);\n this.m++;\n }\n\n @Override\n public void addEdge(Edge e) {\n this.edges[e.from].add(e);\n this.m++;\n }\n\n public int getV(int v) {\n return this.n;\n }\n\n public int getE() {\n return this.m;\n }\n\n public boolean isBipartite() {\n // need to rewrite to work\n return false;\n }\n\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n\nclass MyMath {\n public static long gcm(long a, long b) {\n\n // if (a < b)\n // return gcm(b, a);\n\n // if (b == 0 || a % b == 0)\n // return b;\n\n // return gcm(b, a % b);\n if (a < b) {\n long tmp = a;\n a = b;\n b = tmp;\n }\n long r = -1;\n while (r != 0) {\n r = a % b;\n a = b;\n b = r;\n }\n return a;\n }\n\n public static long summation(long a, long b) {\n return b * (b + 1) / 2 - a * (a - 1) / 2;\n }\n\n public static long factorial(long n) {\n\n if (n <= 1)\n return 1;\n else\n return factorial(n - 1) * n;\n }\n\n public static long[][] binomialTable(int a, long m) {\n long[][] table = new long[a + 1][a + 1];\n for (int i = 0; i < a + 1; i++) {\n table[0][a] = 0;\n table[i][0] = 1;\n table[i][i] = 1;\n }\n for (int i = 1; i < a + 1; i++) {\n for (int j = 1; j < a + 1; j++) {\n if (i < j)\n table[i][j] = 0;\n else {\n table[i][j] = (table[i - 1][j - 1] + table[i - 1][j]) % m;\n }\n }\n }\n return table;\n }\n\n public static long binomial(int n, int k, long m) {\n long res = 1;\n for (int l = n - k + 1; l <= n; l++) {\n res = (res % m) * (l % m) % m;\n }\n for (int r = 1; r <= k; r++) {\n res = (res % m) * modinv(r, m) % m;\n }\n return res;\n }\n\n public static long pow(long a, long n, long p) {\n if (n == 0)\n return 1;\n if (n == 1)\n return a % p;\n if (n % 2 == 1)\n return a * pow(a, n - 1, p) % p;\n long tmp = pow(a, n / 2, p) % p;\n return tmp * tmp % p;\n }\n\n public static long modinv(long a, long p) {\n long b, x, u, q, abs_p, tmp;\n abs_p = Math.abs(p);\n b = p;\n x = 1;\n u = 0;\n while (b > 0) {\n q = a / b;\n tmp = u;\n u = x - q * u;\n x = tmp;\n tmp = b;\n b = a - q * b;\n a = tmp;\n }\n return (x < 0) ? abs_p + x : x;\n }\n\n public static Long[] eratosthenes(int n) {\n Long[] factor_table = new Long[n];\n for (long i = 1; i <= n; i++) {\n factor_table[(int) (i - 1)] = i;\n }\n for (long i = 1; i <= n; i++) {\n if (factor_table[(int) (i - 1)] == i) {\n int j = 2;\n while (i * j <= n) {\n factor_table[(int) (i * j - 1)] = i;\n j++;\n }\n }\n }\n\n return factor_table;\n }\n\n public static HashMap primeFactorization(long n) {\n HashMap primes = new HashMap<>();\n for (long p = 2; p * p <= n; p++) {\n int q = 0;\n while (n % p == 0) {\n n /= p;\n q++;\n }\n if (q > 0)\n primes.put(p, q);\n }\n if (n > 1)\n primes.put(n, 1);\n return primes;\n }\n\n public static ArrayList divisor(int n) {\n ArrayList ret = new ArrayList();\n for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n ret.add(i);\n // n=PQ+0→ PもQも約数. ただし、Q=Pは↑で登録済みなので登録しない\n if (i != n / i)\n ret.add(n / i);\n }\n }\n return ret;\n }\n}\n\nclass nextPermutation {\n public static int[] swap(int data[], int left, int right) {\n\n // Swap the data\n int temp = data[left];\n data[left] = data[right];\n data[right] = temp;\n\n // Return the updated array\n return data;\n }\n\n // Function to reverse the sub-array\n // starting from left to the right\n // both inclusive\n public static int[] reverse(int data[], int left, int right) {\n\n // Reverse the sub-array\n while (left < right) {\n int temp = data[left];\n data[left++] = data[right];\n data[right--] = temp;\n }\n\n // Return the updated array\n return data;\n }\n\n // Function to find the next permutation\n // of the given integer array\n public static boolean findNextPermutation(int data[]) {\n\n // If the given dataset is empty\n // or contains only one element\n // next_permutation is not possible\n if (data.length <= 1)\n return false;\n\n int last = data.length - 2;\n\n // find the longest non-increasing suffix\n // and find the pivot\n while (last >= 0) {\n if (data[last] < data[last + 1]) {\n break;\n }\n last--;\n }\n\n // If there is no increasing pair\n // there is no higher order permutation\n if (last < 0)\n return false;\n\n int nextGreater = data.length - 1;\n\n // Find the rightmost successor to the pivot\n for (int i = data.length - 1; i > last; i--) {\n if (data[i] > data[last]) {\n nextGreater = i;\n break;\n }\n }\n\n // Swap the successor and the pivot\n data = swap(data, nextGreater, last);\n\n // Reverse the suffix\n data = reverse(data, last + 1, data.length - 1);\n\n // Return true as the next_permutation is done\n return true;\n }\n}\n\nclass ArrayUtil {\n private static long INF = 1_000_000_000_0L;\n\n public static int UpperBound(long[] array, long obj) {\n int l = 0, r = array.length - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj < array[c]) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n\n public static int LowerBound(long[] array, long obj) {\n int l = 0, r = array.length - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj <= array[c]) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n\n // return the length of array's LIS\n public static int LIS(long[] array) {\n long[] dp = new long[array.length + 1];\n Arrays.fill(dp, INF);\n for (int i = 0; i < array.length; i++) {\n int idx = LowerBound(dp, array[i]);\n dp[idx] = array[i];\n }\n return LowerBound(dp, INF - 1);\n }\n\n public static int StrictLIS(long[] array) {\n long[] dp = new long[array.length + 1];\n Arrays.fill(dp, INF);\n for (int i = 0; i < array.length; i++) {\n int idx = UpperBound(dp, array[i]);\n dp[idx] = array[i];\n }\n return UpperBound(dp, INF - 1);\n }\n\n public static void debug(int[][] A) {\n for (int i = 0; i < A.length; i++) {\n for (int j = 0; j < A[0].length; j++) {\n System.out.print(A[i][j] + \" \");\n }\n System.out.println();\n }\n }\n}\n\nclass BinaryIndexedTree {\n int[] data;\n long[] tree;\n int n;\n\n public BinaryIndexedTree(int[] data) {\n this.data = data;\n this.n = data.length;\n this.tree = new long[n + 1];\n buildTree();\n }\n\n public void buildTree() {\n for (int i = 0; i < n; i++) {\n add(i + 1, data[i]);\n }\n }\n\n public void add(int index, int value) {\n for (int i = index; i <= n; i += i & -i) {\n tree[i] += value;\n }\n }\n\n public long sum(int from, int to) {\n return sum(to) - sum(from - 1);\n }\n\n public long sum(int index) {\n int sum = 0;\n for (int i = index; i > 0; i -= i & -i) {\n sum += tree[i];\n }\n return sum;\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "sample_input": "PD?D??P\n"}, "reference_outputs": ["PDPDPDP\n"], "source_document_id": "p02664", "source_text": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 17791, "cpu_time_ms": 182, "memory_kb": 31876}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s288809638", "group_id": "codeNet:p02664", "input_text": "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tString t = sc.next();\n\t\t\n\t\tfor(int i = 0; i < t.length(); i++) {\n\t\t\tif(t.charAt(i) == '?') {\n\t\t\t\tSystem.out.print('D');\n\t\t\t} else {\n\t\t\t\tSystem.out.print(t.charAt(i));\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"\");\n\t\t\n\t}\n}", "language": "Java", "metadata": {"date": 1590887873, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02664.html", "problem_id": "p02664", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02664/input.txt", "sample_output_relpath": "derived/input_output/data/p02664/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02664/Java/s288809638.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s288809638", "user_id": "u527280956"}, "prompt_components": {"gold_output": "PDPDPDP\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tString t = sc.next();\n\t\t\n\t\tfor(int i = 0; i < t.length(); i++) {\n\t\t\tif(t.charAt(i) == '?') {\n\t\t\t\tSystem.out.print('D');\n\t\t\t} else {\n\t\t\t\tSystem.out.print(t.charAt(i));\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"\");\n\t\t\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "sample_input": "PD?D??P\n"}, "reference_outputs": ["PDPDPDP\n"], "source_document_id": "p02664", "source_text": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 627, "memory_kb": 58136}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s761750154", "group_id": "codeNet:p02665", "input_text": "\n\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tprivate static List getStrings(Scanner sc, int num) {\n\t\tList stringList = new ArrayList<>();\n\t\twhile(num>0) {\n\t\t\tlong n = sc.nextLong();\n\t\t\tstringList.add(n);\n\t\t\tnum--;\n\t\t}\n\t\treturn stringList;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tList treeList = getStrings(sc, n+1);\n\t\tlong[] treeArray = new long[n+1];\n\t\tif (n == 0) {\n\t\t\tif (treeList.get(0) == 1) {\n\t\t\t\tSystem.out.println(1);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(-1);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\ttreeArray[n] = treeList.get(n);\n\t\tfor (int i = n-1; i >= 0; i--) {\n\t\t\tlong max = (long)Math.pow(2.0, i);\n\t\t\tif (treeList.get(i) > max) {\n\t\t\t\tSystem.out.println(-1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlong tobeRoot = max - treeList.get(i);\n\t\t\tif (tobeRoot <=0) {\n\t\t\t\tSystem.out.println(-1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlong uppermax = 1;\n\t\t\tif (i != 0) {\n\t\t\t\tlong upper = (long)Math.pow(2.0, i-1) - treeList.get(i-1);\n\t\t\t\tuppermax = upper*2;\n\t\t\t}\n\t\t\ttreeArray[i] = Math.min(Math.min(treeArray[i+1] + treeList.get(i), max), uppermax);\n\t\t}\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\ttreeArray[i] = Math.min(treeArray[i], (treeArray[i-1]-treeList.get(i-1))*2);\n\t\t}\n\t\tlong sum = 0;\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tsum+=treeArray[i];\n\t\t\t// comment out\n//\t\t\tSystem.out.print(treeArray[i] + \", \" + Math.pow(2, i));\n//\t\t\tSystem.out.println();\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n\n}\n\n", "language": "Java", "metadata": {"date": 1590894490, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02665.html", "problem_id": "p02665", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02665/input.txt", "sample_output_relpath": "derived/input_output/data/p02665/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02665/Java/s761750154.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s761750154", "user_id": "u601109825"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "\n\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tprivate static List getStrings(Scanner sc, int num) {\n\t\tList stringList = new ArrayList<>();\n\t\twhile(num>0) {\n\t\t\tlong n = sc.nextLong();\n\t\t\tstringList.add(n);\n\t\t\tnum--;\n\t\t}\n\t\treturn stringList;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tList treeList = getStrings(sc, n+1);\n\t\tlong[] treeArray = new long[n+1];\n\t\tif (n == 0) {\n\t\t\tif (treeList.get(0) == 1) {\n\t\t\t\tSystem.out.println(1);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(-1);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\ttreeArray[n] = treeList.get(n);\n\t\tfor (int i = n-1; i >= 0; i--) {\n\t\t\tlong max = (long)Math.pow(2.0, i);\n\t\t\tif (treeList.get(i) > max) {\n\t\t\t\tSystem.out.println(-1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlong tobeRoot = max - treeList.get(i);\n\t\t\tif (tobeRoot <=0) {\n\t\t\t\tSystem.out.println(-1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlong uppermax = 1;\n\t\t\tif (i != 0) {\n\t\t\t\tlong upper = (long)Math.pow(2.0, i-1) - treeList.get(i-1);\n\t\t\t\tuppermax = upper*2;\n\t\t\t}\n\t\t\ttreeArray[i] = Math.min(Math.min(treeArray[i+1] + treeList.get(i), max), uppermax);\n\t\t}\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\ttreeArray[i] = Math.min(treeArray[i], (treeArray[i-1]-treeList.get(i-1))*2);\n\t\t}\n\t\tlong sum = 0;\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tsum+=treeArray[i];\n\t\t\t// comment out\n//\t\t\tSystem.out.print(treeArray[i] + \", \" + Math.pow(2, i));\n//\t\t\tSystem.out.println();\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n\n}\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence of length N+1: A_0, A_1, A_2, \\ldots, A_N. Is there a binary tree of depth N such that, for each d = 0, 1, \\ldots, N, there are exactly A_d leaves at depth d? If such a tree exists, print the maximum possible number of vertices in such a tree; otherwise, print -1.\n\nNotes\n\nA binary tree is a rooted tree such that each vertex has at most two direct children.\n\nA leaf in a binary tree is a vertex with zero children.\n\nThe depth of a vertex v in a binary tree is the distance from the tree's root to v. (The root has the depth of 0.)\n\nThe depth of a binary tree is the maximum depth of a vertex in the tree.\n\nConstraints\n\n0 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{8} (0 \\leq i \\leq N)\n\nA_N \\geq 1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_0 A_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n3\n0 1 1 2\n\nSample Output 1\n\n7\n\nBelow is the tree with the maximum possible number of vertices. It has seven vertices, so we should print 7.\n\nSample Input 2\n\n4\n0 0 1 0 2\n\nSample Output 2\n\n10\n\nSample Input 3\n\n2\n0 3 1\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n1\n1 1\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n10\n0 0 1 1 2 3 5 8 13 21 34\n\nSample Output 5\n\n264", "sample_input": "3\n0 1 1 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02665", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence of length N+1: A_0, A_1, A_2, \\ldots, A_N. Is there a binary tree of depth N such that, for each d = 0, 1, \\ldots, N, there are exactly A_d leaves at depth d? If such a tree exists, print the maximum possible number of vertices in such a tree; otherwise, print -1.\n\nNotes\n\nA binary tree is a rooted tree such that each vertex has at most two direct children.\n\nA leaf in a binary tree is a vertex with zero children.\n\nThe depth of a vertex v in a binary tree is the distance from the tree's root to v. (The root has the depth of 0.)\n\nThe depth of a binary tree is the maximum depth of a vertex in the tree.\n\nConstraints\n\n0 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{8} (0 \\leq i \\leq N)\n\nA_N \\geq 1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_0 A_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n3\n0 1 1 2\n\nSample Output 1\n\n7\n\nBelow is the tree with the maximum possible number of vertices. It has seven vertices, so we should print 7.\n\nSample Input 2\n\n4\n0 0 1 0 2\n\nSample Output 2\n\n10\n\nSample Input 3\n\n2\n0 3 1\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n1\n1 1\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n10\n0 0 1 1 2 3 5 8 13 21 34\n\nSample Output 5\n\n264", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1480, "cpu_time_ms": 517, "memory_kb": 61564}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s563322541", "group_id": "codeNet:p02675", "input_text": "public class Main {\n public static void main(String[] args) {\n var arg = Integer.parseInt(args[0]);\n var num = arg % 10;\n String reuslt = null;\n switch (num) {\n case 2:\n case 4:\n case 5:\n case 7:\n case 9:\n reuslt = \"hon\";\n break;\n case 0:\n case 1:\n case 6:\n case 8:\n reuslt = \"pon\";\n break;\n case 3:\n reuslt = \"bon\";\n break;\n default:\n throw new IllegalArgumentException();\n }\n\n System.out.println(reuslt);\n }\n}\n", "language": "Java", "metadata": {"date": 1590974040, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02675.html", "problem_id": "p02675", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02675/input.txt", "sample_output_relpath": "derived/input_output/data/p02675/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02675/Java/s563322541.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s563322541", "user_id": "u570385666"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "public class Main {\n public static void main(String[] args) {\n var arg = Integer.parseInt(args[0]);\n var num = arg % 10;\n String reuslt = null;\n switch (num) {\n case 2:\n case 4:\n case 5:\n case 7:\n case 9:\n reuslt = \"hon\";\n break;\n case 0:\n case 1:\n case 6:\n case 8:\n reuslt = \"pon\";\n break;\n case 3:\n reuslt = \"bon\";\n break;\n default:\n throw new IllegalArgumentException();\n }\n\n System.out.println(reuslt);\n }\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThe cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese.\n\nWhen counting pencils in Japanese, the counter word \"本\" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of \"本\" in the phrase \"N 本\" for a positive integer N not exceeding 999 is as follows:\n\nhon when the digit in the one's place of N is 2, 4, 5, 7, or 9;\n\npon when the digit in the one's place of N is 0, 1, 6 or 8;\n\nbon when the digit in the one's place of N is 3.\n\nGiven N, print the pronunciation of \"本\" in the phrase \"N 本\".\n\nConstraints\n\nN is a positive integer not exceeding 999.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n16\n\nSample Output 1\n\npon\n\nThe digit in the one's place of 16 is 6, so the \"本\" in \"16 本\" is pronounced pon.\n\nSample Input 2\n\n2\n\nSample Output 2\n\nhon\n\nSample Input 3\n\n183\n\nSample Output 3\n\nbon", "sample_input": "16\n"}, "reference_outputs": ["pon\n"], "source_document_id": "p02675", "source_text": "Score: 100 points\n\nProblem Statement\n\nThe cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese.\n\nWhen counting pencils in Japanese, the counter word \"本\" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of \"本\" in the phrase \"N 本\" for a positive integer N not exceeding 999 is as follows:\n\nhon when the digit in the one's place of N is 2, 4, 5, 7, or 9;\n\npon when the digit in the one's place of N is 0, 1, 6 or 8;\n\nbon when the digit in the one's place of N is 3.\n\nGiven N, print the pronunciation of \"本\" in the phrase \"N 本\".\n\nConstraints\n\nN is a positive integer not exceeding 999.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n16\n\nSample Output 1\n\npon\n\nThe digit in the one's place of 16 is 6, so the \"本\" in \"16 本\" is pronounced pon.\n\nSample Input 2\n\n2\n\nSample Output 2\n\nhon\n\nSample Input 3\n\n183\n\nSample Output 3\n\nbon", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 686, "cpu_time_ms": 74, "memory_kb": 32276}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s920519844", "group_id": "codeNet:p02675", "input_text": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\n\t\tdouble ans = 0;\n\t\tScanner scan = new Scanner(System.in);\n\t\tint minutes_length = scan.nextInt();\n\t\tint hour_length = scan.nextInt();\n\t\tdouble hour_time = scan.nextInt();\n\t\tdouble minutes_time = scan.nextInt();\n\n\n\n\t\tdouble minutes_pi = Math.PI/30*minutes_time;\n\t\tdouble hour_pi = Math.PI/6*(hour_time+ minutes_time/60);\n\t\tdouble theta = Math.PI/30*(5*(hour_time+ minutes_time/60)-minutes_time);\n\t\tans = minutes_length*minutes_length+hour_length*hour_length-2*hour_length*minutes_length*Math.cos(theta);\n\n\n\t\tSystem.out.println( Math.sqrt(ans));\n\t}\n\n}", "language": "Java", "metadata": {"date": 1589773581, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02675.html", "problem_id": "p02675", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02675/input.txt", "sample_output_relpath": "derived/input_output/data/p02675/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02675/Java/s920519844.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s920519844", "user_id": "u885722498"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\n\t\tdouble ans = 0;\n\t\tScanner scan = new Scanner(System.in);\n\t\tint minutes_length = scan.nextInt();\n\t\tint hour_length = scan.nextInt();\n\t\tdouble hour_time = scan.nextInt();\n\t\tdouble minutes_time = scan.nextInt();\n\n\n\n\t\tdouble minutes_pi = Math.PI/30*minutes_time;\n\t\tdouble hour_pi = Math.PI/6*(hour_time+ minutes_time/60);\n\t\tdouble theta = Math.PI/30*(5*(hour_time+ minutes_time/60)-minutes_time);\n\t\tans = minutes_length*minutes_length+hour_length*hour_length-2*hour_length*minutes_length*Math.cos(theta);\n\n\n\t\tSystem.out.println( Math.sqrt(ans));\n\t}\n\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThe cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese.\n\nWhen counting pencils in Japanese, the counter word \"本\" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of \"本\" in the phrase \"N 本\" for a positive integer N not exceeding 999 is as follows:\n\nhon when the digit in the one's place of N is 2, 4, 5, 7, or 9;\n\npon when the digit in the one's place of N is 0, 1, 6 or 8;\n\nbon when the digit in the one's place of N is 3.\n\nGiven N, print the pronunciation of \"本\" in the phrase \"N 本\".\n\nConstraints\n\nN is a positive integer not exceeding 999.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n16\n\nSample Output 1\n\npon\n\nThe digit in the one's place of 16 is 6, so the \"本\" in \"16 本\" is pronounced pon.\n\nSample Input 2\n\n2\n\nSample Output 2\n\nhon\n\nSample Input 3\n\n183\n\nSample Output 3\n\nbon", "sample_input": "16\n"}, "reference_outputs": ["pon\n"], "source_document_id": "p02675", "source_text": "Score: 100 points\n\nProblem Statement\n\nThe cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese.\n\nWhen counting pencils in Japanese, the counter word \"本\" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of \"本\" in the phrase \"N 本\" for a positive integer N not exceeding 999 is as follows:\n\nhon when the digit in the one's place of N is 2, 4, 5, 7, or 9;\n\npon when the digit in the one's place of N is 0, 1, 6 or 8;\n\nbon when the digit in the one's place of N is 3.\n\nGiven N, print the pronunciation of \"本\" in the phrase \"N 本\".\n\nConstraints\n\nN is a positive integer not exceeding 999.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n16\n\nSample Output 1\n\npon\n\nThe digit in the one's place of 16 is 6, so the \"本\" in \"16 本\" is pronounced pon.\n\nSample Input 2\n\n2\n\nSample Output 2\n\nhon\n\nSample Input 3\n\n183\n\nSample Output 3\n\nbon", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 644, "cpu_time_ms": 107, "memory_kb": 36056}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s522669899", "group_id": "codeNet:p02675", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String N = sc.next();\n char endChar = N.charAt(N.length() - 1);\n\n if (endChar == '2' || endChar == '4' || endChar == '5' || endChar == '7' || endChar == '9') {\n System.out.println(\"hon\");\n }\n if (endChar == '0' || endChar == '1' || endChar == '6' || endChar == '8') {\n System.out.println(\"pon\");\n }\n if (endChar == '3') {\n System.out.println(\"bon\");\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1589764059, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02675.html", "problem_id": "p02675", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02675/input.txt", "sample_output_relpath": "derived/input_output/data/p02675/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02675/Java/s522669899.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s522669899", "user_id": "u832598826"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String N = sc.next();\n char endChar = N.charAt(N.length() - 1);\n\n if (endChar == '2' || endChar == '4' || endChar == '5' || endChar == '7' || endChar == '9') {\n System.out.println(\"hon\");\n }\n if (endChar == '0' || endChar == '1' || endChar == '6' || endChar == '8') {\n System.out.println(\"pon\");\n }\n if (endChar == '3') {\n System.out.println(\"bon\");\n }\n }\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThe cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese.\n\nWhen counting pencils in Japanese, the counter word \"本\" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of \"本\" in the phrase \"N 本\" for a positive integer N not exceeding 999 is as follows:\n\nhon when the digit in the one's place of N is 2, 4, 5, 7, or 9;\n\npon when the digit in the one's place of N is 0, 1, 6 or 8;\n\nbon when the digit in the one's place of N is 3.\n\nGiven N, print the pronunciation of \"本\" in the phrase \"N 本\".\n\nConstraints\n\nN is a positive integer not exceeding 999.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n16\n\nSample Output 1\n\npon\n\nThe digit in the one's place of 16 is 6, so the \"本\" in \"16 本\" is pronounced pon.\n\nSample Input 2\n\n2\n\nSample Output 2\n\nhon\n\nSample Input 3\n\n183\n\nSample Output 3\n\nbon", "sample_input": "16\n"}, "reference_outputs": ["pon\n"], "source_document_id": "p02675", "source_text": "Score: 100 points\n\nProblem Statement\n\nThe cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese.\n\nWhen counting pencils in Japanese, the counter word \"本\" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of \"本\" in the phrase \"N 本\" for a positive integer N not exceeding 999 is as follows:\n\nhon when the digit in the one's place of N is 2, 4, 5, 7, or 9;\n\npon when the digit in the one's place of N is 0, 1, 6 or 8;\n\nbon when the digit in the one's place of N is 3.\n\nGiven N, print the pronunciation of \"本\" in the phrase \"N 本\".\n\nConstraints\n\nN is a positive integer not exceeding 999.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n16\n\nSample Output 1\n\npon\n\nThe digit in the one's place of 16 is 6, so the \"本\" in \"16 本\" is pronounced pon.\n\nSample Input 2\n\n2\n\nSample Output 2\n\nhon\n\nSample Input 3\n\n183\n\nSample Output 3\n\nbon", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 530, "cpu_time_ms": 185, "memory_kb": 35756}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s866686746", "group_id": "codeNet:p02676", "input_text": "import java.io.*;\nimport java.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\n\npublic class Main {\n\n public static void main(String[] args) {\n \n \tFastScanner scan = new FastScanner();\n \t\n \tint k = scan.nextInt(); String str = scan.next();\n \tif(str.length() <= k) System.out.println(str);\n \telse {\n \t\tchar [] ch = str.toCharArray();\n \t\tstr = \"\";\n \t\tfor(int i=0; i1) {\n\t\t\tmid = (upperBorder + lowerBorder)/2;\n\t\t\tif(orderedArray[mid]<=num) {\n\t\t\t\tlowerBorder = mid;\n\t\t\t}else {\n\t\t\t\tupperBorder = mid;\n\t\t\t}\n\t\t}\n\t\treturn lowerBorder;\n\t}\n\n\t//二分探索\n\t//k <= num となる最小のList要素kのインデックスを返す\n\tstatic private int binarySearch(long num, ArrayList orderedList){\n\t\tint lowerBorder = -1;\n\t\tint upperBorder = orderedList.size();\n\t\tint mid;\n\n\t\twhile(upperBorder - lowerBorder >1) {\n\t\t\tmid = (upperBorder + lowerBorder)/2;\n\t\t\tif(orderedList.get(mid)<=num) {\n\t\t\t\tlowerBorder = mid;\n\t\t\t}else {\n\t\t\t\tupperBorder = mid;\n\t\t\t}\n\t\t}\n\t\treturn lowerBorder;\n\t}\n\n\t//aとbの最小公倍数を求める\n\tpublic static int gcd(int a, int b) {\n return b == 0 ? a: gcd(b, a % b);\n\t}\n\tpublic static long gcd(long a, long b) {\n return b == 0 ? a: gcd(b, a % b);\n\t}\n\n\n\n}\n", "language": "Java", "metadata": {"date": 1589764732, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02676.html", "problem_id": "p02676", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02676/input.txt", "sample_output_relpath": "derived/input_output/data/p02676/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02676/Java/s922003483.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s922003483", "user_id": "u784982404"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "package procon01;\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n//\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n//\t\tString W\t = in.readLine();\n//\t\tint num = Integer.parseInt(W.split(\" \")[0]);\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint K = sc.nextInt();\n\t\tString S = sc.next();\n\n\t\tif(S.length()1) {\n\t\t\tmid = (upperBorder + lowerBorder)/2;\n\t\t\tif(orderedArray[mid]<=num) {\n\t\t\t\tlowerBorder = mid;\n\t\t\t}else {\n\t\t\t\tupperBorder = mid;\n\t\t\t}\n\t\t}\n\t\treturn lowerBorder;\n\t}\n\n\t//二分探索\n\t//k <= num となる最小のList要素kのインデックスを返す\n\tstatic private int binarySearch(long num, ArrayList orderedList){\n\t\tint lowerBorder = -1;\n\t\tint upperBorder = orderedList.size();\n\t\tint mid;\n\n\t\twhile(upperBorder - lowerBorder >1) {\n\t\t\tmid = (upperBorder + lowerBorder)/2;\n\t\t\tif(orderedList.get(mid)<=num) {\n\t\t\t\tlowerBorder = mid;\n\t\t\t}else {\n\t\t\t\tupperBorder = mid;\n\t\t\t}\n\t\t}\n\t\treturn lowerBorder;\n\t}\n\n\t//aとbの最小公倍数を求める\n\tpublic static int gcd(int a, int b) {\n return b == 0 ? a: gcd(b, a % b);\n\t}\n\tpublic static long gcd(long a, long b) {\n return b == 0 ? a: gcd(b, a % b);\n\t}\n\n\n\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "sample_input": "7\nnikoandsolstice\n"}, "reference_outputs": ["nikoand...\n"], "source_document_id": "p02676", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1643, "cpu_time_ms": 87, "memory_kb": 35112}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s549407766", "group_id": "codeNet:p02676", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint k = sc.nextInt();\n\t\tString s = sc.next();\n\t\tsc.close();\n\t\tif(k >= s.length()) {\n\t\t\tSystem.out.println(s);\n\t\t} else {\n\t\t\tSystem.out.println(s.substring(0,k)+\"...\");\n\t\t}\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1589764251, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02676.html", "problem_id": "p02676", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02676/input.txt", "sample_output_relpath": "derived/input_output/data/p02676/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02676/Java/s549407766.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s549407766", "user_id": "u453602066"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint k = sc.nextInt();\n\t\tString s = sc.next();\n\t\tsc.close();\n\t\tif(k >= s.length()) {\n\t\t\tSystem.out.println(s);\n\t\t} else {\n\t\t\tSystem.out.println(s.substring(0,k)+\"...\");\n\t\t}\n\n\t}\n\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "sample_input": "7\nnikoandsolstice\n"}, "reference_outputs": ["nikoand...\n"], "source_document_id": "p02676", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 310, "cpu_time_ms": 180, "memory_kb": 38640}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s439700363", "group_id": "codeNet:p02676", "input_text": "\nimport java.util.*;\n\npublic class Main {\n static Scanner scanner;\n\n public static void main(String[] args) {\n scanner = new Scanner(System.in);\n int k = nextInt();\n String s = scanner.next();\n if (s.length() > k) {\n System.out.println(s.substring(0,k) + \"...\");\n } else {\n System.out.println(s);\n }\n }\n\n public static boolean rikai(List rikaido,int x) {\n\n System.out.println(\"c\" + rikaido);\n\n boolean ret = true;\n for (Integer r :rikaido){\n if (r < x) {\n ret = false;\n break;\n }\n }\n return ret;\n }\n\n public static int nextInt() {\n return Integer.parseInt(scanner.next());\n }\n\n public static long nextLong() {\n return Long.parseLong(scanner.next());\n }\n\n public static double nextDouble() {\n return Double.parseDouble(scanner.next());\n }\n\n public static short nextShort() {\n return Short.parseShort(scanner.next());\n }\n\n public static float nextFloat() {\n return Float.parseFloat(scanner.next());\n }\n\n public static void printYes() {\n System.out.println(\"Yes\");\n }\n\n public static void printYES() {\n System.out.println(\"YES\");\n }\n\n public static void printNo() {\n System.out.println(\"No\");\n }\n\n public static void printNO() {\n System.out.println(\"NO\");\n }\n\n public static void nextLine() {\n scanner.nextLine();\n }\n}", "language": "Java", "metadata": {"date": 1589763943, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02676.html", "problem_id": "p02676", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02676/input.txt", "sample_output_relpath": "derived/input_output/data/p02676/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02676/Java/s439700363.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s439700363", "user_id": "u763143338"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "\nimport java.util.*;\n\npublic class Main {\n static Scanner scanner;\n\n public static void main(String[] args) {\n scanner = new Scanner(System.in);\n int k = nextInt();\n String s = scanner.next();\n if (s.length() > k) {\n System.out.println(s.substring(0,k) + \"...\");\n } else {\n System.out.println(s);\n }\n }\n\n public static boolean rikai(List rikaido,int x) {\n\n System.out.println(\"c\" + rikaido);\n\n boolean ret = true;\n for (Integer r :rikaido){\n if (r < x) {\n ret = false;\n break;\n }\n }\n return ret;\n }\n\n public static int nextInt() {\n return Integer.parseInt(scanner.next());\n }\n\n public static long nextLong() {\n return Long.parseLong(scanner.next());\n }\n\n public static double nextDouble() {\n return Double.parseDouble(scanner.next());\n }\n\n public static short nextShort() {\n return Short.parseShort(scanner.next());\n }\n\n public static float nextFloat() {\n return Float.parseFloat(scanner.next());\n }\n\n public static void printYes() {\n System.out.println(\"Yes\");\n }\n\n public static void printYES() {\n System.out.println(\"YES\");\n }\n\n public static void printNo() {\n System.out.println(\"No\");\n }\n\n public static void printNO() {\n System.out.println(\"NO\");\n }\n\n public static void nextLine() {\n scanner.nextLine();\n }\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "sample_input": "7\nnikoandsolstice\n"}, "reference_outputs": ["nikoand...\n"], "source_document_id": "p02676", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1520, "cpu_time_ms": 109, "memory_kb": 26972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s619616068", "group_id": "codeNet:p02677", "input_text": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint h = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tdouble Mangle = (m*360)/60;\n\t\tdouble Hangle = (h*60+m)*360/(12*60);\n\t\tdouble MHangle = 0;\n\t\tif(Hangle-Mangle>180) {\n\t\t\tMHangle = 360-(Hangle-Mangle);\n\t\t}else {\n\t\t\tMHangle = Hangle-Mangle;\n\t\t}\n\t\tdouble cosA = Math.cos(MHangle*(Math.PI/180));\n \t\t\n\t\tdouble answer = (a*a)+(b*b)-(2*a*b*cosA);\n\t\tdouble ans = Math.sqrt(answer);\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t}\n}", "language": "Java", "metadata": {"date": 1592847338, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02677.html", "problem_id": "p02677", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02677/input.txt", "sample_output_relpath": "derived/input_output/data/p02677/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02677/Java/s619616068.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s619616068", "user_id": "u296383300"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint h = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tdouble Mangle = (m*360)/60;\n\t\tdouble Hangle = (h*60+m)*360/(12*60);\n\t\tdouble MHangle = 0;\n\t\tif(Hangle-Mangle>180) {\n\t\t\tMHangle = 360-(Hangle-Mangle);\n\t\t}else {\n\t\t\tMHangle = Hangle-Mangle;\n\t\t}\n\t\tdouble cosA = Math.cos(MHangle*(Math.PI/180));\n \t\t\n\t\tdouble answer = (a*a)+(b*b)-(2*a*b*cosA);\n\t\tdouble ans = Math.sqrt(answer);\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t}\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "sample_input": "3 4 9 0\n"}, "reference_outputs": ["5.00000000000000000000\n"], "source_document_id": "p02677", "source_text": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 582, "cpu_time_ms": 125, "memory_kb": 35840}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s702510956", "group_id": "codeNet:p02677", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tstatic long bignum = 1000000000+7;\n\n\tpublic static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tdouble a = sc.nextDouble();\n\t\tdouble b = sc.nextDouble();\n\t\tdouble h = sc.nextDouble();\n\t\tdouble m = sc.nextDouble();\n\n\t\tdouble degree = ((h+m/60)*30-m*6)/360*2*Math.PI;\n\t\tdouble height = Math.sin(degree)*a;\n\t\tdouble width = b-Math.cos(degree)*a;\n\n\t\tdouble ans = Math.pow(Math.pow(height, 2)+Math.pow(width, 2),0.5);\n\n\t\tSystem.out.println(ans);\n\n\t}\n\n\n\tstatic long divn(int target, int times) {//10_9+7のあまり累乗版\n\t\tint sqtimes = (int)Math.sqrt(times);\n\t\tlong ans = 1;\n\t\tfor(int i =0;i mapx = new TreeMap<>();\n\t\tmapx.put(0, null);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tmapx.put(a[i], null);\n\t\t\tmapx.put(b[i], null);\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tmapx.put(d[i], null);\n\t\t}\n\t\tInteger[] arr = mapx.keySet().toArray(new Integer[0]);\n\t\tint cnt = 0;\n\t\tfor (Integer i : arr) {\n\t\t\tmapx.put(i, cnt);\n\t\t\tcnt++;\n\t\t}\n\t\tint[] tox = new int[mapx.size()];\n\t\tfor (Integer key : mapx.keySet()) {\n\t\t\ttox[mapx.get(key)] = key;\n\t\t}\n\n\t\tTreeMap mapy = new TreeMap<>();\n\t\tmapy.put(0, null);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tmapy.put(c[i], null);\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tmapy.put(e[i], null);\n\t\t\tmapy.put(f[i], null);\n\t\t}\n\t\tarr = mapy.keySet().toArray(new Integer[0]);\n\t\tcnt = 0;\n\t\tfor (Integer i : arr) {\n\t\t\tmapy.put(i, cnt);\n\t\t\tcnt++;\n\t\t}\n\t\tint[] toy = new int[mapy.size()];\n\t\tfor (Integer key : mapy.keySet()) {\n\t\t\ttoy[mapy.get(key)] = key;\n\t\t}\n\n\n\t\tboolean[][] ngy = new boolean[tox.length + 1][toy.length + 1];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x1 = mapx.get(a[i]);\n\t\t\tint x2 = mapx.get(b[i]);\n\t\t\tint y = mapy.get(c[i]);\n\t\t\tfor (int j = x1 + 1; j <= x2; j++) {\n\t\t\t\tngy[j][y] = true;\n\t\t\t}\n\t\t}\n\n\t\tboolean[][] ngx = new boolean[tox.length + 1][toy.length + 1];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint x = mapx.get(d[i]);\n\t\t\tint y1 = mapy.get(e[i]);\n\t\t\tint y2 = mapy.get(f[i]);\n\t\t\tfor (int j = y1 + 1; j <= y2; j++) {\n\t\t\t\tngx[x][j] = true;\n\t\t\t}\n\t\t}\n\n\n\t\tboolean[][] visit = new boolean[tox.length + 1][toy.length + 1];\n\t\tint fx = mapx.get(0);\n\t\tint fy = mapy.get(0);\n\t\tif (fx == 0 || fx == tox.length - 1 || fy == 0 || fy == toy.length - 1) {\n\t\t\tSystem.out.println(\"INF\");\n\t\t\treturn;\n\t\t}\n\n\t\tQueue que = new ArrayDeque<>();\n\t\tque.add(fx * 10000 + fy);\n\t\tvisit[fx][fy] = true;\n\t\twhile (!que.isEmpty()) {\n\t\t\tint cur = que.poll();\n\t\t\tint cx = cur / 10000;\n\t\t\tint cy = cur % 10000;\n\t\t\t// 上\n\t\t\tint nx = cx - 1;\n\t\t\tint ny = cy;\n\t\t\tif (!ngx[nx][ny] && !visit[nx][ny]) {\n\t\t\t\tif (nx == 0) {\n\t\t\t\t\tSystem.out.println(\"INF\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tque.add(nx * 10000 + ny);\n\t\t\t\tvisit[nx][ny] = true;\n\t\t\t}\n\t\t\t// 下\n\t\t\tnx = cx + 1;\n\t\t\tny = cy;\n\t\t\tif (!ngx[cx][ny] && !visit[nx][ny]) {\n\t\t\t\tif (nx == tox.length) {\n\t\t\t\t\tSystem.out.println(\"INF\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tque.add(nx * 10000 + ny);\n\t\t\t\tvisit[nx][ny] = true;\n\t\t\t}\n\t\t\t// 左\n\t\t\tnx = cx;\n\t\t\tny = cy - 1;\n\t\t\tif (!ngy[nx][ny] && !visit[nx][ny]) {\n\t\t\t\tif (ny == 0) {\n\t\t\t\t\tSystem.out.println(\"INF\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tque.add(nx * 10000 + ny);\n\t\t\t\tvisit[nx][ny] = true;\n\t\t\t}\n\t\t\t// 右\n\t\t\tnx = cx;\n\t\t\tny = cy + 1;\n\t\t\tif (!ngy[nx][cy] && !visit[nx][ny]) {\n\t\t\t\tif (ny == toy.length) {\n\t\t\t\t\tSystem.out.println(\"INF\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tque.add(nx * 10000 + ny);\n\t\t\t\tvisit[nx][ny] = true;\n\t\t\t}\n\t\t}\n\n\t\tlong ans = 0;\n\t\tfor (int i = 1; i < tox.length; i++) {\n\t\t\tfor (int j = 1; j < toy.length; j++) {\n\t\t\t\tif (visit[i][j]) {\n\t\t\t\t\tlong dx = tox[i] - tox[i - 1];\n\t\t\t\t\tlong dy = toy[j] - toy[j - 1];\n\t\t\t\t\tans += dx * dy;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1589859326, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02680.html", "problem_id": "p02680", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02680/input.txt", "sample_output_relpath": "derived/input_output/data/p02680/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02680/Java/s828266237.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s828266237", "user_id": "u522636435"}, "prompt_components": {"gold_output": "13\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayDeque;\nimport java.util.Queue;\nimport java.util.TreeMap;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] sa = br.readLine().split(\" \");\n\t\tint n = Integer.parseInt(sa[0]);\n\t\tint m = Integer.parseInt(sa[1]);\n\t\tint[] a = new int[n];\n\t\tint[] b = new int[n];\n\t\tint[] c = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tsa = br.readLine().split(\" \");\n\t\t\ta[i] = Integer.parseInt(sa[0]);\n\t\t\tb[i] = Integer.parseInt(sa[1]);\n\t\t\tc[i] = Integer.parseInt(sa[2]);\n\t\t}\n\t\tint[] d = new int[m];\n\t\tint[] e = new int[m];\n\t\tint[] f = new int[m];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tsa = br.readLine().split(\" \");\n\t\t\td[i] = Integer.parseInt(sa[0]);\n\t\t\te[i] = Integer.parseInt(sa[1]);\n\t\t\tf[i] = Integer.parseInt(sa[2]);\n\t\t}\n\t\tbr.close();\n\n\t\tTreeMap mapx = new TreeMap<>();\n\t\tmapx.put(0, null);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tmapx.put(a[i], null);\n\t\t\tmapx.put(b[i], null);\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tmapx.put(d[i], null);\n\t\t}\n\t\tInteger[] arr = mapx.keySet().toArray(new Integer[0]);\n\t\tint cnt = 0;\n\t\tfor (Integer i : arr) {\n\t\t\tmapx.put(i, cnt);\n\t\t\tcnt++;\n\t\t}\n\t\tint[] tox = new int[mapx.size()];\n\t\tfor (Integer key : mapx.keySet()) {\n\t\t\ttox[mapx.get(key)] = key;\n\t\t}\n\n\t\tTreeMap mapy = new TreeMap<>();\n\t\tmapy.put(0, null);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tmapy.put(c[i], null);\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tmapy.put(e[i], null);\n\t\t\tmapy.put(f[i], null);\n\t\t}\n\t\tarr = mapy.keySet().toArray(new Integer[0]);\n\t\tcnt = 0;\n\t\tfor (Integer i : arr) {\n\t\t\tmapy.put(i, cnt);\n\t\t\tcnt++;\n\t\t}\n\t\tint[] toy = new int[mapy.size()];\n\t\tfor (Integer key : mapy.keySet()) {\n\t\t\ttoy[mapy.get(key)] = key;\n\t\t}\n\n\n\t\tboolean[][] ngy = new boolean[tox.length + 1][toy.length + 1];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x1 = mapx.get(a[i]);\n\t\t\tint x2 = mapx.get(b[i]);\n\t\t\tint y = mapy.get(c[i]);\n\t\t\tfor (int j = x1 + 1; j <= x2; j++) {\n\t\t\t\tngy[j][y] = true;\n\t\t\t}\n\t\t}\n\n\t\tboolean[][] ngx = new boolean[tox.length + 1][toy.length + 1];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint x = mapx.get(d[i]);\n\t\t\tint y1 = mapy.get(e[i]);\n\t\t\tint y2 = mapy.get(f[i]);\n\t\t\tfor (int j = y1 + 1; j <= y2; j++) {\n\t\t\t\tngx[x][j] = true;\n\t\t\t}\n\t\t}\n\n\n\t\tboolean[][] visit = new boolean[tox.length + 1][toy.length + 1];\n\t\tint fx = mapx.get(0);\n\t\tint fy = mapy.get(0);\n\t\tif (fx == 0 || fx == tox.length - 1 || fy == 0 || fy == toy.length - 1) {\n\t\t\tSystem.out.println(\"INF\");\n\t\t\treturn;\n\t\t}\n\n\t\tQueue que = new ArrayDeque<>();\n\t\tque.add(fx * 10000 + fy);\n\t\tvisit[fx][fy] = true;\n\t\twhile (!que.isEmpty()) {\n\t\t\tint cur = que.poll();\n\t\t\tint cx = cur / 10000;\n\t\t\tint cy = cur % 10000;\n\t\t\t// 上\n\t\t\tint nx = cx - 1;\n\t\t\tint ny = cy;\n\t\t\tif (!ngx[nx][ny] && !visit[nx][ny]) {\n\t\t\t\tif (nx == 0) {\n\t\t\t\t\tSystem.out.println(\"INF\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tque.add(nx * 10000 + ny);\n\t\t\t\tvisit[nx][ny] = true;\n\t\t\t}\n\t\t\t// 下\n\t\t\tnx = cx + 1;\n\t\t\tny = cy;\n\t\t\tif (!ngx[cx][ny] && !visit[nx][ny]) {\n\t\t\t\tif (nx == tox.length) {\n\t\t\t\t\tSystem.out.println(\"INF\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tque.add(nx * 10000 + ny);\n\t\t\t\tvisit[nx][ny] = true;\n\t\t\t}\n\t\t\t// 左\n\t\t\tnx = cx;\n\t\t\tny = cy - 1;\n\t\t\tif (!ngy[nx][ny] && !visit[nx][ny]) {\n\t\t\t\tif (ny == 0) {\n\t\t\t\t\tSystem.out.println(\"INF\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tque.add(nx * 10000 + ny);\n\t\t\t\tvisit[nx][ny] = true;\n\t\t\t}\n\t\t\t// 右\n\t\t\tnx = cx;\n\t\t\tny = cy + 1;\n\t\t\tif (!ngy[nx][cy] && !visit[nx][ny]) {\n\t\t\t\tif (ny == toy.length) {\n\t\t\t\t\tSystem.out.println(\"INF\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tque.add(nx * 10000 + ny);\n\t\t\t\tvisit[nx][ny] = true;\n\t\t\t}\n\t\t}\n\n\t\tlong ans = 0;\n\t\tfor (int i = 1; i < tox.length; i++) {\n\t\t\tfor (int j = 1; j < toy.length; j++) {\n\t\t\t\tif (visit[i][j]) {\n\t\t\t\t\tlong dx = tox[i] - tox[i - 1];\n\t\t\t\t\tlong dy = toy[j] - toy[j - 1];\n\t\t\t\t\tans += dx * dy;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "problem_context": "Score: 600 points\n\nProblem Statement\n\nThere is a grass field that stretches infinitely.\n\nIn this field, there is a negligibly small cow. Let (x, y) denote the point that is x\\ \\mathrm{cm} south and y\\ \\mathrm{cm} east of the point where the cow stands now. The cow itself is standing at (0, 0).\n\nThere are also N north-south lines and M east-west lines drawn on the field. The i-th north-south line is the segment connecting the points (A_i, C_i) and (B_i, C_i), and the j-th east-west line is the segment connecting the points (D_j, E_j) and (D_j, F_j).\n\nWhat is the area of the region the cow can reach when it can move around as long as it does not cross the segments (including the endpoints)? If this area is infinite, print INF instead.\n\nConstraints\n\nAll values in input are integers between -10^9 and 10^9 (inclusive).\n\n1 \\leq N, M \\leq 1000\n\nA_i < B_i\\ (1 \\leq i \\leq N)\n\nE_j < F_j\\ (1 \\leq j \\leq M)\n\nThe point (0, 0) does not lie on any of the given segments.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1 C_1\n:\nA_N B_N C_N\nD_1 E_1 F_1\n:\nD_M E_M F_M\n\nOutput\n\nIf the area of the region the cow can reach is infinite, print INF; otherwise, print an integer representing the area in \\mathrm{cm^2}.\n\n(Under the constraints, it can be proved that the area of the region is always an integer if it is not infinite.)\n\nSample Input 1\n\n5 6\n1 2 0\n0 1 1\n0 2 2\n-3 4 -1\n-2 6 3\n1 0 1\n0 1 2\n2 0 2\n-1 -4 5\n3 -2 4\n1 2 4\n\nSample Output 1\n\n13\n\nThe area of the region the cow can reach is 13\\ \\mathrm{cm^2}.\n\nSample Input 2\n\n6 1\n-3 -1 -2\n-3 -1 1\n-2 -1 2\n1 4 -2\n1 4 -1\n1 4 1\n3 1 4\n\nSample Output 2\n\nINF\n\nThe area of the region the cow can reach is infinite.", "sample_input": "5 6\n1 2 0\n0 1 1\n0 2 2\n-3 4 -1\n-2 6 3\n1 0 1\n0 1 2\n2 0 2\n-1 -4 5\n3 -2 4\n1 2 4\n"}, "reference_outputs": ["13\n"], "source_document_id": "p02680", "source_text": "Score: 600 points\n\nProblem Statement\n\nThere is a grass field that stretches infinitely.\n\nIn this field, there is a negligibly small cow. Let (x, y) denote the point that is x\\ \\mathrm{cm} south and y\\ \\mathrm{cm} east of the point where the cow stands now. The cow itself is standing at (0, 0).\n\nThere are also N north-south lines and M east-west lines drawn on the field. The i-th north-south line is the segment connecting the points (A_i, C_i) and (B_i, C_i), and the j-th east-west line is the segment connecting the points (D_j, E_j) and (D_j, F_j).\n\nWhat is the area of the region the cow can reach when it can move around as long as it does not cross the segments (including the endpoints)? If this area is infinite, print INF instead.\n\nConstraints\n\nAll values in input are integers between -10^9 and 10^9 (inclusive).\n\n1 \\leq N, M \\leq 1000\n\nA_i < B_i\\ (1 \\leq i \\leq N)\n\nE_j < F_j\\ (1 \\leq j \\leq M)\n\nThe point (0, 0) does not lie on any of the given segments.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1 C_1\n:\nA_N B_N C_N\nD_1 E_1 F_1\n:\nD_M E_M F_M\n\nOutput\n\nIf the area of the region the cow can reach is infinite, print INF; otherwise, print an integer representing the area in \\mathrm{cm^2}.\n\n(Under the constraints, it can be proved that the area of the region is always an integer if it is not infinite.)\n\nSample Input 1\n\n5 6\n1 2 0\n0 1 1\n0 2 2\n-3 4 -1\n-2 6 3\n1 0 1\n0 1 2\n2 0 2\n-1 -4 5\n3 -2 4\n1 2 4\n\nSample Output 1\n\n13\n\nThe area of the region the cow can reach is 13\\ \\mathrm{cm^2}.\n\nSample Input 2\n\n6 1\n-3 -1 -2\n-3 -1 1\n-2 -1 2\n1 4 -2\n1 4 -1\n1 4 1\n3 1 4\n\nSample Output 2\n\nINF\n\nThe area of the region the cow can reach is infinite.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3902, "cpu_time_ms": 649, "memory_kb": 87368}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s698640620", "group_id": "codeNet:p02680", "input_text": "import java.io.*;\nimport java.util.*;\n\nclass Solver {\n final int n, m;\n final int[][] abcs, defs;\n\n Solver(int n, int m, int[][] abcs, int[][] defs) {\n this.n = n;\n this.m = m;\n this.abcs = abcs;\n this.defs = defs;\n }\n\n private static final int[] DX = new int[]{1, 0, -1, 0};\n private static final int[] DY = new int[]{0, 1, 0, -1};\n\n public String solve() {\n Set xSet = new HashSet<>();\n Set ySet = new HashSet<>();\n xSet.add(-2_000_000_000);\n xSet.add(2_000_000_000);\n ySet.add(-2_000_000_000);\n ySet.add(2_000_000_000);\n for (int[] abc : abcs) {\n int a = abc[0];\n int b = abc[1];\n int c = abc[2];\n xSet.add(a);\n xSet.add(b);\n ySet.add(c);\n }\n for (int[] def : defs) {\n int d = def[0];\n int e = def[1];\n int f = def[2];\n xSet.add(d);\n ySet.add(e);\n ySet.add(f);\n }\n int xSize = xSet.size();\n int ySize = ySet.size();\n List xList = new ArrayList<>();\n List yList = new ArrayList<>();\n xList.addAll(xSet);\n yList.addAll(ySet);\n xSet = null;\n ySet = null;\n Collections.sort(xList);\n Collections.sort(yList);\n Map xMap = new HashMap<>();\n Map yMap = new HashMap<>();\n for (int i = 0; i < xSize; i++) {\n xMap.put(xList.get(i), i);\n }\n for (int i = 0; i < ySize; i++) {\n yMap.put(yList.get(i), i);\n }\n\n boolean[][] blocker = new boolean[2 * xSize][2 * ySize];\n for (int i = 0; i < xSize; i++) {\n for (int j = 0; j < ySize; j++) {\n blocker[2 * i][2 * j] = true;\n }\n }\n for (int[] def : defs) {\n int d = def[0];\n int e = def[1];\n int f = def[2];\n int xIndex = xMap.get(d);\n int yIndexMin = yMap.get(e);\n int yIndexMax = yMap.get(f);\n for (int y = yIndexMin; y < yIndexMax; y++) {\n blocker[2 * xIndex][2 * y + 1] = true;\n }\n }\n for (int[] abc : abcs) {\n int a = abc[0];\n int b = abc[1];\n int c = abc[2];\n int yIndex = yMap.get(c);\n int xIndexMin = xMap.get(a);\n int xIndexMax = xMap.get(b);\n for (int x = xIndexMin; x < xIndexMax; x++) {\n blocker[2 * x + 1][2 * yIndex] = true;\n }\n }\n xMap = null;\n yMap = null;\n\n int startXIndex = -1;\n for (int i = 1; i < xSize; i++) {\n if (xList.get(i - 1) < 0 && 0 <= xList.get(i)) {\n startXIndex = 2 * (i - 1) + 1;\n break;\n }\n }\n\n int startYIndex = -1;\n for (int i = 1; i < ySize; i++) {\n if (yList.get(i - 1) < 0 && 0 <= yList.get(i)) {\n startYIndex = 2 * (i - 1) + 1;\n break;\n }\n }\n\n long answer = 0;\n Deque xIndexStack = new ArrayDeque<>();\n Deque yIndexStack = new ArrayDeque<>();\n boolean[][] enqueued = new boolean[2 * xSize][2 * ySize];\n enqueued[startXIndex][startYIndex] = true;\n xIndexStack.add(startXIndex);\n yIndexStack.add(startYIndex);\n while (!xIndexStack.isEmpty()) {\n int xIndex = xIndexStack.pollLast();\n int yIndex = yIndexStack.pollLast();\n if (xIndex == 0 || yIndex == 0 || xIndex == 2 * xSize - 1 || yIndex == 2 * ySize - 1) {\n return \"INF\";\n }\n if (xIndex % 2 == 1 && yIndex % 2 == 1) {\n long xMax = xList.get(xIndex / 2 + 1);\n long xMin = xList.get(xIndex / 2);\n long yMax = yList.get(yIndex / 2 + 1);\n long yMin = yList.get(yIndex / 2);\n answer += (xMax - xMin) * (yMax - yMin); \n }\n for (int k = 0; k < 4; k++) {\n int nextXIndex = xIndex + DX[k];\n int nextYIndex = yIndex + DY[k];\n if (!blocker[nextXIndex][nextYIndex] && !enqueued[nextXIndex][nextYIndex]) {\n enqueued[nextXIndex][nextYIndex] = true;\n xIndexStack.add(nextXIndex);\n yIndexStack.add(nextYIndex);\n }\n }\n }\n return Long.toString(answer);\n }\n}\n\npublic class Main {\n private static void execute(ContestReader reader, ContestWriter out) {\n int n = reader.nextInt();\n int m = reader.nextInt();\n int[][] abcs = reader.nextInt(n, 3);\n int[][] defs = reader.nextInt(m, 3);\n out.println(new Solver(n, m, abcs, defs).solve());\n }\n \n public static void main(String[] args) {\n ContestReader reader = new ContestReader(System.in);\n ContestWriter out = new ContestWriter(System.out);\n execute(reader, out);\n out.flush();\n }\n}\n\nclass ContestWriter extends PrintWriter {\n ContestWriter(PrintStream printeStream) {\n super(printeStream);\n }\n\n public void printList(List list) {\n for (Object object : list) {\n println(object);\n }\n }\n\n public void printListOneLine(List list) {\n List stringList = new ArrayList<>();\n for (Object object : list) {\n stringList.add(object.toString());\n }\n println(String.join(\" \", stringList));\n }\n}\n\nclass ContestReader {\n private static final int BUFFER_SIZE = 1024;\n \n private final InputStream stream;\n private final byte[] buffer;\n private int pointer;\n private int bufferLength;\n \n ContestReader(InputStream stream) {\n this.stream = stream;\n this.buffer = new byte[BUFFER_SIZE];\n this.pointer = 0;\n this.bufferLength = 0;\n }\n \n private boolean hasNextByte() {\n if (pointer < bufferLength) {\n return true;\n }\n \n pointer = 0;\n try {\n bufferLength = stream.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return bufferLength > 0;\n }\n \n private int readByte() {\n if (hasNextByte()) {\n return buffer[pointer++];\n } else {\n return -1;\n }\n }\n \n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n \n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[pointer])) {\n pointer++;\n }\n return hasNextByte();\n }\n \n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n while(true) {\n int b = readByte();\n if (!isPrintableChar(b)) {\n break;\n }\n sb.appendCodePoint(b);\n }\n return sb.toString();\n }\n \n public String nextLine() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n while(true) {\n int b = readByte();\n if (!isPrintableChar(b) && b != 0x20) {\n break;\n }\n sb.appendCodePoint(b);\n }\n return sb.toString();\n }\n \n public char nextChar() {\n return next().charAt(0);\n }\n \n public int nextInt() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n \n int n = 0;\n boolean minus = false;\n \n {\n int b = readByte();\n if (b == '-') {\n minus = true;\n } else if ('0' <= b && b <= '9') {\n n = b - '0';\n } else {\n throw new NumberFormatException();\n }\n }\n \n while(true){\n int b = readByte();\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n }\n }\n \n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n \n long n = 0;\n boolean minus = false;\n \n {\n int b = readByte();\n if (b == '-') {\n minus = true;\n } else if ('0' <= b && b <= '9') {\n n = b - '0';\n } else {\n throw new NumberFormatException();\n }\n }\n \n while(true){\n int b = readByte();\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n }\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public String[] next(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) {\n array[i] = next();\n }\n return array;\n }\n \n public String[] nextLine(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLine();\n }\n return array;\n }\n \n public char[] nextChar(int n) {\n char[] array = new char[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextChar();\n }\n return array;\n }\n \n public int[] nextInt(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n \n public long[] nextLong(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n \n public double[] nextDouble(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n \n public char[] nextCharArray() {\n return next().toCharArray();\n }\n \n public String[][] next(int n, int m) {\n String[][] matrix = new String[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = next();\n }\n }\n return matrix;\n }\n \n public int[][] nextInt(int n, int m) {\n int[][] matrix = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextInt();\n }\n }\n return matrix;\n }\n \n public char[][] nextChar(int n, int m) {\n char[][] matrix = new char[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextChar();\n }\n }\n return matrix;\n }\n \n public long[][] nextLong(int n, int m) {\n long[][] matrix = new long[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextLong();\n }\n }\n return matrix;\n }\n \n public double[][] nextDouble(int n, int m) {\n double[][] matrix = new double[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextDouble();\n }\n }\n return matrix;\n }\n \n public char[][] nextCharArray(int n) {\n char[][] matrix = new char[n][];\n for (int i = 0; i < n; i++) {\n matrix[i] = next().toCharArray();\n }\n return matrix;\n }\n}\n", "language": "Java", "metadata": {"date": 1589854999, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02680.html", "problem_id": "p02680", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02680/input.txt", "sample_output_relpath": "derived/input_output/data/p02680/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02680/Java/s698640620.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s698640620", "user_id": "u853633924"}, "prompt_components": {"gold_output": "13\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\nclass Solver {\n final int n, m;\n final int[][] abcs, defs;\n\n Solver(int n, int m, int[][] abcs, int[][] defs) {\n this.n = n;\n this.m = m;\n this.abcs = abcs;\n this.defs = defs;\n }\n\n private static final int[] DX = new int[]{1, 0, -1, 0};\n private static final int[] DY = new int[]{0, 1, 0, -1};\n\n public String solve() {\n Set xSet = new HashSet<>();\n Set ySet = new HashSet<>();\n xSet.add(-2_000_000_000);\n xSet.add(2_000_000_000);\n ySet.add(-2_000_000_000);\n ySet.add(2_000_000_000);\n for (int[] abc : abcs) {\n int a = abc[0];\n int b = abc[1];\n int c = abc[2];\n xSet.add(a);\n xSet.add(b);\n ySet.add(c);\n }\n for (int[] def : defs) {\n int d = def[0];\n int e = def[1];\n int f = def[2];\n xSet.add(d);\n ySet.add(e);\n ySet.add(f);\n }\n int xSize = xSet.size();\n int ySize = ySet.size();\n List xList = new ArrayList<>();\n List yList = new ArrayList<>();\n xList.addAll(xSet);\n yList.addAll(ySet);\n xSet = null;\n ySet = null;\n Collections.sort(xList);\n Collections.sort(yList);\n Map xMap = new HashMap<>();\n Map yMap = new HashMap<>();\n for (int i = 0; i < xSize; i++) {\n xMap.put(xList.get(i), i);\n }\n for (int i = 0; i < ySize; i++) {\n yMap.put(yList.get(i), i);\n }\n\n boolean[][] blocker = new boolean[2 * xSize][2 * ySize];\n for (int i = 0; i < xSize; i++) {\n for (int j = 0; j < ySize; j++) {\n blocker[2 * i][2 * j] = true;\n }\n }\n for (int[] def : defs) {\n int d = def[0];\n int e = def[1];\n int f = def[2];\n int xIndex = xMap.get(d);\n int yIndexMin = yMap.get(e);\n int yIndexMax = yMap.get(f);\n for (int y = yIndexMin; y < yIndexMax; y++) {\n blocker[2 * xIndex][2 * y + 1] = true;\n }\n }\n for (int[] abc : abcs) {\n int a = abc[0];\n int b = abc[1];\n int c = abc[2];\n int yIndex = yMap.get(c);\n int xIndexMin = xMap.get(a);\n int xIndexMax = xMap.get(b);\n for (int x = xIndexMin; x < xIndexMax; x++) {\n blocker[2 * x + 1][2 * yIndex] = true;\n }\n }\n xMap = null;\n yMap = null;\n\n int startXIndex = -1;\n for (int i = 1; i < xSize; i++) {\n if (xList.get(i - 1) < 0 && 0 <= xList.get(i)) {\n startXIndex = 2 * (i - 1) + 1;\n break;\n }\n }\n\n int startYIndex = -1;\n for (int i = 1; i < ySize; i++) {\n if (yList.get(i - 1) < 0 && 0 <= yList.get(i)) {\n startYIndex = 2 * (i - 1) + 1;\n break;\n }\n }\n\n long answer = 0;\n Deque xIndexStack = new ArrayDeque<>();\n Deque yIndexStack = new ArrayDeque<>();\n boolean[][] enqueued = new boolean[2 * xSize][2 * ySize];\n enqueued[startXIndex][startYIndex] = true;\n xIndexStack.add(startXIndex);\n yIndexStack.add(startYIndex);\n while (!xIndexStack.isEmpty()) {\n int xIndex = xIndexStack.pollLast();\n int yIndex = yIndexStack.pollLast();\n if (xIndex == 0 || yIndex == 0 || xIndex == 2 * xSize - 1 || yIndex == 2 * ySize - 1) {\n return \"INF\";\n }\n if (xIndex % 2 == 1 && yIndex % 2 == 1) {\n long xMax = xList.get(xIndex / 2 + 1);\n long xMin = xList.get(xIndex / 2);\n long yMax = yList.get(yIndex / 2 + 1);\n long yMin = yList.get(yIndex / 2);\n answer += (xMax - xMin) * (yMax - yMin); \n }\n for (int k = 0; k < 4; k++) {\n int nextXIndex = xIndex + DX[k];\n int nextYIndex = yIndex + DY[k];\n if (!blocker[nextXIndex][nextYIndex] && !enqueued[nextXIndex][nextYIndex]) {\n enqueued[nextXIndex][nextYIndex] = true;\n xIndexStack.add(nextXIndex);\n yIndexStack.add(nextYIndex);\n }\n }\n }\n return Long.toString(answer);\n }\n}\n\npublic class Main {\n private static void execute(ContestReader reader, ContestWriter out) {\n int n = reader.nextInt();\n int m = reader.nextInt();\n int[][] abcs = reader.nextInt(n, 3);\n int[][] defs = reader.nextInt(m, 3);\n out.println(new Solver(n, m, abcs, defs).solve());\n }\n \n public static void main(String[] args) {\n ContestReader reader = new ContestReader(System.in);\n ContestWriter out = new ContestWriter(System.out);\n execute(reader, out);\n out.flush();\n }\n}\n\nclass ContestWriter extends PrintWriter {\n ContestWriter(PrintStream printeStream) {\n super(printeStream);\n }\n\n public void printList(List list) {\n for (Object object : list) {\n println(object);\n }\n }\n\n public void printListOneLine(List list) {\n List stringList = new ArrayList<>();\n for (Object object : list) {\n stringList.add(object.toString());\n }\n println(String.join(\" \", stringList));\n }\n}\n\nclass ContestReader {\n private static final int BUFFER_SIZE = 1024;\n \n private final InputStream stream;\n private final byte[] buffer;\n private int pointer;\n private int bufferLength;\n \n ContestReader(InputStream stream) {\n this.stream = stream;\n this.buffer = new byte[BUFFER_SIZE];\n this.pointer = 0;\n this.bufferLength = 0;\n }\n \n private boolean hasNextByte() {\n if (pointer < bufferLength) {\n return true;\n }\n \n pointer = 0;\n try {\n bufferLength = stream.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return bufferLength > 0;\n }\n \n private int readByte() {\n if (hasNextByte()) {\n return buffer[pointer++];\n } else {\n return -1;\n }\n }\n \n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n \n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[pointer])) {\n pointer++;\n }\n return hasNextByte();\n }\n \n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n while(true) {\n int b = readByte();\n if (!isPrintableChar(b)) {\n break;\n }\n sb.appendCodePoint(b);\n }\n return sb.toString();\n }\n \n public String nextLine() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n while(true) {\n int b = readByte();\n if (!isPrintableChar(b) && b != 0x20) {\n break;\n }\n sb.appendCodePoint(b);\n }\n return sb.toString();\n }\n \n public char nextChar() {\n return next().charAt(0);\n }\n \n public int nextInt() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n \n int n = 0;\n boolean minus = false;\n \n {\n int b = readByte();\n if (b == '-') {\n minus = true;\n } else if ('0' <= b && b <= '9') {\n n = b - '0';\n } else {\n throw new NumberFormatException();\n }\n }\n \n while(true){\n int b = readByte();\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n }\n }\n \n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n \n long n = 0;\n boolean minus = false;\n \n {\n int b = readByte();\n if (b == '-') {\n minus = true;\n } else if ('0' <= b && b <= '9') {\n n = b - '0';\n } else {\n throw new NumberFormatException();\n }\n }\n \n while(true){\n int b = readByte();\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n }\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public String[] next(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) {\n array[i] = next();\n }\n return array;\n }\n \n public String[] nextLine(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLine();\n }\n return array;\n }\n \n public char[] nextChar(int n) {\n char[] array = new char[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextChar();\n }\n return array;\n }\n \n public int[] nextInt(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n \n public long[] nextLong(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n \n public double[] nextDouble(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n \n public char[] nextCharArray() {\n return next().toCharArray();\n }\n \n public String[][] next(int n, int m) {\n String[][] matrix = new String[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = next();\n }\n }\n return matrix;\n }\n \n public int[][] nextInt(int n, int m) {\n int[][] matrix = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextInt();\n }\n }\n return matrix;\n }\n \n public char[][] nextChar(int n, int m) {\n char[][] matrix = new char[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextChar();\n }\n }\n return matrix;\n }\n \n public long[][] nextLong(int n, int m) {\n long[][] matrix = new long[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextLong();\n }\n }\n return matrix;\n }\n \n public double[][] nextDouble(int n, int m) {\n double[][] matrix = new double[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n matrix[i][j] = nextDouble();\n }\n }\n return matrix;\n }\n \n public char[][] nextCharArray(int n) {\n char[][] matrix = new char[n][];\n for (int i = 0; i < n; i++) {\n matrix[i] = next().toCharArray();\n }\n return matrix;\n }\n}\n", "problem_context": "Score: 600 points\n\nProblem Statement\n\nThere is a grass field that stretches infinitely.\n\nIn this field, there is a negligibly small cow. Let (x, y) denote the point that is x\\ \\mathrm{cm} south and y\\ \\mathrm{cm} east of the point where the cow stands now. The cow itself is standing at (0, 0).\n\nThere are also N north-south lines and M east-west lines drawn on the field. The i-th north-south line is the segment connecting the points (A_i, C_i) and (B_i, C_i), and the j-th east-west line is the segment connecting the points (D_j, E_j) and (D_j, F_j).\n\nWhat is the area of the region the cow can reach when it can move around as long as it does not cross the segments (including the endpoints)? If this area is infinite, print INF instead.\n\nConstraints\n\nAll values in input are integers between -10^9 and 10^9 (inclusive).\n\n1 \\leq N, M \\leq 1000\n\nA_i < B_i\\ (1 \\leq i \\leq N)\n\nE_j < F_j\\ (1 \\leq j \\leq M)\n\nThe point (0, 0) does not lie on any of the given segments.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1 C_1\n:\nA_N B_N C_N\nD_1 E_1 F_1\n:\nD_M E_M F_M\n\nOutput\n\nIf the area of the region the cow can reach is infinite, print INF; otherwise, print an integer representing the area in \\mathrm{cm^2}.\n\n(Under the constraints, it can be proved that the area of the region is always an integer if it is not infinite.)\n\nSample Input 1\n\n5 6\n1 2 0\n0 1 1\n0 2 2\n-3 4 -1\n-2 6 3\n1 0 1\n0 1 2\n2 0 2\n-1 -4 5\n3 -2 4\n1 2 4\n\nSample Output 1\n\n13\n\nThe area of the region the cow can reach is 13\\ \\mathrm{cm^2}.\n\nSample Input 2\n\n6 1\n-3 -1 -2\n-3 -1 1\n-2 -1 2\n1 4 -2\n1 4 -1\n1 4 1\n3 1 4\n\nSample Output 2\n\nINF\n\nThe area of the region the cow can reach is infinite.", "sample_input": "5 6\n1 2 0\n0 1 1\n0 2 2\n-3 4 -1\n-2 6 3\n1 0 1\n0 1 2\n2 0 2\n-1 -4 5\n3 -2 4\n1 2 4\n"}, "reference_outputs": ["13\n"], "source_document_id": "p02680", "source_text": "Score: 600 points\n\nProblem Statement\n\nThere is a grass field that stretches infinitely.\n\nIn this field, there is a negligibly small cow. Let (x, y) denote the point that is x\\ \\mathrm{cm} south and y\\ \\mathrm{cm} east of the point where the cow stands now. The cow itself is standing at (0, 0).\n\nThere are also N north-south lines and M east-west lines drawn on the field. The i-th north-south line is the segment connecting the points (A_i, C_i) and (B_i, C_i), and the j-th east-west line is the segment connecting the points (D_j, E_j) and (D_j, F_j).\n\nWhat is the area of the region the cow can reach when it can move around as long as it does not cross the segments (including the endpoints)? If this area is infinite, print INF instead.\n\nConstraints\n\nAll values in input are integers between -10^9 and 10^9 (inclusive).\n\n1 \\leq N, M \\leq 1000\n\nA_i < B_i\\ (1 \\leq i \\leq N)\n\nE_j < F_j\\ (1 \\leq j \\leq M)\n\nThe point (0, 0) does not lie on any of the given segments.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1 C_1\n:\nA_N B_N C_N\nD_1 E_1 F_1\n:\nD_M E_M F_M\n\nOutput\n\nIf the area of the region the cow can reach is infinite, print INF; otherwise, print an integer representing the area in \\mathrm{cm^2}.\n\n(Under the constraints, it can be proved that the area of the region is always an integer if it is not infinite.)\n\nSample Input 1\n\n5 6\n1 2 0\n0 1 1\n0 2 2\n-3 4 -1\n-2 6 3\n1 0 1\n0 1 2\n2 0 2\n-1 -4 5\n3 -2 4\n1 2 4\n\nSample Output 1\n\n13\n\nThe area of the region the cow can reach is 13\\ \\mathrm{cm^2}.\n\nSample Input 2\n\n6 1\n-3 -1 -2\n-3 -1 1\n-2 -1 2\n1 4 -2\n1 4 -1\n1 4 1\n3 1 4\n\nSample Output 2\n\nINF\n\nThe area of the region the cow can reach is infinite.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 10282, "cpu_time_ms": 2482, "memory_kb": 464456}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s673959921", "group_id": "codeNet:p02681", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String a = sc.next();\n String b = sc.next();\n if(b.substring(0, b.length()-1).equals(a)) System.out.println(\"Yes\");\n else System.out.println(\"No\");\n }\n}", "language": "Java", "metadata": {"date": 1592043820, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02681.html", "problem_id": "p02681", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02681/input.txt", "sample_output_relpath": "derived/input_output/data/p02681/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02681/Java/s673959921.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673959921", "user_id": "u934782869"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String a = sc.next();\n String b = sc.next();\n if(b.substring(0, b.length()-1).equals(a)) System.out.println(\"Yes\");\n else System.out.println(\"No\");\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "sample_input": "chokudai\nchokudaiz\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02681", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 321, "cpu_time_ms": 91, "memory_kb": 26960}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s549617399", "group_id": "codeNet:p02681", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args){\n \n Scanner scanner = new Scanner(System.in);\n String S = scanner.next();\n String T = scanner.next();\n \n if(T.contains(S) && S.charAt(0)==T.charAt(0)){\n System.out.println(\"Yes\");\n }else{\n System.out.println(\"No\");\n }\n\n }\n}\n", "language": "Java", "metadata": {"date": 1589162101, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02681.html", "problem_id": "p02681", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02681/input.txt", "sample_output_relpath": "derived/input_output/data/p02681/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02681/Java/s549617399.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s549617399", "user_id": "u407795516"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args){\n \n Scanner scanner = new Scanner(System.in);\n String S = scanner.next();\n String T = scanner.next();\n \n if(T.contains(S) && S.charAt(0)==T.charAt(0)){\n System.out.println(\"Yes\");\n }else{\n System.out.println(\"No\");\n }\n\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "sample_input": "chokudai\nchokudaiz\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02681", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 389, "cpu_time_ms": 107, "memory_kb": 35668}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s600037177", "group_id": "codeNet:p02681", "input_text": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n String s = sc.next();\n String t = sc.next();\n String ans = \"No\";\n\n if(t.substring(0, s.length()).equals(s)){\n ans = \"Yes\";\n }\n\n System.out.println(ans);\n }\n}\n", "language": "Java", "metadata": {"date": 1589158991, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02681.html", "problem_id": "p02681", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02681/input.txt", "sample_output_relpath": "derived/input_output/data/p02681/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02681/Java/s600037177.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s600037177", "user_id": "u229120147"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n String s = sc.next();\n String t = sc.next();\n String ans = \"No\";\n\n if(t.substring(0, s.length()).equals(s)){\n ans = \"Yes\";\n }\n\n System.out.println(ans);\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "sample_input": "chokudai\nchokudaiz\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02681", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 307, "cpu_time_ms": 132, "memory_kb": 35692}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s364626949", "group_id": "codeNet:p02682", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint res = 0;\n\t\tif (k - a <= 0) {\n\t\t\tSystem.out.println(k);\n\t\t} else {\n\t\t\tres += a;\n\t\t\tk -= a;\n\t\t\tif (k - b <= 0) {\n\t\t\t\tSystem.out.println(res);\n\t\t\t} else {\n\t\t\t\tk -= b;\n\t\t\t\tSystem.out.println(res + -1 * k);\n\t\t\t}\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1589161480, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02682.html", "problem_id": "p02682", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02682/input.txt", "sample_output_relpath": "derived/input_output/data/p02682/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02682/Java/s364626949.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s364626949", "user_id": "u166806719"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint res = 0;\n\t\tif (k - a <= 0) {\n\t\t\tSystem.out.println(k);\n\t\t} else {\n\t\t\tres += a;\n\t\t\tk -= a;\n\t\t\tif (k - b <= 0) {\n\t\t\t\tSystem.out.println(res);\n\t\t\t} else {\n\t\t\t\tk -= b;\n\t\t\t\tSystem.out.println(res + -1 * k);\n\t\t\t}\n\t\t}\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "sample_input": "2 1 1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02682", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 446, "cpu_time_ms": 108, "memory_kb": 35756}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s928395152", "group_id": "codeNet:p02682", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.Iterator;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n void solve(MyScanner in, MyWriter out) {\n long a = in.nextLong();\n long b = in.nextLong();\n long c = in.nextLong();\n long k = in.nextLong();\n long answer = 0;\n answer += 1 * Math.min(a, k);\n k = Math.max(0, k - a);\n k = Math.max(0, k - b);\n answer += -1 * Math.min(c, k);\n out.println(answer);\n }\n public static void main(String[] args) {\n MyWriter w = new MyWriter(System.out);\n new Main().solve(new MyScanner(System.in), w);\n w.flush();\n }\n static final class MyScanner {\n static final int BUFFER_SIZE = 8192;\n private final InputStream in;\n private final byte[] buffer = new byte[BUFFER_SIZE];\n private int point;\n private int readLength;\n\n MyScanner(InputStream in) {\n this.in = in;\n }\n private int readByte() {\n if (point < readLength) {\n int result = buffer[point];\n point += 1;\n return result;\n }\n try {\n readLength = in.read(buffer);\n } catch (IOException e) {\n throw new AssertionError(null, e);\n }\n if (readLength == -1) {\n return -1;\n }\n point = 1;\n return buffer[0];\n }\n private static boolean isVisibleChar(int c) {\n return 33 <= c && c <= 126;\n }\n char nextChar() {\n int c = readByte();\n while (!(c == -1 || isVisibleChar(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n return (char)c;\n }\n String next() {\n return next(16);\n }\n String next(int n) {\n int c = readByte();\n while (!(c == -1 || isVisibleChar(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n StringBuilder b = new StringBuilder(n);\n do {\n b.append((char)c);\n c = readByte();\n } while (c != -1 && isVisibleChar(c));\n return b.toString();\n }\n long nextLong() {\n int c = readByte();\n while (!(c == -1 || isVisibleChar(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n boolean minus = false;\n long limit = -Long.MAX_VALUE;\n if (c == '-') {\n minus = true;\n limit = Long.MIN_VALUE;\n c = readByte();\n }\n long n = 0L;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n if (n < limit / 10L) {\n throw new InputMismatchException();\n }\n n *= 10L;\n int digit = c - '0';\n if (n < limit + digit) {\n throw new InputMismatchException();\n }\n n -= digit;\n c = readByte();\n } while (c != -1 && isVisibleChar(c));\n return minus ? n : -n;\n }\n int nextInt() {\n long n = nextLong();\n if (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE) {\n throw new InputMismatchException();\n }\n return (int)n;\n }\n double nextDouble() {\n return Double.parseDouble(next());\n }\n int[] nextIntArray(int n) {\n int[] result = new int[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextInt();\n }\n return result;\n }\n long[] nextLongArray(int n) {\n long[] result = new long[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextLong();\n }\n return result;\n }\n char[] nextCharArray(int n) {\n char[] result = new char[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextChar();\n }\n return result;\n }\n char[][] next2dCharArray(int n, int m) {\n char[][] result = new char[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n result[i][j] = nextChar();\n }\n }\n return result;\n }\n int[][] nextVerticalIntArrays(int arrayCount, int arrayLength) {\n int[][] result = new int[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextInt();\n }\n }\n return result;\n }\n long[][] nextVerticalLongArrays(int arrayCount, int arrayLength) {\n long[][] result = new long[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextLong();\n }\n }\n return result;\n }\n char[][] nextVerticalCharArrays(int arrayCount, int arrayLength) {\n char[][] result = new char[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextChar();\n }\n }\n return result;\n }\n }\n static final class MyWriter extends PrintWriter {\n MyWriter(OutputStream out) {\n super(out);\n }\n void println(int[] x) {\n println(x, \" \");\n }\n void println(int[] x, String delimiter) {\n if (x.length > 0) {\n print(x[0]);\n for (int i = 1; i < x.length; i++) {\n print(delimiter);\n print(x[i]);\n }\n }\n println();\n }\n void println(long[] x) {\n println(x, \" \");\n }\n void println(long[] x, String delimiter) {\n if (x.length > 0) {\n print(x[0]);\n for (int i = 1; i < x.length; i++) {\n print(delimiter);\n print(x[i]);\n }\n }\n println();\n }\n void println(Iterable iterable) {\n println(iterable, \" \");\n }\n void println(Iterable iterable, String delimiter) {\n Iterator i = iterable.iterator();\n if (i.hasNext()) {\n print(i.next());\n while (i.hasNext()) {\n print(delimiter);\n print(i.next());\n }\n }\n println();\n }\n void printLines(int[] x) {\n println(x, System.lineSeparator());\n }\n void printLines(long[] x) {\n println(x, System.lineSeparator());\n }\n void printLines(Iterable iterable) {\n println(iterable, System.lineSeparator());\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1589159383, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02682.html", "problem_id": "p02682", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02682/input.txt", "sample_output_relpath": "derived/input_output/data/p02682/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02682/Java/s928395152.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s928395152", "user_id": "u097304477"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.Iterator;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n void solve(MyScanner in, MyWriter out) {\n long a = in.nextLong();\n long b = in.nextLong();\n long c = in.nextLong();\n long k = in.nextLong();\n long answer = 0;\n answer += 1 * Math.min(a, k);\n k = Math.max(0, k - a);\n k = Math.max(0, k - b);\n answer += -1 * Math.min(c, k);\n out.println(answer);\n }\n public static void main(String[] args) {\n MyWriter w = new MyWriter(System.out);\n new Main().solve(new MyScanner(System.in), w);\n w.flush();\n }\n static final class MyScanner {\n static final int BUFFER_SIZE = 8192;\n private final InputStream in;\n private final byte[] buffer = new byte[BUFFER_SIZE];\n private int point;\n private int readLength;\n\n MyScanner(InputStream in) {\n this.in = in;\n }\n private int readByte() {\n if (point < readLength) {\n int result = buffer[point];\n point += 1;\n return result;\n }\n try {\n readLength = in.read(buffer);\n } catch (IOException e) {\n throw new AssertionError(null, e);\n }\n if (readLength == -1) {\n return -1;\n }\n point = 1;\n return buffer[0];\n }\n private static boolean isVisibleChar(int c) {\n return 33 <= c && c <= 126;\n }\n char nextChar() {\n int c = readByte();\n while (!(c == -1 || isVisibleChar(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n return (char)c;\n }\n String next() {\n return next(16);\n }\n String next(int n) {\n int c = readByte();\n while (!(c == -1 || isVisibleChar(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n StringBuilder b = new StringBuilder(n);\n do {\n b.append((char)c);\n c = readByte();\n } while (c != -1 && isVisibleChar(c));\n return b.toString();\n }\n long nextLong() {\n int c = readByte();\n while (!(c == -1 || isVisibleChar(c))) {\n c = readByte();\n }\n if (c == -1) {\n throw new NoSuchElementException();\n }\n boolean minus = false;\n long limit = -Long.MAX_VALUE;\n if (c == '-') {\n minus = true;\n limit = Long.MIN_VALUE;\n c = readByte();\n }\n long n = 0L;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n if (n < limit / 10L) {\n throw new InputMismatchException();\n }\n n *= 10L;\n int digit = c - '0';\n if (n < limit + digit) {\n throw new InputMismatchException();\n }\n n -= digit;\n c = readByte();\n } while (c != -1 && isVisibleChar(c));\n return minus ? n : -n;\n }\n int nextInt() {\n long n = nextLong();\n if (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE) {\n throw new InputMismatchException();\n }\n return (int)n;\n }\n double nextDouble() {\n return Double.parseDouble(next());\n }\n int[] nextIntArray(int n) {\n int[] result = new int[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextInt();\n }\n return result;\n }\n long[] nextLongArray(int n) {\n long[] result = new long[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextLong();\n }\n return result;\n }\n char[] nextCharArray(int n) {\n char[] result = new char[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextChar();\n }\n return result;\n }\n char[][] next2dCharArray(int n, int m) {\n char[][] result = new char[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n result[i][j] = nextChar();\n }\n }\n return result;\n }\n int[][] nextVerticalIntArrays(int arrayCount, int arrayLength) {\n int[][] result = new int[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextInt();\n }\n }\n return result;\n }\n long[][] nextVerticalLongArrays(int arrayCount, int arrayLength) {\n long[][] result = new long[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextLong();\n }\n }\n return result;\n }\n char[][] nextVerticalCharArrays(int arrayCount, int arrayLength) {\n char[][] result = new char[arrayCount][arrayLength];\n for (int i = 0; i < arrayLength; i++) {\n for (int j = 0; j < arrayCount; j++) {\n result[j][i] = nextChar();\n }\n }\n return result;\n }\n }\n static final class MyWriter extends PrintWriter {\n MyWriter(OutputStream out) {\n super(out);\n }\n void println(int[] x) {\n println(x, \" \");\n }\n void println(int[] x, String delimiter) {\n if (x.length > 0) {\n print(x[0]);\n for (int i = 1; i < x.length; i++) {\n print(delimiter);\n print(x[i]);\n }\n }\n println();\n }\n void println(long[] x) {\n println(x, \" \");\n }\n void println(long[] x, String delimiter) {\n if (x.length > 0) {\n print(x[0]);\n for (int i = 1; i < x.length; i++) {\n print(delimiter);\n print(x[i]);\n }\n }\n println();\n }\n void println(Iterable iterable) {\n println(iterable, \" \");\n }\n void println(Iterable iterable, String delimiter) {\n Iterator i = iterable.iterator();\n if (i.hasNext()) {\n print(i.next());\n while (i.hasNext()) {\n print(delimiter);\n print(i.next());\n }\n }\n println();\n }\n void printLines(int[] x) {\n println(x, System.lineSeparator());\n }\n void printLines(long[] x) {\n println(x, System.lineSeparator());\n }\n void printLines(Iterable iterable) {\n println(iterable, System.lineSeparator());\n }\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "sample_input": "2 1 1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02682", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7564, "cpu_time_ms": 65, "memory_kb": 32604}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s364648865", "group_id": "codeNet:p02682", "input_text": "import java.util.*;\n\npublic class Main {\n\n static int gcd (int a, int b) {return b>0?gcd(b,a%b):a;}\n static int mod = 1000000007;\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n\n if(A >= K){\n System.out.println(K);\n } else if(A + B >= K){\n System.out.println(A);\n } else {\n System.out.println(A - (K - A - B));\n }\n }\n\n}\n\n\n\n\n\n\n\n", "language": "Java", "metadata": {"date": 1589159161, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02682.html", "problem_id": "p02682", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02682/input.txt", "sample_output_relpath": "derived/input_output/data/p02682/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02682/Java/s364648865.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s364648865", "user_id": "u579455624"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n static int gcd (int a, int b) {return b>0?gcd(b,a%b):a;}\n static int mod = 1000000007;\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n int K = sc.nextInt();\n\n if(A >= K){\n System.out.println(K);\n } else if(A + B >= K){\n System.out.println(A);\n } else {\n System.out.println(A - (K - A - B));\n }\n }\n\n}\n\n\n\n\n\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "sample_input": "2 1 1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02682", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 562, "cpu_time_ms": 131, "memory_kb": 35704}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s732639584", "group_id": "codeNet:p02682", "input_text": "\nimport java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\t\n\t\tint a=sc.nextInt();\n\t\tint b=sc.nextInt();\n\t\tint c=sc.nextInt();\n\t\tint k=sc.nextInt();\n\t\t\n\t\tint ans=0;\n\t\t\n\t\tif(k<=a)ans=k;\n\t\telse if(kkari[j]) {\n\t\t\t\t\tflag=false;\n\t\t\t\t\t//System.out.println(money);\n\t\t\t\t\t//System.out.println(kari[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {kuso=true;\n\t\t\t}\n\t\t\tif(flag&&(ans>money)) {\n\t\t\t\tans=money;\n\t\t\t}\n\t\t\tflag=true;\n\t\t}\n\t\tif(kuso) {\n\t\t\tSystem.out.println(ans);\n\t\t}else {\n\t\t\tSystem.out.println(-1);\n\t\t}\n\n}\n\tpublic static void zenbit(int kosu,int N,int gyo[]) {\n\t\tif(kosukari[j]) {\n\t\t\t\t\tflag=false;\n\t\t\t\t\t//System.out.println(money);\n\t\t\t\t\t//System.out.println(kari[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {kuso=true;\n\t\t\t}\n\t\t\tif(flag&&(ans>money)) {\n\t\t\t\tans=money;\n\t\t\t}\n\t\t\tflag=true;\n\t\t}\n\t\tif(kuso) {\n\t\t\tSystem.out.println(ans);\n\t\t}else {\n\t\t\tSystem.out.println(-1);\n\t\t}\n\n}\n\tpublic static void zenbit(int kosu,int N,int gyo[]) {\n\t\tif(kosu lBra = new ArrayList<>();\n\t\tList rBra = new ArrayList<>();\n\t\t\n\t\tfor(int i=0;i0)lBra.add(new Brackets(lmin, l-r));\n\t\t\telse {\n\t\t\t\tint rmin = inf;\n\t\t\t\tl = 0; r = 0;\n\t\t\t\tfor(int j=s.length;j>=0;j--) {\n\t\t\t\t\tif(s[j]=='(')l++;\n\t\t\t\t\telse r++;\n\t\t\t\t\trmin = min(rmin, r-l);\n\t\t\t\t}\n\t\t\t\trBra.add(new Brackets(rmin, r-l));\n\t\t\t}\n\t\t}\n\t\t//登りの山を作る\n\t\tint sz = lBra.size();\n\t\tCollections.sort(lBra, (l1, l2)->{\n\t\t\tif(l1.min == l2.min) return l2.sum - l1.sum;\n\t\t\treturn l2.min - l1.min;\n\t\t});\n\t\tint lsum = 0;\n\t\tfor(int i=0;i{\n\t\t\tif(l1.min == l2.min) return l2.sum - l1.sum;\n\t\t\treturn l2.min - l1.min;\n\t\t});\n\t\tint rsum = 0;\n\t\tfor(int i=0;i void reverse(List ls) {\n\t\tint sz = ls.size();\n\t\tfor (int i = 0; i < sz / 2; i++) {\n\t\t\tT t = ls.get(i);\n\t\t\tls.set(i, ls.get(sz - 1 - i));\n\t\t\tls.set(sz - 1 - i, t);\n\t\t}\n\t}\n\n\tstatic void reverse(T[] ar) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tT t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\n\tstatic void sbnl() {//StringBuilderに改行文字をappendする\n\t\tsb.append(\"\\n\");\n\t}\n\n\tstatic int lowerBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(List ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) >= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) >= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) >= 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic int upperBound(List ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) > 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) > 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) > 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic int rupperBound(List ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) < 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) < 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) < 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic int rlowerBound(List ls, T x) {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) <= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) <= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) <= 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic int[] concat(int x, int arr[]) {\n\t\tint ret[] = new int[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 1, ret.length - 1);\n\t\tret[0] = x;\n\t\treturn ret;\n\t}\n\n\tstatic int[] concat(int arr[], int x) {\n\t\tint ret[] = new int[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\n\tstatic long[] concat(long x, long arr[]) {\n\t\tlong ret[] = new long[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 1, ret.length - 1);\n\t\tret[0] = x;\n\t\treturn ret;\n\t}\n\n\tstatic long[] concat(long arr[], long x) {\n\t\tlong ret[] = new long[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\n\tstatic char[] concat(char x, char arr[]) {\n\t\tchar ret[] = new char[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\n\tstatic char[] concat(char arr[], char x) {\n\t\tchar ret[] = new char[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\n\tstatic int max(int x, int y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic int min(int x, int y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic int max(int x, int y, int z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\n\tstatic int min(int x, int y, int z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\n\tstatic long max(long x, long y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic long min(long x, long y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic long max(long x, long y, long z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\n\tstatic long min(long x, long y, long z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\n\tstatic double max(double x, double y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic double min(double x, double y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic double max(double x, double y, double z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\n\tstatic double min(double x, double y, double z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\n\tstatic void sort(int[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void sort(long[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void sort(double[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void sort(char[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void rsort(int[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tint tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void rsort(long[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tlong tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void rsort(double[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tdouble tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void rsort(char[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tchar tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void fill(int arr[], int x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(long arr[], long x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(boolean arr[], boolean x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(double arr[], double x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(int arr[][], int x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\tstatic void fill(long arr[][], long x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\tstatic void fill(double arr[][], double x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\tstatic void fill(boolean arr[][], boolean x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\t//MOD culc\n\tstatic long plus(long x, long y) {\n\t\tlong res = (x + y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long sub(long x, long y) {\n\t\tlong res = (x - y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long mul(long x, long y) {\n\t\tlong res = (x * y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long div(long x, long y) {\n\t\tlong res = x * pow(y, mod - 2) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long pow(long x, long y) {\n\t\tif (y < 0)\n\t\t\treturn 0;\n\t\tif (y == 0)\n\t\t\treturn 1;\n\t\tif (y % 2 == 1)\n\t\t\treturn (x * pow(x, y - 1)) % mod;\n\t\tlong root = pow(x, y / 2);\n\t\treturn root * root % mod;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\t//input\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\n\tprivate static int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate static boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate static int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static char nc() {\n\t\treturn (char) skip();\n\t}\n\n\tprivate static String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate static char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static long[] nla(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n\n\tprivate static int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1590942374, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02686.html", "problem_id": "p02686", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02686/input.txt", "sample_output_relpath": "derived/input_output/data/p02686/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02686/Java/s642662916.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s642662916", "user_id": "u881359256"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\nclass Brackets{\n\tint min, sum;\n\tpublic Brackets(int min, int sum) {\n\t\tsuper();\n\t\tthis.min = min;\n\t\tthis.sum = sum;\n\t}\n}\n\npublic class Main {\n\tstatic String no = \"No\", yes = \"Yes\";\n\tstatic void solve() {\n\t\tint n = ni();\n\t\tList lBra = new ArrayList<>();\n\t\tList rBra = new ArrayList<>();\n\t\t\n\t\tfor(int i=0;i0)lBra.add(new Brackets(lmin, l-r));\n\t\t\telse {\n\t\t\t\tint rmin = inf;\n\t\t\t\tl = 0; r = 0;\n\t\t\t\tfor(int j=s.length;j>=0;j--) {\n\t\t\t\t\tif(s[j]=='(')l++;\n\t\t\t\t\telse r++;\n\t\t\t\t\trmin = min(rmin, r-l);\n\t\t\t\t}\n\t\t\t\trBra.add(new Brackets(rmin, r-l));\n\t\t\t}\n\t\t}\n\t\t//登りの山を作る\n\t\tint sz = lBra.size();\n\t\tCollections.sort(lBra, (l1, l2)->{\n\t\t\tif(l1.min == l2.min) return l2.sum - l1.sum;\n\t\t\treturn l2.min - l1.min;\n\t\t});\n\t\tint lsum = 0;\n\t\tfor(int i=0;i{\n\t\t\tif(l1.min == l2.min) return l2.sum - l1.sum;\n\t\t\treturn l2.min - l1.min;\n\t\t});\n\t\tint rsum = 0;\n\t\tfor(int i=0;i void reverse(List ls) {\n\t\tint sz = ls.size();\n\t\tfor (int i = 0; i < sz / 2; i++) {\n\t\t\tT t = ls.get(i);\n\t\t\tls.set(i, ls.get(sz - 1 - i));\n\t\t\tls.set(sz - 1 - i, t);\n\t\t}\n\t}\n\n\tstatic void reverse(T[] ar) {\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tT t = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = t;\n\t\t}\n\t}\n\n\tstatic void sbnl() {//StringBuilderに改行文字をappendする\n\t\tsb.append(\"\\n\");\n\t}\n\n\tstatic int lowerBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(int[] a, int x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(long[] a, long x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(double[] a, double x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] < x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int upperBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] <= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rlowerBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] > x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int rupperBound(char[] a, char x) {\n\t\tint l = -1, r = a.length;\n\t\twhile (r - l > 1) {\n\t\t\tint c = (l + r) / 2;\n\t\t\tif (a[c] >= x) {\n\t\t\t\tl = c;\n\t\t\t} else {\n\t\t\t\tr = c;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\n\n\tstatic int lowerBound(List ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) >= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) >= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) >= 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic int upperBound(List ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) > 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) > 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) > 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic int rupperBound(List ls, T x) throws RuntimeException {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) < 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) < 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) < 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic int rlowerBound(List ls, T x) {\n\t\tif (ls.size() == 0)\n\t\t\treturn -1;\n\t\tif (ls.get(0) instanceof Integer) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Integer) t1).compareTo((Integer) t2) <= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Long) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Long) t1).compareTo((Long) t2) <= 0 ? 1 : -1);\n\t\t} else if (ls.get(0) instanceof Double) {\n\t\t\treturn ~Collections.binarySearch(ls, x, (t1, t2) -> ((Double) t1).compareTo((Double) t2) <= 0 ? 1 : -1);\n\t\t} else {\n\t\t\tSystem.err.println(\n\t\t\t\t\tString.format(\"%s:数値でないリストを二分探索しています。\", Thread.currentThread().getStackTrace()[1].getMethodName()));\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t}\n\n\tstatic int[] concat(int x, int arr[]) {\n\t\tint ret[] = new int[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 1, ret.length - 1);\n\t\tret[0] = x;\n\t\treturn ret;\n\t}\n\n\tstatic int[] concat(int arr[], int x) {\n\t\tint ret[] = new int[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\n\tstatic long[] concat(long x, long arr[]) {\n\t\tlong ret[] = new long[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 1, ret.length - 1);\n\t\tret[0] = x;\n\t\treturn ret;\n\t}\n\n\tstatic long[] concat(long arr[], long x) {\n\t\tlong ret[] = new long[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\n\tstatic char[] concat(char x, char arr[]) {\n\t\tchar ret[] = new char[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\n\tstatic char[] concat(char arr[], char x) {\n\t\tchar ret[] = new char[arr.length + 1];\n\t\tSystem.arraycopy(arr, 0, ret, 0, ret.length - 1);\n\t\tret[ret.length - 1] = x;\n\t\treturn ret;\n\t}\n\n\tstatic int max(int x, int y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic int min(int x, int y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic int max(int x, int y, int z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\n\tstatic int min(int x, int y, int z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\n\tstatic long max(long x, long y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic long min(long x, long y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic long max(long x, long y, long z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\n\tstatic long min(long x, long y, long z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\n\tstatic double max(double x, double y) {\n\t\treturn Math.max(x, y);\n\t}\n\n\tstatic double min(double x, double y) {\n\t\treturn Math.min(x, y);\n\t}\n\n\tstatic double max(double x, double y, double z) {\n\t\tx = Math.max(x, y);\n\t\tx = Math.max(x, z);\n\t\treturn x;\n\t}\n\n\tstatic double min(double x, double y, double z) {\n\t\tx = Math.min(x, y);\n\t\tx = Math.min(x, z);\n\t\treturn x;\n\t}\n\n\tstatic void sort(int[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void sort(long[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void sort(double[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void sort(char[] ar) {\n\t\tArrays.sort(ar);\n\t}\n\n\tstatic void rsort(int[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tint tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void rsort(long[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tlong tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void rsort(double[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tdouble tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void rsort(char[] ar) {\n\t\tArrays.sort(ar);\n\t\tint len = ar.length;\n\t\tfor (int i = 0; i < len / 2; i++) {\n\t\t\tchar tmp = ar[i];\n\t\t\tar[i] = ar[len - 1 - i];\n\t\t\tar[len - 1 - i] = tmp;\n\t\t}\n\t}\n\n\tstatic void fill(int arr[], int x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(long arr[], long x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(boolean arr[], boolean x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(double arr[], double x) {\n\t\tArrays.fill(arr, x);\n\t}\n\n\tstatic void fill(int arr[][], int x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\tstatic void fill(long arr[][], long x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\tstatic void fill(double arr[][], double x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\tstatic void fill(boolean arr[][], boolean x) {\n\t\tfor (int i = 0; i < arr.length; i++)\n\t\t\tArrays.fill(arr[i], x);\n\t}\n\n\t//MOD culc\n\tstatic long plus(long x, long y) {\n\t\tlong res = (x + y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long sub(long x, long y) {\n\t\tlong res = (x - y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long mul(long x, long y) {\n\t\tlong res = (x * y) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long div(long x, long y) {\n\t\tlong res = x * pow(y, mod - 2) % mod;\n\t\treturn res < 0 ? res + mod : res;\n\t}\n\n\tstatic long pow(long x, long y) {\n\t\tif (y < 0)\n\t\t\treturn 0;\n\t\tif (y == 0)\n\t\t\treturn 1;\n\t\tif (y % 2 == 1)\n\t\t\treturn (x * pow(x, y - 1)) % mod;\n\t\tlong root = pow(x, y / 2);\n\t\treturn root * root % mod;\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t}\n\n\t//input\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\n\tprivate static int readByte() {\n\t\tif (lenbuf == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (ptrbuf >= lenbuf) {\n\t\t\tptrbuf = 0;\n\t\t\ttry {\n\t\t\t\tlenbuf = is.read(inbuf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (lenbuf <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\n\tprivate static boolean isSpaceChar(int c) {\n\t\treturn !(c >= 33 && c <= 126);\n\t}\n\n\tprivate static int skip() {\n\t\tint b;\n\t\twhile ((b = readByte()) != -1 && isSpaceChar(b))\n\t\t\t;\n\t\treturn b;\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static double nd() {\n\t\treturn Double.parseDouble(ns());\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static char nc() {\n\t\treturn (char) skip();\n\t}\n\n\tprivate static String ns() {\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile (!(isSpaceChar(b))) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tprivate static char[] ns(int n) {\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile (p < n && !(isSpaceChar(b))) {\n\t\t\tbuf[p++] = (char) b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static char[][] nm(int n, int m) {\n\t\tchar[][] map = new char[n][];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tmap[i] = ns(m);\n\t\treturn map;\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static long[] nla(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n\n\tprivate static int ni() {\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static long nl() {\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))\n\t\t\t;\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t} else {\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "sample_input": "2\n)\n(()\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02686", "source_text": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 16733, "cpu_time_ms": 67, "memory_kb": 25584}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s508061212", "group_id": "codeNet:p02687", "input_text": "public class Main {\n public static void main(String[] args) {\n long x = (1L << 32) - 1 ;\n long n = (int)1e8;\n long p = 1;\n\n for (int i = 1; i <= n; i++) {\n p += i;\n p %= x;\n }\n\n System.out.println(p);\n } \n}", "language": "Java", "metadata": {"date": 1589155576, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02687.html", "problem_id": "p02687", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02687/input.txt", "sample_output_relpath": "derived/input_output/data/p02687/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02687/Java/s508061212.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s508061212", "user_id": "u156040680"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "public class Main {\n public static void main(String[] args) {\n long x = (1L << 32) - 1 ;\n long n = (int)1e8;\n long p = 1;\n\n for (int i = 1; i <= n; i++) {\n p += i;\n p %= x;\n }\n\n System.out.println(p);\n } \n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "sample_input": "ABC\n"}, "reference_outputs": ["ARC\n"], "source_document_id": "p02687", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 278, "cpu_time_ms": 1351, "memory_kb": 32328}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s880544319", "group_id": "codeNet:p02687", "input_text": "import java.util.Scanner;\n\nclass Main{\n public static void main(String args[]){\n\tScanner sc = new Scanner(System.in);\n\tString s = sc.next();\n\tif(s.equals(\"ABC\"))\n\t\tSystem.out.println(\"ARC\");\n\telse\n\t\tSystem.out.println(\"ABC\");\n }\n}\n", "language": "Java", "metadata": {"date": 1588554443, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02687.html", "problem_id": "p02687", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02687/input.txt", "sample_output_relpath": "derived/input_output/data/p02687/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02687/Java/s880544319.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s880544319", "user_id": "u909323623"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main{\n public static void main(String args[]){\n\tScanner sc = new Scanner(System.in);\n\tString s = sc.next();\n\tif(s.equals(\"ABC\"))\n\t\tSystem.out.println(\"ARC\");\n\telse\n\t\tSystem.out.println(\"ABC\");\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "sample_input": "ABC\n"}, "reference_outputs": ["ARC\n"], "source_document_id": "p02687", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 241, "cpu_time_ms": 130, "memory_kb": 35752}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s466423242", "group_id": "codeNet:p02687", "input_text": "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n String a = scan.next();\n scan.close();\n\n if(a.equals(\"ARC\")) System.out.println(\"ABC\");\n else System.out.println(\"ARC\");\n }\n}", "language": "Java", "metadata": {"date": 1588554138, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02687.html", "problem_id": "p02687", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02687/input.txt", "sample_output_relpath": "derived/input_output/data/p02687/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02687/Java/s466423242.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466423242", "user_id": "u956322200"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n String a = scan.next();\n scan.close();\n\n if(a.equals(\"ARC\")) System.out.println(\"ABC\");\n else System.out.println(\"ARC\");\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "sample_input": "ABC\n"}, "reference_outputs": ["ARC\n"], "source_document_id": "p02687", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 287, "cpu_time_ms": 134, "memory_kb": 35680}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s492996796", "group_id": "codeNet:p02688", "input_text": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int K = sc.nextInt();\n\n\n int[] A = new int[N];\n for (int i = 0;i < K; i++) {\n int d = sc.nextInt();\n for (int j = 0; j < d; j++) {\n int nsunuke = sc.nextInt() - 1;\n A[nsunuke] = 1;\n }\n }\n\n int count = 0;\n for (int i = 0;i < N; i++) {\n if(A[i] != 1) {\n count++;\n }\n }\n System.out.println(count);\n }\n}", "language": "Java", "metadata": {"date": 1590951835, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02688.html", "problem_id": "p02688", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02688/input.txt", "sample_output_relpath": "derived/input_output/data/p02688/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02688/Java/s492996796.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s492996796", "user_id": "u287107526"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int K = sc.nextInt();\n\n\n int[] A = new int[N];\n for (int i = 0;i < K; i++) {\n int d = sc.nextInt();\n for (int j = 0; j < d; j++) {\n int nsunuke = sc.nextInt() - 1;\n A[nsunuke] = 1;\n }\n }\n\n int count = 0;\n for (int i = 0;i < N; i++) {\n if(A[i] != 1) {\n count++;\n }\n }\n System.out.println(count);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "sample_input": "3 2\n2\n1 3\n1\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02688", "source_text": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 621, "cpu_time_ms": 178, "memory_kb": 46340}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s238242842", "group_id": "codeNet:p02688", "input_text": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int k = Integer.parseInt(sc.next());\n int[] count = new int[n];\n \n for(int i = 0; i < k; i++){\n int d = Integer.parseInt(sc.next());\n int[] a = new int[d];\n for(int j = 0; j < d; j++){\n a[i] = Integer.parseInt(sc.next());\n count[a[i]]++;\n }\n }\n\n int ans = 0;\n for(int i = 0; i < n; i++){\n if(count[i] == 0)\n ans++;\n }\n\n System.out.println(ans);\n }\n}", "language": "Java", "metadata": {"date": 1588559115, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02688.html", "problem_id": "p02688", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02688/input.txt", "sample_output_relpath": "derived/input_output/data/p02688/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02688/Java/s238242842.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s238242842", "user_id": "u268467094"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = Integer.parseInt(sc.next());\n int k = Integer.parseInt(sc.next());\n int[] count = new int[n];\n \n for(int i = 0; i < k; i++){\n int d = Integer.parseInt(sc.next());\n int[] a = new int[d];\n for(int j = 0; j < d; j++){\n a[i] = Integer.parseInt(sc.next());\n count[a[i]]++;\n }\n }\n\n int ans = 0;\n for(int i = 0; i < n; i++){\n if(count[i] == 0)\n ans++;\n }\n\n System.out.println(ans);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "sample_input": "3 2\n2\n1 3\n1\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02688", "source_text": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 691, "cpu_time_ms": 88, "memory_kb": 26904}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s811603096", "group_id": "codeNet:p02688", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint n = scan.nextInt();\n\t\tint k = scan.nextInt();\n\t\tboolean[] human = new boolean[n];\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tint d = scan.nextInt();\n\t\t\tfor(int j = 0; j < d; j++)\n\t\t\t\thuman[scan.nextInt()-1] = true;\n\t\t}\n\t\tscan.close();\n\t\t\n\t\tint ans = 0;\n\t\tfor(boolean b : human)\n\t\t\tif(!b) ans++;\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1588554955, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02688.html", "problem_id": "p02688", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02688/input.txt", "sample_output_relpath": "derived/input_output/data/p02688/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02688/Java/s811603096.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s811603096", "user_id": "u785061386"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint n = scan.nextInt();\n\t\tint k = scan.nextInt();\n\t\tboolean[] human = new boolean[n];\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tint d = scan.nextInt();\n\t\t\tfor(int j = 0; j < d; j++)\n\t\t\t\thuman[scan.nextInt()-1] = true;\n\t\t}\n\t\tscan.close();\n\t\t\n\t\tint ans = 0;\n\t\tfor(boolean b : human)\n\t\t\tif(!b) ans++;\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "sample_input": "3 2\n2\n1 3\n1\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02688", "source_text": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 462, "cpu_time_ms": 186, "memory_kb": 46356}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s714919392", "group_id": "codeNet:p02688", "input_text": "import java.io.*;\nimport java.util.*;\nimport java.lang.*;\npublic class Main{\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n solve(in, out);\n out.close();\n }\n static int L,R,top,bottom;\n // static int ans;\n public static void solve(InputReader sc, PrintWriter pw) {\n // int t=sc.nextInt();\n int t=1;\n u:while(t-->0){\n int n=sc.nextInt();\n int k=sc.nextInt();\n boolean []arr=new boolean[n];\n for(int i=0;i n - k ) \n k = n - k; \n \n // Calculate value of [n * (n-1) *---* (n-k+1)] / [k * (k-1) *----* 1] \n for (long i = 0; i < k; ++i) \n { \n res *= (n - i); \n res /= (i + 1); \n } \n \n return res; \n } \n public static void sort(long []arr){\n ArrayList list=new ArrayList<>();\n for(int i=0;i0){\n a+=(n&1);\n n>>=1;\n }\n return a;\n }\n static class Pair{\n int a, b,c,d;\n Pair(int a,int b, int c, int d){\n this.a=a;\n this.b=b;\n this.c=c;\n this.d=d;\n }\n }\n // public int compareTo(Pair p){\n // return (b-p.b);\n // }\n // public int hashCode(){\n // int hashcode = (a+\" \"+b).hashCode();\n // return hashcode;\n // }\n \n // public boolean equals(Object obj){\n // if (obj instanceof Pair) {\n // Pair p = (Pair) obj;\n // return (p.a==this.a && p.b == this.b);\n // }\n // return false;\n // }\n \n static boolean isPrime(int n) { \n if (n <= 1) \n return false; \n if (n <= 3) \n return true; \n if (n % 2 == 0 || n % 3 == 0) \n return false; \n for (int i = 5; i * i <= n; i = i + 6) \n if (n % i == 0 || n % (i + 2) == 0) \n return false; \n return true; \n } \n static int gcd(int a, int b) { \n if (b == 0) \n return a; \n return a>b?gcd(b, a % b):gcd(a, b % a); \n } \n static long fast_pow(long base,long n,long M){\n if(n==0)\n return 1;\n if(n==1)\n return base;\n long halfn=fast_pow(base,n/2,M);\n if(n%2==0)\n return ( halfn * halfn ) % M;\n else\n return ( ( ( halfn * halfn ) % M ) * base ) % M;\n }\n static long modInverse(long n,long M){\n return fast_pow(n,M-2,M);\n }\n public static void feedArr(long []arr,InputReader sc){\n for(int i=0;i0){\n int n=sc.nextInt();\n int k=sc.nextInt();\n boolean []arr=new boolean[n];\n for(int i=0;i n - k ) \n k = n - k; \n \n // Calculate value of [n * (n-1) *---* (n-k+1)] / [k * (k-1) *----* 1] \n for (long i = 0; i < k; ++i) \n { \n res *= (n - i); \n res /= (i + 1); \n } \n \n return res; \n } \n public static void sort(long []arr){\n ArrayList list=new ArrayList<>();\n for(int i=0;i0){\n a+=(n&1);\n n>>=1;\n }\n return a;\n }\n static class Pair{\n int a, b,c,d;\n Pair(int a,int b, int c, int d){\n this.a=a;\n this.b=b;\n this.c=c;\n this.d=d;\n }\n }\n // public int compareTo(Pair p){\n // return (b-p.b);\n // }\n // public int hashCode(){\n // int hashcode = (a+\" \"+b).hashCode();\n // return hashcode;\n // }\n \n // public boolean equals(Object obj){\n // if (obj instanceof Pair) {\n // Pair p = (Pair) obj;\n // return (p.a==this.a && p.b == this.b);\n // }\n // return false;\n // }\n \n static boolean isPrime(int n) { \n if (n <= 1) \n return false; \n if (n <= 3) \n return true; \n if (n % 2 == 0 || n % 3 == 0) \n return false; \n for (int i = 5; i * i <= n; i = i + 6) \n if (n % i == 0 || n % (i + 2) == 0) \n return false; \n return true; \n } \n static int gcd(int a, int b) { \n if (b == 0) \n return a; \n return a>b?gcd(b, a % b):gcd(a, b % a); \n } \n static long fast_pow(long base,long n,long M){\n if(n==0)\n return 1;\n if(n==1)\n return base;\n long halfn=fast_pow(base,n/2,M);\n if(n%2==0)\n return ( halfn * halfn ) % M;\n else\n return ( ( ( halfn * halfn ) % M ) * base ) % M;\n }\n static long modInverse(long n,long M){\n return fast_pow(n,M-2,M);\n }\n public static void feedArr(long []arr,InputReader sc){\n for(int i=0;iH[B-1]) {\n\t\t\t\tCOUNT[A-1]=1;\n\t\t\t\tCOUNT[B-1]=2;\n\t\t\t}else if(H[A-1]==H[B-1]) {\n\t\t\t\tCOUNT[A-1]=2;\n\t\t\t\tCOUNT[B-1]=2;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0; iH[B-1]) {\n\t\t\t\tCOUNT[A-1]=1;\n\t\t\t\tCOUNT[B-1]=2;\n\t\t\t}else if(H[A-1]==H[B-1]) {\n\t\t\t\tCOUNT[A-1]=2;\n\t\t\t\tCOUNT[B-1]=2;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0; i h[i]) {\n result[max_pos] = true;\n } else if (h[max_pos] < h[i]) {\n result[i] = true;\n }\n\n }\n\n int count = 0;\n for (int i = 1; i <= n; i++) {\n if (result[i]) {\n count++;\n }\n }\n out.append(String.valueOf(count));\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1592579737, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02689.html", "problem_id": "p02689", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02689/input.txt", "sample_output_relpath": "derived/input_output/data/p02689/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02689/Java/s874487493.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s874487493", "user_id": "u745688558"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n Peaks solver = new Peaks();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class Peaks {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n\n long[] h = new long[n + 1];\n for (int i = 1; i <= n; i++) {\n h[i] = in.nextInt();\n }\n\n int[][] loads = new int[n + 1][n + 1];\n for (int i = 1; i <= m; i++) {\n int a = in.nextInt();\n int b = in.nextInt();\n\n loads[a][b] = 1;\n loads[b][a] = 1;\n }\n\n boolean[] result = new boolean[n + 1];\n for (int i = 1; i <= n; i++) {\n long max_cost = 0;\n int max_pos = 0;\n for (int j = 1; j <= n; j++) {\n if (loads[i][j] != 1) {\n continue;\n }\n if (max_cost < h[j]) {\n max_cost = h[j];\n max_pos = j;\n }\n }\n if (max_cost == 0) {\n result[i] = true;\n continue;\n }\n if (h[max_pos] > h[i]) {\n result[max_pos] = true;\n } else if (h[max_pos] < h[i]) {\n result[i] = true;\n }\n\n }\n\n int count = 0;\n for (int i = 1; i <= n; i++) {\n if (result[i]) {\n count++;\n }\n }\n out.append(String.valueOf(count));\n }\n\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "sample_input": "4 3\n1 2 3 4\n1 3\n2 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02689", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2155, "cpu_time_ms": 1283, "memory_kb": 965868}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s201769502", "group_id": "codeNet:p02689", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint[] height = new int[n];\n\t\tfor(int i=0;iheight[b-1]) count[b-1]=0;\n\t\t\telse count[a-1]=1;\n\t\t}\n\t\tint c=0;\n\t\tfor(int i=0;iheight[b-1]) count[b-1]=0;\n\t\t\telse count[a-1]=1;\n\t\t}\n\t\tint c=0;\n\t\tfor(int i=0;i= 33 && code <= 126;\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = getNextChar();\n\t\twhile (isVisibleChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = getNextChar();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean sign = true;\n\t\tint b = getNextChar();\n\t\tif (b == '-') {\n\t\t\tsign = false;\n\t\t\tb = getNextChar();\n\t\t}\n\t\tif (b < '0' || b > '9') {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isVisibleChar(b)) {\n\t\t\t\treturn sign ? n : -n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = getNextChar();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong n = nextLong();\n\t\tif (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) n;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\t\n\tpublic char nextChar() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tint b = getNextChar();\n\t\twhile (!isVisibleChar(b)) {\n\t\t\tb = getNextChar();\n\t\t}\n\t\treturn (char) b;\n\t}\n\n\tpublic void close() {\n\t\ttry {\n\t\t\tin.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n}\n\nclass IntQueue {\n\tprotected int[] a;\n\tprotected int head, tail;\n\n\tpublic IntQueue(int max) {\n\t\ta = new int[max];\n\t}\n\n\tpublic void offer(int x) {\n\t\ta[tail++] = x;\n\t}\n\n\tpublic int poll() {\n\t\treturn a[head++];\n\t}\n\n\tpublic int peek() {\n\t\treturn a[head];\n\t}\n\t\n\tpublic int size() {\n\t\treturn tail - head;\n\t}\n}\n", "language": "Java", "metadata": {"date": 1588557242, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02690.html", "problem_id": "p02690", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02690/input.txt", "sample_output_relpath": "derived/input_output/data/p02690/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02690/Java/s073537965.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s073537965", "user_id": "u123503119"}, "prompt_components": {"gold_output": "2 -1\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.NoSuchElementException;\n\nclass Main implements Runnable {\n\tprivate final FastScanner sc;\n\tprivate final PrintWriter out;\n\t//private final long MOD = 1000000007;\n\t//private final int[] d8x = {-1,0,1,1,1,0,-1,-1};\n\t//private final int[] d8y = {-1,-1,-1,0,1,1,1,0};\n\t//private final int[] d4x = {0,1,0,-1};\n\t//private final int[] d4y = {-1,0,1,0};\n\tint x;\n\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new Main(), \"\", 16L * 1024 * 1024).start();\n\t}\n\n\tMain() {\n\t\tsc = new FastScanner();\n\t\tout = new PrintWriter(System.out);\n\t}\n\n\tprivate void init() throws Exception {\n\t\tx = sc.nextInt();\n\t}\n\n\tprivate void solve() throws Exception{\n\t\tfirst:for(int a=0;a<10000;a++){\n\t\t\tfor(int b=0;b<10000;b++){\n\t\t\t\tif(a*a*a*a*a-b*b*b*b*b==x) {\n\t\t\t\t\tout.printf(\"%d %d\",a,b);\n\t\t\t\t\tbreak first;\n\t\t\t\t}\n\t\t\t\tif(a*a*a*a*a+b*b*b*b*b==x){\n\t\t\t\t\tout.printf(\"%d %d\", a,-b);\n\t\t\t\t\tbreak first;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(a==99){\n\t\t\t\tSystem.exit(1);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic void run() {\n\t\ttry {\n\t\t\tinit();\n\t\t\tsc.close();\n\t\t\tsolve();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t\tout.flush();\n\t\tout.close();\n\t}\n\t\n\t@SuppressWarnings(\"unused\")\n\tprivate void exit(){\n\t\tout.flush();\n\t\tout.close();\n\t\tSystem.exit(0);\n\t}\n}\n\nclass Data {\n}\n\nclass MyMath{\n\tpublic static int floor(double a){\n\t\tBigDecimal ans = new BigDecimal(String.format(\"%.6f\", a));\n\t\treturn ans.setScale(0, RoundingMode.FLOOR).intValue();\n\t}\n\tpublic static int ceil(double a){\n\t\tBigDecimal ans = new BigDecimal(String.format(\"%.6f\", a));\n\t\treturn ans.setScale(0, RoundingMode.CEILING).intValue();\n\t}\n}\n\nclass ExIntVector {\n\tprivate int[] a;\n\tprivate int cnt;\n\tpublic ExIntVector(int max){\n\t\ta = new int[max];\n\t\tcnt = 0;\n\t}\n\tpublic int size(){\n\t\treturn cnt;\n\t}\n\tpublic void add(int x){\n\t\ta[cnt++] = x;\n\t}\n\tpublic int get(int i){\n\t\treturn a[i];\n\t}\n\tpublic int getLast(){\n\t\treturn a[cnt-1];\n\t}\n\tpublic int[] toArray(){\n\t\treturn a;\n\t}\n}\n\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean read() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tprivate boolean hasNext() {\n\t\twhile (read() && !isVisibleChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn read();\n\t}\n\n\tprivate int getNextChar() {\n\t\tif (read()) {\n\t\t\tptr++;\n\t\t\treturn buffer[ptr - 1];\n\t\t} else {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tprivate static boolean isVisibleChar(int code) {\n\t\treturn code >= 33 && code <= 126;\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = getNextChar();\n\t\twhile (isVisibleChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = getNextChar();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean sign = true;\n\t\tint b = getNextChar();\n\t\tif (b == '-') {\n\t\t\tsign = false;\n\t\t\tb = getNextChar();\n\t\t}\n\t\tif (b < '0' || b > '9') {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif (b >= '0' && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isVisibleChar(b)) {\n\t\t\t\treturn sign ? n : -n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = getNextChar();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong n = nextLong();\n\t\tif (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) n;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\t\n\tpublic char nextChar() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tint b = getNextChar();\n\t\twhile (!isVisibleChar(b)) {\n\t\t\tb = getNextChar();\n\t\t}\n\t\treturn (char) b;\n\t}\n\n\tpublic void close() {\n\t\ttry {\n\t\t\tin.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n}\n\nclass IntQueue {\n\tprotected int[] a;\n\tprotected int head, tail;\n\n\tpublic IntQueue(int max) {\n\t\ta = new int[max];\n\t}\n\n\tpublic void offer(int x) {\n\t\ta[tail++] = x;\n\t}\n\n\tpublic int poll() {\n\t\treturn a[head++];\n\t}\n\n\tpublic int peek() {\n\t\treturn a[head];\n\t}\n\t\n\tpublic int size() {\n\t\treturn tail - head;\n\t}\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGive a pair of integers (A, B) such that A^5-B^5 = X.\nIt is guaranteed that there exists such a pair for the given integer X.\n\nConstraints\n\n1 \\leq X \\leq 10^9\n\nX is an integer.\n\nThere exists a pair of integers (A, B) satisfying the condition in Problem Statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint A and B, with space in between.\nIf there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.\n\nA B\n\nSample Input 1\n\n33\n\nSample Output 1\n\n2 -1\n\nFor A=2 and B=-1, A^5-B^5 = 33.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0 -1", "sample_input": "33\n"}, "reference_outputs": ["2 -1\n"], "source_document_id": "p02690", "source_text": "Score : 400 points\n\nProblem Statement\n\nGive a pair of integers (A, B) such that A^5-B^5 = X.\nIt is guaranteed that there exists such a pair for the given integer X.\n\nConstraints\n\n1 \\leq X \\leq 10^9\n\nX is an integer.\n\nThere exists a pair of integers (A, B) satisfying the condition in Problem Statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint A and B, with space in between.\nIf there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.\n\nA B\n\nSample Input 1\n\n33\n\nSample Output 1\n\n2 -1\n\nFor A=2 and B=-1, A^5-B^5 = 33.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0 -1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4431, "cpu_time_ms": 89, "memory_kb": 34284}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s889849420", "group_id": "codeNet:p02691", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.StringTokenizer;\n\n\n\npublic class Main\n{\t\n\t\n\tstatic class Pair implements Comparable\n\t{\n\t\tint x;\n\t\tint y;\n\t\tint type;\n\t\tPair(int x,int y,int type)\n\t\t{\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t\tthis.type = type;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic int compareTo(Pair o)\n\t\t{\n\t\t\tif(x != o.x)\n\t\t\t{\t\n\t\t\t\tif(x < o.x)\n\t\t\t\treturn -1;\n\t\t\t\t\n\t\t\t\telse return 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\t\n\t\t\t\tif(y < o.y)\n\t\t\t\treturn -1;\n\t\t\t\t\n\t\t\t\telse return 1;\n\t\t\t}\n\t\t}\n\t}\n\t \n\tstatic class FastReader \n\t{ \n\t BufferedReader br; \n\t StringTokenizer st; \n\n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\n\t String next() \n\t { \n\t while (st == null || !st.hasMoreElements()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken(); \n\t } \n\n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t } \n\t}\n\n\tstatic int maxN = 2000000;\n\tstatic int fact[] = new int[maxN+1];\n\tstatic int factorialNumInverse[] = new int[maxN+1];\n\tstatic int naturalNumInverse[] = new int[maxN+1];\n\t\n\tstatic void InverseofNumber() \n\t{ \t\n\t\tint p = mod;\n\t naturalNumInverse[0] = naturalNumInverse[1] = 1; \n\t for (int i = 2; i <= maxN; i++) \n\t naturalNumInverse[i] = (int)((1L *naturalNumInverse[p % i] * (p - p / i))%p); \n\t}\n\t\n\tstatic void InverseofFactorial() \n\t{ \t\n\t\tint p = mod;\n\t factorialNumInverse[0] = factorialNumInverse[1] = 1; \n\t \n\t for (int i = 2; i <= maxN; i++) \n\t factorialNumInverse[i] = (int)((1L*naturalNumInverse[i] * factorialNumInverse[i - 1]) % p); \n\t} \n\t\n\tstatic void Factorial()\n\t{\n\t\t\n\t\tfact[0] = 1;\n\t\tfor(int i = 1; i < maxN; i++) \n\t\t{\n\t\t\tfact[i] = (int)(1L *fact[i - 1] * i % mod);\n\t\t}\n\t}\n\t\n\tstatic int Binomial(int N, int R) \n\t{ \n\t int p = mod;\n\t int ans = (int)((1L *(1L*fact[N] * factorialNumInverse[R]) % p * factorialNumInverse[(N - R)]) % p); \n\t return ans; \n\t} \n\tstatic int paths(int x1,int y1,int x2,int y2)\n\t{\t\n\t\tint x = Math.abs(x2-x1);\n\t\tint y = Math.abs(y2-y1);\n\t\t\n\t\tint N = x+y;\n\t\tint R = x;\n\t\t\n\t\tint ans = Binomial(N,R);\n\t\treturn ans;\n\t}\n\t\n\tstatic int mod = 998244353;\n\t\n\t// a b c d e f g h i j k\n\t// 0 1 0 1 0 1 0 1 0 1 0\n\t\n\t\n\t\n\t\n\tpublic static void main(String[] args) \n\t{\n\t\tOutputStream outputStream = System.out;\n\t\tFastReader sc = new FastReader();\n PrintWriter out = new PrintWriter(outputStream);\n \n \n int n = sc.nextInt();\n long a[] = new long[n];\n \n for(int i = 0; i < n; i++)\n {\n \ta[i] = sc.nextLong();\n }\n HashMap hm = new HashMap<>();\n \n long ans = 0;\n for(int i = 0; i < n; i++)\n {\n \tif(hm.containsKey(i-a[i]))\n \t{\n \t\tans += hm.get(i-a[i]);\n \t}\n \t\n \thm.put(i+a[i],hm.getOrDefault(i+a[i],0L)+1L);\n }\n \n out.println(ans);\n out.close();\n \n\n\t}\n \n}", "language": "Java", "metadata": {"date": 1588557559, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02691.html", "problem_id": "p02691", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02691/input.txt", "sample_output_relpath": "derived/input_output/data/p02691/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02691/Java/s889849420.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s889849420", "user_id": "u557997322"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.StringTokenizer;\n\n\n\npublic class Main\n{\t\n\t\n\tstatic class Pair implements Comparable\n\t{\n\t\tint x;\n\t\tint y;\n\t\tint type;\n\t\tPair(int x,int y,int type)\n\t\t{\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t\tthis.type = type;\n\t\t}\n\t\t\n\t\t@Override\n\t\tpublic int compareTo(Pair o)\n\t\t{\n\t\t\tif(x != o.x)\n\t\t\t{\t\n\t\t\t\tif(x < o.x)\n\t\t\t\treturn -1;\n\t\t\t\t\n\t\t\t\telse return 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\t\n\t\t\t\tif(y < o.y)\n\t\t\t\treturn -1;\n\t\t\t\t\n\t\t\t\telse return 1;\n\t\t\t}\n\t\t}\n\t}\n\t \n\tstatic class FastReader \n\t{ \n\t BufferedReader br; \n\t StringTokenizer st; \n\n\t public FastReader() \n\t { \n\t br = new BufferedReader(new\n\t InputStreamReader(System.in)); \n\t } \n\n\t String next() \n\t { \n\t while (st == null || !st.hasMoreElements()) \n\t { \n\t try\n\t { \n\t st = new StringTokenizer(br.readLine()); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t } \n\t return st.nextToken(); \n\t } \n\n\t int nextInt() \n\t { \n\t return Integer.parseInt(next()); \n\t } \n\n\t long nextLong() \n\t { \n\t return Long.parseLong(next()); \n\t } \n\n\t double nextDouble() \n\t { \n\t return Double.parseDouble(next()); \n\t } \n\n\t String nextLine() \n\t { \n\t String str = \"\"; \n\t try\n\t { \n\t str = br.readLine(); \n\t } \n\t catch (IOException e) \n\t { \n\t e.printStackTrace(); \n\t } \n\t return str; \n\t } \n\t}\n\n\tstatic int maxN = 2000000;\n\tstatic int fact[] = new int[maxN+1];\n\tstatic int factorialNumInverse[] = new int[maxN+1];\n\tstatic int naturalNumInverse[] = new int[maxN+1];\n\t\n\tstatic void InverseofNumber() \n\t{ \t\n\t\tint p = mod;\n\t naturalNumInverse[0] = naturalNumInverse[1] = 1; \n\t for (int i = 2; i <= maxN; i++) \n\t naturalNumInverse[i] = (int)((1L *naturalNumInverse[p % i] * (p - p / i))%p); \n\t}\n\t\n\tstatic void InverseofFactorial() \n\t{ \t\n\t\tint p = mod;\n\t factorialNumInverse[0] = factorialNumInverse[1] = 1; \n\t \n\t for (int i = 2; i <= maxN; i++) \n\t factorialNumInverse[i] = (int)((1L*naturalNumInverse[i] * factorialNumInverse[i - 1]) % p); \n\t} \n\t\n\tstatic void Factorial()\n\t{\n\t\t\n\t\tfact[0] = 1;\n\t\tfor(int i = 1; i < maxN; i++) \n\t\t{\n\t\t\tfact[i] = (int)(1L *fact[i - 1] * i % mod);\n\t\t}\n\t}\n\t\n\tstatic int Binomial(int N, int R) \n\t{ \n\t int p = mod;\n\t int ans = (int)((1L *(1L*fact[N] * factorialNumInverse[R]) % p * factorialNumInverse[(N - R)]) % p); \n\t return ans; \n\t} \n\tstatic int paths(int x1,int y1,int x2,int y2)\n\t{\t\n\t\tint x = Math.abs(x2-x1);\n\t\tint y = Math.abs(y2-y1);\n\t\t\n\t\tint N = x+y;\n\t\tint R = x;\n\t\t\n\t\tint ans = Binomial(N,R);\n\t\treturn ans;\n\t}\n\t\n\tstatic int mod = 998244353;\n\t\n\t// a b c d e f g h i j k\n\t// 0 1 0 1 0 1 0 1 0 1 0\n\t\n\t\n\t\n\t\n\tpublic static void main(String[] args) \n\t{\n\t\tOutputStream outputStream = System.out;\n\t\tFastReader sc = new FastReader();\n PrintWriter out = new PrintWriter(outputStream);\n \n \n int n = sc.nextInt();\n long a[] = new long[n];\n \n for(int i = 0; i < n; i++)\n {\n \ta[i] = sc.nextLong();\n }\n HashMap hm = new HashMap<>();\n \n long ans = 0;\n for(int i = 0; i < n; i++)\n {\n \tif(hm.containsKey(i-a[i]))\n \t{\n \t\tans += hm.get(i-a[i]);\n \t}\n \t\n \thm.put(i+a[i],hm.getOrDefault(i+a[i],0L)+1L);\n }\n \n out.println(ans);\n out.close();\n \n\n\t}\n \n}", "problem_context": "Score: 500 points\n\nProblem Statement\n\nYou are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.\n\nThere are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i.\n\nAccording to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction.\n\nThe absolute difference of their attendee numbers is equal to the sum of their heights.\n\nThere are \\frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above?\n\nP.S.: We cannot let you know the secret.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the number of pairs satisfying the condition.\n\nSample Input 1\n\n6\n2 3 3 1 3 1\n\nSample Output 1\n\n3\n\nA_1 + A_4 = 3, so the pair of Attendee 1 and 4 satisfy the condition.\n\nA_2 + A_6 = 4, so the pair of Attendee 2 and 6 satisfy the condition.\n\nA_4 + A_6 = 2, so the pair of Attendee 4 and 6 satisfy the condition.\n\nNo other pair satisfies the condition, so you should print 3.\n\nSample Input 2\n\n6\n5 2 4 2 8 8\n\nSample Output 2\n\n0\n\nNo pair satisfies the condition, so you should print 0.\n\nSample Input 3\n\n32\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5\n\nSample Output 3\n\n22", "sample_input": "6\n2 3 3 1 3 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02691", "source_text": "Score: 500 points\n\nProblem Statement\n\nYou are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.\n\nThere are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i.\n\nAccording to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction.\n\nThe absolute difference of their attendee numbers is equal to the sum of their heights.\n\nThere are \\frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above?\n\nP.S.: We cannot let you know the secret.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the number of pairs satisfying the condition.\n\nSample Input 1\n\n6\n2 3 3 1 3 1\n\nSample Output 1\n\n3\n\nA_1 + A_4 = 3, so the pair of Attendee 1 and 4 satisfy the condition.\n\nA_2 + A_6 = 4, so the pair of Attendee 2 and 6 satisfy the condition.\n\nA_4 + A_6 = 2, so the pair of Attendee 4 and 6 satisfy the condition.\n\nNo other pair satisfies the condition, so you should print 3.\n\nSample Input 2\n\n6\n5 2 4 2 8 8\n\nSample Output 2\n\n0\n\nNo pair satisfies the condition, so you should print 0.\n\nSample Input 3\n\n32\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5\n\nSample Output 3\n\n22", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3776, "cpu_time_ms": 401, "memory_kb": 91644}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s896711455", "group_id": "codeNet:p02694", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.InputMismatchException;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputReader in = new InputReader(System.in);\n\n long x = in.nextLong();\n\n long p = 100;\n long years = 0;\n while (p < x) {\n p += p/100;\n years++;\n }\n System.out.println(years);\n }\n\n static class InputReader {\n\n private final InputStream stream;\n private final byte[] buf = new byte[8192];\n private int curChar, snumChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int snext() {\n if (snumChars == -1) throw new InputMismatchException();\n if (curChar >= snumChars) {\n curChar = 0;\n try {\n snumChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (snumChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = snext();\n while (isSpaceChar(c)) {\n c = snext();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = snext();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long nextLong() {\n int c = snext();\n while (isSpaceChar(c)) {\n c = snext();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = snext();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public int[] nextIntArray(int n) {\n int a[] = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n public String readString() {\n int c = snext();\n while (isSpaceChar(c)) {\n c = snext();\n }\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = snext();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public String nextLine() {\n int c = snext();\n while (isSpaceChar(c)) c = snext();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = snext();\n } while (!isEndOfLine(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n private boolean isEndOfLine(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1589150498, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02694.html", "problem_id": "p02694", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02694/input.txt", "sample_output_relpath": "derived/input_output/data/p02694/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02694/Java/s896711455.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s896711455", "user_id": "u080408968"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.InputMismatchException;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputReader in = new InputReader(System.in);\n\n long x = in.nextLong();\n\n long p = 100;\n long years = 0;\n while (p < x) {\n p += p/100;\n years++;\n }\n System.out.println(years);\n }\n\n static class InputReader {\n\n private final InputStream stream;\n private final byte[] buf = new byte[8192];\n private int curChar, snumChars;\n private SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int snext() {\n if (snumChars == -1) throw new InputMismatchException();\n if (curChar >= snumChars) {\n curChar = 0;\n try {\n snumChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (snumChars <= 0) return -1;\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = snext();\n while (isSpaceChar(c)) {\n c = snext();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = snext();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long nextLong() {\n int c = snext();\n while (isSpaceChar(c)) {\n c = snext();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = snext();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = snext();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public int[] nextIntArray(int n) {\n int a[] = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n public String readString() {\n int c = snext();\n while (isSpaceChar(c)) {\n c = snext();\n }\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = snext();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public String nextLine() {\n int c = snext();\n while (isSpaceChar(c)) c = snext();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = snext();\n } while (!isEndOfLine(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n private boolean isEndOfLine(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "sample_input": "103\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02694", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2960, "cpu_time_ms": 71, "memory_kb": 32384}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s801986933", "group_id": "codeNet:p02695", "input_text": "\n\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic long maxScore = 0;\n\tstatic int N, M, Q;\n\tstatic int a[], b[], c[], d[];\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tN = scan.nextInt();\n\t\tM = scan.nextInt();\n\t\tQ = scan.nextInt();\n\n\t\ta = new int[Q + 1];\n\t\tb = new int[Q + 1];\n\t\tc = new int[Q + 1];\n\t\td = new int[Q + 1];\n\n\t\tList A = new ArrayList();\n\n\t\tfor (int i = 1; i <= Q; i++) {\n\t\t\ta[i] = scan.nextInt();\n\t\t\tb[i] = scan.nextInt();\n\t\t\tc[i] = scan.nextInt();\n\t\t\td[i] = scan.nextInt();\n\t\t}\n\n\t\t//dfsでAを作成しながら得点を求める\n\t\tdfs(A, N, M);\n\t\tSystem.out.println(maxScore);\n\n\t}\n\n\tpublic static void dfs(List A, int maxLength, int MaxValue) {\n\t\tif (A.size() == maxLength) {\n\t\t\tcalcScore(A);\n\t\t\treturn;\n\t\t}\n\n\t\tA.add(A.size(), 1);\n\n\t\twhile (A.get(A.size() - 1) <= MaxValue) {\n\t\t\tdfs(A, maxLength, MaxValue);\n\n\t\t\tint tmp = A.get(A.size() - 1) + 1;\n\t\t\tA.add(A.size() - 1, tmp);\n\n\t\t}\n\t}\n\n\tpublic static void calcScore(List A) {\n\t\t//スコアを計算\n\t\tlong score = 0;\n\t\tfor (int i = 1; i <= Q; i++) {\n\t\t\tif (A.get(b[i] - 1) - A.get(a[i] - 1) == c[i]) {\n\t\t\t\tscore += d[i];\n\t\t\t}\n\n\t\t}\n\n\t\tif (score > maxScore) {\n\t\t\tmaxScore = score;\n\t\t}\n\t}\n\n\t/**\n\t * 文字列を反転して返す\n\t * @param pStr 文字列\n\t * @return 反転した文字列\n\t */\n\tpublic static String myReverse(String pStr) {\n\t\tif (pStr.length() < 1) {\n\t\t\treturn \"\";\n\t\t}\n\n\t\tStringBuffer sb = new StringBuffer(pStr);\n\t\treturn sb.reverse().toString();\n\t}\n\n\t/**\n\t * 余りを求める。\n\t * @param a\n\t * @param b\n\t * @return 余り。余りがマイナスの時はプラスで返す。\n\t */\n\tpublic static long myMod(long a, long b) {\n\t\tlong ret = 0;\n\n\t\tret = a % b;\n\n\t\tif (ret < 0) {\n\t\t\tret += b;\n\t\t}\n\n\t\treturn ret;\n\t}\n\n\t/**\n\t * 乗数を求める ※mod対応\n\t * @param kisu 基数\n\t * @param josu 乗数\n\t * @param primeNumMod_0 法 mod値 使わない場合は「0」\n\t * @return\n\t */\n\tpublic static long myPowWithMod(long kisu, long josu, long primeNumMod_0) {\n\n\t\tlong ans = 1;\n\n\t\t//乗数が0の場合→1\n\t\tif (josu == 0)\n\t\t\treturn 1;\n\n\t\tif (primeNumMod_0 == 0) {\n\t\t\t//modを使わないとき\n\n\t\t\twhile (josu > 0) {\n\n\t\t\t\tif (josu % 2 == 0) {\n\t\t\t\t\t//累乗が偶数の時\n\n\t\t\t\t\tkisu *= kisu;\n\t\t\t\t\tjosu = josu / 2;\n\t\t\t\t} else {\n\t\t\t\t\t//累乗が奇数の時\n\t\t\t\t\tans *= kisu;\n\t\t\t\t\tjosu--;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn ans;\n\n\t\t} else {\n\t\t\t//modを使うとき\n\n\t\t\t//初めに桁を落とす\n\t\t\tkisu = myMod(kisu, primeNumMod_0);\n\n\t\t\twhile (josu > 0) {\n\n\t\t\t\tif (josu % 2 == 0) {\n\t\t\t\t\t//累乗が偶数の時\n\n\t\t\t\t\tkisu *= myMod(kisu, primeNumMod_0);\n\t\t\t\t\tjosu = josu / 2;\n\n\t\t\t\t} else {\n\t\t\t\t\t//累乗が奇数の時\n\t\t\t\t\tans *= myMod(kisu, primeNumMod_0);\n\t\t\t\t\tjosu--;\n\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn myMod(ans, primeNumMod_0);\n\n\t\t}\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1588483109, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02695.html", "problem_id": "p02695", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02695/input.txt", "sample_output_relpath": "derived/input_output/data/p02695/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02695/Java/s801986933.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s801986933", "user_id": "u345023394"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "\n\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic long maxScore = 0;\n\tstatic int N, M, Q;\n\tstatic int a[], b[], c[], d[];\n\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tN = scan.nextInt();\n\t\tM = scan.nextInt();\n\t\tQ = scan.nextInt();\n\n\t\ta = new int[Q + 1];\n\t\tb = new int[Q + 1];\n\t\tc = new int[Q + 1];\n\t\td = new int[Q + 1];\n\n\t\tList A = new ArrayList();\n\n\t\tfor (int i = 1; i <= Q; i++) {\n\t\t\ta[i] = scan.nextInt();\n\t\t\tb[i] = scan.nextInt();\n\t\t\tc[i] = scan.nextInt();\n\t\t\td[i] = scan.nextInt();\n\t\t}\n\n\t\t//dfsでAを作成しながら得点を求める\n\t\tdfs(A, N, M);\n\t\tSystem.out.println(maxScore);\n\n\t}\n\n\tpublic static void dfs(List A, int maxLength, int MaxValue) {\n\t\tif (A.size() == maxLength) {\n\t\t\tcalcScore(A);\n\t\t\treturn;\n\t\t}\n\n\t\tA.add(A.size(), 1);\n\n\t\twhile (A.get(A.size() - 1) <= MaxValue) {\n\t\t\tdfs(A, maxLength, MaxValue);\n\n\t\t\tint tmp = A.get(A.size() - 1) + 1;\n\t\t\tA.add(A.size() - 1, tmp);\n\n\t\t}\n\t}\n\n\tpublic static void calcScore(List A) {\n\t\t//スコアを計算\n\t\tlong score = 0;\n\t\tfor (int i = 1; i <= Q; i++) {\n\t\t\tif (A.get(b[i] - 1) - A.get(a[i] - 1) == c[i]) {\n\t\t\t\tscore += d[i];\n\t\t\t}\n\n\t\t}\n\n\t\tif (score > maxScore) {\n\t\t\tmaxScore = score;\n\t\t}\n\t}\n\n\t/**\n\t * 文字列を反転して返す\n\t * @param pStr 文字列\n\t * @return 反転した文字列\n\t */\n\tpublic static String myReverse(String pStr) {\n\t\tif (pStr.length() < 1) {\n\t\t\treturn \"\";\n\t\t}\n\n\t\tStringBuffer sb = new StringBuffer(pStr);\n\t\treturn sb.reverse().toString();\n\t}\n\n\t/**\n\t * 余りを求める。\n\t * @param a\n\t * @param b\n\t * @return 余り。余りがマイナスの時はプラスで返す。\n\t */\n\tpublic static long myMod(long a, long b) {\n\t\tlong ret = 0;\n\n\t\tret = a % b;\n\n\t\tif (ret < 0) {\n\t\t\tret += b;\n\t\t}\n\n\t\treturn ret;\n\t}\n\n\t/**\n\t * 乗数を求める ※mod対応\n\t * @param kisu 基数\n\t * @param josu 乗数\n\t * @param primeNumMod_0 法 mod値 使わない場合は「0」\n\t * @return\n\t */\n\tpublic static long myPowWithMod(long kisu, long josu, long primeNumMod_0) {\n\n\t\tlong ans = 1;\n\n\t\t//乗数が0の場合→1\n\t\tif (josu == 0)\n\t\t\treturn 1;\n\n\t\tif (primeNumMod_0 == 0) {\n\t\t\t//modを使わないとき\n\n\t\t\twhile (josu > 0) {\n\n\t\t\t\tif (josu % 2 == 0) {\n\t\t\t\t\t//累乗が偶数の時\n\n\t\t\t\t\tkisu *= kisu;\n\t\t\t\t\tjosu = josu / 2;\n\t\t\t\t} else {\n\t\t\t\t\t//累乗が奇数の時\n\t\t\t\t\tans *= kisu;\n\t\t\t\t\tjosu--;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn ans;\n\n\t\t} else {\n\t\t\t//modを使うとき\n\n\t\t\t//初めに桁を落とす\n\t\t\tkisu = myMod(kisu, primeNumMod_0);\n\n\t\t\twhile (josu > 0) {\n\n\t\t\t\tif (josu % 2 == 0) {\n\t\t\t\t\t//累乗が偶数の時\n\n\t\t\t\t\tkisu *= myMod(kisu, primeNumMod_0);\n\t\t\t\t\tjosu = josu / 2;\n\n\t\t\t\t} else {\n\t\t\t\t\t//累乗が奇数の時\n\t\t\t\t\tans *= myMod(kisu, primeNumMod_0);\n\t\t\t\t\tjosu--;\n\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn myMod(ans, primeNumMod_0);\n\n\t\t}\n\n\t}\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "sample_input": "3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n"}, "reference_outputs": ["110\n"], "source_document_id": "p02695", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2959, "cpu_time_ms": 2293, "memory_kb": 2832248}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s012555676", "group_id": "codeNet:p02695", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte(){\n if(ptr < buflen){\n return true;\n }else{\n ptr = 0;\n try{\n buflen = in.read(buffer);\n }catch(IOException e){\n e.printStackTrace();\n }\n if(buflen <=0){\n return false;\n }\n }\n return true;\n }\n\n private int readByte(){\n if(hasNextByte())return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c){\n return 33<=c && c<=126;\n }\n public boolean hasNext(){\n while(hasNextByte() && !isPrintableChar(buffer[ptr]))ptr++;\n return hasNextByte();\n }\n\n public String next(){\n if(!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong(){\n if(!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n if(b < '0' || '9' < b){\n throw new NumberFormatException();\n }\n while(true){\n if('0' <= b && b<='9'){\n n*=10;\n n+=b-'0';\n }else if(b==-1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt(){\n long nl = nextLong();\n if(nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDoutble(){return Double.parseDouble(next());}\n}\npublic class Main {\n static int n,m,q;\n static ABCD[] array;\n static int max;\n static int[] A;\n public static void main(String[] args) {\n \n FastScanner fs = new FastScanner();\n n = fs.nextInt();\n m = fs.nextInt();\n q = fs.nextInt();\n array = new ABCD[q];\n max = 0;\n A = new int[n];\n for(int i=0;i Integer.MAX_VALUE)throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDoutble(){return Double.parseDouble(next());}\n}\npublic class Main {\n static int n,m,q;\n static ABCD[] array;\n static int max;\n static int[] A;\n public static void main(String[] args) {\n \n FastScanner fs = new FastScanner();\n n = fs.nextInt();\n m = fs.nextInt();\n q = fs.nextInt();\n array = new ABCD[q];\n max = 0;\n A = new int[n];\n for(int i=0;i= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void println(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1588471848, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02697.html", "problem_id": "p02697", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02697/input.txt", "sample_output_relpath": "derived/input_output/data/p02697/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02697/Java/s298592064.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s298592064", "user_id": "u455009655"}, "prompt_components": {"gold_output": "2 3\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Nikita Mikhailov\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n ERotationMatching solver = new ERotationMatching();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class ERotationMatching {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int m = in.readInt();\n\n int l = 1;\n int r = n;\n\n int[] L = new int[m];\n int[] R = new int[m];\n\n for (int i = 0; i < m; i++) {\n L[i] = i;\n }\n for (int i = 0; i < m; i++) {\n R[m - i - 1] = m + i;\n }\n\n for (int i = 0; i < m; i++) {\n int a = L[i] + 1;\n int b = R[i] + 1;\n\n out.println(a + \" \" + b);\n }\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n private int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void print(Object... objects) {\n for (int i = 0; i < objects.length; i++) {\n if (i != 0) {\n writer.print(' ');\n }\n writer.print(objects[i]);\n }\n }\n\n public void println(Object... objects) {\n print(objects);\n writer.println();\n }\n\n public void close() {\n writer.close();\n }\n\n }\n}\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "sample_input": "4 1\n"}, "reference_outputs": ["2 3\n"], "source_document_id": "p02697", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4155, "cpu_time_ms": 225, "memory_kb": 45348}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s623232151", "group_id": "codeNet:p02698", "input_text": "import java.util.*;\nimport java.util.stream.*;\nimport java.io.*;\n\nclass Ele {\n int ori;\n int idx;\n\n Ele(int ori, int idx){\n this.ori = ori;\n this.idx = idx;\n }\n}\n\nclass Graph {\n public ArrayList< ArrayList > adjacency;\n\n Graph(int n){\n adjacency = new ArrayList< ArrayList >();\n for(int i = 0; i < n; i++){\n adjacency.add(new ArrayList());\n }\n }\n\n public void add_edge(int from, int to, boolean is_directed){\n adjacency.get(from).add(to);\n if(!is_directed){\n adjacency.get(to).add(from);\n }\n }\n}\n\n\npublic class Main {\n \n static final int INF = 1000000001;\n\n static int n;\n static int[] a, lis, ans;\n static boolean[] seen;\n\n static Deque st = new ArrayDeque<>();\n\n static Graph g;\n \n public static void main(String[] args) throws Exception {\n \n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n String[] in = br.readLine().split(\" \");\n n = Integer.parseInt(in[0]);\n\n g = new Graph(n);\n\n in = br.readLine().split(\" \");\n a = Stream.of(in).mapToInt(Integer::parseInt).toArray();\n\n for(int i = 0; i < n-1; i++){\n in = br.readLine().split(\" \");\n g.add_edge(Integer.parseInt(in[0]) - 1, Integer.parseInt(in[1]) - 1, false);\n }\n\n br.close();\n\n lis = new int[n+1];\n ans = new int[n];\n seen = new boolean[n];\n\n Arrays.fill(lis, INF);\n lis[0] = -INF;\n\n dfs(0, 0);\n\n PrintWriter out = new PrintWriter(System.out);\n\n for(int i = 0; i < n; i++){\n out.println(ans[i]);\n }\n out.flush();\n }\n\n static int binarySearch(int x, int maxIdx){\n int left = 0; int right = maxIdx + 1;\n while(right - left > 1){\n int mid = (right + left) / 2;\n if(lis[mid] < x) left = mid;\n else right = mid;\n }\n st.push(new Ele(lis[right], right));\n lis[right] = x;\n \n return right;\n }\n\n static void dfs(int now, int idx){\n \n idx = Math.max(idx, binarySearch(a[now], idx));\n\n ans[now] = idx;\n seen[now] = true;\n\n for(int nex : g.adjacency.get(now)){\n if(seen[nex]) continue;\n dfs(nex, idx);\n }\n\n Ele forRet = st.poll();\n lis[forRet.idx] = forRet.ori;\n \n return;\n }\n\n}", "language": "Java", "metadata": {"date": 1588537521, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02698.html", "problem_id": "p02698", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02698/input.txt", "sample_output_relpath": "derived/input_output/data/p02698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02698/Java/s623232151.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s623232151", "user_id": "u756514276"}, "prompt_components": {"gold_output": "1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n", "input_to_evaluate": "import java.util.*;\nimport java.util.stream.*;\nimport java.io.*;\n\nclass Ele {\n int ori;\n int idx;\n\n Ele(int ori, int idx){\n this.ori = ori;\n this.idx = idx;\n }\n}\n\nclass Graph {\n public ArrayList< ArrayList > adjacency;\n\n Graph(int n){\n adjacency = new ArrayList< ArrayList >();\n for(int i = 0; i < n; i++){\n adjacency.add(new ArrayList());\n }\n }\n\n public void add_edge(int from, int to, boolean is_directed){\n adjacency.get(from).add(to);\n if(!is_directed){\n adjacency.get(to).add(from);\n }\n }\n}\n\n\npublic class Main {\n \n static final int INF = 1000000001;\n\n static int n;\n static int[] a, lis, ans;\n static boolean[] seen;\n\n static Deque st = new ArrayDeque<>();\n\n static Graph g;\n \n public static void main(String[] args) throws Exception {\n \n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n String[] in = br.readLine().split(\" \");\n n = Integer.parseInt(in[0]);\n\n g = new Graph(n);\n\n in = br.readLine().split(\" \");\n a = Stream.of(in).mapToInt(Integer::parseInt).toArray();\n\n for(int i = 0; i < n-1; i++){\n in = br.readLine().split(\" \");\n g.add_edge(Integer.parseInt(in[0]) - 1, Integer.parseInt(in[1]) - 1, false);\n }\n\n br.close();\n\n lis = new int[n+1];\n ans = new int[n];\n seen = new boolean[n];\n\n Arrays.fill(lis, INF);\n lis[0] = -INF;\n\n dfs(0, 0);\n\n PrintWriter out = new PrintWriter(System.out);\n\n for(int i = 0; i < n; i++){\n out.println(ans[i]);\n }\n out.flush();\n }\n\n static int binarySearch(int x, int maxIdx){\n int left = 0; int right = maxIdx + 1;\n while(right - left > 1){\n int mid = (right + left) / 2;\n if(lis[mid] < x) left = mid;\n else right = mid;\n }\n st.push(new Ele(lis[right], right));\n lis[right] = x;\n \n return right;\n }\n\n static void dfs(int now, int idx){\n \n idx = Math.max(idx, binarySearch(a[now], idx));\n\n ans[now] = idx;\n seen[now] = true;\n\n for(int nex : g.adjacency.get(now)){\n if(seen[nex]) continue;\n dfs(nex, idx);\n }\n\n Ele forRet = st.poll();\n lis[forRet.idx] = forRet.ori;\n \n return;\n }\n\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices, whose i-th edge connects Vertex u_i and Vertex v_i.\nVertex i has an integer a_i written on it.\nFor every integer k from 1 through N, solve the following problem:\n\nWe will make a sequence by lining up the integers written on the vertices along the shortest path from Vertex 1 to Vertex k, in the order they appear. Find the length of the longest increasing subsequence of this sequence.\n\nHere, the longest increasing subsequence of a sequence A of length L is the subsequence A_{i_1} , A_{i_2} , ... , A_{i_M} with the greatest possible value of M such that 1 \\leq i_1 < i_2 < ... < i_M \\leq L and A_{i_1} < A_{i_2} < ... < A_{i_M}.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq a_i \\leq 10^9\n\n1 \\leq u_i , v_i \\leq N\n\nu_i \\neq v_i\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint N lines. The k-th line, print the length of the longest increasing subsequence of the sequence obtained from the shortest path from Vertex 1 to Vertex k.\n\nSample Input 1\n\n10\n1 2 5 3 4 6 7 3 2 4\n1 2\n2 3\n3 4\n4 5\n3 6\n6 7\n1 8\n8 9\n9 10\n\nSample Output 1\n\n1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n\nFor example, the sequence A obtained from the shortest path from Vertex 1 to Vertex 5 is 1,2,5,3,4. Its longest increasing subsequence is A_1, A_2, A_4, A_5, with the length of 4.", "sample_input": "10\n1 2 5 3 4 6 7 3 2 4\n1 2\n2 3\n3 4\n4 5\n3 6\n6 7\n1 8\n8 9\n9 10\n"}, "reference_outputs": ["1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n"], "source_document_id": "p02698", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices, whose i-th edge connects Vertex u_i and Vertex v_i.\nVertex i has an integer a_i written on it.\nFor every integer k from 1 through N, solve the following problem:\n\nWe will make a sequence by lining up the integers written on the vertices along the shortest path from Vertex 1 to Vertex k, in the order they appear. Find the length of the longest increasing subsequence of this sequence.\n\nHere, the longest increasing subsequence of a sequence A of length L is the subsequence A_{i_1} , A_{i_2} , ... , A_{i_M} with the greatest possible value of M such that 1 \\leq i_1 < i_2 < ... < i_M \\leq L and A_{i_1} < A_{i_2} < ... < A_{i_M}.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq a_i \\leq 10^9\n\n1 \\leq u_i , v_i \\leq N\n\nu_i \\neq v_i\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint N lines. The k-th line, print the length of the longest increasing subsequence of the sequence obtained from the shortest path from Vertex 1 to Vertex k.\n\nSample Input 1\n\n10\n1 2 5 3 4 6 7 3 2 4\n1 2\n2 3\n3 4\n4 5\n3 6\n6 7\n1 8\n8 9\n9 10\n\nSample Output 1\n\n1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n\nFor example, the sequence A obtained from the shortest path from Vertex 1 to Vertex 5 is 1,2,5,3,4. Its longest increasing subsequence is A_1, A_2, A_4, A_5, with the length of 4.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2191, "cpu_time_ms": 1534, "memory_kb": 113520}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s836265338", "group_id": "codeNet:p02698", "input_text": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\tstatic PrintWriter out;\n\tstatic StringBuilder sb;\n\tstatic int n, m, k;\n\tstatic long mod = 998244353;\n\tstatic Boolean[][][] memo;\n\tstatic String s;\n\tstatic HashMap nums;\n\tstatic ArrayList[] ad;\n\tstatic boolean[] vis;\n\tstatic TreeSet al;\n\tstatic int[][] val;\n\tstatic int[] b;\n\tstatic int[] ans;\n\tstatic FenwickTree ft;\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tn = sc.nextInt();\n\t\tb = new int[n];\n\t\tTreeSet ts = new TreeSet<>();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tts.add(b[i] = sc.nextInt());\n\t\t}\n\t\tnums = new HashMap<>();\n\t\tint id = 1;\n\t\tad = new ArrayList[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tad[i] = new ArrayList<>();\n\t\tfor (int i = 0; i < n - 1; i++) {\n\t\t\tint a = sc.nextInt() - 1;\n\t\t\tint b = sc.nextInt() - 1;\n\t\t\tad[a].add(b);\n\t\t\tad[b].add(a);\n\t\t}\n\t\tans = new int[n];\n\t\twhile (!ts.isEmpty())\n\t\t\tnums.put(ts.pollFirst(), id++);\n\t\tft = new FenwickTree(nums.size() + 1);\n\t\tar = new int[n];\n\t\tk = -1;\n\t\tdfs(0, -1);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tout.println(ans[i]);\n\t\tout.flush();\n\t}\n\n\tstatic int[] ar;\n\n\tstatic void dfs(int u, int p) {\n\t\tboolean f = false;\n\t\tint id = -1;\n\t\tint v = 0;\n\t\tif (k == -1 || ar[k] < b[u]) {\n\t\t\tar[++k] = b[u];\n\t\t} else {\n\t\t\tf = true;\n\t\t\tint lo = 0;\n\t\t\tint hi = k;\n\t\t\twhile (lo <= hi) {\n\t\t\t\tint mid = lo + hi >> 1;\n\t\t\t\tif (ar[mid] >= b[u]) {\n\t\t\t\t\tid = mid;\n\t\t\t\t\thi = mid - 1;\n\t\t\t\t} else\n\t\t\t\t\tlo = mid + 1;\n\t\t\t}\n\t\t\tif (id != -1) {\n\t\t\t\tv = ar[id];\n\t\t\t\tar[id] = Math.min(ar[id], b[u]);\n\t\t\t}\n\t\t}\n\t\tans[u]=k+1;\n\t\tfor (int ch : ad[u])\n\t\t\tif (ch != p) {\n\t\t\t\tdfs(ch, u);\n\t\t\t}\n\t\tif (f) {\n\t\t\tif (id != -1)\n\t\t\t\tar[id] = v;\n\t\t} else {\n\t\t\tk--;\n\t\t}\n\t}\n\n\tpublic static class FenwickTree { // one-based DS\n\n\t\tint n;\n\t\tint[] ft;\n\t\tint[] occ;\n\n\t\tFenwickTree(int size) {\n\t\t\tn = size;\n\t\t\tft = new int[n + 1];\n\t\t\tocc = new int[n + 1];\n\t\t}\n\n\t\tint rsq(int b) // O(log n)\n\t\t{\n\t\t\tint sum = 0;\n\t\t\twhile (b > 0) {\n\t\t\t\tsum = Math.max(ft[b], sum);\n\t\t\t\tb -= b & -b;\n\t\t\t} // min?\n\t\t\treturn sum;\n\t\t}\n\n\t\tArrayList point_update(int k, int val) // O(log n), update = increment\n\t\t{\n\t\t\tArrayList points = new ArrayList<>();\n\t\t\twhile (k <= n) {\n\t\t\t\tif (ft[k] < val) {\n\t\t\t\t\tpoints.add(k);\n\t\t\t\t\tpoints.add(ft[k]);\n\t\t\t\t}\n\t\t\t\tft[k] = Math.max(val, ft[k]);\n\t\t\t\tk += k & -k;\n\t\t\t} // min?\n\t\t\treturn points;\n\t\t}\n\n\t\tvoid reverse(ArrayList g) {\n\t\t\tfor (int i = 0; i < g.size(); i += 2) {\n\t\t\t\tft[g.get(i)] = g.get(i + 1);\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n\n\t\tpublic Scanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic char nextChar() throws IOException {\n\t\t\treturn next().charAt(0);\n\t\t}\n\n\t\tpublic Long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextArrInt(int n) throws IOException {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextArrLong(int n) throws IOException {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t\tpublic void waitForInput() throws InterruptedException {\n\t\t\tThread.sleep(3000);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1588482914, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02698.html", "problem_id": "p02698", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02698/input.txt", "sample_output_relpath": "derived/input_output/data/p02698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02698/Java/s836265338.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s836265338", "user_id": "u217252547"}, "prompt_components": {"gold_output": "1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\tstatic PrintWriter out;\n\tstatic StringBuilder sb;\n\tstatic int n, m, k;\n\tstatic long mod = 998244353;\n\tstatic Boolean[][][] memo;\n\tstatic String s;\n\tstatic HashMap nums;\n\tstatic ArrayList[] ad;\n\tstatic boolean[] vis;\n\tstatic TreeSet al;\n\tstatic int[][] val;\n\tstatic int[] b;\n\tstatic int[] ans;\n\tstatic FenwickTree ft;\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tn = sc.nextInt();\n\t\tb = new int[n];\n\t\tTreeSet ts = new TreeSet<>();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tts.add(b[i] = sc.nextInt());\n\t\t}\n\t\tnums = new HashMap<>();\n\t\tint id = 1;\n\t\tad = new ArrayList[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tad[i] = new ArrayList<>();\n\t\tfor (int i = 0; i < n - 1; i++) {\n\t\t\tint a = sc.nextInt() - 1;\n\t\t\tint b = sc.nextInt() - 1;\n\t\t\tad[a].add(b);\n\t\t\tad[b].add(a);\n\t\t}\n\t\tans = new int[n];\n\t\twhile (!ts.isEmpty())\n\t\t\tnums.put(ts.pollFirst(), id++);\n\t\tft = new FenwickTree(nums.size() + 1);\n\t\tar = new int[n];\n\t\tk = -1;\n\t\tdfs(0, -1);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tout.println(ans[i]);\n\t\tout.flush();\n\t}\n\n\tstatic int[] ar;\n\n\tstatic void dfs(int u, int p) {\n\t\tboolean f = false;\n\t\tint id = -1;\n\t\tint v = 0;\n\t\tif (k == -1 || ar[k] < b[u]) {\n\t\t\tar[++k] = b[u];\n\t\t} else {\n\t\t\tf = true;\n\t\t\tint lo = 0;\n\t\t\tint hi = k;\n\t\t\twhile (lo <= hi) {\n\t\t\t\tint mid = lo + hi >> 1;\n\t\t\t\tif (ar[mid] >= b[u]) {\n\t\t\t\t\tid = mid;\n\t\t\t\t\thi = mid - 1;\n\t\t\t\t} else\n\t\t\t\t\tlo = mid + 1;\n\t\t\t}\n\t\t\tif (id != -1) {\n\t\t\t\tv = ar[id];\n\t\t\t\tar[id] = Math.min(ar[id], b[u]);\n\t\t\t}\n\t\t}\n\t\tans[u]=k+1;\n\t\tfor (int ch : ad[u])\n\t\t\tif (ch != p) {\n\t\t\t\tdfs(ch, u);\n\t\t\t}\n\t\tif (f) {\n\t\t\tif (id != -1)\n\t\t\t\tar[id] = v;\n\t\t} else {\n\t\t\tk--;\n\t\t}\n\t}\n\n\tpublic static class FenwickTree { // one-based DS\n\n\t\tint n;\n\t\tint[] ft;\n\t\tint[] occ;\n\n\t\tFenwickTree(int size) {\n\t\t\tn = size;\n\t\t\tft = new int[n + 1];\n\t\t\tocc = new int[n + 1];\n\t\t}\n\n\t\tint rsq(int b) // O(log n)\n\t\t{\n\t\t\tint sum = 0;\n\t\t\twhile (b > 0) {\n\t\t\t\tsum = Math.max(ft[b], sum);\n\t\t\t\tb -= b & -b;\n\t\t\t} // min?\n\t\t\treturn sum;\n\t\t}\n\n\t\tArrayList point_update(int k, int val) // O(log n), update = increment\n\t\t{\n\t\t\tArrayList points = new ArrayList<>();\n\t\t\twhile (k <= n) {\n\t\t\t\tif (ft[k] < val) {\n\t\t\t\t\tpoints.add(k);\n\t\t\t\t\tpoints.add(ft[k]);\n\t\t\t\t}\n\t\t\t\tft[k] = Math.max(val, ft[k]);\n\t\t\t\tk += k & -k;\n\t\t\t} // min?\n\t\t\treturn points;\n\t\t}\n\n\t\tvoid reverse(ArrayList g) {\n\t\t\tfor (int i = 0; i < g.size(); i += 2) {\n\t\t\t\tft[g.get(i)] = g.get(i + 1);\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic class Scanner {\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream system) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(system));\n\t\t}\n\n\t\tpublic Scanner(String file) throws Exception {\n\t\t\tbr = new BufferedReader(new FileReader(file));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\treturn br.readLine();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic char nextChar() throws IOException {\n\t\t\treturn next().charAt(0);\n\t\t}\n\n\t\tpublic Long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextArrInt(int n) throws IOException {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic long[] nextArrLong(int n) throws IOException {\n\t\t\tlong[] a = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\ta[i] = nextLong();\n\t\t\treturn a;\n\t\t}\n\n\t\tpublic boolean ready() throws IOException {\n\t\t\treturn br.ready();\n\t\t}\n\n\t\tpublic void waitForInput() throws InterruptedException {\n\t\t\tThread.sleep(3000);\n\t\t}\n\t}\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices, whose i-th edge connects Vertex u_i and Vertex v_i.\nVertex i has an integer a_i written on it.\nFor every integer k from 1 through N, solve the following problem:\n\nWe will make a sequence by lining up the integers written on the vertices along the shortest path from Vertex 1 to Vertex k, in the order they appear. Find the length of the longest increasing subsequence of this sequence.\n\nHere, the longest increasing subsequence of a sequence A of length L is the subsequence A_{i_1} , A_{i_2} , ... , A_{i_M} with the greatest possible value of M such that 1 \\leq i_1 < i_2 < ... < i_M \\leq L and A_{i_1} < A_{i_2} < ... < A_{i_M}.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq a_i \\leq 10^9\n\n1 \\leq u_i , v_i \\leq N\n\nu_i \\neq v_i\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint N lines. The k-th line, print the length of the longest increasing subsequence of the sequence obtained from the shortest path from Vertex 1 to Vertex k.\n\nSample Input 1\n\n10\n1 2 5 3 4 6 7 3 2 4\n1 2\n2 3\n3 4\n4 5\n3 6\n6 7\n1 8\n8 9\n9 10\n\nSample Output 1\n\n1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n\nFor example, the sequence A obtained from the shortest path from Vertex 1 to Vertex 5 is 1,2,5,3,4. Its longest increasing subsequence is A_1, A_2, A_4, A_5, with the length of 4.", "sample_input": "10\n1 2 5 3 4 6 7 3 2 4\n1 2\n2 3\n3 4\n4 5\n3 6\n6 7\n1 8\n8 9\n9 10\n"}, "reference_outputs": ["1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n"], "source_document_id": "p02698", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices, whose i-th edge connects Vertex u_i and Vertex v_i.\nVertex i has an integer a_i written on it.\nFor every integer k from 1 through N, solve the following problem:\n\nWe will make a sequence by lining up the integers written on the vertices along the shortest path from Vertex 1 to Vertex k, in the order they appear. Find the length of the longest increasing subsequence of this sequence.\n\nHere, the longest increasing subsequence of a sequence A of length L is the subsequence A_{i_1} , A_{i_2} , ... , A_{i_M} with the greatest possible value of M such that 1 \\leq i_1 < i_2 < ... < i_M \\leq L and A_{i_1} < A_{i_2} < ... < A_{i_M}.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq a_i \\leq 10^9\n\n1 \\leq u_i , v_i \\leq N\n\nu_i \\neq v_i\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint N lines. The k-th line, print the length of the longest increasing subsequence of the sequence obtained from the shortest path from Vertex 1 to Vertex k.\n\nSample Input 1\n\n10\n1 2 5 3 4 6 7 3 2 4\n1 2\n2 3\n3 4\n4 5\n3 6\n6 7\n1 8\n8 9\n9 10\n\nSample Output 1\n\n1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n\nFor example, the sequence A obtained from the shortest path from Vertex 1 to Vertex 5 is 1,2,5,3,4. Its longest increasing subsequence is A_1, A_2, A_4, A_5, with the length of 4.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3870, "cpu_time_ms": 1463, "memory_kb": 274700}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s976121522", "group_id": "codeNet:p02698", "input_text": "import java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\npublic class Main/*Change to Main When Submitting*/ {\n static BufferedReader __in;\n static PrintWriter __out;\n static StringTokenizer input;\n\n static int[] ans;\n static Comparator

cmpi = (a, b) -> a.a == b.a ? a.b - b.b : a.a - b.a, cmpd = (a, b) -> a.a == b.a ? a.b - b.b : b.a - a.a;\n\n public static void main(String[] args) throws IOException {\n __in = new BufferedReader(new InputStreamReader(System.in));\n __out = new PrintWriter(new OutputStreamWriter(System.out));\n\n int n = ri();\n Node[] g = new Node[n];\n r();\n for(int i = 0; i < n; ++i) {\n g[i] = new Node(i, ni());\n }\n for(int i = 0; i < n - 1; ++i) {\n r();\n g[ni() - 1].add(g[ni() - 1]);\n }\n g[0].label(null);\n ans = new int[n];\n fill(ans, 1);\n g[0].solve(n);\n for(int i : ans) {\n prln(i);\n }\n\n close();\n }\n\n static class Node {\n List nei = new ArrayList<>();\n int i, v;\n Node par;\n\n Node(int i_, int v_) {\n i = i_;\n v = v_;\n }\n\n void label(Node par_) {\n par = par_;\n for(Node n : nei) {\n if(n != par) {\n n.label(this);\n }\n }\n }\n\n void add(Node n) {\n nei.add(n);\n n.nei.add(this);\n }\n\n void solve(int tot) {\n int[] dp = new int[tot], vals = new int[tot];\n fill(dp, 1);\n vals[0] = v;\n for(Node n : nei) {\n n.solve(dp, vals, 1);\n }\n }\n\n void solve(int[] dp, int[] vals, int ind) {\n// prln(ind);\n// prln(dp);\n// prln(vals);\n// prln(ans);\n// prln();\n dp[ind] = 1;\n for(int i = 0; i < ind; ++i) {\n if(v > vals[i]) {\n dp[ind] = max(dp[ind], dp[i] + 1);\n ans[this.i] = max(ans[i], dp[ind]);\n }\n }\n vals[ind] = v;\n for(Node n : nei) {\n if(n != par) {\n n.solve(dp, vals, ind + 1);\n }\n }\n }\n }\n\n /* static class Node {\n List nei = new ArrayList<>();\n int v;\n\n Node(int v_) {\n v = v_;\n }\n\n // returns {inc, dec}\n List> solve(Node par) {\n TreeSet

inc = new TreeSet<>(cmpi), dec = new TreeSet<>(cmpd);\n P self = P.mk(v, 1);\n if(nei.size() == 1) {\n inc.add(self);\n dec.add(self);\n } else {\n for(Node n : nei) {\n if(n != par) {\n List> res = n.solve(this);\n inc.addAll(res.get(0));\n dec.addAll(res.get(1));\n }\n }\n P maxInc = inc.floor(P.mk(v - 1, 0)), maxDec = dec.floor(P.mk(v + 1, 0));\n int cur = 1;\n if(maxInc != null) {\n cur += maxInc.b;\n inc.add(P.mk(v, maxInc.b + 1));\n }\n if(maxDec == null) {\n cur += maxDec.b;\n dec.add(P.mk(v, maxDec.b + 1));\n }\n ans = max(ans, cur);\n }\n List> ret = new ArrayList<>(2);\n ret.add(inc);\n ret.add(dec);\n return ret;\n }\n } */\n\n static class P {\n int a, b;\n\n P(int a_, int b_) {\n a = a_;\n b = b_;\n }\n\n @Override\n public String toString() {\n return \"Pair{\" + \"a = \" + a + \", b = \" + b + '}';\n }\n\n public static P mk(int a, int b) {\n return new P(a, b);\n }\n\n public boolean equalsSafe(Object o) {\n if(this == o) return true;\n if(o == null || getClass() != o.getClass()) return false;\n P p = (P)o;\n return a == p.a && b == p.b;\n }\n\n public boolean equalsUnchecked(Object o) {\n P p = (P)o;\n return a == p.a && b == p.b;\n }\n\n @Override\n public boolean equals(Object o) {\n return equalsUnchecked(o);\n }\n\n @Override\n public int hashCode() {\n return Objects.hash(a, b);\n }\n }\n\n // references\n // IBIG = 1e9 + 7\n // IRAND ~= 3e8\n // IMAX ~= 2e10\n // LMAX ~= 9e18\n // constants\n static final int IBIG = 1000000007;\n static final int IRAND = 327859546;\n static final int IMAX = 2147483647;\n static final int IMIN = -2147483648;\n static final long LMAX = 9223372036854775807L;\n static final long LMIN = -9223372036854775808L;\n // util\n static int minof(int a, int b, int c) {return min(a, min(b, c));}\n static int minof(int... x) {return x.length == 1 ? x[0] : x.length == 2 ? min(x[0], x[1]) : min(x[0], minstarting(1, x));}\n static int minstarting(int offset, int... x) {assert x.length > 2; return offset == x.length - 2 ? min(x[offset], x[offset + 1]) : min(x[offset], minstarting(offset + 1, x));}\n static long minof(long a, long b, long c) {return min(a, min(b, c));}\n static long minof(long... x) {return x.length == 1 ? x[0] : x.length == 2 ? min(x[0], x[1]) : min(x[0], minstarting(1, x));}\n static long minstarting(int offset, long... x) {assert x.length > 2; return offset == x.length - 2 ? min(x[offset], x[offset + 1]) : min(x[offset], minstarting(offset + 1, x));}\n static int powi(int a, int b) {if(a == 0) return 0; int ans = 1; while(b > 0) {if((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}\n static long powl(long a, int b) {if(a == 0) return 0; long ans = 1; while(b > 0) {if((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}\n static int floori(double d) {return (int)d;}\n static int ceili(double d) {return (int)ceil(d);}\n static long floorl(double d) {return (long)d;}\n static long ceill(double d) {return (long)ceil(d);}\n // input\n static void r() throws IOException {input = new StringTokenizer(__in.readLine());}\n static int ri() throws IOException {return Integer.parseInt(__in.readLine());}\n static long rl() throws IOException {return Long.parseLong(__in.readLine());}\n static int[] ria(int n) throws IOException {int[] a = new int[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Integer.parseInt(input.nextToken()); return a;}\n static long[] rla(int n) throws IOException {long[] a = new long[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Long.parseLong(input.nextToken()); return a;}\n static char[] rcha() throws IOException {return __in.readLine().toCharArray();}\n static String rline() throws IOException {return __in.readLine();}\n static int ni() {return Integer.parseInt(input.nextToken());}\n static long nl() {return Long.parseLong(input.nextToken());}\n // output\n static void pr(int i) {__out.print(i);}\n static void prln(int i) {__out.println(i);}\n static void pr(long l) {__out.print(l);}\n static void prln(long l) {__out.println(l);}\n static void pr(double d) {__out.print(d);}\n static void prln(double d) {__out.println(d);}\n static void pr(char c) {__out.print(c);}\n static void prln(char c) {__out.println(c);}\n static void pr(char[] s) {__out.print(new String(s));}\n static void prln(char[] s) {__out.println(new String(s));}\n static void pr(String s) {__out.print(s);}\n static void prln(String s) {__out.println(s);}\n static void pr(Object o) {__out.print(o);}\n static void prln(Object o) {__out.println(o);}\n static void prln() {__out.println();}\n static void pryes() {__out.println(\"yes\");}\n static void pry() {__out.println(\"Yes\");}\n static void prY() {__out.println(\"YES\");}\n static void prno() {__out.println(\"no\");}\n static void prn() {__out.println(\"No\");}\n static void prN() {__out.println(\"NO\");}\n static void pryesno(boolean b) {__out.println(b ? \"yes\" : \"no\");};\n static void pryn(boolean b) {__out.println(b ? \"Yes\" : \"No\");}\n static void prYN(boolean b) {__out.println(b ? \"YES\" : \"NO\");}\n static void prln(int... a) {for(int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), i++); __out.println(a[a.length - 1]);}\n static void prln(long... a) {for(int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), i++); __out.println(a[a.length - 1]);}\n static void flush() {__out.flush();}\n static void close() {__out.close();}\n // debug\n static void debug(String desc, int... a) {System.out.print(desc); System.out.print(\": \"); for(int i = 0, len = a.length - 1; i < len; System.out.print(a[i]), System.out.print(\", \"), i++); System.out.println(a[a.length - 1]);}\n static void debug(String desc, long... a) {System.out.print(desc); System.out.print(\": \"); for(int i = 0, len = a.length - 1; i < len; System.out.print(a[i]), System.out.print(\", \"), i++); System.out.println(a[a.length - 1]);}\n}", "language": "Java", "metadata": {"date": 1588473658, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02698.html", "problem_id": "p02698", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02698/input.txt", "sample_output_relpath": "derived/input_output/data/p02698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02698/Java/s976121522.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s976121522", "user_id": "u622812523"}, "prompt_components": {"gold_output": "1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\npublic class Main/*Change to Main When Submitting*/ {\n static BufferedReader __in;\n static PrintWriter __out;\n static StringTokenizer input;\n\n static int[] ans;\n static Comparator

cmpi = (a, b) -> a.a == b.a ? a.b - b.b : a.a - b.a, cmpd = (a, b) -> a.a == b.a ? a.b - b.b : b.a - a.a;\n\n public static void main(String[] args) throws IOException {\n __in = new BufferedReader(new InputStreamReader(System.in));\n __out = new PrintWriter(new OutputStreamWriter(System.out));\n\n int n = ri();\n Node[] g = new Node[n];\n r();\n for(int i = 0; i < n; ++i) {\n g[i] = new Node(i, ni());\n }\n for(int i = 0; i < n - 1; ++i) {\n r();\n g[ni() - 1].add(g[ni() - 1]);\n }\n g[0].label(null);\n ans = new int[n];\n fill(ans, 1);\n g[0].solve(n);\n for(int i : ans) {\n prln(i);\n }\n\n close();\n }\n\n static class Node {\n List nei = new ArrayList<>();\n int i, v;\n Node par;\n\n Node(int i_, int v_) {\n i = i_;\n v = v_;\n }\n\n void label(Node par_) {\n par = par_;\n for(Node n : nei) {\n if(n != par) {\n n.label(this);\n }\n }\n }\n\n void add(Node n) {\n nei.add(n);\n n.nei.add(this);\n }\n\n void solve(int tot) {\n int[] dp = new int[tot], vals = new int[tot];\n fill(dp, 1);\n vals[0] = v;\n for(Node n : nei) {\n n.solve(dp, vals, 1);\n }\n }\n\n void solve(int[] dp, int[] vals, int ind) {\n// prln(ind);\n// prln(dp);\n// prln(vals);\n// prln(ans);\n// prln();\n dp[ind] = 1;\n for(int i = 0; i < ind; ++i) {\n if(v > vals[i]) {\n dp[ind] = max(dp[ind], dp[i] + 1);\n ans[this.i] = max(ans[i], dp[ind]);\n }\n }\n vals[ind] = v;\n for(Node n : nei) {\n if(n != par) {\n n.solve(dp, vals, ind + 1);\n }\n }\n }\n }\n\n /* static class Node {\n List nei = new ArrayList<>();\n int v;\n\n Node(int v_) {\n v = v_;\n }\n\n // returns {inc, dec}\n List> solve(Node par) {\n TreeSet

inc = new TreeSet<>(cmpi), dec = new TreeSet<>(cmpd);\n P self = P.mk(v, 1);\n if(nei.size() == 1) {\n inc.add(self);\n dec.add(self);\n } else {\n for(Node n : nei) {\n if(n != par) {\n List> res = n.solve(this);\n inc.addAll(res.get(0));\n dec.addAll(res.get(1));\n }\n }\n P maxInc = inc.floor(P.mk(v - 1, 0)), maxDec = dec.floor(P.mk(v + 1, 0));\n int cur = 1;\n if(maxInc != null) {\n cur += maxInc.b;\n inc.add(P.mk(v, maxInc.b + 1));\n }\n if(maxDec == null) {\n cur += maxDec.b;\n dec.add(P.mk(v, maxDec.b + 1));\n }\n ans = max(ans, cur);\n }\n List> ret = new ArrayList<>(2);\n ret.add(inc);\n ret.add(dec);\n return ret;\n }\n } */\n\n static class P {\n int a, b;\n\n P(int a_, int b_) {\n a = a_;\n b = b_;\n }\n\n @Override\n public String toString() {\n return \"Pair{\" + \"a = \" + a + \", b = \" + b + '}';\n }\n\n public static P mk(int a, int b) {\n return new P(a, b);\n }\n\n public boolean equalsSafe(Object o) {\n if(this == o) return true;\n if(o == null || getClass() != o.getClass()) return false;\n P p = (P)o;\n return a == p.a && b == p.b;\n }\n\n public boolean equalsUnchecked(Object o) {\n P p = (P)o;\n return a == p.a && b == p.b;\n }\n\n @Override\n public boolean equals(Object o) {\n return equalsUnchecked(o);\n }\n\n @Override\n public int hashCode() {\n return Objects.hash(a, b);\n }\n }\n\n // references\n // IBIG = 1e9 + 7\n // IRAND ~= 3e8\n // IMAX ~= 2e10\n // LMAX ~= 9e18\n // constants\n static final int IBIG = 1000000007;\n static final int IRAND = 327859546;\n static final int IMAX = 2147483647;\n static final int IMIN = -2147483648;\n static final long LMAX = 9223372036854775807L;\n static final long LMIN = -9223372036854775808L;\n // util\n static int minof(int a, int b, int c) {return min(a, min(b, c));}\n static int minof(int... x) {return x.length == 1 ? x[0] : x.length == 2 ? min(x[0], x[1]) : min(x[0], minstarting(1, x));}\n static int minstarting(int offset, int... x) {assert x.length > 2; return offset == x.length - 2 ? min(x[offset], x[offset + 1]) : min(x[offset], minstarting(offset + 1, x));}\n static long minof(long a, long b, long c) {return min(a, min(b, c));}\n static long minof(long... x) {return x.length == 1 ? x[0] : x.length == 2 ? min(x[0], x[1]) : min(x[0], minstarting(1, x));}\n static long minstarting(int offset, long... x) {assert x.length > 2; return offset == x.length - 2 ? min(x[offset], x[offset + 1]) : min(x[offset], minstarting(offset + 1, x));}\n static int powi(int a, int b) {if(a == 0) return 0; int ans = 1; while(b > 0) {if((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}\n static long powl(long a, int b) {if(a == 0) return 0; long ans = 1; while(b > 0) {if((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}\n static int floori(double d) {return (int)d;}\n static int ceili(double d) {return (int)ceil(d);}\n static long floorl(double d) {return (long)d;}\n static long ceill(double d) {return (long)ceil(d);}\n // input\n static void r() throws IOException {input = new StringTokenizer(__in.readLine());}\n static int ri() throws IOException {return Integer.parseInt(__in.readLine());}\n static long rl() throws IOException {return Long.parseLong(__in.readLine());}\n static int[] ria(int n) throws IOException {int[] a = new int[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Integer.parseInt(input.nextToken()); return a;}\n static long[] rla(int n) throws IOException {long[] a = new long[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Long.parseLong(input.nextToken()); return a;}\n static char[] rcha() throws IOException {return __in.readLine().toCharArray();}\n static String rline() throws IOException {return __in.readLine();}\n static int ni() {return Integer.parseInt(input.nextToken());}\n static long nl() {return Long.parseLong(input.nextToken());}\n // output\n static void pr(int i) {__out.print(i);}\n static void prln(int i) {__out.println(i);}\n static void pr(long l) {__out.print(l);}\n static void prln(long l) {__out.println(l);}\n static void pr(double d) {__out.print(d);}\n static void prln(double d) {__out.println(d);}\n static void pr(char c) {__out.print(c);}\n static void prln(char c) {__out.println(c);}\n static void pr(char[] s) {__out.print(new String(s));}\n static void prln(char[] s) {__out.println(new String(s));}\n static void pr(String s) {__out.print(s);}\n static void prln(String s) {__out.println(s);}\n static void pr(Object o) {__out.print(o);}\n static void prln(Object o) {__out.println(o);}\n static void prln() {__out.println();}\n static void pryes() {__out.println(\"yes\");}\n static void pry() {__out.println(\"Yes\");}\n static void prY() {__out.println(\"YES\");}\n static void prno() {__out.println(\"no\");}\n static void prn() {__out.println(\"No\");}\n static void prN() {__out.println(\"NO\");}\n static void pryesno(boolean b) {__out.println(b ? \"yes\" : \"no\");};\n static void pryn(boolean b) {__out.println(b ? \"Yes\" : \"No\");}\n static void prYN(boolean b) {__out.println(b ? \"YES\" : \"NO\");}\n static void prln(int... a) {for(int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), i++); __out.println(a[a.length - 1]);}\n static void prln(long... a) {for(int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), i++); __out.println(a[a.length - 1]);}\n static void flush() {__out.flush();}\n static void close() {__out.close();}\n // debug\n static void debug(String desc, int... a) {System.out.print(desc); System.out.print(\": \"); for(int i = 0, len = a.length - 1; i < len; System.out.print(a[i]), System.out.print(\", \"), i++); System.out.println(a[a.length - 1]);}\n static void debug(String desc, long... a) {System.out.print(desc); System.out.print(\": \"); for(int i = 0, len = a.length - 1; i < len; System.out.print(a[i]), System.out.print(\", \"), i++); System.out.println(a[a.length - 1]);}\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices, whose i-th edge connects Vertex u_i and Vertex v_i.\nVertex i has an integer a_i written on it.\nFor every integer k from 1 through N, solve the following problem:\n\nWe will make a sequence by lining up the integers written on the vertices along the shortest path from Vertex 1 to Vertex k, in the order they appear. Find the length of the longest increasing subsequence of this sequence.\n\nHere, the longest increasing subsequence of a sequence A of length L is the subsequence A_{i_1} , A_{i_2} , ... , A_{i_M} with the greatest possible value of M such that 1 \\leq i_1 < i_2 < ... < i_M \\leq L and A_{i_1} < A_{i_2} < ... < A_{i_M}.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq a_i \\leq 10^9\n\n1 \\leq u_i , v_i \\leq N\n\nu_i \\neq v_i\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint N lines. The k-th line, print the length of the longest increasing subsequence of the sequence obtained from the shortest path from Vertex 1 to Vertex k.\n\nSample Input 1\n\n10\n1 2 5 3 4 6 7 3 2 4\n1 2\n2 3\n3 4\n4 5\n3 6\n6 7\n1 8\n8 9\n9 10\n\nSample Output 1\n\n1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n\nFor example, the sequence A obtained from the shortest path from Vertex 1 to Vertex 5 is 1,2,5,3,4. Its longest increasing subsequence is A_1, A_2, A_4, A_5, with the length of 4.", "sample_input": "10\n1 2 5 3 4 6 7 3 2 4\n1 2\n2 3\n3 4\n4 5\n3 6\n6 7\n1 8\n8 9\n9 10\n"}, "reference_outputs": ["1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n"], "source_document_id": "p02698", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices, whose i-th edge connects Vertex u_i and Vertex v_i.\nVertex i has an integer a_i written on it.\nFor every integer k from 1 through N, solve the following problem:\n\nWe will make a sequence by lining up the integers written on the vertices along the shortest path from Vertex 1 to Vertex k, in the order they appear. Find the length of the longest increasing subsequence of this sequence.\n\nHere, the longest increasing subsequence of a sequence A of length L is the subsequence A_{i_1} , A_{i_2} , ... , A_{i_M} with the greatest possible value of M such that 1 \\leq i_1 < i_2 < ... < i_M \\leq L and A_{i_1} < A_{i_2} < ... < A_{i_M}.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq a_i \\leq 10^9\n\n1 \\leq u_i , v_i \\leq N\n\nu_i \\neq v_i\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint N lines. The k-th line, print the length of the longest increasing subsequence of the sequence obtained from the shortest path from Vertex 1 to Vertex k.\n\nSample Input 1\n\n10\n1 2 5 3 4 6 7 3 2 4\n1 2\n2 3\n3 4\n4 5\n3 6\n6 7\n1 8\n8 9\n9 10\n\nSample Output 1\n\n1\n2\n3\n3\n4\n4\n5\n2\n2\n3\n\nFor example, the sequence A obtained from the shortest path from Vertex 1 to Vertex 5 is 1,2,5,3,4. Its longest increasing subsequence is A_1, A_2, A_4, A_5, with the length of 4.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9285, "cpu_time_ms": 2208, "memory_kb": 90572}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s178502194", "group_id": "codeNet:p02699", "input_text": "import java.util.Scanner;\n\nclass Main {\n\n public static void main(String[] args) {\n Scanner stdIn=new Scanner(System.in);\n \n int x=stdIn.nextInt();//回数\n\n String []a=new String[x];\n for(int i=0; i s ? \"unsafe\" : \"safe\");\n }\n\n public static void main(String[]$) {\n new Main().solve();\n out.flush();\n }\n}\n\nclass In {\n private BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);\n private StringTokenizer tokenizer;\n\n String next() {\n try {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n } catch (IOException ignored) {\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n char[][] nextCharArray(int n, int m) {\n char[][] a = new char[n][m];\n for (int i = 0; i < n; i++) {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n int[] nextIntArray(int n, IntUnaryOperator op) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsInt(nextInt());\n }\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n\n long[] nextLongArray(int n, LongUnaryOperator op) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsLong(nextLong());\n }\n return a;\n }\n}\n\nclass Out {\n private PrintWriter out = new PrintWriter(System.out);\n boolean autoFlush = false;\n\n void println(Object... a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (Object obj : a) {\n joiner.add(String.valueOf(obj));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(int[] a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (int i : a) {\n joiner.add(Integer.toString(i));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(long[] a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (long i : a) {\n joiner.add(Long.toString(i));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void flush() {\n out.flush();\n }\n}\n", "language": "Java", "metadata": {"date": 1587949231, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02699/input.txt", "sample_output_relpath": "derived/input_output/data/p02699/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02699/Java/s410118083.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s410118083", "user_id": "u981808900"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringJoiner;\nimport java.util.StringTokenizer;\nimport java.util.function.IntUnaryOperator;\nimport java.util.function.LongUnaryOperator;\n\npublic class Main {\n static In in = new In();\n static Out out = new Out();\n static final long mod = 1000000007;\n static final long inf = 0xfffffffffffffffL;\n static final int iinf = 0xfffffff;\n static final int[] da = {-1, 0, 1, 0, -1, 1, 1, -1, -1};\n\n void solve() {\n int s = in.nextInt();\n int w = in.nextInt();\n out.println(w > s ? \"unsafe\" : \"safe\");\n }\n\n public static void main(String[]$) {\n new Main().solve();\n out.flush();\n }\n}\n\nclass In {\n private BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);\n private StringTokenizer tokenizer;\n\n String next() {\n try {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n } catch (IOException ignored) {\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n char[][] nextCharArray(int n, int m) {\n char[][] a = new char[n][m];\n for (int i = 0; i < n; i++) {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n int[] nextIntArray(int n, IntUnaryOperator op) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsInt(nextInt());\n }\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n\n long[] nextLongArray(int n, LongUnaryOperator op) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsLong(nextLong());\n }\n return a;\n }\n}\n\nclass Out {\n private PrintWriter out = new PrintWriter(System.out);\n boolean autoFlush = false;\n\n void println(Object... a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (Object obj : a) {\n joiner.add(String.valueOf(obj));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(int[] a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (int i : a) {\n joiner.add(Integer.toString(i));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(long[] a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (long i : a) {\n joiner.add(Long.toString(i));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void flush() {\n out.flush();\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "sample_input": "4 5\n"}, "reference_outputs": ["unsafe\n"], "source_document_id": "p02699", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3219, "cpu_time_ms": 70, "memory_kb": 33116}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s259581380", "group_id": "codeNet:p02701", "input_text": "import java.util.*;\n \nclass MyStack {\n private Object stack[];\n private int stackSize;\n private int sp;\n private static final int DEFAULT_STACK_SIZE = 200000;\n \n public MyStack(){\n this(DEFAULT_STACK_SIZE);\n }\n \n public MyStack(int size){\n stack = new Object[size];\n stackSize = size;\n sp = 0;\n }\n \n public void clear(){\n Arrays.fill(stack,0,sp,null);\n sp = 0;\n }\n \n public void push(Object x){\n if(sp >= stackSize){\n throw new IllegalStateException(\"Stack overflow\");\n }\n stack[sp++] = x;\n }\n \n public Object pop(){\n if(sp <= 0){\n throw new EmptyStackException();\n }\n Object value = stack[--sp];\n stack[sp] = null;\n return value;\n }\n \n public boolean isEmpty(){\n return sp == 0;\n }\n \n public String toString(){\n String s = \"MyStack=[\";\n for(int i = 0; i < sp; i++){\n s = s + stack[i];\n if(i < sp - 1){\n s = s + \",\";\n }\n }\n s = s + \"]\";\n return s;\n }\n public int size(){\n return this.sp;\n }\n public String getTopObjectName(){\n String s = stack[--sp].toString();\n sp++;\n return s;\n }\n}\npublic class Main {\n \n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int a = s.nextInt(); \n List list = new ArrayList();\n MyStack stack = new MyStack();\n \n for(int i = 0; i <= a; i++){\n String x = s.nextLine();\n list.add(x.toLowerCase());\n }\n Collections.sort(list);\n stack.push(list.remove(0));\n for(int i = 0; i < list.size(); i++){\n String mo = list.get(i);\n if(mo.length() <= 10 && mo.length() >= 1 && !stack.getTopObjectName().equals(mo)){\n stack.push(mo);\n }\n }\n System.out.println(stack.size()-1);\n }\n}", "language": "Java", "metadata": {"date": 1588031701, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02701/input.txt", "sample_output_relpath": "derived/input_output/data/p02701/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02701/Java/s259581380.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s259581380", "user_id": "u241752770"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n \nclass MyStack {\n private Object stack[];\n private int stackSize;\n private int sp;\n private static final int DEFAULT_STACK_SIZE = 200000;\n \n public MyStack(){\n this(DEFAULT_STACK_SIZE);\n }\n \n public MyStack(int size){\n stack = new Object[size];\n stackSize = size;\n sp = 0;\n }\n \n public void clear(){\n Arrays.fill(stack,0,sp,null);\n sp = 0;\n }\n \n public void push(Object x){\n if(sp >= stackSize){\n throw new IllegalStateException(\"Stack overflow\");\n }\n stack[sp++] = x;\n }\n \n public Object pop(){\n if(sp <= 0){\n throw new EmptyStackException();\n }\n Object value = stack[--sp];\n stack[sp] = null;\n return value;\n }\n \n public boolean isEmpty(){\n return sp == 0;\n }\n \n public String toString(){\n String s = \"MyStack=[\";\n for(int i = 0; i < sp; i++){\n s = s + stack[i];\n if(i < sp - 1){\n s = s + \",\";\n }\n }\n s = s + \"]\";\n return s;\n }\n public int size(){\n return this.sp;\n }\n public String getTopObjectName(){\n String s = stack[--sp].toString();\n sp++;\n return s;\n }\n}\npublic class Main {\n \n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int a = s.nextInt(); \n List list = new ArrayList();\n MyStack stack = new MyStack();\n \n for(int i = 0; i <= a; i++){\n String x = s.nextLine();\n list.add(x.toLowerCase());\n }\n Collections.sort(list);\n stack.push(list.remove(0));\n for(int i = 0; i < list.size(); i++){\n String mo = list.get(i);\n if(mo.length() <= 10 && mo.length() >= 1 && !stack.getTopObjectName().equals(mo)){\n stack.push(mo);\n }\n }\n System.out.println(stack.size()-1);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.\n\nHow many kinds of items did you get?\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint the number of kinds of items you got.\n\nSample Input 1\n\n3\napple\norange\napple\n\nSample Output 1\n\n2\n\nYou got two kinds of items: apple and orange.\n\nSample Input 2\n\n5\ngrape\ngrape\ngrape\ngrape\ngrape\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4\naaaa\na\naaa\naa\n\nSample Output 3\n\n4", "sample_input": "3\napple\norange\napple\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02701", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.\n\nHow many kinds of items did you get?\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint the number of kinds of items you got.\n\nSample Input 1\n\n3\napple\norange\napple\n\nSample Output 1\n\n2\n\nYou got two kinds of items: apple and orange.\n\nSample Input 2\n\n5\ngrape\ngrape\ngrape\ngrape\ngrape\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4\naaaa\na\naaa\naa\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2010, "cpu_time_ms": 842, "memory_kb": 76052}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s199606926", "group_id": "codeNet:p02701", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class Main{\n\n public static void main(String[] args){\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n try {\n int number = Integer.parseInt(br.readLine());\n List items = new ArrayList<>();\n int result = 0;\n for(int i = 0; i items = new ArrayList<>();\n int result = 0;\n for(int i = 0; i map = new HashMap<>();\n for(int i = 0; i < N - 1; i++) {\n int n = in.nextInt();\n if(map.containsKey(n)) {\n map.put(n, map.get(n) + 1);\n } else {\n map.put(n, 1);\n }\n }\n for(int i = 0; i < N; i++) {\n int n = i + 1;\n if(map.containsKey(n)) {\n System.out.println(map.get(n));\n } else {\n System.out.println(0);\n }\n }\n }\n\n}\n", "language": "Java", "metadata": {"date": 1587345583, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02707/input.txt", "sample_output_relpath": "derived/input_output/data/p02707/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02707/Java/s139492301.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s139492301", "user_id": "u109449621"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n HashMap map = new HashMap<>();\n for(int i = 0; i < N - 1; i++) {\n int n = in.nextInt();\n if(map.containsKey(n)) {\n map.put(n, map.get(n) + 1);\n } else {\n map.put(n, 1);\n }\n }\n for(int i = 0; i < N; i++) {\n int n = i + 1;\n if(map.containsKey(n)) {\n System.out.println(map.get(n));\n } else {\n System.out.println(0);\n }\n }\n }\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA company has N members, who are assigned ID numbers 1, ..., N.\n\nEvery member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.\n\nWhen a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.\n\nYou are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i < i\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_2 ... A_N\n\nOutput\n\nFor each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.\n\nSample Input 1\n\n5\n1 1 2 2\n\nSample Output 1\n\n2\n2\n0\n0\n0\n\nThe member numbered 1 has two immediate subordinates: the members numbered 2 and 3.\n\nThe member numbered 2 has two immediate subordinates: the members numbered 4 and 5.\n\nThe members numbered 3, 4, and 5 do not have immediate subordinates.\n\nSample Input 2\n\n10\n1 1 1 1 1 1 1 1 1\n\nSample Output 2\n\n9\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\nSample Input 3\n\n7\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n1\n1\n1\n1\n1\n0", "sample_input": "5\n1 1 2 2\n"}, "reference_outputs": ["2\n2\n0\n0\n0\n"], "source_document_id": "p02707", "source_text": "Score : 300 points\n\nProblem Statement\n\nA company has N members, who are assigned ID numbers 1, ..., N.\n\nEvery member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.\n\nWhen a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.\n\nYou are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i < i\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_2 ... A_N\n\nOutput\n\nFor each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.\n\nSample Input 1\n\n5\n1 1 2 2\n\nSample Output 1\n\n2\n2\n0\n0\n0\n\nThe member numbered 1 has two immediate subordinates: the members numbered 2 and 3.\n\nThe member numbered 2 has two immediate subordinates: the members numbered 4 and 5.\n\nThe members numbered 3, 4, and 5 do not have immediate subordinates.\n\nSample Input 2\n\n10\n1 1 1 1 1 1 1 1 1\n\nSample Output 2\n\n9\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\nSample Input 3\n\n7\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n1\n1\n1\n1\n1\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 711, "cpu_time_ms": 1352, "memory_kb": 68980}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s443241926", "group_id": "codeNet:p02708", "input_text": "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long N = sc.nextLong();\n long K = sc.nextLong();\n long res = 0;\n final long INF = (long)Math.pow(10, 9) + 7;\n for (long i = K; i <= N + 1; i++) {\n long min = (i - 1) * i / 2;\n long max = i * (N - i + 1) + (i - 1) * i / 2;\n res += max - min + 1;\n }\n System.out.println(res % INF);\n sc.close();\n }\n}", "language": "Java", "metadata": {"date": 1587396830, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02708.html", "problem_id": "p02708", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02708/input.txt", "sample_output_relpath": "derived/input_output/data/p02708/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02708/Java/s443241926.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s443241926", "user_id": "u988234231"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long N = sc.nextLong();\n long K = sc.nextLong();\n long res = 0;\n final long INF = (long)Math.pow(10, 9) + 7;\n for (long i = K; i <= N + 1; i++) {\n long min = (i - 1) * i / 2;\n long max = i * (N - i + 1) + (i - 1) * i / 2;\n res += max - min + 1;\n }\n System.out.println(res % INF);\n sc.close();\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "sample_input": "3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02708", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 520, "cpu_time_ms": 110, "memory_kb": 35720}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s134780718", "group_id": "codeNet:p02708", "input_text": "//import java.math.*;\nimport java.io.*;\nimport java.util.*;\n//import java.lang.*;\n\n//solution classes here\n\npublic class Main {\n\n //main solution here\n\n static Scanner sc = new Scanner(System.in);\n static PrintWriter out = new PrintWriter(System.out);\n static long mod = (long)1e9+7;\n static long MOD = 998244353;\n //static ArrayList list[] = new ArrayList[(int)1e4+1];\n //static int color[] = new int[(int)2e6+1];\n //static int visit[] = new int[(int)1e4+1];\n //static int level[] = new int[(int)1e4+1];\n //static Deque q = new ArrayDeque<>();\n\n public static void main(String[] args) throws IOException {\n int n = sc.nextInt();\n int k = sc.nextInt();\n long a[] = new long[n+2];\n a[1]=n+1;\n for(int i=2;i<=n+1;i++) {\n long min = ((i*(i-1))/2)%mod;\n long max = (mod+((n*(n+1))/2)%mod-((n-i+1)*(n-i)/2)%mod)%mod;\n a[i]=(mod+(max-min+1))%mod;\n }\n long sum=0;\n for(int i=k;i<=n+1;i++) {\n sum=(mod+sum+a[i])%mod;\n }\n\n out.println(sum);\n\n //out.println(\"Case #\"+(test-t)+\": \"+fh+\" \"+fv);\n out.flush();\n out.close();\n }\n\n //solution functions here\n\n\n //---templates---\n public static void reverse (long[] array) {\n int len = array.length;\n for(int i=0;i=value) {\n hi=mid-1;\n ans=mid;\n }\n else\n lo=mid+1;\n }\n return ans;\n }\n\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public Scanner(FileReader fileReader) {\n br = new BufferedReader(fileReader);\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n }\n}\n\n/* *****************************************************************************************************************************\n * I'M NOT IN DANGER, I'M THE DANGER!!!\n * *****************************************************************************************************************************\n */", "language": "Java", "metadata": {"date": 1587352728, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02708.html", "problem_id": "p02708", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02708/input.txt", "sample_output_relpath": "derived/input_output/data/p02708/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02708/Java/s134780718.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s134780718", "user_id": "u571785964"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "//import java.math.*;\nimport java.io.*;\nimport java.util.*;\n//import java.lang.*;\n\n//solution classes here\n\npublic class Main {\n\n //main solution here\n\n static Scanner sc = new Scanner(System.in);\n static PrintWriter out = new PrintWriter(System.out);\n static long mod = (long)1e9+7;\n static long MOD = 998244353;\n //static ArrayList list[] = new ArrayList[(int)1e4+1];\n //static int color[] = new int[(int)2e6+1];\n //static int visit[] = new int[(int)1e4+1];\n //static int level[] = new int[(int)1e4+1];\n //static Deque q = new ArrayDeque<>();\n\n public static void main(String[] args) throws IOException {\n int n = sc.nextInt();\n int k = sc.nextInt();\n long a[] = new long[n+2];\n a[1]=n+1;\n for(int i=2;i<=n+1;i++) {\n long min = ((i*(i-1))/2)%mod;\n long max = (mod+((n*(n+1))/2)%mod-((n-i+1)*(n-i)/2)%mod)%mod;\n a[i]=(mod+(max-min+1))%mod;\n }\n long sum=0;\n for(int i=k;i<=n+1;i++) {\n sum=(mod+sum+a[i])%mod;\n }\n\n out.println(sum);\n\n //out.println(\"Case #\"+(test-t)+\": \"+fh+\" \"+fv);\n out.flush();\n out.close();\n }\n\n //solution functions here\n\n\n //---templates---\n public static void reverse (long[] array) {\n int len = array.length;\n for(int i=0;i=value) {\n hi=mid-1;\n ans=mid;\n }\n else\n lo=mid+1;\n }\n return ans;\n }\n\n static class Scanner {\n StringTokenizer st;\n BufferedReader br;\n\n public Scanner(InputStream s) {\n br = new BufferedReader(new InputStreamReader(s));\n }\n\n public Scanner(FileReader fileReader) {\n br = new BufferedReader(fileReader);\n }\n\n public String next() throws IOException {\n while (st == null || !st.hasMoreTokens())\n st = new StringTokenizer(br.readLine());\n return st.nextToken();\n }\n\n public int nextInt() throws IOException {\n return Integer.parseInt(next());\n }\n\n public long nextLong() throws IOException {\n return Long.parseLong(next());\n }\n\n public String nextLine() throws IOException {\n return br.readLine();\n }\n\n public boolean ready() throws IOException {\n return br.ready();\n }\n }\n}\n\n/* *****************************************************************************************************************************\n * I'M NOT IN DANGER, I'M THE DANGER!!!\n * *****************************************************************************************************************************\n */", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "sample_input": "3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02708", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3527, "cpu_time_ms": 83, "memory_kb": 34476}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s312728547", "group_id": "codeNet:p02708", "input_text": "import java.util.*;\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tint MOD = 1_000_000_007;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tlong ans = 0;\n\t\tlong[] suml = new long[N+2];\n\t\tlong[] sumr = new long[N+2];\n\t\tfor(int i = 1; i <= N; i++) {\n\t\t\tsuml[i] = suml[i-1];\n\t\t\tsuml[i] += i;\n\t\t}\n\t\tfor(int i = N; i >= 0; i--) {\n\t\t\tsumr[i] = sumr[i+1];\n\t\t\tsumr[i] += i;\n\t\t}\n\t\tfor(int i = K; i <= N+1; i++) {\n\t\t\tans += sumr[N+1-i]-suml[i-1]+1;\n\t\t\tans %= MOD;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1587346877, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02708.html", "problem_id": "p02708", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02708/input.txt", "sample_output_relpath": "derived/input_output/data/p02708/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02708/Java/s312728547.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s312728547", "user_id": "u912599273"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tint MOD = 1_000_000_007;\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tlong ans = 0;\n\t\tlong[] suml = new long[N+2];\n\t\tlong[] sumr = new long[N+2];\n\t\tfor(int i = 1; i <= N; i++) {\n\t\t\tsuml[i] = suml[i-1];\n\t\t\tsuml[i] += i;\n\t\t}\n\t\tfor(int i = N; i >= 0; i--) {\n\t\t\tsumr[i] = sumr[i+1];\n\t\t\tsumr[i] += i;\n\t\t}\n\t\tfor(int i = K; i <= N+1; i++) {\n\t\t\tans += sumr[N+1-i]-suml[i-1]+1;\n\t\t\tans %= MOD;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "sample_input": "3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02708", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 551, "cpu_time_ms": 121, "memory_kb": 38856}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s571632021", "group_id": "codeNet:p02709", "input_text": "import java.util.*;\n\npublic class Main {\n void run() {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[][] arr = new int[n][2];\n for (int i = 0; i < n; i++) {\n arr[i] = new int[]{i, sc.nextInt()};\n }\n\n Arrays.sort(arr, (a1, a2) -> a2[1] - a1[1]);\n// debug(arr);\n\n long[][] dp = new long[n + 1][n + 1];\n for (long[] x : dp) {\n Arrays.fill(x, -1);\n }\n dp[0][0] = 0;\n // dp[i][j] ... 左からi人、右からj人並べた場合のうれしさの最大値\n\n for (int k = 0; k < n; k++) {\n int x = arr[k][0];\n long a = (long) arr[k][1];\n for (int i = 0; i <= k; i++) {\n int j = k - i;\n if (dp[i][j] == -1) continue;\n dp[i + 1][j] = Math.max(dp[i + 1][j], dp[i][j] + a * Math.abs(x - i));\n dp[i][j + 1] = Math.max(dp[i][j + 1], dp[i][j] + a * Math.abs((n - 1 - j) - x));\n }\n// debug(dp);\n }\n// debug(dp);\n long ans = -1;\n for (int i = 0; i <= n; i++) {\n ans = Math.max(ans, dp[i][n - i]);\n }\n System.out.println(ans);\n }\n\n void debug(Object... os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "language": "Java", "metadata": {"date": 1587355947, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02709.html", "problem_id": "p02709", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02709/input.txt", "sample_output_relpath": "derived/input_output/data/p02709/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02709/Java/s571632021.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s571632021", "user_id": "u149419355"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n void run() {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[][] arr = new int[n][2];\n for (int i = 0; i < n; i++) {\n arr[i] = new int[]{i, sc.nextInt()};\n }\n\n Arrays.sort(arr, (a1, a2) -> a2[1] - a1[1]);\n// debug(arr);\n\n long[][] dp = new long[n + 1][n + 1];\n for (long[] x : dp) {\n Arrays.fill(x, -1);\n }\n dp[0][0] = 0;\n // dp[i][j] ... 左からi人、右からj人並べた場合のうれしさの最大値\n\n for (int k = 0; k < n; k++) {\n int x = arr[k][0];\n long a = (long) arr[k][1];\n for (int i = 0; i <= k; i++) {\n int j = k - i;\n if (dp[i][j] == -1) continue;\n dp[i + 1][j] = Math.max(dp[i + 1][j], dp[i][j] + a * Math.abs(x - i));\n dp[i][j + 1] = Math.max(dp[i][j + 1], dp[i][j] + a * Math.abs((n - 1 - j) - x));\n }\n// debug(dp);\n }\n// debug(dp);\n long ans = -1;\n for (int i = 0; i <= n; i++) {\n ans = Math.max(ans, dp[i][n - i]);\n }\n System.out.println(ans);\n }\n\n void debug(Object... os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N children standing in a line from left to right. The activeness of the i-th child from the left is A_i.\n\nYou can rearrange these children just one time in any order you like.\n\nWhen a child who originally occupies the x-th position from the left in the line moves to the y-th position from the left, that child earns A_x \\times |x-y| happiness points.\n\nFind the maximum total happiness points the children can earn.\n\nConstraints\n\n2 \\leq N \\leq 2000\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum total happiness points the children can earn.\n\nSample Input 1\n\n4\n1 3 4 2\n\nSample Output 1\n\n20\n\nIf we move the 1-st child from the left to the 3-rd position from the left, the 2-nd child to the 4-th position, the 3-rd child to the 1-st position, and the 4-th child to the 2-nd position, the children earns 1 \\times |1-3|+3 \\times |2-4|+4 \\times |3-1|+2 \\times |4-2|=20 happiness points in total.\n\nSample Input 2\n\n6\n5 5 6 1 1 1\n\nSample Output 2\n\n58\n\nSample Input 3\n\n6\n8 6 9 1 2 1\n\nSample Output 3\n\n85", "sample_input": "4\n1 3 4 2\n"}, "reference_outputs": ["20\n"], "source_document_id": "p02709", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N children standing in a line from left to right. The activeness of the i-th child from the left is A_i.\n\nYou can rearrange these children just one time in any order you like.\n\nWhen a child who originally occupies the x-th position from the left in the line moves to the y-th position from the left, that child earns A_x \\times |x-y| happiness points.\n\nFind the maximum total happiness points the children can earn.\n\nConstraints\n\n2 \\leq N \\leq 2000\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum total happiness points the children can earn.\n\nSample Input 1\n\n4\n1 3 4 2\n\nSample Output 1\n\n20\n\nIf we move the 1-st child from the left to the 3-rd position from the left, the 2-nd child to the 4-th position, the 3-rd child to the 1-st position, and the 4-th child to the 2-nd position, the children earns 1 \\times |1-3|+3 \\times |2-4|+4 \\times |3-1|+2 \\times |4-2|=20 happiness points in total.\n\nSample Input 2\n\n6\n5 5 6 1 1 1\n\nSample Output 2\n\n58\n\nSample Input 3\n\n6\n8 6 9 1 2 1\n\nSample Output 3\n\n85", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1392, "cpu_time_ms": 269, "memory_kb": 84264}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s368448475", "group_id": "codeNet:p02712", "input_text": "import java.util.Scanner;\n\n\npublic class Main {\n\n\n\tfinal int MOD = 1000000007;\n\n\n\tpublic static void main(String[] args) {\n\n\t\tlong ans = 0;\n\t\tScanner sc = new Scanner(System.in);\n\t\tboolean f = false;\n\n\t\tint n = sc.nextInt();\n//\t\tint k = sc.nextInt();\n\n\t\t//-------------------------------------------------------------------------------------\n\n\t\tfor(int i =0; i < n; i++) {\n\t\t\tif(i%3 != 0 && i%5 != 0) {\n\t\t\t\tif(i%3 != 0) {\n\t\t\t\t\tif(i%5 != 0) {\n\t\t\t\t\t\tans += i;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\t//-------------------------------------------------------------------------------------\n\n//\t\tif(f) {\n//\t\t\tSystem.out.println(\"Yes\");\n//\t\t} else {\n//\t\t\tSystem.out.println(\"No\");\n//\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1586741414, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02712/input.txt", "sample_output_relpath": "derived/input_output/data/p02712/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02712/Java/s368448475.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s368448475", "user_id": "u357504399"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "import java.util.Scanner;\n\n\npublic class Main {\n\n\n\tfinal int MOD = 1000000007;\n\n\n\tpublic static void main(String[] args) {\n\n\t\tlong ans = 0;\n\t\tScanner sc = new Scanner(System.in);\n\t\tboolean f = false;\n\n\t\tint n = sc.nextInt();\n//\t\tint k = sc.nextInt();\n\n\t\t//-------------------------------------------------------------------------------------\n\n\t\tfor(int i =0; i < n; i++) {\n\t\t\tif(i%3 != 0 && i%5 != 0) {\n\t\t\t\tif(i%3 != 0) {\n\t\t\t\t\tif(i%5 != 0) {\n\t\t\t\t\t\tans += i;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\t//-------------------------------------------------------------------------------------\n\n//\t\tif(f) {\n//\t\t\tSystem.out.println(\"Yes\");\n//\t\t} else {\n//\t\t\tSystem.out.println(\"No\");\n//\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet us define the FizzBuzz sequence a_1,a_2,... as follows:\n\nIf both 3 and 5 divides i, a_i=\\mbox{FizzBuzz}.\n\nIf the above does not hold but 3 divides i, a_i=\\mbox{Fizz}.\n\nIf none of the above holds but 5 divides i, a_i=\\mbox{Buzz}.\n\nIf none of the above holds, a_i=i.\n\nFind the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n60\n\nThe first 15 terms of the FizzBuzz sequence are:\n\n1,2,\\mbox{Fizz},4,\\mbox{Buzz},\\mbox{Fizz},7,8,\\mbox{Fizz},\\mbox{Buzz},11,\\mbox{Fizz},13,14,\\mbox{FizzBuzz}\n\nAmong them, numbers are 1,2,4,7,8,11,13,14, and the sum of them is 60.\n\nSample Input 2\n\n1000000\n\nSample Output 2\n\n266666333332\n\nWatch out for overflow.", "sample_input": "15\n"}, "reference_outputs": ["60\n"], "source_document_id": "p02712", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet us define the FizzBuzz sequence a_1,a_2,... as follows:\n\nIf both 3 and 5 divides i, a_i=\\mbox{FizzBuzz}.\n\nIf the above does not hold but 3 divides i, a_i=\\mbox{Fizz}.\n\nIf none of the above holds but 5 divides i, a_i=\\mbox{Buzz}.\n\nIf none of the above holds, a_i=i.\n\nFind the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n60\n\nThe first 15 terms of the FizzBuzz sequence are:\n\n1,2,\\mbox{Fizz},4,\\mbox{Buzz},\\mbox{Fizz},7,8,\\mbox{Fizz},\\mbox{Buzz},11,\\mbox{Fizz},13,14,\\mbox{FizzBuzz}\n\nAmong them, numbers are 1,2,4,7,8,11,13,14, and the sum of them is 60.\n\nSample Input 2\n\n1000000\n\nSample Output 2\n\n266666333332\n\nWatch out for overflow.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 714, "cpu_time_ms": 135, "memory_kb": 35808}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s785430438", "group_id": "codeNet:p02712", "input_text": "import java.util.*;\npublic class Main{\npublic static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n long m = 0 ;\n for(long i = 0;in){\n long k= Math.abs(m-n);\n if(k>=n){\n System.out.println(n);\n }\n else{\n System.out.println(k);\n }\n }else if(m==n){\n System.out.println(0);\n } else {\n \t if(m==0) {\n \t\t System.out.println(n);\n \t }else {\n long l = n/m;\n long rem = n%m;\n long x = Math.abs(rem-m);\n if(x>=rem){\n System.out.println(rem);\n }\n else{\n System.out.println(x);\n }\n \t }\n }\n \n \n \n \n \n \n }\n}\n \n", "language": "Java", "metadata": {"date": 1586053032, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p02719.html", "problem_id": "p02719", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02719/input.txt", "sample_output_relpath": "derived/input_output/data/p02719/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02719/Java/s608632873.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s608632873", "user_id": "u312964891"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\npublic class Main {\n public static void main(String[] args) throws Exception{\n \n Scanner sc = new Scanner(System.in);\n \n long n;\n long m;\n\n n = sc.nextLong();\n m = sc.nextLong();\n \n if(m>n){\n long k= Math.abs(m-n);\n if(k>=n){\n System.out.println(n);\n }\n else{\n System.out.println(k);\n }\n }else if(m==n){\n System.out.println(0);\n } else {\n \t if(m==0) {\n \t\t System.out.println(n);\n \t }else {\n long l = n/m;\n long rem = n%m;\n long x = Math.abs(rem-m);\n if(x>=rem){\n System.out.println(rem);\n }\n else{\n System.out.println(x);\n }\n \t }\n }\n \n \n \n \n \n \n }\n}\n \n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "sample_input": "7 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02719", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 860, "cpu_time_ms": 96, "memory_kb": 20948}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s249840920", "group_id": "codeNet:p02719", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong n = sc.nextLong();\n\t\tlong k = sc.nextLong();\n\t\tif(n > k) {\n\t\t\tn -= k * (n/k);\n\t\t\tif(k -n < n) {\n\t\t\t\tSystem.out.println(k-n);\n\t\t\t}else {\n\t\t\t\tSystem.out.println(n);\n\t\t\t}\n\t\t}else {\n\t\t\tif(k -n < n) {\n\t\t\t\tSystem.out.println(k-n);\n\t\t\t}else {\n\t\t\t\tSystem.out.println(n);\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1586051449, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02719.html", "problem_id": "p02719", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02719/input.txt", "sample_output_relpath": "derived/input_output/data/p02719/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02719/Java/s249840920.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s249840920", "user_id": "u268132693"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong n = sc.nextLong();\n\t\tlong k = sc.nextLong();\n\t\tif(n > k) {\n\t\t\tn -= k * (n/k);\n\t\t\tif(k -n < n) {\n\t\t\t\tSystem.out.println(k-n);\n\t\t\t}else {\n\t\t\t\tSystem.out.println(n);\n\t\t\t}\n\t\t}else {\n\t\t\tif(k -n < n) {\n\t\t\t\tSystem.out.println(k-n);\n\t\t\t}else {\n\t\t\t\tSystem.out.println(n);\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "sample_input": "7 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02719", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 414, "cpu_time_ms": 95, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s704046890", "group_id": "codeNet:p02719", "input_text": "import java.io.*;\nimport java.util.*;\nimport java.lang.*;\nimport java.math.BigInteger; \npublic class Main{\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n solve(in, out);\n out.close();\n }\n static int L,R,top,bottom;\n // static int ans;\n public static void solve(InputReader sc, PrintWriter pw) {\n // int t=sc.nextInt();\n int t=1;\n u:while(t-->0){\n long n=sc.nextLong();\n long m=sc.nextLong();\n if(n==0){\n pw.println(m);\n continue u;\n }\n if(n==m){\n pw.println(0);\n continue u;\n }\n if(n>m){\n n=m+n%m;\n pw.println(Math.min(n-m,m+m-n));\n continue u;\n }\n pw.println(Math.min(m-n,n));\n }\n }\n public static void swap(char []chrr, int i, int j){\n char temp=chrr[i];\n chrr[i]=chrr[j];\n chrr[j]=temp;\n }\n public static int num(int n){\n int a=0;\n while(n>0){\n a+=(n&1);\n n>>=1;\n }\n return a;\n }\n static class Pair{\n int u, v,i,val;\n Pair(int a,int b, int i){\n this.u=a;\n this.v=b;\n this.i=i;\n } \n }\n // public int compareTo(Pair p){\n // return (b-p.b);\n // }\n // public int hashCode(){\n // int hashcode = (a+\" \"+b).hashCode();\n // return hashcode;\n // }\n \n // public boolean equals(Object obj){\n // if (obj instanceof Pair) {\n // Pair p = (Pair) obj;\n // return (p.a==this.a && p.b == this.b);\n // }\n // return false;\n // }\n \n static boolean isPrime(int n) { \n if (n <= 1) \n return false; \n if (n <= 3) \n return true; \n if (n % 2 == 0 || n % 3 == 0) \n return false; \n for (int i = 5; i * i <= n; i = i + 6) \n if (n % i == 0 || n % (i + 2) == 0) \n return false; \n return true; \n } \n static long gcd(long a, long b) { \n if (b == 0) \n return a; \n return a>b?gcd(b, a % b):gcd(a, b % a); \n } \n static long fast_pow(long base,long n,long M){\n if(n==0)\n return 1;\n if(n==1)\n return base;\n long halfn=fast_pow(base,n/2,M);\n if(n%2==0)\n return ( halfn * halfn ) % M;\n else\n return ( ( ( halfn * halfn ) % M ) * base ) % M;\n }\n static long modInverse(long n,long M){\n return fast_pow(n,M-2,M);\n }\n public static void feedArr(long []arr,InputReader sc){\n for(int i=0;i0){\n long n=sc.nextLong();\n long m=sc.nextLong();\n if(n==0){\n pw.println(m);\n continue u;\n }\n if(n==m){\n pw.println(0);\n continue u;\n }\n if(n>m){\n n=m+n%m;\n pw.println(Math.min(n-m,m+m-n));\n continue u;\n }\n pw.println(Math.min(m-n,n));\n }\n }\n public static void swap(char []chrr, int i, int j){\n char temp=chrr[i];\n chrr[i]=chrr[j];\n chrr[j]=temp;\n }\n public static int num(int n){\n int a=0;\n while(n>0){\n a+=(n&1);\n n>>=1;\n }\n return a;\n }\n static class Pair{\n int u, v,i,val;\n Pair(int a,int b, int i){\n this.u=a;\n this.v=b;\n this.i=i;\n } \n }\n // public int compareTo(Pair p){\n // return (b-p.b);\n // }\n // public int hashCode(){\n // int hashcode = (a+\" \"+b).hashCode();\n // return hashcode;\n // }\n \n // public boolean equals(Object obj){\n // if (obj instanceof Pair) {\n // Pair p = (Pair) obj;\n // return (p.a==this.a && p.b == this.b);\n // }\n // return false;\n // }\n \n static boolean isPrime(int n) { \n if (n <= 1) \n return false; \n if (n <= 3) \n return true; \n if (n % 2 == 0 || n % 3 == 0) \n return false; \n for (int i = 5; i * i <= n; i = i + 6) \n if (n % i == 0 || n % (i + 2) == 0) \n return false; \n return true; \n } \n static long gcd(long a, long b) { \n if (b == 0) \n return a; \n return a>b?gcd(b, a % b):gcd(a, b % a); \n } \n static long fast_pow(long base,long n,long M){\n if(n==0)\n return 1;\n if(n==1)\n return base;\n long halfn=fast_pow(base,n/2,M);\n if(n%2==0)\n return ( halfn * halfn ) % M;\n else\n return ( ( ( halfn * halfn ) % M ) * base ) % M;\n }\n static long modInverse(long n,long M){\n return fast_pow(n,M-2,M);\n }\n public static void feedArr(long []arr,InputReader sc){\n for(int i=0;i ts = new TreeSet<>();\n while (!ts.contains(N)) {\n ts.add(N);\n N = Math.abs(N - K);\n }\n\n hp.println(ts.first());\n }\n\n timer.cancel();\n hp.flush();\n }\n\n}\n\nclass Helper {\n final long MOD;\n final int MAXN;\n final Random rnd;\n\n public Helper(long mod, int maxn) {\n MOD = mod;\n MAXN = maxn;\n rnd = new Random();\n }\n\n\n public static int[] sieve;\n public static ArrayList primes;\n\n public void setSieve() {\n primes = new ArrayList<>();\n sieve = new int[MAXN];\n int i, j;\n for (i = 2; i < MAXN; ++i)\n if (sieve[i] == 0) {\n primes.add(i);\n for (j = i; j < MAXN; j += i) {\n sieve[j] = i;\n }\n }\n }\n\n\n public static long[] factorial;\n\n public void setFactorial() {\n factorial = new long[MAXN];\n factorial[0] = 1;\n for (int i = 1; i < MAXN; ++i) factorial[i] = factorial[i - 1] * i % MOD;\n }\n\n public long getFactorial(int n) {\n if (factorial == null) setFactorial();\n return factorial[n];\n }\n\n public long ncr(int n, int r) {\n if (r > n) return 0;\n if (factorial == null) setFactorial();\n long numerator = factorial[n];\n long denominator = factorial[r] * factorial[n - r] % MOD;\n return numerator * pow(denominator, MOD - 2, MOD) % MOD;\n }\n\n\n public long[] getLongArray(int size) throws Exception {\n long[] ar = new long[size];\n for (int i = 0; i < size; ++i) ar[i] = nextLong();\n return ar;\n }\n\n public int[] getIntArray(int size) throws Exception {\n int[] ar = new int[size];\n for (int i = 0; i < size; ++i) ar[i] = nextInt();\n return ar;\n }\n\n public String[] getStringArray(int size) throws Exception {\n String[] ar = new String[size];\n for (int i = 0; i < size; ++i) ar[i] = next();\n return ar;\n }\n\n public String joinElements(long... ar) {\n StringBuilder sb = new StringBuilder();\n for (long itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n\n public String joinElements(int... ar) {\n StringBuilder sb = new StringBuilder();\n for (int itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n public String joinElements(String... ar) {\n StringBuilder sb = new StringBuilder();\n for (String itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n public String joinElements(Object... ar) {\n StringBuilder sb = new StringBuilder();\n for (Object itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n\n public long gcd(long a, long b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n public int gcd(int a, int b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n\n public long max(long... ar) {\n long ret = ar[0];\n for (long itr : ar) ret = Math.max(ret, itr);\n return ret;\n }\n\n public int max(int... ar) {\n int ret = ar[0];\n for (int itr : ar) ret = Math.max(ret, itr);\n return ret;\n }\n\n public long min(long... ar) {\n long ret = ar[0];\n for (long itr : ar) ret = Math.min(ret, itr);\n return ret;\n }\n\n public int min(int... ar) {\n int ret = ar[0];\n for (int itr : ar) ret = Math.min(ret, itr);\n return ret;\n }\n\n\n public long sum(long... ar) {\n long sum = 0;\n for (long itr : ar) sum += itr;\n return sum;\n }\n\n public long sum(int... ar) {\n long sum = 0;\n for (int itr : ar) sum += itr;\n return sum;\n }\n\n public void shuffle(int[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = rnd.nextInt(ar.length);\n if (r != i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void shuffle(long[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = rnd.nextInt(ar.length);\n if (r != i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void reverse(int[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = ar.length - 1 - i;\n if (r > i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void reverse(long[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = ar.length - 1 - i;\n if (r > i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public long pow(long base, long exp, long MOD) {\n base %= MOD;\n long ret = 1;\n while (exp > 0) {\n if ((exp & 1) == 1) ret = ret * base % MOD;\n base = base * base % MOD;\n exp >>= 1;\n }\n return ret;\n }\n\n\n static final int BUFSIZE = 1 << 20;\n static byte[] buf;\n static int index, total;\n static InputStream in;\n static BufferedWriter bw;\n\n\n public void initIO(InputStream is, OutputStream os) {\n try {\n in = is;\n bw = new BufferedWriter(new OutputStreamWriter(os));\n buf = new byte[BUFSIZE];\n } catch (Exception e) {\n }\n }\n\n public void initIO(String inputFile, String outputFile) {\n try {\n in = new FileInputStream(inputFile);\n bw = new BufferedWriter(new OutputStreamWriter(\n new FileOutputStream(outputFile)));\n buf = new byte[BUFSIZE];\n } catch (Exception e) {\n }\n }\n\n private int scan() throws Exception {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0)\n return -1;\n }\n return buf[index++];\n }\n\n public String next() throws Exception {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan())\n sb.append((char) c);\n return sb.toString();\n }\n\n public int nextInt() throws Exception {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+')\n c = scan();\n for (; c >= '0' && c <= '9'; c = scan())\n val = (val << 3) + (val << 1) + (c & 15);\n return neg ? -val : val;\n }\n\n public long nextLong() throws Exception {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+')\n c = scan();\n for (; c >= '0' && c <= '9'; c = scan())\n val = (val << 3) + (val << 1) + (c & 15);\n return neg ? -val : val;\n }\n\n public void print(Object a) throws Exception {\n bw.write(a.toString());\n }\n\n public void printsp(Object a) throws Exception {\n print(a);\n print(\" \");\n }\n\n public void println() throws Exception {\n bw.write(\"\\n\");\n }\n\n public void println(Object a) throws Exception {\n print(a);\n println();\n }\n\n public void flush() throws Exception {\n bw.flush();\n }\n}\n", "language": "Java", "metadata": {"date": 1586049185, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02719.html", "problem_id": "p02719", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02719/input.txt", "sample_output_relpath": "derived/input_output/data/p02719/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02719/Java/s915870457.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s915870457", "user_id": "u481050822"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.math.*;\nimport java.io.*;\nimport java.util.*;\nimport java.awt.*;\n\npublic class Main implements Runnable {\n @Override\n public void run() {\n try {\n new Solver().solve();\n System.exit(0);\n } catch (Exception | Error e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n public static void main(String[] args) {\n //new Thread(null, new Main(), \"Solver\", 1l << 25).start();\n new Main().run();\n }\n}\n\n\nclass Solver {\n final Helper hp;\n final int MAXN = 1000_006;\n final long MOD = (long) 1e9 + 7;\n\n final Timer timer;\n final TimerTask task;\n\n Solver() {\n hp = new Helper(MOD, MAXN);\n hp.initIO(System.in, System.out);\n\n timer = new Timer();\n task = new TimerTask() {\n @Override\n public void run() {\n try {\n hp.flush();\n System.exit(0);\n } catch (Exception e) {\n }\n }\n };\n //timer.schedule(task, 4700);\n }\n\n\n void solve() throws Exception {\n int i, j, k;\n boolean testCases = false;\n\n int tc = testCases ? hp.nextInt() : 1;\n for (int tce = 1; tce <= tc; tce++) {\n long N = hp.nextLong(), K = hp.nextLong();\n N %= K;\n\n TreeSet ts = new TreeSet<>();\n while (!ts.contains(N)) {\n ts.add(N);\n N = Math.abs(N - K);\n }\n\n hp.println(ts.first());\n }\n\n timer.cancel();\n hp.flush();\n }\n\n}\n\nclass Helper {\n final long MOD;\n final int MAXN;\n final Random rnd;\n\n public Helper(long mod, int maxn) {\n MOD = mod;\n MAXN = maxn;\n rnd = new Random();\n }\n\n\n public static int[] sieve;\n public static ArrayList primes;\n\n public void setSieve() {\n primes = new ArrayList<>();\n sieve = new int[MAXN];\n int i, j;\n for (i = 2; i < MAXN; ++i)\n if (sieve[i] == 0) {\n primes.add(i);\n for (j = i; j < MAXN; j += i) {\n sieve[j] = i;\n }\n }\n }\n\n\n public static long[] factorial;\n\n public void setFactorial() {\n factorial = new long[MAXN];\n factorial[0] = 1;\n for (int i = 1; i < MAXN; ++i) factorial[i] = factorial[i - 1] * i % MOD;\n }\n\n public long getFactorial(int n) {\n if (factorial == null) setFactorial();\n return factorial[n];\n }\n\n public long ncr(int n, int r) {\n if (r > n) return 0;\n if (factorial == null) setFactorial();\n long numerator = factorial[n];\n long denominator = factorial[r] * factorial[n - r] % MOD;\n return numerator * pow(denominator, MOD - 2, MOD) % MOD;\n }\n\n\n public long[] getLongArray(int size) throws Exception {\n long[] ar = new long[size];\n for (int i = 0; i < size; ++i) ar[i] = nextLong();\n return ar;\n }\n\n public int[] getIntArray(int size) throws Exception {\n int[] ar = new int[size];\n for (int i = 0; i < size; ++i) ar[i] = nextInt();\n return ar;\n }\n\n public String[] getStringArray(int size) throws Exception {\n String[] ar = new String[size];\n for (int i = 0; i < size; ++i) ar[i] = next();\n return ar;\n }\n\n public String joinElements(long... ar) {\n StringBuilder sb = new StringBuilder();\n for (long itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n\n public String joinElements(int... ar) {\n StringBuilder sb = new StringBuilder();\n for (int itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n public String joinElements(String... ar) {\n StringBuilder sb = new StringBuilder();\n for (String itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n public String joinElements(Object... ar) {\n StringBuilder sb = new StringBuilder();\n for (Object itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n\n public long gcd(long a, long b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n public int gcd(int a, int b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n\n public long max(long... ar) {\n long ret = ar[0];\n for (long itr : ar) ret = Math.max(ret, itr);\n return ret;\n }\n\n public int max(int... ar) {\n int ret = ar[0];\n for (int itr : ar) ret = Math.max(ret, itr);\n return ret;\n }\n\n public long min(long... ar) {\n long ret = ar[0];\n for (long itr : ar) ret = Math.min(ret, itr);\n return ret;\n }\n\n public int min(int... ar) {\n int ret = ar[0];\n for (int itr : ar) ret = Math.min(ret, itr);\n return ret;\n }\n\n\n public long sum(long... ar) {\n long sum = 0;\n for (long itr : ar) sum += itr;\n return sum;\n }\n\n public long sum(int... ar) {\n long sum = 0;\n for (int itr : ar) sum += itr;\n return sum;\n }\n\n public void shuffle(int[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = rnd.nextInt(ar.length);\n if (r != i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void shuffle(long[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = rnd.nextInt(ar.length);\n if (r != i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void reverse(int[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = ar.length - 1 - i;\n if (r > i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void reverse(long[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = ar.length - 1 - i;\n if (r > i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public long pow(long base, long exp, long MOD) {\n base %= MOD;\n long ret = 1;\n while (exp > 0) {\n if ((exp & 1) == 1) ret = ret * base % MOD;\n base = base * base % MOD;\n exp >>= 1;\n }\n return ret;\n }\n\n\n static final int BUFSIZE = 1 << 20;\n static byte[] buf;\n static int index, total;\n static InputStream in;\n static BufferedWriter bw;\n\n\n public void initIO(InputStream is, OutputStream os) {\n try {\n in = is;\n bw = new BufferedWriter(new OutputStreamWriter(os));\n buf = new byte[BUFSIZE];\n } catch (Exception e) {\n }\n }\n\n public void initIO(String inputFile, String outputFile) {\n try {\n in = new FileInputStream(inputFile);\n bw = new BufferedWriter(new OutputStreamWriter(\n new FileOutputStream(outputFile)));\n buf = new byte[BUFSIZE];\n } catch (Exception e) {\n }\n }\n\n private int scan() throws Exception {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0)\n return -1;\n }\n return buf[index++];\n }\n\n public String next() throws Exception {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan())\n sb.append((char) c);\n return sb.toString();\n }\n\n public int nextInt() throws Exception {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+')\n c = scan();\n for (; c >= '0' && c <= '9'; c = scan())\n val = (val << 3) + (val << 1) + (c & 15);\n return neg ? -val : val;\n }\n\n public long nextLong() throws Exception {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+')\n c = scan();\n for (; c >= '0' && c <= '9'; c = scan())\n val = (val << 3) + (val << 1) + (c & 15);\n return neg ? -val : val;\n }\n\n public void print(Object a) throws Exception {\n bw.write(a.toString());\n }\n\n public void printsp(Object a) throws Exception {\n print(a);\n print(\" \");\n }\n\n public void println() throws Exception {\n bw.write(\"\\n\");\n }\n\n public void println(Object a) throws Exception {\n print(a);\n println();\n }\n\n public void flush() throws Exception {\n bw.flush();\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "sample_input": "7 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02719", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8930, "cpu_time_ms": 79, "memory_kb": 24020}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s333594297", "group_id": "codeNet:p02722", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.StringJoiner;\nimport java.util.StringTokenizer;\nimport java.util.function.IntUnaryOperator;\nimport java.util.function.LongUnaryOperator;\n\npublic class Main {\n static In in = new In();\n static Out out = new Out();\n static long mod = 1000000007;\n static long inf = 0xfffffffffffffffL;\n\n void solve() {\n long n = in.nextLong();\n long ans = 0;\n Map primeFactors2 = getPrimeFactors(n - 1);\n for (long p = 2; p * p < n; p++) {\n if (n % p == 0) {\n if (check(p, n)) {\n ans++;\n }\n if (check(n / p, n)) {\n ans++;\n }\n }\n }\n long a1 = 1;\n for (Map.Entry entry : primeFactors2.entrySet()) {\n a1 *= entry.getValue() + 1;\n }\n out.println(a1 + ans);\n }\n\n static boolean check(long p, long n) {\n while (n % p == 0) {\n n /= p;\n if (n % p == 1) {\n return true;\n }\n }\n return false;\n }\n\n static Map getPrimeFactors(long n) {\n Map primeFactors = new HashMap<>();\n long c = n;\n for (long i = 2; i * i <= n && 1 < c; i++) {\n int count = 0;\n while (c % i == 0) {\n count++;\n c /= i;\n }\n if (count > 0) {\n primeFactors.put(i, count);\n }\n }\n if (c > 1) {\n primeFactors.put(c, 1);\n }\n return primeFactors;\n }\n\n public static void main(String[]$) {\n new Main().solve();\n out.flush();\n }\n}\n\nclass In {\n private BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);\n private StringTokenizer tokenizer;\n\n String next() {\n try {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n } catch (IOException ignored) {\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n char[][] nextCharArray(int n, int m) {\n char[][] a = new char[n][m];\n for (int i = 0; i < n; i++) {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n int[] nextIntArray(int n, IntUnaryOperator op) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsInt(nextInt());\n }\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n\n long[] nextLongArray(int n, LongUnaryOperator op) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsLong(nextLong());\n }\n return a;\n }\n}\n\nclass Out {\n private PrintWriter out = new PrintWriter(System.out);\n boolean autoFlush = false;\n\n void println(Object... a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (Object obj : a) {\n joiner.add(String.valueOf(obj));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(int[] a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (int i : a) {\n joiner.add(Integer.toString(i));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(long[] a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (long i : a) {\n joiner.add(Long.toString(i));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void flush() {\n out.flush();\n }\n}\n", "language": "Java", "metadata": {"date": 1586053592, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02722.html", "problem_id": "p02722", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02722/input.txt", "sample_output_relpath": "derived/input_output/data/p02722/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02722/Java/s333594297.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s333594297", "user_id": "u981808900"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.StringJoiner;\nimport java.util.StringTokenizer;\nimport java.util.function.IntUnaryOperator;\nimport java.util.function.LongUnaryOperator;\n\npublic class Main {\n static In in = new In();\n static Out out = new Out();\n static long mod = 1000000007;\n static long inf = 0xfffffffffffffffL;\n\n void solve() {\n long n = in.nextLong();\n long ans = 0;\n Map primeFactors2 = getPrimeFactors(n - 1);\n for (long p = 2; p * p < n; p++) {\n if (n % p == 0) {\n if (check(p, n)) {\n ans++;\n }\n if (check(n / p, n)) {\n ans++;\n }\n }\n }\n long a1 = 1;\n for (Map.Entry entry : primeFactors2.entrySet()) {\n a1 *= entry.getValue() + 1;\n }\n out.println(a1 + ans);\n }\n\n static boolean check(long p, long n) {\n while (n % p == 0) {\n n /= p;\n if (n % p == 1) {\n return true;\n }\n }\n return false;\n }\n\n static Map getPrimeFactors(long n) {\n Map primeFactors = new HashMap<>();\n long c = n;\n for (long i = 2; i * i <= n && 1 < c; i++) {\n int count = 0;\n while (c % i == 0) {\n count++;\n c /= i;\n }\n if (count > 0) {\n primeFactors.put(i, count);\n }\n }\n if (c > 1) {\n primeFactors.put(c, 1);\n }\n return primeFactors;\n }\n\n public static void main(String[]$) {\n new Main().solve();\n out.flush();\n }\n}\n\nclass In {\n private BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);\n private StringTokenizer tokenizer;\n\n String next() {\n try {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n tokenizer = new StringTokenizer(reader.readLine());\n }\n } catch (IOException ignored) {\n }\n return tokenizer.nextToken();\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n char[][] nextCharArray(int n, int m) {\n char[][] a = new char[n][m];\n for (int i = 0; i < n; i++) {\n a[i] = next().toCharArray();\n }\n return a;\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n }\n return a;\n }\n\n int[] nextIntArray(int n, IntUnaryOperator op) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsInt(nextInt());\n }\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = nextLong();\n }\n return a;\n }\n\n long[] nextLongArray(int n, LongUnaryOperator op) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++) {\n a[i] = op.applyAsLong(nextLong());\n }\n return a;\n }\n}\n\nclass Out {\n private PrintWriter out = new PrintWriter(System.out);\n boolean autoFlush = false;\n\n void println(Object... a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (Object obj : a) {\n joiner.add(String.valueOf(obj));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(int[] a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (int i : a) {\n joiner.add(Integer.toString(i));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void println(long[] a) {\n StringJoiner joiner = new StringJoiner(\" \");\n for (long i : a) {\n joiner.add(Long.toString(i));\n }\n out.println(joiner);\n if (autoFlush) {\n out.flush();\n }\n }\n\n void flush() {\n out.flush();\n }\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nWe will choose an integer K between 2 and N (inclusive), then we will repeat the operation below until N becomes less than K.\n\nOperation: if K divides N, replace N with N/K; otherwise, replace N with N-K.\n\nIn how many choices of K will N become 1 in the end?\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of choices of K in which N becomes 1 in the end.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\nThere are three choices of K in which N becomes 1 in the end: 2, 5, and 6.\n\nIn each of these choices, N will change as follows:\n\nWhen K=2: 6 \\to 3 \\to 1\n\nWhen K=5: 6 \\to 1\n\nWhen K=6: 6 \\to 1\n\nSample Input 2\n\n3141\n\nSample Output 2\n\n13\n\nSample Input 3\n\n314159265358\n\nSample Output 3\n\n9", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02722", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nWe will choose an integer K between 2 and N (inclusive), then we will repeat the operation below until N becomes less than K.\n\nOperation: if K divides N, replace N with N/K; otherwise, replace N with N-K.\n\nIn how many choices of K will N become 1 in the end?\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of choices of K in which N becomes 1 in the end.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\nThere are three choices of K in which N becomes 1 in the end: 2, 5, and 6.\n\nIn each of these choices, N will change as follows:\n\nWhen K=2: 6 \\to 3 \\to 1\n\nWhen K=5: 6 \\to 1\n\nWhen K=6: 6 \\to 1\n\nSample Input 2\n\n3141\n\nSample Output 2\n\n13\n\nSample Input 3\n\n314159265358\n\nSample Output 3\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4320, "cpu_time_ms": 106, "memory_kb": 22484}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s436313705", "group_id": "codeNet:p02723", "input_text": "import java.util.*;\n\npublic class Main {\n\n\t\n\t// test #A\n//\tpublic static void main(String args[]) {\n//\t\tSystem.out.println(\"staring #1\");\n//\t\tScanner sc = new Scanner(System.in);\n//\t\t\n//\t\tint a = sc.nextInt();\n//\t\t\n//\t\tint b = sc.nextInt();\n//\t\tint c = sc.nextInt();\n//\t\tString s = sc.next();\n//\t\t\n//\t\tSystem.out.println(a+b+c+\" \"+s);\n//\t\tsc.close();\n//\t}\n\n\t// test #1 0322\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tString input = sc.next();\t\t\n\t\t\n\t\tchar array[] = input.toCharArray();\n\t\t\n\t\tboolean like = false;\n\t\t\n\t\tif ( (array[2] == array[3]) && (array[4]==array[5] ) )\n\t\t\tlike = true;\n\t\t\n\t\t\n\t\tlog( like ? \"yes\" : \"no\" );\n\t\tsc.close();\n\t}\n\n\tstatic void log(String s) {\n\t\tSystem.out.println(s);\n\t}\n\n\tstatic void log(int i) {\n\t\tSystem.out.println(i);\n\t}\n\t\n}\n", "language": "Java", "metadata": {"date": 1585444130, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02723.html", "problem_id": "p02723", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02723/input.txt", "sample_output_relpath": "derived/input_output/data/p02723/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02723/Java/s436313705.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s436313705", "user_id": "u717615828"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n\t\n\t// test #A\n//\tpublic static void main(String args[]) {\n//\t\tSystem.out.println(\"staring #1\");\n//\t\tScanner sc = new Scanner(System.in);\n//\t\t\n//\t\tint a = sc.nextInt();\n//\t\t\n//\t\tint b = sc.nextInt();\n//\t\tint c = sc.nextInt();\n//\t\tString s = sc.next();\n//\t\t\n//\t\tSystem.out.println(a+b+c+\" \"+s);\n//\t\tsc.close();\n//\t}\n\n\t// test #1 0322\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tString input = sc.next();\t\t\n\t\t\n\t\tchar array[] = input.toCharArray();\n\t\t\n\t\tboolean like = false;\n\t\t\n\t\tif ( (array[2] == array[3]) && (array[4]==array[5] ) )\n\t\t\tlike = true;\n\t\t\n\t\t\n\t\tlog( like ? \"yes\" : \"no\" );\n\t\tsc.close();\n\t}\n\n\tstatic void log(String s) {\n\t\tSystem.out.println(s);\n\t}\n\n\tstatic void log(int i) {\n\t\tSystem.out.println(i);\n\t}\n\t\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.\n\nGiven a string S, determine whether it is coffee-like.\n\nConstraints\n\nS is a string of length 6 consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is coffee-like, print Yes; otherwise, print No.\n\nSample Input 1\n\nsippuu\n\nSample Output 1\n\nYes\n\nIn sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.\n\nSample Input 2\n\niphone\n\nSample Output 2\n\nNo\n\nSample Input 3\n\ncoffee\n\nSample Output 3\n\nYes", "sample_input": "sippuu\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02723", "source_text": "Score : 100 points\n\nProblem Statement\n\nA string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.\n\nGiven a string S, determine whether it is coffee-like.\n\nConstraints\n\nS is a string of length 6 consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is coffee-like, print Yes; otherwise, print No.\n\nSample Input 1\n\nsippuu\n\nSample Output 1\n\nYes\n\nIn sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.\n\nSample Input 2\n\niphone\n\nSample Output 2\n\nNo\n\nSample Input 3\n\ncoffee\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 803, "cpu_time_ms": 121, "memory_kb": 23252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s495581443", "group_id": "codeNet:p02724", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint money = sc.nextInt();\n\n\t\tsc.close();\n\n\t\tint happy = 0;\n\n\t\tif (money / 500 > 0) {\n\t\t\thappy += 1000 * (money / 500);\n\t\t\tmoney -= 500 * (money / 500);\n\t\t}\n\t\tif (money / 5 > 0) {\n\t\t\thappy += 5 * (money / 5);\n\t\t\tmoney -= 5 * (money / 5);\n\t\t}\n\n\t\tSystem.out.print(happy);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1585445348, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02724.html", "problem_id": "p02724", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02724/input.txt", "sample_output_relpath": "derived/input_output/data/p02724/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02724/Java/s495581443.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s495581443", "user_id": "u009245552"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint money = sc.nextInt();\n\n\t\tsc.close();\n\n\t\tint happy = 0;\n\n\t\tif (money / 500 > 0) {\n\t\t\thappy += 1000 * (money / 500);\n\t\t\tmoney -= 500 * (money / 500);\n\t\t}\n\t\tif (money / 5 > 0) {\n\t\t\thappy += 5 * (money / 5);\n\t\t\tmoney -= 5 * (money / 5);\n\t\t}\n\n\t\tSystem.out.print(happy);\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 407, "cpu_time_ms": 94, "memory_kb": 21588}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s281363302", "group_id": "codeNet:p02724", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scn = new Scanner(System.in);\n\n long n = scn.nextLong();\n long ans = 1000 * (n / 500);\n n %= 500;\n ans += 5 * (n / 5);\n System.out.println(ans);\n\n }\n}", "language": "Java", "metadata": {"date": 1585444272, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02724.html", "problem_id": "p02724", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02724/input.txt", "sample_output_relpath": "derived/input_output/data/p02724/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02724/Java/s281363302.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s281363302", "user_id": "u437421138"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scn = new Scanner(System.in);\n\n long n = scn.nextLong();\n long ans = 1000 * (n / 500);\n n %= 500;\n ans += 5 * (n / 5);\n System.out.println(ans);\n\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 296, "cpu_time_ms": 107, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s072972690", "group_id": "codeNet:p02724", "input_text": "import java.util.*;\nimport javax.lang.model.util.ElementScanner6;\n//import java.lang.Math;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n // 入力\n int x = sc.nextInt();\n\n // 処理\n int out = 0;\n\n out += (x / 500) * 1000;\n out += ((x % 500) / 5) * 5;\n\n // 出力\n System.out.println(out);\n }\n}", "language": "Java", "metadata": {"date": 1585444019, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02724.html", "problem_id": "p02724", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02724/input.txt", "sample_output_relpath": "derived/input_output/data/p02724/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02724/Java/s072972690.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s072972690", "user_id": "u746641209"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "import java.util.*;\nimport javax.lang.model.util.ElementScanner6;\n//import java.lang.Math;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n // 入力\n int x = sc.nextInt();\n\n // 処理\n int out = 0;\n\n out += (x / 500) * 1000;\n out += ((x % 500) / 5) * 5;\n\n // 出力\n System.out.println(out);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 94, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s022870510", "group_id": "codeNet:p02726", "input_text": "import java.util.*;\npublic class Main {\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int n= sc.nextInt();\n int x= sc.nextInt();\n int y=sc.nextInt();\n int dist[] = new int[n];\n //int maxLength = 1 + (x-1) + (n-x);\n //int total = n*(n-1)/2 ;\n for(int i=1;i<=n;i++){\n for(int j=i+1;j<=n;j++){\n int minDistance = Math.min(Math.abs(j-i),Math.abs(x-i)+1+Math.abs(y-j));\n dist[minDistance]++;\n }\n }\n for(int i=1;i= Y-X){//遠回りしてYについてしまうのであればワープ\n\t\t\t genzaichi = Y;\n\t\t\t nokori--;\n\t\t\t if(nokori==0){\n\t\t\t\tcounter[k]++;\n\t\t\t\tbreak;\n\t\t\t }\n\t\t\t}else{//ワープの有り無し選べる\n\t\t\t int nokoriStock = nokori;\n\t\t\t int genzaichiStock = genzaichi;\n\t\t\t //ワープする\n\t\t\t while(genzaichi < N){\n\t\t\t\tgenzaichi = Y;\n\t\t\t\tnokori--;\n\t\t\t\tif(nokori==0){\n\t\t\t\t counter[k]++;\n\t\t\t\t break;\n\t\t\t\t}\n\t\t\t }\n\t\t\t \n\t\t\t //ワープしない\n\t\t\t while(genzaichiStock < N){\n\t\t\t\tgenzaichiStock++;\n\t\t\t\tnokoriStock--;\n\t\t\t\tif(nokori==0){\n\t\t\t\t counter[k]++;\n\t\t\t\t break;\n\t\t\t\t}\n\t\t\t }\n\t\t\t}\n\t\t }\n\t\t}\n\t }\n\t}\n\tfor(int i=1;i= Y-X){//遠回りしてYについてしまうのであればワープ\n\t\t\t genzaichi = Y;\n\t\t\t nokori--;\n\t\t\t if(nokori==0){\n\t\t\t\tcounter[k]++;\n\t\t\t\tbreak;\n\t\t\t }\n\t\t\t}else{//ワープの有り無し選べる\n\t\t\t int nokoriStock = nokori;\n\t\t\t int genzaichiStock = genzaichi;\n\t\t\t //ワープする\n\t\t\t while(genzaichi < N){\n\t\t\t\tgenzaichi = Y;\n\t\t\t\tnokori--;\n\t\t\t\tif(nokori==0){\n\t\t\t\t counter[k]++;\n\t\t\t\t break;\n\t\t\t\t}\n\t\t\t }\n\t\t\t \n\t\t\t //ワープしない\n\t\t\t while(genzaichiStock < N){\n\t\t\t\tgenzaichiStock++;\n\t\t\t\tnokoriStock--;\n\t\t\t\tif(nokori==0){\n\t\t\t\t counter[k]++;\n\t\t\t\t break;\n\t\t\t\t}\n\t\t\t }\n\t\t\t}\n\t\t }\n\t\t}\n\t }\n\t}\n\tfor(int i=1;i 0) {\n res += N * (N-1) / 2;\n }\n if(M > 0){\n res += M * (M-1) / 2;\n }\n System.out.println(res);\n }\n}", "language": "Java", "metadata": {"date": 1584925633, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02729.html", "problem_id": "p02729", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02729/input.txt", "sample_output_relpath": "derived/input_output/data/p02729/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02729/Java/s573796149.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s573796149", "user_id": "u082512804"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String args[]){\n Scanner scanner = new Scanner(System.in);\n int N = scanner.nextInt();\n int M = scanner.nextInt();\n\n int res = 0;\n if(N > 0) {\n res += N * (N-1) / 2;\n }\n if(M > 0){\n res += M * (M-1) / 2;\n }\n System.out.println(res);\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have N+M balls, each of which has an integer written on it.\n\nIt is known that:\n\nThe numbers written on N of the balls are even.\n\nThe numbers written on M of the balls are odd.\n\nFind the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.\n\nIt can be shown that this count does not depend on the actual values written on the balls.\n\nConstraints\n\n0 \\leq N,M \\leq 100\n\n2 \\leq N+M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n1\n\nFor example, let us assume that the numbers written on the three balls are 1,2,4.\n\nIf we choose the two balls with 1 and 2, the sum is odd;\n\nIf we choose the two balls with 1 and 4, the sum is odd;\n\nIf we choose the two balls with 2 and 4, the sum is even.\n\nThus, the answer is 1.\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n13 3\n\nSample Output 4\n\n81\n\nSample Input 5\n\n0 3\n\nSample Output 5\n\n3", "sample_input": "2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02729", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have N+M balls, each of which has an integer written on it.\n\nIt is known that:\n\nThe numbers written on N of the balls are even.\n\nThe numbers written on M of the balls are odd.\n\nFind the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.\n\nIt can be shown that this count does not depend on the actual values written on the balls.\n\nConstraints\n\n0 \\leq N,M \\leq 100\n\n2 \\leq N+M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n1\n\nFor example, let us assume that the numbers written on the three balls are 1,2,4.\n\nIf we choose the two balls with 1 and 2, the sum is odd;\n\nIf we choose the two balls with 1 and 4, the sum is odd;\n\nIf we choose the two balls with 2 and 4, the sum is even.\n\nThus, the answer is 1.\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n13 3\n\nSample Output 4\n\n81\n\nSample Input 5\n\n0 3\n\nSample Output 5\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 393, "cpu_time_ms": 95, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s806427820", "group_id": "codeNet:p02730", "input_text": "import java.util.Scanner;\n\npublic class Main \n{\n\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tString s = \t\tsc.next();\n\t\t\n\t\tString firstCheck = s.substring(0,(s.length()-1)/2);\n\t\tSystem.out.println(\"firstCheck is: \"+firstCheck);\n\t\t\n\t\tString seconCheck = s.substring((s.length()+3)/2 - 1, s.length());\n\t\tSystem.out.println(\"seconCheck is: \"+seconCheck);\n\t\t\n\t\tif(checkPalindrome(s) && checkPalindrome(firstCheck) && checkPalindrome(seconCheck))\n\t\t{\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\t\n\n\t}\n\t\n\tpublic static boolean checkPalindrome(String a)\n\t{\n\t\tString b = \"\";\n\t\t\n\t\tfor(int i=a.length()-1; i>=0; i-- )\n\t\t{\n\t\t\tb += a.charAt(i);\n\t\t}\n\t\t\n\t\t//System.out.println(\"a is: \"+a);\n\t\t//System.out.println(\"b is: \"+b);\n\t\t\n\t\tif(a.equals(b))\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\treturn false;\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1584929018, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02730.html", "problem_id": "p02730", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02730/input.txt", "sample_output_relpath": "derived/input_output/data/p02730/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02730/Java/s806427820.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s806427820", "user_id": "u109640435"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main \n{\n\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tString s = \t\tsc.next();\n\t\t\n\t\tString firstCheck = s.substring(0,(s.length()-1)/2);\n\t\tSystem.out.println(\"firstCheck is: \"+firstCheck);\n\t\t\n\t\tString seconCheck = s.substring((s.length()+3)/2 - 1, s.length());\n\t\tSystem.out.println(\"seconCheck is: \"+seconCheck);\n\t\t\n\t\tif(checkPalindrome(s) && checkPalindrome(firstCheck) && checkPalindrome(seconCheck))\n\t\t{\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\t\n\n\t}\n\t\n\tpublic static boolean checkPalindrome(String a)\n\t{\n\t\tString b = \"\";\n\t\t\n\t\tfor(int i=a.length()-1; i>=0; i-- )\n\t\t{\n\t\t\tb += a.charAt(i);\n\t\t}\n\t\t\n\t\t//System.out.println(\"a is: \"+a);\n\t\t//System.out.println(\"b is: \"+b);\n\t\t\n\t\tif(a.equals(b))\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\treturn false;\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "sample_input": "akasaka\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02730", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 869, "cpu_time_ms": 100, "memory_kb": 22740}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s381423123", "group_id": "codeNet:p02732", "input_text": "import java.util.HashMap;\nimport java.util.Scanner;\n\n/*\n説明\n*/\npublic class Main {\n public static void main(String[] args){\n\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int a[] = new int[n];\n\n HashMap map = new HashMap<>();\n for (int i = 0; i < n; i++) {\n a[i] = s.nextInt();\n\n if (map.get(a[i]) == null) {\n map.put(a[i], 1);\n } else {\n map.put(a[i], map.get(a[i])+1);\n }\n }\n\n for (int i = 0; i < n; i++) {\n int ans = 0;\n\n for (int key :map.keySet()) {\n if (key == a[i]) {\n ans += (map.get(key) - 1) * (map.get(key) - 2);\n } else {\n ans += map.get(key) * (map.get(key) - 1);\n }\n }\n\n if (map.size() == 1) {\n ans += (map.get(a[0]) - 1) * (map.get(a[0]) - 2);\n }\n System.out.println(ans / 2);\n }\n\n }\n}", "language": "Java", "metadata": {"date": 1584930283, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02732.html", "problem_id": "p02732", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02732/input.txt", "sample_output_relpath": "derived/input_output/data/p02732/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02732/Java/s381423123.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s381423123", "user_id": "u728264684"}, "prompt_components": {"gold_output": "2\n2\n3\n2\n3\n", "input_to_evaluate": "import java.util.HashMap;\nimport java.util.Scanner;\n\n/*\n説明\n*/\npublic class Main {\n public static void main(String[] args){\n\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int a[] = new int[n];\n\n HashMap map = new HashMap<>();\n for (int i = 0; i < n; i++) {\n a[i] = s.nextInt();\n\n if (map.get(a[i]) == null) {\n map.put(a[i], 1);\n } else {\n map.put(a[i], map.get(a[i])+1);\n }\n }\n\n for (int i = 0; i < n; i++) {\n int ans = 0;\n\n for (int key :map.keySet()) {\n if (key == a[i]) {\n ans += (map.get(key) - 1) * (map.get(key) - 2);\n } else {\n ans += map.get(key) * (map.get(key) - 1);\n }\n }\n\n if (map.size() == 1) {\n ans += (map.get(a[0]) - 1) * (map.get(a[0]) - 2);\n }\n System.out.println(ans / 2);\n }\n\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N balls. The i-th ball has an integer A_i written on it.\n\nFor each k=1, 2, ..., N, solve the following problem and print the answer.\n\nFind the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor each k=1,2,...,N, print a line containing the answer.\n\nSample Input 1\n\n5\n1 1 2 1 2\n\nSample Output 1\n\n2\n2\n3\n2\n3\n\nConsider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.\n\nFrom these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.\n\nThus, the answer for k=1 is 2.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n0\n0\n0\n\nNo two balls have equal numbers written on them.\n\nSample Input 3\n\n5\n3 3 3 3 3\n\nSample Output 3\n\n6\n6\n6\n6\n6\n\nAny two balls have equal numbers written on them.\n\nSample Input 4\n\n8\n1 2 1 4 2 1 4 1\n\nSample Output 4\n\n5\n7\n5\n7\n7\n5\n7\n5", "sample_input": "5\n1 1 2 1 2\n"}, "reference_outputs": ["2\n2\n3\n2\n3\n"], "source_document_id": "p02732", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N balls. The i-th ball has an integer A_i written on it.\n\nFor each k=1, 2, ..., N, solve the following problem and print the answer.\n\nFind the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor each k=1,2,...,N, print a line containing the answer.\n\nSample Input 1\n\n5\n1 1 2 1 2\n\nSample Output 1\n\n2\n2\n3\n2\n3\n\nConsider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.\n\nFrom these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.\n\nThus, the answer for k=1 is 2.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n0\n0\n0\n\nNo two balls have equal numbers written on them.\n\nSample Input 3\n\n5\n3 3 3 3 3\n\nSample Output 3\n\n6\n6\n6\n6\n6\n\nAny two balls have equal numbers written on them.\n\nSample Input 4\n\n8\n1 2 1 4 2 1 4 1\n\nSample Output 4\n\n5\n7\n5\n7\n7\n5\n7\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1035, "cpu_time_ms": 2110, "memory_kb": 349424}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s026215261", "group_id": "codeNet:p02734", "input_text": "import java.util.*;\nimport java.io.*;\n \npublic class Main {\n static boolean[][] used;\n static int[] ans;\n public static void main(String[] args) throws Exception {\n long mod = 998244353;\n FastScanner sc = new FastScanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n int n = sc.nextInt();\n int s = sc.nextInt();\n int[] a = sc.nextIntArray(n);\n int[][][] dp = new int[n+1][s+1][3];\n dp[0][0][0] = 1;\n for(int i = 0; i < n; i++){\n for(int j = 0; j <= s; j++){\n dp[i+1][j][0] += dp[i][j][0];\n dp[i+1][j][0] %= mod;\n dp[i+1][j][1] += (dp[i][j][0] + dp[i][j][1]) % mod;\n dp[i+1][j][1] %= mod;\n dp[i+1][j][2] += (dp[i][j][0] + dp[i][j][1] + dp[i][j][2]) % mod;\n dp[i+1][j][2] %= mod;\n if(j + a[i] <= s){\n dp[i+1][j+a[i]][1] += (dp[i][j][0] + dp[i][j][1]) % mod;\n dp[i+1][j+a[i]][1] %= mod;\n dp[i+1][j+a[i]][2] += (dp[i][j][0] + dp[i][j][1]) % mod;\n dp[i+1][j+a[i]][2] %= mod;\n }\n }\n }\n System.out.println(dp[n][s][2]%mod);\n }\n}\n\nclass FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n } \n}", "language": "Java", "metadata": {"date": 1588992987, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02734.html", "problem_id": "p02734", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02734/input.txt", "sample_output_relpath": "derived/input_output/data/p02734/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02734/Java/s026215261.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s026215261", "user_id": "u578775554"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\n \npublic class Main {\n static boolean[][] used;\n static int[] ans;\n public static void main(String[] args) throws Exception {\n long mod = 998244353;\n FastScanner sc = new FastScanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n int n = sc.nextInt();\n int s = sc.nextInt();\n int[] a = sc.nextIntArray(n);\n int[][][] dp = new int[n+1][s+1][3];\n dp[0][0][0] = 1;\n for(int i = 0; i < n; i++){\n for(int j = 0; j <= s; j++){\n dp[i+1][j][0] += dp[i][j][0];\n dp[i+1][j][0] %= mod;\n dp[i+1][j][1] += (dp[i][j][0] + dp[i][j][1]) % mod;\n dp[i+1][j][1] %= mod;\n dp[i+1][j][2] += (dp[i][j][0] + dp[i][j][1] + dp[i][j][2]) % mod;\n dp[i+1][j][2] %= mod;\n if(j + a[i] <= s){\n dp[i+1][j+a[i]][1] += (dp[i][j][0] + dp[i][j][1]) % mod;\n dp[i+1][j+a[i]][1] %= mod;\n dp[i+1][j+a[i]][2] += (dp[i][j][0] + dp[i][j][1]) % mod;\n dp[i+1][j+a[i]][2] %= mod;\n }\n }\n }\n System.out.println(dp[n][s][2]%mod);\n }\n}\n\nclass FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n } \n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N integers A_1, A_2, \\ldots, A_N and a positive integer S.\n\nFor a pair of integers (L, R) such that 1\\leq L \\leq R \\leq N, let us define f(L, R) as follows:\n\nf(L, R) is the number of sequences of integers (x_1, x_2, \\ldots , x_k) such that L \\leq x_1 < x_2 < \\cdots < x_k \\leq R and A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(L, R) over all pairs of integers (L, R) such that 1\\leq L \\leq R\\leq N. Since this sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(L, R), modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n5\n\nThe value of f(L, R) for each pair is as follows, for a total of 5.\n\nf(1,1) = 0\n\nf(1,2) = 1 (for the sequence (1, 2))\n\nf(1,3) = 2 (for (1, 2) and (3))\n\nf(2,2) = 0\n\nf(2,3) = 1 (for (3))\n\nf(3,3) = 1 (for (3))\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n152", "sample_input": "3 4\n2 2 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02734", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N integers A_1, A_2, \\ldots, A_N and a positive integer S.\n\nFor a pair of integers (L, R) such that 1\\leq L \\leq R \\leq N, let us define f(L, R) as follows:\n\nf(L, R) is the number of sequences of integers (x_1, x_2, \\ldots , x_k) such that L \\leq x_1 < x_2 < \\cdots < x_k \\leq R and A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(L, R) over all pairs of integers (L, R) such that 1\\leq L \\leq R\\leq N. Since this sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(L, R), modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n5\n\nThe value of f(L, R) for each pair is as follows, for a total of 5.\n\nf(1,1) = 0\n\nf(1,2) = 1 (for the sequence (1, 2))\n\nf(1,3) = 2 (for (1, 2) and (3))\n\nf(2,2) = 0\n\nf(2,3) = 1 (for (3))\n\nf(3,3) = 1 (for (3))\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n152", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2693, "cpu_time_ms": 2110, "memory_kb": 485096}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s464817477", "group_id": "codeNet:p02734", "input_text": "import java.util.*;\nimport java.io.PrintWriter;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint s=sc.nextInt();\n\t\tlong mod=998244353;\n\t\tlong[][][] dp=new long[3][n+1][s+1];\n\t\t//0は開始、１は継続、２は終了\n\t\tfor(int i=1; i<=n; i++){\n\t\t\tint a=sc.nextInt();\n\t\t\tdp[0][i][0]=1;\n\t\t\tif(a<=s){\n\t\t\t\tdp[0][i][a]=1;\n\t\t\t}\n\t\t\tfor(int t=s; t>=0; t--){\n\t\t\t\tdp[1][i][t]+=dp[0][i-1][t]+dp[1][i-1][t];\n\t\t\t\tif(t>=a){\n\t\t\t\t\tdp[1][i][t]+=dp[0][i-1][t-a]+dp[1][i-1][t-a];\n\t\t\t\t}\n\t\t\t\tdp[1][i][t]%=mod;\n\t\t\t}\n\t\t\tdp[2][i][s]=(dp[2][i-1][s]+dp[1][i][s]+((a==s)?1:0))%mod;\n\t\t}\n\t\tSystem.out.println(dp[2][n][s]);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1585071486, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02734.html", "problem_id": "p02734", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02734/input.txt", "sample_output_relpath": "derived/input_output/data/p02734/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02734/Java/s464817477.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s464817477", "user_id": "u504228740"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.*;\nimport java.io.PrintWriter;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint s=sc.nextInt();\n\t\tlong mod=998244353;\n\t\tlong[][][] dp=new long[3][n+1][s+1];\n\t\t//0は開始、１は継続、２は終了\n\t\tfor(int i=1; i<=n; i++){\n\t\t\tint a=sc.nextInt();\n\t\t\tdp[0][i][0]=1;\n\t\t\tif(a<=s){\n\t\t\t\tdp[0][i][a]=1;\n\t\t\t}\n\t\t\tfor(int t=s; t>=0; t--){\n\t\t\t\tdp[1][i][t]+=dp[0][i-1][t]+dp[1][i-1][t];\n\t\t\t\tif(t>=a){\n\t\t\t\t\tdp[1][i][t]+=dp[0][i-1][t-a]+dp[1][i-1][t-a];\n\t\t\t\t}\n\t\t\t\tdp[1][i][t]%=mod;\n\t\t\t}\n\t\t\tdp[2][i][s]=(dp[2][i-1][s]+dp[1][i][s]+((a==s)?1:0))%mod;\n\t\t}\n\t\tSystem.out.println(dp[2][n][s]);\n\t}\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N integers A_1, A_2, \\ldots, A_N and a positive integer S.\n\nFor a pair of integers (L, R) such that 1\\leq L \\leq R \\leq N, let us define f(L, R) as follows:\n\nf(L, R) is the number of sequences of integers (x_1, x_2, \\ldots , x_k) such that L \\leq x_1 < x_2 < \\cdots < x_k \\leq R and A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(L, R) over all pairs of integers (L, R) such that 1\\leq L \\leq R\\leq N. Since this sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(L, R), modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n5\n\nThe value of f(L, R) for each pair is as follows, for a total of 5.\n\nf(1,1) = 0\n\nf(1,2) = 1 (for the sequence (1, 2))\n\nf(1,3) = 2 (for (1, 2) and (3))\n\nf(2,2) = 0\n\nf(2,3) = 1 (for (3))\n\nf(3,3) = 1 (for (3))\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n152", "sample_input": "3 4\n2 2 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02734", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N integers A_1, A_2, \\ldots, A_N and a positive integer S.\n\nFor a pair of integers (L, R) such that 1\\leq L \\leq R \\leq N, let us define f(L, R) as follows:\n\nf(L, R) is the number of sequences of integers (x_1, x_2, \\ldots , x_k) such that L \\leq x_1 < x_2 < \\cdots < x_k \\leq R and A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(L, R) over all pairs of integers (L, R) such that 1\\leq L \\leq R\\leq N. Since this sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(L, R), modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n5\n\nThe value of f(L, R) for each pair is as follows, for a total of 5.\n\nf(1,1) = 0\n\nf(1,2) = 1 (for the sequence (1, 2))\n\nf(1,3) = 2 (for (1, 2) and (3))\n\nf(2,2) = 0\n\nf(2,3) = 1 (for (3))\n\nf(3,3) = 1 (for (3))\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n152", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 677, "cpu_time_ms": 498, "memory_kb": 328684}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s207654550", "group_id": "codeNet:p02735", "input_text": "import java.util.*;\nimport java.lang.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int H = sc.nextInt();\n int W = sc.nextInt();\n\n char[][] board = new char[H][W];\n for(int h=0; h ls = new ArrayList();\n for(int x: arr)\n ls.add(x);\n while(ls.size() > 1)\n {\n ArrayList temp = new ArrayList();\n int last = -1;\n for(int i=0; i < ls.size()-1; i++)\n {\n int val = Math.abs(ls.get(i)-ls.get(i+1));\n if(val != last)\n {\n temp.add(val);\n last = val;\n }\n }\n ls = temp;\n }\n if(ls.size() > 0)\n System.out.println(ls.get(0));\n else\n System.out.println(0);\n }\n }", "language": "Java", "metadata": {"date": 1584845643, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02736.html", "problem_id": "p02736", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02736/input.txt", "sample_output_relpath": "derived/input_output/data/p02736/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02736/Java/s836642997.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s836642997", "user_id": "u598283679"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "/*\nIf you want to aim high, aim high\nDon't let that studying and grades consume you\nJust live life young\n******************************\nIf I'm the sun, you're the moon\nBecause when I go up, you go down\n*******************************\nI'm working for the day I will surpass you\nhttps://www.a2oj.com/Ladder16.html\n*/\nimport java.util.*;\nimport java.io.*;\nimport java.math.*;\n\n public class Main\n {\n public static void main(String omkar[]) throws Exception\n {\n BufferedReader infile = new BufferedReader(new InputStreamReader(System.in)); \n int N = Integer.parseInt(infile.readLine());\n String input = infile.readLine();\n int[] arr = new int[N];\n for(int i=0; i < N; i++)\n arr[i] = Integer.parseInt(input.charAt(i)+\"\");\n ArrayList ls = new ArrayList();\n for(int x: arr)\n ls.add(x);\n while(ls.size() > 1)\n {\n ArrayList temp = new ArrayList();\n int last = -1;\n for(int i=0; i < ls.size()-1; i++)\n {\n int val = Math.abs(ls.get(i)-ls.get(i+1));\n if(val != last)\n {\n temp.add(val);\n last = val;\n }\n }\n ls = temp;\n }\n if(ls.size() > 0)\n System.out.println(ls.get(0));\n else\n System.out.println(0);\n }\n }", "problem_context": "Score : 700 points\n\nProblem Statement\n\nGiven is a sequence of N digits a_1a_2\\ldots a_N, where each element is 1, 2, or 3.\nLet x_{i,j} defined as follows:\n\nx_{1,j} := a_j \\quad (1 \\leq j \\leq N)\n\nx_{i,j} := | x_{i-1,j} - x_{i-1,j+1} | \\quad (2 \\leq i \\leq N and 1 \\leq j \\leq N+1-i)\n\nFind x_{N,1}.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\na_i = 1,2,3 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1a_2\\ldotsa_N\n\nOutput\n\nPrint x_{N,1}.\n\nSample Input 1\n\n4\n1231\n\nSample Output 1\n\n1\n\nx_{1,1},x_{1,2},x_{1,3},x_{1,4} are respectively 1,2,3,1.\n\nx_{2,1},x_{2,2},x_{2,3} are respectively |1-2| = 1,|2-3| = 1,|3-1| = 2.\n\nx_{3,1},x_{3,2} are respectively |1-1| = 0,|1-2| = 1.\n\nFinally, x_{4,1} = |0-1| = 1, so the answer is 1.\n\nSample Input 2\n\n10\n2311312312\n\nSample Output 2\n\n0", "sample_input": "4\n1231\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02736", "source_text": "Score : 700 points\n\nProblem Statement\n\nGiven is a sequence of N digits a_1a_2\\ldots a_N, where each element is 1, 2, or 3.\nLet x_{i,j} defined as follows:\n\nx_{1,j} := a_j \\quad (1 \\leq j \\leq N)\n\nx_{i,j} := | x_{i-1,j} - x_{i-1,j+1} | \\quad (2 \\leq i \\leq N and 1 \\leq j \\leq N+1-i)\n\nFind x_{N,1}.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\na_i = 1,2,3 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1a_2\\ldotsa_N\n\nOutput\n\nPrint x_{N,1}.\n\nSample Input 1\n\n4\n1231\n\nSample Output 1\n\n1\n\nx_{1,1},x_{1,2},x_{1,3},x_{1,4} are respectively 1,2,3,1.\n\nx_{2,1},x_{2,2},x_{2,3} are respectively |1-2| = 1,|2-3| = 1,|3-1| = 2.\n\nx_{3,1},x_{3,2} are respectively |1-1| = 0,|1-2| = 1.\n\nFinally, x_{4,1} = |0-1| = 1, so the answer is 1.\n\nSample Input 2\n\n10\n2311312312\n\nSample Output 2\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1448, "cpu_time_ms": 273, "memory_kb": 65888}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s568749385", "group_id": "codeNet:p02742", "input_text": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(final String[] args) throws Exception {\n final Scanner sc = new Scanner(System.in);\n long H;\n H = sc.nextLong();\n long W;\n W = sc.nextLong();\n\n final Solver solver = new Solver();\n solver.solve(H, W);\n }\n}\n\nclass Solver {\n public void solve(long H, long W) {\n long total = (long) Math.ceil(H * W / 2.0);\n System.out.println(total);\n }\n}\n\n", "language": "Java", "metadata": {"date": 1584234432, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02742.html", "problem_id": "p02742", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02742/input.txt", "sample_output_relpath": "derived/input_output/data/p02742/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02742/Java/s568749385.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s568749385", "user_id": "u999592340"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(final String[] args) throws Exception {\n final Scanner sc = new Scanner(System.in);\n long H;\n H = sc.nextLong();\n long W;\n W = sc.nextLong();\n\n final Solver solver = new Solver();\n solver.solve(H, W);\n }\n}\n\nclass Solver {\n public void solve(long H, long W) {\n long total = (long) Math.ceil(H * W / 2.0);\n System.out.println(total);\n }\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a board with H horizontal rows and W vertical columns of squares.\nThere is a bishop at the top-left square on this board.\nHow many squares can this bishop reach by zero or more movements?\n\nHere the bishop can only move diagonally.\nMore formally, the bishop can move from the square at the r_1-th row (from the top) and the c_1-th column (from the left) to the square at the r_2-th row and the c_2-th column if and only if exactly one of the following holds:\n\nr_1 + c_1 = r_2 + c_2\n\nr_1 - c_1 = r_2 - c_2\n\nFor example, in the following figure, the bishop can move to any of the red squares in one move:\n\nConstraints\n\n1 \\leq H, W \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH \\ W\n\nOutput\n\nPrint the number of squares the bishop can reach.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\n10\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n11\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n500000000000000000", "sample_input": "4 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02742", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a board with H horizontal rows and W vertical columns of squares.\nThere is a bishop at the top-left square on this board.\nHow many squares can this bishop reach by zero or more movements?\n\nHere the bishop can only move diagonally.\nMore formally, the bishop can move from the square at the r_1-th row (from the top) and the c_1-th column (from the left) to the square at the r_2-th row and the c_2-th column if and only if exactly one of the following holds:\n\nr_1 + c_1 = r_2 + c_2\n\nr_1 - c_1 = r_2 - c_2\n\nFor example, in the following figure, the bishop can move to any of the red squares in one move:\n\nConstraints\n\n1 \\leq H, W \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH \\ W\n\nOutput\n\nPrint the number of squares the bishop can reach.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\n10\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n11\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n500000000000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 498, "cpu_time_ms": 120, "memory_kb": 23892}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s719923746", "group_id": "codeNet:p02747", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String input = scanner.next();\n scanner.close();\n\n if (input.equals(\"\")) {\n System.out.println(\"No\");\n return;\n }\n\n input = input.replace(\"hi\", \"\");\n\n if (input.length() == 0) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1586654781, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02747.html", "problem_id": "p02747", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02747/input.txt", "sample_output_relpath": "derived/input_output/data/p02747/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02747/Java/s719923746.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s719923746", "user_id": "u242435425"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String input = scanner.next();\n scanner.close();\n\n if (input.equals(\"\")) {\n System.out.println(\"No\");\n return;\n }\n\n input = input.replace(\"hi\", \"\");\n\n if (input.length() == 0) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA Hitachi string is a concatenation of one or more copies of the string hi.\n\nFor example, hi and hihi are Hitachi strings, while ha and hii are not.\n\nGiven a string S, determine whether S is a Hitachi string.\n\nConstraints\n\nThe length of S is between 1 and 10 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a Hitachi string, print Yes; otherwise, print No.\n\nSample Input 1\n\nhihi\n\nSample Output 1\n\nYes\n\nhihi is the concatenation of two copies of hi, so it is a Hitachi string.\n\nSample Input 2\n\nhi\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nha\n\nSample Output 3\n\nNo", "sample_input": "hihi\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02747", "source_text": "Score : 100 points\n\nProblem Statement\n\nA Hitachi string is a concatenation of one or more copies of the string hi.\n\nFor example, hi and hihi are Hitachi strings, while ha and hii are not.\n\nGiven a string S, determine whether S is a Hitachi string.\n\nConstraints\n\nThe length of S is between 1 and 10 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a Hitachi string, print Yes; otherwise, print No.\n\nSample Input 1\n\nhihi\n\nSample Output 1\n\nYes\n\nhihi is the concatenation of two copies of hi, so it is a Hitachi string.\n\nSample Input 2\n\nhi\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nha\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 491, "cpu_time_ms": 92, "memory_kb": 21972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s806925389", "group_id": "codeNet:p02754", "input_text": "import java.util.*; import java.io.*; import java.math.*;\npublic class Main{\n\tstatic void solve(){//Here is the main function\n\t\tArrayList one = nextLongArray();\n\t\tlong N = one.get(0);\n\t\tlong A = one.get(1);\n\t\tlong B = one.get(2);\n\t\tlong loop = N / (A + B);\n\t\tlong output = loop * A;\n\t\tlong amari = N % (A + B);\n\t\toutput += Math.min(amari, A);\n\t\tmyout(output);\n\n\t}\n\t//Method addition frame start\n\n\n\n\t//Method addition frame end\n\n\t//Don't have to see. start------------------------------------------\n\tstatic class InputIterator{\n\t\tArrayList inputLine = new ArrayList(1024);\n\t\tint index = 0; int max; String read;\n\t\tInputIterator(){\n\t\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t\ttry{\n\t\t\t\twhile((read = br.readLine()) != null){\n\t\t\t\t\tinputLine.add(read);\n\t\t\t\t}\n\t\t\t}catch(IOException e){}\n\t\t\tmax = inputLine.size();\n\t\t}\n\t\tboolean hasNext(){return (index < max);}\n\t\tString next(){\n\t\t\tif(hasNext()){\n\t\t\t\treturn inputLine.get(index++);\n\t\t\t}else{\n\t\t\t\tthrow new IndexOutOfBoundsException(\"There is no more input\");\n\t\t\t}\n\t\t}\n\t}\n\tstatic HashMap CONVSTR = new HashMap();\n\tstatic InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\tstatic void flush(){out.flush();}\n\tstatic void myout(Object t){out.println(t);}\n\tstatic void myerr(Object t){System.err.print(\"debug:\");System.err.println(t);}\n\tstatic String next(){return ii.next();}\n\tstatic boolean hasNext(){return ii.hasNext();}\n\tstatic int nextInt(){return Integer.parseInt(next());}\n\tstatic long nextLong(){return Long.parseLong(next());}\n\tstatic double nextDouble(){return Double.parseDouble(next());}\n\tstatic ArrayList nextStrArray(){return myconv(next(), 8);}\n\tstatic ArrayList nextCharArray(){return myconv(next(), 0);}\n\tstatic ArrayList nextIntArray(){\n\t\tArrayList input = nextStrArray(); ArrayList ret = new ArrayList(input.size());\n\t\tfor(int i = 0; i < input.size(); i++){\n\t\t\tret.add(Integer.parseInt(input.get(i)));\n\t\t}\n\t\treturn ret;\n\t}\n\tstatic ArrayList nextLongArray(){\n\t\tArrayList input = nextStrArray(); ArrayList ret = new ArrayList(input.size());\n\t\tfor(int i = 0; i < input.size(); i++){\n\t\t\tret.add(Long.parseLong(input.get(i)));\n\t\t}\n\t\treturn ret;\n\t}\n\t@SuppressWarnings(\"unchecked\")\n\tstatic String myconv(Object list, int no){//only join\n\t\tString joinString = CONVSTR.get(no);\n\t\tif(list instanceof String[]){\n\t\t\treturn String.join(joinString, (String[])list);\n\t\t}else if(list instanceof ArrayList){\n\t\t\treturn String.join(joinString, (ArrayList)list);\n\t\t}else{\n\t\t\tthrow new ClassCastException(\"Don't join\");\n\t\t}\n\t}\n\tstatic ArrayList myconv(String str, int no){//only split\n\t\tString splitString = CONVSTR.get(no);\n\t\treturn new ArrayList(Arrays.asList(str.split(splitString)));\n\t}\n\tpublic static void main(String[] args){\n\t\tCONVSTR.put(8, \" \"); CONVSTR.put(9, \"\\n\"); CONVSTR.put(0, \"\");\n\t\tsolve();flush();\n\t}\n\t//Don't have to see. end------------------------------------------\n}\n", "language": "Java", "metadata": {"date": 1600217950, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02754.html", "problem_id": "p02754", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02754/input.txt", "sample_output_relpath": "derived/input_output/data/p02754/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02754/Java/s806925389.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s806925389", "user_id": "u222822036"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*; import java.io.*; import java.math.*;\npublic class Main{\n\tstatic void solve(){//Here is the main function\n\t\tArrayList one = nextLongArray();\n\t\tlong N = one.get(0);\n\t\tlong A = one.get(1);\n\t\tlong B = one.get(2);\n\t\tlong loop = N / (A + B);\n\t\tlong output = loop * A;\n\t\tlong amari = N % (A + B);\n\t\toutput += Math.min(amari, A);\n\t\tmyout(output);\n\n\t}\n\t//Method addition frame start\n\n\n\n\t//Method addition frame end\n\n\t//Don't have to see. start------------------------------------------\n\tstatic class InputIterator{\n\t\tArrayList inputLine = new ArrayList(1024);\n\t\tint index = 0; int max; String read;\n\t\tInputIterator(){\n\t\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t\ttry{\n\t\t\t\twhile((read = br.readLine()) != null){\n\t\t\t\t\tinputLine.add(read);\n\t\t\t\t}\n\t\t\t}catch(IOException e){}\n\t\t\tmax = inputLine.size();\n\t\t}\n\t\tboolean hasNext(){return (index < max);}\n\t\tString next(){\n\t\t\tif(hasNext()){\n\t\t\t\treturn inputLine.get(index++);\n\t\t\t}else{\n\t\t\t\tthrow new IndexOutOfBoundsException(\"There is no more input\");\n\t\t\t}\n\t\t}\n\t}\n\tstatic HashMap CONVSTR = new HashMap();\n\tstatic InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\tstatic void flush(){out.flush();}\n\tstatic void myout(Object t){out.println(t);}\n\tstatic void myerr(Object t){System.err.print(\"debug:\");System.err.println(t);}\n\tstatic String next(){return ii.next();}\n\tstatic boolean hasNext(){return ii.hasNext();}\n\tstatic int nextInt(){return Integer.parseInt(next());}\n\tstatic long nextLong(){return Long.parseLong(next());}\n\tstatic double nextDouble(){return Double.parseDouble(next());}\n\tstatic ArrayList nextStrArray(){return myconv(next(), 8);}\n\tstatic ArrayList nextCharArray(){return myconv(next(), 0);}\n\tstatic ArrayList nextIntArray(){\n\t\tArrayList input = nextStrArray(); ArrayList ret = new ArrayList(input.size());\n\t\tfor(int i = 0; i < input.size(); i++){\n\t\t\tret.add(Integer.parseInt(input.get(i)));\n\t\t}\n\t\treturn ret;\n\t}\n\tstatic ArrayList nextLongArray(){\n\t\tArrayList input = nextStrArray(); ArrayList ret = new ArrayList(input.size());\n\t\tfor(int i = 0; i < input.size(); i++){\n\t\t\tret.add(Long.parseLong(input.get(i)));\n\t\t}\n\t\treturn ret;\n\t}\n\t@SuppressWarnings(\"unchecked\")\n\tstatic String myconv(Object list, int no){//only join\n\t\tString joinString = CONVSTR.get(no);\n\t\tif(list instanceof String[]){\n\t\t\treturn String.join(joinString, (String[])list);\n\t\t}else if(list instanceof ArrayList){\n\t\t\treturn String.join(joinString, (ArrayList)list);\n\t\t}else{\n\t\t\tthrow new ClassCastException(\"Don't join\");\n\t\t}\n\t}\n\tstatic ArrayList myconv(String str, int no){//only split\n\t\tString splitString = CONVSTR.get(no);\n\t\treturn new ArrayList(Arrays.asList(str.split(splitString)));\n\t}\n\tpublic static void main(String[] args){\n\t\tCONVSTR.put(8, \" \"); CONVSTR.put(9, \"\\n\"); CONVSTR.put(0, \"\");\n\t\tsolve();flush();\n\t}\n\t//Don't have to see. end------------------------------------------\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "sample_input": "8 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02754", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3104, "cpu_time_ms": 85, "memory_kb": 32940}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s471208975", "group_id": "codeNet:p02754", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int a = sc.nextInt();\n int b = sc.nextInt();\n int answer = 0;\n if (n % (a + b) == 0) {\n if (n < a+b) {\n if (n < a) {\n answer = n;\n } else {\n answer = a;\n }\n } else {\n answer = a * (n / (a + b));\n }\n } else if (n % (a + b) > a) {\n answer = a * (n / (a + b)) + a;\n } else {\n answer = a * (n / (a + b)) + (n % (a + b));\n }\n System.out.println(answer);\n }\n}", "language": "Java", "metadata": {"date": 1583635785, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02754.html", "problem_id": "p02754", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02754/input.txt", "sample_output_relpath": "derived/input_output/data/p02754/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02754/Java/s471208975.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s471208975", "user_id": "u461321601"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int a = sc.nextInt();\n int b = sc.nextInt();\n int answer = 0;\n if (n % (a + b) == 0) {\n if (n < a+b) {\n if (n < a) {\n answer = n;\n } else {\n answer = a;\n }\n } else {\n answer = a * (n / (a + b));\n }\n } else if (n % (a + b) > a) {\n answer = a * (n / (a + b)) + a;\n } else {\n answer = a * (n / (a + b)) + (n % (a + b));\n }\n System.out.println(answer);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "sample_input": "8 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02754", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 727, "cpu_time_ms": 112, "memory_kb": 23636}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s050371402", "group_id": "codeNet:p02754", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n long n = scanner.nextLong();\n long a = scanner.nextLong();\n long b = scanner.nextLong();\n\n long bunshi = (n * a + a + b - 1);\n long bunbo = a + b;\n long result = bunshi == 0 || bunbo == 0 ? 0 : bunshi / bunbo;\n System.out.println(result);\n }\n}", "language": "Java", "metadata": {"date": 1583634939, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02754.html", "problem_id": "p02754", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02754/input.txt", "sample_output_relpath": "derived/input_output/data/p02754/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02754/Java/s050371402.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s050371402", "user_id": "u025516388"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n long n = scanner.nextLong();\n long a = scanner.nextLong();\n long b = scanner.nextLong();\n\n long bunshi = (n * a + a + b - 1);\n long bunbo = a + b;\n long result = bunshi == 0 || bunbo == 0 ? 0 : bunshi / bunbo;\n System.out.println(result);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "sample_input": "8 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02754", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 438, "cpu_time_ms": 95, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s160992124", "group_id": "codeNet:p02756", "input_text": "\nimport java.text.DecimalFormat;\nimport java.util.stream.LongStream;\nimport java.util.stream.IntStream;\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n\n AtCoder problem = new AtCoder(sc);\n problem.solve(sc, out);\n\n out.flush();\n }\n\n}\n\nclass AtCoder {\n\n String S;\n int Q;\n\n AtCoder(FastScanner sc) {\n S = sc.next();\n Q = sc.nextInt();\n }\n\n void solve(FastScanner sc, PrintWriter out) {\n StringBuilder sb = new StringBuilder(S);\n for (int i = 0; i < Q; i++) {\n int q = sc.nextInt();\n if (q == 1) sb.reverse();\n else {\n int f = sc.nextInt();\n char c = sc.next().charAt(0);\n if (f == 2) sb.append(c);\n else sb.insert(0, c);\n }\n }\n out.println(sb);\n }\n\n}\n\nclass FastScanner {\n\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] arrayInt(int N) {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n\n public long[] arrayLong(int N) {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n\n public double[] arrayDouble(int N) {\n double[] array = new double[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n public String[] arrayString(int N) {\n String[] array = new String[N];\n for (int i = 0; i < N; i++) {\n array[i] = next();\n }\n return array;\n }\n\n public int randomInt() {\n Random r = new Random();\n int value = r.nextInt((int) 1e6);\n System.out.println(value);\n return value;\n }\n\n public int[] randomInt(int N) {\n int[] array = new int[N];\n Random r = new Random();\n for (int i = 0; i < N; i++) {\n array[i] = r.nextInt((int) 1e6);\n }\n System.out.println(Arrays.toString(array));\n return array;\n }\n\n}\n\nclass My {\n\n static void ans(boolean b) {\n System.out.println(b ? \"Yes\" : \"No\");\n }\n\n static void ANS(boolean b) {\n System.out.println(b ? \"YES\" : \"NO\");\n }\n\n static String sort(String s) {\n char[] ch = s.toCharArray();\n Arrays.sort(ch);\n return String.valueOf(ch);\n }\n\n static String reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n static int[] reverse(int[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long[] reverse(long[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static double[] reverse(double[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static String[] reverse(String[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static char[] reverse(char[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long min(long... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static int min(int... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static double min(double... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static long max(long... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int max(int... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static double max(double... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int sum(long number) {\n int sum = 0;\n while (number > 0) {\n sum += number % 10;\n number /= 10;\n }\n return sum;\n }\n\n}\n", "language": "Java", "metadata": {"date": 1595576777, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02756.html", "problem_id": "p02756", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02756/input.txt", "sample_output_relpath": "derived/input_output/data/p02756/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02756/Java/s160992124.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s160992124", "user_id": "u871244227"}, "prompt_components": {"gold_output": "cpa\n", "input_to_evaluate": "\nimport java.text.DecimalFormat;\nimport java.util.stream.LongStream;\nimport java.util.stream.IntStream;\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n\n AtCoder problem = new AtCoder(sc);\n problem.solve(sc, out);\n\n out.flush();\n }\n\n}\n\nclass AtCoder {\n\n String S;\n int Q;\n\n AtCoder(FastScanner sc) {\n S = sc.next();\n Q = sc.nextInt();\n }\n\n void solve(FastScanner sc, PrintWriter out) {\n StringBuilder sb = new StringBuilder(S);\n for (int i = 0; i < Q; i++) {\n int q = sc.nextInt();\n if (q == 1) sb.reverse();\n else {\n int f = sc.nextInt();\n char c = sc.next().charAt(0);\n if (f == 2) sb.append(c);\n else sb.insert(0, c);\n }\n }\n out.println(sb);\n }\n\n}\n\nclass FastScanner {\n\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] arrayInt(int N) {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n\n public long[] arrayLong(int N) {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n\n public double[] arrayDouble(int N) {\n double[] array = new double[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n public String[] arrayString(int N) {\n String[] array = new String[N];\n for (int i = 0; i < N; i++) {\n array[i] = next();\n }\n return array;\n }\n\n public int randomInt() {\n Random r = new Random();\n int value = r.nextInt((int) 1e6);\n System.out.println(value);\n return value;\n }\n\n public int[] randomInt(int N) {\n int[] array = new int[N];\n Random r = new Random();\n for (int i = 0; i < N; i++) {\n array[i] = r.nextInt((int) 1e6);\n }\n System.out.println(Arrays.toString(array));\n return array;\n }\n\n}\n\nclass My {\n\n static void ans(boolean b) {\n System.out.println(b ? \"Yes\" : \"No\");\n }\n\n static void ANS(boolean b) {\n System.out.println(b ? \"YES\" : \"NO\");\n }\n\n static String sort(String s) {\n char[] ch = s.toCharArray();\n Arrays.sort(ch);\n return String.valueOf(ch);\n }\n\n static String reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n static int[] reverse(int[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long[] reverse(long[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static double[] reverse(double[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static String[] reverse(String[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static char[] reverse(char[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long min(long... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static int min(int... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static double min(double... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static long max(long... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int max(int... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static double max(double... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int sum(long number) {\n int sum = 0;\n while (number > 0) {\n sum += number % 10;\n number /= 10;\n }\n return sum;\n }\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "sample_input": "a\n4\n2 1 p\n1\n2 2 c\n1\n"}, "reference_outputs": ["cpa\n"], "source_document_id": "p02756", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7131, "cpu_time_ms": 2207, "memory_kb": 56592}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s103991899", "group_id": "codeNet:p02756", "input_text": "import java.util.Scanner;\npublic class Main {\n\tpublic static void main (String[] args){\n\t\tScanner in = new Scanner(System.in);\n\t\tString s = in.next();\n\t\tInteger n = in.nextInt();\n\t\t\n\t\tfor(int i=0;i=0;i--){\n System.out.print(str.charAt(i));\n }\n }\n System.out.println();\n }\n}", "language": "Java", "metadata": {"date": 1583637895, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02756.html", "problem_id": "p02756", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02756/input.txt", "sample_output_relpath": "derived/input_output/data/p02756/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02756/Java/s881121525.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s881121525", "user_id": "u110087226"}, "prompt_components": {"gold_output": "cpa\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main{\n public static void main(String[] args)throws Exception{\n Scanner sc=new Scanner(System.in);\n StringBuffer s=new StringBuffer(sc.next());\n int q=sc.nextInt(),t=0,f=0;\n String c=\"\";\n int l=s.length();\n boolean direction=true;\n for(int i=0;i=0;i--){\n System.out.print(str.charAt(i));\n }\n }\n System.out.println();\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "sample_input": "a\n4\n2 1 p\n1\n2 2 c\n1\n"}, "reference_outputs": ["cpa\n"], "source_document_id": "p02756", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 974, "cpu_time_ms": 2109, "memory_kb": 88628}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s601780663", "group_id": "codeNet:p02756", "input_text": "import java.util.*;\n\npublic class Main {\n void run() {\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n String mid = \"\";\n if (s.length() >= 2) {\n mid = s.substring(1, s.length() - 1);\n// debug(mid);\n }\n int q = sc.nextInt();\n StringBuffer sbHead = new StringBuffer(1000000);\n sbHead.append(s.charAt(0));\n StringBuffer sbLast = new StringBuffer(1000000);\n if (s.length() != 1) {\n sbLast.append(s.charAt(s.length() - 1));\n }\n// debug(sbHead, sbLast);\n boolean isHead = true;\n for (int i = 0; i < q; i++) {\n debug(sbHead, sbLast);\n int t = sc.nextInt();\n if (t == 1) {\n isHead = !isHead;\n continue;\n }\n int f = sc.nextInt();\n char c = sc.next().charAt(0);\n if ((f == 1 && isHead) || (f == 2 && !isHead)) {\n sbHead.append(c);\n } else {\n sbLast.append(c);\n }\n }\n\n\n StringBuffer ans = sbHead.reverse().append(mid).append(sbLast);\n if (isHead) {\n System.out.println(ans.toString());\n } else {\n System.out.println(ans.reverse().toString());\n }\n }\n\n void debug(Object... os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "language": "Java", "metadata": {"date": 1583636608, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02756.html", "problem_id": "p02756", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02756/input.txt", "sample_output_relpath": "derived/input_output/data/p02756/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02756/Java/s601780663.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s601780663", "user_id": "u149419355"}, "prompt_components": {"gold_output": "cpa\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n void run() {\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n String mid = \"\";\n if (s.length() >= 2) {\n mid = s.substring(1, s.length() - 1);\n// debug(mid);\n }\n int q = sc.nextInt();\n StringBuffer sbHead = new StringBuffer(1000000);\n sbHead.append(s.charAt(0));\n StringBuffer sbLast = new StringBuffer(1000000);\n if (s.length() != 1) {\n sbLast.append(s.charAt(s.length() - 1));\n }\n// debug(sbHead, sbLast);\n boolean isHead = true;\n for (int i = 0; i < q; i++) {\n debug(sbHead, sbLast);\n int t = sc.nextInt();\n if (t == 1) {\n isHead = !isHead;\n continue;\n }\n int f = sc.nextInt();\n char c = sc.next().charAt(0);\n if ((f == 1 && isHead) || (f == 2 && !isHead)) {\n sbHead.append(c);\n } else {\n sbLast.append(c);\n }\n }\n\n\n StringBuffer ans = sbHead.reverse().append(mid).append(sbLast);\n if (isHead) {\n System.out.println(ans.toString());\n } else {\n System.out.println(ans.reverse().toString());\n }\n }\n\n void debug(Object... os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "sample_input": "a\n4\n2 1 p\n1\n2 2 c\n1\n"}, "reference_outputs": ["cpa\n"], "source_document_id": "p02756", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1476, "cpu_time_ms": 2110, "memory_kb": 352972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s235175073", "group_id": "codeNet:p02757", "input_text": "import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tBigInteger p = new BigInteger(scanner.next());\n\t\tString s = scanner.next();\n\n\t\tint count = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = i + 1; j < n + 1; j++) {\n\t\t\t\tif (new BigInteger(s.substring(i, j)).remainder(p).equals(BigInteger.ZERO))\n\t\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1583938876, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02757.html", "problem_id": "p02757", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02757/input.txt", "sample_output_relpath": "derived/input_output/data/p02757/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02757/Java/s235175073.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s235175073", "user_id": "u154898295"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.math.BigInteger;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tBigInteger p = new BigInteger(scanner.next());\n\t\tString s = scanner.next();\n\n\t\tint count = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = i + 1; j < n + 1; j++) {\n\t\t\t\tif (new BigInteger(s.substring(i, j)).remainder(p).equals(BigInteger.ZERO))\n\t\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\n\t}\n\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has a string S of length N consisting of digits from 0 through 9.\n\nHe loves the prime number P. He wants to know how many non-empty (contiguous) substrings of S - there are N \\times (N + 1) / 2 of them - are divisible by P when regarded as integers written in base ten.\n\nHere substrings starting with a 0 also count, and substrings originated from different positions in S are distinguished, even if they are equal as strings or integers.\n\nCompute this count to help Takahashi.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS consists of digits.\n\n|S| = N\n\n2 \\leq P \\leq 10000\n\nP is a prime number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nS\n\nOutput\n\nPrint the number of non-empty (contiguous) substrings of S that are divisible by P when regarded as an integer written in base ten.\n\nSample Input 1\n\n4 3\n3543\n\nSample Output 1\n\n6\n\nHere S = 3543. There are ten non-empty (contiguous) substrings of S:\n\n3: divisible by 3.\n\n35: not divisible by 3.\n\n354: divisible by 3.\n\n3543: divisible by 3.\n\n5: not divisible by 3.\n\n54: divisible by 3.\n\n543: divisible by 3.\n\n4: not divisible by 3.\n\n43: not divisible by 3.\n\n3: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\nSample Input 2\n\n4 2\n2020\n\nSample Output 2\n\n10\n\nHere S = 2020. There are ten non-empty (contiguous) substrings of S, all of which are divisible by 2, so print 10.\n\nNote that substrings beginning with a 0 also count.\n\nSample Input 3\n\n20 11\n33883322005544116655\n\nSample Output 3\n\n68", "sample_input": "4 3\n3543\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02757", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has a string S of length N consisting of digits from 0 through 9.\n\nHe loves the prime number P. He wants to know how many non-empty (contiguous) substrings of S - there are N \\times (N + 1) / 2 of them - are divisible by P when regarded as integers written in base ten.\n\nHere substrings starting with a 0 also count, and substrings originated from different positions in S are distinguished, even if they are equal as strings or integers.\n\nCompute this count to help Takahashi.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS consists of digits.\n\n|S| = N\n\n2 \\leq P \\leq 10000\n\nP is a prime number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nS\n\nOutput\n\nPrint the number of non-empty (contiguous) substrings of S that are divisible by P when regarded as an integer written in base ten.\n\nSample Input 1\n\n4 3\n3543\n\nSample Output 1\n\n6\n\nHere S = 3543. There are ten non-empty (contiguous) substrings of S:\n\n3: divisible by 3.\n\n35: not divisible by 3.\n\n354: divisible by 3.\n\n3543: divisible by 3.\n\n5: not divisible by 3.\n\n54: divisible by 3.\n\n543: divisible by 3.\n\n4: not divisible by 3.\n\n43: not divisible by 3.\n\n3: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\nSample Input 2\n\n4 2\n2020\n\nSample Output 2\n\n10\n\nHere S = 2020. There are ten non-empty (contiguous) substrings of S, all of which are divisible by 2, so print 10.\n\nNote that substrings beginning with a 0 also count.\n\nSample Input 3\n\n20 11\n33883322005544116655\n\nSample Output 3\n\n68", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 500, "cpu_time_ms": 2109, "memory_kb": 154260}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s976871595", "group_id": "codeNet:p02759", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n ADuplexPrinting solver = new ADuplexPrinting();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class ADuplexPrinting {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n out.println((n / 2) + n % 2);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(int i) {\n writer.println(i);\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1583114476, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02759.html", "problem_id": "p02759", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02759/input.txt", "sample_output_relpath": "derived/input_output/data/p02759/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02759/Java/s976871595.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s976871595", "user_id": "u052212445"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n ADuplexPrinting solver = new ADuplexPrinting();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class ADuplexPrinting {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n out.println((n / 2) + n % 2);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(int i) {\n writer.println(i);\n }\n\n }\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.\n\nAt least how many sheets of paper does he need?\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3\n\nBy printing the 1-st, 2-nd pages on the 1-st sheet, 3-rd and 4-th pages on the 2-nd sheet, and 5-th page on the 3-rd sheet, we can print all the data on 3 sheets of paper.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n50", "sample_input": "5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02759", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.\n\nAt least how many sheets of paper does he need?\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3\n\nBy printing the 1-st, 2-nd pages on the 1-st sheet, 3-rd and 4-th pages on the 2-nd sheet, and 5-th page on the 3-rd sheet, we can print all the data on 3 sheets of paper.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n50", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3369, "cpu_time_ms": 77, "memory_kb": 22612}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s185831024", "group_id": "codeNet:p02760", "input_text": "import java.util.*;\nimport java.io.*; \n\npublic class Main {\n\t\n\tpublic static void main(String... string) {\n\t\tScanner sc = new Scanner(System.in); \n\t\tHashMap map = new HashMap<>(); \n\t\tfor(int i = 0; i<9; i++) {\n\t\t int x = sc.nextInt(); \n\t\t map.put(x,x); \n\t\t}\n\t\tint n = sc.nextInt(); \n\t\tfor(int i= 0; i map = new HashMap<>(); \n\t\tfor(int i = 0; i<9; i++) {\n\t\t int x = sc.nextInt(); \n\t\t map.put(x,x); \n\t\t}\n\t\tint n = sc.nextInt(); \n\t\tfor(int i= 0; i> 1;\n }\n return result;\n }\n\n public class SegmentTreeMin {\n private int size;\n private int[] node;\n\n public SegmentTreeMin(int[] e) {\n int s = e.length;\n size = 1;\n while (size < s) {\n size *= 2;\n }\n node = new int[2 * size - 1];\n\n for (int i = 0; i < s; i++) {\n node[i + size - 1] = e[i];\n }\n\n /*\n 子から親へのアクセス\n 左の子：dat[2*i+1]\n 右の子：dat[2*i+2]\n */\n for (int i = size - 2; i >= 0; i--) {\n node[i] = ope(node[2 * i + 1], node[2 * i + 2]);\n }\n }\n\n public void update(int i, int val) {\n i += size - 1;\n node[i] = val;\n while (i > 0) {\n /*\n 子から親へのアクセス\n 親：dat[(i-1)/2]\n */\n i = (i - 1) / 2;\n node[i] = ope(node[2 * i + 1], node[2 * i + 2]);\n }\n }\n\n public int get(int a, int b) {\n return get(a, b, 0, 0, size);\n }\n\n private int get(int a, int b, int k, int l, int r) {\n\n if (r <= a || b <= l) {\n return 0;\n } else if (a <= l && r <= b) {\n return node[k];\n } else {\n int lval = get(a, b, 2 * k + 1, l, (l + r) / 2);\n int rval = get(a, b, 2 * k + 2, (l + r) / 2, r);\n return ope(lval, rval);\n }\n }\n\n public int ope(int a, int b) {\n return a | b;\n }\n\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1600288992, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02763.html", "problem_id": "p02763", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02763/input.txt", "sample_output_relpath": "derived/input_output/data/p02763/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02763/Java/s204063734.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s204063734", "user_id": "u745688558"}, "prompt_components": {"gold_output": "3\n1\n5\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n SimpleStringQueries solver = new SimpleStringQueries();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class SimpleStringQueries {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int n = in.nextInt();\n char[] s = in.next().toCharArray();\n int[] val = new int[n];\n for (int i = 0; i < n; i++) {\n val[i] = 1 << (s[i] - 'a');\n }\n SegmentTreeMin seg = new SegmentTreeMin(val);\n\n int q = in.nextInt();\n for (int j = 0; j < q; j++) {\n int num = Integer.parseInt(in.next());\n if (num == 1) {\n int i = Integer.parseInt(in.next()) - 1;\n char c = in.next().charAt(0);\n int v = 1 << (c - 'a');\n seg.update(i, v);\n } else {\n int l = Integer.parseInt(in.next()) - 1;\n int r = Integer.parseInt(in.next());\n out.println(bitNum(seg.get(l, r)));\n }\n }\n }\n\n public int bitNum(int v) {\n int result = 0;\n while (0 < v) {\n if ((v & 1) == 1) {\n result++;\n }\n v = v >> 1;\n }\n return result;\n }\n\n public class SegmentTreeMin {\n private int size;\n private int[] node;\n\n public SegmentTreeMin(int[] e) {\n int s = e.length;\n size = 1;\n while (size < s) {\n size *= 2;\n }\n node = new int[2 * size - 1];\n\n for (int i = 0; i < s; i++) {\n node[i + size - 1] = e[i];\n }\n\n /*\n 子から親へのアクセス\n 左の子：dat[2*i+1]\n 右の子：dat[2*i+2]\n */\n for (int i = size - 2; i >= 0; i--) {\n node[i] = ope(node[2 * i + 1], node[2 * i + 2]);\n }\n }\n\n public void update(int i, int val) {\n i += size - 1;\n node[i] = val;\n while (i > 0) {\n /*\n 子から親へのアクセス\n 親：dat[(i-1)/2]\n */\n i = (i - 1) / 2;\n node[i] = ope(node[2 * i + 1], node[2 * i + 2]);\n }\n }\n\n public int get(int a, int b) {\n return get(a, b, 0, 0, size);\n }\n\n private int get(int a, int b, int k, int l, int r) {\n\n if (r <= a || b <= l) {\n return 0;\n } else if (a <= l && r <= b) {\n return node[k];\n } else {\n int lval = get(a, b, 2 * k + 1, l, (l + r) / 2);\n int rval = get(a, b, 2 * k + 2, (l + r) / 2, r);\n return ope(lval, rval);\n }\n }\n\n public int ope(int a, int b) {\n return a | b;\n }\n\n }\n\n }\n}\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "sample_input": "7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n"}, "reference_outputs": ["3\n1\n5\n"], "source_document_id": "p02763", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3671, "cpu_time_ms": 487, "memory_kb": 66468}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s933982697", "group_id": "codeNet:p02765", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint R = sc.nextInt();\n\n\t\tif (N >= 10) {\n\t\t\tSystem.out.println(R);\n\t\t} else {\n\t\t\tSystem.out.println(R + 100 * (10 - N));\n\t\t}\n\n\t}\n}\n", "language": "Java", "metadata": {"date": 1582423453, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02765.html", "problem_id": "p02765", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02765/input.txt", "sample_output_relpath": "derived/input_output/data/p02765/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02765/Java/s933982697.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s933982697", "user_id": "u349409589"}, "prompt_components": {"gold_output": "3719\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint R = sc.nextInt();\n\n\t\tif (N >= 10) {\n\t\t\tSystem.out.println(R);\n\t\t} else {\n\t\t\tSystem.out.println(R + 100 * (10 - N));\n\t\t}\n\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a member of a programming competition site, ButCoder.\n\nEach member of ButCoder is assigned two values: Inner Rating and Displayed Rating.\n\nThe Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \\times (10 - K) when the member has participated in K contests.\n\nTakahashi has participated in N contests, and his Displayed Rating is R. Find his Inner Rating.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq R \\leq 4111\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN R\n\nOutput\n\nPrint his Inner Rating.\n\nSample Input 1\n\n2 2919\n\nSample Output 1\n\n3719\n\nTakahashi has participated in 2 contests, which is less than 10, so his Displayed Rating is his Inner Rating minus 100 \\times (10 - 2) = 800.\n\nThus, Takahashi's Inner Rating is 2919 + 800 = 3719.\n\nSample Input 2\n\n22 3051\n\nSample Output 2\n\n3051", "sample_input": "2 2919\n"}, "reference_outputs": ["3719\n"], "source_document_id": "p02765", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a member of a programming competition site, ButCoder.\n\nEach member of ButCoder is assigned two values: Inner Rating and Displayed Rating.\n\nThe Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \\times (10 - K) when the member has participated in K contests.\n\nTakahashi has participated in N contests, and his Displayed Rating is R. Find his Inner Rating.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq R \\leq 4111\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN R\n\nOutput\n\nPrint his Inner Rating.\n\nSample Input 1\n\n2 2919\n\nSample Output 1\n\n3719\n\nTakahashi has participated in 2 contests, which is less than 10, so his Displayed Rating is his Inner Rating minus 100 \\times (10 - 2) = 800.\n\nThus, Takahashi's Inner Rating is 2919 + 800 = 3719.\n\nSample Input 2\n\n22 3051\n\nSample Output 2\n\n3051", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 285, "cpu_time_ms": 108, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s254370124", "group_id": "codeNet:p02767", "input_text": "import java.io.*;\nimport java.util.*;\nclass Main{\n\tstatic final long MOD = 1_000_000_007; // 10^9+7\n static final int MAX = 2_147_483_646; // intMax \n static final int INF = 1_000_000_000; // 10^9 \n public static void main(String[] args) throws Exception {\n\t\thayami saori = new hayami();\n\t\tint n = saori.saori_hayami();\n\t\tdouble[] x = new double[n];\n\t\tdouble sum = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tx[i] = saori.Hayamin();\n\t\t\tsum = sum + x[i];\n\t\t}\n\t\tdouble ave = Math.round(sum/n);\n\t\tdouble ans = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tans = ans + Math.pow(x[i]-ave,2);\n\t\t}\n\t\tint num = (int)ans;\n\t\tSystem.out.println(num);\n\t\t\n\t\t\n }\n}\n\nclass hayami implements Closeable {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] hayami = new byte[1024];\n\tprivate int Hayami = 0;\n\tprivate int saori = 0;\n\tprivate boolean HayamiSaori() {\n\t\tif (Hayami < saori) {\n\t\t\treturn true;\n\t\t}else{\n\t\t\tHayami = 0;\n\t\t\ttry {\n\t\t\t\tsaori = in.read(hayami);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (saori <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tprivate int SaoriHayami() { \n\t\tif (HayamiSaori()) {\n return hayami[Hayami++];\n }else{\n return -1;\n }\n\t}\n\tprivate static boolean hayami_saori(int hayami) { \n\t\treturn 33 <= hayami && hayami <= 126;\n\t}\n\tpublic boolean hayamisaori() { \n\t\twhile(HayamiSaori() && !hayami_saori(hayami[Hayami])) Hayami++; return HayamiSaori();\n\t}\n\tpublic String nextHayami() {\n\t\tif (!hayamisaori()) throw new NoSuchElementException();\n\t\tStringBuilder hayamin = new StringBuilder();\n\t\tint saori = SaoriHayami();\n\t\twhile(hayami_saori(saori)) {\n\t\t\thayamin.appendCodePoint(saori);\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t\treturn hayamin.toString();\n\t}\n\tpublic long saorihayami() {//nextLong\n\t\tif (!hayamisaori()) throw new NoSuchElementException();\n\t\tlong hayami = 0;\n\t\tboolean misao = false;\n\t\tint saori = SaoriHayami();\n\t\tif (saori == '-') {\n\t\t\tmisao = true;\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t\tif (saori < '0' || '9' < saori) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= saori && saori <= '9') {\n\t\t\t\thayami *= 10;\n\t\t\t\thayami += saori - '0';\n\t\t\t}else if(saori == -1 || !hayami_saori(saori)){\n\t\t\t\treturn misao ? -hayami : hayami;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t}\n\tpublic int saori_hayami() {//nextInt\n\t\tlong hayami = saorihayami();\n\t\tif (hayami < Integer.MIN_VALUE || hayami > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) hayami;\n\t}\n\tpublic double Hayamin() { //nextDouble\n\t\treturn Double.parseDouble(nextHayami());\n\t}\n\tpublic void close() {\n\t\ttry {\n\t\t\tin.close();\n\t\t} catch (IOException e) {\n\t\t}\n }\n \n}", "language": "Java", "metadata": {"date": 1582425086, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02767.html", "problem_id": "p02767", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02767/input.txt", "sample_output_relpath": "derived/input_output/data/p02767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02767/Java/s254370124.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s254370124", "user_id": "u676749446"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nclass Main{\n\tstatic final long MOD = 1_000_000_007; // 10^9+7\n static final int MAX = 2_147_483_646; // intMax \n static final int INF = 1_000_000_000; // 10^9 \n public static void main(String[] args) throws Exception {\n\t\thayami saori = new hayami();\n\t\tint n = saori.saori_hayami();\n\t\tdouble[] x = new double[n];\n\t\tdouble sum = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tx[i] = saori.Hayamin();\n\t\t\tsum = sum + x[i];\n\t\t}\n\t\tdouble ave = Math.round(sum/n);\n\t\tdouble ans = 0;\n\t\tfor(int i = 0;i < n;i++){\n\t\t\tans = ans + Math.pow(x[i]-ave,2);\n\t\t}\n\t\tint num = (int)ans;\n\t\tSystem.out.println(num);\n\t\t\n\t\t\n }\n}\n\nclass hayami implements Closeable {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] hayami = new byte[1024];\n\tprivate int Hayami = 0;\n\tprivate int saori = 0;\n\tprivate boolean HayamiSaori() {\n\t\tif (Hayami < saori) {\n\t\t\treturn true;\n\t\t}else{\n\t\t\tHayami = 0;\n\t\t\ttry {\n\t\t\t\tsaori = in.read(hayami);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (saori <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\tprivate int SaoriHayami() { \n\t\tif (HayamiSaori()) {\n return hayami[Hayami++];\n }else{\n return -1;\n }\n\t}\n\tprivate static boolean hayami_saori(int hayami) { \n\t\treturn 33 <= hayami && hayami <= 126;\n\t}\n\tpublic boolean hayamisaori() { \n\t\twhile(HayamiSaori() && !hayami_saori(hayami[Hayami])) Hayami++; return HayamiSaori();\n\t}\n\tpublic String nextHayami() {\n\t\tif (!hayamisaori()) throw new NoSuchElementException();\n\t\tStringBuilder hayamin = new StringBuilder();\n\t\tint saori = SaoriHayami();\n\t\twhile(hayami_saori(saori)) {\n\t\t\thayamin.appendCodePoint(saori);\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t\treturn hayamin.toString();\n\t}\n\tpublic long saorihayami() {//nextLong\n\t\tif (!hayamisaori()) throw new NoSuchElementException();\n\t\tlong hayami = 0;\n\t\tboolean misao = false;\n\t\tint saori = SaoriHayami();\n\t\tif (saori == '-') {\n\t\t\tmisao = true;\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t\tif (saori < '0' || '9' < saori) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= saori && saori <= '9') {\n\t\t\t\thayami *= 10;\n\t\t\t\thayami += saori - '0';\n\t\t\t}else if(saori == -1 || !hayami_saori(saori)){\n\t\t\t\treturn misao ? -hayami : hayami;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tsaori = SaoriHayami();\n\t\t}\n\t}\n\tpublic int saori_hayami() {//nextInt\n\t\tlong hayami = saorihayami();\n\t\tif (hayami < Integer.MIN_VALUE || hayami > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) hayami;\n\t}\n\tpublic double Hayamin() { //nextDouble\n\t\treturn Double.parseDouble(nextHayami());\n\t}\n\tpublic void close() {\n\t\ttry {\n\t\t\tin.close();\n\t\t} catch (IOException e) {\n\t\t}\n }\n \n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "sample_input": "2\n1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2693, "cpu_time_ms": 72, "memory_kb": 22356}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s505025748", "group_id": "codeNet:p02767", "input_text": "import java.io.*;\nimport java.util.*;\nimport static java.lang.System.out;\n\npublic class Main{\n static MyReader in = new MyReader();\n\n public static void main(String[] args){\n int N = in.i();\n int[] X = in.ii();\n int min = Integer.MAX_VALUE;\n for(int i = 1; i < 101; i++){\n int tmp = 0;\n for(int j = 0; j < N; j++){\n tmp += (X[j]-i)*(X[j]-i);\n }\n if(tmp < min){\n min = tmp;\n }\n }\n out.println(min);\n }\n\n static class MyReader extends BufferedReader{\n MyReader(){\n super(new InputStreamReader(System.in));\n }\n\n String s(){\n try{return readLine();}catch(IOException e){return \"\";}\n }\n\n String[] ss(){\n return s().split(\" \");\n }\n\n int i(){\n return Integer.parseInt(s());\n }\n\n int[] ii(){\n String[] ss = ss();\n int[] ii = new int[ss.length];\n for(int j = 0; j < ss.length; j++) ii[j] = Integer.parseInt(ss[j]);\n return ii;\n }\n\n ArrayList li(){\n String[] ss = ss();\n ArrayList li = new ArrayList<>();\n for(int j = 0; j < ss.length; j++) li.add(Integer.parseInt(ss[j]));\n return li;\n }\n\n long l(){\n return Long.parseLong(s());\n }\n\n long[] ll(){\n String[] ss = ss();\n long[] ll = new long[ss.length];\n for(int j = 0; j < ss.length; j++) ll[j] = Long.parseLong(ss[j]);\n return ll;\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1582424009, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02767.html", "problem_id": "p02767", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02767/input.txt", "sample_output_relpath": "derived/input_output/data/p02767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02767/Java/s505025748.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s505025748", "user_id": "u752907799"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nimport static java.lang.System.out;\n\npublic class Main{\n static MyReader in = new MyReader();\n\n public static void main(String[] args){\n int N = in.i();\n int[] X = in.ii();\n int min = Integer.MAX_VALUE;\n for(int i = 1; i < 101; i++){\n int tmp = 0;\n for(int j = 0; j < N; j++){\n tmp += (X[j]-i)*(X[j]-i);\n }\n if(tmp < min){\n min = tmp;\n }\n }\n out.println(min);\n }\n\n static class MyReader extends BufferedReader{\n MyReader(){\n super(new InputStreamReader(System.in));\n }\n\n String s(){\n try{return readLine();}catch(IOException e){return \"\";}\n }\n\n String[] ss(){\n return s().split(\" \");\n }\n\n int i(){\n return Integer.parseInt(s());\n }\n\n int[] ii(){\n String[] ss = ss();\n int[] ii = new int[ss.length];\n for(int j = 0; j < ss.length; j++) ii[j] = Integer.parseInt(ss[j]);\n return ii;\n }\n\n ArrayList li(){\n String[] ss = ss();\n ArrayList li = new ArrayList<>();\n for(int j = 0; j < ss.length; j++) li.add(Integer.parseInt(ss[j]));\n return li;\n }\n\n long l(){\n return Long.parseLong(s());\n }\n\n long[] ll(){\n String[] ss = ss();\n long[] ll = new long[ss.length];\n for(int j = 0; j < ss.length; j++) ll[j] = Long.parseLong(ss[j]);\n return ll;\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "sample_input": "2\n1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1639, "cpu_time_ms": 71, "memory_kb": 22484}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s488009880", "group_id": "codeNet:p02767", "input_text": "import java.util.*;\nimport java.util.stream.Collectors;\nimport java.io.*;\nimport java.nio.charset.StandardCharsets;\n\npublic class Main {\n\tint N;\n\tint[] X;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);\n\t\tBufferedReader in = new BufferedReader(reader);\n\t\tMain ins = new Main(in);\n\t\tins.calc();\n\t\tins.showResult();\n\t}\n\n\tMain(BufferedReader in) throws IOException {\n\t\tN = Integer.parseInt(in.readLine());\n\t\tString[] tokens = in.readLine().split(\" \");\n\t\tX = new int[N];\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tX[i] = Integer.parseInt(tokens[i]);\n\t\t}\n\t}\n\n\tvoid calc() {\n\t\t// まず平均値を求める\n\t\tdouble ave = 0.0;\n\t\tfor (Integer x : X) {\n\t\t\tave += x;\n\t\t}\n\t\tave /= N;\n\t\tint ave0 = (int) Math.floor(ave);\n\t\tint ave1 = ave0 + 1;\n\t\t// 分散を求める\n\t\tdouble var0 = 0.0;\n\t\tfor (Integer x : X) {\n\t\t\tvar0 += (x - ave0) * (x - ave0);\n\t\t}\n\t\tdouble var1 = 0.0;\n\t\tfor (Integer x : X) {\n\t\t\tvar1 += (x - ave1) * (x - ave1);\n\t\t}\n\t\tvar0 = Math.min(var0, var1);\n\t\tSystem.out.println((int)(var0));\n\t}\n\n\tvoid showResult() {\n\n\t}\n}\n", "language": "Java", "metadata": {"date": 1582423896, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02767.html", "problem_id": "p02767", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02767/input.txt", "sample_output_relpath": "derived/input_output/data/p02767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02767/Java/s488009880.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488009880", "user_id": "u655125439"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.*;\nimport java.util.stream.Collectors;\nimport java.io.*;\nimport java.nio.charset.StandardCharsets;\n\npublic class Main {\n\tint N;\n\tint[] X;\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);\n\t\tBufferedReader in = new BufferedReader(reader);\n\t\tMain ins = new Main(in);\n\t\tins.calc();\n\t\tins.showResult();\n\t}\n\n\tMain(BufferedReader in) throws IOException {\n\t\tN = Integer.parseInt(in.readLine());\n\t\tString[] tokens = in.readLine().split(\" \");\n\t\tX = new int[N];\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tX[i] = Integer.parseInt(tokens[i]);\n\t\t}\n\t}\n\n\tvoid calc() {\n\t\t// まず平均値を求める\n\t\tdouble ave = 0.0;\n\t\tfor (Integer x : X) {\n\t\t\tave += x;\n\t\t}\n\t\tave /= N;\n\t\tint ave0 = (int) Math.floor(ave);\n\t\tint ave1 = ave0 + 1;\n\t\t// 分散を求める\n\t\tdouble var0 = 0.0;\n\t\tfor (Integer x : X) {\n\t\t\tvar0 += (x - ave0) * (x - ave0);\n\t\t}\n\t\tdouble var1 = 0.0;\n\t\tfor (Integer x : X) {\n\t\t\tvar1 += (x - ave1) * (x - ave1);\n\t\t}\n\t\tvar0 = Math.min(var0, var1);\n\t\tSystem.out.println((int)(var0));\n\t}\n\n\tvoid showResult() {\n\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "sample_input": "2\n1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1118, "cpu_time_ms": 71, "memory_kb": 22484}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s753092877", "group_id": "codeNet:p02768", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n static long MOD = 1_000_000_000 + 7;\n static long[] fact = new long[1];\n\n public static void main(String[] args) throws Exception {\n long startTime = System.nanoTime();\n int t = 1;\n while (t-- > 0) {\n solve();\n }\n long endTime = System.nanoTime();\n err.println(\"Execution Time : +\" + (endTime - startTime) / 1000000 + \" ms\");\n exit(0);\n }\n\n static void solve() {\n long n = in.nextInt();\n long a = in.nextInt();\n long b = in.nextInt();\n long res = ModularArithmetic.mod_pow(2, n) - 1;\n long s1 = 1;\n long d1 = 1;\n long s2 = 1;\n long d2 = 1;\n for (long i = n, j = 1; j <= a; j++, i--) {\n s1 = ModularArithmetic.mul(s1, i);\n d1 = ModularArithmetic.mul(d1, j);\n }\n for (long i = n, j = 1; j <= b; j++, i--) {\n s2 = ModularArithmetic.mul(s2, i);\n d2 = ModularArithmetic.mul(d2, j);\n }\n long sub = ModularArithmetic.add(ModularArithmetic.divide(s1, d1), ModularArithmetic.divide(s2, d2));\n res -= sub;\n if (res <= 0) {\n res = 0;\n }\n out.println(res);\n }\n\n static class ModularArithmetic {\n static long C(int n, int k) {\n return divide(fact[n], mul(fact[k], fact[n - k]));\n }\n\n static void precalc(int N) {\n fact = new long[N + 5];\n fact[0] = 1;\n for (int i = 1; i < N; i++)\n fact[i] = mul(fact[i - 1], i);\n }\n\n static long inv(long x) {\n return mod_pow(x, MOD - 2);\n }\n\n static long mul(long x, long y) {\n return (x * y) % MOD;\n }\n\n static long divide(long x, long y) {\n return mul(x, inv(y));\n }\n\n static long add(long x, long y) {\n x += y;\n while (x >= MOD)\n x -= MOD;\n while (x < 0)\n x += MOD;\n return x;\n }\n\n static long mod_pow(long x, long y) {\n if (y == 0) {\n return 1;\n }\n if (y == 1) {\n return x;\n }\n long v = mod_pow(x, y / 2);\n if ((y & 1) > 0) {\n return v * v % MOD * x % MOD;\n }\n return v * v % MOD;\n }\n }\n\n static void debug(Object... args) {\n for (Object a : args) {\n out.println(a);\n }\n }\n\n static void y() {\n out.println(\"YES\");\n }\n\n static void n() {\n out.println(\"NO\");\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public int[] readAllInts(int n) {\n int[] p = new int[n];\n for (int i = 0; i < n; i++) {\n p[i] = in.nextInt();\n }\n return p;\n }\n\n public int[] readAllInts(int n, int s) {\n int[] p = new int[n + s];\n for (int i = s; i < n + s; i++) {\n p[i] = in.nextInt();\n }\n return p;\n }\n\n public long[] readAllLongs(int n) {\n long[] p = new long[n];\n for (int i = 0; i < n; i++) {\n p[i] = in.nextInt();\n }\n return p;\n }\n\n public long[] readAllLongs(int n, int s) {\n long[] p = new long[n + s];\n for (int i = s; i < n + s; i++) {\n p[i] = in.nextInt();\n }\n return p;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n static void exit(int a) {\n out.close();\n err.close();\n System.exit(a);\n }\n\n static InputStream inputStream = System.in;\n static OutputStream outputStream = System.out;\n static OutputStream errStream = System.err;\n static InputReader in = new InputReader(inputStream);\n static PrintWriter out = new PrintWriter(outputStream);\n static PrintWriter err = new PrintWriter(errStream);\n static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n}\n", "language": "Java", "metadata": {"date": 1590169269, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02768.html", "problem_id": "p02768", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02768/input.txt", "sample_output_relpath": "derived/input_output/data/p02768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02768/Java/s753092877.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s753092877", "user_id": "u669876141"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n static long MOD = 1_000_000_000 + 7;\n static long[] fact = new long[1];\n\n public static void main(String[] args) throws Exception {\n long startTime = System.nanoTime();\n int t = 1;\n while (t-- > 0) {\n solve();\n }\n long endTime = System.nanoTime();\n err.println(\"Execution Time : +\" + (endTime - startTime) / 1000000 + \" ms\");\n exit(0);\n }\n\n static void solve() {\n long n = in.nextInt();\n long a = in.nextInt();\n long b = in.nextInt();\n long res = ModularArithmetic.mod_pow(2, n) - 1;\n long s1 = 1;\n long d1 = 1;\n long s2 = 1;\n long d2 = 1;\n for (long i = n, j = 1; j <= a; j++, i--) {\n s1 = ModularArithmetic.mul(s1, i);\n d1 = ModularArithmetic.mul(d1, j);\n }\n for (long i = n, j = 1; j <= b; j++, i--) {\n s2 = ModularArithmetic.mul(s2, i);\n d2 = ModularArithmetic.mul(d2, j);\n }\n long sub = ModularArithmetic.add(ModularArithmetic.divide(s1, d1), ModularArithmetic.divide(s2, d2));\n res -= sub;\n if (res <= 0) {\n res = 0;\n }\n out.println(res);\n }\n\n static class ModularArithmetic {\n static long C(int n, int k) {\n return divide(fact[n], mul(fact[k], fact[n - k]));\n }\n\n static void precalc(int N) {\n fact = new long[N + 5];\n fact[0] = 1;\n for (int i = 1; i < N; i++)\n fact[i] = mul(fact[i - 1], i);\n }\n\n static long inv(long x) {\n return mod_pow(x, MOD - 2);\n }\n\n static long mul(long x, long y) {\n return (x * y) % MOD;\n }\n\n static long divide(long x, long y) {\n return mul(x, inv(y));\n }\n\n static long add(long x, long y) {\n x += y;\n while (x >= MOD)\n x -= MOD;\n while (x < 0)\n x += MOD;\n return x;\n }\n\n static long mod_pow(long x, long y) {\n if (y == 0) {\n return 1;\n }\n if (y == 1) {\n return x;\n }\n long v = mod_pow(x, y / 2);\n if ((y & 1) > 0) {\n return v * v % MOD * x % MOD;\n }\n return v * v % MOD;\n }\n }\n\n static void debug(Object... args) {\n for (Object a : args) {\n out.println(a);\n }\n }\n\n static void y() {\n out.println(\"YES\");\n }\n\n static void n() {\n out.println(\"NO\");\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public int[] readAllInts(int n) {\n int[] p = new int[n];\n for (int i = 0; i < n; i++) {\n p[i] = in.nextInt();\n }\n return p;\n }\n\n public int[] readAllInts(int n, int s) {\n int[] p = new int[n + s];\n for (int i = s; i < n + s; i++) {\n p[i] = in.nextInt();\n }\n return p;\n }\n\n public long[] readAllLongs(int n) {\n long[] p = new long[n];\n for (int i = 0; i < n; i++) {\n p[i] = in.nextInt();\n }\n return p;\n }\n\n public long[] readAllLongs(int n, int s) {\n long[] p = new long[n + s];\n for (int i = s; i < n + s; i++) {\n p[i] = in.nextInt();\n }\n return p;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n\n static void exit(int a) {\n out.close();\n err.close();\n System.exit(a);\n }\n\n static InputStream inputStream = System.in;\n static OutputStream outputStream = System.out;\n static OutputStream errStream = System.err;\n static InputReader in = new InputReader(inputStream);\n static PrintWriter out = new PrintWriter(outputStream);\n static PrintWriter err = new PrintWriter(errStream);\n static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "sample_input": "4 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02768", "source_text": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5122, "cpu_time_ms": 94, "memory_kb": 21588}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s023261936", "group_id": "codeNet:p02768", "input_text": "import java.io.BufferedOutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\n\n/**\n * ABC156D\n *

\n * あかりさんは n 種類の花を 1 本ずつ持っています。
\n * あかりさんは、これらの花から 1 本以上を選び、花束を作ろうとしています。
\n * ただし、あかりさんは a と b の 2 つの数を苦手としていて、いずれかと一致するような本数の花からなる花束は作ることができません。
\n * あかりさんが作ることのできる花束は何種類あるでしょうか。
\n * (10^9+7) で割った余りを求めてください。
\n * ここで 2 つの花束は、一方では使われているが、もう一方では使われていない種類の花があるとき、別の種類の花束であるとみなします。
\n *

\n *

\n * 2 <= n <= 10^9
\n * 1 <= a < b <= min(n, 2*10^5)
\n *

\n */\npublic final class Main {\n private static void execute(final IO io) throws Exception {\n final int n = io.nextInt();\n final int a = io.nextInt();\n final int b = io.nextInt();\n MC c = new MC(1000000007);\n long x1 = c.power(2, n) - 1;\n long x2 = c.combination(n, a);\n long x3 = c.combination(n, b);\n io.println(c.add(x1, -x2 - x3));\n }\n\n public static void main(final String[] args) throws Exception {\n try (IO io = new IO(System.in, System.out)) {\n execute(io);\n }\n }\n\n public static final class MC {\n private final int mod;\n public MC(final int mod) {\n this.mod = mod;\n }\n\n public long mod(long x) {\n x %= mod;\n if (x < 0) {\n x += mod;\n }\n return x;\n }\n\n public long add(final long a, final long b) {\n return (a + b) % mod;\n }\n\n public long mul(final long a, final long b) {\n return (a * b) % mod;\n }\n\n public long div(final long numerator, final long denominator) {\n return numerator * inverse(denominator) % mod;\n }\n\n public long power(long base, long exp) {\n long ret = 1;\n base %= mod;\n while (exp > 0) {\n if ((exp & 1) == 1) {\n ret = mul(ret, base);\n }\n base = mul(base, base);\n exp >>= 1;\n }\n return ret;\n }\n\n public long inverse(final long x) {\n return power(x, mod - 2);\n }\n\n public long factorial(final int n) {\n return product(1, n);\n }\n\n public long product(final int start, final int end) {\n long result = 1;\n for (int i = start; i <= end; i++) {\n result *= i;\n result %= mod;\n }\n return result;\n }\n\n public long combination(final int n, int r) {\n if (r > n) {\n return 0;\n }\n return div(product(n - r + 1, n), factorial(r));\n }\n }\n\n public static final class IO implements AutoCloseable {\n private final InputStream in;\n private final BufferedOutputStream out;\n private static final int BUFFER_SIZE = 1 << 16;\n private final byte[] buf = new byte[BUFFER_SIZE];\n private int pos = 0;\n private int end = 0;\n public IO(final InputStream in, final OutputStream out) throws IOException {\n this.in = in;\n this.out = new BufferedOutputStream(out);\n }\n\n @Override\n public void close() throws IOException {\n out.close();\n }\n\n private int fetchByte() throws IOException {\n if (pos >= end) {\n pos = 0;\n end = in.read(buf);\n if (end <= 0) {\n return -1;\n }\n }\n return buf[pos++];\n }\n\n public String nextString() throws IOException {\n int c;\n for (c = fetchByte(); c <= ' '; c = fetchByte()) {\n }\n final StringBuilder sb = new StringBuilder();\n for (; c > ' '; c = fetchByte()) {\n sb.append((char) c);\n }\n return sb.toString();\n }\n\n public String[] nextString(final int n) throws IOException {\n final String[] result = new String[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextString();\n }\n return result;\n }\n\n public int nextInt() throws IOException {\n int val = 0;\n int c;\n for (c = fetchByte(); c <= ' '; c = fetchByte()) {\n }\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = fetchByte();\n }\n for (; c >= '0' && c <= '9'; c = fetchByte()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n\n public int[] nextInt(final int n) throws IOException {\n final int[] result = new int[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextInt();\n }\n return result;\n }\n\n public long nextLong() throws IOException {\n long val = 0;\n int c;\n for (c = fetchByte(); c <= ' '; c = fetchByte()) {\n }\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = fetchByte();\n }\n for (; c >= '0' && c <= '9'; c = fetchByte()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n\n public long[] nextLong(final int n) throws IOException {\n final long[] result = new long[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextLong();\n }\n return result;\n }\n\n public void print(final Object a) throws IOException {\n out.write(a.toString().getBytes());\n }\n\n private static final byte[] SP = new byte[] { 0x20 };\n public void printsp(final Object a) throws IOException {\n out.write(a.toString().getBytes());\n out.write(SP);\n }\n\n private static final byte[] CRLF = System.lineSeparator().getBytes();\n public void println() throws IOException {\n out.write(CRLF);\n }\n\n public void println(final Object a) throws IOException {\n out.write(a.toString().getBytes());\n out.write(CRLF);\n }\n\n public void printaln(final int[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(Integer.toString(a[i]).getBytes());\n out.write(CRLF);\n }\n }\n\n public void printasp(final int[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(Integer.toString(a[i]).getBytes());\n out.write(SP);\n }\n }\n\n public void printaln(final long[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(Long.toString(a[i]).getBytes());\n out.write(CRLF);\n }\n }\n\n public void printasp(final long[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(Long.toString(a[i]).getBytes());\n out.write(SP);\n }\n }\n\n public void printaln(final Object[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(a[i].toString().getBytes());\n out.write(CRLF);\n }\n }\n\n public void printasp(final Object[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(a[i].toString().getBytes());\n out.write(SP);\n }\n }\n\n public void flush() throws IOException {\n out.flush();\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1588262141, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02768.html", "problem_id": "p02768", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02768/input.txt", "sample_output_relpath": "derived/input_output/data/p02768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02768/Java/s023261936.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s023261936", "user_id": "u349402559"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.io.BufferedOutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\n\n/**\n * ABC156D\n *

\n * あかりさんは n 種類の花を 1 本ずつ持っています。
\n * あかりさんは、これらの花から 1 本以上を選び、花束を作ろうとしています。
\n * ただし、あかりさんは a と b の 2 つの数を苦手としていて、いずれかと一致するような本数の花からなる花束は作ることができません。
\n * あかりさんが作ることのできる花束は何種類あるでしょうか。
\n * (10^9+7) で割った余りを求めてください。
\n * ここで 2 つの花束は、一方では使われているが、もう一方では使われていない種類の花があるとき、別の種類の花束であるとみなします。
\n *

\n *

\n * 2 <= n <= 10^9
\n * 1 <= a < b <= min(n, 2*10^5)
\n *

\n */\npublic final class Main {\n private static void execute(final IO io) throws Exception {\n final int n = io.nextInt();\n final int a = io.nextInt();\n final int b = io.nextInt();\n MC c = new MC(1000000007);\n long x1 = c.power(2, n) - 1;\n long x2 = c.combination(n, a);\n long x3 = c.combination(n, b);\n io.println(c.add(x1, -x2 - x3));\n }\n\n public static void main(final String[] args) throws Exception {\n try (IO io = new IO(System.in, System.out)) {\n execute(io);\n }\n }\n\n public static final class MC {\n private final int mod;\n public MC(final int mod) {\n this.mod = mod;\n }\n\n public long mod(long x) {\n x %= mod;\n if (x < 0) {\n x += mod;\n }\n return x;\n }\n\n public long add(final long a, final long b) {\n return (a + b) % mod;\n }\n\n public long mul(final long a, final long b) {\n return (a * b) % mod;\n }\n\n public long div(final long numerator, final long denominator) {\n return numerator * inverse(denominator) % mod;\n }\n\n public long power(long base, long exp) {\n long ret = 1;\n base %= mod;\n while (exp > 0) {\n if ((exp & 1) == 1) {\n ret = mul(ret, base);\n }\n base = mul(base, base);\n exp >>= 1;\n }\n return ret;\n }\n\n public long inverse(final long x) {\n return power(x, mod - 2);\n }\n\n public long factorial(final int n) {\n return product(1, n);\n }\n\n public long product(final int start, final int end) {\n long result = 1;\n for (int i = start; i <= end; i++) {\n result *= i;\n result %= mod;\n }\n return result;\n }\n\n public long combination(final int n, int r) {\n if (r > n) {\n return 0;\n }\n return div(product(n - r + 1, n), factorial(r));\n }\n }\n\n public static final class IO implements AutoCloseable {\n private final InputStream in;\n private final BufferedOutputStream out;\n private static final int BUFFER_SIZE = 1 << 16;\n private final byte[] buf = new byte[BUFFER_SIZE];\n private int pos = 0;\n private int end = 0;\n public IO(final InputStream in, final OutputStream out) throws IOException {\n this.in = in;\n this.out = new BufferedOutputStream(out);\n }\n\n @Override\n public void close() throws IOException {\n out.close();\n }\n\n private int fetchByte() throws IOException {\n if (pos >= end) {\n pos = 0;\n end = in.read(buf);\n if (end <= 0) {\n return -1;\n }\n }\n return buf[pos++];\n }\n\n public String nextString() throws IOException {\n int c;\n for (c = fetchByte(); c <= ' '; c = fetchByte()) {\n }\n final StringBuilder sb = new StringBuilder();\n for (; c > ' '; c = fetchByte()) {\n sb.append((char) c);\n }\n return sb.toString();\n }\n\n public String[] nextString(final int n) throws IOException {\n final String[] result = new String[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextString();\n }\n return result;\n }\n\n public int nextInt() throws IOException {\n int val = 0;\n int c;\n for (c = fetchByte(); c <= ' '; c = fetchByte()) {\n }\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = fetchByte();\n }\n for (; c >= '0' && c <= '9'; c = fetchByte()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n\n public int[] nextInt(final int n) throws IOException {\n final int[] result = new int[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextInt();\n }\n return result;\n }\n\n public long nextLong() throws IOException {\n long val = 0;\n int c;\n for (c = fetchByte(); c <= ' '; c = fetchByte()) {\n }\n boolean neg = c == '-';\n if (c == '-' || c == '+') {\n c = fetchByte();\n }\n for (; c >= '0' && c <= '9'; c = fetchByte()) {\n val = (val << 3) + (val << 1) + (c & 15);\n }\n return neg ? -val : val;\n }\n\n public long[] nextLong(final int n) throws IOException {\n final long[] result = new long[n];\n for (int i = 0; i < n; i++) {\n result[i] = nextLong();\n }\n return result;\n }\n\n public void print(final Object a) throws IOException {\n out.write(a.toString().getBytes());\n }\n\n private static final byte[] SP = new byte[] { 0x20 };\n public void printsp(final Object a) throws IOException {\n out.write(a.toString().getBytes());\n out.write(SP);\n }\n\n private static final byte[] CRLF = System.lineSeparator().getBytes();\n public void println() throws IOException {\n out.write(CRLF);\n }\n\n public void println(final Object a) throws IOException {\n out.write(a.toString().getBytes());\n out.write(CRLF);\n }\n\n public void printaln(final int[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(Integer.toString(a[i]).getBytes());\n out.write(CRLF);\n }\n }\n\n public void printasp(final int[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(Integer.toString(a[i]).getBytes());\n out.write(SP);\n }\n }\n\n public void printaln(final long[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(Long.toString(a[i]).getBytes());\n out.write(CRLF);\n }\n }\n\n public void printasp(final long[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(Long.toString(a[i]).getBytes());\n out.write(SP);\n }\n }\n\n public void printaln(final Object[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(a[i].toString().getBytes());\n out.write(CRLF);\n }\n }\n\n public void printasp(final Object[] a) throws IOException {\n for (int i = 0, n = a.length; i < n; i++) {\n out.write(a[i].toString().getBytes());\n out.write(SP);\n }\n }\n\n public void flush() throws IOException {\n out.flush();\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "sample_input": "4 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02768", "source_text": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7113, "cpu_time_ms": 86, "memory_kb": 21460}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s749831319", "group_id": "codeNet:p02771", "input_text": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n \n if(A==B && A!=C){\n System.out.println(\"Yes\");\n }else if(A==C && A!=B){\n System.out.println(\"Yes\");\n }else if(B==C && B!=A){\n System.out.println(\"Yes\");\n }else{\n System.out.println(\"No\");\n }\n }\n}\n ", "language": "Java", "metadata": {"date": 1594514734, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02771/input.txt", "sample_output_relpath": "derived/input_output/data/p02771/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02771/Java/s749831319.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s749831319", "user_id": "u176003399"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n \n if(A==B && A!=C){\n System.out.println(\"Yes\");\n }else if(A==C && A!=B){\n System.out.println(\"Yes\");\n }else if(B==C && B!=A){\n System.out.println(\"Yes\");\n }else{\n System.out.println(\"No\");\n }\n }\n}\n ", "problem_context": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "sample_input": "5 7 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02771", "source_text": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 442, "cpu_time_ms": 119, "memory_kb": 35772}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s277438962", "group_id": "codeNet:p02771", "input_text": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint a = s.nextInt();\n\t\tint b = s.nextInt();\n\t\tint c = s.nextInt();\n\t\tboolean p = false;\n\t\tif (!(a==b & b==c)) {\n\t\t\tif (a==b || b==c || a==c) {\n\t\t\t\tp = true;\n\t\t\t}\n\t\t}\n\t\tif (p) {\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}else{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\n\t}\n}", "language": "Java", "metadata": {"date": 1586536967, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02771/input.txt", "sample_output_relpath": "derived/input_output/data/p02771/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02771/Java/s277438962.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s277438962", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\tint a = s.nextInt();\n\t\tint b = s.nextInt();\n\t\tint c = s.nextInt();\n\t\tboolean p = false;\n\t\tif (!(a==b & b==c)) {\n\t\t\tif (a==b || b==c || a==c) {\n\t\t\t\tp = true;\n\t\t\t}\n\t\t}\n\t\tif (p) {\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}else{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\n\t}\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "sample_input": "5 7 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02771", "source_text": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 94, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s633298552", "group_id": "codeNet:p02771", "input_text": "import java.util.*;\n \npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int m = sc.nextInt();\n int n = sc.nextInt();\n int o = sc.nextInt();\n if (m == n & m == o & n == o) {\n System.out.println(\"No\");\n } else {\n System.out.println(\"Yes\");\n }\n }\n}", "language": "Java", "metadata": {"date": 1581884354, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02771/input.txt", "sample_output_relpath": "derived/input_output/data/p02771/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02771/Java/s633298552.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s633298552", "user_id": "u512315557"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n \npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int m = sc.nextInt();\n int n = sc.nextInt();\n int o = sc.nextInt();\n if (m == n & m == o & n == o) {\n System.out.println(\"No\");\n } else {\n System.out.println(\"Yes\");\n }\n }\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "sample_input": "5 7 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02771", "source_text": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 96, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s671743685", "group_id": "codeNet:p02772", "input_text": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner scanner;\n\n\tpublic static void main(String[] args) {\n\t scanner = new Scanner(System.in);\n\n\t int N=gi();\n\t int[] A=new int[N];\n\t boolean f=true;\n\t for(int i=0; i 0){\n int item = in.nextInt();\n\n if(item%2 == 0 ){ //even\n if(item%3 == 0 || item%5 ==0 ){\n flag = true;\n }else{\n flag = false;\n break;\n }\n }\n\n n--;\n\n }\n if(flag)\n out.println(\"APPROVED\");\n else out.println(\"DENIED\");\n //int n = in.nextInt();\n\n out.close();\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}", "language": "Java", "metadata": {"date": 1581885623, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02772.html", "problem_id": "p02772", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02772/input.txt", "sample_output_relpath": "derived/input_output/data/p02772/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02772/Java/s137625502.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s137625502", "user_id": "u949301669"}, "prompt_components": {"gold_output": "APPROVED\n", "input_to_evaluate": "\n\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n\nclass Main {\n public static void main(String[] args) {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int n = in.nextInt();\n boolean flag = true;\n while(n > 0){\n int item = in.nextInt();\n\n if(item%2 == 0 ){ //even\n if(item%3 == 0 || item%5 ==0 ){\n flag = true;\n }else{\n flag = false;\n break;\n }\n }\n\n n--;\n\n }\n if(flag)\n out.println(\"APPROVED\");\n else out.println(\"DENIED\");\n //int n = in.nextInt();\n\n out.close();\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n }\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nYou are an immigration officer in the Kingdom of AtCoder. The document carried by an immigrant has some number of integers written on it, and you need to check whether they meet certain criteria.\n\nAccording to the regulation, the immigrant should be allowed entry to the kingdom if and only if the following condition is satisfied:\n\nAll even numbers written on the document are divisible by 3 or 5.\n\nIf the immigrant should be allowed entry according to the regulation, output APPROVED; otherwise, print DENIED.\n\nNotes\n\nThe condition in the statement can be rephrased as \"If x is an even number written on the document, x is divisible by 3 or 5\".\nHere \"if\" and \"or\" are logical terms.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nIf the immigrant should be allowed entry according to the regulation, print APPROVED; otherwise, print DENIED.\n\nSample Input 1\n\n5\n6 7 9 10 31\n\nSample Output 1\n\nAPPROVED\n\nThe even numbers written on the document are 6 and 10.\n\nAll of them are divisible by 3 or 5, so the immigrant should be allowed entry.\n\nSample Input 2\n\n3\n28 27 24\n\nSample Output 2\n\nDENIED\n\n28 violates the condition, so the immigrant should not be allowed entry.", "sample_input": "5\n6 7 9 10 31\n"}, "reference_outputs": ["APPROVED\n"], "source_document_id": "p02772", "source_text": "Score: 200 points\n\nProblem Statement\n\nYou are an immigration officer in the Kingdom of AtCoder. The document carried by an immigrant has some number of integers written on it, and you need to check whether they meet certain criteria.\n\nAccording to the regulation, the immigrant should be allowed entry to the kingdom if and only if the following condition is satisfied:\n\nAll even numbers written on the document are divisible by 3 or 5.\n\nIf the immigrant should be allowed entry according to the regulation, output APPROVED; otherwise, print DENIED.\n\nNotes\n\nThe condition in the statement can be rephrased as \"If x is an even number written on the document, x is divisible by 3 or 5\".\nHere \"if\" and \"or\" are logical terms.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nIf the immigrant should be allowed entry according to the regulation, print APPROVED; otherwise, print DENIED.\n\nSample Input 1\n\n5\n6 7 9 10 31\n\nSample Output 1\n\nAPPROVED\n\nThe even numbers written on the document are 6 and 10.\n\nAll of them are divisible by 3 or 5, so the immigrant should be allowed entry.\n\nSample Input 2\n\n3\n28 27 24\n\nSample Output 2\n\nDENIED\n\n28 violates the condition, so the immigrant should not be allowed entry.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1747, "cpu_time_ms": 85, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s767406486", "group_id": "codeNet:p02773", "input_text": "import java.util.*;\nimport java.util.stream.Collectors;\n\nclass Main {\n public static void main(String[] args) {\n final Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n String s[] = new String[n];\n for (int i = 0; i < n; i++) {\n s[i] = sc.next();\n }\n sc.close();\n\n Map hm = new HashMap<>();\n for (String string : s) {\n if (hm.containsKey(string)) {\n hm.put(string, hm.get(string) + 1);\n } else {\n hm.put(string, 1);\n }\n }\n int max = 0;\n for (Integer v : hm.values()) {\n if (max < v)\n max = v;\n }\n final int fmax = max;\n List t = hm.entrySet().stream().filter(e -> e.getValue() == fmax).map(e -> e.getKey()).sorted()\n .collect(Collectors.toList());\n for (String w : t) {\n System.out.println(w);\n }\n }\n}", "language": "Java", "metadata": {"date": 1581998619, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02773.html", "problem_id": "p02773", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02773/input.txt", "sample_output_relpath": "derived/input_output/data/p02773/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02773/Java/s767406486.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s767406486", "user_id": "u979552932"}, "prompt_components": {"gold_output": "beet\nvet\n", "input_to_evaluate": "import java.util.*;\nimport java.util.stream.Collectors;\n\nclass Main {\n public static void main(String[] args) {\n final Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n String s[] = new String[n];\n for (int i = 0; i < n; i++) {\n s[i] = sc.next();\n }\n sc.close();\n\n Map hm = new HashMap<>();\n for (String string : s) {\n if (hm.containsKey(string)) {\n hm.put(string, hm.get(string) + 1);\n } else {\n hm.put(string, 1);\n }\n }\n int max = 0;\n for (Integer v : hm.values()) {\n if (max < v)\n max = v;\n }\n final int fmax = max;\n List t = hm.entrySet().stream().filter(e -> e.getValue() == fmax).map(e -> e.getKey()).sorted()\n .collect(Collectors.toList());\n for (String w : t) {\n System.out.println(w);\n }\n }\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "sample_input": "7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n"}, "reference_outputs": ["beet\nvet\n"], "source_document_id": "p02773", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 996, "cpu_time_ms": 1797, "memory_kb": 79504}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s399268118", "group_id": "codeNet:p02773", "input_text": "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n int [] in = new int [a];\n String [] str = new String [a];\n for(int i=0;i=1 && str[i].equals(str[i-1])){in[b]++;if(in[b]>c){c = in[b];}\n \n }else{b=i;in[i]++;}\n }\n for(int i=0;i=1 && str[i].equals(str[i-1])){in[b]++;if(in[b]>c){c = in[b];}\n \n }else{b=i;in[i]++;}\n }\n for(int i=0;i primes;\n\n public void setSieve() {\n primes = new ArrayList<>();\n sieve = new int[MAXN];\n int i, j;\n for (i = 2; i < MAXN; ++i)\n if (sieve[i] == 0) {\n primes.add(i);\n for (j = i; j < MAXN; j += i) {\n sieve[j] = i;\n }\n }\n }\n\n\n public static long[] factorial;\n\n public void setFactorial() {\n factorial = new long[MAXN];\n factorial[0] = 1;\n for (int i = 1; i < MAXN; ++i) factorial[i] = factorial[i - 1] * i % MOD;\n }\n\n public long getFactorial(int n) {\n if (factorial == null) setFactorial();\n return factorial[n];\n }\n\n public long ncr(int n, int r) {\n if (r > n) return 0;\n if (factorial == null) setFactorial();\n long numerator = factorial[n];\n long denominator = factorial[r] * factorial[n - r] % MOD;\n return numerator * pow(denominator, MOD - 2, MOD) % MOD;\n }\n\n\n public long[] getLongArray(int size) throws Exception {\n long[] ar = new long[size];\n for (int i = 0; i < size; ++i) ar[i] = nextLong();\n return ar;\n }\n\n public int[] getIntArray(int size) throws Exception {\n int[] ar = new int[size];\n for (int i = 0; i < size; ++i) ar[i] = nextInt();\n return ar;\n }\n\n public String[] getStringArray(int size) throws Exception {\n String[] ar = new String[size];\n for (int i = 0; i < size; ++i) ar[i] = next();\n return ar;\n }\n\n public String joinElements(long... ar) {\n StringBuilder sb = new StringBuilder();\n for (long itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n\n public String joinElements(int... ar) {\n StringBuilder sb = new StringBuilder();\n for (int itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n public String joinElements(String... ar) {\n StringBuilder sb = new StringBuilder();\n for (String itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n public String joinElements(Object... ar) {\n StringBuilder sb = new StringBuilder();\n for (Object itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n\n public long gcd(long a, long b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n public int gcd(int a, int b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n\n public long max(long... ar) {\n long ret = ar[0];\n for (long itr : ar) ret = Math.max(ret, itr);\n return ret;\n }\n\n public int max(int... ar) {\n int ret = ar[0];\n for (int itr : ar) ret = Math.max(ret, itr);\n return ret;\n }\n\n public long min(long... ar) {\n long ret = ar[0];\n for (long itr : ar) ret = Math.min(ret, itr);\n return ret;\n }\n\n public int min(int... ar) {\n int ret = ar[0];\n for (int itr : ar) ret = Math.min(ret, itr);\n return ret;\n }\n\n\n public long sum(long... ar) {\n long sum = 0;\n for (long itr : ar) sum += itr;\n return sum;\n }\n\n public long sum(int... ar) {\n long sum = 0;\n for (int itr : ar) sum += itr;\n return sum;\n }\n\n public void shuffle(int[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = rnd.nextInt(ar.length);\n if (r != i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void shuffle(long[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = rnd.nextInt(ar.length);\n if (r != i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void reverse(int[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = ar.length - 1 - i;\n if (r > i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void reverse(long[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = ar.length - 1 - i;\n if (r > i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public long pow(long base, long exp, long MOD) {\n base %= MOD;\n long ret = 1;\n while (exp > 0) {\n if ((exp & 1) == 1) ret = ret * base % MOD;\n base = base * base % MOD;\n exp >>= 1;\n }\n return ret;\n }\n\n\n static final int BUFSIZE = 1 << 20;\n static byte[] buf;\n static int index, total;\n static InputStream in;\n static BufferedWriter bw;\n\n\n public void initIO(InputStream is, OutputStream os) {\n try {\n in = is;\n bw = new BufferedWriter(new OutputStreamWriter(os));\n buf = new byte[BUFSIZE];\n } catch (Exception e) {\n }\n }\n\n public void initIO(String inputFile, String outputFile) {\n try {\n in = new FileInputStream(inputFile);\n bw = new BufferedWriter(new OutputStreamWriter(\n new FileOutputStream(outputFile)));\n buf = new byte[BUFSIZE];\n } catch (Exception e) {\n }\n }\n\n private int scan() throws Exception {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0)\n return -1;\n }\n return buf[index++];\n }\n\n public String next() throws Exception {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan())\n sb.append((char) c);\n return sb.toString();\n }\n\n public int nextInt() throws Exception {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+')\n c = scan();\n for (; c >= '0' && c <= '9'; c = scan())\n val = (val << 3) + (val << 1) + (c & 15);\n return neg ? -val : val;\n }\n\n public long nextLong() throws Exception {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+')\n c = scan();\n for (; c >= '0' && c <= '9'; c = scan())\n val = (val << 3) + (val << 1) + (c & 15);\n return neg ? -val : val;\n }\n\n public void print(Object a) throws Exception {\n bw.write(a.toString());\n }\n\n public void printsp(Object a) throws Exception {\n print(a);\n print(\" \");\n }\n\n public void println() throws Exception {\n bw.write(\"\\n\");\n }\n\n public void println(Object a) throws Exception {\n print(a);\n println();\n }\n\n public void flush() throws Exception {\n bw.flush();\n }\n}\n", "language": "Java", "metadata": {"date": 1581279052, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02778.html", "problem_id": "p02778", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02778/input.txt", "sample_output_relpath": "derived/input_output/data/p02778/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02778/Java/s912270114.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s912270114", "user_id": "u481050822"}, "prompt_components": {"gold_output": "xxxxxxx\n", "input_to_evaluate": "import java.math.*;\nimport java.io.*;\nimport java.util.*;\nimport java.awt.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Run run = new Run();\n new Thread(null, run, \"Solver\", 1l << 28).start();\n //run.run();\n }\n\n static class Run implements Runnable {\n @Override\n public void run() {\n try {\n new Solver().solve();\n System.exit(0);\n } catch (Error | Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n }\n}\n\nclass Solver {\n final Helper hp;\n final int MAXN = 1000_006;\n final long MOD = (long) 1e9 + 7;\n\n final Timer timer;\n final TimerTask task;\n\n Solver() {\n hp = new Helper(MOD, MAXN);\n hp.initIO(System.in, System.out);\n\n timer = new Timer();\n task = new TimerTask() {\n @Override\n public void run() {\n try {\n hp.flush();\n System.exit(0);\n } catch (Exception e) {\n }\n }\n };\n //timer.schedule(task, 4700);\n }\n\n int N, M;\n int[] X, Y;\n\n void solve() throws Exception {\n int i, j, k;\n boolean testCases = false;\n\n int tc = testCases ? hp.nextInt() : 1;\n for (int tce = 1; tce <= tc; tce++) {\n int N = hp.next().length();\n for (i = 0; i < N; ++i) hp.print(\"x\");\n }\n\n timer.cancel();\n hp.flush();\n }\n\n}\n\nclass Helper {\n final long MOD;\n final int MAXN;\n final Random rnd;\n\n public Helper(long mod, int maxn) {\n MOD = mod;\n MAXN = maxn;\n rnd = new Random();\n }\n\n\n public static int[] sieve;\n public static ArrayList primes;\n\n public void setSieve() {\n primes = new ArrayList<>();\n sieve = new int[MAXN];\n int i, j;\n for (i = 2; i < MAXN; ++i)\n if (sieve[i] == 0) {\n primes.add(i);\n for (j = i; j < MAXN; j += i) {\n sieve[j] = i;\n }\n }\n }\n\n\n public static long[] factorial;\n\n public void setFactorial() {\n factorial = new long[MAXN];\n factorial[0] = 1;\n for (int i = 1; i < MAXN; ++i) factorial[i] = factorial[i - 1] * i % MOD;\n }\n\n public long getFactorial(int n) {\n if (factorial == null) setFactorial();\n return factorial[n];\n }\n\n public long ncr(int n, int r) {\n if (r > n) return 0;\n if (factorial == null) setFactorial();\n long numerator = factorial[n];\n long denominator = factorial[r] * factorial[n - r] % MOD;\n return numerator * pow(denominator, MOD - 2, MOD) % MOD;\n }\n\n\n public long[] getLongArray(int size) throws Exception {\n long[] ar = new long[size];\n for (int i = 0; i < size; ++i) ar[i] = nextLong();\n return ar;\n }\n\n public int[] getIntArray(int size) throws Exception {\n int[] ar = new int[size];\n for (int i = 0; i < size; ++i) ar[i] = nextInt();\n return ar;\n }\n\n public String[] getStringArray(int size) throws Exception {\n String[] ar = new String[size];\n for (int i = 0; i < size; ++i) ar[i] = next();\n return ar;\n }\n\n public String joinElements(long... ar) {\n StringBuilder sb = new StringBuilder();\n for (long itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n\n public String joinElements(int... ar) {\n StringBuilder sb = new StringBuilder();\n for (int itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n public String joinElements(String... ar) {\n StringBuilder sb = new StringBuilder();\n for (String itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n public String joinElements(Object... ar) {\n StringBuilder sb = new StringBuilder();\n for (Object itr : ar) sb.append(itr).append(\" \");\n return sb.toString().trim();\n }\n\n\n public long gcd(long a, long b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n public int gcd(int a, int b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n\n\n public long max(long... ar) {\n long ret = ar[0];\n for (long itr : ar) ret = Math.max(ret, itr);\n return ret;\n }\n\n public int max(int... ar) {\n int ret = ar[0];\n for (int itr : ar) ret = Math.max(ret, itr);\n return ret;\n }\n\n public long min(long... ar) {\n long ret = ar[0];\n for (long itr : ar) ret = Math.min(ret, itr);\n return ret;\n }\n\n public int min(int... ar) {\n int ret = ar[0];\n for (int itr : ar) ret = Math.min(ret, itr);\n return ret;\n }\n\n\n public long sum(long... ar) {\n long sum = 0;\n for (long itr : ar) sum += itr;\n return sum;\n }\n\n public long sum(int... ar) {\n long sum = 0;\n for (int itr : ar) sum += itr;\n return sum;\n }\n\n public void shuffle(int[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = rnd.nextInt(ar.length);\n if (r != i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void shuffle(long[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = rnd.nextInt(ar.length);\n if (r != i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void reverse(int[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = ar.length - 1 - i;\n if (r > i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public void reverse(long[] ar) {\n int r;\n for (int i = 0; i < ar.length; ++i) {\n r = ar.length - 1 - i;\n if (r > i) {\n ar[i] ^= ar[r];\n ar[r] ^= ar[i];\n ar[i] ^= ar[r];\n }\n }\n }\n\n public long pow(long base, long exp, long MOD) {\n base %= MOD;\n long ret = 1;\n while (exp > 0) {\n if ((exp & 1) == 1) ret = ret * base % MOD;\n base = base * base % MOD;\n exp >>= 1;\n }\n return ret;\n }\n\n\n static final int BUFSIZE = 1 << 20;\n static byte[] buf;\n static int index, total;\n static InputStream in;\n static BufferedWriter bw;\n\n\n public void initIO(InputStream is, OutputStream os) {\n try {\n in = is;\n bw = new BufferedWriter(new OutputStreamWriter(os));\n buf = new byte[BUFSIZE];\n } catch (Exception e) {\n }\n }\n\n public void initIO(String inputFile, String outputFile) {\n try {\n in = new FileInputStream(inputFile);\n bw = new BufferedWriter(new OutputStreamWriter(\n new FileOutputStream(outputFile)));\n buf = new byte[BUFSIZE];\n } catch (Exception e) {\n }\n }\n\n private int scan() throws Exception {\n if (index >= total) {\n index = 0;\n total = in.read(buf);\n if (total <= 0)\n return -1;\n }\n return buf[index++];\n }\n\n public String next() throws Exception {\n int c;\n for (c = scan(); c <= 32; c = scan()) ;\n StringBuilder sb = new StringBuilder();\n for (; c > 32; c = scan())\n sb.append((char) c);\n return sb.toString();\n }\n\n public int nextInt() throws Exception {\n int c, val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+')\n c = scan();\n for (; c >= '0' && c <= '9'; c = scan())\n val = (val << 3) + (val << 1) + (c & 15);\n return neg ? -val : val;\n }\n\n public long nextLong() throws Exception {\n int c;\n long val = 0;\n for (c = scan(); c <= 32; c = scan()) ;\n boolean neg = c == '-';\n if (c == '-' || c == '+')\n c = scan();\n for (; c >= '0' && c <= '9'; c = scan())\n val = (val << 3) + (val << 1) + (c & 15);\n return neg ? -val : val;\n }\n\n public void print(Object a) throws Exception {\n bw.write(a.toString());\n }\n\n public void printsp(Object a) throws Exception {\n print(a);\n print(\" \");\n }\n\n public void println() throws Exception {\n bw.write(\"\\n\");\n }\n\n public void println(Object a) throws Exception {\n print(a);\n println();\n }\n\n public void flush() throws Exception {\n bw.flush();\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is a string S. Replace every character in S with x and print the result.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace every character in S with x and print the result.\n\nSample Input 1\n\nsardine\n\nSample Output 1\n\nxxxxxxx\n\nReplacing every character in S with x results in xxxxxxx.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\nxxxx\n\nSample Input 3\n\ngone\n\nSample Output 3\n\nxxxx", "sample_input": "sardine\n"}, "reference_outputs": ["xxxxxxx\n"], "source_document_id": "p02778", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is a string S. Replace every character in S with x and print the result.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace every character in S with x and print the result.\n\nSample Input 1\n\nsardine\n\nSample Output 1\n\nxxxxxxx\n\nReplacing every character in S with x results in xxxxxxx.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\nxxxx\n\nSample Input 3\n\ngone\n\nSample Output 3\n\nxxxx", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8874, "cpu_time_ms": 79, "memory_kb": 25812}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s317065670", "group_id": "codeNet:p02781", "input_text": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n char[] S = sc.next().toCharArray();\n int N = S.length;\n int K = sc.nextInt();\n int[][][] dp = new int[N+1][K+1][2];\n dp[0][0][1] = 1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j <= K; j++) {\n for (int s = 0; s < 2; s++) {\n if (dp[i][j][s] == 0) continue;\n if (s == 0) {\n dp[i+1][j][0] += dp[i][j][0];\n if (j+1 <= K) {\n dp[i+1][j+1][0] += 9*dp[i][j][0];\n }\n } else {\n int a = S[i]-'0';\n if (a == 0) {\n dp[i+1][j][1] += dp[i][j][1];\n } else {\n dp[i+1][j][0] += dp[i][j][1];\n if (j+1 <= K) {\n dp[i+1][j+1][0] += (a-1)*dp[i][j][1];\n dp[i+1][j+1][1] += dp[i][j][1];\n }\n }\n }\n }\n }\n }\n System.out.println(dp[N][K][0]+dp[N][K][1]);\n }\n}\n\n", "language": "Java", "metadata": {"date": 1588680391, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02781.html", "problem_id": "p02781", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02781/input.txt", "sample_output_relpath": "derived/input_output/data/p02781/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02781/Java/s317065670.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s317065670", "user_id": "u507706381"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n char[] S = sc.next().toCharArray();\n int N = S.length;\n int K = sc.nextInt();\n int[][][] dp = new int[N+1][K+1][2];\n dp[0][0][1] = 1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j <= K; j++) {\n for (int s = 0; s < 2; s++) {\n if (dp[i][j][s] == 0) continue;\n if (s == 0) {\n dp[i+1][j][0] += dp[i][j][0];\n if (j+1 <= K) {\n dp[i+1][j+1][0] += 9*dp[i][j][0];\n }\n } else {\n int a = S[i]-'0';\n if (a == 0) {\n dp[i+1][j][1] += dp[i][j][1];\n } else {\n dp[i+1][j][0] += dp[i][j][1];\n if (j+1 <= K) {\n dp[i+1][j+1][0] += (a-1)*dp[i][j][1];\n dp[i+1][j+1][1] += dp[i][j][1];\n }\n }\n }\n }\n }\n }\n System.out.println(dp[N][K][0]+dp[N][K][1]);\n }\n}\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFind the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten.\n\nConstraints\n\n1 \\leq N < 10^{100}\n\n1 \\leq K \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n100\n1\n\nSample Output 1\n\n19\n\nThe following 19 integers satisfy the condition:\n\n1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100\n\nSample Input 2\n\n25\n2\n\nSample Output 2\n\n14\n\nThe following 14 integers satisfy the condition:\n\n11,12,13,14,15,16,17,18,19,21,22,23,24,25\n\nSample Input 3\n\n314159\n2\n\nSample Output 3\n\n937\n\nSample Input 4\n\n9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\n3\n\nSample Output 4\n\n117879300", "sample_input": "100\n1\n"}, "reference_outputs": ["19\n"], "source_document_id": "p02781", "source_text": "Score : 500 points\n\nProblem Statement\n\nFind the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten.\n\nConstraints\n\n1 \\leq N < 10^{100}\n\n1 \\leq K \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n100\n1\n\nSample Output 1\n\n19\n\nThe following 19 integers satisfy the condition:\n\n1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100\n\nSample Input 2\n\n25\n2\n\nSample Output 2\n\n14\n\nThe following 14 integers satisfy the condition:\n\n11,12,13,14,15,16,17,18,19,21,22,23,24,25\n\nSample Input 3\n\n314159\n2\n\nSample Output 3\n\n937\n\nSample Input 4\n\n9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\n3\n\nSample Output 4\n\n117879300", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1316, "cpu_time_ms": 97, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s644116929", "group_id": "codeNet:p02781", "input_text": "import java.util.Scanner;\n\nclass Solver {\n public void Solve() {\n String s = sc.next();\n int k = sc.nextInt();\n long len = s.length();\n int first = Integer.parseInt(s.substring(0, 1));\n long ans = 0;\n if (k == 1) {\n ans = solve1(len, s);\n } else if (k == 2) {\n ans = solve2(len, s);\n } else {\n ans = solve3(len, s);\n }\n System.out.println(ans);\n int a = 0;\n\n }\n\n public long solve1(long len, String s) {\n // System.out.println(s);\n while (true) {\n if (s.length() == 0) {\n return 0;\n }\n if (s.charAt(0) != '0') {\n break;\n } else {\n s = s.substring(1);\n }\n }\n len = s.length();\n int first = Integer.parseInt(s.substring(0, 1));\n long ans = 0;\n ans += (len - 1) * 9;\n ans += first;\n // System.out.println(ans);\n return ans;\n }\n\n public long solve2(long len, String s) {\n // System.out.println(s);\n while (true) {\n if (s.length() <= 1) {\n return 0;\n }\n if (s.charAt(0) != '0') {\n break;\n } else {\n s = s.substring(1);\n }\n }\n len = s.length();\n int first = Integer.parseInt(s.substring(0, 1));\n long ans = 0;\n ans += (len - 1) * (len - 2) / 2 * 9 * 9;\n ans += (first - 1) * (len - 1) * 9;\n ans += solve1(len, s.substring(1));\n // System.out.println(ans);\n return ans;\n }\n\n public long solve3(long len, String s) {\n // System.out.println(s);\n while (true) {\n if (s.length() < 3) {\n return 0;\n }\n if (s.charAt(0) != '0') {\n break;\n } else {\n s = s.substring(1);\n }\n }\n long ans = 0;\n int first = Integer.parseInt(s.substring(0, 1));\n ans += (len - 1) * (len - 2) * (len - 3) / 2 * 3 * 9 * 9;\n ans += (first - 1) * (len - 1) * (len - 2) / 2 * 9 * 9;\n ans += solve2(len, s.substring(1));\n // System.out.println(ans);\n return ans;\n // int next = Integer.parseInt(s.substring(1, 2));\n // if (len == 3) {\n // ans += (first - 1) * 9 * 9;\n // ans += next * 9;\n // System.out.println(ans);\n // return 0;\n // }\n // // 先頭使わない\n // ans += (len - 1) * (len - 2) * (len - 3) / 2 * 3 * 9 * 9;\n // // 先頭使う 最大ではない\n // ans += (first - 1) * (len - 1) * (len - 2) / 2 * 9 * 9;\n // if (next != 0) {\n // // 先頭最大値 2番目最大でない\n // ans += (next - 1) * (len - 2) * 9;\n // }\n // ans += (len - 2) * (len - 3) / 2 * 9 * 9;\n // // ans += (len - 3) * 9;\n // for (int i = 2; i < len; i++) {\n // int a = Integer.parseInt(s.substring(i, i + 1));\n // if (a == 0) {\n // continue;\n // } else {\n // ans += a;\n // ans += (len - 1 - i) * 9;\n // break;\n // }\n // }\n // // 先頭最大 2番目も最大\n // // ans += (third - 1) * (len - 3) * 9;\n // System.out.println(ans);\n // return ans;\n }\n\n Scanner sc;\n\n Solver(Scanner in) {\n this.sc = in;\n }\n}\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n Solver s = new Solver(sc);\n s.Solve();\n sc.close();\n }\n}\n", "language": "Java", "metadata": {"date": 1581284362, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02781.html", "problem_id": "p02781", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02781/input.txt", "sample_output_relpath": "derived/input_output/data/p02781/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02781/Java/s644116929.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s644116929", "user_id": "u045712871"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Solver {\n public void Solve() {\n String s = sc.next();\n int k = sc.nextInt();\n long len = s.length();\n int first = Integer.parseInt(s.substring(0, 1));\n long ans = 0;\n if (k == 1) {\n ans = solve1(len, s);\n } else if (k == 2) {\n ans = solve2(len, s);\n } else {\n ans = solve3(len, s);\n }\n System.out.println(ans);\n int a = 0;\n\n }\n\n public long solve1(long len, String s) {\n // System.out.println(s);\n while (true) {\n if (s.length() == 0) {\n return 0;\n }\n if (s.charAt(0) != '0') {\n break;\n } else {\n s = s.substring(1);\n }\n }\n len = s.length();\n int first = Integer.parseInt(s.substring(0, 1));\n long ans = 0;\n ans += (len - 1) * 9;\n ans += first;\n // System.out.println(ans);\n return ans;\n }\n\n public long solve2(long len, String s) {\n // System.out.println(s);\n while (true) {\n if (s.length() <= 1) {\n return 0;\n }\n if (s.charAt(0) != '0') {\n break;\n } else {\n s = s.substring(1);\n }\n }\n len = s.length();\n int first = Integer.parseInt(s.substring(0, 1));\n long ans = 0;\n ans += (len - 1) * (len - 2) / 2 * 9 * 9;\n ans += (first - 1) * (len - 1) * 9;\n ans += solve1(len, s.substring(1));\n // System.out.println(ans);\n return ans;\n }\n\n public long solve3(long len, String s) {\n // System.out.println(s);\n while (true) {\n if (s.length() < 3) {\n return 0;\n }\n if (s.charAt(0) != '0') {\n break;\n } else {\n s = s.substring(1);\n }\n }\n long ans = 0;\n int first = Integer.parseInt(s.substring(0, 1));\n ans += (len - 1) * (len - 2) * (len - 3) / 2 * 3 * 9 * 9;\n ans += (first - 1) * (len - 1) * (len - 2) / 2 * 9 * 9;\n ans += solve2(len, s.substring(1));\n // System.out.println(ans);\n return ans;\n // int next = Integer.parseInt(s.substring(1, 2));\n // if (len == 3) {\n // ans += (first - 1) * 9 * 9;\n // ans += next * 9;\n // System.out.println(ans);\n // return 0;\n // }\n // // 先頭使わない\n // ans += (len - 1) * (len - 2) * (len - 3) / 2 * 3 * 9 * 9;\n // // 先頭使う 最大ではない\n // ans += (first - 1) * (len - 1) * (len - 2) / 2 * 9 * 9;\n // if (next != 0) {\n // // 先頭最大値 2番目最大でない\n // ans += (next - 1) * (len - 2) * 9;\n // }\n // ans += (len - 2) * (len - 3) / 2 * 9 * 9;\n // // ans += (len - 3) * 9;\n // for (int i = 2; i < len; i++) {\n // int a = Integer.parseInt(s.substring(i, i + 1));\n // if (a == 0) {\n // continue;\n // } else {\n // ans += a;\n // ans += (len - 1 - i) * 9;\n // break;\n // }\n // }\n // // 先頭最大 2番目も最大\n // // ans += (third - 1) * (len - 3) * 9;\n // System.out.println(ans);\n // return ans;\n }\n\n Scanner sc;\n\n Solver(Scanner in) {\n this.sc = in;\n }\n}\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n Solver s = new Solver(sc);\n s.Solve();\n sc.close();\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFind the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten.\n\nConstraints\n\n1 \\leq N < 10^{100}\n\n1 \\leq K \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n100\n1\n\nSample Output 1\n\n19\n\nThe following 19 integers satisfy the condition:\n\n1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100\n\nSample Input 2\n\n25\n2\n\nSample Output 2\n\n14\n\nThe following 14 integers satisfy the condition:\n\n11,12,13,14,15,16,17,18,19,21,22,23,24,25\n\nSample Input 3\n\n314159\n2\n\nSample Output 3\n\n937\n\nSample Input 4\n\n9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\n3\n\nSample Output 4\n\n117879300", "sample_input": "100\n1\n"}, "reference_outputs": ["19\n"], "source_document_id": "p02781", "source_text": "Score : 500 points\n\nProblem Statement\n\nFind the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten.\n\nConstraints\n\n1 \\leq N < 10^{100}\n\n1 \\leq K \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n100\n1\n\nSample Output 1\n\n19\n\nThe following 19 integers satisfy the condition:\n\n1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100\n\nSample Input 2\n\n25\n2\n\nSample Output 2\n\n14\n\nThe following 14 integers satisfy the condition:\n\n11,12,13,14,15,16,17,18,19,21,22,23,24,25\n\nSample Input 3\n\n314159\n2\n\nSample Output 3\n\n937\n\nSample Input 4\n\n9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\n3\n\nSample Output 4\n\n117879300", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3632, "cpu_time_ms": 100, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s447195199", "group_id": "codeNet:p02783", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint h = sc.nextInt();\n\t\tint a = sc.nextInt();\n\n\t\tif ((h % a) != 0) {\n\t\t\tSystem.out.println((h / a) + 1);\n\t\t} else {\n\t\t\tSystem.out.println((h / a));\n\t\t}\n\n\t\tsc.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1593078646, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02783/input.txt", "sample_output_relpath": "derived/input_output/data/p02783/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02783/Java/s447195199.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s447195199", "user_id": "u424790745"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint h = sc.nextInt();\n\t\tint a = sc.nextInt();\n\n\t\tif ((h % a) != 0) {\n\t\t\tSystem.out.println((h / a) + 1);\n\t\t} else {\n\t\t\tSystem.out.println((h / a));\n\t\t}\n\n\t\tsc.close();\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 302, "cpu_time_ms": 98, "memory_kb": 26960}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s699146736", "group_id": "codeNet:p02783", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int h = sc.nextInt();\n int a = sc.nextInt();\n \n if(h % a == 0) {\n System.out.println(h / a);\n }else {\n System.out.println(h / a + 1);\n }\n\n }\n}\n", "language": "Java", "metadata": {"date": 1587146708, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02783/input.txt", "sample_output_relpath": "derived/input_output/data/p02783/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02783/Java/s699146736.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s699146736", "user_id": "u873167698"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n int h = sc.nextInt();\n int a = sc.nextInt();\n \n if(h % a == 0) {\n System.out.println(h / a);\n }else {\n System.out.println(h / a + 1);\n }\n\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 359, "cpu_time_ms": 98, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s635889098", "group_id": "codeNet:p02783", "input_text": "\n import java.util.*;\n public class Main {\n \tpublic static void main(String[] args){\n \n \t\tScanner sc = new Scanner(System.in);\n \t\t\n \t\t int a = sc.nextInt();\n \t\t int b = sc.nextInt();\n \t\t int c=(a/b)+1;\n \n \t \n \t System.out.println(c);\n \n \t}\n }", "language": "Java", "metadata": {"date": 1580069096, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02783/input.txt", "sample_output_relpath": "derived/input_output/data/p02783/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02783/Java/s635889098.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s635889098", "user_id": "u021490137"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\n import java.util.*;\n public class Main {\n \tpublic static void main(String[] args){\n \n \t\tScanner sc = new Scanner(System.in);\n \t\t\n \t\t int a = sc.nextInt();\n \t\t int b = sc.nextInt();\n \t\t int c=(a/b)+1;\n \n \t \n \t System.out.println(c);\n \n \t}\n }", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 307, "cpu_time_ms": 107, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s264814851", "group_id": "codeNet:p02783", "input_text": "import java.lang.reflect.Array;\nimport java.util.*;\n\npublic class Main {\n\n static int MOD = 1000000007;\n\n\n public static void main(String[] args) {\n\n //int ans=Integer.MAX_VALUE;\n Scanner sc = new Scanner(System.in);\n int h=sc.nextInt();\n int a =sc.nextInt();\n int ans;\n if(h%a==0)ans=h/a;\n else ans=h/a+1;\n\n System.out.println(ans);\n\n\n\n\n\n\n }\n\n\n}\n", "language": "Java", "metadata": {"date": 1580069067, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02783/input.txt", "sample_output_relpath": "derived/input_output/data/p02783/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02783/Java/s264814851.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s264814851", "user_id": "u740900993"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.lang.reflect.Array;\nimport java.util.*;\n\npublic class Main {\n\n static int MOD = 1000000007;\n\n\n public static void main(String[] args) {\n\n //int ans=Integer.MAX_VALUE;\n Scanner sc = new Scanner(System.in);\n int h=sc.nextInt();\n int a =sc.nextInt();\n int ans;\n if(h%a==0)ans=h/a;\n else ans=h/a+1;\n\n System.out.println(ans);\n\n\n\n\n\n\n }\n\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 412, "cpu_time_ms": 222, "memory_kb": 23760}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s580593125", "group_id": "codeNet:p02783", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\n\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint h = sc.nextInt();\n\t\t\n\t\tint a = sc.nextInt();\n\t\tint n = h/a;\n\t\tif(n*a==h) {\n\t\t\tSystem.out.println(n);\n\t\t}else {\n\t\t\tSystem.out.println(n+1);\n\t\t\t\n\t\t}\n\t}\n\n}\n/*\nclass City{\n\tint order;\n\tint prefecture;\n\tint year;\n\tint number;\n\tCity(int order,int prefecture, int year){\n\t\tthis.order = order;\n\t\tthis.prefecture = prefecture;\n\t\tthis.year = year;\n\t}\n}\n*/\n", "language": "Java", "metadata": {"date": 1580068999, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02783/input.txt", "sample_output_relpath": "derived/input_output/data/p02783/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02783/Java/s580593125.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s580593125", "user_id": "u916565298"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args){\n\n\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint h = sc.nextInt();\n\t\t\n\t\tint a = sc.nextInt();\n\t\tint n = h/a;\n\t\tif(n*a==h) {\n\t\t\tSystem.out.println(n);\n\t\t}else {\n\t\t\tSystem.out.println(n+1);\n\t\t\t\n\t\t}\n\t}\n\n}\n/*\nclass City{\n\tint order;\n\tint prefecture;\n\tint year;\n\tint number;\n\tCity(int order,int prefecture, int year){\n\t\tthis.order = order;\n\t\tthis.prefecture = prefecture;\n\t\tthis.year = year;\n\t}\n}\n*/\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 482, "cpu_time_ms": 109, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s528042575", "group_id": "codeNet:p02785", "input_text": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\t\n\t\tScanner sc=new Scanner(System.in);\n\t\tArrayListhp=new ArrayList<>();\n\t\t\n\t\t//モンスターの数\n\t\tlong N=sc.nextLong();\n\t\t//使える必殺技の回数\n\t\tlong K=sc.nextLong();\n\t\t//フェネックの総攻撃回数\n\t\tlong attackResult=0;\n\t\t\n\t\t//個々のモンスターの体力\n\t\tfor(int i=0;iK) {\n\t\t\t\n\t\t\tfor(int i=0;ihp=new ArrayList<>();\n\t\t\n\t\t//モンスターの数\n\t\tlong N=sc.nextLong();\n\t\t//使える必殺技の回数\n\t\tlong K=sc.nextLong();\n\t\t//フェネックの総攻撃回数\n\t\tlong attackResult=0;\n\t\t\n\t\t//個々のモンスターの体力\n\t\tfor(int i=0;iK) {\n\t\t\t\n\t\t\tfor(int i=0;i= n) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tlong ans = 0;\n\t\t\tfor (int i = 0; i < n - k; i++) {\n\t\t\t\tans += a[i];\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1582961179, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02785/input.txt", "sample_output_relpath": "derived/input_output/data/p02785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02785/Java/s856928409.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s856928409", "user_id": "u101079650"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong k = sc.nextLong();\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tif (k >= n) {\n\t\t\tSystem.out.println(0);\n\t\t} else {\n\t\t\tlong ans = 0;\n\t\t\tfor (int i = 0; i < n - k; i++) {\n\t\t\t\tans += a[i];\n\t\t\t}\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 489, "cpu_time_ms": 610, "memory_kb": 83384}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s831573931", "group_id": "codeNet:p02785", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int numMon = scanner.nextInt();\n int special = scanner.nextInt();\n int[] hps = new int[numMon];\n for(int i = 0; i < numMon; i++) {\n hps[i] = scanner.nextInt();\n }\n scanner.close();\n\n Arrays.sort(hps);\n int removeNum = Math.min(special, numMon);\n long remainSum = 0;\n for(int i = removeNum; i < numMon; i++) {\n remainSum += hps[i];\n }\n\n System.out.println(remainSum);\n }\n}", "language": "Java", "metadata": {"date": 1580070546, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02785/input.txt", "sample_output_relpath": "derived/input_output/data/p02785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02785/Java/s831573931.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s831573931", "user_id": "u787406202"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int numMon = scanner.nextInt();\n int special = scanner.nextInt();\n int[] hps = new int[numMon];\n for(int i = 0; i < numMon; i++) {\n hps[i] = scanner.nextInt();\n }\n scanner.close();\n\n Arrays.sort(hps);\n int removeNum = Math.min(special, numMon);\n long remainSum = 0;\n for(int i = removeNum; i < numMon; i++) {\n remainSum += hps[i];\n }\n\n System.out.println(remainSum);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 648, "cpu_time_ms": 619, "memory_kb": 67628}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s403753205", "group_id": "codeNet:p02787", "input_text": "import java.util.ArrayList;\nimport java.util.Comparator;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.stream.Collectors;\n\npublic class Main {\n\n private static class Magic {\n\n int attackPoint;\n int cost;\n\n Magic(int attackPoint, int cost) {\n this.attackPoint = attackPoint;\n this.cost = cost;\n }\n }\n\n private static int minCost;\n private static List magicsInAscendingOrderOfCost = new ArrayList<>();\n\n public static void main(String[] args) {\n final Scanner scanner = new Scanner(System.in);\n int hitPoint = scanner.nextInt();\n final int numberOfMagic = scanner.nextInt();\n final List magics = new ArrayList<>();\n\n minCost = Integer.MAX_VALUE;\n for (int i = 0; i < numberOfMagic; i++) {\n Magic magic = new Magic(scanner.nextInt(), scanner.nextInt());\n magics.add(magic);\n\n if (minCost > magic.cost) {\n minCost = magic.cost;\n }\n }\n magicsInAscendingOrderOfCost = magics.stream()\n .sorted(Comparator.comparingInt(magic -> magic.cost))\n .collect(Collectors.toList());\n\n System.out.println(getCost(hitPoint));\n }\n\n private static long getCost(int hitPoint) {\n final int attackPointOfMinCost = magicsInAscendingOrderOfCost.get(0).attackPoint;\n if (hitPoint <= attackPointOfMinCost) {\n return minCost;\n }\n\n long[] minCosts = new long[hitPoint + 1];\n for (int i = 0; i <= attackPointOfMinCost; i++) {\n minCosts[i] = minCost;\n }\n\n for (int currentHitPoint = attackPointOfMinCost + 1; currentHitPoint <= hitPoint;\n currentHitPoint++) {\n\n long minCostCandidate = Long.MAX_VALUE;\n for (Magic magic : magicsInAscendingOrderOfCost) {\n int remainingHitPoint = currentHitPoint - magic.attackPoint;\n\n long candidate =\n remainingHitPoint > 0 ? minCosts[remainingHitPoint] + magic.cost : magic.cost;\n\n if (candidate < minCostCandidate) {\n minCostCandidate = candidate;\n }\n }\n\n minCosts[currentHitPoint] = minCostCandidate;\n }\n\n return minCosts[hitPoint];\n }\n}", "language": "Java", "metadata": {"date": 1600448968, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02787.html", "problem_id": "p02787", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02787/input.txt", "sample_output_relpath": "derived/input_output/data/p02787/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02787/Java/s403753205.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s403753205", "user_id": "u149362554"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Comparator;\nimport java.util.List;\nimport java.util.Scanner;\nimport java.util.stream.Collectors;\n\npublic class Main {\n\n private static class Magic {\n\n int attackPoint;\n int cost;\n\n Magic(int attackPoint, int cost) {\n this.attackPoint = attackPoint;\n this.cost = cost;\n }\n }\n\n private static int minCost;\n private static List magicsInAscendingOrderOfCost = new ArrayList<>();\n\n public static void main(String[] args) {\n final Scanner scanner = new Scanner(System.in);\n int hitPoint = scanner.nextInt();\n final int numberOfMagic = scanner.nextInt();\n final List magics = new ArrayList<>();\n\n minCost = Integer.MAX_VALUE;\n for (int i = 0; i < numberOfMagic; i++) {\n Magic magic = new Magic(scanner.nextInt(), scanner.nextInt());\n magics.add(magic);\n\n if (minCost > magic.cost) {\n minCost = magic.cost;\n }\n }\n magicsInAscendingOrderOfCost = magics.stream()\n .sorted(Comparator.comparingInt(magic -> magic.cost))\n .collect(Collectors.toList());\n\n System.out.println(getCost(hitPoint));\n }\n\n private static long getCost(int hitPoint) {\n final int attackPointOfMinCost = magicsInAscendingOrderOfCost.get(0).attackPoint;\n if (hitPoint <= attackPointOfMinCost) {\n return minCost;\n }\n\n long[] minCosts = new long[hitPoint + 1];\n for (int i = 0; i <= attackPointOfMinCost; i++) {\n minCosts[i] = minCost;\n }\n\n for (int currentHitPoint = attackPointOfMinCost + 1; currentHitPoint <= hitPoint;\n currentHitPoint++) {\n\n long minCostCandidate = Long.MAX_VALUE;\n for (Magic magic : magicsInAscendingOrderOfCost) {\n int remainingHitPoint = currentHitPoint - magic.attackPoint;\n\n long candidate =\n remainingHitPoint > 0 ? minCosts[remainingHitPoint] + magic.cost : magic.cost;\n\n if (candidate < minCostCandidate) {\n minCostCandidate = candidate;\n }\n }\n\n minCosts[currentHitPoint] = minCostCandidate;\n }\n\n return minCosts[hitPoint];\n }\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIbis is fighting with a monster.\n\nThe health of the monster is H.\n\nIbis can cast N kinds of spells. Casting the i-th spell decreases the monster's health by A_i, at the cost of B_i Magic Points.\n\nThe same spell can be cast multiple times. There is no way other than spells to decrease the monster's health.\n\nIbis wins when the health of the monster becomes 0 or below.\n\nFind the minimum total Magic Points that have to be consumed before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq N \\leq 10^3\n\n1 \\leq A_i \\leq 10^4\n\n1 \\leq B_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the minimum total Magic Points that have to be consumed before winning.\n\nSample Input 1\n\n9 3\n8 3\n4 2\n2 1\n\nSample Output 1\n\n4\n\nFirst, let us cast the first spell to decrease the monster's health by 8, at the cost of 3 Magic Points. The monster's health is now 1.\n\nThen, cast the third spell to decrease the monster's health by 2, at the cost of 1 Magic Point. The monster's health is now -1.\n\nIn this way, we can win at the total cost of 4 Magic Points.\n\nSample Input 2\n\n100 6\n1 1\n2 3\n3 9\n4 27\n5 81\n6 243\n\nSample Output 2\n\n100\n\nIt is optimal to cast the first spell 100 times.\n\nSample Input 3\n\n9999 10\n540 7550\n691 9680\n700 9790\n510 7150\n415 5818\n551 7712\n587 8227\n619 8671\n588 8228\n176 2461\n\nSample Output 3\n\n139815", "sample_input": "9 3\n8 3\n4 2\n2 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02787", "source_text": "Score : 500 points\n\nProblem Statement\n\nIbis is fighting with a monster.\n\nThe health of the monster is H.\n\nIbis can cast N kinds of spells. Casting the i-th spell decreases the monster's health by A_i, at the cost of B_i Magic Points.\n\nThe same spell can be cast multiple times. There is no way other than spells to decrease the monster's health.\n\nIbis wins when the health of the monster becomes 0 or below.\n\nFind the minimum total Magic Points that have to be consumed before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq N \\leq 10^3\n\n1 \\leq A_i \\leq 10^4\n\n1 \\leq B_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the minimum total Magic Points that have to be consumed before winning.\n\nSample Input 1\n\n9 3\n8 3\n4 2\n2 1\n\nSample Output 1\n\n4\n\nFirst, let us cast the first spell to decrease the monster's health by 8, at the cost of 3 Magic Points. The monster's health is now 1.\n\nThen, cast the third spell to decrease the monster's health by 2, at the cost of 1 Magic Point. The monster's health is now -1.\n\nIn this way, we can win at the total cost of 4 Magic Points.\n\nSample Input 2\n\n100 6\n1 1\n2 3\n3 9\n4 27\n5 81\n6 243\n\nSample Output 2\n\n100\n\nIt is optimal to cast the first spell 100 times.\n\nSample Input 3\n\n9999 10\n540 7550\n691 9680\n700 9790\n510 7150\n415 5818\n551 7712\n587 8227\n619 8671\n588 8228\n176 2461\n\nSample Output 3\n\n139815", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2085, "cpu_time_ms": 272, "memory_kb": 35820}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s828201300", "group_id": "codeNet:p02787", "input_text": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int h = sc.nextInt();\n int n = sc.nextInt();\n int a[] = new int[n];\n int b[] = new int[n];\n ArrayList l = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n b[i] = sc.nextInt();\n l.add(new Pair(a[i], b[i]));\n }\n Collections.sort(l);\n int dp[][] = new int[n][h + 20000];\n for (int i = 0; i < n; i++) {\n for (int j = 1; j < h + 20000; j++) {\n dp[i][j] = 1000000000;\n }\n }\n\n int s = l.get(0).key;\n int v = l.get(0).value;\n for (int i = 0; i * s < h + 20000; i++) {\n dp[0][i * s] = v * i;\n }\n for (int i = 1; i < n; i++) {\n Pair newP = l.get(i);\n for (int j = 0; j < h + 20000; j++) {\n dp[i][j] = dp[i - 1][j];\n if (j - newP.key < 0) {\n continue;\n }\n if (dp[i - 1][j - newP.key] + newP.value < dp[i][j]) {\n dp[i][j] = dp[i - 1][j - newP.key] + newP.value;\n } else {\n }\n }\n }\n int min = 1000000000;\n for (int i = h; i < h + 20000; i++) {\n min = Math.min(min, dp[n - 1][i]);\n }\n System.out.println(min);\n sc.close();\n\n }\n\n public static long pow(long a, long n) {\n if (n == 0) {\n return 1;\n }\n if (n == 1) {\n return a;\n }\n if (n % 2 == 0) {\n return pow(a * a, n / 2);\n } else {\n return a * pow(a * a, (n - 1) / 2);\n }\n }\n\n}\n\nclass Pair implements Comparable {\n // key , value 昇順ソート\n int key;\n int value;\n\n Pair(int key, int value) {\n this.key = key;\n this.value = value;\n }\n\n @Override\n public int compareTo(Pair other) {\n if (this.key == other.key) {\n return this.value - other.value;\n }\n // return this.value - other.value;\n return this.key - other.key;\n }\n}\n", "language": "Java", "metadata": {"date": 1580071987, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02787.html", "problem_id": "p02787", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02787/input.txt", "sample_output_relpath": "derived/input_output/data/p02787/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02787/Java/s828201300.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s828201300", "user_id": "u045712871"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int h = sc.nextInt();\n int n = sc.nextInt();\n int a[] = new int[n];\n int b[] = new int[n];\n ArrayList l = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n b[i] = sc.nextInt();\n l.add(new Pair(a[i], b[i]));\n }\n Collections.sort(l);\n int dp[][] = new int[n][h + 20000];\n for (int i = 0; i < n; i++) {\n for (int j = 1; j < h + 20000; j++) {\n dp[i][j] = 1000000000;\n }\n }\n\n int s = l.get(0).key;\n int v = l.get(0).value;\n for (int i = 0; i * s < h + 20000; i++) {\n dp[0][i * s] = v * i;\n }\n for (int i = 1; i < n; i++) {\n Pair newP = l.get(i);\n for (int j = 0; j < h + 20000; j++) {\n dp[i][j] = dp[i - 1][j];\n if (j - newP.key < 0) {\n continue;\n }\n if (dp[i - 1][j - newP.key] + newP.value < dp[i][j]) {\n dp[i][j] = dp[i - 1][j - newP.key] + newP.value;\n } else {\n }\n }\n }\n int min = 1000000000;\n for (int i = h; i < h + 20000; i++) {\n min = Math.min(min, dp[n - 1][i]);\n }\n System.out.println(min);\n sc.close();\n\n }\n\n public static long pow(long a, long n) {\n if (n == 0) {\n return 1;\n }\n if (n == 1) {\n return a;\n }\n if (n % 2 == 0) {\n return pow(a * a, n / 2);\n } else {\n return a * pow(a * a, (n - 1) / 2);\n }\n }\n\n}\n\nclass Pair implements Comparable {\n // key , value 昇順ソート\n int key;\n int value;\n\n Pair(int key, int value) {\n this.key = key;\n this.value = value;\n }\n\n @Override\n public int compareTo(Pair other) {\n if (this.key == other.key) {\n return this.value - other.value;\n }\n // return this.value - other.value;\n return this.key - other.key;\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIbis is fighting with a monster.\n\nThe health of the monster is H.\n\nIbis can cast N kinds of spells. Casting the i-th spell decreases the monster's health by A_i, at the cost of B_i Magic Points.\n\nThe same spell can be cast multiple times. There is no way other than spells to decrease the monster's health.\n\nIbis wins when the health of the monster becomes 0 or below.\n\nFind the minimum total Magic Points that have to be consumed before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq N \\leq 10^3\n\n1 \\leq A_i \\leq 10^4\n\n1 \\leq B_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the minimum total Magic Points that have to be consumed before winning.\n\nSample Input 1\n\n9 3\n8 3\n4 2\n2 1\n\nSample Output 1\n\n4\n\nFirst, let us cast the first spell to decrease the monster's health by 8, at the cost of 3 Magic Points. The monster's health is now 1.\n\nThen, cast the third spell to decrease the monster's health by 2, at the cost of 1 Magic Point. The monster's health is now -1.\n\nIn this way, we can win at the total cost of 4 Magic Points.\n\nSample Input 2\n\n100 6\n1 1\n2 3\n3 9\n4 27\n5 81\n6 243\n\nSample Output 2\n\n100\n\nIt is optimal to cast the first spell 100 times.\n\nSample Input 3\n\n9999 10\n540 7550\n691 9680\n700 9790\n510 7150\n415 5818\n551 7712\n587 8227\n619 8671\n588 8228\n176 2461\n\nSample Output 3\n\n139815", "sample_input": "9 3\n8 3\n4 2\n2 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02787", "source_text": "Score : 500 points\n\nProblem Statement\n\nIbis is fighting with a monster.\n\nThe health of the monster is H.\n\nIbis can cast N kinds of spells. Casting the i-th spell decreases the monster's health by A_i, at the cost of B_i Magic Points.\n\nThe same spell can be cast multiple times. There is no way other than spells to decrease the monster's health.\n\nIbis wins when the health of the monster becomes 0 or below.\n\nFind the minimum total Magic Points that have to be consumed before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq N \\leq 10^3\n\n1 \\leq A_i \\leq 10^4\n\n1 \\leq B_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the minimum total Magic Points that have to be consumed before winning.\n\nSample Input 1\n\n9 3\n8 3\n4 2\n2 1\n\nSample Output 1\n\n4\n\nFirst, let us cast the first spell to decrease the monster's health by 8, at the cost of 3 Magic Points. The monster's health is now 1.\n\nThen, cast the third spell to decrease the monster's health by 2, at the cost of 1 Magic Point. The monster's health is now -1.\n\nIn this way, we can win at the total cost of 4 Magic Points.\n\nSample Input 2\n\n100 6\n1 1\n2 3\n3 9\n4 27\n5 81\n6 243\n\nSample Output 2\n\n100\n\nIt is optimal to cast the first spell 100 times.\n\nSample Input 3\n\n9999 10\n540 7550\n691 9680\n700 9790\n510 7150\n415 5818\n551 7712\n587 8227\n619 8671\n588 8228\n176 2461\n\nSample Output 3\n\n139815", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2274, "cpu_time_ms": 405, "memory_kb": 165444}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s613085564", "group_id": "codeNet:p02789", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\t//C問題\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n, m;\n\t\tString ans;\n\t\tn = scanner.nextInt();\n\t\tm = scanner.nextInt();\n\n\t\t//橋君の提出が AC となる場合は Yes, そうでない場合は No と出力せよ。\n\n\t\tif (n == m) {\n\t\t\tans = \"Yes\";\n\t\t} else {\n\t\t\tans = \"No\";\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n\n}", "language": "Java", "metadata": {"date": 1581859386, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02789.html", "problem_id": "p02789", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02789/input.txt", "sample_output_relpath": "derived/input_output/data/p02789/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02789/Java/s613085564.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s613085564", "user_id": "u345023394"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\t//C問題\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n, m;\n\t\tString ans;\n\t\tn = scanner.nextInt();\n\t\tm = scanner.nextInt();\n\n\t\t//橋君の提出が AC となる場合は Yes, そうでない場合は No と出力せよ。\n\n\t\tif (n == m) {\n\t\t\tans = \"Yes\";\n\t\t} else {\n\t\t\tans = \"No\";\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "sample_input": "3 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02789", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 415, "cpu_time_ms": 96, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s624594667", "group_id": "codeNet:p02789", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n String str = scan.nextLine();\n\n String[] substr = str.split(\" \", 0);\n\n //System.out.println(str);\n //System.out.println(substr[0]);\n //System.out.println(substr[1]);\n int a = Integer.parseInt(substr[0]);\n int b = Integer.parseInt(substr[1]);\n if (a == b) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n scan.close();\n }\n\n}", "language": "Java", "metadata": {"date": 1581067419, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02789.html", "problem_id": "p02789", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02789/input.txt", "sample_output_relpath": "derived/input_output/data/p02789/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02789/Java/s624594667.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s624594667", "user_id": "u322953890"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n String str = scan.nextLine();\n\n String[] substr = str.split(\" \", 0);\n\n //System.out.println(str);\n //System.out.println(substr[0]);\n //System.out.println(substr[1]);\n int a = Integer.parseInt(substr[0]);\n int b = Integer.parseInt(substr[1]);\n if (a == b) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n scan.close();\n }\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "sample_input": "3 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02789", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 588, "cpu_time_ms": 93, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s404798905", "group_id": "codeNet:p02789", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String args[]) throws IOException {\n\t\t// 2020/1/30 No.152\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString str[] = br.readLine().split(\" \");\n\t\tint n = Integer.parseInt(str[0]);\n\t\tint m = Integer.parseInt(str[1]);\n\n\t\tif (n == m )\n\t\t\tSystem.out.println(\"Yes\");\n\t\telse\n\t\t\tSystem.out.println(\"No\");\n\t}\n}", "language": "Java", "metadata": {"date": 1580419815, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02789.html", "problem_id": "p02789", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02789/input.txt", "sample_output_relpath": "derived/input_output/data/p02789/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02789/Java/s404798905.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s404798905", "user_id": "u768246830"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String args[]) throws IOException {\n\t\t// 2020/1/30 No.152\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString str[] = br.readLine().split(\" \");\n\t\tint n = Integer.parseInt(str[0]);\n\t\tint m = Integer.parseInt(str[1]);\n\n\t\tif (n == m )\n\t\t\tSystem.out.println(\"Yes\");\n\t\telse\n\t\t\tSystem.out.println(\"No\");\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "sample_input": "3 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02789", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 475, "cpu_time_ms": 69, "memory_kb": 21076}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s143614873", "group_id": "codeNet:p02789", "input_text": "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int M = sc.nextInt();\n\n if(N==M){\n System.out.println(\"YES\");\n }else{\n System.out.println(\"NO\");\n }\n }\n}", "language": "Java", "metadata": {"date": 1579611656, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02789.html", "problem_id": "p02789", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02789/input.txt", "sample_output_relpath": "derived/input_output/data/p02789/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02789/Java/s143614873.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s143614873", "user_id": "u277027215"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int M = sc.nextInt();\n\n if(N==M){\n System.out.println(\"YES\");\n }else{\n System.out.println(\"NO\");\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "sample_input": "3 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02789", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 277, "cpu_time_ms": 94, "memory_kb": 21332}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s860395199", "group_id": "codeNet:p02791", "input_text": "import java.util.*;\n\npublic class Main {\n\n static int MOD = 1000000007;\n public static void main(String[] args) {\n\n int ans=0;\n Scanner sc = new Scanner(System.in);\n int n=sc.nextInt();\n\n int[] p = new int[n];\n HashSet ff = new HashSet<>();\n\n for(int i=0;ip[j]){\n ok=false;\n break;\n }\n\n }\n if(ok){\n ans++;\n ff.add(i);\n }\n }\n\n\n System.out.println(ans);\n\n }\n\n}\n", "language": "Java", "metadata": {"date": 1579464812, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02791.html", "problem_id": "p02791", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02791/input.txt", "sample_output_relpath": "derived/input_output/data/p02791/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02791/Java/s860395199.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s860395199", "user_id": "u740900993"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n static int MOD = 1000000007;\n public static void main(String[] args) {\n\n int ans=0;\n Scanner sc = new Scanner(System.in);\n int n=sc.nextInt();\n\n int[] p = new int[n];\n HashSet ff = new HashSet<>();\n\n for(int i=0;ip[j]){\n ok=false;\n break;\n }\n\n }\n if(ok){\n ans++;\n ff.add(i);\n }\n }\n\n\n System.out.println(ans);\n\n }\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a permutation P_1, \\ldots, P_N of 1, \\ldots, N.\nFind the number of integers i (1 \\leq i \\leq N) that satisfy the following condition:\n\nFor any integer j (1 \\leq j \\leq i), P_i \\leq P_j.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nP_1, \\ldots, P_N is a permutation of 1, \\ldots, N.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 ... P_N\n\nOutput\n\nPrint the number of integers i that satisfy the condition.\n\nSample Input 1\n\n5\n4 2 5 1 3\n\nSample Output 1\n\n3\n\ni=1, 2, and 4 satisfy the condition, but i=3 does not - for example, P_i > P_j holds for j = 1.\n\nSimilarly, i=5 does not satisfy the condition, either. Thus, there are three integers that satisfy the condition.\n\nSample Input 2\n\n4\n4 3 2 1\n\nSample Output 2\n\n4\n\nAll integers i (1 \\leq i \\leq N) satisfy the condition.\n\nSample Input 3\n\n6\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n\nOnly i=1 satisfies the condition.\n\nSample Input 4\n\n8\n5 7 4 2 6 8 1 3\n\nSample Output 4\n\n4\n\nSample Input 5\n\n1\n1\n\nSample Output 5\n\n1", "sample_input": "5\n4 2 5 1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02791", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a permutation P_1, \\ldots, P_N of 1, \\ldots, N.\nFind the number of integers i (1 \\leq i \\leq N) that satisfy the following condition:\n\nFor any integer j (1 \\leq j \\leq i), P_i \\leq P_j.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nP_1, \\ldots, P_N is a permutation of 1, \\ldots, N.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 ... P_N\n\nOutput\n\nPrint the number of integers i that satisfy the condition.\n\nSample Input 1\n\n5\n4 2 5 1 3\n\nSample Output 1\n\n3\n\ni=1, 2, and 4 satisfy the condition, but i=3 does not - for example, P_i > P_j holds for j = 1.\n\nSimilarly, i=5 does not satisfy the condition, either. Thus, there are three integers that satisfy the condition.\n\nSample Input 2\n\n4\n4 3 2 1\n\nSample Output 2\n\n4\n\nAll integers i (1 \\leq i \\leq N) satisfy the condition.\n\nSample Input 3\n\n6\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n\nOnly i=1 satisfies the condition.\n\nSample Input 4\n\n8\n5 7 4 2 6 8 1 3\n\nSample Output 4\n\n4\n\nSample Input 5\n\n1\n1\n\nSample Output 5\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 748, "cpu_time_ms": 2110, "memory_kb": 349324}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s454337280", "group_id": "codeNet:p02791", "input_text": "import java.util.*;\npublic class Main { \n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int o=0;\n int n=sc.nextInt();\n int mini=2000000;\n for(int i=0;i P_j holds for j = 1.\n\nSimilarly, i=5 does not satisfy the condition, either. Thus, there are three integers that satisfy the condition.\n\nSample Input 2\n\n4\n4 3 2 1\n\nSample Output 2\n\n4\n\nAll integers i (1 \\leq i \\leq N) satisfy the condition.\n\nSample Input 3\n\n6\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n\nOnly i=1 satisfies the condition.\n\nSample Input 4\n\n8\n5 7 4 2 6 8 1 3\n\nSample Output 4\n\n4\n\nSample Input 5\n\n1\n1\n\nSample Output 5\n\n1", "sample_input": "5\n4 2 5 1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02791", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a permutation P_1, \\ldots, P_N of 1, \\ldots, N.\nFind the number of integers i (1 \\leq i \\leq N) that satisfy the following condition:\n\nFor any integer j (1 \\leq j \\leq i), P_i \\leq P_j.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nP_1, \\ldots, P_N is a permutation of 1, \\ldots, N.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 ... P_N\n\nOutput\n\nPrint the number of integers i that satisfy the condition.\n\nSample Input 1\n\n5\n4 2 5 1 3\n\nSample Output 1\n\n3\n\ni=1, 2, and 4 satisfy the condition, but i=3 does not - for example, P_i > P_j holds for j = 1.\n\nSimilarly, i=5 does not satisfy the condition, either. Thus, there are three integers that satisfy the condition.\n\nSample Input 2\n\n4\n4 3 2 1\n\nSample Output 2\n\n4\n\nAll integers i (1 \\leq i \\leq N) satisfy the condition.\n\nSample Input 3\n\n6\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n\nOnly i=1 satisfies the condition.\n\nSample Input 4\n\n8\n5 7 4 2 6 8 1 3\n\nSample Output 4\n\n4\n\nSample Input 5\n\n1\n1\n\nSample Output 5\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 359, "cpu_time_ms": 585, "memory_kb": 62700}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s393655254", "group_id": "codeNet:p02792", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tfor (int j = 1; j < n; j++) {\n\t\t\t\tif(checkNum(i,j)) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}\n\n\tprivate static boolean checkNum(int i, int j) {\n\t\tString a = String.valueOf(i);\n\t\tString b = String.valueOf(j);\n\n\t\tif(a.charAt(0) == b.charAt(b.length()-1) && a.charAt(a.length()-1) == b.charAt(0)) {\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n }", "language": "Java", "metadata": {"date": 1598979294, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02792.html", "problem_id": "p02792", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02792/input.txt", "sample_output_relpath": "derived/input_output/data/p02792/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02792/Java/s393655254.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s393655254", "user_id": "u200965229"}, "prompt_components": {"gold_output": "17\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint count = 0;\n\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tfor (int j = 1; j < n; j++) {\n\t\t\t\tif(checkNum(i,j)) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\n\t}\n\n\tprivate static boolean checkNum(int i, int j) {\n\t\tString a = String.valueOf(i);\n\t\tString b = String.valueOf(j);\n\n\t\tif(a.charAt(0) == b.charAt(b.length()-1) && a.charAt(a.length()-1) == b.charAt(0)) {\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n }", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nFind the number of pairs (A, B) of positive integers not greater than N that satisfy the following condition:\n\nWhen A and B are written in base ten without leading zeros, the last digit of A is equal to the first digit of B, and the first digit of A is equal to the last digit of B.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n25\n\nSample Output 1\n\n17\n\nThe following 17 pairs satisfy the condition: (1,1), (1,11), (2,2), (2,22), (3,3), (4,4), (5,5), (6,6), (7,7), (8,8), (9,9), (11,1), (11,11), (12,21), (21,12), (22,2), and (22,22).\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n108\n\nSample Input 4\n\n2020\n\nSample Output 4\n\n40812\n\nSample Input 5\n\n200000\n\nSample Output 5\n\n400000008", "sample_input": "25\n"}, "reference_outputs": ["17\n"], "source_document_id": "p02792", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nFind the number of pairs (A, B) of positive integers not greater than N that satisfy the following condition:\n\nWhen A and B are written in base ten without leading zeros, the last digit of A is equal to the first digit of B, and the first digit of A is equal to the last digit of B.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n25\n\nSample Output 1\n\n17\n\nThe following 17 pairs satisfy the condition: (1,1), (1,11), (2,2), (2,22), (3,3), (4,4), (5,5), (6,6), (7,7), (8,8), (9,9), (11,1), (11,11), (12,21), (21,12), (22,2), and (22,22).\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n108\n\nSample Input 4\n\n2020\n\nSample Output 4\n\n40812\n\nSample Input 5\n\n200000\n\nSample Output 5\n\n400000008", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 567, "cpu_time_ms": 2207, "memory_kb": 56232}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s887326970", "group_id": "codeNet:p02792", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n private static int f(int i, int j, int n) {\n int r = 0;\n for (int k = 1; k <= n; k++) {\n String s = Integer.toString(k);\n if (Integer.parseInt(s.substring(0, 1)) == i && Integer.parseInt(s.substring(s.length() - 1)) == j)\n r++;\n }\n return r;\n }\n\n public static void main(String[] args) {\n try (Scanner scanner = new Scanner(System.in)) {\n int n = Integer.parseInt(scanner.next());\n int r = 0;\n for (int i = 0; i < 10; i++) {\n for (int j = 0; j < 10; j++) {\n r += f(i, j, n) * f(j, i, n);\n }\n }\n System.out.println(r);\n }\n }\n\n}\n", "language": "Java", "metadata": {"date": 1579988103, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02792.html", "problem_id": "p02792", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02792/input.txt", "sample_output_relpath": "derived/input_output/data/p02792/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02792/Java/s887326970.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s887326970", "user_id": "u514129253"}, "prompt_components": {"gold_output": "17\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n private static int f(int i, int j, int n) {\n int r = 0;\n for (int k = 1; k <= n; k++) {\n String s = Integer.toString(k);\n if (Integer.parseInt(s.substring(0, 1)) == i && Integer.parseInt(s.substring(s.length() - 1)) == j)\n r++;\n }\n return r;\n }\n\n public static void main(String[] args) {\n try (Scanner scanner = new Scanner(System.in)) {\n int n = Integer.parseInt(scanner.next());\n int r = 0;\n for (int i = 0; i < 10; i++) {\n for (int j = 0; j < 10; j++) {\n r += f(i, j, n) * f(j, i, n);\n }\n }\n System.out.println(r);\n }\n }\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nFind the number of pairs (A, B) of positive integers not greater than N that satisfy the following condition:\n\nWhen A and B are written in base ten without leading zeros, the last digit of A is equal to the first digit of B, and the first digit of A is equal to the last digit of B.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n25\n\nSample Output 1\n\n17\n\nThe following 17 pairs satisfy the condition: (1,1), (1,11), (2,2), (2,22), (3,3), (4,4), (5,5), (6,6), (7,7), (8,8), (9,9), (11,1), (11,11), (12,21), (21,12), (22,2), and (22,22).\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n108\n\nSample Input 4\n\n2020\n\nSample Output 4\n\n40812\n\nSample Input 5\n\n200000\n\nSample Output 5\n\n400000008", "sample_input": "25\n"}, "reference_outputs": ["17\n"], "source_document_id": "p02792", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nFind the number of pairs (A, B) of positive integers not greater than N that satisfy the following condition:\n\nWhen A and B are written in base ten without leading zeros, the last digit of A is equal to the first digit of B, and the first digit of A is equal to the last digit of B.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n25\n\nSample Output 1\n\n17\n\nThe following 17 pairs satisfy the condition: (1,1), (1,11), (2,2), (2,22), (3,3), (4,4), (5,5), (6,6), (7,7), (8,8), (9,9), (11,1), (11,11), (12,21), (21,12), (22,2), and (22,22).\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n108\n\nSample Input 4\n\n2020\n\nSample Output 4\n\n40812\n\nSample Input 5\n\n200000\n\nSample Output 5\n\n400000008", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 771, "cpu_time_ms": 2110, "memory_kb": 346720}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s810331473", "group_id": "codeNet:p02793", "input_text": "import java.util.*;\n\npublic class Main{\n \n public static final int MOD = (int)1e9+7;\n \n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n \n int n = Integer.parseInt(sc.next());\n int[] a = new int[n];\n ModLcm ml = new ModLcm((int)1e6+6);\n \n for(int i=0; i0){\n if(p%2==1){\n a = a*x%m;\n }\n x = x*x%m;\n p /= 2;\n }\n return a;\n }\n \n public int getModLcm(int mod){\n long res = 1;\n for(int i=0; i0){\n if(p%2==1){\n a = a*x%m;\n }\n x = x*x%m;\n p /= 2;\n }\n return a;\n }\n \n public int getModLcm(int mod){\n long res = 1;\n for(int i=0; i> pplist = new ArrayList>();\n\tstatic int PN = 1000000;\n\tstatic List prime = new ArrayList();\n\tstatic Map primeMap = new HashMap();\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tinit();\n\t\tread();\n\t\tppList();\n\t}\n\n\tprivate static void ppList() {\n\t\tHashMap maxMap = new HashMap();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tint A = arr[i] / commonGcd;\n\t\t\tcompute(maxMap, A);\n\t\t}\n\n\t\tlong sum = 0;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tHashMap map = pplist.get(i);\n\t\t\tlong t = 1;\n\t\t\tfor (Integer p : maxMap.keySet()) {\n\t\t\t\tint count = maxMap.get(p);\n\t\t\t\tint count2 = (map.get(p) == null ? 0 : map.get(p));\n\n\t\t\t\tt = t * pow(p, count - count2) % 1000000007;\n\t\t\t}\n\t\t\tsum = (sum + t) % 1000000007;\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n\n\tprivate static long pow(int a, int p) {\n\t\tif (p == 1) {\n\t\t\treturn a;\n\t\t}\n\t\tif (p == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tint res = 1;\n\t\tint p2 = a * a;\n\t\tfor (int t = 2; t <= p; t += 2) {\n\t\t\tres = res * p2;\n\t\t}\n\t\tres = res * (p % 2 == 1 ? a : 1);\n\t\treturn res;\n\t}\n\n\tprivate static void compute(HashMap maxMap, int A) {\n\t\tHashMap tmpMap = new HashMap();\n\t\tfor (int i = 0, size =prime.size(); i < size;) {\n\n\t\t\tif (primeMap.get(A) != null) {\n\n\t\t\t\tInteger count = tmpMap.get(A);\n\n\t\t\t\tif (count == null) {\n\t\t\t\t\ttmpMap.put(A, 1);\n\t\t\t\t} else {\n\t\t\t\t\ttmpMap.put(A, count + 1);\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\telse if (A % prime.get(i) == 0) {\n\t\t\t\tint p = prime.get(i);\n\n\t\t\t\tInteger count = tmpMap.get(p);\n\n\t\t\t\tif (count == null) {\n\t\t\t\t\ttmpMap.put(p, 1);\n\t\t\t\t} else {\n\t\t\t\t\ttmpMap.put(p, count + 1);\n\t\t\t\t}\n\n\t\t\t\tA = A / p;\n\t\t\t} else {\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\n\t\tfor (Entry entry : tmpMap.entrySet()) {\n\t\t\tint p = entry.getKey();\n\t\t\tint count = entry.getValue();\n\n\t\t\tInteger currCount = maxMap.get(p);\n\n\t\t\tif (currCount == null || currCount <= count) {\n\t\t\t\tmaxMap.put(p, count);\n\t\t\t}\n\t\t}\n\t\tpplist.add(tmpMap);\n\n\t}\n\n\tprivate static int gcd(int a, int b) {\n\t\tif (b % a == 0) {\n\t\t\treturn a;\n\t\t} else {\n\t\t\treturn gcd(b % a, a);\n\t\t}\n\t}\n\n\tprivate static void read() throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tN = Integer.parseInt(br.readLine());\n\t\tString[] wrods = br.readLine().split(\" \");\n\t\tarr = new int[wrods.length];\n\t\tfor (int i = 1; i <= N; i++) {\n\t\t\tarr[i - 1] = Integer.parseInt(wrods[i - 1]);\n\t\t\tif (i > 1) {\n\t\t\t\tcommonGcd = gcd(commonGcd, arr[i - 1]);\n\t\t\t} else {\n\t\t\t\tcommonGcd = arr[0];\n\t\t\t}\n\t\t}\n\t}\n\t\n\tprivate static void init900000(){\n\t\tint[] a = new int[]{900001, 900007, 900019, 900037, 900061, 900089, 900091, 900103, 900121, 900139, 900143, 900149, 900157, 900161, 900169, 900187, 900217, 900233, 900241, 900253, 900259, 900283, 900287, 900293, 900307, 900329, 900331, 900349, 900397, 900409, 900443, 900461, 900481, 900491, 900511, 900539, 900551, 900553, 900563, 900569, 900577, 900583, 900587, 900589, 900593, 900607, 900623, 900649, 900659, 900671, 900673, 900689, 900701, 900719, 900737, 900743, 900751, 900761, 900763, 900773, 900797, 900803, 900817, 900821, 900863, 900869, 900917, 900929, 900931, 900937, 900959, 900971, 900973, 900997, 901007, 901009, 901013, 901063, 901067, 901079, 901093, 901097, 901111, 901133, 901141, 901169, 901171, 901177, 901183, 901193, 901207, 901211, 901213, 901247, 901249, 901253, 901273, 901279, 901309, 901333, 901339, 901367, 901399, 901403, 901423, 901427, 901429, 901441, 901447, 901451, 901457, 901471, 901489, 901499, 901501, 901513, 901517, 901529, 901547, 901567, 901591, 901613, 901643, 901657, 901679, 901687, 901709, 901717, 901739, 901741, 901751, 901781, 901787, 901811, 901819, 901841, 901861, 901891, 901907, 901909, 901919, 901931, 901937, 901963, 901973, 901993, 901997, 902009, 902017, 902029, 902039, 902047, 902053, 902087, 902089, 902119, 902137, 902141, 902179, 902191, 902201, 902227, 902261, 902263, 902281, 902299, 902303, 902311, 902333, 902347, 902351, 902357, 902389, 902401, 902413, 902437, 902449, 902471, 902477, 902483, 902501, 902507, 902521, 902563, 902569, 902579, 902591, 902597, 902599, 902611, 902639, 902653, 902659, 902669, 902677, 902687, 902719, 902723, 902753, 902761, 902767, 902771, 902777, 902789, 902807, 902821, 902827, 902849, 902873, 902903, 902933, 902953, 902963, 902971, 902977, 902981, 902987, 903017, 903029, 903037, 903073, 903079, 903103, 903109, 903143, 903151, 903163, 903179, 903197, 903211, 903223, 903251, 903257, 903269, 903311, 903323, 903337, 903347, 903359, 903367, 903389, 903391, 903403, 903407, 903421, 903443, 903449, 903451, 903457, 903479, 903493, 903527, 903541, 903547, 903563, 903569, 903607, 903613, 903641, 903649, 903673, 903677, 903691, 903701, 903709, 903751, 903757, 903761, 903781, 903803, 903827, 903841, 903871, 903883, 903899, 903913, 903919, 903949, 903967, 903979, 904019, 904027, 904049, 904067, 904069, 904073, 904087, 904093, 904097, 904103, 904117, 904121, 904147, 904157, 904181, 904193, 904201, 904207, 904217, 904219, 904261, 904283, 904289, 904297, 904303, 904357, 904361, 904369, 904399, 904441, 904459, 904483, 904489, 904499, 904511, 904513, 904517, 904523, 904531, 904559, 904573, 904577, 904601, 904619, 904627, 904633, 904637, 904643, 904661, 904663, 904667, 904679, 904681, 904693, 904697, 904721, 904727, 904733, 904759, 904769, 904777, 904781, 904789, 904793, 904801, 904811, 904823, 904847, 904861, 904867, 904873, 904879, 904901, 904903, 904907, 904919, 904931, 904933, 904987, 904997, 904999, 905011, 905053, 905059, 905071, 905083, 905087, 905111, 905123, 905137, 905143, 905147, 905161, 905167, 905171, 905189, 905197, 905207, 905209, 905213, 905227, 905249, 905269, 905291, 905297, 905299, 905329, 905339, 905347, 905381, 905413, 905449, 905453, 905461, 905477, 905491, 905497, 905507, 905551, 905581, 905587, 905599, 905617, 905621, 905629, 905647, 905651, 905659, 905677, 905683, 905687, 905693, 905701, 905713, 905719, 905759, 905761, 905767, 905783, 905803, 905819, 905833, 905843, 905897, 905909, 905917, 905923, 905951, 905959, 905963, 905999, 906007, 906011, 906013, 906023, 906029, 906043, 906089, 906107, 906119, 906121, 906133, 906179, 906187, 906197, 906203, 906211, 906229, 906233, 906259, 906263, 906289, 906293, 906313, 906317, 906329, 906331, 906343, 906349, 906371, 906377, 906383, 906391, 906403, 906421, 906427, 906431, 906461, 906473, 906481, 906487, 906497, 906517, 906523, 906539, 906541, 906557, 906589, 906601, 906613, 906617, 906641, 906649, 906673, 906679, 906691, 906701, 906707, 906713, 906727, 906749, 906751, 906757, 906767, 906779, 906793, 906809, 906817, 906823, 906839, 906847, 906869, 906881, 906901, 906911, 906923, 906929, 906931, 906943, 906949, 906973, 907019, 907021, 907031, 907063, 907073, 907099, 907111, 907133, 907139, 907141, 907163, 907169, 907183, 907199, 907211, 907213, 907217, 907223, 907229, 907237, 907259, 907267, 907279, 907297, 907301, 907321, 907331, 907363, 907367, 907369, 907391, 907393, 907397, 907399, 907427, 907433, 907447, 907457, 907469, 907471, 907481, 907493, 907507, 907513, 907549, 907561, 907567, 907583, 907589, 907637, 907651, 907657, 907663, 907667, 907691, 907693, 907703, 907717, 907723, 907727, 907733, 907757, 907759, 907793, 907807, 907811, 907813, 907831, 907843, 907849, 907871, 907891, 907909, 907913, 907927, 907957, 907967, 907969, 907997, 907999, 908003, 908041, 908053, 908057, 908071, 908081, 908101, 908113, 908129, 908137, 908153, 908179, 908183, 908197, 908213, 908221, 908233, 908249, 908287, 908317, 908321, 908353, 908359, 908363, 908377, 908381, 908417, 908419, 908441, 908449, 908459, 908471, 908489, 908491, 908503, 908513, 908521, 908527, 908533, 908539, 908543, 908549, 908573, 908581, 908591, 908597, 908603, 908617, 908623, 908627, 908653, 908669, 908671, 908711, 908723, 908731, 908741, 908749, 908759, 908771, 908797, 908807, 908813, 908819, 908821, 908849, 908851, 908857, 908861, 908863, 908879, 908881, 908893, 908909, 908911, 908927, 908953, 908959, 908993, 909019, 909023, 909031, 909037, 909043, 909047, 909061, 909071, 909089, 909091, 909107, 909113, 909119, 909133, 909151, 909173, 909203, 909217, 909239, 909241, 909247, 909253, 909281, 909287, 909289, 909299, 909301, 909317, 909319, 909329, 909331, 909341, 909343, 909371, 909379, 909383, 909401, 909409, 909437, 909451, 909457, 909463, 909481, 909521, 909529, 909539, 909541, 909547, 909577, 909599, 909611, 909613, 909631, 909637, 909679, 909683, 909691, 909697, 909731, 909737, 909743, 909761, 909767, 909773, 909787, 909791, 909803, 909809, 909829, 909833, 909859, 909863, 909877, 909889, 909899, 909901, 909907, 909911, 909917, 909971, 909973, 909977, 910003, 910031, 910051, 910069, 910093, 910097, 910099, 910103, 910109, 910121, 910127, 910139, 910141, 910171, 910177, 910199, 910201, 910207, 910213, 910219, 910229, 910277, 910279, 910307, 910361, 910369, 910421, 910447, 910451, 910453, 910457, 910471, 910519, 910523, 910561, 910577, 910583, 910603, 910619, 910621, 910627, 910631, 910643, 910661, 910691, 910709, 910711, 910747, 910751, 910771, 910781, 910787, 910799, 910807, 910817, 910849, 910853, 910883, 910909, 910939, 910957, 910981, 911003, 911011, 911023, 911033, 911039, 911063, 911077, 911087, 911089, 911101, 911111, 911129, 911147, 911159, 911161, 911167, 911171, 911173, 911179, 911201, 911219, 911227, 911231, 911233, 911249, 911269, 911291, 911293, 911303, 911311, 911321, 911327, 911341, 911357, 911359, 911363, 911371, 911413, 911419, 911437, 911453, 911459, 911503, 911507, 911527, 911549};\n\t\tfor(int i = 0,len=a.length;i> pplist = new ArrayList>();\n\tstatic int PN = 1000000;\n\tstatic List prime = new ArrayList();\n\tstatic Map primeMap = new HashMap();\n\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\n\t\tinit();\n\t\tread();\n\t\tppList();\n\t}\n\n\tprivate static void ppList() {\n\t\tHashMap maxMap = new HashMap();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tint A = arr[i] / commonGcd;\n\t\t\tcompute(maxMap, A);\n\t\t}\n\n\t\tlong sum = 0;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tHashMap map = pplist.get(i);\n\t\t\tlong t = 1;\n\t\t\tfor (Integer p : maxMap.keySet()) {\n\t\t\t\tint count = maxMap.get(p);\n\t\t\t\tint count2 = (map.get(p) == null ? 0 : map.get(p));\n\n\t\t\t\tt = t * pow(p, count - count2) % 1000000007;\n\t\t\t}\n\t\t\tsum = (sum + t) % 1000000007;\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n\n\tprivate static long pow(int a, int p) {\n\t\tif (p == 1) {\n\t\t\treturn a;\n\t\t}\n\t\tif (p == 0) {\n\t\t\treturn 1;\n\t\t}\n\t\tint res = 1;\n\t\tint p2 = a * a;\n\t\tfor (int t = 2; t <= p; t += 2) {\n\t\t\tres = res * p2;\n\t\t}\n\t\tres = res * (p % 2 == 1 ? a : 1);\n\t\treturn res;\n\t}\n\n\tprivate static void compute(HashMap maxMap, int A) {\n\t\tHashMap tmpMap = new HashMap();\n\t\tfor (int i = 0, size =prime.size(); i < size;) {\n\n\t\t\tif (primeMap.get(A) != null) {\n\n\t\t\t\tInteger count = tmpMap.get(A);\n\n\t\t\t\tif (count == null) {\n\t\t\t\t\ttmpMap.put(A, 1);\n\t\t\t\t} else {\n\t\t\t\t\ttmpMap.put(A, count + 1);\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\telse if (A % prime.get(i) == 0) {\n\t\t\t\tint p = prime.get(i);\n\n\t\t\t\tInteger count = tmpMap.get(p);\n\n\t\t\t\tif (count == null) {\n\t\t\t\t\ttmpMap.put(p, 1);\n\t\t\t\t} else {\n\t\t\t\t\ttmpMap.put(p, count + 1);\n\t\t\t\t}\n\n\t\t\t\tA = A / p;\n\t\t\t} else {\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\n\t\tfor (Entry entry : tmpMap.entrySet()) {\n\t\t\tint p = entry.getKey();\n\t\t\tint count = entry.getValue();\n\n\t\t\tInteger currCount = maxMap.get(p);\n\n\t\t\tif (currCount == null || currCount <= count) {\n\t\t\t\tmaxMap.put(p, count);\n\t\t\t}\n\t\t}\n\t\tpplist.add(tmpMap);\n\n\t}\n\n\tprivate static int gcd(int a, int b) {\n\t\tif (b % a == 0) {\n\t\t\treturn a;\n\t\t} else {\n\t\t\treturn gcd(b % a, a);\n\t\t}\n\t}\n\n\tprivate static void read() throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tN = Integer.parseInt(br.readLine());\n\t\tString[] wrods = br.readLine().split(\" \");\n\t\tarr = new int[wrods.length];\n\t\tfor (int i = 1; i <= N; i++) {\n\t\t\tarr[i - 1] = Integer.parseInt(wrods[i - 1]);\n\t\t\tif (i > 1) {\n\t\t\t\tcommonGcd = gcd(commonGcd, arr[i - 1]);\n\t\t\t} else {\n\t\t\t\tcommonGcd = arr[0];\n\t\t\t}\n\t\t}\n\t}\n\t\n\tprivate static void init900000(){\n\t\tint[] a = new int[]{900001, 900007, 900019, 900037, 900061, 900089, 900091, 900103, 900121, 900139, 900143, 900149, 900157, 900161, 900169, 900187, 900217, 900233, 900241, 900253, 900259, 900283, 900287, 900293, 900307, 900329, 900331, 900349, 900397, 900409, 900443, 900461, 900481, 900491, 900511, 900539, 900551, 900553, 900563, 900569, 900577, 900583, 900587, 900589, 900593, 900607, 900623, 900649, 900659, 900671, 900673, 900689, 900701, 900719, 900737, 900743, 900751, 900761, 900763, 900773, 900797, 900803, 900817, 900821, 900863, 900869, 900917, 900929, 900931, 900937, 900959, 900971, 900973, 900997, 901007, 901009, 901013, 901063, 901067, 901079, 901093, 901097, 901111, 901133, 901141, 901169, 901171, 901177, 901183, 901193, 901207, 901211, 901213, 901247, 901249, 901253, 901273, 901279, 901309, 901333, 901339, 901367, 901399, 901403, 901423, 901427, 901429, 901441, 901447, 901451, 901457, 901471, 901489, 901499, 901501, 901513, 901517, 901529, 901547, 901567, 901591, 901613, 901643, 901657, 901679, 901687, 901709, 901717, 901739, 901741, 901751, 901781, 901787, 901811, 901819, 901841, 901861, 901891, 901907, 901909, 901919, 901931, 901937, 901963, 901973, 901993, 901997, 902009, 902017, 902029, 902039, 902047, 902053, 902087, 902089, 902119, 902137, 902141, 902179, 902191, 902201, 902227, 902261, 902263, 902281, 902299, 902303, 902311, 902333, 902347, 902351, 902357, 902389, 902401, 902413, 902437, 902449, 902471, 902477, 902483, 902501, 902507, 902521, 902563, 902569, 902579, 902591, 902597, 902599, 902611, 902639, 902653, 902659, 902669, 902677, 902687, 902719, 902723, 902753, 902761, 902767, 902771, 902777, 902789, 902807, 902821, 902827, 902849, 902873, 902903, 902933, 902953, 902963, 902971, 902977, 902981, 902987, 903017, 903029, 903037, 903073, 903079, 903103, 903109, 903143, 903151, 903163, 903179, 903197, 903211, 903223, 903251, 903257, 903269, 903311, 903323, 903337, 903347, 903359, 903367, 903389, 903391, 903403, 903407, 903421, 903443, 903449, 903451, 903457, 903479, 903493, 903527, 903541, 903547, 903563, 903569, 903607, 903613, 903641, 903649, 903673, 903677, 903691, 903701, 903709, 903751, 903757, 903761, 903781, 903803, 903827, 903841, 903871, 903883, 903899, 903913, 903919, 903949, 903967, 903979, 904019, 904027, 904049, 904067, 904069, 904073, 904087, 904093, 904097, 904103, 904117, 904121, 904147, 904157, 904181, 904193, 904201, 904207, 904217, 904219, 904261, 904283, 904289, 904297, 904303, 904357, 904361, 904369, 904399, 904441, 904459, 904483, 904489, 904499, 904511, 904513, 904517, 904523, 904531, 904559, 904573, 904577, 904601, 904619, 904627, 904633, 904637, 904643, 904661, 904663, 904667, 904679, 904681, 904693, 904697, 904721, 904727, 904733, 904759, 904769, 904777, 904781, 904789, 904793, 904801, 904811, 904823, 904847, 904861, 904867, 904873, 904879, 904901, 904903, 904907, 904919, 904931, 904933, 904987, 904997, 904999, 905011, 905053, 905059, 905071, 905083, 905087, 905111, 905123, 905137, 905143, 905147, 905161, 905167, 905171, 905189, 905197, 905207, 905209, 905213, 905227, 905249, 905269, 905291, 905297, 905299, 905329, 905339, 905347, 905381, 905413, 905449, 905453, 905461, 905477, 905491, 905497, 905507, 905551, 905581, 905587, 905599, 905617, 905621, 905629, 905647, 905651, 905659, 905677, 905683, 905687, 905693, 905701, 905713, 905719, 905759, 905761, 905767, 905783, 905803, 905819, 905833, 905843, 905897, 905909, 905917, 905923, 905951, 905959, 905963, 905999, 906007, 906011, 906013, 906023, 906029, 906043, 906089, 906107, 906119, 906121, 906133, 906179, 906187, 906197, 906203, 906211, 906229, 906233, 906259, 906263, 906289, 906293, 906313, 906317, 906329, 906331, 906343, 906349, 906371, 906377, 906383, 906391, 906403, 906421, 906427, 906431, 906461, 906473, 906481, 906487, 906497, 906517, 906523, 906539, 906541, 906557, 906589, 906601, 906613, 906617, 906641, 906649, 906673, 906679, 906691, 906701, 906707, 906713, 906727, 906749, 906751, 906757, 906767, 906779, 906793, 906809, 906817, 906823, 906839, 906847, 906869, 906881, 906901, 906911, 906923, 906929, 906931, 906943, 906949, 906973, 907019, 907021, 907031, 907063, 907073, 907099, 907111, 907133, 907139, 907141, 907163, 907169, 907183, 907199, 907211, 907213, 907217, 907223, 907229, 907237, 907259, 907267, 907279, 907297, 907301, 907321, 907331, 907363, 907367, 907369, 907391, 907393, 907397, 907399, 907427, 907433, 907447, 907457, 907469, 907471, 907481, 907493, 907507, 907513, 907549, 907561, 907567, 907583, 907589, 907637, 907651, 907657, 907663, 907667, 907691, 907693, 907703, 907717, 907723, 907727, 907733, 907757, 907759, 907793, 907807, 907811, 907813, 907831, 907843, 907849, 907871, 907891, 907909, 907913, 907927, 907957, 907967, 907969, 907997, 907999, 908003, 908041, 908053, 908057, 908071, 908081, 908101, 908113, 908129, 908137, 908153, 908179, 908183, 908197, 908213, 908221, 908233, 908249, 908287, 908317, 908321, 908353, 908359, 908363, 908377, 908381, 908417, 908419, 908441, 908449, 908459, 908471, 908489, 908491, 908503, 908513, 908521, 908527, 908533, 908539, 908543, 908549, 908573, 908581, 908591, 908597, 908603, 908617, 908623, 908627, 908653, 908669, 908671, 908711, 908723, 908731, 908741, 908749, 908759, 908771, 908797, 908807, 908813, 908819, 908821, 908849, 908851, 908857, 908861, 908863, 908879, 908881, 908893, 908909, 908911, 908927, 908953, 908959, 908993, 909019, 909023, 909031, 909037, 909043, 909047, 909061, 909071, 909089, 909091, 909107, 909113, 909119, 909133, 909151, 909173, 909203, 909217, 909239, 909241, 909247, 909253, 909281, 909287, 909289, 909299, 909301, 909317, 909319, 909329, 909331, 909341, 909343, 909371, 909379, 909383, 909401, 909409, 909437, 909451, 909457, 909463, 909481, 909521, 909529, 909539, 909541, 909547, 909577, 909599, 909611, 909613, 909631, 909637, 909679, 909683, 909691, 909697, 909731, 909737, 909743, 909761, 909767, 909773, 909787, 909791, 909803, 909809, 909829, 909833, 909859, 909863, 909877, 909889, 909899, 909901, 909907, 909911, 909917, 909971, 909973, 909977, 910003, 910031, 910051, 910069, 910093, 910097, 910099, 910103, 910109, 910121, 910127, 910139, 910141, 910171, 910177, 910199, 910201, 910207, 910213, 910219, 910229, 910277, 910279, 910307, 910361, 910369, 910421, 910447, 910451, 910453, 910457, 910471, 910519, 910523, 910561, 910577, 910583, 910603, 910619, 910621, 910627, 910631, 910643, 910661, 910691, 910709, 910711, 910747, 910751, 910771, 910781, 910787, 910799, 910807, 910817, 910849, 910853, 910883, 910909, 910939, 910957, 910981, 911003, 911011, 911023, 911033, 911039, 911063, 911077, 911087, 911089, 911101, 911111, 911129, 911147, 911159, 911161, 911167, 911171, 911173, 911179, 911201, 911219, 911227, 911231, 911233, 911249, 911269, 911291, 911293, 911303, 911311, 911321, 911327, 911341, 911357, 911359, 911363, 911371, 911413, 911419, 911437, 911453, 911459, 911503, 911507, 911527, 911549};\n\t\tfor(int i = 0,len=a.length;i[] g = new HashSet[n];\n for (int i = 0; i < n; i++) {\n g[i] = new HashSet<>();\n }\n int[] a = new int[n-1];\n int[] b = new int[n-1];\n for (int i = 0; i < n - 1; i++) {\n a[i] = in.nextInt() - 1;\n b[i] = in.nextInt() - 1;\n g[a[i]].add(b[i]);\n g[b[i]].add(a[i]);\n }\n int m = in.nextInt();\n int[] u = new int[m];\n int[] v = new int[m];\n for (int i = 0; i < m; i++) {\n u[i] = in.nextInt() - 1;\n v[i] = in.nextInt() - 1;\n }\n\n int[] bits = new int[n-1];\n for (int i = 0; i < n - 1; i++) {\n g[a[i]].remove(b[i]);\n g[b[i]].remove(a[i]);\n\n Set hash = new HashSet<>();\n dfs(0, g, hash);\n for (int j = 0; j < m; j++) {\n if ((hash.contains(u[j]) && !hash.contains(v[j]))\n || (!hash.contains(u[j]) && hash.contains(v[j]))) {\n bits[i] |= 1 << j;\n }\n }\n g[a[i]].add(b[i]);\n g[b[i]].add(a[i]);\n }\n\n long[] prev = new long[1<[] g, Set res) {\n res.add(u);\n for (int v : g[u]) {\n if (res.contains(v)) continue;\n dfs(v, g, res);\n }\n }\n\n long gcd(long a, long b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n }\n\n long lcm(long a, long b) {\n return a * b / gcd(a, b);\n }\n\n /* MOD_CALCULATION */\n static long MOD = 1000000007L;\n\n static long ADD(long a, long b) {\n return (a + b) % MOD;\n }\n\n static long SUB(long a, long b) {\n return (a - b + MOD) % MOD;\n }\n\n static long MULT(long a, long b) {\n return (a * b) % MOD;\n }\n\n static long POW(long a, long x) {\n long res = 1;\n for (; x > 0; x >>= 1) {\n if (x % 2 == 1) res = MULT(res, a);\n a = MULT(a, a);\n }\n\n return res;\n }\n\n static long DIV(long a, long b) {\n return MULT(a, POW(b, MOD - 2));\n }\n /* end */\n\n public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n // TODO 自動生成された catch ブロック\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }\n\n public static void main(final String[] args) {\n new Main().run();\n }\n\n class FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n // stream = new FileInputStream(new File(\"dec.in\"));\n\n }\n\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++)\n array[i] = nextInt();\n\n return array;\n }\n\n int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextIntArray(m);\n }\n return map;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++)\n array[i] = nextLong();\n\n return array;\n }\n\n long[][] nextLongMap(int n, int m) {\n long[][] map = new long[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextLongArray(m);\n }\n return map;\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++)\n array[i] = nextDouble();\n\n return array;\n }\n\n double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextDoubleArray(m);\n }\n return map;\n }\n\n String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++)\n array[i] = next();\n\n return array;\n }\n\n String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1579467259, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02794.html", "problem_id": "p02794", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02794/input.txt", "sample_output_relpath": "derived/input_output/data/p02794/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02794/Java/s163665744.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s163665744", "user_id": "u617255029"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.InputMismatchException;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Set;\n\npublic class Main {\n InputStream is;\n\n int __t__ = 1;\n int __f__ = 0;\n int __FILE_DEBUG_FLAG__ = __f__;\n String __DEBUG_FILE_NAME__ = \"src/B2\";\n\n FastScanner in;\n PrintWriter out;\n\n public void solve() {\n int n = in.nextInt();\n Set[] g = new HashSet[n];\n for (int i = 0; i < n; i++) {\n g[i] = new HashSet<>();\n }\n int[] a = new int[n-1];\n int[] b = new int[n-1];\n for (int i = 0; i < n - 1; i++) {\n a[i] = in.nextInt() - 1;\n b[i] = in.nextInt() - 1;\n g[a[i]].add(b[i]);\n g[b[i]].add(a[i]);\n }\n int m = in.nextInt();\n int[] u = new int[m];\n int[] v = new int[m];\n for (int i = 0; i < m; i++) {\n u[i] = in.nextInt() - 1;\n v[i] = in.nextInt() - 1;\n }\n\n int[] bits = new int[n-1];\n for (int i = 0; i < n - 1; i++) {\n g[a[i]].remove(b[i]);\n g[b[i]].remove(a[i]);\n\n Set hash = new HashSet<>();\n dfs(0, g, hash);\n for (int j = 0; j < m; j++) {\n if ((hash.contains(u[j]) && !hash.contains(v[j]))\n || (!hash.contains(u[j]) && hash.contains(v[j]))) {\n bits[i] |= 1 << j;\n }\n }\n g[a[i]].add(b[i]);\n g[b[i]].add(a[i]);\n }\n\n long[] prev = new long[1<[] g, Set res) {\n res.add(u);\n for (int v : g[u]) {\n if (res.contains(v)) continue;\n dfs(v, g, res);\n }\n }\n\n long gcd(long a, long b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n }\n\n long lcm(long a, long b) {\n return a * b / gcd(a, b);\n }\n\n /* MOD_CALCULATION */\n static long MOD = 1000000007L;\n\n static long ADD(long a, long b) {\n return (a + b) % MOD;\n }\n\n static long SUB(long a, long b) {\n return (a - b + MOD) % MOD;\n }\n\n static long MULT(long a, long b) {\n return (a * b) % MOD;\n }\n\n static long POW(long a, long x) {\n long res = 1;\n for (; x > 0; x >>= 1) {\n if (x % 2 == 1) res = MULT(res, a);\n a = MULT(a, a);\n }\n\n return res;\n }\n\n static long DIV(long a, long b) {\n return MULT(a, POW(b, MOD - 2));\n }\n /* end */\n\n public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n // TODO 自動生成された catch ブロック\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }\n\n public static void main(final String[] args) {\n new Main().run();\n }\n\n class FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n // stream = new FileInputStream(new File(\"dec.in\"));\n\n }\n\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++)\n array[i] = nextInt();\n\n return array;\n }\n\n int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextIntArray(m);\n }\n return map;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++)\n array[i] = nextLong();\n\n return array;\n }\n\n long[][] nextLongMap(int n, int m) {\n long[][] map = new long[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextLongArray(m);\n }\n return map;\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++)\n array[i] = nextDouble();\n\n return array;\n }\n\n double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextDoubleArray(m);\n }\n return map;\n }\n\n String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++)\n array[i] = next();\n\n return array;\n }\n\n String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n }\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N.\nThe i-th edge in this tree connects Vertex a_i and Vertex b_i.\n\nConsider painting each of these edges white or black. There are 2^{N-1} such ways to paint the edges. Among them, how many satisfy all of the following M restrictions?\n\nThe i-th (1 \\leq i \\leq M) restriction is represented by two integers u_i and v_i, which mean that the path connecting Vertex u_i and Vertex v_i must contain at least one edge painted black.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq a_i,b_i \\leq N\n\nThe graph given in input is a tree.\n\n1 \\leq M \\leq \\min(20,\\frac{N(N-1)}{2})\n\n1 \\leq u_i < v_i \\leq N\n\nIf i \\not= j, either u_i \\not=u_j or v_i\\not=v_j\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\nM\nu_1 v_1\n:\nu_M v_M\n\nOutput\n\nPrint the number of ways to paint the edges that satisfy all of the M conditions.\n\nSample Input 1\n\n3\n1 2\n2 3\n1\n1 3\n\nSample Output 1\n\n3\n\nThe tree in this input is shown below:\n\nAll of the M restrictions will be satisfied if Edge 1 and 2 are respectively painted (white, black), (black, white), or (black, black), so the answer is 3.\n\nSample Input 2\n\n2\n1 2\n1\n1 2\n\nSample Output 2\n\n1\n\nThe tree in this input is shown below:\n\nAll of the M restrictions will be satisfied only if Edge 1 is painted black, so the answer is 1.\n\nSample Input 3\n\n5\n1 2\n3 2\n3 4\n5 3\n3\n1 3\n2 4\n2 5\n\nSample Output 3\n\n9\n\nThe tree in this input is shown below:\n\nSample Input 4\n\n8\n1 2\n2 3\n4 3\n2 5\n6 3\n6 7\n8 6\n5\n2 7\n3 5\n1 6\n2 8\n7 8\n\nSample Output 4\n\n62\n\nThe tree in this input is shown below:", "sample_input": "3\n1 2\n2 3\n1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02794", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N.\nThe i-th edge in this tree connects Vertex a_i and Vertex b_i.\n\nConsider painting each of these edges white or black. There are 2^{N-1} such ways to paint the edges. Among them, how many satisfy all of the following M restrictions?\n\nThe i-th (1 \\leq i \\leq M) restriction is represented by two integers u_i and v_i, which mean that the path connecting Vertex u_i and Vertex v_i must contain at least one edge painted black.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq a_i,b_i \\leq N\n\nThe graph given in input is a tree.\n\n1 \\leq M \\leq \\min(20,\\frac{N(N-1)}{2})\n\n1 \\leq u_i < v_i \\leq N\n\nIf i \\not= j, either u_i \\not=u_j or v_i\\not=v_j\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\nM\nu_1 v_1\n:\nu_M v_M\n\nOutput\n\nPrint the number of ways to paint the edges that satisfy all of the M conditions.\n\nSample Input 1\n\n3\n1 2\n2 3\n1\n1 3\n\nSample Output 1\n\n3\n\nThe tree in this input is shown below:\n\nAll of the M restrictions will be satisfied if Edge 1 and 2 are respectively painted (white, black), (black, white), or (black, black), so the answer is 3.\n\nSample Input 2\n\n2\n1 2\n1\n1 2\n\nSample Output 2\n\n1\n\nThe tree in this input is shown below:\n\nAll of the M restrictions will be satisfied only if Edge 1 is painted black, so the answer is 1.\n\nSample Input 3\n\n5\n1 2\n3 2\n3 4\n5 3\n3\n1 3\n2 4\n2 5\n\nSample Output 3\n\n9\n\nThe tree in this input is shown below:\n\nSample Input 4\n\n8\n1 2\n2 3\n4 3\n2 5\n6 3\n6 7\n8 6\n5\n2 7\n3 5\n1 6\n2 8\n7 8\n\nSample Output 4\n\n62\n\nThe tree in this input is shown below:", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7218, "cpu_time_ms": 259, "memory_kb": 43860}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s259908350", "group_id": "codeNet:p02796", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n class Point implements Comparable {\n int x, y;\n\n Point(int x, int y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public String toString() {\n return \"[\" + this.x + \", \" + this.y + \"]\";\n }\n\n @Override\n public int compareTo(Point that) {\n if (this.y == that.y) {\n return this.x - that.x;\n }\n return this.y - that.y;\n }\n }\n\n void run() {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n Point[] points = new Point[n];\n for (int i = 0; i < n; i++) {\n int x = sc.nextInt();\n int l = sc.nextInt() - 1;\n points[i] = new Point(x - l, x + l);\n }\n\n Arrays.sort(points);\n\n// debug(points);\n int count = 0;\n int currentEnd = 0;\n for (Point point : points) {\n if (point.x > currentEnd) {\n currentEnd = point.y;\n count++;\n }\n }\n System.out.println(count);\n }\n\n void debug(Object... os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "language": "Java", "metadata": {"date": 1584616194, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02796.html", "problem_id": "p02796", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02796/input.txt", "sample_output_relpath": "derived/input_output/data/p02796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02796/Java/s259908350.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s259908350", "user_id": "u149419355"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n class Point implements Comparable {\n int x, y;\n\n Point(int x, int y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public String toString() {\n return \"[\" + this.x + \", \" + this.y + \"]\";\n }\n\n @Override\n public int compareTo(Point that) {\n if (this.y == that.y) {\n return this.x - that.x;\n }\n return this.y - that.y;\n }\n }\n\n void run() {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n Point[] points = new Point[n];\n for (int i = 0; i < n; i++) {\n int x = sc.nextInt();\n int l = sc.nextInt() - 1;\n points[i] = new Point(x - l, x + l);\n }\n\n Arrays.sort(points);\n\n// debug(points);\n int count = 0;\n int currentEnd = 0;\n for (Point point : points) {\n if (point.x > currentEnd) {\n currentEnd = point.y;\n count++;\n }\n }\n System.out.println(count);\n }\n\n void debug(Object... os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn a factory, there are N robots placed on a number line.\nRobot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.\n\nWe want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.\nHere, for each i (1 \\leq i \\leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.\n\nFind the maximum number of robots that we can keep.\n\nConstraints\n\n1 \\leq N \\leq 100,000\n\n0 \\leq X_i \\leq 10^9 (1 \\leq i \\leq N)\n\n1 \\leq L_i \\leq 10^9 (1 \\leq i \\leq N)\n\nIf i \\neq j, X_i \\neq X_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 L_1\nX_2 L_2\n\\vdots\nX_N L_N\n\nOutput\n\nPrint the maximum number of robots that we can keep.\n\nSample Input 1\n\n4\n2 4\n4 3\n9 3\n100 5\n\nSample Output 1\n\n3\n\nBy removing Robot 2, we can keep the other three robots.\n\nSample Input 2\n\n2\n8 20\n1 10\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n10 1\n2 1\n4 1\n6 1\n8 1\n\nSample Output 3\n\n5", "sample_input": "4\n2 4\n4 3\n9 3\n100 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02796", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn a factory, there are N robots placed on a number line.\nRobot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.\n\nWe want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.\nHere, for each i (1 \\leq i \\leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.\n\nFind the maximum number of robots that we can keep.\n\nConstraints\n\n1 \\leq N \\leq 100,000\n\n0 \\leq X_i \\leq 10^9 (1 \\leq i \\leq N)\n\n1 \\leq L_i \\leq 10^9 (1 \\leq i \\leq N)\n\nIf i \\neq j, X_i \\neq X_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 L_1\nX_2 L_2\n\\vdots\nX_N L_N\n\nOutput\n\nPrint the maximum number of robots that we can keep.\n\nSample Input 1\n\n4\n2 4\n4 3\n9 3\n100 5\n\nSample Output 1\n\n3\n\nBy removing Robot 2, we can keep the other three robots.\n\nSample Input 2\n\n2\n8 20\n1 10\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n10 1\n2 1\n4 1\n6 1\n8 1\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1334, "cpu_time_ms": 692, "memory_kb": 89108}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s582644542", "group_id": "codeNet:p02801", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n String C = sc.next();\n char c = C.charAt(0);\n\n System.out.println((char) (c + 1));\n }\n}\n", "language": "Java", "metadata": {"date": 1578859419, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02801.html", "problem_id": "p02801", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02801/input.txt", "sample_output_relpath": "derived/input_output/data/p02801/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02801/Java/s582644542.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s582644542", "user_id": "u466371843"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n String C = sc.next();\n char c = C.charAt(0);\n\n System.out.println((char) (c + 1));\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a lowercase English letter C that is not z. Print the letter that follows C in alphabetical order.\n\nConstraints\n\nC is a lowercase English letter that is not z.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC\n\nOutput\n\nPrint the letter that follows C in alphabetical order.\n\nSample Input 1\n\na\n\nSample Output 1\n\nb\n\na is followed by b.\n\nSample Input 2\n\ny\n\nSample Output 2\n\nz\n\ny is followed by z.", "sample_input": "a\n"}, "reference_outputs": ["b\n"], "source_document_id": "p02801", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a lowercase English letter C that is not z. Print the letter that follows C in alphabetical order.\n\nConstraints\n\nC is a lowercase English letter that is not z.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC\n\nOutput\n\nPrint the letter that follows C in alphabetical order.\n\nSample Input 1\n\na\n\nSample Output 1\n\nb\n\na is followed by b.\n\nSample Input 2\n\ny\n\nSample Output 2\n\nz\n\ny is followed by z.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 251, "cpu_time_ms": 108, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s878476679", "group_id": "codeNet:p02805", "input_text": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n double[] x = new double[n];\n double[] y = new double[n];\n for(int i = 0 ; i < n ; i++){\n x[i] = sc.nextDouble();\n y[i] = sc.nextDouble();\n }\n double yono = 100000;\n sc.close();\n for(int i = 0 ; i < n ; i++){//直径として全部入っている場合\n for(int j = 0 ; j < i ; j++){\n boolean ebishu = true;//全ての点が円の中に入っているかどうか\n for(int k = 0 ; k < n && ebishu ; k++){\n if((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]) < (x[j] + x[i] - 2 * x[k]) * (x[j] + x[i] - 2 * x[k]) + (y[j] + y[i] - 2 * y[k]) * (y[j] + y[i] - 2 * y[k]) - 0.001) ebishu = false;\n }\n if(ebishu) yono = Math.min(yono , Math.sqrt(((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j])) / 4.0));\n }\n }\n double px = 0 , py = 0;\n for(int i = 0 ; i < n ; i++){//3点を通る円の直径と中心の座標を求める\n for(int j = 0 ; j < i ; j++){\n for(int k = 0 ; k < j ; k++){\n if((x[k] - x[i]) * (y[j] - y[i]) != (x[j] - x[i]) * (y[k] - y[i])){\n py = ((x[k] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[j] * x[j] - y[j] * y[j]) - (x[j] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[k] * x[k] - y[k] * y[k])) / 2.0 / ((x[k] - x[i]) * (y[i] - y[j]) - (x[j] - x[i]) * (y[i] - y[k]));\n if(x[j] == x[i]){\n px = (2 * (y[i] - y[k]) * ((x[k] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[j] * x[j] - y[j] * y[j]) - (x[j] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[k] * x[k] - y[k] * y[k])) / 2.0 / ((x[k] - x[i]) * (y[i] - y[j]) - (x[j] - x[i]) * (y[i] - y[k])) - x[i] * x[i] - y[i] * y[i] + x[k] * x[k] + y[k] * y[k]) / 2.0 / (x[k] - x[i]);\n }else{\n px = (2 * (y[i] - y[j]) * ((x[k] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[j] * x[j] - y[j] * y[j]) - (x[j] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[k] * x[k] - y[k] * y[k])) / 2.0 / ((x[k] - x[i]) * (y[i] - y[j]) - (x[j] - x[i]) * (y[i] - y[k])) - x[i] * x[i] - y[i] * y[i] + x[j] * x[j] + y[j] * y[j]) / 2.0 / (x[j] - x[i]);\n }\n boolean ebi = true;\n for(int l = 0 ; l < n && ebi ; l++){\n if((x[i] - px) * (x[i] - px) + (y[i] - py) * (y[i] - py) < (x[l] - px) * (x[l] - px) + (y[l] - py) * (y[l] - py) - 0.001) ebi = false;\n }\n if(ebi) yono = Math.min(yono , Math.sqrt((x[i] - px) * (x[i] - px) + (y[i] - py) * (y[i] - py)));\n }\n }\n }\n }\n System.out.println(yono);\n }\n}", "language": "Java", "metadata": {"date": 1597251106, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02805.html", "problem_id": "p02805", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02805/input.txt", "sample_output_relpath": "derived/input_output/data/p02805/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02805/Java/s878476679.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s878476679", "user_id": "u073879055"}, "prompt_components": {"gold_output": "0.500000000000000000\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n double[] x = new double[n];\n double[] y = new double[n];\n for(int i = 0 ; i < n ; i++){\n x[i] = sc.nextDouble();\n y[i] = sc.nextDouble();\n }\n double yono = 100000;\n sc.close();\n for(int i = 0 ; i < n ; i++){//直径として全部入っている場合\n for(int j = 0 ; j < i ; j++){\n boolean ebishu = true;//全ての点が円の中に入っているかどうか\n for(int k = 0 ; k < n && ebishu ; k++){\n if((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]) < (x[j] + x[i] - 2 * x[k]) * (x[j] + x[i] - 2 * x[k]) + (y[j] + y[i] - 2 * y[k]) * (y[j] + y[i] - 2 * y[k]) - 0.001) ebishu = false;\n }\n if(ebishu) yono = Math.min(yono , Math.sqrt(((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j])) / 4.0));\n }\n }\n double px = 0 , py = 0;\n for(int i = 0 ; i < n ; i++){//3点を通る円の直径と中心の座標を求める\n for(int j = 0 ; j < i ; j++){\n for(int k = 0 ; k < j ; k++){\n if((x[k] - x[i]) * (y[j] - y[i]) != (x[j] - x[i]) * (y[k] - y[i])){\n py = ((x[k] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[j] * x[j] - y[j] * y[j]) - (x[j] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[k] * x[k] - y[k] * y[k])) / 2.0 / ((x[k] - x[i]) * (y[i] - y[j]) - (x[j] - x[i]) * (y[i] - y[k]));\n if(x[j] == x[i]){\n px = (2 * (y[i] - y[k]) * ((x[k] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[j] * x[j] - y[j] * y[j]) - (x[j] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[k] * x[k] - y[k] * y[k])) / 2.0 / ((x[k] - x[i]) * (y[i] - y[j]) - (x[j] - x[i]) * (y[i] - y[k])) - x[i] * x[i] - y[i] * y[i] + x[k] * x[k] + y[k] * y[k]) / 2.0 / (x[k] - x[i]);\n }else{\n px = (2 * (y[i] - y[j]) * ((x[k] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[j] * x[j] - y[j] * y[j]) - (x[j] - x[i]) * (x[i] * x[i] + y[i] * y[i] - x[k] * x[k] - y[k] * y[k])) / 2.0 / ((x[k] - x[i]) * (y[i] - y[j]) - (x[j] - x[i]) * (y[i] - y[k])) - x[i] * x[i] - y[i] * y[i] + x[j] * x[j] + y[j] * y[j]) / 2.0 / (x[j] - x[i]);\n }\n boolean ebi = true;\n for(int l = 0 ; l < n && ebi ; l++){\n if((x[i] - px) * (x[i] - px) + (y[i] - py) * (y[i] - py) < (x[l] - px) * (x[l] - px) + (y[l] - py) * (y[l] - py) - 0.001) ebi = false;\n }\n if(ebi) yono = Math.min(yono , Math.sqrt((x[i] - px) * (x[i] - px) + (y[i] - py) * (y[i] - py)));\n }\n }\n }\n }\n System.out.println(yono);\n }\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are N points (x_i, y_i) in a two-dimensional plane.\n\nFind the minimum radius of a circle such that all the points are inside or on it.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n0 \\leq x_i \\leq 1000\n\n0 \\leq y_i \\leq 1000\n\nThe given N points are all different.\n\nThe values in input are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum radius of a circle such that all the N points are inside or on it.\n\nYour output will be considered correct if the absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n2\n0 0\n1 0\n\nSample Output 1\n\n0.500000000000000000\n\nBoth points are contained in the circle centered at (0.5,0) with a radius of 0.5.\n\nSample Input 2\n\n3\n0 0\n0 1\n1 0\n\nSample Output 2\n\n0.707106781186497524\n\nSample Input 3\n\n10\n10 9\n5 9\n2 0\n0 0\n2 7\n3 3\n2 5\n10 0\n3 7\n1 9\n\nSample Output 3\n\n6.726812023536805158\n\nIf the absolute or relative error from our answer is at most 10^{-6}, the output will be considered correct.", "sample_input": "2\n0 0\n1 0\n"}, "reference_outputs": ["0.500000000000000000\n"], "source_document_id": "p02805", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are N points (x_i, y_i) in a two-dimensional plane.\n\nFind the minimum radius of a circle such that all the points are inside or on it.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n0 \\leq x_i \\leq 1000\n\n0 \\leq y_i \\leq 1000\n\nThe given N points are all different.\n\nThe values in input are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum radius of a circle such that all the N points are inside or on it.\n\nYour output will be considered correct if the absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n2\n0 0\n1 0\n\nSample Output 1\n\n0.500000000000000000\n\nBoth points are contained in the circle centered at (0.5,0) with a radius of 0.5.\n\nSample Input 2\n\n3\n0 0\n0 1\n1 0\n\nSample Output 2\n\n0.707106781186497524\n\nSample Input 3\n\n10\n10 9\n5 9\n2 0\n0 0\n2 7\n3 3\n2 5\n10 0\n3 7\n1 9\n\nSample Output 3\n\n6.726812023536805158\n\nIf the absolute or relative error from our answer is at most 10^{-6}, the output will be considered correct.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3574, "cpu_time_ms": 153, "memory_kb": 37764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s601487422", "group_id": "codeNet:p02805", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\t\n\t\tdouble minx = 0;\n\t\tdouble miny = 0;\n\t\tdouble maxx = 0;\n\t\tdouble maxy = 0;\n\t\tdouble[] ax = new double[n];\n\t\tdouble[] ay = new double[n];\n\t\tfor(int i = 0; i < n; i++)\n\t\t{\n\t\t\tdouble x = sc.nextDouble();\n\t\t\tdouble y = sc.nextDouble();\n\t\t\tax[i]=x;\n\t\t\tay[i]=y;\n\t\t\tif(i == 0)\n\t\t\t{\n\t\t\t\tminx = x;\n\t\t\t\tminy = y;\n\t\t\t\tmaxx = x;\n\t\t\t\tmaxy = y;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tminx = Math.min(minx, x);\n\t\t\t\tminy = Math.min(miny, y);\n\t\t\t\tmaxx = Math.max(maxx, x);\n\t\t\t\tmaxy = Math.max(maxy, y);\n\t\t\t}\n\t\t}\n\t\t\n\t\tdouble x = ((double)maxx + (double)minx)/2;\n\t\tdouble y = ((double)maxy + (double)miny)/2;\n\t\tdouble d = 0;\n\t\tfor(int i = 0; i < n; i++)\n\t\t{\n\t\t\tdouble dif = Math.sqrt((x-ax[i])*(x-ax[i]) + (y-ay[i])*(y-ay[i]));\n\t\t\td = Math.max(dif, d);\n\t\t}\n\t\tSystem.out.println(d);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1586630315, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02805.html", "problem_id": "p02805", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02805/input.txt", "sample_output_relpath": "derived/input_output/data/p02805/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02805/Java/s601487422.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s601487422", "user_id": "u245815044"}, "prompt_components": {"gold_output": "0.500000000000000000\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) \n\t{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\t\n\t\tdouble minx = 0;\n\t\tdouble miny = 0;\n\t\tdouble maxx = 0;\n\t\tdouble maxy = 0;\n\t\tdouble[] ax = new double[n];\n\t\tdouble[] ay = new double[n];\n\t\tfor(int i = 0; i < n; i++)\n\t\t{\n\t\t\tdouble x = sc.nextDouble();\n\t\t\tdouble y = sc.nextDouble();\n\t\t\tax[i]=x;\n\t\t\tay[i]=y;\n\t\t\tif(i == 0)\n\t\t\t{\n\t\t\t\tminx = x;\n\t\t\t\tminy = y;\n\t\t\t\tmaxx = x;\n\t\t\t\tmaxy = y;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tminx = Math.min(minx, x);\n\t\t\t\tminy = Math.min(miny, y);\n\t\t\t\tmaxx = Math.max(maxx, x);\n\t\t\t\tmaxy = Math.max(maxy, y);\n\t\t\t}\n\t\t}\n\t\t\n\t\tdouble x = ((double)maxx + (double)minx)/2;\n\t\tdouble y = ((double)maxy + (double)miny)/2;\n\t\tdouble d = 0;\n\t\tfor(int i = 0; i < n; i++)\n\t\t{\n\t\t\tdouble dif = Math.sqrt((x-ax[i])*(x-ax[i]) + (y-ay[i])*(y-ay[i]));\n\t\t\td = Math.max(dif, d);\n\t\t}\n\t\tSystem.out.println(d);\n\t}\n\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are N points (x_i, y_i) in a two-dimensional plane.\n\nFind the minimum radius of a circle such that all the points are inside or on it.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n0 \\leq x_i \\leq 1000\n\n0 \\leq y_i \\leq 1000\n\nThe given N points are all different.\n\nThe values in input are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum radius of a circle such that all the N points are inside or on it.\n\nYour output will be considered correct if the absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n2\n0 0\n1 0\n\nSample Output 1\n\n0.500000000000000000\n\nBoth points are contained in the circle centered at (0.5,0) with a radius of 0.5.\n\nSample Input 2\n\n3\n0 0\n0 1\n1 0\n\nSample Output 2\n\n0.707106781186497524\n\nSample Input 3\n\n10\n10 9\n5 9\n2 0\n0 0\n2 7\n3 3\n2 5\n10 0\n3 7\n1 9\n\nSample Output 3\n\n6.726812023536805158\n\nIf the absolute or relative error from our answer is at most 10^{-6}, the output will be considered correct.", "sample_input": "2\n0 0\n1 0\n"}, "reference_outputs": ["0.500000000000000000\n"], "source_document_id": "p02805", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are N points (x_i, y_i) in a two-dimensional plane.\n\nFind the minimum radius of a circle such that all the points are inside or on it.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n0 \\leq x_i \\leq 1000\n\n0 \\leq y_i \\leq 1000\n\nThe given N points are all different.\n\nThe values in input are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum radius of a circle such that all the N points are inside or on it.\n\nYour output will be considered correct if the absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n2\n0 0\n1 0\n\nSample Output 1\n\n0.500000000000000000\n\nBoth points are contained in the circle centered at (0.5,0) with a radius of 0.5.\n\nSample Input 2\n\n3\n0 0\n0 1\n1 0\n\nSample Output 2\n\n0.707106781186497524\n\nSample Input 3\n\n10\n10 9\n5 9\n2 0\n0 0\n2 7\n3 3\n2 5\n10 0\n3 7\n1 9\n\nSample Output 3\n\n6.726812023536805158\n\nIf the absolute or relative error from our answer is at most 10^{-6}, the output will be considered correct.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 911, "cpu_time_ms": 124, "memory_kb": 25172}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s990379379", "group_id": "codeNet:p02811", "input_text": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";\n\n static void solve() {\n int k = ni();\n int x = ni();\n\n out.println((k * 500 >= x) ? \"Yes\" : \"No\");\n }\n\n public static void main(String[] args) throws Exception {\n long S = System.currentTimeMillis();\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n solve();\n out.flush();\n long G = System.currentTimeMillis();\n tr(G-S+\"ms\");\n }\n\n private static boolean eof() {\n if(lenbuf == -1)return true;\n int lptr = ptrbuf;\n while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\n try {\n is.mark(1000);\n while(true){\n int b = is.read();\n if(b == -1){\n is.reset();\n return true;\n }else if(!isSpaceChar(b)){\n is.reset();\n return false;\n }\n }\n } catch (IOException e) {\n return true;\n }\n }\n\n private static byte[] inbuf = new byte[1024];\n static int lenbuf = 0, ptrbuf = 0;\n\n private static int readByte() {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\n private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private static double nd() { return Double.parseDouble(ns()); }\n private static char nc() { return (char)skip(); }\n\n private static String ns() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private static char[] ns(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private static char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private static int ni() {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private static long nl() {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n\n // Union-Find\n // https://algs4.cs.princeton.edu/15uf/UF.java.html\n public static class UnionFind {\n private int count = 0;\n private int[] parent, rank;\n\n public UnionFind(int n) {\n count = n;\n parent = new int[n];\n rank = new int[n];\n for (int i = 0; i < n; i++) {\n parent[i] = i;\n }\n }\n\n public int find(int p) {\n while (p != parent[p]) {\n parent[p] = parent[parent[p]];\n p = parent[p];\n }\n return p;\n }\n\n public void union(int p, int q) {\n int rootP = find(p);\n int rootQ = find(q);\n if (rootP ==rootQ) return;\n if (rank[rootQ] > rank[rootP]) {\n parent[rootP] = rootQ;\n } else {\n parent[rootQ] = rootP;\n if (rank[rootP] == rank[rootQ]) {\n rank[rootP]++;\n }\n }\n count--;\n }\n\n public int count() {\n return count;\n }\n\n public void print() {\n out.println(\"Parent:\");\n for (int i : parent) {\n out.print(i);\n out.print(\" \");\n }\n out.println();\n out.println(\"Rank:\");\n for (int i : rank) {\n out.print(i);\n out.print(\" \");\n }\n out.println();\n }\n }\n\n // Dijkstra\n // Return min distance from start to end O(ElogV) (negative cost is prohibited)\n // edge is int[3] array {from,to,cost}\n // edges is edge list from specific node\n // all_edges is Map\n static int dijkstra(Map> all_edges,int start,int end,int max_node_number) {\n int[] distance = new int[max_node_number + 1];\n Arrays.fill(distance, -1);\n PriorityQueue p_que = new PriorityQueue<>((a,b) -> ((distance[a[0]] + a[2]) - (distance[b[0]] + b[2])));\n distance[start] = 0;\n List edges = all_edges.get(start);\n p_que.addAll(edges);\n while (distance[end] < 0) {\n int[] nearest_edge = p_que.poll();\n assert nearest_edge != null;\n if (distance[nearest_edge[1]] < 0) {\n distance[nearest_edge[1]] = distance[nearest_edge[0]] + nearest_edge[2];\n if (all_edges.containsKey(nearest_edge[1])) {\n edges = all_edges.get(nearest_edge[1]);\n for (int[] edge : edges) {\n if (distance[edge[1]] < 0) p_que.add(edge);\n }\n }\n }\n }\n return distance[end];\n }\n\n // Enumerate primes in [2, n] with O(n log log n)\n public static List sieveOfEratosthenes(int n) {\n boolean[] isPrime = new boolean[n+1];\n Arrays.fill(isPrime, true);\n for (int i = 2; i * i <= n; i++) {\n if (isPrime[i]) {\n for (int j = i + i; j <= n; j += i) {\n isPrime[j] = false;\n }\n }\n }\n List primes = new ArrayList<>();\n for (int i = 2; i <= n; i++) {\n if (isPrime[i]) {\n primes.add(i);\n }\n }\n return primes;\n }\n\n // Count divisor\n public static int countDivisor(int n) {\n int[] list = new int[n + 1];\n Arrays.fill(list, 0);\n int num = n;\n for (int i = 2; i <= n; i++) {\n while (num % i == 0) {\n list[i] = list[i] + 1;\n num /= i;\n }\n }\n int ans = 1;\n for (int i : list) {\n ans *= (i + 1);\n }\n return ans;\n }\n}\n", "language": "Java", "metadata": {"date": 1592756235, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02811.html", "problem_id": "p02811", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02811/input.txt", "sample_output_relpath": "derived/input_output/data/p02811/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02811/Java/s990379379.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s990379379", "user_id": "u381460455"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";\n\n static void solve() {\n int k = ni();\n int x = ni();\n\n out.println((k * 500 >= x) ? \"Yes\" : \"No\");\n }\n\n public static void main(String[] args) throws Exception {\n long S = System.currentTimeMillis();\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n solve();\n out.flush();\n long G = System.currentTimeMillis();\n tr(G-S+\"ms\");\n }\n\n private static boolean eof() {\n if(lenbuf == -1)return true;\n int lptr = ptrbuf;\n while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\n try {\n is.mark(1000);\n while(true){\n int b = is.read();\n if(b == -1){\n is.reset();\n return true;\n }else if(!isSpaceChar(b)){\n is.reset();\n return false;\n }\n }\n } catch (IOException e) {\n return true;\n }\n }\n\n private static byte[] inbuf = new byte[1024];\n static int lenbuf = 0, ptrbuf = 0;\n\n private static int readByte() {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\n private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private static double nd() { return Double.parseDouble(ns()); }\n private static char nc() { return (char)skip(); }\n\n private static String ns() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private static char[] ns(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private static char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private static int ni() {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private static long nl() {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n\n // Union-Find\n // https://algs4.cs.princeton.edu/15uf/UF.java.html\n public static class UnionFind {\n private int count = 0;\n private int[] parent, rank;\n\n public UnionFind(int n) {\n count = n;\n parent = new int[n];\n rank = new int[n];\n for (int i = 0; i < n; i++) {\n parent[i] = i;\n }\n }\n\n public int find(int p) {\n while (p != parent[p]) {\n parent[p] = parent[parent[p]];\n p = parent[p];\n }\n return p;\n }\n\n public void union(int p, int q) {\n int rootP = find(p);\n int rootQ = find(q);\n if (rootP ==rootQ) return;\n if (rank[rootQ] > rank[rootP]) {\n parent[rootP] = rootQ;\n } else {\n parent[rootQ] = rootP;\n if (rank[rootP] == rank[rootQ]) {\n rank[rootP]++;\n }\n }\n count--;\n }\n\n public int count() {\n return count;\n }\n\n public void print() {\n out.println(\"Parent:\");\n for (int i : parent) {\n out.print(i);\n out.print(\" \");\n }\n out.println();\n out.println(\"Rank:\");\n for (int i : rank) {\n out.print(i);\n out.print(\" \");\n }\n out.println();\n }\n }\n\n // Dijkstra\n // Return min distance from start to end O(ElogV) (negative cost is prohibited)\n // edge is int[3] array {from,to,cost}\n // edges is edge list from specific node\n // all_edges is Map\n static int dijkstra(Map> all_edges,int start,int end,int max_node_number) {\n int[] distance = new int[max_node_number + 1];\n Arrays.fill(distance, -1);\n PriorityQueue p_que = new PriorityQueue<>((a,b) -> ((distance[a[0]] + a[2]) - (distance[b[0]] + b[2])));\n distance[start] = 0;\n List edges = all_edges.get(start);\n p_que.addAll(edges);\n while (distance[end] < 0) {\n int[] nearest_edge = p_que.poll();\n assert nearest_edge != null;\n if (distance[nearest_edge[1]] < 0) {\n distance[nearest_edge[1]] = distance[nearest_edge[0]] + nearest_edge[2];\n if (all_edges.containsKey(nearest_edge[1])) {\n edges = all_edges.get(nearest_edge[1]);\n for (int[] edge : edges) {\n if (distance[edge[1]] < 0) p_que.add(edge);\n }\n }\n }\n }\n return distance[end];\n }\n\n // Enumerate primes in [2, n] with O(n log log n)\n public static List sieveOfEratosthenes(int n) {\n boolean[] isPrime = new boolean[n+1];\n Arrays.fill(isPrime, true);\n for (int i = 2; i * i <= n; i++) {\n if (isPrime[i]) {\n for (int j = i + i; j <= n; j += i) {\n isPrime[j] = false;\n }\n }\n }\n List primes = new ArrayList<>();\n for (int i = 2; i <= n; i++) {\n if (isPrime[i]) {\n primes.add(i);\n }\n }\n return primes;\n }\n\n // Count divisor\n public static int countDivisor(int n) {\n int[] list = new int[n + 1];\n Arrays.fill(list, 0);\n int num = n;\n for (int i = 2; i <= n; i++) {\n while (num % i == 0) {\n list[i] = list[i] + 1;\n num /= i;\n }\n }\n int ans = 1;\n for (int i : list) {\n ans *= (i + 1);\n }\n return ans;\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "sample_input": "2 900\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02811", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7738, "cpu_time_ms": 114, "memory_kb": 36240}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s496037065", "group_id": "codeNet:p02811", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n\n// \tFile file = new File(\"test.txt\");\n// \tScanner sc = new Scanner(file);\n \tScanner sc = new Scanner(System.in);\n \tint K = sc.nextInt();\n \tint X = sc.nextInt();\n \tsc.close();\n \tSystem.out.println(500*K >= X ? \"Yes\" : \"No\");\n }\n}", "language": "Java", "metadata": {"date": 1589762867, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02811.html", "problem_id": "p02811", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02811/input.txt", "sample_output_relpath": "derived/input_output/data/p02811/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02811/Java/s496037065.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s496037065", "user_id": "u683985997"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n\n// \tFile file = new File(\"test.txt\");\n// \tScanner sc = new Scanner(file);\n \tScanner sc = new Scanner(System.in);\n \tint K = sc.nextInt();\n \tint X = sc.nextInt();\n \tsc.close();\n \tSystem.out.println(500*K >= X ? \"Yes\" : \"No\");\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "sample_input": "2 900\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02811", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 363, "cpu_time_ms": 96, "memory_kb": 22728}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s824973728", "group_id": "codeNet:p02811", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int count = sc.nextInt();\n int en = sc.nextInt();\n\n if (500 * count >= en) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1581115121, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02811.html", "problem_id": "p02811", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02811/input.txt", "sample_output_relpath": "derived/input_output/data/p02811/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02811/Java/s824973728.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s824973728", "user_id": "u090271540"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int count = sc.nextInt();\n int en = sc.nextInt();\n\n if (500 * count >= en) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "sample_input": "2 900\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02811", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 302, "cpu_time_ms": 93, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s402330435", "group_id": "codeNet:p02813", "input_text": "import java.util.*;\n\npublic class Main {\n\n static > boolean nextPermutation(T[] sequence) {\n int first = getFirst(sequence);\n if (first == -1) return false;\n int toSwap = sequence.length - 1;\n while (sequence[first].compareTo(sequence[toSwap]) >= 0) --toSwap;\n swap(sequence, first++, toSwap);\n toSwap = sequence.length - 1;\n while (first < toSwap) swap(sequence, first++, toSwap--);\n return true;\n }\n\n static > int getFirst(T[] sequence) {\n for (int i = sequence.length - 2; i >= 0; --i)\n if (sequence[i].compareTo(sequence[i + 1]) < 0) return i;\n return -1;\n }\n\n static > void swap(T[] sequence, int i, int j) {\n T tmp = sequence[i];\n sequence[i] = sequence[j];\n sequence[j] = tmp;\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n Integer[] p = new Integer[n];\n Integer[] q = new Integer[n];\n Integer[] perm = new Integer[n];\n for (int i = 0; i < n; ++i) p[i] = sc.nextInt();\n for (int i = 0; i < n; ++i) q[i] = sc.nextInt();\n for (int i = 0; i < n; ++i) perm[i] = i + 1;\n\n int pNum = 0, qNum = 0;\n int cnt = 1;\n do {\n if (Arrays.equals(perm, p)) pNum = cnt;\n if (Arrays.equals(perm, q)) qNum = cnt;\n ++cnt;\n } while (nextPermutation(perm));\n\n System.out.println(Math.abs(pNum - qNum));\n }\n}", "language": "Java", "metadata": {"date": 1591389229, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02813.html", "problem_id": "p02813", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02813/input.txt", "sample_output_relpath": "derived/input_output/data/p02813/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02813/Java/s402330435.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s402330435", "user_id": "u333573372"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n static > boolean nextPermutation(T[] sequence) {\n int first = getFirst(sequence);\n if (first == -1) return false;\n int toSwap = sequence.length - 1;\n while (sequence[first].compareTo(sequence[toSwap]) >= 0) --toSwap;\n swap(sequence, first++, toSwap);\n toSwap = sequence.length - 1;\n while (first < toSwap) swap(sequence, first++, toSwap--);\n return true;\n }\n\n static > int getFirst(T[] sequence) {\n for (int i = sequence.length - 2; i >= 0; --i)\n if (sequence[i].compareTo(sequence[i + 1]) < 0) return i;\n return -1;\n }\n\n static > void swap(T[] sequence, int i, int j) {\n T tmp = sequence[i];\n sequence[i] = sequence[j];\n sequence[j] = tmp;\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n Integer[] p = new Integer[n];\n Integer[] q = new Integer[n];\n Integer[] perm = new Integer[n];\n for (int i = 0; i < n; ++i) p[i] = sc.nextInt();\n for (int i = 0; i < n; ++i) q[i] = sc.nextInt();\n for (int i = 0; i < n; ++i) perm[i] = i + 1;\n\n int pNum = 0, qNum = 0;\n int cnt = 1;\n do {\n if (Arrays.equals(perm, p)) pNum = cnt;\n if (Arrays.equals(perm, q)) qNum = cnt;\n ++cnt;\n } while (nextPermutation(perm));\n\n System.out.println(Math.abs(pNum - qNum));\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two permutations P and Q of size N (that is, P and Q are both rearrangements of (1,~2,~...,~N)).\n\nThere are N! possible permutations of size N. Among them, let P and Q be the a-th and b-th lexicographically smallest permutations, respectively. Find |a - b|.\n\nNotes\n\nFor two sequences X and Y, X is said to be lexicographically smaller than Y if and only if there exists an integer k such that X_i = Y_i~(1 \\leq i < k) and X_k < Y_k.\n\nConstraints\n\n2 \\leq N \\leq 8\n\nP and Q are permutations of size N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 P_2 ... P_N\nQ_1 Q_2 ... Q_N\n\nOutput\n\nPrint |a - b|.\n\nSample Input 1\n\n3\n1 3 2\n3 1 2\n\nSample Output 1\n\n3\n\nThere are 6 permutations of size 3: (1,~2,~3), (1,~3,~2), (2,~1,~3), (2,~3,~1), (3,~1,~2), and (3,~2,~1). Among them, (1,~3,~2) and (3,~1,~2) come 2-nd and 5-th in lexicographical order, so the answer is |2 - 5| = 3.\n\nSample Input 2\n\n8\n7 3 5 4 2 1 6 8\n3 8 2 5 4 6 7 1\n\nSample Output 2\n\n17517\n\nSample Input 3\n\n3\n1 2 3\n1 2 3\n\nSample Output 3\n\n0", "sample_input": "3\n1 3 2\n3 1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02813", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two permutations P and Q of size N (that is, P and Q are both rearrangements of (1,~2,~...,~N)).\n\nThere are N! possible permutations of size N. Among them, let P and Q be the a-th and b-th lexicographically smallest permutations, respectively. Find |a - b|.\n\nNotes\n\nFor two sequences X and Y, X is said to be lexicographically smaller than Y if and only if there exists an integer k such that X_i = Y_i~(1 \\leq i < k) and X_k < Y_k.\n\nConstraints\n\n2 \\leq N \\leq 8\n\nP and Q are permutations of size N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 P_2 ... P_N\nQ_1 Q_2 ... Q_N\n\nOutput\n\nPrint |a - b|.\n\nSample Input 1\n\n3\n1 3 2\n3 1 2\n\nSample Output 1\n\n3\n\nThere are 6 permutations of size 3: (1,~2,~3), (1,~3,~2), (2,~1,~3), (2,~3,~1), (3,~1,~2), and (3,~2,~1). Among them, (1,~3,~2) and (3,~1,~2) come 2-nd and 5-th in lexicographical order, so the answer is |2 - 5| = 3.\n\nSample Input 2\n\n8\n7 3 5 4 2 1 6 8\n3 8 2 5 4 6 7 1\n\nSample Output 2\n\n17517\n\nSample Input 3\n\n3\n1 2 3\n1 2 3\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1598, "cpu_time_ms": 123, "memory_kb": 23436}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s635397599", "group_id": "codeNet:p02813", "input_text": "import java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Queue;\nimport java.util.Scanner;\n \n\n\npublic class Main {\n\tstatic int a1[]= {0,-1,0,1};\n\tstatic int b1[]= {-1,0,1,0};\n\tprivate static Scanner sc = new Scanner(System.in);\n\t//result = Math.pow(num1, num3)\n\t//StringBuffer str = new StringBuffer(hoge1);\n\t//String hoge2 = str.reverse().toString();\n\t//map.containsKey(A)\n\n\t//Map map = new HashMap(n);\n\t/*for ( キーのデータ型 key : マップの名前.keySet() ) {\n\t\tデータのデータ型 data = マップの名前.get( key );\n\t\t\n\t\t// keyやdataを使った処理;\n\t}*/\n\t//int i = Integer.parseInt(s);\n\t//Queue qq=new ArrayDeque<>(); //add,poll,peek\n\t//Deque qq=new ArrayDeque<>();//push,pop,peek\n\t//ArrayList cc = new ArrayList<>(n);\n\t//Collections.sort(list);\n\t//Array.sort(list); cc.contains(tmp)\n\t//Arrays.asList(c).contains(\"a\")\n\t//list.set(1,\"walk\");//1 1 2 3 5\n\tstatic int K,N;\n\tstatic int mod =1000000007;\n\tpublic static void main(String[] args) {\n\t\tint N=sc.nextInt();\n\t\tString a=\"\";\n\t\tString b=\"\";\n\t\tfor(int i=0;i cc = new ArrayList<>(10001);\n\t\n\tstatic void p(String ans) {System.out.println(ans);};\n\tstatic void p(int ans) {System.out.println(ans);};\n\tstatic void p() {System.out.println();};\n\tstatic void p(long ans) {System.out.println(ans);};\n\tstatic void p(double ans) {System.out.println(ans);};\n\tstatic String nextPermutation(String s) {\n\t\tArrayList list=new ArrayList<>();\n\t\tfor(int i=0;i=0;i--) {\n\t\t\tif(list.get(i)=L;i--) {\n\t\t\tif(pivot map = new HashMap(n);\n\t/*for ( キーのデータ型 key : マップの名前.keySet() ) {\n\t\tデータのデータ型 data = マップの名前.get( key );\n\t\t\n\t\t// keyやdataを使った処理;\n\t}*/\n\t//int i = Integer.parseInt(s);\n\t//Queue qq=new ArrayDeque<>(); //add,poll,peek\n\t//Deque qq=new ArrayDeque<>();//push,pop,peek\n\t//ArrayList cc = new ArrayList<>(n);\n\t//Collections.sort(list);\n\t//Array.sort(list); cc.contains(tmp)\n\t//Arrays.asList(c).contains(\"a\")\n\t//list.set(1,\"walk\");//1 1 2 3 5\n\tstatic int K,N;\n\tstatic int mod =1000000007;\n\tpublic static void main(String[] args) {\n\t\tint N=sc.nextInt();\n\t\tString a=\"\";\n\t\tString b=\"\";\n\t\tfor(int i=0;i cc = new ArrayList<>(10001);\n\t\n\tstatic void p(String ans) {System.out.println(ans);};\n\tstatic void p(int ans) {System.out.println(ans);};\n\tstatic void p() {System.out.println();};\n\tstatic void p(long ans) {System.out.println(ans);};\n\tstatic void p(double ans) {System.out.println(ans);};\n\tstatic String nextPermutation(String s) {\n\t\tArrayList list=new ArrayList<>();\n\t\tfor(int i=0;i=0;i--) {\n\t\t\tif(list.get(i)=L;i--) {\n\t\t\tif(pivot> 32);}\n\tstatic public final int getPari2(long v) {return (int)(v & 0xFFFFFFFF);}\n\n\tstatic public final long quad(long a, long b, long c, long d) {\n\t\treturn ((a&0xFFFF)<< 48) + ((b&0xFFFF)<< 32) + ((c&0xFFFF)<< 16) +(d&0xFFFF);}\n\tstatic public final int getQuad1(long v) {return (int)( v >> 48 );}\n\tstatic public final int getQuad2(long v) {return (int)((v >> 32) & 0xFFFF);}\n\tstatic public final int getQuad3(long v) {return (int)((v >> 16) & 0xFFFF);}\n\tstatic public final int getQuad4(long v) {return (int)( v & 0xFFFF);}\n\n\tstatic public final long record(int e, int m, int i) {\n\t\treturn quad(-1, e, m, i);\n\t}\n\tstatic public final int re(long record) {\n\t\treturn getQuad2(record);\n\t}\n\tstatic public final int rm(long record) {\n\t\treturn getQuad3(record);\n\t}\n\tstatic public final int ri(long record) {\n\t\treturn getQuad4(record);\n\t}\n\n\t//------------------------------------------\n\n\tprivate int p;\n\tprivate int[] inv;\n\tprivate int[] fact;\n\tprivate int[] finv;\n\tpublic final int mod(long v) {\n\t\tv %= p;\n\t\treturn (int)(v < 0 ? v+p : v);\n\t}\n\tpublic final int mul(long a, long b) {\n\t\treturn mod(a*b);\n\t}\n\tpublic final void initFact(double limit, double p) {\n\t\tinitFact((int)limit, (int)p);\n\t}\n\tpublic final void initFact(int limit, int p) {\n\t\tthis.p = p;\n\t\tthis.inv = new int[limit+1];\n\t\tthis.fact = new int[limit+1];\n\t\tthis.finv = new int[limit+1];\n\t\tfact[1] = finv[1] = inv[0] = inv[1] = 1;\n\t\tfor(int i=2;i<=limit;i++) {\n\t\t\tint a = p / i;\n\t\t\tint b = p % i;\n\t\t\tinv[i] = mul(-a, inv[b]);\n\t\t\tfact[i] = mul(fact[i-1], i);\n\t\t\tfinv[i] = mul(finv[i-1], inv[i]);\n\t\t}\n\t}\n\tpublic final int comb(int m, int n) {\n\t\treturn mul(mul(fact[m], finv[n]), finv[m-n]);\n\t}\n\t//------------------------------------------\n\tstatic long lcm (long a, long b) {\n\t\tlong temp;\n\t\tlong c = a;\n\t\tc *= b;\n\t\twhile((temp = a%b)!=0) {\n\t\t\ta = b;\n\t\t\tb = temp;\n\t\t}\n\t\treturn (long)(c/b);\n\t}\n\n\t//------------------------------------------\n\n\n\n\tpublic void exec() throws Exception{\n\t\tfinal int N = sc.nextInt();\n\t\tfinal int[] T = new int[N];\n\t\tfinal int[] P = new int[N];\n\t\tfinal int[] Q = new int[N];\n\n\t\tList alist = new ArrayList();\n\t\tList blist = new ArrayList();\n\t\tfor(int i=0;i> 32);}\n\tstatic public final int getPari2(long v) {return (int)(v & 0xFFFFFFFF);}\n\n\tstatic public final long quad(long a, long b, long c, long d) {\n\t\treturn ((a&0xFFFF)<< 48) + ((b&0xFFFF)<< 32) + ((c&0xFFFF)<< 16) +(d&0xFFFF);}\n\tstatic public final int getQuad1(long v) {return (int)( v >> 48 );}\n\tstatic public final int getQuad2(long v) {return (int)((v >> 32) & 0xFFFF);}\n\tstatic public final int getQuad3(long v) {return (int)((v >> 16) & 0xFFFF);}\n\tstatic public final int getQuad4(long v) {return (int)( v & 0xFFFF);}\n\n\tstatic public final long record(int e, int m, int i) {\n\t\treturn quad(-1, e, m, i);\n\t}\n\tstatic public final int re(long record) {\n\t\treturn getQuad2(record);\n\t}\n\tstatic public final int rm(long record) {\n\t\treturn getQuad3(record);\n\t}\n\tstatic public final int ri(long record) {\n\t\treturn getQuad4(record);\n\t}\n\n\t//------------------------------------------\n\n\tprivate int p;\n\tprivate int[] inv;\n\tprivate int[] fact;\n\tprivate int[] finv;\n\tpublic final int mod(long v) {\n\t\tv %= p;\n\t\treturn (int)(v < 0 ? v+p : v);\n\t}\n\tpublic final int mul(long a, long b) {\n\t\treturn mod(a*b);\n\t}\n\tpublic final void initFact(double limit, double p) {\n\t\tinitFact((int)limit, (int)p);\n\t}\n\tpublic final void initFact(int limit, int p) {\n\t\tthis.p = p;\n\t\tthis.inv = new int[limit+1];\n\t\tthis.fact = new int[limit+1];\n\t\tthis.finv = new int[limit+1];\n\t\tfact[1] = finv[1] = inv[0] = inv[1] = 1;\n\t\tfor(int i=2;i<=limit;i++) {\n\t\t\tint a = p / i;\n\t\t\tint b = p % i;\n\t\t\tinv[i] = mul(-a, inv[b]);\n\t\t\tfact[i] = mul(fact[i-1], i);\n\t\t\tfinv[i] = mul(finv[i-1], inv[i]);\n\t\t}\n\t}\n\tpublic final int comb(int m, int n) {\n\t\treturn mul(mul(fact[m], finv[n]), finv[m-n]);\n\t}\n\t//------------------------------------------\n\tstatic long lcm (long a, long b) {\n\t\tlong temp;\n\t\tlong c = a;\n\t\tc *= b;\n\t\twhile((temp = a%b)!=0) {\n\t\t\ta = b;\n\t\t\tb = temp;\n\t\t}\n\t\treturn (long)(c/b);\n\t}\n\n\t//------------------------------------------\n\n\n\n\tpublic void exec() throws Exception{\n\t\tfinal int N = sc.nextInt();\n\t\tfinal int[] T = new int[N];\n\t\tfinal int[] P = new int[N];\n\t\tfinal int[] Q = new int[N];\n\n\t\tList alist = new ArrayList();\n\t\tList blist = new ArrayList();\n\t\tfor(int i=0;i li(){\n String[] ss = ss();\n ArrayList li = new ArrayList<>();\n for(int j = 0; j < ss.length; j++) li.add(Integer.parseInt(ss[j]));\n return li;\n }\n\n long l(){\n return Long.parseLong(s());\n }\n\n long[] ll(){\n String[] ss = ss();\n long[] ll = new long[ss.length];\n for(int j = 0; j < ss.length; j++) ll[j] = Long.parseLong(ss[j]);\n return ll;\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1577667667, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02817.html", "problem_id": "p02817", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02817/input.txt", "sample_output_relpath": "derived/input_output/data/p02817/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02817/Java/s534880554.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s534880554", "user_id": "u752907799"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main{\n static MyReader in = new MyReader();\n static PrintWriter out = new PrintWriter(System.out);\n\n public static void main(String[] args){\n String[] s = in.ss();\n out.println(s[1]+s[0]);\n out.flush();\n }\n\n static class MyReader extends BufferedReader{\n MyReader(){\n super(new InputStreamReader(System.in));\n }\n\n String s(){\n try{return readLine();}catch(IOException e){return \"\";}\n }\n\n String[] ss(){\n return s().split(\" \");\n }\n\n int i(){\n return Integer.parseInt(s());\n }\n\n int[] ii(){\n String[] ss = ss();\n int[] ii = new int[ss.length];\n for(int j = 0; j < ss.length; j++) ii[j] = Integer.parseInt(ss[j]);\n return ii;\n }\n\n ArrayList li(){\n String[] ss = ss();\n ArrayList li = new ArrayList<>();\n for(int j = 0; j < ss.length; j++) li.add(Integer.parseInt(ss[j]));\n return li;\n }\n\n long l(){\n return Long.parseLong(s());\n }\n\n long[] ll(){\n String[] ss = ss();\n long[] ll = new long[ss.length];\n for(int j = 0; j < ss.length; j++) ll[j] = Long.parseLong(ss[j]);\n return ll;\n }\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\nThe lengths of S and T are between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\noder atc\n\nSample Output 1\n\natcoder\n\nWhen S = oder and T = atc, concatenating T and S in this order results in atcoder.\n\nSample Input 2\n\nhumu humu\n\nSample Output 2\n\nhumuhumu", "sample_input": "oder atc\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p02817", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\nThe lengths of S and T are between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\noder atc\n\nSample Output 1\n\natcoder\n\nWhen S = oder and T = atc, concatenating T and S in this order results in atcoder.\n\nSample Input 2\n\nhumu humu\n\nSample Output 2\n\nhumuhumu", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1393, "cpu_time_ms": 71, "memory_kb": 21076}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s224121896", "group_id": "codeNet:p02819", "input_text": "\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n // TODO 自動生成されたメソッド・スタブ\n Scanner scanner = new Scanner(System.in);\n int minimumNumber = scanner.nextInt();\n boolean primeNumberFlag = true;\n while (true) {\n primeNumberFlag = true;\n for (int i = minimumNumber - 1; i > 1; i--) {\n if (minimumNumber % i == 0) {\n primeNumberFlag = false;\n break;\n }\n }\n if (primeNumberFlag) {\n break;\n }\n minimumNumber++;\n }\n System.out.println(minimumNumber);\n }\n\n}\n", "language": "Java", "metadata": {"date": 1578327042, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02819.html", "problem_id": "p02819", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02819/input.txt", "sample_output_relpath": "derived/input_output/data/p02819/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02819/Java/s224121896.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s224121896", "user_id": "u978208846"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n // TODO 自動生成されたメソッド・スタブ\n Scanner scanner = new Scanner(System.in);\n int minimumNumber = scanner.nextInt();\n boolean primeNumberFlag = true;\n while (true) {\n primeNumberFlag = true;\n for (int i = minimumNumber - 1; i > 1; i--) {\n if (minimumNumber % i == 0) {\n primeNumberFlag = false;\n break;\n }\n }\n if (primeNumberFlag) {\n break;\n }\n minimumNumber++;\n }\n System.out.println(minimumNumber);\n }\n\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "sample_input": "20\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02819", "source_text": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 611, "cpu_time_ms": 107, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s599527759", "group_id": "codeNet:p02820", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tint s = sc.nextInt();\n\t\tint p = sc.nextInt();\n\t\tint sum = 0;\n\t\tString t = sc.next();\n\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tchar l = 0;\n\t\t\tfor (int j = i; j < n; j += k) {\n\t\t\t\tif(t.charAt(j) != l) {\n\t\t\t\t\tif(t.charAt(j) == 'r') {\n\t\t\t\t\t\tsum += p;\n\t\t\t\t\t\tl = 'r';\n\t\t\t\t\t}else if(t.charAt(j) == 's'){\n\t\t\t\t\t\tsum += r;\n\t\t\t\t\t\tl = 's';\n\t\t\t\t\t}else {\n\t\t\t\t\t\tsum += s;\n\t\t\t\t\t\tl = 'p';\n\t\t\t\t\t}\n\t\t\t\t}else {\n\t\t\t\t\tl = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(sum);\n\t\tsc.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1577670160, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02820.html", "problem_id": "p02820", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02820/input.txt", "sample_output_relpath": "derived/input_output/data/p02820/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02820/Java/s599527759.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s599527759", "user_id": "u324881146"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint r = sc.nextInt();\n\t\tint s = sc.nextInt();\n\t\tint p = sc.nextInt();\n\t\tint sum = 0;\n\t\tString t = sc.next();\n\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tchar l = 0;\n\t\t\tfor (int j = i; j < n; j += k) {\n\t\t\t\tif(t.charAt(j) != l) {\n\t\t\t\t\tif(t.charAt(j) == 'r') {\n\t\t\t\t\t\tsum += p;\n\t\t\t\t\t\tl = 'r';\n\t\t\t\t\t}else if(t.charAt(j) == 's'){\n\t\t\t\t\t\tsum += r;\n\t\t\t\t\t\tl = 's';\n\t\t\t\t\t}else {\n\t\t\t\t\t\tsum += s;\n\t\t\t\t\t\tl = 'p';\n\t\t\t\t\t}\n\t\t\t\t}else {\n\t\t\t\t\tl = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(sum);\n\t\tsc.close();\n\t}\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAt an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:\n\nThe player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)\n\nEach time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):\n\nR points for winning with Rock;\n\nS points for winning with Scissors;\n\nP points for winning with Paper.\n\nHowever, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)\n\nBefore the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.\n\nThe information Takahashi obtained is given as a string T. If the i-th character of T (1 \\leq i \\leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.\n\nWhat is the maximum total score earned in the game by adequately choosing the hand to play in each round?\n\nNotes\n\nIn this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.\n\nIf a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;\n\nif a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;\n\nif a player chooses Paper and the other chooses Rock, the player choosing Paper wins;\n\nif both players play the same hand, it is a draw.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N-1\n\n1 \\leq R,S,P \\leq 10^4\n\nN,K,R,S, and P are all integers.\n\n|T| = N\n\nT consists of r, p, and s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nR S P\nT\n\nOutput\n\nPrint the maximum total score earned in the game.\n\nSample Input 1\n\n5 2\n8 7 6\nrsrpr\n\nSample Output 1\n\n27\n\nThe machine will play {Rock, Scissors, Rock, Paper, Rock}.\n\nWe can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.\nWe cannot earn more points, so the answer is 27.\n\nSample Input 2\n\n7 1\n100 10 1\nssssppr\n\nSample Output 2\n\n211\n\nSample Input 3\n\n30 5\n325 234 123\nrspsspspsrpspsppprpsprpssprpsr\n\nSample Output 3\n\n4996", "sample_input": "5 2\n8 7 6\nrsrpr\n"}, "reference_outputs": ["27\n"], "source_document_id": "p02820", "source_text": "Score : 400 points\n\nProblem Statement\n\nAt an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:\n\nThe player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)\n\nEach time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):\n\nR points for winning with Rock;\n\nS points for winning with Scissors;\n\nP points for winning with Paper.\n\nHowever, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)\n\nBefore the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.\n\nThe information Takahashi obtained is given as a string T. If the i-th character of T (1 \\leq i \\leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.\n\nWhat is the maximum total score earned in the game by adequately choosing the hand to play in each round?\n\nNotes\n\nIn this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.\n\nIf a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;\n\nif a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;\n\nif a player chooses Paper and the other chooses Rock, the player choosing Paper wins;\n\nif both players play the same hand, it is a draw.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N-1\n\n1 \\leq R,S,P \\leq 10^4\n\nN,K,R,S, and P are all integers.\n\n|T| = N\n\nT consists of r, p, and s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nR S P\nT\n\nOutput\n\nPrint the maximum total score earned in the game.\n\nSample Input 1\n\n5 2\n8 7 6\nrsrpr\n\nSample Output 1\n\n27\n\nThe machine will play {Rock, Scissors, Rock, Paper, Rock}.\n\nWe can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.\nWe cannot earn more points, so the answer is 27.\n\nSample Input 2\n\n7 1\n100 10 1\nssssppr\n\nSample Output 2\n\n211\n\nSample Input 3\n\n30 5\n325 234 123\nrspsspspsrpspsppprpsprpssprpsr\n\nSample Output 3\n\n4996", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 661, "cpu_time_ms": 165, "memory_kb": 26156}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s658911592", "group_id": "codeNet:p02821", "input_text": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.awt.Point;\n \npublic class Main {\n\tstatic final long MOD = 998244353L;\n\t//static final long INF = -1000000000000000007L;\n\t//static final long MOD = 1000000007L;\n\t//static final int INF = 1000000007;\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\tint N = sc.ni();\n\t\tlong M = sc.nl();\n\t\tArrayList nums = new ArrayList();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tnums.add(sc.ni());\n\t\t}\n\t\tCollections.sort(nums,Collections.reverseOrder());\n\t\tlong[] pref = new long[N+1];\n\t\tfor (int i = 1; i <= N; i++) {\n\t\t\tpref[i] = pref[i-1]+nums.get(i-1);\n\t\t}\n\t\t//pw.println(nums);\n\t\t//Binary search to find the minimum value of each of the M handshakes\n\t\tint low = 0;\n\t\tint high = 2*nums.get(0);\n\t\twhile (low < high) {\n\t\t\tint med = (low+high+1)/2;\n\t\t\tlong shakes = 0;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\t//Do another binary search to find the number of shakes possible\n\t\t\t\tint min = med-nums.get(i);\n\t\t\t\tif (min > nums.get(0)) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tint Li = 0;\n\t\t\t\tint Ri = N-1;\n\t\t\t\twhile (Li < Ri) {\n\t\t\t\t\tint Mi = (Li+Ri+1)/2;\n\t\t\t\t\tif (nums.get(Mi) >= min) {\n\t\t\t\t\t\tLi = Mi;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tRi = Mi-1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tshakes += (Li+1);\n\t\t\t}\n\n\t\t\tif (shakes >= M) {\n\t\t\t\tlow = med;\n\t\t\t} else {\n\t\t\t\thigh = med-1;\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ans = 0;\n\t\tlong shakes = 0;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tint min = low-nums.get(i);\n\t\t\tif (min > nums.get(0)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tint Li = 0;\n\t\t\tint Ri = N-1;\n\t\t\twhile (Li < Ri) {\n\t\t\t\tint Mi = (Li+Ri+1)/2;\n\t\t\t\tif (nums.get(Mi) >= min) {\n\t\t\t\t\tLi = Mi;\n\t\t\t\t} else {\n\t\t\t\t\tRi = Mi-1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tshakes += (Li+1);\n\t\t\tans += ((Li+1)*nums.get(i));\n\t\t\tans += pref[Li+1];\n\t\t}\n\t\tlong extraShakes = shakes-M;\n\t\tans -= extraShakes*low;\n\t\tpw.println(ans);\n\t\tpw.close();\n\t}\n\t\n\t//Find the GCD of two numbers\n\tpublic static long gcd(long a, long b) {\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn gcd(b,a%b);\n\t}\n\t\n\t//Fast exponentiation (x^y mod m)\n\tpublic static long power(long x, long y, long m) { \n\t\tlong ans = 1;\n\t\tx %= m;\n\t\twhile (y > 0) { \n\t\t\tif(y % 2 == 1) \n\t\t\t\tans = (ans * x) % m; \n\t\t\ty /= 2; \n\t\t\tx = (x * x) % m;\n\t\t} \n\t\treturn ans; \n\t}\n\t\n public static int[][] sort(int[][] array) {\n \t//Sort an array (immune to quicksort TLE)\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t int[] temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\tArrays.sort(array, new Comparator() {\n\t\t\t @Override\n \t public int compare(int[] arr1, int[] arr2) {\n\t\t\t\t return arr1[1]-arr2[1]; //ascending order\n\t }\n\t\t});\n\t\treturn array;\n\t}\n \n public static long[][] sort(long[][] array) {\n \t//Sort an array (immune to quicksort TLE)\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t long[] temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\tArrays.sort(array, new Comparator() {\n\t\t\t @Override\n \t public int compare(long[] arr1, long[] arr2) {\n\t\t\t\t return 0;\n\t }\n\t\t});\n\t\treturn array;\n\t}\n \n static class FastScanner { \n BufferedReader br; \n StringTokenizer st; \n \n public FastScanner() { \n br = new BufferedReader(new InputStreamReader(System.in)); \n } \n \n String next() { \n while (st == null || !st.hasMoreElements()) { \n try { \n st = new StringTokenizer(br.readLine());\n } catch (IOException e) { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n \n int ni() { \n return Integer.parseInt(next()); \n } \n \n long nl() { \n return Long.parseLong(next()); \n } \n \n double nd() { \n return Double.parseDouble(next()); \n } \n \n String nextLine() { \n String str = \"\"; \n try { \n str = br.readLine(); \n } catch (IOException e) {\n e.printStackTrace(); \n } \n return str;\n }\n }\n}", "language": "Java", "metadata": {"date": 1578038621, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02821.html", "problem_id": "p02821", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02821/input.txt", "sample_output_relpath": "derived/input_output/data/p02821/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02821/Java/s658911592.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s658911592", "user_id": "u495186373"}, "prompt_components": {"gold_output": "202\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.awt.Point;\n \npublic class Main {\n\tstatic final long MOD = 998244353L;\n\t//static final long INF = -1000000000000000007L;\n\t//static final long MOD = 1000000007L;\n\t//static final int INF = 1000000007;\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tPrintWriter pw = new PrintWriter(System.out);\n\t\tint N = sc.ni();\n\t\tlong M = sc.nl();\n\t\tArrayList nums = new ArrayList();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tnums.add(sc.ni());\n\t\t}\n\t\tCollections.sort(nums,Collections.reverseOrder());\n\t\tlong[] pref = new long[N+1];\n\t\tfor (int i = 1; i <= N; i++) {\n\t\t\tpref[i] = pref[i-1]+nums.get(i-1);\n\t\t}\n\t\t//pw.println(nums);\n\t\t//Binary search to find the minimum value of each of the M handshakes\n\t\tint low = 0;\n\t\tint high = 2*nums.get(0);\n\t\twhile (low < high) {\n\t\t\tint med = (low+high+1)/2;\n\t\t\tlong shakes = 0;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\t//Do another binary search to find the number of shakes possible\n\t\t\t\tint min = med-nums.get(i);\n\t\t\t\tif (min > nums.get(0)) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tint Li = 0;\n\t\t\t\tint Ri = N-1;\n\t\t\t\twhile (Li < Ri) {\n\t\t\t\t\tint Mi = (Li+Ri+1)/2;\n\t\t\t\t\tif (nums.get(Mi) >= min) {\n\t\t\t\t\t\tLi = Mi;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tRi = Mi-1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tshakes += (Li+1);\n\t\t\t}\n\n\t\t\tif (shakes >= M) {\n\t\t\t\tlow = med;\n\t\t\t} else {\n\t\t\t\thigh = med-1;\n\t\t\t}\n\t\t}\n\t\t\n\t\tlong ans = 0;\n\t\tlong shakes = 0;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tint min = low-nums.get(i);\n\t\t\tif (min > nums.get(0)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tint Li = 0;\n\t\t\tint Ri = N-1;\n\t\t\twhile (Li < Ri) {\n\t\t\t\tint Mi = (Li+Ri+1)/2;\n\t\t\t\tif (nums.get(Mi) >= min) {\n\t\t\t\t\tLi = Mi;\n\t\t\t\t} else {\n\t\t\t\t\tRi = Mi-1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tshakes += (Li+1);\n\t\t\tans += ((Li+1)*nums.get(i));\n\t\t\tans += pref[Li+1];\n\t\t}\n\t\tlong extraShakes = shakes-M;\n\t\tans -= extraShakes*low;\n\t\tpw.println(ans);\n\t\tpw.close();\n\t}\n\t\n\t//Find the GCD of two numbers\n\tpublic static long gcd(long a, long b) {\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\telse\n\t\t\treturn gcd(b,a%b);\n\t}\n\t\n\t//Fast exponentiation (x^y mod m)\n\tpublic static long power(long x, long y, long m) { \n\t\tlong ans = 1;\n\t\tx %= m;\n\t\twhile (y > 0) { \n\t\t\tif(y % 2 == 1) \n\t\t\t\tans = (ans * x) % m; \n\t\t\ty /= 2; \n\t\t\tx = (x * x) % m;\n\t\t} \n\t\treturn ans; \n\t}\n\t\n public static int[][] sort(int[][] array) {\n \t//Sort an array (immune to quicksort TLE)\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t int[] temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\tArrays.sort(array, new Comparator() {\n\t\t\t @Override\n \t public int compare(int[] arr1, int[] arr2) {\n\t\t\t\t return arr1[1]-arr2[1]; //ascending order\n\t }\n\t\t});\n\t\treturn array;\n\t}\n \n public static long[][] sort(long[][] array) {\n \t//Sort an array (immune to quicksort TLE)\n\t\tRandom rgen = new Random();\n\t\tfor (int i = 0; i < array.length; i++) {\n\t\t int randomPosition = rgen.nextInt(array.length);\n\t\t long[] temp = array[i];\n\t\t array[i] = array[randomPosition];\n\t\t array[randomPosition] = temp;\n\t\t}\n\t\tArrays.sort(array, new Comparator() {\n\t\t\t @Override\n \t public int compare(long[] arr1, long[] arr2) {\n\t\t\t\t return 0;\n\t }\n\t\t});\n\t\treturn array;\n\t}\n \n static class FastScanner { \n BufferedReader br; \n StringTokenizer st; \n \n public FastScanner() { \n br = new BufferedReader(new InputStreamReader(System.in)); \n } \n \n String next() { \n while (st == null || !st.hasMoreElements()) { \n try { \n st = new StringTokenizer(br.readLine());\n } catch (IOException e) { \n e.printStackTrace(); \n } \n } \n return st.nextToken(); \n } \n \n int ni() { \n return Integer.parseInt(next()); \n } \n \n long nl() { \n return Long.parseLong(next()); \n } \n \n double nd() { \n return Double.parseDouble(next()); \n } \n \n String nextLine() { \n String str = \"\"; \n try { \n str = br.readLine(); \n } catch (IOException e) {\n e.printStackTrace(); \n } \n return str;\n }\n }\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "sample_input": "5 3\n10 14 19 34 33\n"}, "reference_outputs": ["202\n"], "source_document_id": "p02821", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4330, "cpu_time_ms": 523, "memory_kb": 44860}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s602914892", "group_id": "codeNet:p02821", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// N, Mを取得\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tString n_m = in.readLine();\n\n\t\t// 半角スペースで区切られたn, mを取得\n\t\tint spaceIndex = n_m.indexOf(\" \");\n\t\tint m = Integer.parseInt(n_m.substring(spaceIndex + 1));\n\n\t\t// 各パワーを取得\n\t\tString powers = in.readLine();\n\t\tString[] powerArray = powers.split(\" \");\n\n\t\t// 取得したパワーを昇順にソート\n\t\tList powerListAsc = new ArrayList<>();\n\t\tfor (String power : powerArray) {\n\t\t\tpowerListAsc.add(Integer.parseInt(power));\n\t\t}\n\t\tCollections.sort(powerListAsc);\n\n\t\t// 取得したパワーを降順にソート\n\t\tList powerList = new ArrayList<>();\n\t\tfor (int i = 0; i < powerListAsc.size(); i++) {\n\t\t\tpowerList.add(powerListAsc.get(powerListAsc.size() - (i + 1)));\n\t\t}\n\n\t\t/*\n\t\t * 幸福度を最大にするため、握手は下記の順序で行う\n\t\t * (1)両手でパワーが一番大きい人とする\n\t\t * (2)右手でパワーが一番大きい人、左手でパワーが二番目に大きい人とする\n\t\t * (3)左手でパワーが一番大きい人、右手でパワーが二番目に大きい人とする\n\t\t * (4)両手でパワーが二番目に大きい人とする\n\t\t * (5)右手でパワーが二番目に大きい人、左手でパワーが三番目に大きい人とする\n\t\t * (6)左手でパワーが二番目に大きい人、右手でパワーが三番目に大きい人とする\n\t\t *\n\t\t */\n\t\tint happiness = 0;\n\n\t\t// 3セットをカウントする\n\t\tint counter = 1;\n\t\t// 握手をm回行い幸福度を上げる\n\t\tfor (int i = 0; i < m; i++) {\n\n\t\t\t// 両手で握手したことがない一番強い人とその次に強い人のパワーを取得\n\t\t\tint power1 = powerList.get(i);\n\t\t\tint power2 = powerList.get(i + 1);\n\n\t\t\t// 1セット目は両手でパワーが一番大きい人とする\n\t\t\tif (counter == 1) {\n\n\t\t\t\thappiness += power1 + power1;\n\n\t\t\t\t// 2セット目は右手でパワーが一番大きい人、左手でパワーが二番目に大きい人とする\n\t\t\t} else if (counter == 2) {\n\n\t\t\t\thappiness += power1 + power2;\n\n\t\t\t\t// 3セット目は左手でパワーが一番大きい人、右手でパワーが二番目に大きい人とする\n\t\t\t} else if (counter == 3) {\n\n\t\t\t\thappiness += power2 + power1;\n\n\t\t\t} else {\n\t\t\t\tcounter = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t// 最終的な幸福度の最大値を出力\n\t\tSystem.out.println(happiness);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1577673502, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02821.html", "problem_id": "p02821", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02821/input.txt", "sample_output_relpath": "derived/input_output/data/p02821/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02821/Java/s602914892.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s602914892", "user_id": "u189576974"}, "prompt_components": {"gold_output": "202\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// N, Mを取得\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tString n_m = in.readLine();\n\n\t\t// 半角スペースで区切られたn, mを取得\n\t\tint spaceIndex = n_m.indexOf(\" \");\n\t\tint m = Integer.parseInt(n_m.substring(spaceIndex + 1));\n\n\t\t// 各パワーを取得\n\t\tString powers = in.readLine();\n\t\tString[] powerArray = powers.split(\" \");\n\n\t\t// 取得したパワーを昇順にソート\n\t\tList powerListAsc = new ArrayList<>();\n\t\tfor (String power : powerArray) {\n\t\t\tpowerListAsc.add(Integer.parseInt(power));\n\t\t}\n\t\tCollections.sort(powerListAsc);\n\n\t\t// 取得したパワーを降順にソート\n\t\tList powerList = new ArrayList<>();\n\t\tfor (int i = 0; i < powerListAsc.size(); i++) {\n\t\t\tpowerList.add(powerListAsc.get(powerListAsc.size() - (i + 1)));\n\t\t}\n\n\t\t/*\n\t\t * 幸福度を最大にするため、握手は下記の順序で行う\n\t\t * (1)両手でパワーが一番大きい人とする\n\t\t * (2)右手でパワーが一番大きい人、左手でパワーが二番目に大きい人とする\n\t\t * (3)左手でパワーが一番大きい人、右手でパワーが二番目に大きい人とする\n\t\t * (4)両手でパワーが二番目に大きい人とする\n\t\t * (5)右手でパワーが二番目に大きい人、左手でパワーが三番目に大きい人とする\n\t\t * (6)左手でパワーが二番目に大きい人、右手でパワーが三番目に大きい人とする\n\t\t *\n\t\t */\n\t\tint happiness = 0;\n\n\t\t// 3セットをカウントする\n\t\tint counter = 1;\n\t\t// 握手をm回行い幸福度を上げる\n\t\tfor (int i = 0; i < m; i++) {\n\n\t\t\t// 両手で握手したことがない一番強い人とその次に強い人のパワーを取得\n\t\t\tint power1 = powerList.get(i);\n\t\t\tint power2 = powerList.get(i + 1);\n\n\t\t\t// 1セット目は両手でパワーが一番大きい人とする\n\t\t\tif (counter == 1) {\n\n\t\t\t\thappiness += power1 + power1;\n\n\t\t\t\t// 2セット目は右手でパワーが一番大きい人、左手でパワーが二番目に大きい人とする\n\t\t\t} else if (counter == 2) {\n\n\t\t\t\thappiness += power1 + power2;\n\n\t\t\t\t// 3セット目は左手でパワーが一番大きい人、右手でパワーが二番目に大きい人とする\n\t\t\t} else if (counter == 3) {\n\n\t\t\t\thappiness += power2 + power1;\n\n\t\t\t} else {\n\t\t\t\tcounter = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t// 最終的な幸福度の最大値を出力\n\t\tSystem.out.println(happiness);\n\t}\n\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "sample_input": "5 3\n10 14 19 34 33\n"}, "reference_outputs": ["202\n"], "source_document_id": "p02821", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2690, "cpu_time_ms": 285, "memory_kb": 48152}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s549187437", "group_id": "codeNet:p02823", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] sa = br.readLine().split(\" \");\n\t\tlong n = Long.parseLong(sa[0]);\n\t\tlong a = Long.parseLong(sa[1]);\n\t\tlong b = Long.parseLong(sa[2]);\n\t\tbr.close();\n\n\t\tlong c = b - a;\n\t\tif (c % 2 == 0) {\n\t\t\tSystem.out.println(c / 2);\n\t\t} else {\n\t\t\tlong a1 = a - 1;\n\t\t\tlong b1 = b - a1;\n\t\t\tlong ans1 = a1 + b1 / 2;\n\n\t\t\tlong b2 = n - b;\n\t\t\tlong a2 = a + b2;\n\t\t\tlong ans2 = b2 + (n - a2 + 1) / 2;\n\t\t\tSystem.out.println(Math.min(ans1, ans2));\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1577585193, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02823.html", "problem_id": "p02823", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02823/input.txt", "sample_output_relpath": "derived/input_output/data/p02823/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02823/Java/s549187437.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s549187437", "user_id": "u522636435"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] sa = br.readLine().split(\" \");\n\t\tlong n = Long.parseLong(sa[0]);\n\t\tlong a = Long.parseLong(sa[1]);\n\t\tlong b = Long.parseLong(sa[2]);\n\t\tbr.close();\n\n\t\tlong c = b - a;\n\t\tif (c % 2 == 0) {\n\t\t\tSystem.out.println(c / 2);\n\t\t} else {\n\t\t\tlong a1 = a - 1;\n\t\t\tlong b1 = b - a1;\n\t\t\tlong ans1 = a1 + b1 / 2;\n\n\t\t\tlong b2 = n - b;\n\t\t\tlong a2 = a + b2;\n\t\t\tlong ans2 = b2 + (n - a2 + 1) / 2;\n\t\t\tSystem.out.println(Math.min(ans1, ans2));\n\t\t}\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\n2N players are running a competitive table tennis training on N tables numbered from 1 to N.\n\nThe training consists of rounds.\nIn each round, the players form N pairs, one pair per table.\nIn each pair, competitors play a match against each other.\nAs a result, one of them wins and the other one loses.\n\nThe winner of the match on table X plays on table X-1 in the next round,\nexcept for the winner of the match on table 1 who stays at table 1.\n\nSimilarly, the loser of the match on table X plays on table X+1 in the next round,\nexcept for the loser of the match on table N who stays at table N.\n\nTwo friends are playing their first round matches on distinct tables A and B.\nLet's assume that the friends are strong enough to win or lose any match at will.\nWhat is the smallest number of rounds after which the friends can get to play a match against each other?\n\nConstraints\n\n2 \\leq N \\leq 10^{18}\n\n1 \\leq A < B \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the smallest number of rounds after which the friends can get to play a match against each other.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n1\n\nIf the first friend loses their match and the second friend wins their match, they will both move to table 3 and play each other in the next round.\n\nSample Input 2\n\n5 2 3\n\nSample Output 2\n\n2\n\nIf both friends win two matches in a row, they will both move to table 1.", "sample_input": "5 2 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02823", "source_text": "Score : 300 points\n\nProblem Statement\n\n2N players are running a competitive table tennis training on N tables numbered from 1 to N.\n\nThe training consists of rounds.\nIn each round, the players form N pairs, one pair per table.\nIn each pair, competitors play a match against each other.\nAs a result, one of them wins and the other one loses.\n\nThe winner of the match on table X plays on table X-1 in the next round,\nexcept for the winner of the match on table 1 who stays at table 1.\n\nSimilarly, the loser of the match on table X plays on table X+1 in the next round,\nexcept for the loser of the match on table N who stays at table N.\n\nTwo friends are playing their first round matches on distinct tables A and B.\nLet's assume that the friends are strong enough to win or lose any match at will.\nWhat is the smallest number of rounds after which the friends can get to play a match against each other?\n\nConstraints\n\n2 \\leq N \\leq 10^{18}\n\n1 \\leq A < B \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the smallest number of rounds after which the friends can get to play a match against each other.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n1\n\nIf the first friend loses their match and the second friend wins their match, they will both move to table 3 and play each other in the next round.\n\nSample Input 2\n\n5 2 3\n\nSample Output 2\n\n2\n\nIf both friends win two matches in a row, they will both move to table 1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 662, "cpu_time_ms": 76, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s691378757", "group_id": "codeNet:p02824", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint m = scanner.nextInt();\n\t\tint v = scanner.nextInt();\n\t\tint p = scanner.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\t\tArrays.parallelSort(a);\n\n\t\tint k = p + 1, threshold, remain, canVote, result = p;\n\t\twhile (k <= n) {\n\t\t\tthreshold = a[n - k] + m;\n\t\t\tif (threshold < a[n - p]) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tremain = v - (n + p - k);\n\t\t\tif (remain <= 0) {\n\t\t\t\tresult = k;\n\t\t\t\tk++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tcanVote = 0;\n\t\t\tfor (int i = p; i < k; i++) {\n\t\t\t\tcanVote += threshold - a[n - i];\n\t\t\t}\n\t\t\tif (canVote < remain * m) {\n\t\t\t\tbreak;\n\t\t\t} else {\n\t\t\t\tresult = k;\n\t\t\t\tk++;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t}\n\t\tSystem.out.println(result);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1584155386, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02824.html", "problem_id": "p02824", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02824/input.txt", "sample_output_relpath": "derived/input_output/data/p02824/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02824/Java/s691378757.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s691378757", "user_id": "u154898295"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint m = scanner.nextInt();\n\t\tint v = scanner.nextInt();\n\t\tint p = scanner.nextInt();\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = scanner.nextInt();\n\t\t}\n\t\tArrays.parallelSort(a);\n\n\t\tint k = p + 1, threshold, remain, canVote, result = p;\n\t\twhile (k <= n) {\n\t\t\tthreshold = a[n - k] + m;\n\t\t\tif (threshold < a[n - p]) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tremain = v - (n + p - k);\n\t\t\tif (remain <= 0) {\n\t\t\t\tresult = k;\n\t\t\t\tk++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tcanVote = 0;\n\t\t\tfor (int i = p; i < k; i++) {\n\t\t\t\tcanVote += threshold - a[n - i];\n\t\t\t}\n\t\t\tif (canVote < remain * m) {\n\t\t\t\tbreak;\n\t\t\t} else {\n\t\t\t\tresult = k;\n\t\t\t\tk++;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t}\n\t\tSystem.out.println(result);\n\t}\n\n}\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nN problems are proposed for an upcoming contest. Problem i has an initial integer score of A_i points.\n\nM judges are about to vote for problems they like. Each judge will choose exactly V problems, independently from the other judges,\nand increase the score of each chosen problem by 1.\n\nAfter all M judges cast their vote, the problems will be sorted in non-increasing order of score, and the first P problems will be chosen for the problemset.\nProblems with the same score can be ordered arbitrarily, this order is decided by the chief judge.\n\nHow many problems out of the given N have a chance to be chosen for the problemset?\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le M \\le 10^9\n\n1 \\le V \\le N - 1\n\n1 \\le P \\le N - 1\n\n0 \\le A_i \\le 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M V P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of problems that have a chance to be chosen for the problemset.\n\nSample Input 1\n\n6 1 2 2\n2 1 1 3 0 2\n\nSample Output 1\n\n5\n\nIf the only judge votes for problems 2 and 5, the scores will be 2 2 1 3 1 2.\nThe problemset will consist of problem 4 and one of problems 1, 2, or 6.\n\nIf the only judge votes for problems 3 and 4, the scores will be 2 1 2 4 0 2.\nThe problemset will consist of problem 4 and one of problems 1, 3, or 6.\n\nThus, problems 1, 2, 3, 4, and 6 have a chance to be chosen for the problemset. On the contrary, there is no way for problem 5 to be chosen.\n\nSample Input 2\n\n6 1 5 2\n2 1 1 3 0 2\n\nSample Output 2\n\n3\n\nOnly problems 1, 4, and 6 have a chance to be chosen.\n\nSample Input 3\n\n10 4 8 5\n7 2 3 6 1 6 5 4 6 5\n\nSample Output 3\n\n8", "sample_input": "6 1 2 2\n2 1 1 3 0 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02824", "source_text": "Score : 700 points\n\nProblem Statement\n\nN problems are proposed for an upcoming contest. Problem i has an initial integer score of A_i points.\n\nM judges are about to vote for problems they like. Each judge will choose exactly V problems, independently from the other judges,\nand increase the score of each chosen problem by 1.\n\nAfter all M judges cast their vote, the problems will be sorted in non-increasing order of score, and the first P problems will be chosen for the problemset.\nProblems with the same score can be ordered arbitrarily, this order is decided by the chief judge.\n\nHow many problems out of the given N have a chance to be chosen for the problemset?\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le M \\le 10^9\n\n1 \\le V \\le N - 1\n\n1 \\le P \\le N - 1\n\n0 \\le A_i \\le 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M V P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of problems that have a chance to be chosen for the problemset.\n\nSample Input 1\n\n6 1 2 2\n2 1 1 3 0 2\n\nSample Output 1\n\n5\n\nIf the only judge votes for problems 2 and 5, the scores will be 2 2 1 3 1 2.\nThe problemset will consist of problem 4 and one of problems 1, 2, or 6.\n\nIf the only judge votes for problems 3 and 4, the scores will be 2 1 2 4 0 2.\nThe problemset will consist of problem 4 and one of problems 1, 3, or 6.\n\nThus, problems 1, 2, 3, 4, and 6 have a chance to be chosen for the problemset. On the contrary, there is no way for problem 5 to be chosen.\n\nSample Input 2\n\n6 1 5 2\n2 1 1 3 0 2\n\nSample Output 2\n\n3\n\nOnly problems 1, 4, and 6 have a chance to be chosen.\n\nSample Input 3\n\n10 4 8 5\n7 2 3 6 1 6 5 4 6 5\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 868, "cpu_time_ms": 737, "memory_kb": 51336}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s971803858", "group_id": "codeNet:p02829", "input_text": "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n boolean[] a = new boolean[3];\n for (int i = 0; i < 2; i++) {\n a[sc.nextInt() - 1] = true;\n }\n for(int i = 0; i < 3; i++) {\n if (!a[i])\n System.out.println(i + 1);\n }\n }\n}", "language": "Java", "metadata": {"date": 1586056044, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02829.html", "problem_id": "p02829", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02829/input.txt", "sample_output_relpath": "derived/input_output/data/p02829/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02829/Java/s971803858.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s971803858", "user_id": "u272319314"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n boolean[] a = new boolean[3];\n for (int i = 0; i < 2; i++) {\n a[sc.nextInt() - 1] = true;\n }\n for(int i = 0; i < 3; i++) {\n if (!a[i])\n System.out.println(i + 1);\n }\n }\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "sample_input": "3\n1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02829", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 370, "cpu_time_ms": 93, "memory_kb": 24020}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s288980955", "group_id": "codeNet:p02829", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tint A = scn.nextInt(), B = scn.nextInt();\n\t\tboolean[] ans = new boolean[3];\n\t\tans[A-1] = true;\n\t\tans[B-1] = true;\n\t\tfor(int i = 0;i < 3;i++ ) {\n\t\t\tif(!ans[i]) {\n\t\t\t\tSystem.out.println(i+1);\n\t\t\t}\n\t\t}\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1577066511, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02829.html", "problem_id": "p02829", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02829/input.txt", "sample_output_relpath": "derived/input_output/data/p02829/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02829/Java/s288980955.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s288980955", "user_id": "u517219904"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tint A = scn.nextInt(), B = scn.nextInt();\n\t\tboolean[] ans = new boolean[3];\n\t\tans[A-1] = true;\n\t\tans[B-1] = true;\n\t\tfor(int i = 0;i < 3;i++ ) {\n\t\t\tif(!ans[i]) {\n\t\t\t\tSystem.out.println(i+1);\n\t\t\t}\n\t\t}\n\n\t}\n\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "sample_input": "3\n1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02829", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 338, "cpu_time_ms": 113, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s497777294", "group_id": "codeNet:p02831", "input_text": "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n long m = in.nextLong();\n long n = in.nextLong();\n System.out.println(lcm(m,n));\n }\n private static long gcd(long m, long n) {\n if(m < n) return gcd(n, m);\n if(n == 0) return m;\n return gcd(n, m % n);\n }\n private static long lcm(long m, long n) {\n return m * n / gcd(m, n);\n }\n}", "language": "Java", "metadata": {"date": 1583198547, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02831.html", "problem_id": "p02831", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02831/input.txt", "sample_output_relpath": "derived/input_output/data/p02831/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02831/Java/s497777294.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s497777294", "user_id": "u155138322"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n long m = in.nextLong();\n long n = in.nextLong();\n System.out.println(lcm(m,n));\n }\n private static long gcd(long m, long n) {\n if(m < n) return gcd(n, m);\n if(n == 0) return m;\n return gcd(n, m % n);\n }\n private static long lcm(long m, long n) {\n return m * n / gcd(m, n);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "sample_input": "2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02831", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 466, "cpu_time_ms": 94, "memory_kb": 23892}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s214206217", "group_id": "codeNet:p02831", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n C solver = new C();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class C {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n // 整数の入力\n long a = Long.parseLong(in.next());\n long b = Long.parseLong(in.next());\n long ans = 0;\n\n ans = lcm(a, b);\n\n // 出力\n out.println(ans);\n\n }\n\n static long lcm(long a, long b) {\n long temp;\n long c = a;\n c *= b;\n while ((temp = a % b) != 0) {\n a = b;\n b = temp;\n }\n return (long) (c / b);\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1577067149, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02831.html", "problem_id": "p02831", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02831/input.txt", "sample_output_relpath": "derived/input_output/data/p02831/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02831/Java/s214206217.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s214206217", "user_id": "u178586376"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n C solver = new C();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class C {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n // 整数の入力\n long a = Long.parseLong(in.next());\n long b = Long.parseLong(in.next());\n long ans = 0;\n\n ans = lcm(a, b);\n\n // 出力\n out.println(ans);\n\n }\n\n static long lcm(long a, long b) {\n long temp;\n long c = a;\n c *= b;\n while ((temp = a % b) != 0) {\n a = b;\n b = temp;\n }\n return (long) (c / b);\n }\n\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "sample_input": "2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02831", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1175, "cpu_time_ms": 92, "memory_kb": 23252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s956302522", "group_id": "codeNet:p02831", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.lang.reflect.Array;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.Map.Entry;\nimport java.util.NoSuchElementException;\nimport java.util.Set;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\npublic class Main {\n\tprivate static void solve() {\n\t\tlong a = ni();\n\t\tlong b = ni();\n\t\tout(a * b / Alg.gcd(a, b));\n\t}\n\n\tstatic int min(int a, int b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic long min(long a, long b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic > A min(A a, A b) {\n\t\treturn a.compareTo(b) < 0 ? a : b;\n\t}\n\n\tstatic int max(int a, int b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic long max(long a, long b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic > A max(A a, A b) {\n\t\treturn a.compareTo(b) > 0 ? a : b;\n\t}\n\n\tstatic int clamp(int a, int min, int max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic long clamp(long a, long min, long max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic int abs(int a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic long abs(long a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic > A clamp(A a, A min, A max) {\n\t\treturn a.compareTo(min) < 0 ? min : a.compareTo(max) > 0 ? max : a;\n\t}\n\n\tstatic void out(String val) {\n\t\tIO.out(val);\n\t}\n\n\tstatic void out(Object val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(int val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(long val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(char val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(double val) {\n\t\tIO.out(Double.isFinite(val) ? BigDecimal.valueOf(val).toPlainString() : String.valueOf(val));\n\t}\n\n\tstatic void out(boolean val) {\n\t\tIO.out(val ? \"true\" : \"false\");\n\t}\n\n\tstatic void outn(String val) {\n\t\tIO.outn(val);\n\t}\n\n\tstatic void outn(Object val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(int val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(long val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(char val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(double val) {\n\t\tIO.outn(Double.isFinite(val) ? BigDecimal.valueOf(val).toPlainString() : String.valueOf(val));\n\t}\n\n\tstatic void outn(boolean val) {\n\t\tIO.outn(val ? \"true\" : \"false\");\n\t}\n\n\tstatic void kil(String val) {\n\t\tIO.out(val);\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(Object val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(int val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(long val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(char val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(double val) {\n\t\tIO.out(Double.isFinite(val) ? BigDecimal.valueOf(val).toPlainString() : String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(boolean val) {\n\t\tIO.out(val ? \"true\" : \"false\");\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic String ns() {\n\t\treturn IO.next();\n\t}\n\n\tstatic int ni() {\n\t\treturn IO.nextInt();\n\t}\n\n\tstatic long nl() {\n\t\treturn IO.nextLong();\n\t}\n\n\tstatic double nd() {\n\t\treturn IO.nextDouble();\n\t}\n\n\tstatic char nc() {\n\t\treturn IO.nextChar();\n\t}\n\n\tstatic String[] nss(int n) {\n\t\tString[] as = new String[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.next();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic int[] nis(int n) {\n\t\tint[] as = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextInt();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic long[] nls(int n) {\n\t\tlong[] as = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextLong();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic double[] nds(int n) {\n\t\tdouble[] as = new double[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextDouble();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic char[] ncs(int n) {\n\t\tchar[] as = new char[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextChar();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic String[][] nss2(int n, int m) {\n\t\tString[][] as = new String[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.next();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic int[][] nis2(int n, int m) {\n\t\tint[][] as = new int[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextInt();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic long[][] nls2(int n, int m) {\n\t\tlong[][] as = new long[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextLong();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic double[][] nds2(int n, int m) {\n\t\tdouble[][] as = new double[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextDouble();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic char[][] ncs2(int n, int m) {\n\t\tchar[][] as = new char[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextChar();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic int parseInt(String val) {\n\t\treturn Integer.parseInt(val);\n\t}\n\n\tstatic long parseLong(String val) {\n\t\treturn Long.parseLong(val);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tsolve();\n\t\t\tIO.flush();\n\t\t} catch (NumberFormatException e) {\n\t\t\te.printStackTrace();\n\t\t} catch (OutOfMemoryError e) {\n\t\t\te.printStackTrace(); // this will be detected as RE\n\t\t}\n\t}\n}\n\nfinal class IO {\n\tprivate static final InputStream in = System.in;\n\tprivate static final PrintWriter out = new PrintWriter(System.out, false);\n\tprivate static final byte[] buffer = new byte[1024];\n\tprivate static int ptr = 0;\n\tprivate static int len = 0;\n\n\tprivate static boolean hasNextByte() {\n\t\tif (ptr < len)\n\t\t\treturn true;\n\t\tptr = 0;\n\t\ttry {\n\t\t\tlen = in.read(buffer);\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn len > 0;\n\t}\n\n\tprivate static int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tstatic boolean hasNext() {\n\t\tbyte c;\n\t\twhile (hasNextByte() && ((c = buffer[ptr]) < '!' || c > '~'))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tstatic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (b >= '!' && b <= '~') {\n\t\t\tsb.append((char) b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tstatic char nextChar() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\treturn (char) readByte();\n\t}\n\n\tstatic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tint sign = 1;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tsign = -1;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b)\n\t\t\tthrow new NumberFormatException();\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9')\n\t\t\t\tn = n * 10 + b - '0';\n\t\t\telse if (b == -1 || b < '!' || b > '~')\n\t\t\t\treturn n * sign;\n\t\t\telse\n\t\t\t\tthrow new NumberFormatException();\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tstatic int nextInt() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tint n = 0;\n\t\tint sign = 1;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tsign = -1;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b)\n\t\t\tthrow new NumberFormatException();\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9')\n\t\t\t\tn = n * 10 + b - '0';\n\t\t\telse if (b == -1 || b < '!' || b > '~')\n\t\t\t\treturn n * sign;\n\t\t\telse\n\t\t\t\tthrow new NumberFormatException();\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tstatic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tstatic void out(String val) {\n\t\tout.println(val);\n\t}\n\n\tstatic void outn(String val) {\n\t\tout.print(val);\n\t}\n\n\tstatic void flush() {\n\t\tout.flush();\n\t}\n}\n\n// TODO: paste library here\n\nclass MS {\n\tprivate TreeMap tm;\n\n\tMS() {\n\t\ttm = new TreeMap();\n\t}\n\n\tMS(Comparator comp) {\n\t\ttm = new TreeMap(comp);\n\t}\n\n\tvoid add(A a, long num) {\n\t\tif (tm.containsKey(a))\n\t\t\ttm.put(a, tm.get(a) + num);\n\t\telse\n\t\t\ttm.put(a, num);\n\t}\n\n\tvoid add(A a) {\n\t\tadd(a, 1);\n\t}\n\n\tlong remove(A a, long num) {\n\t\tif (tm.containsKey(a)) {\n\t\t\tlong n = tm.get(a);\n\t\t\tif (n <= num) {\n\t\t\t\ttm.remove(a);\n\t\t\t\treturn n;\n\t\t\t}\n\t\t\ttm.put(a, n - num);\n\t\t\treturn num;\n\t\t}\n\t\treturn 0;\n\t}\n\n\tboolean remove(A a) {\n\t\treturn remove(a, 1) == 1;\n\t}\n\n\tlong removeAll(A a) {\n\t\treturn remove(a, Long.MAX_VALUE);\n\t}\n\n\tlong num(A a) {\n\t\treturn tm.containsKey(a) ? tm.get(a) : 0;\n\t}\n\n\tint size() {\n\t\treturn tm.size();\n\t}\n\n\tA floor(A a) {\n\t\treturn tm.floorKey(a);\n\t}\n\n\tUP floorNum(A a) {\n\t\tEntry e = tm.floorEntry(a);\n\t\treturn e == null ? null : UP.make(e.getKey(), e.getValue());\n\t}\n\n\tA ceil(A a) {\n\t\treturn tm.ceilingKey(a);\n\t}\n\n\tUP ceilNum(A a) {\n\t\tEntry e = tm.ceilingEntry(a);\n\t\treturn e == null ? null : UP.make(e.getKey(), e.getValue());\n\t}\n\n\tvoid clear() {\n\t\ttm.clear();\n\t}\n\n\tSet keySet() {\n\t\treturn tm.keySet();\n\t}\n\n\tCollection valueSet() {\n\t\treturn tm.values();\n\t}\n\n\tSet> entrySet() {\n\t\treturn tm.entrySet();\n\t}\n\n\tpublic String toString() {\n\t\treturn tm.toString();\n\t}\n}\n\nclass WUF { // Weighted Union Find Tree\n\tprivate int[] parents;\n\tprivate int[] ranks;\n\tprivate ArrayList roots;\n\tprivate ArrayList weights;\n\tprivate F.XXX merger;\n\tprivate F.XXX add;\n\tprivate F.XX inv;\n\tprivate W e;\n\n\tWUF(int n, F.IX maker, F.XXX merger, F.XXX add, F.XX inv, W e) {\n\t\tthis.merger = merger;\n\t\tthis.add = add;\n\t\tthis.inv = inv;\n\t\tthis.e = e;\n\t\tparents = new int[n];\n\t\tranks = new int[n];\n\t\troots = U.make(n, maker);\n\t\tweights = U.make(n, i -> e);\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tparents[i] = i;\n\t\t}\n\t}\n\n\tint index(int i) {\n\t\tint p = parents[i];\n\t\tif (i == p) {\n\t\t\treturn i;\n\t\t}\n\t\tint r = index(p);\n\t\tweights.set(i, add.f(weights.get(i), weights.get(p)));\n\t\treturn parents[i] = r;\n\t}\n\n\tboolean same(int i, int j) {\n\t\treturn index(i) == index(j);\n\t}\n\n\tA root(int i) {\n\t\treturn roots.get(index(i));\n\t}\n\n\tW weight(int i) {\n\t\tindex(i);\n\t\treturn weights.get(i);\n\t}\n\n\tW diff(int i, int j) {\n\t\treturn sub(weight(j), weight(i));\n\t}\n\n\tvoid unite(int i, int j, W w) {\n\t\tw = add(w, weight(i));\n\t\tw = sub(w, weight(j));\n\t\ti = index(i);\n\t\tj = index(j);\n\t\tif (i == j)\n\t\t\treturn;\n\t\tA r = merger.f(root(i), root(j));\n\t\tif (ranks[i] < ranks[j]) {\n\t\t\ti ^= j;\n\t\t\tj ^= i;\n\t\t\ti ^= j;\n\t\t\tw = inv.f(w);\n\t\t}\n\t\tparents[j] = i;\n\t\troots.set(i, r);\n\t\tif (ranks[i] == ranks[j])\n\t\t\tranks[i]++;\n\t\tweights.set(j, w);\n\t}\n\n\tprivate W add(W a, W b) {\n\t\treturn a == e ? b : b == e ? a : add.f(a, b);\n\t}\n\n\tprivate W sub(W a, W b) {\n\t\treturn b == e ? a : add(a, inv.f(b));\n\t}\n}\n\nclass PQ { // Priority Queue\n\tstatic class E { // Entry\n\t\tprivate Object a;\n\t\tprivate int index;\n\n\t\tprivate E(Object a, int index) {\n\t\t\tthis.a = a;\n\t\t\tthis.index = index;\n\t\t}\n\t}\n\n\tprivate int n;\n\tprivate E[] as;\n\tprivate Comparator comp;\n\n\tPQ(Comparator comp) {\n\t\tthis.comp = comp;\n\t\tas = new E[64];\n\t\tn = 1;\n\t}\n\n\tE add(A a) {\n\t\tE res = addEntry(a);\n\t\tfixUp(n - 1);\n\t\treturn res;\n\t}\n\n\tA pop() {\n\t\tint max = n - 1;\n\t\tif (max == 0)\n\t\t\treturn null;\n\t\tif (max == 1) {\n\t\t\treturn removeLast();\n\t\t}\n\n\t\tE tmp = as[1];\n\t\tas[1] = as[max];\n\t\tas[max] = tmp;\n\t\tas[1].index = 1;\n\t\tas[max].index = max;\n\n\t\tA res = removeLast();\n\t\tfixDown(1);\n\t\treturn res;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tA get(E e) {\n\t\treturn (A) e.a;\n\t}\n\n\tvoid remove(E e) {\n\t\tint k = ((E) e).index;\n\t\tint max = n - 1;\n\t\tif (k == max) {\n\t\t\tremoveLast();\n\t\t\treturn;\n\t\t}\n\n\t\tE tmp = as[k];\n\t\tas[k] = as[max];\n\t\tas[max] = tmp;\n\t\tas[k].index = k;\n\t\tas[max].index = max;\n\n\t\tremoveLast();\n\t\tif (!fixDown(k))\n\t\t\tfixUp(k);\n\t}\n\n\tvoid update(E e, A a) {\n\t\tint k = e.index;\n\t\tas[k].a = a;\n\t\tif (!fixDown(k))\n\t\t\tfixUp(k);\n\t}\n\n\tboolean isEmpty() {\n\t\treturn n == 1;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate A removeLast() {\n\t\tn--;\n\t\tE res = as[n];\n\t\tres.index = -1;\n\t\tas[n] = null;\n\t\treturn (A) res.a;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate boolean fixUp(int k) {\n\t\tboolean res = false;\n\t\twhile (k > 1) {\n\t\t\tint nk = k >> 1;\n\t\t\tif (comp.compare((A) as[k].a, (A) as[nk].a) < 0) {\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[nk];\n\t\t\t\tas[nk] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[nk].index = nk;\n\t\t\t\tk = nk;\n\t\t\t\tres = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\treturn res;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate boolean fixDown(int k) {\n\t\tboolean res = false;\n\t\twhile (k << 1 < n) {\n\t\t\tA a = (A) as[k].a;\n\t\t\tA l = (A) as[k << 1].a;\n\t\t\tif (k << 1 == n - 1) {\n\t\t\t\tif (comp.compare(a, l) <= 0)\n\t\t\t\t\tbreak;\n\t\t\t\tres = true;\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[k << 1];\n\t\t\t\tas[k << 1] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[k << 1].index = k << 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tA r = (A) as[k << 1 | 1].a;\n\t\t\tif (comp.compare(a, l) <= 0 && comp.compare(a, r) <= 0)\n\t\t\t\tbreak;\n\t\t\tres = true;\n\t\t\tif (comp.compare(l, r) < 0) {\n\t\t\t\tint nk = k << 1;\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[nk];\n\t\t\t\tas[nk] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[nk].index = nk;\n\t\t\t\tk = nk;\n\t\t\t} else {\n\t\t\t\tint nk = k << 1 | 1;\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[nk];\n\t\t\t\tas[nk] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[nk].index = nk;\n\t\t\t\tk = nk;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tprivate E addEntry(A a) {\n\t\tif (n == as.length)\n\t\t\tas = U.doubleSize(as);\n\t\treturn as[n] = new E(a, n++);\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tpublic String toString() {\n\t\tif (n == 1)\n\t\t\treturn \"[]\";\n\t\tString s = null;\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tA a = (A) as[i].a;\n\t\t\tif (s == null)\n\t\t\t\ts = \"[\" + a;\n\t\t\telse\n\t\t\t\ts += \", \" + a;\n\t\t}\n\t\treturn s + \"]\";\n\t}\n}\n\nclass G { // Graph\n\tprivate int vSize;\n\tprivate Object[] vs; // V\n\tprivate int numEdges;\n\tprivate Object[] allEdges; // UT\n\tprivate Object[] esFrom; // EdgeSet\n\tprivate Object[] esTo; // EdgeSet\n\tprivate Integer[] ints;\n\n\tprivate class EdgeSet {\n//\t\tHashMap map;\n\t\tInteger[] is;\n\t\tObject[] es;\n\t\tint size;\n\n\t\tEdgeSet() {\n\t\t\tis = new Integer[2];\n\t\t\tes = new Object[2];\n\t\t\tsize = 0;\n\t\t}\n\n//\t\t@SuppressWarnings(\"unchecked\")\n\t\tvoid add(Integer i, E e) {\n//\t\t\tif (size > 1600000) {\n//\t\t\t\tmap.put(i, e);\n//\t\t\t\tsize++;\n//\t\t\t\treturn;\n//\t\t\t}\n\t\t\tif (size == is.length) {\n\t\t\t\tis = Arrays.copyOf(is, size << 1);\n\t\t\t\tes = Arrays.copyOf(es, size << 1);\n\t\t\t}\n\t\t\tis[size] = i;\n\t\t\tes[size] = e;\n//\t\t\tif (++size > 1600000) {\n//\t\t\t\tmap = new HashMap();\n//\t\t\t\tfor (int j = 0; j < size; j++) {\n//\t\t\t\t\tmap.put(is[j], (E) es[j]);\n//\t\t\t\t}\n//\t\t\t\tis = null;\n//\t\t\t\tes = null;\n//\t\t\t}\n\t\t}\n\n\t\t@SuppressWarnings(\"unchecked\")\n\t\tvoid iter(F.IXV f) {\n//\t\t\tif (map == null)\n\t\t\tfor (int i = 0; i < size; i++)\n\t\t\t\tf.f(is[i], (E) es[i]);\n//\t\t\telse\n//\t\t\t\tfor (Entry e : map.entrySet())\n//\t\t\t\t\tf.f(e.getKey(), e.getValue());\n\t\t}\n\t}\n\n\tG() {\n\t\tvs = new Object[64];\n\t\tallEdges = new Object[64];\n\t\tesFrom = new Object[64];\n\t\tesTo = new Object[64];\n\t\tints = new Integer[64];\n\t\tvSize = 0;\n\t\tnumEdges = 0;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tV getV(int i) {\n\t\treturn i < 0 || i >= vs.length ? null : (V) vs[i];\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tArrayList getSortedVs() {\n\t\tArrayList res = new ArrayList();\n\t\tfor (int i = 0; i < vs.length; i++) {\n\t\t\tif (vs[i] != null)\n\t\t\t\tres.add((V) vs[i]);\n\t\t}\n\t\treturn res;\n\t}\n\n\tvoid addV(int i, V v) {\n\t\tif (getV(i) != null)\n\t\t\tthrow new RuntimeException(\"duplicate vtx: \" + i);\n\t\twhile (vs.length <= i) {\n\t\t\tvs = U.doubleSize(vs);\n\t\t\tints = U.doubleSize(ints);\n\t\t\tesFrom = U.doubleSize(esFrom);\n\t\t\tesTo = U.doubleSize(esTo);\n\t\t}\n\t\tvSize = U.max(vSize, i + 1);\n\t\tvs[i] = v;\n\t\tints[i] = Integer.valueOf(i);\n\t\tesFrom[i] = new EdgeSet();\n\t\tesTo[i] = new EdgeSet();\n\t}\n\n\tvoid setV(int i, V v) {\n\t\tif (getV(i) == null)\n\t\t\tthrow new RuntimeException(\"no such vtx: \" + i);\n\t\tvs[i] = v;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tvoid addE(int from, int to, E e) {\n\t\t((EdgeSet) esFrom[from]).add(ints[to], e);\n\t\t((EdgeSet) esTo[to]).add(ints[from], e);\n\t\tif (numEdges == allEdges.length) {\n\t\t\tallEdges = U.doubleSize(allEdges);\n\t\t}\n\t\tallEdges[numEdges++] = UT.make(from, to, e);\n\t}\n\n\tvoid addUE(int i, int j, E e) {\n\t\taddE(i, j, e);\n\t\taddE(j, i, e);\n\t}\n\n\t void dfs(int firstIdx, State firstS, F.XXXXX nextState,\n\t\t\tF.XXXV> visit) {\n\t\tArrayDeque> deque = new ArrayDeque>();\n\t\tsearch(firstIdx, firstS, nextState, visit, deque::push, deque::pop, deque::isEmpty);\n\t}\n\n\t void bfs(int firstIdx, State firstS, F.XXXXX nextState,\n\t\t\tF.XXXV> visit) {\n\t\tArrayDeque> deque = new ArrayDeque>();\n\t\tsearch(firstIdx, firstS, nextState, visit, deque::addLast, deque::pollFirst, deque::isEmpty);\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tArrayList> getEs() {\n\t\tArrayList> res = new ArrayList>();\n\t\tfor (int i = 0; i < numEdges; i++) {\n\t\t\tres.add((UT) allEdges[i]);\n\t\t}\n\t\treturn res;\n\t}\n\n\t/**\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t */\n\tArrayList> dijkstraL(int from, F.XL getWeight) {\n\t\treturn dijkstra(from, e -> getWeight.f(e), (a, b) -> a + b, Long::compare, 0l, Long.MAX_VALUE);\n\t}\n\n\t/**\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t */\n\t@SuppressWarnings(\"unchecked\")\n\t ArrayList> dijkstra(int from, F.XX getWeight, F.XXX add, Comparator comp,\n\t\t\tA zero, A inf) {\n\t\tint n = vSize;\n\t\tArrayList> res = U.make(n, i -> getV(i) == null ? null : UP.make(i == from ? zero : inf, -1));\n\t\tPQ> q = new PQ>((i, j) -> comp.compare(i.b, j.b));\n\n\t\tPQ.E[] qes = new PQ.E[n];\n\t\tArrayList> ups = new ArrayList>();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tups.add(UP.make(i, inf));\n\t\t}\n\n\t\tboolean[] fixed = new boolean[n];\n\t\tups.get(from).b = zero;\n\t\tqes[from] = q.add(ups.get(from));\n\n\t\twhile (!q.isEmpty()) {\n\t\t\tUP up = q.pop();\n\t\t\tInteger i = up.a;\n\t\t\tif (fixed[i])\n\t\t\t\tcontinue;\n\t\t\tfixed[i] = true;\n\t\t\tA dist = up.b;\n\t\t\tif (dist == inf)\n\t\t\t\tbreak;\n\t\t\t((EdgeSet) esFrom[i]).iter((j, e) -> {\n\t\t\t\tif (fixed[j])\n\t\t\t\t\treturn;\n\t\t\t\tUP resj = res.get(j);\n\t\t\t\tA newDist = add.f(dist, getWeight.f(e));\n\t\t\t\tif (comp.compare(resj.a, newDist) > 0) {\n\t\t\t\t\tresj.a = newDist;\n\t\t\t\t\tresj.b = i;\n\n\t\t\t\t\tq.add(UP.make(j, newDist));\n\n//\t\t\t\t\tUP upj = ups.get(j);\n//\t\t\t\t\tupj.b = newDist;\n//\t\t\t\t\tif (qes[j] == null)\n//\t\t\t\t\t\tqes[j] = q.add(upj);\n//\t\t\t\t\telse\n//\t\t\t\t\t\tq.update(qes[j], upj);\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t\treturn res;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate void search(int firstIdx, State firstS, F.XXXXX nextState,\n\t\t\tF.XXXV> visit, F.XV> push,\n\t\t\tF.VX> pop, F.VX isEmpty) {\n\t\tboolean[] visited = new boolean[vSize];\n\t\tArrayList movedTo = new ArrayList();\n\t\tpush.f(UP.make(firstS, firstIdx));\n\t\tvisited[firstIdx] = true;\n\t\twhile (!isEmpty.f()) {\n\t\t\tUP si = pop.f();\n\t\t\tState s = (State) si.a;\n\t\t\tInteger i = si.b;\n\t\t\tmovedTo.clear();\n\t\t\t((EdgeSet) esFrom[i]).iter((j, e) -> {\n\t\t\t\tif (visited[j])\n\t\t\t\t\treturn;\n\t\t\t\tState ns = nextState.f(s, i, j, e);\n\t\t\t\tif (ns != null) {\n\t\t\t\t\tmovedTo.add(j);\n\t\t\t\t\tpush.f(P.make(ns, j));\n\t\t\t\t\tvisited[j] = true;\n\t\t\t\t}\n\t\t\t});\n\t\t\tvisit.f(s, i, movedTo);\n\t\t}\n\t}\n}\n\nclass UP { // Unordered Pair\n\tA a;\n\tB b;\n\n\tUP(A a, B b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tstatic UP make(A a, B b) {\n\t\treturn new UP(a, b);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof UP))\n\t\t\treturn false;\n\t\tUP p = (UP) o;\n\t\tboolean aok = a == null ? p.a == null : a.equals(p.a);\n\t\tboolean bok = b == null ? p.b == null : b.equals(p.b);\n\t\treturn aok && bok;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a.toString() + \", \" + b.toString() + \")\";\n\t}\n}\n\nclass P, B extends Comparable> extends UP\n\t\timplements Comparable> { // Pair\n\tP(A a, B b) {\n\t\tsuper(a, b);\n\t}\n\n\tstatic , B extends Comparable> P make(A a, B b) {\n\t\treturn new P(a, b);\n\t}\n\n\tpublic int compareTo(P o) {\n\t\tint sa = a.compareTo(o.a);\n\t\tint sb = b.compareTo(o.b);\n\t\treturn sa != 0 ? sa : sb;\n\t}\n}\n\nclass PI implements Comparable { // Pair int\n\tint a;\n\tint b;\n\n\tPI(int a, int b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tstatic PI make(int a, int b) {\n\t\treturn new PI(a, b);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof PI))\n\t\t\treturn false;\n\t\tPI p = (PI) o;\n\t\treturn a == p.a && b == p.b;\n\t}\n\n\tpublic int compareTo(PI o) {\n\t\tint sa = a - o.a;\n\t\tint sb = b - o.b;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \")\";\n\t}\n}\n\nclass PL implements Comparable { // Pair long\n\tlong a;\n\tlong b;\n\n\tPL(long a, long b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tstatic PL make(long a, long b) {\n\t\treturn new PL(a, b);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof PL))\n\t\t\treturn false;\n\t\tPL p = (PL) o;\n\t\treturn a == p.a && b == p.b;\n\t}\n\n\tpublic int compareTo(PL o) {\n\t\tlong sa = a - o.a;\n\t\tlong sb = b - o.b;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \")\";\n\t}\n}\n\nclass UT { // Unordered Tuple\n\tA a;\n\tB b;\n\tC c;\n\n\tUT(A a, B b, C c) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t\tthis.c = c;\n\t}\n\n\tstatic UT make(A a, B b, C c) {\n\t\treturn new UT(a, b, c);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof UT))\n\t\t\treturn false;\n\t\tUT t = (UT) o;\n\t\tboolean aok = a == null ? t.a == null : a.equals(t.a);\n\t\tboolean bok = b == null ? t.b == null : b.equals(t.b);\n\t\tboolean cok = c == null ? t.c == null : c.equals(t.c);\n\t\treturn aok && bok && cok;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a.toString() + \", \" + b.toString() + \", \" + c.toString() + \")\";\n\t}\n}\n\nclass T, B extends Comparable, C extends Comparable>\n\t\textends UT implements Comparable> { // Tuple\n\tT(A a, B b, C c) {\n\t\tsuper(a, b, c);\n\t}\n\n\tstatic , B extends Comparable, C extends Comparable> T make(\n\t\t\tA a, B b, C c) {\n\t\treturn new T(a, b, c);\n\t}\n\n\tpublic int compareTo(T o) {\n\t\tint sa = a.compareTo(o.a);\n\t\tint sb = b.compareTo(o.b);\n\t\tint sc = c.compareTo(o.c);\n\t\treturn sa != 0 ? sa : sb != 0 ? sb : sc;\n\t}\n}\n\nclass TI implements Comparable { // Tuple int\n\tint a;\n\tint b;\n\tint c;\n\n\tTI(int a, int b, int c) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t\tthis.c = c;\n\t}\n\n\tstatic TI make(int a, int b, int c) {\n\t\treturn new TI(a, b, c);\n\t}\n\n\tTL toLong() {\n\t\treturn TL.make(a, b, c);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof TI))\n\t\t\treturn false;\n\t\tTI t = (TI) o;\n\t\treturn a == t.a && b == t.b && c == t.c;\n\t}\n\n\tpublic int compareTo(TI o) {\n\t\tint sa = a - o.a;\n\t\tint sb = b - o.b;\n\t\tint sc = c - o.c;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : sc > 0 ? 1 : sc < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \", \" + c + \")\";\n\t}\n}\n\nclass TL implements Comparable { // Tuple long\n\tlong a;\n\tlong b;\n\tlong c;\n\n\tTL(long a, long b, long c) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t\tthis.c = c;\n\t}\n\n\tstatic TL make(long a, long b, long c) {\n\t\treturn new TL(a, b, c);\n\t}\n\n\tTI toInt() {\n\t\treturn TI.make((int) a, (int) b, (int) c);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof TL))\n\t\t\treturn false;\n\t\tTL t = (TL) o;\n\t\treturn a == t.a && b == t.b && c == t.c;\n\t}\n\n\tpublic int compareTo(TL o) {\n\t\tlong sa = a - o.a;\n\t\tlong sb = b - o.b;\n\t\tlong sc = c - o.c;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : sc > 0 ? 1 : sc < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \", \" + c + \")\";\n\t}\n}\n\nfinal class U { // Utilities\n\tprivate U() {\n\t}\n\n\tstatic ArrayList make(int n, F.IX maker) {\n\t\tArrayList res = new ArrayList();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres.add(maker.f(i));\n\t\treturn res;\n\t}\n\n\tstatic boolean[] makeB(int n, F.IB maker) {\n\t\tboolean[] res = new boolean[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic int[] makeI(int n, F.II maker) {\n\t\tint[] res = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic long[] makeL(int n, F.IL maker) {\n\t\tlong[] res = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic A[] makeX(int n, F.IX maker, A[] as) {\n\t\tA[] res = Arrays.copyOf(as, n);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic ArrayList filter(ArrayList as, F.XB pred) {\n\t\tArrayList res = new ArrayList();\n\t\tfor (A a : as)\n\t\t\tif (pred.f(a))\n\t\t\t\tres.add(a);\n\t\treturn res;\n\t}\n\n\tstatic int count(ArrayList as, F.XB pred) {\n\t\tint res = 0;\n\t\tfor (A a : as)\n\t\t\tif (pred.f(a))\n\t\t\t\tres++;\n\t\treturn res;\n\t}\n\n\tstatic ArrayList concat(ArrayList as, ArrayList bs) {\n\t\tArrayList res = new ArrayList();\n\t\tres.addAll(as);\n\t\tres.addAll(bs);\n\t\treturn res;\n\t}\n\n\tstatic boolean any(ArrayList as, F.XB pred) {\n\t\tfor (A a : as)\n\t\t\tif (pred.f(a))\n\t\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tstatic boolean all(ArrayList as, F.XB pred) {\n\t\tfor (A a : as)\n\t\t\tif (!pred.f(a))\n\t\t\t\treturn false;\n\t\treturn true;\n\t}\n\n\tstatic ArrayList flatten(ArrayList> ass) {\n\t\tArrayList res = new ArrayList();\n\t\tfor (ArrayList as : ass)\n\t\t\tres.addAll(as);\n\t\treturn res;\n\t}\n\n\tstatic B foldl(ArrayList as, F.XXX f, B e) {\n\t\tB res = e;\n\t\tfor (A a : as)\n\t\t\tres = f.f(res, a);\n\t\treturn res;\n\t}\n\n\tstatic B foldr(ArrayList as, F.XXX f, B e) {\n\t\tB res = e;\n\t\tfor (int i = as.size() - 1; i >= 0; i--)\n\t\t\tres = f.f(as.get(i), res);\n\t\treturn res;\n\t}\n\n\tstatic ArrayList reverse(ArrayList as) {\n\t\tint size = as.size();\n\t\treturn make(size, i -> as.get(size - 1 - i));\n\t}\n\n\tstatic boolean[] reverse(boolean[] as) {\n\t\tint size = as.length;\n\t\treturn makeB(size, i -> as[size - 1 - i]);\n\t}\n\n\tstatic int[] reverse(int[] as) {\n\t\tint size = as.length;\n\t\treturn makeI(size, i -> as[size - 1 - i]);\n\t}\n\n\tstatic long[] reverse(long[] as) {\n\t\tint size = as.length;\n\t\treturn makeL(size, i -> as[size - 1 - i]);\n\t}\n\n\tstatic A[] reverse(A[] as) {\n\t\tint size = as.length;\n\t\treturn makeX(size, i -> as[size - 1 - i], as);\n\t}\n\n\tstatic > UP, ArrayList> compress(ArrayList as) {\n\t\tTreeSet set = new TreeSet(as);\n\t\tTreeMap map = new TreeMap();\n\t\tArrayList imap = new ArrayList();\n\t\tint i = 0;\n\t\tfor (A a : set) {\n\t\t\tmap.put(a, i++);\n\t\t\timap.add(a);\n\t\t}\n\t\treturn UP.make(map, imap);\n\t}\n\n\tstatic ArrayList map(ArrayList as, F.XX f) {\n\t\treturn make(as.size(), (i) -> f.f(as.get(i)));\n\t}\n\n\tstatic ArrayList mapi(ArrayList as, F.XIX f) {\n\t\treturn make(as.size(), (i) -> f.f(as.get(i), i));\n\t}\n\n\tstatic ArrayList> zip(ArrayList as, ArrayList bs) {\n\t\treturn make(min(as.size(), bs.size()), (i) -> UP.make(as.get(i), bs.get(i)));\n\t}\n\n\tstatic int min(int a, int b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic long min(long a, long b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic > A min(A a, A b) {\n\t\treturn a.compareTo(b) < 0 ? a : b;\n\t}\n\n\tstatic int max(int a, int b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic long max(long a, long b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic > A max(A a, A b) {\n\t\treturn a.compareTo(b) > 0 ? a : b;\n\t}\n\n\tstatic int clamp(int a, int min, int max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic long clamp(long a, long min, long max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic > A clamp(A a, A min, A max) {\n\t\treturn a.compareTo(min) < 0 ? min : a.compareTo(max) > 0 ? max : a;\n\t}\n\n\tstatic int abs(int a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic long abs(long a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic void forEachBitPerm(int n, int k, F.IV f) {\n\t\tfor (int i = (1 << k) - 1; i < 1 << n;) {\n\t\t\tf.f(i);\n\t\t\tint t = (i | i - 1) + 1;\n\t\t\ti = t | ((t & -t) / (i & -i) >> 1) - 1;\n\t\t}\n\t}\n\n\tstatic int nextBitPerm(int a) {\n\t\tint t = (a | a - 1) + 1;\n\t\treturn t | ((t & -t) / (a & -a) >> 1) - 1;\n\t}\n\n\tstatic void mebius(int n, F.IIV f) { // s, i\n\t\tint bit = 1;\n\t\tint exp = 0;\n\t\tfor (int i = 1; i < 1 << n; i++) {\n\t\t\tf.f(i ^ bit, exp);\n\t\t\tif ((i & i + 1) == 0) {\n\t\t\t\tbit <<= 1;\n\t\t\t\texp++;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic void zeta(int n, F.IIV f) { // s, i\n\t\tint m = (1 << n) - 1;\n\t\tint bit = 1;\n\t\tint exp = 0;\n\t\tfor (int i = (1 << n) - 2; i >= 0; i--) {\n\t\t\tf.f(i ^ bit, exp);\n\t\t\tif ((~i & ~i + 1 & m) == 0) {\n\t\t\t\tbit <<= 1;\n\t\t\t\texp++;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic ArrayList toAL(A[] as) {\n\t\treturn make(as.length, i -> as[i]);\n\t}\n\n\tstatic A[] doubleSize(A[] as) {\n\t\treturn Arrays.copyOf(as, as.length << 1);\n\t}\n\n\tstatic long searchL(long ng, long ok, F.LB isOk) {\n\t\twhile (ng - ok > 1 || ok - ng > 1) {\n\t\t\tlong mid = ng + ok >> 1;\n\t\t\tif (isOk.f(mid))\n\t\t\t\tok = mid;\n\t\t\telse\n\t\t\t\tng = mid;\n\t\t}\n\t\treturn ok;\n\t}\n\n\tstatic int searchI(int ng, int ok, F.IB isOk) {\n\t\treturn (int) searchL((long) ng, (long) ok, (mid) -> isOk.f((int) mid));\n\t}\n}\n\nfinal class F { // Functions\n\tprivate F() {\n\t}\n\n\tinterface VV {\n\t\tvoid f();\n\t}\n\n\tinterface BV {\n\t\tvoid f(boolean a);\n\t}\n\n\tinterface BXV {\n\t\tvoid f(boolean a, A b);\n\t}\n\n\tinterface BXXV {\n\t\tvoid f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXV {\n\t\tvoid f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBV {\n\t\tvoid f(A a, boolean b);\n\t}\n\n\tinterface XXBV {\n\t\tvoid f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBV {\n\t\tvoid f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IV {\n\t\tvoid f(int a);\n\t}\n\n\tinterface IXV {\n\t\tvoid f(int a, A b);\n\t}\n\n\tinterface IXXV {\n\t\tvoid f(int a, A b, B c);\n\t}\n\n\tinterface IXXXV {\n\t\tvoid f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIV {\n\t\tvoid f(A a, int b);\n\t}\n\n\tinterface XXIV {\n\t\tvoid f(A a, B b, int c);\n\t}\n\n\tinterface XXXIV {\n\t\tvoid f(A a, B b, C c, int d);\n\t}\n\n\tinterface LV {\n\t\tvoid f(long a);\n\t}\n\n\tinterface LXV {\n\t\tvoid f(long a, A b);\n\t}\n\n\tinterface LXXV {\n\t\tvoid f(long a, A b, B c);\n\t}\n\n\tinterface LXXXV {\n\t\tvoid f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLV {\n\t\tvoid f(A a, long b);\n\t}\n\n\tinterface XXLV {\n\t\tvoid f(A a, B b, long c);\n\t}\n\n\tinterface XXXLV {\n\t\tvoid f(A a, B b, C c, long d);\n\t}\n\n\tinterface DV {\n\t\tvoid f(double a);\n\t}\n\n\tinterface DXV {\n\t\tvoid f(double a, A b);\n\t}\n\n\tinterface DXXV {\n\t\tvoid f(double a, A b, B c);\n\t}\n\n\tinterface DXXXV {\n\t\tvoid f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDV {\n\t\tvoid f(A a, double b);\n\t}\n\n\tinterface XXDV {\n\t\tvoid f(A a, B b, double c);\n\t}\n\n\tinterface XXXDV {\n\t\tvoid f(A a, B b, C c, double d);\n\t}\n\n\tinterface XV {\n\t\tvoid f(A a);\n\t}\n\n\tinterface XXV {\n\t\tvoid f(A a, B b);\n\t}\n\n\tinterface XXXV {\n\t\tvoid f(A a, B b, C c);\n\t}\n\n\tinterface XXXXV {\n\t\tvoid f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBV {\n\t\tvoid f(boolean a, boolean b);\n\t}\n\n\tinterface BIV {\n\t\tvoid f(boolean a, int b);\n\t}\n\n\tinterface BLV {\n\t\tvoid f(boolean a, long b);\n\t}\n\n\tinterface BDV {\n\t\tvoid f(boolean a, double b);\n\t}\n\n\tinterface IBV {\n\t\tvoid f(int a, boolean b);\n\t}\n\n\tinterface IIV {\n\t\tvoid f(int a, int b);\n\t}\n\n\tinterface ILV {\n\t\tvoid f(int a, long b);\n\t}\n\n\tinterface IDV {\n\t\tvoid f(int a, double b);\n\t}\n\n\tinterface LBV {\n\t\tvoid f(long a, boolean b);\n\t}\n\n\tinterface LIV {\n\t\tvoid f(long a, int b);\n\t}\n\n\tinterface LLV {\n\t\tvoid f(long a, long b);\n\t}\n\n\tinterface LDV {\n\t\tvoid f(long a, double b);\n\t}\n\n\tinterface DBV {\n\t\tvoid f(double a, boolean b);\n\t}\n\n\tinterface DIV {\n\t\tvoid f(double a, int b);\n\t}\n\n\tinterface DLV {\n\t\tvoid f(double a, long b);\n\t}\n\n\tinterface DDV {\n\t\tvoid f(double a, double b);\n\t}\n\n\tinterface VB {\n\t\tboolean f();\n\t}\n\n\tinterface BB {\n\t\tboolean f(boolean a);\n\t}\n\n\tinterface BXB {\n\t\tboolean f(boolean a, A b);\n\t}\n\n\tinterface BXXB {\n\t\tboolean f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXB {\n\t\tboolean f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBB {\n\t\tboolean f(A a, boolean b);\n\t}\n\n\tinterface XXBB {\n\t\tboolean f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBB {\n\t\tboolean f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IB {\n\t\tboolean f(int a);\n\t}\n\n\tinterface IXB {\n\t\tboolean f(int a, A b);\n\t}\n\n\tinterface IXXB {\n\t\tboolean f(int a, A b, B c);\n\t}\n\n\tinterface IXXXB {\n\t\tboolean f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIB {\n\t\tboolean f(A a, int b);\n\t}\n\n\tinterface XXIB {\n\t\tboolean f(A a, B b, int c);\n\t}\n\n\tinterface XXXIB {\n\t\tboolean f(A a, B b, C c, int d);\n\t}\n\n\tinterface LB {\n\t\tboolean f(long a);\n\t}\n\n\tinterface LXB {\n\t\tboolean f(long a, A b);\n\t}\n\n\tinterface LXXB {\n\t\tboolean f(long a, A b, B c);\n\t}\n\n\tinterface LXXXB {\n\t\tboolean f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLB {\n\t\tboolean f(A a, long b);\n\t}\n\n\tinterface XXLB {\n\t\tboolean f(A a, B b, long c);\n\t}\n\n\tinterface XXXLB {\n\t\tboolean f(A a, B b, C c, long d);\n\t}\n\n\tinterface DB {\n\t\tboolean f(double a);\n\t}\n\n\tinterface DXB {\n\t\tboolean f(double a, A b);\n\t}\n\n\tinterface DXXB {\n\t\tboolean f(double a, A b, B c);\n\t}\n\n\tinterface DXXXB {\n\t\tboolean f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDB {\n\t\tboolean f(A a, double b);\n\t}\n\n\tinterface XXDB {\n\t\tboolean f(A a, B b, double c);\n\t}\n\n\tinterface XXXDB {\n\t\tboolean f(A a, B b, C c, double d);\n\t}\n\n\tinterface XB {\n\t\tboolean f(A a);\n\t}\n\n\tinterface XXB {\n\t\tboolean f(A a, B b);\n\t}\n\n\tinterface XXXB {\n\t\tboolean f(A a, B b, C c);\n\t}\n\n\tinterface XXXXB {\n\t\tboolean f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBB {\n\t\tboolean f(boolean a, boolean b);\n\t}\n\n\tinterface BIB {\n\t\tboolean f(boolean a, int b);\n\t}\n\n\tinterface BLB {\n\t\tboolean f(boolean a, long b);\n\t}\n\n\tinterface BDB {\n\t\tboolean f(boolean a, double b);\n\t}\n\n\tinterface IBB {\n\t\tboolean f(int a, boolean b);\n\t}\n\n\tinterface IIB {\n\t\tboolean f(int a, int b);\n\t}\n\n\tinterface ILB {\n\t\tboolean f(int a, long b);\n\t}\n\n\tinterface IDB {\n\t\tboolean f(int a, double b);\n\t}\n\n\tinterface LBB {\n\t\tboolean f(long a, boolean b);\n\t}\n\n\tinterface LIB {\n\t\tboolean f(long a, int b);\n\t}\n\n\tinterface LLB {\n\t\tboolean f(long a, long b);\n\t}\n\n\tinterface LDB {\n\t\tboolean f(long a, double b);\n\t}\n\n\tinterface DBB {\n\t\tboolean f(double a, boolean b);\n\t}\n\n\tinterface DIB {\n\t\tboolean f(double a, int b);\n\t}\n\n\tinterface DLB {\n\t\tboolean f(double a, long b);\n\t}\n\n\tinterface DDB {\n\t\tboolean f(double a, double b);\n\t}\n\n\tinterface VI {\n\t\tint f();\n\t}\n\n\tinterface BI {\n\t\tint f(boolean a);\n\t}\n\n\tinterface BXI {\n\t\tint f(boolean a, A b);\n\t}\n\n\tinterface BXXI {\n\t\tint f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXI {\n\t\tint f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBI {\n\t\tint f(A a, boolean b);\n\t}\n\n\tinterface XXBI {\n\t\tint f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBI {\n\t\tint f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface II {\n\t\tint f(int a);\n\t}\n\n\tinterface IXI {\n\t\tint f(int a, A b);\n\t}\n\n\tinterface IXXI {\n\t\tint f(int a, A b, B c);\n\t}\n\n\tinterface IXXXI {\n\t\tint f(int a, A b, B c, C d);\n\t}\n\n\tinterface XII {\n\t\tint f(A a, int b);\n\t}\n\n\tinterface XXII {\n\t\tint f(A a, B b, int c);\n\t}\n\n\tinterface XXXII {\n\t\tint f(A a, B b, C c, int d);\n\t}\n\n\tinterface LI {\n\t\tint f(long a);\n\t}\n\n\tinterface LXI {\n\t\tint f(long a, A b);\n\t}\n\n\tinterface LXXI {\n\t\tint f(long a, A b, B c);\n\t}\n\n\tinterface LXXXI {\n\t\tint f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLI {\n\t\tint f(A a, long b);\n\t}\n\n\tinterface XXLI {\n\t\tint f(A a, B b, long c);\n\t}\n\n\tinterface XXXLI {\n\t\tint f(A a, B b, C c, long d);\n\t}\n\n\tinterface DI {\n\t\tint f(double a);\n\t}\n\n\tinterface DXI {\n\t\tint f(double a, A b);\n\t}\n\n\tinterface DXXI {\n\t\tint f(double a, A b, B c);\n\t}\n\n\tinterface DXXXI {\n\t\tint f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDI {\n\t\tint f(A a, double b);\n\t}\n\n\tinterface XXDI {\n\t\tint f(A a, B b, double c);\n\t}\n\n\tinterface XXXDI {\n\t\tint f(A a, B b, C c, double d);\n\t}\n\n\tinterface XI {\n\t\tint f(A a);\n\t}\n\n\tinterface XXI {\n\t\tint f(A a, B b);\n\t}\n\n\tinterface XXXI {\n\t\tint f(A a, B b, C c);\n\t}\n\n\tinterface XXXXI {\n\t\tint f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBI {\n\t\tint f(boolean a, boolean b);\n\t}\n\n\tinterface BII {\n\t\tint f(boolean a, int b);\n\t}\n\n\tinterface BLI {\n\t\tint f(boolean a, long b);\n\t}\n\n\tinterface BDI {\n\t\tint f(boolean a, double b);\n\t}\n\n\tinterface IBI {\n\t\tint f(int a, boolean b);\n\t}\n\n\tinterface III {\n\t\tint f(int a, int b);\n\t}\n\n\tinterface ILI {\n\t\tint f(int a, long b);\n\t}\n\n\tinterface IDI {\n\t\tint f(int a, double b);\n\t}\n\n\tinterface LBI {\n\t\tint f(long a, boolean b);\n\t}\n\n\tinterface LII {\n\t\tint f(long a, int b);\n\t}\n\n\tinterface LLI {\n\t\tint f(long a, long b);\n\t}\n\n\tinterface LDI {\n\t\tint f(long a, double b);\n\t}\n\n\tinterface DBI {\n\t\tint f(double a, boolean b);\n\t}\n\n\tinterface DII {\n\t\tint f(double a, int b);\n\t}\n\n\tinterface DLI {\n\t\tint f(double a, long b);\n\t}\n\n\tinterface DDI {\n\t\tint f(double a, double b);\n\t}\n\n\tinterface VL {\n\t\tlong f();\n\t}\n\n\tinterface BL {\n\t\tlong f(boolean a);\n\t}\n\n\tinterface BXL {\n\t\tlong f(boolean a, A b);\n\t}\n\n\tinterface BXXL {\n\t\tlong f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXL {\n\t\tlong f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBL {\n\t\tlong f(A a, boolean b);\n\t}\n\n\tinterface XXBL {\n\t\tlong f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBL {\n\t\tlong f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IL {\n\t\tlong f(int a);\n\t}\n\n\tinterface IXL {\n\t\tlong f(int a, A b);\n\t}\n\n\tinterface IXXL {\n\t\tlong f(int a, A b, B c);\n\t}\n\n\tinterface IXXXL {\n\t\tlong f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIL {\n\t\tlong f(A a, int b);\n\t}\n\n\tinterface XXIL {\n\t\tlong f(A a, B b, int c);\n\t}\n\n\tinterface XXXIL {\n\t\tlong f(A a, B b, C c, int d);\n\t}\n\n\tinterface LL {\n\t\tlong f(long a);\n\t}\n\n\tinterface LXL {\n\t\tlong f(long a, A b);\n\t}\n\n\tinterface LXXL {\n\t\tlong f(long a, A b, B c);\n\t}\n\n\tinterface LXXXL {\n\t\tlong f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLL {\n\t\tlong f(A a, long b);\n\t}\n\n\tinterface XXLL {\n\t\tlong f(A a, B b, long c);\n\t}\n\n\tinterface XXXLL {\n\t\tlong f(A a, B b, C c, long d);\n\t}\n\n\tinterface DL {\n\t\tlong f(double a);\n\t}\n\n\tinterface DXL {\n\t\tlong f(double a, A b);\n\t}\n\n\tinterface DXXL {\n\t\tlong f(double a, A b, B c);\n\t}\n\n\tinterface DXXXL {\n\t\tlong f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDL {\n\t\tlong f(A a, double b);\n\t}\n\n\tinterface XXDL {\n\t\tlong f(A a, B b, double c);\n\t}\n\n\tinterface XXXDL {\n\t\tlong f(A a, B b, C c, double d);\n\t}\n\n\tinterface XL {\n\t\tlong f(A a);\n\t}\n\n\tinterface XXL {\n\t\tlong f(A a, B b);\n\t}\n\n\tinterface XXXL {\n\t\tlong f(A a, B b, C c);\n\t}\n\n\tinterface XXXXL {\n\t\tlong f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBL {\n\t\tlong f(boolean a, boolean b);\n\t}\n\n\tinterface BIL {\n\t\tlong f(boolean a, int b);\n\t}\n\n\tinterface BLL {\n\t\tlong f(boolean a, long b);\n\t}\n\n\tinterface BDL {\n\t\tlong f(boolean a, double b);\n\t}\n\n\tinterface IBL {\n\t\tlong f(int a, boolean b);\n\t}\n\n\tinterface IIL {\n\t\tlong f(int a, int b);\n\t}\n\n\tinterface ILL {\n\t\tlong f(int a, long b);\n\t}\n\n\tinterface IDL {\n\t\tlong f(int a, double b);\n\t}\n\n\tinterface LBL {\n\t\tlong f(long a, boolean b);\n\t}\n\n\tinterface LIL {\n\t\tlong f(long a, int b);\n\t}\n\n\tinterface LLL {\n\t\tlong f(long a, long b);\n\t}\n\n\tinterface LDL {\n\t\tlong f(long a, double b);\n\t}\n\n\tinterface DBL {\n\t\tlong f(double a, boolean b);\n\t}\n\n\tinterface DIL {\n\t\tlong f(double a, int b);\n\t}\n\n\tinterface DLL {\n\t\tlong f(double a, long b);\n\t}\n\n\tinterface DDL {\n\t\tlong f(double a, double b);\n\t}\n\n\tinterface VD {\n\t\tdouble f();\n\t}\n\n\tinterface BD {\n\t\tdouble f(boolean a);\n\t}\n\n\tinterface BXD {\n\t\tdouble f(boolean a, A b);\n\t}\n\n\tinterface BXXD {\n\t\tdouble f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXD {\n\t\tdouble f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBD {\n\t\tdouble f(A a, boolean b);\n\t}\n\n\tinterface XXBD {\n\t\tdouble f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBD {\n\t\tdouble f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface ID {\n\t\tdouble f(int a);\n\t}\n\n\tinterface IXD {\n\t\tdouble f(int a, A b);\n\t}\n\n\tinterface IXXD {\n\t\tdouble f(int a, A b, B c);\n\t}\n\n\tinterface IXXXD {\n\t\tdouble f(int a, A b, B c, C d);\n\t}\n\n\tinterface XID {\n\t\tdouble f(A a, int b);\n\t}\n\n\tinterface XXID {\n\t\tdouble f(A a, B b, int c);\n\t}\n\n\tinterface XXXID {\n\t\tdouble f(A a, B b, C c, int d);\n\t}\n\n\tinterface LD {\n\t\tdouble f(long a);\n\t}\n\n\tinterface LXD {\n\t\tdouble f(long a, A b);\n\t}\n\n\tinterface LXXD {\n\t\tdouble f(long a, A b, B c);\n\t}\n\n\tinterface LXXXD {\n\t\tdouble f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLD {\n\t\tdouble f(A a, long b);\n\t}\n\n\tinterface XXLD {\n\t\tdouble f(A a, B b, long c);\n\t}\n\n\tinterface XXXLD {\n\t\tdouble f(A a, B b, C c, long d);\n\t}\n\n\tinterface DD {\n\t\tdouble f(double a);\n\t}\n\n\tinterface DXD {\n\t\tdouble f(double a, A b);\n\t}\n\n\tinterface DXXD {\n\t\tdouble f(double a, A b, B c);\n\t}\n\n\tinterface DXXXD {\n\t\tdouble f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDD {\n\t\tdouble f(A a, double b);\n\t}\n\n\tinterface XXDD {\n\t\tdouble f(A a, B b, double c);\n\t}\n\n\tinterface XXXDD {\n\t\tdouble f(A a, B b, C c, double d);\n\t}\n\n\tinterface XD {\n\t\tdouble f(A a);\n\t}\n\n\tinterface XXD {\n\t\tdouble f(A a, B b);\n\t}\n\n\tinterface XXXD {\n\t\tdouble f(A a, B b, C c);\n\t}\n\n\tinterface XXXXD {\n\t\tdouble f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBD {\n\t\tdouble f(boolean a, boolean b);\n\t}\n\n\tinterface BID {\n\t\tdouble f(boolean a, int b);\n\t}\n\n\tinterface BLD {\n\t\tdouble f(boolean a, long b);\n\t}\n\n\tinterface BDD {\n\t\tdouble f(boolean a, double b);\n\t}\n\n\tinterface IBD {\n\t\tdouble f(int a, boolean b);\n\t}\n\n\tinterface IID {\n\t\tdouble f(int a, int b);\n\t}\n\n\tinterface ILD {\n\t\tdouble f(int a, long b);\n\t}\n\n\tinterface IDD {\n\t\tdouble f(int a, double b);\n\t}\n\n\tinterface LBD {\n\t\tdouble f(long a, boolean b);\n\t}\n\n\tinterface LID {\n\t\tdouble f(long a, int b);\n\t}\n\n\tinterface LLD {\n\t\tdouble f(long a, long b);\n\t}\n\n\tinterface LDD {\n\t\tdouble f(long a, double b);\n\t}\n\n\tinterface DBD {\n\t\tdouble f(double a, boolean b);\n\t}\n\n\tinterface DID {\n\t\tdouble f(double a, int b);\n\t}\n\n\tinterface DLD {\n\t\tdouble f(double a, long b);\n\t}\n\n\tinterface DDD {\n\t\tdouble f(double a, double b);\n\t}\n\n\tinterface VX {\n\t\tA f();\n\t}\n\n\tinterface BX {\n\t\tA f(boolean a);\n\t}\n\n\tinterface BXX {\n\t\tB f(boolean a, A b);\n\t}\n\n\tinterface BXXX {\n\t\tC f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXX {\n\t\tD f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBX {\n\t\tB f(A a, boolean b);\n\t}\n\n\tinterface XXBX {\n\t\tC f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBX {\n\t\tD f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IX {\n\t\tA f(int a);\n\t}\n\n\tinterface IXX {\n\t\tB f(int a, A b);\n\t}\n\n\tinterface IXXX {\n\t\tC f(int a, A b, B c);\n\t}\n\n\tinterface IXXXX {\n\t\tD f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIX {\n\t\tB f(A a, int b);\n\t}\n\n\tinterface XXIX {\n\t\tC f(A a, B b, int c);\n\t}\n\n\tinterface XXXIX {\n\t\tD f(A a, B b, C c, int d);\n\t}\n\n\tinterface LX {\n\t\tA f(long a);\n\t}\n\n\tinterface LXX {\n\t\tB f(long a, A b);\n\t}\n\n\tinterface LXXX {\n\t\tC f(long a, A b, B c);\n\t}\n\n\tinterface LXXXX {\n\t\tD f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLX {\n\t\tB f(A a, long b);\n\t}\n\n\tinterface XXLX {\n\t\tC f(A a, B b, long c);\n\t}\n\n\tinterface XXXLX {\n\t\tD f(A a, B b, C c, long d);\n\t}\n\n\tinterface DX {\n\t\tA f(double a);\n\t}\n\n\tinterface DXX {\n\t\tB f(double a, A b);\n\t}\n\n\tinterface DXXX {\n\t\tC f(double a, A b, B c);\n\t}\n\n\tinterface DXXXX {\n\t\tD f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDX {\n\t\tB f(A a, double b);\n\t}\n\n\tinterface XXDX {\n\t\tC f(A a, B b, double c);\n\t}\n\n\tinterface XXXDX {\n\t\tD f(A a, B b, C c, double d);\n\t}\n\n\tinterface XX {\n\t\tB f(A a);\n\t}\n\n\tinterface XXX {\n\t\tC f(A a, B b);\n\t}\n\n\tinterface XXXX {\n\t\tD f(A a, B b, C c);\n\t}\n\n\tinterface XXXXX {\n\t\tE f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBX {\n\t\tA f(boolean a, boolean b);\n\t}\n\n\tinterface BIX {\n\t\tA f(boolean a, int b);\n\t}\n\n\tinterface BLX {\n\t\tA f(boolean a, long b);\n\t}\n\n\tinterface BDX {\n\t\tA f(boolean a, double b);\n\t}\n\n\tinterface IBX {\n\t\tA f(int a, boolean b);\n\t}\n\n\tinterface IIX {\n\t\tA f(int a, int b);\n\t}\n\n\tinterface ILX {\n\t\tA f(int a, long b);\n\t}\n\n\tinterface IDX {\n\t\tA f(int a, double b);\n\t}\n\n\tinterface LBX {\n\t\tA f(long a, boolean b);\n\t}\n\n\tinterface LIX {\n\t\tA f(long a, int b);\n\t}\n\n\tinterface LLX {\n\t\tA f(long a, long b);\n\t}\n\n\tinterface LDX {\n\t\tA f(long a, double b);\n\t}\n\n\tinterface DBX {\n\t\tA f(double a, boolean b);\n\t}\n\n\tinterface DIX {\n\t\tA f(double a, int b);\n\t}\n\n\tinterface DLX {\n\t\tA f(double a, long b);\n\t}\n\n\tinterface DDX {\n\t\tA f(double a, double b);\n\t}\n}\n\nclass SA { // suffix array\n\tstatic int[] makeSA(String s) {\n\t\tint n = s.length() + 1;\n\t\tint[] cs = new int[n];\n\t\tcs[n - 1] = 0;\n\t\tfor (int i = 0; i < n - 1; i++)\n\t\t\tcs[i] = s.charAt(i) + 1;\n\t\tArrayList acs = U.make(n, i -> cs[i]);\n\t\tTreeMap tm = U.compress(acs).a;\n\t\tint k = tm.size();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tcs[i] = tm.get(cs[i]);\n\t\treturn makeSA(cs, n, k);\n\t}\n\n\tstatic int[] makeLCP(String s, int[] sa) { // lcp(i, i+1)\n\t\tint n = sa.length;\n\t\tint[] r = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tr[sa[i]] = i;\n\t\tint[] lcp = new int[n];\n\t\tint l = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint idx = r[i];\n\t\t\tif (idx == n - 1) {\n\t\t\t\tlcp[idx] = -1;\n\t\t\t\tl = 0;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tint p = sa[idx];\n\t\t\tint q = sa[idx + 1];\n\t\t\tif (l > 0)\n\t\t\t\tl--;\n\t\t\twhile (p + l < n - 1 && q + l < n - 1 && s.charAt(p + l) == s.charAt(q + l))\n\t\t\t\tl++;\n\t\t\tlcp[idx] = l;\n\t\t}\n\t\treturn lcp;\n\t}\n\n\tstatic F.III lcpQuery(String s) {\n\t\tint n = s.length() + 1;\n\t\tint[] sa = makeSA(s);\n\t\tint[] lcp = makeLCP(s, sa);\n\t\tint[] inv = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tinv[sa[i]] = i;\n\t\t}\n\t\tST st = new ST(n, (a, b) -> a < b ? a : b, Integer.MAX_VALUE);\n\t\tst.init(i -> i < n ? lcp[i] : Integer.MAX_VALUE);\n\t\treturn (i, j) -> {\n\t\t\tif (i == j)\n\t\t\t\treturn n - 1 - i;\n\t\t\ti = inv[i];\n\t\t\tj = inv[j];\n\t\t\tif (i > j) {\n\t\t\t\ti ^= j;\n\t\t\t\tj ^= i;\n\t\t\t\ti ^= j;\n\t\t\t}\n\t\t\treturn st.query(i, j);\n\t\t};\n\t}\n\n\tprivate static int[] makeSA(int[] cs, int n, int k) {\n\t\tboolean[] isS = new boolean[n];\n\t\tboolean[] isLms = new boolean[n];\n\t\tint[] lmss = new int[n];\n\t\tint numLmss = 0;\n\t\tisS[n - 1] = true;\n\t\tfor (int i = n - 2; i >= 0; i--)\n\t\t\tisS[i] = cs[i] < cs[i + 1] || cs[i] == cs[i + 1] && isS[i + 1];\n\t\tfor (int i = 1; i < n; i++)\n\t\t\tif (!isS[i - 1] && isS[i]) {\n\t\t\t\tlmss[numLmss++] = i;\n\t\t\t\tisLms[i] = true;\n\t\t\t}\n\t\tint[] sa = inducedSort(cs, n, numLmss, k, lmss, isS);\n\t\tint[] lmss2 = new int[numLmss];\n\t\tnumLmss = 0;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tif (isLms[sa[i]])\n\t\t\t\tlmss2[numLmss++] = sa[i];\n\t\tint num = 0;\n\t\tsa[lmss2[0]] = 0;\n\t\tfor (int i = 0; i < numLmss - 1; i++) {\n\t\t\tint p = lmss2[i];\n\t\t\tint q = lmss2[i + 1];\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (cs[p] != cs[q] || isLms[p] != isLms[q]) {\n\t\t\t\t\tsa[lmss2[i + 1]] = ++num;\n\t\t\t\t\tbreak;\n\t\t\t\t} else if (j > 0 && (isLms[p] || isLms[q])) {\n\t\t\t\t\tsa[lmss2[i + 1]] = num;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tp++;\n\t\t\t\tq++;\n\t\t\t}\n\t\t}\n\t\tif (num + 1 < numLmss) {\n\t\t\tnumLmss = 0;\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tif (isLms[i])\n\t\t\t\t\tlmss2[numLmss++] = sa[i];\n\t\t\tlmss2 = makeSA(lmss2, numLmss, num + 1);\n\t\t\tfor (int i = 0; i < numLmss; i++)\n\t\t\t\tlmss2[i] = lmss[lmss2[i]];\n\t\t}\n\t\treturn inducedSort(cs, n, numLmss, k, lmss2, isS);\n\t}\n\n\tprivate static int[] inducedSort(int[] cs, int n, int numLmss, int k, int[] lmss, boolean[] isS) {\n\t\tint[] sa = new int[n];\n\t\tint[] bin = new int[k + 1];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tbin[cs[i] + 1]++;\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tbin[i + 1] += bin[i];\n\t\tint[] counts = new int[k];\n\t\tfor (int i = numLmss - 1; i >= 0; i--) { // put LMS backward\n\t\t\tint c = cs[lmss[i]];\n\t\t\tsa[bin[c + 1] - 1 - counts[c]++] = lmss[i];\n\t\t}\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tcounts[i] = 0;\n\t\tfor (int i = 0; i < n; i++) { // put L forward\n\t\t\tint s = sa[i] - 1;\n\t\t\tif (s < 0 || isS[s])\n\t\t\t\tcontinue;\n\t\t\tint c = cs[s];\n\t\t\tsa[bin[c] + counts[c]++] = s;\n\t\t}\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tcounts[i] = 0;\n\t\tfor (int i = n - 1; i >= 0; i--) { // put S backward\n\t\t\tint s = sa[i] - 1;\n\t\t\tif (s < 0 || !isS[s])\n\t\t\t\tcontinue;\n\t\t\tint c = cs[s];\n\t\t\tsa[bin[c + 1] - 1 - counts[c]++] = s;\n\t\t}\n\t\treturn sa;\n\t}\n}\n\nclass ST { // Segment Tree\n\tprivate ArrayList as;\n\tprivate int h;\n\tprivate int n;\n\tprivate F.XXX merger;\n\tprivate A e;\n\n\tST(int num, F.XXX merger, A e) {\n\t\tthis.merger = merger;\n\t\tthis.e = e;\n\t\th = 0;\n\t\twhile ((1 << h) < num)\n\t\t\th++;\n\t\tn = 1 << h;\n\t\tas = U.make(2 * n, i -> e);\n\t}\n\n\tvoid init(A a) {\n\t\tinit(i -> a);\n\t}\n\n\tvoid init(A[] as) {\n\t\tinit(i -> i < as.length ? as[i] : e);\n\t}\n\n\tvoid init(F.IX maker) {\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tas.set(n + i, maker.f(i));\n\t\tfor (int i = n - 1; i > 0; i--)\n\t\t\tas.set(i, merge(as.get(i << 1), as.get(i << 1 | 1)));\n\t}\n\n\tA get(int i) {\n\t\treturn query(i, i + 1);\n\t}\n\n\tvoid set(int i, A a) {\n\t\tas.set(i += n, a);\n\t\twhile ((i >>= 1) > 0)\n\t\t\tas.set(i, merge(as.get(i << 1), as.get(i << 1 | 1)));\n\t}\n\n\tA query(int l, int r) {\n\t\tl += n;\n\t\tr += n;\n\t\tA al = e;\n\t\tA ar = e;\n\t\twhile (l < r) {\n\t\t\tif ((l & 1) != 0)\n\t\t\t\tal = merge(al, as.get(l++));\n\t\t\tif ((r & 1) != 0)\n\t\t\t\tar = merge(as.get(--r), ar);\n\t\t\tl >>= 1;\n\t\t\tr >>= 1;\n\t\t}\n\t\treturn merge(al, ar);\n\t}\n\n\tprivate A merge(A a, A b) {\n\t\treturn a == e ? b : b == e ? a : merger.f(a, b);\n\t}\n}\n\nclass LST { // Lazy Segment Tree\n\tprivate ArrayList as;\n\tprivate ArrayList lazy;\n\tprivate F.XXX merger;\n\tprivate F.XXIX applier;\n\tprivate F.XXX opMerger;\n\tprivate A e;\n\tprivate Op id;\n\tprivate int h;\n\tprivate int n;\n\n\tLST(int num, F.XXX merger, F.XXIX applier, F.XXX opMerger, A e, Op id) {\n\t\tthis.merger = merger;\n\t\tthis.applier = applier;\n\t\tthis.opMerger = opMerger;\n\t\tthis.e = e;\n\t\tthis.id = id;\n\t\th = 0;\n\t\twhile ((1 << h) < num)\n\t\t\th++;\n\t\tn = 1 << h;\n\t\tint size = n << 1;\n\t\tas = U.make(size, i -> e);\n\t\tlazy = U.make(size, i -> id);\n\t}\n\n\tvoid init(A a) {\n\t\tinit(i -> a);\n\t}\n\n\tvoid init(A[] as) {\n\t\tinit(i -> i < as.length ? as[i] : e);\n\t}\n\n\tvoid init(F.IX maker) {\n\t\tfor (int i = 0; i < n << 1; i++)\n\t\t\tlazy.set(i, id);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tas.set(n + i, maker.f(i));\n\t\tfor (int i = n - 1; i > 0; i--)\n\t\t\tas.set(i, merge(as.get(i << 1), as.get(i << 1 | 1)));\n\t}\n\n\tA get(int i) {\n\t\treturn query(i, i + 1);\n\t}\n\n\tvoid set(int i, A a) {\n\t\tprop(i += n);\n\t\tas.set(i, a);\n\t\tlazy.set(i, id);\n\t\tbackprop(i);\n\t}\n\n\tA query(int l, int r) {\n\t\tprop(l += n);\n\t\tprop(r += n - 1);\n\t\tr++;\n\t\tA al = e;\n\t\tA ar = e;\n\t\tint len = 1;\n\t\twhile (l < r) {\n\t\t\tif ((l & 1) != 0)\n\t\t\t\tal = merge(al, eval(l++, len));\n\t\t\tif ((r & 1) != 0)\n\t\t\t\tar = merge(eval(--r, len), ar);\n\t\t\tl >>= 1;\n\t\t\tr >>= 1;\n\t\t\tlen <<= 1;\n\t\t}\n\t\treturn merge(al, ar);\n\t}\n\n\tvoid apply(int l, int r, Op o) {\n\t\tprop(l += n);\n\t\tprop(r += n - 1);\n\t\tint a = l;\n\t\tint b = r;\n\t\tr++;\n\t\twhile (l < r) {\n\t\t\tif ((l & 1) != 0)\n\t\t\t\tlazy.set(l, mergeOp(lazy.get(l++), o));\n\t\t\tif ((r & 1) != 0)\n\t\t\t\tlazy.set(--r, mergeOp(lazy.get(r), o));\n\t\t\tl >>= 1;\n\t\t\tr >>= 1;\n\t\t}\n\t\tbackprop(a);\n\t\tbackprop(b);\n\t}\n\n\tint size() {\n\t\treturn n;\n\t}\n\n\tprivate A merge(A a, A b) {\n\t\treturn a == e ? b : b == e ? a : merger.f(a, b);\n\t}\n\n\tprivate Op mergeOp(Op o, Op p) {\n\t\treturn o == id ? p : p == id ? o : opMerger.f(o, p);\n\t}\n\n\tprivate A apply(A a, Op o, int len) {\n\t\treturn o == id ? a : applier.f(a, o, len);\n\t}\n\n\tprivate A eval(int k, int len) {\n\t\treturn apply(as.get(k), lazy.get(k), len);\n\t}\n\n\tprivate void flush(int k, int len) {\n\t\tOp o = lazy.get(k);\n\t\tif (o == id)\n\t\t\treturn;\n\t\tlazy.set(k << 1, mergeOp(lazy.get(k << 1), o));\n\t\tlazy.set(k << 1 | 1, mergeOp(lazy.get(k << 1 | 1), o));\n\t\tas.set(k, apply(as.get(k), o, len));\n\t\tlazy.set(k, id);\n\t}\n\n\tprivate void prop(int k) {\n\t\tfor (int i = h; i > 0; i--)\n\t\t\tflush(k >> i, 1 << i);\n\t}\n\n\tprivate void backprop(int k) {\n\t\tint len = 1;\n\t\twhile ((k >>= 1) > 0) {\n\t\t\tas.set(k, merge(eval(k << 1, len), eval(k << 1 | 1, len)));\n\t\t\tlen <<= 1;\n\t\t}\n\t}\n}\n\ninterface Magma {\n\tA g(A a, A b);\n}\n\ninterface Associative {\n}\n\ninterface Unital {\n\tA e();\n}\n\ninterface Invertible {\n\tA inv(A a);\n}\n\ninterface Commutative {\n}\n\ninterface SemiGroup extends Magma, Associative {\n}\n\ninterface Monoid extends SemiGroup, Unital {\n\tstatic Monoid make(F.XXX g, A e) {\n\t\treturn new Monoid() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface CommutativeMonoid extends Monoid, Commutative {\n\tstatic CommutativeMonoid make(F.XXX g, A e) {\n\t\treturn new CommutativeMonoid() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface Group extends Monoid, Invertible {\n\tstatic Group make(F.XXX g, F.XX inv, A e) {\n\t\treturn new Group() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\n\t\t\tpublic A inv(A a) {\n\t\t\t\treturn a.equals(e) ? e : inv.f(a);\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface AbelianGroup extends Group, CommutativeMonoid {\n\tstatic AbelianGroup make(F.XXX g, F.XX inv, A e) {\n\t\treturn new AbelianGroup() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\n\t\t\tpublic A inv(A a) {\n\t\t\t\treturn a.equals(e) ? e : inv.f(a);\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface Ring {\n\tAbelianGroup add();\n\n\tMonoid mul();\n\n\tdefault A zero() {\n\t\treturn add().e();\n\t}\n\n\tdefault A one() {\n\t\treturn mul().e();\n\t}\n\n\tstatic Ring make(F.XXX add, F.XX neg, F.XXX mul, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), Monoid.make(mul, one));\n\t}\n\n\tstatic Ring make(AbelianGroup add, Monoid mul) {\n\t\treturn new Ring() {\n\t\t\tpublic AbelianGroup add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic Monoid mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface CommutativeRing extends Ring {\n\tCommutativeMonoid mul();\n\n\tstatic CommutativeRing make(F.XXX add, F.XX neg, F.XXX mul, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), CommutativeMonoid.make(mul, one));\n\t}\n\n\tstatic CommutativeRing make(AbelianGroup add, CommutativeMonoid mul) {\n\t\treturn new CommutativeRing() {\n\t\t\tpublic AbelianGroup add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic CommutativeMonoid mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface EuclideanRing extends CommutativeRing {\n\tA div(A a, A b);\n\n\tA mod(A a, A b);\n\n\tstatic EuclideanRing make(F.XXX add, F.XX neg, F.XXX mul, F.XXX div,\n\t\t\tF.XXX mod, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), CommutativeMonoid.make(mul, one), div, mod);\n\t}\n\n\tstatic EuclideanRing make(AbelianGroup add, CommutativeMonoid mul, F.XXX div,\n\t\t\tF.XXX mod) {\n\t\tfinal A zero = add.e();\n\t\tfinal A one = mul.e();\n\t\treturn new EuclideanRing() {\n\t\t\tpublic AbelianGroup add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic CommutativeMonoid mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\n\t\t\tpublic A div(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn b.equals(one) ? a : div.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A mod(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn b.equals(one) ? zero : mod.f(a, b);\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface Field extends EuclideanRing {\n\tAbelianGroup mul();\n\n\tstatic Field make(F.XXX add, F.XX neg, F.XXX mul, F.XX inv, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), AbelianGroup.make(mul, inv, one));\n\t}\n\n\tstatic Field make(AbelianGroup add, AbelianGroup mul) {\n\t\tfinal A zero = add.e();\n\t\tfinal A one = mul.e();\n\t\treturn new Field() {\n\t\t\tpublic AbelianGroup add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic AbelianGroup mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\n\t\t\tpublic A div(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn b.equals(one) ? a : mul.g(a, mul.inv(b));\n\t\t\t}\n\n\t\t\tpublic A mod(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn zero;\n\t\t\t}\n\t\t};\n\t}\n}\n\nfinal class Alg {\n\tprivate Alg() {\n\t}\n\n\tstatic > A gcd(A a, A b, EuclideanRing ring) {\n\t\tAbelianGroup add = ring.add();\n\t\tA zero = add.e();\n\t\tint sa = a.compareTo(zero);\n\t\tint sb = b.compareTo(zero);\n\t\tif (sa == 0)\n\t\t\treturn b;\n\t\tif (sb == 0)\n\t\t\treturn a;\n\t\tif (sa < 0)\n\t\t\ta = add.inv(a);\n\t\tif (sb < 0)\n\t\t\tb = add.inv(b);\n\t\tif (a.compareTo(b) < 0) {\n\t\t\tA tmp = a;\n\t\t\ta = b;\n\t\t\tb = tmp;\n\t\t}\n\t\twhile (true) {\n\t\t\tA c = ring.mod(a, b);\n\t\t\tif (c.compareTo(zero) == 0)\n\t\t\t\treturn b;\n\t\t\ta = b;\n\t\t\tb = c;\n\t\t}\n\t}\n\n\tstatic long gcd(long a, long b) {\n\t\tif (a == 0)\n\t\t\treturn b;\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\tif (a < 0)\n\t\t\ta = -a;\n\t\tif (b < 0)\n\t\t\tb = -b;\n\t\tif (a < b) {\n\t\t\ta ^= b;\n\t\t\tb ^= a;\n\t\t\ta ^= b;\n\t\t}\n\t\twhile (true) {\n\t\t\tlong c = a % b;\n\t\t\tif (c == 0)\n\t\t\t\treturn b;\n\t\t\ta = b;\n\t\t\tb = c;\n\t\t}\n\t}\n\n\tstatic int gcd(int a, int b) {\n\t\treturn (int) gcd((long) a, (long) b);\n\t}\n\n\tstatic > int[] lis(F.IX access, int size) {\n\t\tObject[] dp = new Object[size];\n\t\tint[][] dpIndices = new int[size][2];\n\t\tdp[0] = access.f(0);\n\t\tint len = 1;\n\t\tint lidx = 0;\n\t\tfor (int i = 1; i < size; i++) {\n\t\t\tA ai = access.f(i);\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tint idx = U.searchI(-1, len, j -> ai.compareTo((A) dp[j]) <= 0); // replace <= with < to return NLDS\n\t\t\tdp[idx] = ai;\n\t\t\tdpIndices[idx][0] = i;\n\t\t\tif (idx == len) {\n\t\t\t\tlidx = i;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t\tif (idx > 0)\n\t\t\t\tdpIndices[i][1] = dpIndices[idx - 1][0];\n\t\t}\n\t\tint[] res = new int[len];\n\t\tres[len - 1] = lidx;\n\t\tfor (int i = len - 1; i >= 0; i--) {\n\t\t\tres[i] = lidx;\n\t\t\tlidx = dpIndices[lidx][1];\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic A pow(A a, long b, Monoid monoid) {\n\t\tA res = monoid.e();\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) != 0)\n\t\t\t\tres = monoid.g(res, a);\n\t\t\ta = monoid.g(a, a);\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic A pow(A a, BigInteger b, Monoid monoid) {\n\t\tA res = monoid.e();\n\t\twhile (b.compareTo(BigInteger.ZERO) > 0) {\n\t\t\tif ((b.and(BigInteger.ONE)).intValueExact() != 0)\n\t\t\t\tres = monoid.g(res, a);\n\t\t\ta = monoid.g(a, a);\n\t\t\tb = b.divide(BigInteger.valueOf(2));\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic long pow(long a, long b) {\n\t\tlong res = 1;\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) != 0)\n\t\t\t\tres *= a;\n\t\t\ta *= a;\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic > T extgcd(A a, A b, EuclideanRing ring) { // returns (x, y, d) s.t. ax + by = d\n\t\tAbelianGroup add = ring.add();\n\t\tCommutativeMonoid mul = ring.mul();\n\t\tA zero = add.e();\n\t\tA one = mul.e();\n\t\tA sa = a.compareTo(zero) < 0 ? add.inv(one) : one;\n\t\tA sb = b.compareTo(zero) < 0 ? add.inv(one) : one;\n\t\ta = mul.g(a, sa);\n\t\tb = mul.g(b, sb);\n\t\tA x = one;\n\t\tA y = zero;\n\t\tA z = zero;\n\t\tA w = one;\n\t\twhile (b.compareTo(zero) > 0) {\n\t\t\tA q = ring.div(a, b);\n\t\t\tA t = z;\n\t\t\tz = add.g(x, add.inv(mul.g(q, z)));\n\t\t\tx = t;\n\t\t\tt = w;\n\t\t\tw = add.g(y, add.inv(mul.g(q, w)));\n\t\t\ty = t;\n\t\t\tt = b;\n\t\t\tb = add.g(a, add.inv(mul.g(q, b)));\n\t\t\ta = t;\n\t\t}\n\t\treturn T.make(mul.g(x, sa), mul.g(y, sb), a);\n\t}\n\n\tstatic TL extgcd(long a, long b) {\n\t\tint sa = a < 0 ? -1 : 1;\n\t\tint sb = b < 0 ? -1 : 1;\n\t\ta *= sa;\n\t\tb *= sb;\n\t\tlong x = 1;\n\t\tlong y = 0;\n\t\tlong z = 0;\n\t\tlong w = 1;\n\t\twhile (b > 0) {\n\t\t\tlong q = a / b;\n\t\t\tlong t = z;\n\t\t\tz = x - q * z;\n\t\t\tx = t;\n\t\t\tt = w;\n\t\t\tw = y - q * w;\n\t\t\ty = t;\n\t\t\tt = b;\n\t\t\tb = a - q * b;\n\t\t\ta = t;\n\t\t}\n\t\treturn TL.make(x * sa, y * sb, a);\n\t}\n\n\tstatic TI extgcd(int a, int b) {\n\t\treturn extgcd((long) a, (long) b).toInt();\n\t}\n\n\tstatic ArrayList factorize(int n) { // factor, exponent\n\t\tArrayList res = new ArrayList();\n\t\tfor (int i = 2; i * i <= n; i++) {\n\t\t\tint count = 0;\n\t\t\twhile (n % i == 0) {\n\t\t\t\tn /= i;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count > 0)\n\t\t\t\tres.add(PI.make(i, count));\n\t\t}\n\t\tif (n > 1)\n\t\t\tres.add(PI.make(n, 1));\n\t\treturn res;\n\t}\n\n\tstatic ArrayList factorize(long n) { // factor, exponent\n\t\tArrayList res = new ArrayList();\n\t\tfor (int i = 2; i * i <= n; i++) {\n\t\t\tint count = 0;\n\t\t\twhile (n % i == 0) {\n\t\t\t\tn /= i;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count > 0)\n\t\t\t\tres.add(PL.make(i, count));\n\t\t}\n\t\tif (n > 1)\n\t\t\tres.add(PL.make(n, 1));\n\t\treturn res;\n\t}\n\n\tstatic A arithSum(A a, A d, long num, Ring ring) {\n\t\treturn arithGeomSum(a, d, ring.one(), ring.one(), num, ring);\n\t}\n\n\tstatic A geomSum(A b, A r, long num, Ring ring) {\n\t\treturn arithGeomSum(ring.one(), ring.zero(), b, r, num, ring);\n\t}\n\n\tstatic A arithGeomSum(A a, A d, A b, A r, long num, Ring ring) { // Σ(a+(i-1)d)br^(i-1)\n\t\tAbelianGroup add = ring.add();\n\t\tMonoid mul = ring.mul();\n\t\tMonoid> matMul = Mat.mulRing(3, ring);\n\t\tA zero = ring.zero();\n\t\tA one = ring.one();\n\t\tMN mat = pow(Mat.make(new Object[][] { { r, d, a }, { zero, r, r }, { zero, zero, one } }), num - 1, matMul);\n\t\treturn mul.g(add.g(add.g(mul.g(mat.at(0, 0), a), mul.g(mat.at(0, 1), r)), mat.at(0, 2)), b);\n\t}\n}\n\nclass MN {\n\tfinal int m;\n\tfinal int n;\n\tprivate final Object[][] as;\n\n\tstatic class Scalar extends MN {\n\t\tfinal long l;\n\t\tA a;\n\n\t\tScalar(int m, int n, long l, A zero, A oneTimesL) {\n\t\t\tsuper(m, n, (i, j) -> i == j ? oneTimesL : zero);\n\t\t\tthis.a = oneTimesL;\n\t\t\tthis.l = l;\n\t\t}\n\t}\n\n\tMN(int m, int n, Mat.Accessor accessor) {\n\t\tthis.m = m;\n\t\tthis.n = n;\n\t\tas = new Object[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tas[i][j] = accessor.at(i, j);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic String toString() {\n\t\tString s = \"\";\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\ts += i == 0 ? \"[[ \" : \" [ \";\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\ts += (j == 0 ? \"\" : \", \") + as[i][j];\n\t\t\t}\n\t\t\ts += i == m - 1 ? \" ]]\" : \" ]\\n\";\n\t\t}\n\t\treturn s;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tA at(int i, int j) {\n\t\treturn (A) as[i][j];\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tA[][] toArray() {\n\t\tA[][] res = (A[][]) Array.newInstance(as[0][0].getClass(), m, n);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (A) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tint[][] toIntArray() {\n\t\tint[][] res = new int[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (int) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tlong[][] toLongArray() {\n\t\tlong[][] res = new long[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (long) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tdouble[][] toDoubleArray() {\n\t\tdouble[][] res = new double[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (double) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n}\n\nclass Mat {\n\tinterface Accessor {\n\t\tA at(int i, int j);\n\t}\n\n\tprivate static MN.Scalar make(int m, int n, long l, A zero, A oneTimesL) {\n\t\treturn new MN.Scalar(m, n, l, zero, oneTimesL);\n\t}\n\n\tstatic MN make(int m, int n, Accessor accessor) {\n\t\treturn new MN(m, n, accessor);\n\t}\n\n\tstatic MN make(int m, int n, A[][] as) {\n\t\treturn new MN(m, n, (i, j) -> as[i][j]);\n\t}\n\n\tstatic MN make(int[][] as) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> (long) as[i][j]);\n\t}\n\n\tstatic MN make(long[][] as) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> as[i][j]);\n\t}\n\n\tstatic MN make(double[][] as) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> as[i][j]);\n\t}\n\n\tstatic MN make(int[][] as, F.IX toA) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\tstatic MN make(long[][] as, F.LX toA) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\tstatic MN make(double[][] as, F.DX toA) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\tstatic MN make(B[][] as, F.XX toA) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tstatic MN make(Object[][] as) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> (A) as[i][j]);\n\t}\n\n\tstatic MN eye(int n, Ring ring) {\n\t\treturn make(n, n, (i, j) -> i == j ? ring.mul().e() : ring.add().e());\n\t}\n\n\tstatic AbelianGroup> add(int m, int n, Ring ring) {\n\t\treturn AbelianGroup.make((a, b) -> add(a, b, ring), a -> neg(a, ring), make(m, n, 0, ring.zero(), ring.zero()));\n\t}\n\n\tstatic Monoid> mulRing(int n, Ring ring) {\n\t\treturn Monoid.make((a, b) -> mul(a, b, ring), make(n, n, 1, ring.zero(), ring.one()));\n\t}\n\n\tstatic AbelianGroup> mulField(int n, Field field) {\n\t\treturn AbelianGroup.make((a, b) -> mul(a, b, field), a -> inv(a, field),\n\t\t\t\tmake(n, n, 1, field.zero(), field.one()));\n\t}\n\n\tstatic MN add(MN a, MN b, Ring ring) {\n\t\tint m = U.max(a.m, b.m);\n\t\tint n = U.max(a.n, b.n);\n\t\tAbelianGroup add = ring.add();\n\t\tif (a instanceof MN.Scalar && b instanceof MN.Scalar) {\n\t\t\tMN.Scalar as = ((MN.Scalar) a);\n\t\t\tMN.Scalar bs = ((MN.Scalar) b);\n\t\t\treturn make(m, n, as.l + bs.l, ring.zero(), add.g(as.a, bs.a));\n\t\t}\n\t\treturn make(m, n, (i, j) -> add.g(a.at(i, j), b.at(i, j)));\n\t}\n\n\tstatic MN neg(MN a, Ring ring) {\n\t\tif (a instanceof MN.Scalar) {\n\t\t\tMN.Scalar as = ((MN.Scalar) a);\n\t\t\treturn make(a.m, a.n, -as.l, ring.zero(), ring.add().inv(as.a));\n\t\t}\n\t\treturn make(a.m, a.n, (i, j) -> ring.add().inv(a.at(i, j)));\n\t}\n\n\tstatic MN mul(MN a, MN b, Ring ring) {\n\t\tint m = a.m;\n\t\tint u = U.max(a.n, b.m);\n\t\tint n = b.n;\n\t\tAbelianGroup add = ring.add();\n\t\tMonoid mul = ring.mul();\n\t\tif (a instanceof MN.Scalar && b instanceof MN.Scalar) {\n\t\t\tMN.Scalar as = ((MN.Scalar) a);\n\t\t\tMN.Scalar bs = ((MN.Scalar) b);\n\t\t\treturn make(m, n, as.l * bs.l, ring.zero(), mul.g(as.a, bs.a));\n\t\t}\n\t\treturn make(m, n, (i, j) -> {\n\t\t\tA res = ring.zero();\n\t\t\tfor (int k = 0; k < u; k++)\n\t\t\t\tres = add.g(res, mul.g(a.at(i, k), b.at(k, j)));\n\t\t\treturn res;\n\t\t});\n\t}\n\n\tstatic A det(MN a, Field field) {\n\t\treturn detInv(a, field).a;\n\t}\n\n\tstatic MN inv(MN a, Field field) {\n\t\tUP> detInv = detInv(a, field);\n\t\tif (detInv.a.equals(field.zero()))\n\t\t\tthrow new ArithmeticException(\"inverse does not exist: det=0\");\n\t\treturn detInv.b;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate static UP> detInv(MN a, Field field) {\n\t\tif (a.m != a.n)\n\t\t\tthrow new IllegalArgumentException(\"matrix not square\");\n\t\tif (field.zero() instanceof Long) {\n\t\t\tUP> detInv = detInvLong((MN) a, (Field) field);\n\t\t\treturn UP.make((A) detInv.a, (MN) detInv.b);\n\t\t}\n\t\tint n = a.n;\n\t\tAbelianGroup add = field.add();\n\t\tAbelianGroup mul = field.mul();\n\t\tA zero = field.zero();\n\t\tA one = field.one();\n\t\tA[][] m1 = a.toArray();\n\t\tA[][] m2 = eye(n, field).toArray();\n\t\tA res = one;\n\t\tint sign = 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint pivot = -1;\n\t\t\tfor (int j = i; j < n; j++) {\n\t\t\t\tif (!m1[j][i].equals(zero)) {\n\t\t\t\t\tpivot = j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (pivot == -1) {\n\t\t\t\treturn UP.make(zero, null);\n\t\t\t}\n\t\t\tif (pivot != i) {\n\t\t\t\tsign = -sign;\n\t\t\t\tA tmp;\n\t\t\t\tfor (int j = i; j < n; j++) { // [0, i) are zero\n\t\t\t\t\ttmp = m1[i][j];\n\t\t\t\t\tm1[i][j] = m1[pivot][j];\n\t\t\t\t\tm1[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\ttmp = m2[i][j];\n\t\t\t\t\tm2[i][j] = m2[pivot][j];\n\t\t\t\t\tm2[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t\tA d = m1[i][i];\n\t\t\tres = mul.g(res, d);\n\t\t\td = mul.inv(d);\n\t\t\tm1[i][i] = one;\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tm1[i][j] = mul.g(m1[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tm2[i][j] = mul.g(m2[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (i == j)\n\t\t\t\t\tcontinue;\n\t\t\t\tA mult = m1[j][i];\n\t\t\t\tm1[j][i] = zero;\n\t\t\t\tfor (int k = i + 1; k < n; k++) {\n\t\t\t\t\tm1[j][k] = add.g(m1[j][k], add.inv(mul.g(m1[i][k], mult)));\n\t\t\t\t}\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tm2[j][k] = add.g(m2[j][k], add.inv(mul.g(m2[i][k], mult)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn UP.make(sign == 1 ? res : add.inv(res), make(m2));\n\t}\n\n\tprivate static UP> detInvLong(MN a, Field field) {\n\t\tif (a.m != a.n)\n\t\t\tthrow new IllegalArgumentException(\"matrix not square\");\n\t\tint n = a.n;\n\t\tAbelianGroup add = field.add();\n\t\tAbelianGroup mul = field.mul();\n\t\tlong zero = field.zero();\n\t\tlong one = field.one();\n\t\tlong[][] m1 = a.toLongArray();\n\t\tlong[][] m2 = eye(n, field).toLongArray();\n\t\tlong res = one;\n\t\tint sign = 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint pivot = -1;\n\t\t\tfor (int j = i; j < n; j++) {\n\t\t\t\tif (m1[j][i] != zero) {\n\t\t\t\t\tpivot = j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (pivot == -1) {\n\t\t\t\treturn UP.make(zero, null);\n\t\t\t}\n\t\t\tif (pivot != i) {\n\t\t\t\tsign = -sign;\n\t\t\t\tlong tmp;\n\t\t\t\tfor (int j = i; j < n; j++) { // [0, i) are zero\n\t\t\t\t\ttmp = m1[i][j];\n\t\t\t\t\tm1[i][j] = m1[pivot][j];\n\t\t\t\t\tm1[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\ttmp = m2[i][j];\n\t\t\t\t\tm2[i][j] = m2[pivot][j];\n\t\t\t\t\tm2[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong d = m1[i][i];\n\t\t\tres = mul.g(res, d);\n\t\t\td = mul.inv(d);\n\t\t\tm1[i][i] = one;\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tm1[i][j] = mul.g(m1[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tm2[i][j] = mul.g(m2[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (i == j)\n\t\t\t\t\tcontinue;\n\t\t\t\tlong mult = m1[j][i];\n\t\t\t\tm1[j][i] = zero;\n\t\t\t\tfor (int k = i + 1; k < n; k++) {\n\t\t\t\t\tm1[j][k] = add.g(m1[j][k], add.inv(mul.g(m1[i][k], mult)));\n\t\t\t\t}\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tm2[j][k] = add.g(m2[j][k], add.inv(mul.g(m2[i][k], mult)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn UP.make(sign == 1 ? res : add.inv(res), make(m2));\n\t}\n\n\tstatic Ring> ring(int n, Ring ring) {\n\t\treturn Ring.make(add(n, n, ring), mulRing(n, ring));\n\t}\n\n\tstatic Field> field(int n, Field field) {\n\t\treturn Field.make(add(n, n, field), mulField(n, field));\n\t}\n\n\tstatic VM> vm(int n, Ring ring) {\n\t\tif (ring instanceof Field)\n\t\t\treturn vmField(n, (Field) ring);\n\t\treturn vmRing(n, ring);\n\t}\n\n\tprivate static VM> vmRing(int n, Ring ring) {\n\t\tRing> matRing = ring(n, ring);\n\t\tMonoid> matMul = matRing.mul();\n\t\tAbelianGroup add = ring.add();\n\t\tMonoid mul = ring.mul();\n\t\tA zero = add.e();\n\t\tA one = mul.e();\n\t\treturn new VM>(matRing, null, null, (a, b) -> {\n\t\t\tif (b instanceof MN.Scalar) {\n\t\t\t\tMN.Scalar bs = ((MN.Scalar) b);\n\t\t\t\tif (bs.l < 0)\n\t\t\t\t\tthrow new RuntimeException(\"pow(MN, <0) is not defined\");\n\t\t\t\treturn Alg.pow(a, bs.l, matMul);\n\t\t\t}\n\t\t\tthrow new RuntimeException(\"pow(MN, MN) is not defined\");\n\t\t}, null, l -> make(n, n, l, zero, Alg.pow(one, l, add)), a -> a);\n\t}\n\n\tprivate static VM> vmField(int n, Field field) {\n\t\tField> matField = field(n, field);\n\t\tAbelianGroup> matMul = matField.mul();\n\t\tA zero = field.zero();\n\t\tA one = field.one();\n\t\treturn new VM>(matField, (a, b) -> {\n\t\t\tif (b instanceof MN.Scalar) {\n\t\t\t\tMN.Scalar bs = ((MN.Scalar) b);\n\t\t\t\tif (bs.l < 0)\n\t\t\t\t\treturn Alg.pow(inv(a, field), -bs.l, matMul);\n\t\t\t\treturn Alg.pow(a, bs.l, matMul);\n\t\t\t}\n\t\t\tthrow new RuntimeException(\"pow(MN, MN) is not defined\");\n\t\t}, a -> inv(a, field), l -> make(n, n, l, zero, Alg.pow(one, l, field.add())), a -> a);\n\t}\n}\n\nclass VM {\n\tprivate final HashMap env;\n\tprivate final Evaluator etor;\n\tprivate final F.XX filter;\n\n\tVM(F.XXX add, F.XXX sub, F.XXX mul, F.XXX div, F.XXX mod,\n\t\t\tF.XXX pow, F.XX neg, F.XX fact, F.LX fromInt, F.XX filter) {\n\t\tenv = new HashMap();\n\t\tetor = SimpleLang.makeEvaluator((s, a) -> {\n\t\t\tenv.put(s, a);\n\t\t\treturn a;\n\t\t}, add, sub, mul, div, mod, pow, neg, fact, fromInt, s -> {\n\t\t\tif (env.containsKey(s))\n\t\t\t\treturn env.get(s);\n\t\t\tthrow new RuntimeException(\"no such variable: \" + s);\n\t\t});\n\t\tthis.filter = filter;\n\t}\n\n\tVM(Ring ring, F.XXX div, F.XXX mod, F.XXX pow, F.XX fact, F.LX fromInt,\n\t\t\tF.XX filter) {\n\t\tthis(ring.add()::g, (a, b) -> ring.add().g(a, ring.add().inv(b)), ring.mul()::g, div, mod, pow, ring.add()::inv,\n\t\t\t\tfact, fromInt, filter);\n\t}\n\n\tVM(EuclideanRing ring, F.XXX pow, F.XX fact, F.LX fromInt, F.XX filter) {\n\t\tthis(ring, ring::div, ring::mod, pow, fact, fromInt, filter);\n\t}\n\n\tvoid clear() {\n\t\tenv.clear();\n\t}\n\n\tA get(String id) {\n\t\treturn env.get(id);\n\t}\n\n\tvoid print(String id, F.XV printer) {\n\t\tprinter.f(\"\" + get(id));\n\t}\n\n\t@SafeVarargs\n\tfinal void set(String idsSp, A... as) {\n\t\tString[] ids = idsSp.trim().split(\" +\");\n\t\tint n = ids.length;\n\t\tif (as.length != n)\n\t\t\tthrow new IllegalArgumentException(\"argument size mismatch: \" + n + \" != \" + as.length);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tset(ids[i], as[i]);\n\t}\n\n\tvoid set(String id, A a) {\n\t\tenv.put(id, filter.f(a));\n\t}\n\n\tA run(String expr) {\n\t\treturn AST.eval(SimpleLang.parse(expr), etor);\n\t}\n}\n\nclass AST { // Abstract Syntax Tree\n\tstatic class AssignOp extends AST {\n\t\tString id;\n\t\tAST r;\n\n\t\tAssignOp(String id, AST r) {\n\t\t\tthis.id = id;\n\t\t\tthis.r = r;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"Assign(\" + id + \", \" + r + \")\";\n\t\t}\n\t}\n\n\tstatic class Multi extends AST {\n\t\tArrayList as;\n\n\t\tMulti(ArrayList as) {\n\t\t\tthis.as = as;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\tString s = \"\";\n\t\t\tfor (AST a : as)\n\t\t\t\ts += s.isEmpty() ? a : \"; \" + a;\n\t\t\treturn \"Multi(\" + s + \")\";\n\t\t}\n\t}\n\n\tstatic class BinOp extends AST {\n\t\tAST l;\n\t\tAST r;\n\t\tString op;\n\n\t\tBinOp(AST l, String op, AST r) {\n\t\t\tthis.l = l;\n\t\t\tthis.op = op;\n\t\t\tthis.r = r;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"BinOp(\" + l + \", \" + op + \", \" + r + \")\";\n\t\t}\n\t}\n\n\tstatic class UnOp extends AST {\n\t\tAST a;\n\t\tString op;\n\n\t\tUnOp(String op, AST a) {\n\t\t\tthis.op = op;\n\t\t\tthis.a = a;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"UnOp(\" + op + \", \" + a + \")\";\n\t\t}\n\t}\n\n\tstatic class Int extends AST {\n\t\tlong v;\n\n\t\tInt(long v) {\n\t\t\tthis.v = v;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"Int(\" + v + \")\";\n\t\t}\n\t}\n\n\tstatic class Id extends AST {\n\t\tString s;\n\n\t\tId(String s) {\n\t\t\tthis.s = s;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"Id(\" + s + \")\";\n\t\t}\n\t}\n\n\tstatic A eval(AST a, Evaluator etor) {\n\t\tif (a instanceof AssignOp)\n\t\t\treturn etor.assign(((AssignOp) a).id, eval(((AssignOp) a).r, etor));\n\t\tif (a instanceof Multi) {\n\t\t\tA last = null;\n\t\t\tfor (AST a2 : ((Multi) a).as)\n\t\t\t\tlast = eval(a2, etor);\n\t\t\treturn last;\n\t\t}\n\t\tif (a instanceof BinOp)\n\t\t\treturn etor.binOp(((BinOp) a).op, eval(((BinOp) a).l, etor), eval(((BinOp) a).r, etor));\n\t\tif (a instanceof UnOp)\n\t\t\treturn etor.unOp(((UnOp) a).op, eval(((UnOp) a).a, etor));\n\t\tif (a instanceof Int)\n\t\t\treturn etor.fromInt(((Int) a).v);\n\t\tif (a instanceof Id)\n\t\t\treturn etor.id(((Id) a).s);\n\t\tthrow new RuntimeException(\"unexpected ast: \" + a);\n\t}\n}\n\ninterface Evaluator {\n\tA assign(String s, A a);\n\n\tA binOp(String op, A a, A b);\n\n\tA unOp(String op, A a);\n\n\tA fromInt(long a);\n\n\tA id(String s);\n}\n\nclass Seq {\n\tArrayList as;\n\tint ptr;\n\n\tSeq(ArrayList as) {\n\t\tthis.as = as;\n\t\tptr = 0;\n\t}\n\n\tboolean hasNext(int num) {\n\t\treturn ptr + num < as.size();\n\t}\n\n\tboolean hasNext() {\n\t\treturn hasNext(0);\n\t}\n\n\tA next(int num) {\n\t\treturn ptr + num < as.size() ? as.get(ptr + num) : null;\n\t}\n\n\tA next() {\n\t\treturn next(0);\n\t}\n\n\tA read() {\n\t\treturn hasNext() ? as.get(ptr++) : null;\n\t}\n\n\tA read(A a) {\n\t\tif (!hasNext())\n\t\t\tthrow new RuntimeException(\"unexpected EOF\");\n\t\tif (!isNext(a))\n\t\t\tthrow new RuntimeException(\"expected \" + a + \" but got\" + next());\n\t\treturn read();\n\t}\n\n\tA read(F.XX f) {\n\t\tif (!hasNext())\n\t\t\tthrow new RuntimeException(\"unexpected EOF\");\n\t\tif (!f.f(next()))\n\t\t\tthrow new RuntimeException(\"f(\" + next() + \") returned false\");\n\t\treturn read();\n\t}\n\n\tboolean isNext(A a) {\n\t\treturn a.equals(next());\n\t}\n\n\tboolean isNext(@SuppressWarnings(\"unchecked\") A... as) {\n\t\tfor (A a : as)\n\t\t\tif (isNext(a))\n\t\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tboolean isNext(F.XX f) {\n\t\treturn hasNext() && f.f(next());\n\t}\n\n\tA readIf(F.XX f) {\n\t\tif (isNext(f))\n\t\t\treturn read();\n\t\treturn null;\n\t}\n\n\tA readIf(@SuppressWarnings(\"unchecked\") A... as) {\n\t\tfor (A a : as)\n\t\t\tif (isNext(a)) {\n\t\t\t\tptr++;\n\t\t\t\treturn a;\n\t\t\t}\n\t\treturn null;\n\t}\n\n\tpublic String toString() {\n\t\treturn as.toString();\n\t}\n}\n\nclass Token extends P {\n\tprivate static final int ID = 1;\n\tprivate static final int SYM = 2;\n\tprivate static final int INT = 3;\n\n\tToken(String s, int type) {\n\t\tsuper(s, type);\n\t}\n\n\tboolean is(String s) {\n\t\treturn a.equals(s);\n\t}\n\n\tstatic Token ofId(String s) {\n\t\treturn new Token(s, ID);\n\t}\n\n\tstatic Token ofSym(String s) {\n\t\treturn new Token(s, SYM);\n\t}\n\n\tstatic Token ofInt(String s) {\n\t\treturn new Token(s, INT);\n\t}\n\n\tboolean isId() {\n\t\treturn b == ID;\n\t}\n\n\tboolean isSym() {\n\t\treturn b == SYM;\n\t}\n\n\tboolean isInt() {\n\t\treturn b == INT;\n\t}\n}\n\nclass SimpleLang {\n\tprivate static class Tokenizer {\n\t\tprivate static final String SYMS = \"+-*/%^!()=;\";\n\n\t\tSeq sc;\n\t\tArrayList ts;\n\n\t\tTokenizer(String s) {\n\t\t\tsc = new Seq(U.make(s.length(), i -> s.charAt(i)));\n\t\t}\n\n\t\tSeq parse() {\n\t\t\tts = new ArrayList();\n\t\t\tparseAll();\n\t\t\treturn new Seq(ts);\n\t\t}\n\n\t\tprivate static boolean isSpace(char c) {\n\t\t\treturn c == ' ' || c == '\\t' || c == '\\r' || c == '\\n';\n\t\t}\n\n\t\tprivate static boolean isDigit(char c) {\n\t\t\treturn c >= '0' && c <= '9';\n\t\t}\n\n\t\tprivate static boolean isSymbol(char c) {\n\t\t\treturn SYMS.indexOf(c) != -1;\n\t\t}\n\n\t\tprivate static boolean isAlpha(char c) {\n\t\t\treturn c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z' || c == '_';\n\t\t}\n\n\t\tprivate void parseAll() {\n\t\t\twhile (sc.hasNext()) {\n\t\t\t\twhile (sc.isNext(Tokenizer::isSpace))\n\t\t\t\t\tsc.read();\n\t\t\t\tif (!sc.hasNext())\n\t\t\t\t\tbreak;\n\t\t\t\tif (sc.isNext(Tokenizer::isAlpha)) {\n\t\t\t\t\tparseId();\n\t\t\t\t} else if (sc.isNext(Tokenizer::isDigit)) {\n\t\t\t\t\tparseInt();\n\t\t\t\t} else if (sc.isNext(Tokenizer::isSymbol)) {\n\t\t\t\t\tparseSym();\n\t\t\t\t} else {\n\t\t\t\t\tthrow new RuntimeException(\"invalid character: \" + sc.next());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprivate void parseId() {\n\t\t\tString s = sc.read().toString();\n\t\t\twhile (sc.isNext(Tokenizer::isAlpha) || sc.isNext(Tokenizer::isDigit))\n\t\t\t\ts += sc.read().toString();\n\t\t\tts.add(Token.ofId(s));\n\t\t}\n\n\t\tprivate void parseInt() {\n\t\t\tString s = sc.read().toString();\n\t\t\twhile (sc.isNext(Tokenizer::isDigit))\n\t\t\t\ts += sc.read().toString();\n\t\t\tts.add(Token.ofInt(s));\n\t\t}\n\n\t\tprivate void parseSym() {\n\t\t\tString s = sc.read().toString();\n\t\t\tts.add(Token.ofSym(s));\n\t\t}\n\t}\n\n\tprivate static class Parser {\n\t\tSeq ts;\n\n\t\tParser(Seq ts) {\n\t\t\tthis.ts = ts;\n\t\t}\n\n\t\tAST parse() {\n\t\t\treturn parseExpr();\n\t\t}\n\n\t\tprivate AST parseExpr() {\n\t\t\treturn parseMultiExpr();\n\t\t}\n\n\t\tprivate AST parseMultiExpr() {\n\t\t\treadSemicolons();\n\t\t\tAST a = parseAssignExpr();\n\t\t\tif (readSemicolons()) {\n\t\t\t\tArrayList as = new ArrayList();\n\t\t\t\tas.add(a);\n\t\t\t\tdo {\n\t\t\t\t\tif (!ts.hasNext())\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tas.add(parseAssignExpr());\n\t\t\t\t} while (readSemicolons());\n\t\t\t\tif (as.size() == 1)\n\t\t\t\t\treturn a;\n\t\t\t\treturn new AST.Multi(as);\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate boolean readSemicolons() {\n\t\t\tif (!ts.isNext(t -> t.is(\";\")))\n\t\t\t\treturn false;\n\t\t\tdo {\n\t\t\t\tts.read();\n\t\t\t} while (ts.isNext(t -> t.is(\";\")));\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate AST parseAssignExpr() {\n\t\t\tAST a = parseAddSubOp();\n\t\t\tif (ts.isNext(t -> t.is(\"=\"))) {\n\t\t\t\tts.read();\n\t\t\t\tif (!(a instanceof AST.Id))\n\t\t\t\t\tthrow new RuntimeException(\"cannot assign to \" + a);\n\t\t\t\treturn new AST.AssignOp(((AST.Id) a).s, parseAssignExpr());\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parseAddSubOp() {\n\t\t\tAST a = parseMulDivModOp();\n\t\t\twhile (ts.isNext(t -> t.is(\"+\") || t.is(\"-\")))\n\t\t\t\ta = new AST.BinOp(a, ts.read().a, parseMulDivModOp());\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parseMulDivModOp() {\n\t\t\tAST a = parsePowOp();\n\t\t\twhile (ts.isNext(t -> t.is(\"*\") || t.is(\"/\") || t.is(\"%\")))\n\t\t\t\ta = new AST.BinOp(a, ts.read().a, parsePowOp());\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parsePowOp() {\n\t\t\tAST a = parseNegateOp();\n\t\t\tif (ts.isNext(t -> t.is(\"^\")))\n\t\t\t\treturn new AST.BinOp(a, ts.read().a, parsePowOp());\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parseNegateOp() {\n\t\t\tif (ts.isNext(t -> t.is(\"-\")))\n\t\t\t\treturn new AST.UnOp(ts.read().a, parseNegateOp());\n\t\t\treturn parseFactOp();\n\t\t}\n\n\t\tprivate AST parseFactOp() {\n\t\t\tAST a = parsePrimary();\n\t\t\twhile (ts.isNext(t -> t.is(\"!\")))\n\t\t\t\ta = new AST.UnOp(ts.read().a, a);\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parsePrimary() {\n\t\t\tif (ts.isNext(t -> t.isId()))\n\t\t\t\treturn new AST.Id(ts.read().a);\n\t\t\tif (ts.isNext(t -> t.isInt()))\n\t\t\t\treturn new AST.Int(Long.parseLong(ts.read().a));\n\t\t\tif (ts.readIf(t -> t.is(\"(\")) != null) {\n\t\t\t\tAST e = parseExpr();\n\t\t\t\tts.read(t -> t.is(\")\"));\n\t\t\t\treturn e;\n\t\t\t}\n\t\t\tthrow new RuntimeException(\"unexpected token: \" + ts.next());\n\t\t}\n\t}\n\n\tstatic HashMap cache = new HashMap();\n\n\tstatic Evaluator makeEvaluator(F.XXX assign, F.XXX add, F.XXX sub,\n\t\t\tF.XXX mul, F.XXX div, F.XXX mod, F.XXX pow, F.XX neg,\n\t\t\tF.XX fact, F.LX fromInt, F.XX id) {\n\t\treturn new Evaluator() {\n\t\t\tpublic A assign(String s, A a) {\n\t\t\t\treturn assign.f(s, a);\n\t\t\t}\n\n\t\t\tpublic A binOp(String op, A a, A b) {\n\t\t\t\tswitch (op) {\n\t\t\t\tcase \"+\":\n\t\t\t\t\treturn add.f(a, b);\n\t\t\t\tcase \"-\":\n\t\t\t\t\treturn sub.f(a, b);\n\t\t\t\tcase \"*\":\n\t\t\t\t\treturn mul.f(a, b);\n\t\t\t\tcase \"/\":\n\t\t\t\t\treturn div.f(a, b);\n\t\t\t\tcase \"%\":\n\t\t\t\t\treturn mod.f(a, b);\n\t\t\t\tcase \"^\":\n\t\t\t\t\treturn pow.f(a, b);\n\t\t\t\t}\n\t\t\t\tthrow new RuntimeException(\"invalid binOp: \" + op);\n\t\t\t}\n\n\t\t\tpublic A unOp(String op, A a) {\n\t\t\t\tswitch (op) {\n\t\t\t\tcase \"-\":\n\t\t\t\t\treturn neg.f(a);\n\t\t\t\tcase \"!\":\n\t\t\t\t\treturn fact.f(a);\n\t\t\t\t}\n\t\t\t\tthrow new RuntimeException(\"invalid unOp: \" + op);\n\t\t\t}\n\n\t\t\tpublic A fromInt(long a) {\n\t\t\t\treturn fromInt.f(a);\n\t\t\t}\n\n\t\t\tpublic A id(String s) {\n\t\t\t\treturn id.f(s);\n\t\t\t}\n\t\t};\n\t}\n\n\tstatic AST parse(String s) {\n\t\tif (cache.containsKey(cache)) {\n\t\t\treturn cache.get(s);\n\t\t}\n\t\tTokenizer l = new Tokenizer(s);\n\t\tSeq ts = l.parse();\n\t\tParser p = new Parser(ts);\n\t\tAST a = p.parse();\n\t\tcache.put(s, a);\n\t\treturn a;\n\t}\n}\n\nclass Mod {\n\tfinal long mod;\n\tfinal AbelianGroup add;\n\tfinal AbelianGroup mul;\n\tfinal Field field;\n\tfinal VM vm;\n\tprivate final boolean prime;\n\tprivate final HashMap logMap;\n\tprivate long[] facts;\n\tprivate long[] invs;\n\tprivate long[] invFacts;\n\tprivate long[] factors;\n\n\tMod(long mod) {\n\t\tthis.mod = mod;\n\t\tprepareFacts(0);\n\t\tprime = BigInteger.valueOf(mod).isProbablePrime(100);\n\t\tadd = AbelianGroup.make((a, b) -> (a + b) % mod, a -> mod - a, 0l);\n\t\tmul = AbelianGroup.make((a, b) -> (a * b) % mod, a -> {\n\t\t\tif (prime)\n\t\t\t\treturn pow(a, mod - 2);\n\t\t\tTL t = Alg.extgcd(a, mod);\n\t\t\tif (t.c != 1)\n\t\t\t\tthrow new ArithmeticException(\"inv(\" + a + \") does not exist\");\n\t\t\treturn (t.a % mod + mod) % mod;\n\t\t}, 1l);\n\t\tfield = Field.make(add, mul);\n\t\tlogMap = new HashMap();\n\t\tvm = new VM(field, this::pow, this::fact, a -> (a % mod + mod) % mod, a -> (a % mod + mod) % mod);\n\t}\n\n\tlong fact(long a) {\n\t\tif (a >= Integer.MAX_VALUE)\n\t\t\tthrow new RuntimeException(\"fact(\" + a + \") too big\");\n\t\tprepareFacts((int) a);\n\t\treturn facts[(int) (a % mod)];\n\t}\n\n\tlong invFact(int a) {\n\t\tprepareFacts(a);\n\t\treturn invFacts[(int) (a % mod)];\n\t}\n\n\tlong inv(long a) {\n\t\treturn mul.inv(a);\n\t}\n\n\tlong pow(long a, long b) {\n\t\tif (b == 0)\n\t\t\treturn 1;\n\t\tif (b == 1)\n\t\t\treturn a;\n\t\tif (b < 0) {\n\t\t\ta = inv(a);\n\t\t\tb = -b;\n\t\t}\n\t\ta %= mod;\n\t\tlong res = 1;\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) != 0)\n\t\t\t\tres = res * a % mod;\n\t\t\ta = a * a % mod;\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tlong order(long a) { // computes the order of `a` in O(sqrt(mod)) time\n\t\ta %= mod;\n\t\tif (a == 0)\n\t\t\treturn 0;\n\t\tif (a == 1)\n\t\t\treturn 1;\n\t\tif (factors == null) {\n\t\t\tArrayList fs = new ArrayList();\n\t\t\tfor (long i = 2; i * i < mod; i++) {\n\t\t\t\tif ((mod - 1) % i == 0)\n\t\t\t\t\tfs.add(i);\n\t\t\t}\n\t\t\tfactors = new long[fs.size()];\n\t\t\tfor (int i = 0; i < fs.size(); i++) {\n\t\t\t\tfactors[i] = fs.get(i);\n\t\t\t}\n\t\t}\n\t\tfor (long f : factors) {\n\t\t\tif (pow(a, f) == 1)\n\t\t\t\treturn f;\n\t\t}\n\t\treturn mod - 1;\n\t}\n\n\tPL log(long a, long b) { // log_b(a) in O(sqrt(mod)) time\n\t\ta %= mod;\n\t\tb %= mod;\n\t\tif (b == 1 || b == 0)\n\t\t\treturn a == b ? PL.make(1, 1) : PL.make(-1, 0);\n\t\tif (a == 0)\n\t\t\treturn PL.make(-1, 0);\n\t\tlong order = order(b);\n\t\tif (a == 1)\n\t\t\treturn PL.make(0, order);\n\t\tlong orderSqrtL = sqrtCeil(order);\n\t\tif (orderSqrtL > Integer.MAX_VALUE)\n\t\t\tthrow new RuntimeException(\"order(\" + b + \") too big: \" + order);\n\t\tint orderSqrt = (int) sqrtCeil(order);\n\t\tlogMap.clear();\n\t\tlogMap.put(1l, 0);\n\t\tlong p = 1;\n\t\tfor (int i = 1; i < orderSqrt; i++) {\n\t\t\tp = p * b % mod;\n\t\t\tlogMap.put(p, i);\n\t\t}\n\t\tlong ib = pow(b, mod - orderSqrt - 1);\n\t\tp = a;\n\t\tfor (int i = 1; i < orderSqrt; i++) {\n\t\t\tp = p * ib % mod;\n\t\t\tif (logMap.containsKey(p))\n\t\t\t\treturn PL.make((i * orderSqrt + logMap.get(p)) % order, order);\n\t\t}\n\t\treturn PL.make(-1, 0);\n\t}\n\n\tprivate long sqrtCeil(long a) {\n\t\treturn U.searchL((long) Math.sqrt(a * 0.9), (long) Math.sqrt(a * 1.1) + 1, mid -> mid * mid >= a);\n\t}\n\n\tprivate void prepareFacts(int n) {\n\t\tif (facts == null) {\n\t\t\tfacts = new long[1024];\n\t\t\tinvs = new long[1024];\n\t\t\tinvFacts = new long[1024];\n\t\t\tprepareFactsIn(0, 1024);\n\t\t}\n\t\tif (n >= mod)\n\t\t\tn = (int) (mod - 1);\n\t\twhile (facts.length <= n) {\n\t\t\tint prevL = facts.length;\n\t\t\tint newL = prevL << 1;\n\t\t\tfacts = Arrays.copyOf(facts, newL);\n\t\t\tinvs = Arrays.copyOf(invs, newL);\n\t\t\tinvFacts = Arrays.copyOf(invFacts, newL);\n\t\t\tprepareFactsIn(prevL, newL);\n\t\t}\n\t}\n\n\tprivate void prepareFactsIn(int from, int until) {\n\t\tif (until > mod)\n\t\t\tuntil = (int) mod;\n\t\tfor (int i = from; i < until; i++) {\n\t\t\tif (i == 0) {\n\t\t\t\tfacts[0] = 1;\n\t\t\t\tinvs[0] = 0;\n\t\t\t\tinvFacts[0] = 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (i == 1) {\n\t\t\t\tfacts[1] = 1;\n\t\t\t\tinvs[1] = 1;\n\t\t\t\tinvFacts[1] = 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfacts[i] = facts[i - 1] * i % mod;\n\t\t\tinvs[i] = (mod - mod / i) * invs[(int) (mod % i)] % mod;\n\t\t\tinvFacts[i] = invFacts[i - 1] * invs[i] % mod;\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1577066635, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02831.html", "problem_id": "p02831", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02831/input.txt", "sample_output_relpath": "derived/input_output/data/p02831/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02831/Java/s956302522.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s956302522", "user_id": "u160281075"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.lang.reflect.Array;\nimport java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.Map.Entry;\nimport java.util.NoSuchElementException;\nimport java.util.Set;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\npublic class Main {\n\tprivate static void solve() {\n\t\tlong a = ni();\n\t\tlong b = ni();\n\t\tout(a * b / Alg.gcd(a, b));\n\t}\n\n\tstatic int min(int a, int b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic long min(long a, long b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic > A min(A a, A b) {\n\t\treturn a.compareTo(b) < 0 ? a : b;\n\t}\n\n\tstatic int max(int a, int b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic long max(long a, long b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic > A max(A a, A b) {\n\t\treturn a.compareTo(b) > 0 ? a : b;\n\t}\n\n\tstatic int clamp(int a, int min, int max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic long clamp(long a, long min, long max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic int abs(int a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic long abs(long a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic > A clamp(A a, A min, A max) {\n\t\treturn a.compareTo(min) < 0 ? min : a.compareTo(max) > 0 ? max : a;\n\t}\n\n\tstatic void out(String val) {\n\t\tIO.out(val);\n\t}\n\n\tstatic void out(Object val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(int val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(long val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(char val) {\n\t\tIO.out(String.valueOf(val));\n\t}\n\n\tstatic void out(double val) {\n\t\tIO.out(Double.isFinite(val) ? BigDecimal.valueOf(val).toPlainString() : String.valueOf(val));\n\t}\n\n\tstatic void out(boolean val) {\n\t\tIO.out(val ? \"true\" : \"false\");\n\t}\n\n\tstatic void outn(String val) {\n\t\tIO.outn(val);\n\t}\n\n\tstatic void outn(Object val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(int val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(long val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(char val) {\n\t\tIO.outn(String.valueOf(val));\n\t}\n\n\tstatic void outn(double val) {\n\t\tIO.outn(Double.isFinite(val) ? BigDecimal.valueOf(val).toPlainString() : String.valueOf(val));\n\t}\n\n\tstatic void outn(boolean val) {\n\t\tIO.outn(val ? \"true\" : \"false\");\n\t}\n\n\tstatic void kil(String val) {\n\t\tIO.out(val);\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(Object val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(int val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(long val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(char val) {\n\t\tIO.out(String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(double val) {\n\t\tIO.out(Double.isFinite(val) ? BigDecimal.valueOf(val).toPlainString() : String.valueOf(val));\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic void kil(boolean val) {\n\t\tIO.out(val ? \"true\" : \"false\");\n\t\tIO.flush();\n\t\tSystem.exit(0);\n\t}\n\n\tstatic String ns() {\n\t\treturn IO.next();\n\t}\n\n\tstatic int ni() {\n\t\treturn IO.nextInt();\n\t}\n\n\tstatic long nl() {\n\t\treturn IO.nextLong();\n\t}\n\n\tstatic double nd() {\n\t\treturn IO.nextDouble();\n\t}\n\n\tstatic char nc() {\n\t\treturn IO.nextChar();\n\t}\n\n\tstatic String[] nss(int n) {\n\t\tString[] as = new String[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.next();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic int[] nis(int n) {\n\t\tint[] as = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextInt();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic long[] nls(int n) {\n\t\tlong[] as = new long[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextLong();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic double[] nds(int n) {\n\t\tdouble[] as = new double[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextDouble();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic char[] ncs(int n) {\n\t\tchar[] as = new char[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tas[i] = IO.nextChar();\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic String[][] nss2(int n, int m) {\n\t\tString[][] as = new String[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.next();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic int[][] nis2(int n, int m) {\n\t\tint[][] as = new int[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextInt();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic long[][] nls2(int n, int m) {\n\t\tlong[][] as = new long[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextLong();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic double[][] nds2(int n, int m) {\n\t\tdouble[][] as = new double[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextDouble();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic char[][] ncs2(int n, int m) {\n\t\tchar[][] as = new char[n][m];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tas[i][j] = IO.nextChar();\n\t\t\t}\n\t\t}\n\t\treturn as;\n\t}\n\n\tstatic int parseInt(String val) {\n\t\treturn Integer.parseInt(val);\n\t}\n\n\tstatic long parseLong(String val) {\n\t\treturn Long.parseLong(val);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\ttry {\n\t\t\tsolve();\n\t\t\tIO.flush();\n\t\t} catch (NumberFormatException e) {\n\t\t\te.printStackTrace();\n\t\t} catch (OutOfMemoryError e) {\n\t\t\te.printStackTrace(); // this will be detected as RE\n\t\t}\n\t}\n}\n\nfinal class IO {\n\tprivate static final InputStream in = System.in;\n\tprivate static final PrintWriter out = new PrintWriter(System.out, false);\n\tprivate static final byte[] buffer = new byte[1024];\n\tprivate static int ptr = 0;\n\tprivate static int len = 0;\n\n\tprivate static boolean hasNextByte() {\n\t\tif (ptr < len)\n\t\t\treturn true;\n\t\tptr = 0;\n\t\ttry {\n\t\t\tlen = in.read(buffer);\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn len > 0;\n\t}\n\n\tprivate static int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tstatic boolean hasNext() {\n\t\tbyte c;\n\t\twhile (hasNextByte() && ((c = buffer[ptr]) < '!' || c > '~'))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tstatic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (b >= '!' && b <= '~') {\n\t\t\tsb.append((char) b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tstatic char nextChar() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\treturn (char) readByte();\n\t}\n\n\tstatic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tint sign = 1;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tsign = -1;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b)\n\t\t\tthrow new NumberFormatException();\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9')\n\t\t\t\tn = n * 10 + b - '0';\n\t\t\telse if (b == -1 || b < '!' || b > '~')\n\t\t\t\treturn n * sign;\n\t\t\telse\n\t\t\t\tthrow new NumberFormatException();\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tstatic int nextInt() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tint n = 0;\n\t\tint sign = 1;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tsign = -1;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b)\n\t\t\tthrow new NumberFormatException();\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9')\n\t\t\t\tn = n * 10 + b - '0';\n\t\t\telse if (b == -1 || b < '!' || b > '~')\n\t\t\t\treturn n * sign;\n\t\t\telse\n\t\t\t\tthrow new NumberFormatException();\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tstatic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tstatic void out(String val) {\n\t\tout.println(val);\n\t}\n\n\tstatic void outn(String val) {\n\t\tout.print(val);\n\t}\n\n\tstatic void flush() {\n\t\tout.flush();\n\t}\n}\n\n// TODO: paste library here\n\nclass MS {\n\tprivate TreeMap tm;\n\n\tMS() {\n\t\ttm = new TreeMap();\n\t}\n\n\tMS(Comparator comp) {\n\t\ttm = new TreeMap(comp);\n\t}\n\n\tvoid add(A a, long num) {\n\t\tif (tm.containsKey(a))\n\t\t\ttm.put(a, tm.get(a) + num);\n\t\telse\n\t\t\ttm.put(a, num);\n\t}\n\n\tvoid add(A a) {\n\t\tadd(a, 1);\n\t}\n\n\tlong remove(A a, long num) {\n\t\tif (tm.containsKey(a)) {\n\t\t\tlong n = tm.get(a);\n\t\t\tif (n <= num) {\n\t\t\t\ttm.remove(a);\n\t\t\t\treturn n;\n\t\t\t}\n\t\t\ttm.put(a, n - num);\n\t\t\treturn num;\n\t\t}\n\t\treturn 0;\n\t}\n\n\tboolean remove(A a) {\n\t\treturn remove(a, 1) == 1;\n\t}\n\n\tlong removeAll(A a) {\n\t\treturn remove(a, Long.MAX_VALUE);\n\t}\n\n\tlong num(A a) {\n\t\treturn tm.containsKey(a) ? tm.get(a) : 0;\n\t}\n\n\tint size() {\n\t\treturn tm.size();\n\t}\n\n\tA floor(A a) {\n\t\treturn tm.floorKey(a);\n\t}\n\n\tUP floorNum(A a) {\n\t\tEntry e = tm.floorEntry(a);\n\t\treturn e == null ? null : UP.make(e.getKey(), e.getValue());\n\t}\n\n\tA ceil(A a) {\n\t\treturn tm.ceilingKey(a);\n\t}\n\n\tUP ceilNum(A a) {\n\t\tEntry e = tm.ceilingEntry(a);\n\t\treturn e == null ? null : UP.make(e.getKey(), e.getValue());\n\t}\n\n\tvoid clear() {\n\t\ttm.clear();\n\t}\n\n\tSet keySet() {\n\t\treturn tm.keySet();\n\t}\n\n\tCollection valueSet() {\n\t\treturn tm.values();\n\t}\n\n\tSet> entrySet() {\n\t\treturn tm.entrySet();\n\t}\n\n\tpublic String toString() {\n\t\treturn tm.toString();\n\t}\n}\n\nclass WUF { // Weighted Union Find Tree\n\tprivate int[] parents;\n\tprivate int[] ranks;\n\tprivate ArrayList roots;\n\tprivate ArrayList weights;\n\tprivate F.XXX merger;\n\tprivate F.XXX add;\n\tprivate F.XX inv;\n\tprivate W e;\n\n\tWUF(int n, F.IX maker, F.XXX merger, F.XXX add, F.XX inv, W e) {\n\t\tthis.merger = merger;\n\t\tthis.add = add;\n\t\tthis.inv = inv;\n\t\tthis.e = e;\n\t\tparents = new int[n];\n\t\tranks = new int[n];\n\t\troots = U.make(n, maker);\n\t\tweights = U.make(n, i -> e);\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tparents[i] = i;\n\t\t}\n\t}\n\n\tint index(int i) {\n\t\tint p = parents[i];\n\t\tif (i == p) {\n\t\t\treturn i;\n\t\t}\n\t\tint r = index(p);\n\t\tweights.set(i, add.f(weights.get(i), weights.get(p)));\n\t\treturn parents[i] = r;\n\t}\n\n\tboolean same(int i, int j) {\n\t\treturn index(i) == index(j);\n\t}\n\n\tA root(int i) {\n\t\treturn roots.get(index(i));\n\t}\n\n\tW weight(int i) {\n\t\tindex(i);\n\t\treturn weights.get(i);\n\t}\n\n\tW diff(int i, int j) {\n\t\treturn sub(weight(j), weight(i));\n\t}\n\n\tvoid unite(int i, int j, W w) {\n\t\tw = add(w, weight(i));\n\t\tw = sub(w, weight(j));\n\t\ti = index(i);\n\t\tj = index(j);\n\t\tif (i == j)\n\t\t\treturn;\n\t\tA r = merger.f(root(i), root(j));\n\t\tif (ranks[i] < ranks[j]) {\n\t\t\ti ^= j;\n\t\t\tj ^= i;\n\t\t\ti ^= j;\n\t\t\tw = inv.f(w);\n\t\t}\n\t\tparents[j] = i;\n\t\troots.set(i, r);\n\t\tif (ranks[i] == ranks[j])\n\t\t\tranks[i]++;\n\t\tweights.set(j, w);\n\t}\n\n\tprivate W add(W a, W b) {\n\t\treturn a == e ? b : b == e ? a : add.f(a, b);\n\t}\n\n\tprivate W sub(W a, W b) {\n\t\treturn b == e ? a : add(a, inv.f(b));\n\t}\n}\n\nclass PQ { // Priority Queue\n\tstatic class E { // Entry\n\t\tprivate Object a;\n\t\tprivate int index;\n\n\t\tprivate E(Object a, int index) {\n\t\t\tthis.a = a;\n\t\t\tthis.index = index;\n\t\t}\n\t}\n\n\tprivate int n;\n\tprivate E[] as;\n\tprivate Comparator comp;\n\n\tPQ(Comparator comp) {\n\t\tthis.comp = comp;\n\t\tas = new E[64];\n\t\tn = 1;\n\t}\n\n\tE add(A a) {\n\t\tE res = addEntry(a);\n\t\tfixUp(n - 1);\n\t\treturn res;\n\t}\n\n\tA pop() {\n\t\tint max = n - 1;\n\t\tif (max == 0)\n\t\t\treturn null;\n\t\tif (max == 1) {\n\t\t\treturn removeLast();\n\t\t}\n\n\t\tE tmp = as[1];\n\t\tas[1] = as[max];\n\t\tas[max] = tmp;\n\t\tas[1].index = 1;\n\t\tas[max].index = max;\n\n\t\tA res = removeLast();\n\t\tfixDown(1);\n\t\treturn res;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tA get(E e) {\n\t\treturn (A) e.a;\n\t}\n\n\tvoid remove(E e) {\n\t\tint k = ((E) e).index;\n\t\tint max = n - 1;\n\t\tif (k == max) {\n\t\t\tremoveLast();\n\t\t\treturn;\n\t\t}\n\n\t\tE tmp = as[k];\n\t\tas[k] = as[max];\n\t\tas[max] = tmp;\n\t\tas[k].index = k;\n\t\tas[max].index = max;\n\n\t\tremoveLast();\n\t\tif (!fixDown(k))\n\t\t\tfixUp(k);\n\t}\n\n\tvoid update(E e, A a) {\n\t\tint k = e.index;\n\t\tas[k].a = a;\n\t\tif (!fixDown(k))\n\t\t\tfixUp(k);\n\t}\n\n\tboolean isEmpty() {\n\t\treturn n == 1;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate A removeLast() {\n\t\tn--;\n\t\tE res = as[n];\n\t\tres.index = -1;\n\t\tas[n] = null;\n\t\treturn (A) res.a;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate boolean fixUp(int k) {\n\t\tboolean res = false;\n\t\twhile (k > 1) {\n\t\t\tint nk = k >> 1;\n\t\t\tif (comp.compare((A) as[k].a, (A) as[nk].a) < 0) {\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[nk];\n\t\t\t\tas[nk] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[nk].index = nk;\n\t\t\t\tk = nk;\n\t\t\t\tres = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\treturn res;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate boolean fixDown(int k) {\n\t\tboolean res = false;\n\t\twhile (k << 1 < n) {\n\t\t\tA a = (A) as[k].a;\n\t\t\tA l = (A) as[k << 1].a;\n\t\t\tif (k << 1 == n - 1) {\n\t\t\t\tif (comp.compare(a, l) <= 0)\n\t\t\t\t\tbreak;\n\t\t\t\tres = true;\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[k << 1];\n\t\t\t\tas[k << 1] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[k << 1].index = k << 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tA r = (A) as[k << 1 | 1].a;\n\t\t\tif (comp.compare(a, l) <= 0 && comp.compare(a, r) <= 0)\n\t\t\t\tbreak;\n\t\t\tres = true;\n\t\t\tif (comp.compare(l, r) < 0) {\n\t\t\t\tint nk = k << 1;\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[nk];\n\t\t\t\tas[nk] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[nk].index = nk;\n\t\t\t\tk = nk;\n\t\t\t} else {\n\t\t\t\tint nk = k << 1 | 1;\n\t\t\t\tE tmp = as[k];\n\t\t\t\tas[k] = as[nk];\n\t\t\t\tas[nk] = tmp;\n\t\t\t\tas[k].index = k;\n\t\t\t\tas[nk].index = nk;\n\t\t\t\tk = nk;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tprivate E addEntry(A a) {\n\t\tif (n == as.length)\n\t\t\tas = U.doubleSize(as);\n\t\treturn as[n] = new E(a, n++);\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tpublic String toString() {\n\t\tif (n == 1)\n\t\t\treturn \"[]\";\n\t\tString s = null;\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tA a = (A) as[i].a;\n\t\t\tif (s == null)\n\t\t\t\ts = \"[\" + a;\n\t\t\telse\n\t\t\t\ts += \", \" + a;\n\t\t}\n\t\treturn s + \"]\";\n\t}\n}\n\nclass G { // Graph\n\tprivate int vSize;\n\tprivate Object[] vs; // V\n\tprivate int numEdges;\n\tprivate Object[] allEdges; // UT\n\tprivate Object[] esFrom; // EdgeSet\n\tprivate Object[] esTo; // EdgeSet\n\tprivate Integer[] ints;\n\n\tprivate class EdgeSet {\n//\t\tHashMap map;\n\t\tInteger[] is;\n\t\tObject[] es;\n\t\tint size;\n\n\t\tEdgeSet() {\n\t\t\tis = new Integer[2];\n\t\t\tes = new Object[2];\n\t\t\tsize = 0;\n\t\t}\n\n//\t\t@SuppressWarnings(\"unchecked\")\n\t\tvoid add(Integer i, E e) {\n//\t\t\tif (size > 1600000) {\n//\t\t\t\tmap.put(i, e);\n//\t\t\t\tsize++;\n//\t\t\t\treturn;\n//\t\t\t}\n\t\t\tif (size == is.length) {\n\t\t\t\tis = Arrays.copyOf(is, size << 1);\n\t\t\t\tes = Arrays.copyOf(es, size << 1);\n\t\t\t}\n\t\t\tis[size] = i;\n\t\t\tes[size] = e;\n//\t\t\tif (++size > 1600000) {\n//\t\t\t\tmap = new HashMap();\n//\t\t\t\tfor (int j = 0; j < size; j++) {\n//\t\t\t\t\tmap.put(is[j], (E) es[j]);\n//\t\t\t\t}\n//\t\t\t\tis = null;\n//\t\t\t\tes = null;\n//\t\t\t}\n\t\t}\n\n\t\t@SuppressWarnings(\"unchecked\")\n\t\tvoid iter(F.IXV f) {\n//\t\t\tif (map == null)\n\t\t\tfor (int i = 0; i < size; i++)\n\t\t\t\tf.f(is[i], (E) es[i]);\n//\t\t\telse\n//\t\t\t\tfor (Entry e : map.entrySet())\n//\t\t\t\t\tf.f(e.getKey(), e.getValue());\n\t\t}\n\t}\n\n\tG() {\n\t\tvs = new Object[64];\n\t\tallEdges = new Object[64];\n\t\tesFrom = new Object[64];\n\t\tesTo = new Object[64];\n\t\tints = new Integer[64];\n\t\tvSize = 0;\n\t\tnumEdges = 0;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tV getV(int i) {\n\t\treturn i < 0 || i >= vs.length ? null : (V) vs[i];\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tArrayList getSortedVs() {\n\t\tArrayList res = new ArrayList();\n\t\tfor (int i = 0; i < vs.length; i++) {\n\t\t\tif (vs[i] != null)\n\t\t\t\tres.add((V) vs[i]);\n\t\t}\n\t\treturn res;\n\t}\n\n\tvoid addV(int i, V v) {\n\t\tif (getV(i) != null)\n\t\t\tthrow new RuntimeException(\"duplicate vtx: \" + i);\n\t\twhile (vs.length <= i) {\n\t\t\tvs = U.doubleSize(vs);\n\t\t\tints = U.doubleSize(ints);\n\t\t\tesFrom = U.doubleSize(esFrom);\n\t\t\tesTo = U.doubleSize(esTo);\n\t\t}\n\t\tvSize = U.max(vSize, i + 1);\n\t\tvs[i] = v;\n\t\tints[i] = Integer.valueOf(i);\n\t\tesFrom[i] = new EdgeSet();\n\t\tesTo[i] = new EdgeSet();\n\t}\n\n\tvoid setV(int i, V v) {\n\t\tif (getV(i) == null)\n\t\t\tthrow new RuntimeException(\"no such vtx: \" + i);\n\t\tvs[i] = v;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tvoid addE(int from, int to, E e) {\n\t\t((EdgeSet) esFrom[from]).add(ints[to], e);\n\t\t((EdgeSet) esTo[to]).add(ints[from], e);\n\t\tif (numEdges == allEdges.length) {\n\t\t\tallEdges = U.doubleSize(allEdges);\n\t\t}\n\t\tallEdges[numEdges++] = UT.make(from, to, e);\n\t}\n\n\tvoid addUE(int i, int j, E e) {\n\t\taddE(i, j, e);\n\t\taddE(j, i, e);\n\t}\n\n\t void dfs(int firstIdx, State firstS, F.XXXXX nextState,\n\t\t\tF.XXXV> visit) {\n\t\tArrayDeque> deque = new ArrayDeque>();\n\t\tsearch(firstIdx, firstS, nextState, visit, deque::push, deque::pop, deque::isEmpty);\n\t}\n\n\t void bfs(int firstIdx, State firstS, F.XXXXX nextState,\n\t\t\tF.XXXV> visit) {\n\t\tArrayDeque> deque = new ArrayDeque>();\n\t\tsearch(firstIdx, firstS, nextState, visit, deque::addLast, deque::pollFirst, deque::isEmpty);\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tArrayList> getEs() {\n\t\tArrayList> res = new ArrayList>();\n\t\tfor (int i = 0; i < numEdges; i++) {\n\t\t\tres.add((UT) allEdges[i]);\n\t\t}\n\t\treturn res;\n\t}\n\n\t/**\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t */\n\tArrayList> dijkstraL(int from, F.XL getWeight) {\n\t\treturn dijkstra(from, e -> getWeight.f(e), (a, b) -> a + b, Long::compare, 0l, Long.MAX_VALUE);\n\t}\n\n\t/**\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t * !!多重辺があるとバグる!!\n\t */\n\t@SuppressWarnings(\"unchecked\")\n\t ArrayList> dijkstra(int from, F.XX getWeight, F.XXX add, Comparator comp,\n\t\t\tA zero, A inf) {\n\t\tint n = vSize;\n\t\tArrayList> res = U.make(n, i -> getV(i) == null ? null : UP.make(i == from ? zero : inf, -1));\n\t\tPQ> q = new PQ>((i, j) -> comp.compare(i.b, j.b));\n\n\t\tPQ.E[] qes = new PQ.E[n];\n\t\tArrayList> ups = new ArrayList>();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tups.add(UP.make(i, inf));\n\t\t}\n\n\t\tboolean[] fixed = new boolean[n];\n\t\tups.get(from).b = zero;\n\t\tqes[from] = q.add(ups.get(from));\n\n\t\twhile (!q.isEmpty()) {\n\t\t\tUP up = q.pop();\n\t\t\tInteger i = up.a;\n\t\t\tif (fixed[i])\n\t\t\t\tcontinue;\n\t\t\tfixed[i] = true;\n\t\t\tA dist = up.b;\n\t\t\tif (dist == inf)\n\t\t\t\tbreak;\n\t\t\t((EdgeSet) esFrom[i]).iter((j, e) -> {\n\t\t\t\tif (fixed[j])\n\t\t\t\t\treturn;\n\t\t\t\tUP resj = res.get(j);\n\t\t\t\tA newDist = add.f(dist, getWeight.f(e));\n\t\t\t\tif (comp.compare(resj.a, newDist) > 0) {\n\t\t\t\t\tresj.a = newDist;\n\t\t\t\t\tresj.b = i;\n\n\t\t\t\t\tq.add(UP.make(j, newDist));\n\n//\t\t\t\t\tUP upj = ups.get(j);\n//\t\t\t\t\tupj.b = newDist;\n//\t\t\t\t\tif (qes[j] == null)\n//\t\t\t\t\t\tqes[j] = q.add(upj);\n//\t\t\t\t\telse\n//\t\t\t\t\t\tq.update(qes[j], upj);\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t\treturn res;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate void search(int firstIdx, State firstS, F.XXXXX nextState,\n\t\t\tF.XXXV> visit, F.XV> push,\n\t\t\tF.VX> pop, F.VX isEmpty) {\n\t\tboolean[] visited = new boolean[vSize];\n\t\tArrayList movedTo = new ArrayList();\n\t\tpush.f(UP.make(firstS, firstIdx));\n\t\tvisited[firstIdx] = true;\n\t\twhile (!isEmpty.f()) {\n\t\t\tUP si = pop.f();\n\t\t\tState s = (State) si.a;\n\t\t\tInteger i = si.b;\n\t\t\tmovedTo.clear();\n\t\t\t((EdgeSet) esFrom[i]).iter((j, e) -> {\n\t\t\t\tif (visited[j])\n\t\t\t\t\treturn;\n\t\t\t\tState ns = nextState.f(s, i, j, e);\n\t\t\t\tif (ns != null) {\n\t\t\t\t\tmovedTo.add(j);\n\t\t\t\t\tpush.f(P.make(ns, j));\n\t\t\t\t\tvisited[j] = true;\n\t\t\t\t}\n\t\t\t});\n\t\t\tvisit.f(s, i, movedTo);\n\t\t}\n\t}\n}\n\nclass UP { // Unordered Pair\n\tA a;\n\tB b;\n\n\tUP(A a, B b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tstatic UP make(A a, B b) {\n\t\treturn new UP(a, b);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof UP))\n\t\t\treturn false;\n\t\tUP p = (UP) o;\n\t\tboolean aok = a == null ? p.a == null : a.equals(p.a);\n\t\tboolean bok = b == null ? p.b == null : b.equals(p.b);\n\t\treturn aok && bok;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a.toString() + \", \" + b.toString() + \")\";\n\t}\n}\n\nclass P, B extends Comparable> extends UP\n\t\timplements Comparable> { // Pair\n\tP(A a, B b) {\n\t\tsuper(a, b);\n\t}\n\n\tstatic , B extends Comparable> P make(A a, B b) {\n\t\treturn new P(a, b);\n\t}\n\n\tpublic int compareTo(P o) {\n\t\tint sa = a.compareTo(o.a);\n\t\tint sb = b.compareTo(o.b);\n\t\treturn sa != 0 ? sa : sb;\n\t}\n}\n\nclass PI implements Comparable { // Pair int\n\tint a;\n\tint b;\n\n\tPI(int a, int b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tstatic PI make(int a, int b) {\n\t\treturn new PI(a, b);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof PI))\n\t\t\treturn false;\n\t\tPI p = (PI) o;\n\t\treturn a == p.a && b == p.b;\n\t}\n\n\tpublic int compareTo(PI o) {\n\t\tint sa = a - o.a;\n\t\tint sb = b - o.b;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \")\";\n\t}\n}\n\nclass PL implements Comparable { // Pair long\n\tlong a;\n\tlong b;\n\n\tPL(long a, long b) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t}\n\n\tstatic PL make(long a, long b) {\n\t\treturn new PL(a, b);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof PL))\n\t\t\treturn false;\n\t\tPL p = (PL) o;\n\t\treturn a == p.a && b == p.b;\n\t}\n\n\tpublic int compareTo(PL o) {\n\t\tlong sa = a - o.a;\n\t\tlong sb = b - o.b;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \")\";\n\t}\n}\n\nclass UT { // Unordered Tuple\n\tA a;\n\tB b;\n\tC c;\n\n\tUT(A a, B b, C c) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t\tthis.c = c;\n\t}\n\n\tstatic UT make(A a, B b, C c) {\n\t\treturn new UT(a, b, c);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof UT))\n\t\t\treturn false;\n\t\tUT t = (UT) o;\n\t\tboolean aok = a == null ? t.a == null : a.equals(t.a);\n\t\tboolean bok = b == null ? t.b == null : b.equals(t.b);\n\t\tboolean cok = c == null ? t.c == null : c.equals(t.c);\n\t\treturn aok && bok && cok;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a.toString() + \", \" + b.toString() + \", \" + c.toString() + \")\";\n\t}\n}\n\nclass T, B extends Comparable, C extends Comparable>\n\t\textends UT implements Comparable> { // Tuple\n\tT(A a, B b, C c) {\n\t\tsuper(a, b, c);\n\t}\n\n\tstatic , B extends Comparable, C extends Comparable> T make(\n\t\t\tA a, B b, C c) {\n\t\treturn new T(a, b, c);\n\t}\n\n\tpublic int compareTo(T o) {\n\t\tint sa = a.compareTo(o.a);\n\t\tint sb = b.compareTo(o.b);\n\t\tint sc = c.compareTo(o.c);\n\t\treturn sa != 0 ? sa : sb != 0 ? sb : sc;\n\t}\n}\n\nclass TI implements Comparable { // Tuple int\n\tint a;\n\tint b;\n\tint c;\n\n\tTI(int a, int b, int c) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t\tthis.c = c;\n\t}\n\n\tstatic TI make(int a, int b, int c) {\n\t\treturn new TI(a, b, c);\n\t}\n\n\tTL toLong() {\n\t\treturn TL.make(a, b, c);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof TI))\n\t\t\treturn false;\n\t\tTI t = (TI) o;\n\t\treturn a == t.a && b == t.b && c == t.c;\n\t}\n\n\tpublic int compareTo(TI o) {\n\t\tint sa = a - o.a;\n\t\tint sb = b - o.b;\n\t\tint sc = c - o.c;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : sc > 0 ? 1 : sc < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \", \" + c + \")\";\n\t}\n}\n\nclass TL implements Comparable { // Tuple long\n\tlong a;\n\tlong b;\n\tlong c;\n\n\tTL(long a, long b, long c) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t\tthis.c = c;\n\t}\n\n\tstatic TL make(long a, long b, long c) {\n\t\treturn new TL(a, b, c);\n\t}\n\n\tTI toInt() {\n\t\treturn TI.make((int) a, (int) b, (int) c);\n\t}\n\n\tpublic boolean equals(Object o) {\n\t\tif (o == this)\n\t\t\treturn true;\n\t\tif (!(o instanceof TL))\n\t\t\treturn false;\n\t\tTL t = (TL) o;\n\t\treturn a == t.a && b == t.b && c == t.c;\n\t}\n\n\tpublic int compareTo(TL o) {\n\t\tlong sa = a - o.a;\n\t\tlong sb = b - o.b;\n\t\tlong sc = c - o.c;\n\t\treturn sa > 0 ? 1 : sa < 0 ? -1 : sb > 0 ? 1 : sb < 0 ? -1 : sc > 0 ? 1 : sc < 0 ? -1 : 0;\n\t}\n\n\tpublic String toString() {\n\t\treturn \"(\" + a + \", \" + b + \", \" + c + \")\";\n\t}\n}\n\nfinal class U { // Utilities\n\tprivate U() {\n\t}\n\n\tstatic ArrayList make(int n, F.IX maker) {\n\t\tArrayList res = new ArrayList();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres.add(maker.f(i));\n\t\treturn res;\n\t}\n\n\tstatic boolean[] makeB(int n, F.IB maker) {\n\t\tboolean[] res = new boolean[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic int[] makeI(int n, F.II maker) {\n\t\tint[] res = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic long[] makeL(int n, F.IL maker) {\n\t\tlong[] res = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic A[] makeX(int n, F.IX maker, A[] as) {\n\t\tA[] res = Arrays.copyOf(as, n);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tres[i] = maker.f(i);\n\t\treturn res;\n\t}\n\n\tstatic ArrayList filter(ArrayList as, F.XB pred) {\n\t\tArrayList res = new ArrayList();\n\t\tfor (A a : as)\n\t\t\tif (pred.f(a))\n\t\t\t\tres.add(a);\n\t\treturn res;\n\t}\n\n\tstatic int count(ArrayList as, F.XB pred) {\n\t\tint res = 0;\n\t\tfor (A a : as)\n\t\t\tif (pred.f(a))\n\t\t\t\tres++;\n\t\treturn res;\n\t}\n\n\tstatic ArrayList concat(ArrayList as, ArrayList bs) {\n\t\tArrayList res = new ArrayList();\n\t\tres.addAll(as);\n\t\tres.addAll(bs);\n\t\treturn res;\n\t}\n\n\tstatic boolean any(ArrayList as, F.XB pred) {\n\t\tfor (A a : as)\n\t\t\tif (pred.f(a))\n\t\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tstatic boolean all(ArrayList as, F.XB pred) {\n\t\tfor (A a : as)\n\t\t\tif (!pred.f(a))\n\t\t\t\treturn false;\n\t\treturn true;\n\t}\n\n\tstatic ArrayList flatten(ArrayList> ass) {\n\t\tArrayList res = new ArrayList();\n\t\tfor (ArrayList as : ass)\n\t\t\tres.addAll(as);\n\t\treturn res;\n\t}\n\n\tstatic B foldl(ArrayList as, F.XXX f, B e) {\n\t\tB res = e;\n\t\tfor (A a : as)\n\t\t\tres = f.f(res, a);\n\t\treturn res;\n\t}\n\n\tstatic B foldr(ArrayList as, F.XXX f, B e) {\n\t\tB res = e;\n\t\tfor (int i = as.size() - 1; i >= 0; i--)\n\t\t\tres = f.f(as.get(i), res);\n\t\treturn res;\n\t}\n\n\tstatic ArrayList reverse(ArrayList as) {\n\t\tint size = as.size();\n\t\treturn make(size, i -> as.get(size - 1 - i));\n\t}\n\n\tstatic boolean[] reverse(boolean[] as) {\n\t\tint size = as.length;\n\t\treturn makeB(size, i -> as[size - 1 - i]);\n\t}\n\n\tstatic int[] reverse(int[] as) {\n\t\tint size = as.length;\n\t\treturn makeI(size, i -> as[size - 1 - i]);\n\t}\n\n\tstatic long[] reverse(long[] as) {\n\t\tint size = as.length;\n\t\treturn makeL(size, i -> as[size - 1 - i]);\n\t}\n\n\tstatic A[] reverse(A[] as) {\n\t\tint size = as.length;\n\t\treturn makeX(size, i -> as[size - 1 - i], as);\n\t}\n\n\tstatic > UP, ArrayList> compress(ArrayList as) {\n\t\tTreeSet set = new TreeSet(as);\n\t\tTreeMap map = new TreeMap();\n\t\tArrayList imap = new ArrayList();\n\t\tint i = 0;\n\t\tfor (A a : set) {\n\t\t\tmap.put(a, i++);\n\t\t\timap.add(a);\n\t\t}\n\t\treturn UP.make(map, imap);\n\t}\n\n\tstatic ArrayList map(ArrayList as, F.XX f) {\n\t\treturn make(as.size(), (i) -> f.f(as.get(i)));\n\t}\n\n\tstatic ArrayList mapi(ArrayList as, F.XIX f) {\n\t\treturn make(as.size(), (i) -> f.f(as.get(i), i));\n\t}\n\n\tstatic ArrayList> zip(ArrayList as, ArrayList bs) {\n\t\treturn make(min(as.size(), bs.size()), (i) -> UP.make(as.get(i), bs.get(i)));\n\t}\n\n\tstatic int min(int a, int b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic long min(long a, long b) {\n\t\treturn a < b ? a : b;\n\t}\n\n\tstatic > A min(A a, A b) {\n\t\treturn a.compareTo(b) < 0 ? a : b;\n\t}\n\n\tstatic int max(int a, int b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic long max(long a, long b) {\n\t\treturn a > b ? a : b;\n\t}\n\n\tstatic > A max(A a, A b) {\n\t\treturn a.compareTo(b) > 0 ? a : b;\n\t}\n\n\tstatic int clamp(int a, int min, int max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic long clamp(long a, long min, long max) {\n\t\treturn a < min ? min : a > max ? max : a;\n\t}\n\n\tstatic > A clamp(A a, A min, A max) {\n\t\treturn a.compareTo(min) < 0 ? min : a.compareTo(max) > 0 ? max : a;\n\t}\n\n\tstatic int abs(int a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic long abs(long a) {\n\t\treturn a < 0 ? -a : a;\n\t}\n\n\tstatic void forEachBitPerm(int n, int k, F.IV f) {\n\t\tfor (int i = (1 << k) - 1; i < 1 << n;) {\n\t\t\tf.f(i);\n\t\t\tint t = (i | i - 1) + 1;\n\t\t\ti = t | ((t & -t) / (i & -i) >> 1) - 1;\n\t\t}\n\t}\n\n\tstatic int nextBitPerm(int a) {\n\t\tint t = (a | a - 1) + 1;\n\t\treturn t | ((t & -t) / (a & -a) >> 1) - 1;\n\t}\n\n\tstatic void mebius(int n, F.IIV f) { // s, i\n\t\tint bit = 1;\n\t\tint exp = 0;\n\t\tfor (int i = 1; i < 1 << n; i++) {\n\t\t\tf.f(i ^ bit, exp);\n\t\t\tif ((i & i + 1) == 0) {\n\t\t\t\tbit <<= 1;\n\t\t\t\texp++;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic void zeta(int n, F.IIV f) { // s, i\n\t\tint m = (1 << n) - 1;\n\t\tint bit = 1;\n\t\tint exp = 0;\n\t\tfor (int i = (1 << n) - 2; i >= 0; i--) {\n\t\t\tf.f(i ^ bit, exp);\n\t\t\tif ((~i & ~i + 1 & m) == 0) {\n\t\t\t\tbit <<= 1;\n\t\t\t\texp++;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic ArrayList toAL(A[] as) {\n\t\treturn make(as.length, i -> as[i]);\n\t}\n\n\tstatic A[] doubleSize(A[] as) {\n\t\treturn Arrays.copyOf(as, as.length << 1);\n\t}\n\n\tstatic long searchL(long ng, long ok, F.LB isOk) {\n\t\twhile (ng - ok > 1 || ok - ng > 1) {\n\t\t\tlong mid = ng + ok >> 1;\n\t\t\tif (isOk.f(mid))\n\t\t\t\tok = mid;\n\t\t\telse\n\t\t\t\tng = mid;\n\t\t}\n\t\treturn ok;\n\t}\n\n\tstatic int searchI(int ng, int ok, F.IB isOk) {\n\t\treturn (int) searchL((long) ng, (long) ok, (mid) -> isOk.f((int) mid));\n\t}\n}\n\nfinal class F { // Functions\n\tprivate F() {\n\t}\n\n\tinterface VV {\n\t\tvoid f();\n\t}\n\n\tinterface BV {\n\t\tvoid f(boolean a);\n\t}\n\n\tinterface BXV {\n\t\tvoid f(boolean a, A b);\n\t}\n\n\tinterface BXXV {\n\t\tvoid f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXV {\n\t\tvoid f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBV {\n\t\tvoid f(A a, boolean b);\n\t}\n\n\tinterface XXBV {\n\t\tvoid f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBV {\n\t\tvoid f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IV {\n\t\tvoid f(int a);\n\t}\n\n\tinterface IXV {\n\t\tvoid f(int a, A b);\n\t}\n\n\tinterface IXXV {\n\t\tvoid f(int a, A b, B c);\n\t}\n\n\tinterface IXXXV {\n\t\tvoid f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIV {\n\t\tvoid f(A a, int b);\n\t}\n\n\tinterface XXIV {\n\t\tvoid f(A a, B b, int c);\n\t}\n\n\tinterface XXXIV {\n\t\tvoid f(A a, B b, C c, int d);\n\t}\n\n\tinterface LV {\n\t\tvoid f(long a);\n\t}\n\n\tinterface LXV {\n\t\tvoid f(long a, A b);\n\t}\n\n\tinterface LXXV {\n\t\tvoid f(long a, A b, B c);\n\t}\n\n\tinterface LXXXV {\n\t\tvoid f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLV {\n\t\tvoid f(A a, long b);\n\t}\n\n\tinterface XXLV {\n\t\tvoid f(A a, B b, long c);\n\t}\n\n\tinterface XXXLV {\n\t\tvoid f(A a, B b, C c, long d);\n\t}\n\n\tinterface DV {\n\t\tvoid f(double a);\n\t}\n\n\tinterface DXV {\n\t\tvoid f(double a, A b);\n\t}\n\n\tinterface DXXV {\n\t\tvoid f(double a, A b, B c);\n\t}\n\n\tinterface DXXXV {\n\t\tvoid f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDV {\n\t\tvoid f(A a, double b);\n\t}\n\n\tinterface XXDV {\n\t\tvoid f(A a, B b, double c);\n\t}\n\n\tinterface XXXDV {\n\t\tvoid f(A a, B b, C c, double d);\n\t}\n\n\tinterface XV {\n\t\tvoid f(A a);\n\t}\n\n\tinterface XXV {\n\t\tvoid f(A a, B b);\n\t}\n\n\tinterface XXXV {\n\t\tvoid f(A a, B b, C c);\n\t}\n\n\tinterface XXXXV {\n\t\tvoid f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBV {\n\t\tvoid f(boolean a, boolean b);\n\t}\n\n\tinterface BIV {\n\t\tvoid f(boolean a, int b);\n\t}\n\n\tinterface BLV {\n\t\tvoid f(boolean a, long b);\n\t}\n\n\tinterface BDV {\n\t\tvoid f(boolean a, double b);\n\t}\n\n\tinterface IBV {\n\t\tvoid f(int a, boolean b);\n\t}\n\n\tinterface IIV {\n\t\tvoid f(int a, int b);\n\t}\n\n\tinterface ILV {\n\t\tvoid f(int a, long b);\n\t}\n\n\tinterface IDV {\n\t\tvoid f(int a, double b);\n\t}\n\n\tinterface LBV {\n\t\tvoid f(long a, boolean b);\n\t}\n\n\tinterface LIV {\n\t\tvoid f(long a, int b);\n\t}\n\n\tinterface LLV {\n\t\tvoid f(long a, long b);\n\t}\n\n\tinterface LDV {\n\t\tvoid f(long a, double b);\n\t}\n\n\tinterface DBV {\n\t\tvoid f(double a, boolean b);\n\t}\n\n\tinterface DIV {\n\t\tvoid f(double a, int b);\n\t}\n\n\tinterface DLV {\n\t\tvoid f(double a, long b);\n\t}\n\n\tinterface DDV {\n\t\tvoid f(double a, double b);\n\t}\n\n\tinterface VB {\n\t\tboolean f();\n\t}\n\n\tinterface BB {\n\t\tboolean f(boolean a);\n\t}\n\n\tinterface BXB {\n\t\tboolean f(boolean a, A b);\n\t}\n\n\tinterface BXXB {\n\t\tboolean f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXB {\n\t\tboolean f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBB {\n\t\tboolean f(A a, boolean b);\n\t}\n\n\tinterface XXBB {\n\t\tboolean f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBB {\n\t\tboolean f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IB {\n\t\tboolean f(int a);\n\t}\n\n\tinterface IXB {\n\t\tboolean f(int a, A b);\n\t}\n\n\tinterface IXXB {\n\t\tboolean f(int a, A b, B c);\n\t}\n\n\tinterface IXXXB {\n\t\tboolean f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIB {\n\t\tboolean f(A a, int b);\n\t}\n\n\tinterface XXIB {\n\t\tboolean f(A a, B b, int c);\n\t}\n\n\tinterface XXXIB {\n\t\tboolean f(A a, B b, C c, int d);\n\t}\n\n\tinterface LB {\n\t\tboolean f(long a);\n\t}\n\n\tinterface LXB {\n\t\tboolean f(long a, A b);\n\t}\n\n\tinterface LXXB {\n\t\tboolean f(long a, A b, B c);\n\t}\n\n\tinterface LXXXB {\n\t\tboolean f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLB {\n\t\tboolean f(A a, long b);\n\t}\n\n\tinterface XXLB {\n\t\tboolean f(A a, B b, long c);\n\t}\n\n\tinterface XXXLB {\n\t\tboolean f(A a, B b, C c, long d);\n\t}\n\n\tinterface DB {\n\t\tboolean f(double a);\n\t}\n\n\tinterface DXB {\n\t\tboolean f(double a, A b);\n\t}\n\n\tinterface DXXB {\n\t\tboolean f(double a, A b, B c);\n\t}\n\n\tinterface DXXXB {\n\t\tboolean f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDB {\n\t\tboolean f(A a, double b);\n\t}\n\n\tinterface XXDB {\n\t\tboolean f(A a, B b, double c);\n\t}\n\n\tinterface XXXDB {\n\t\tboolean f(A a, B b, C c, double d);\n\t}\n\n\tinterface XB {\n\t\tboolean f(A a);\n\t}\n\n\tinterface XXB {\n\t\tboolean f(A a, B b);\n\t}\n\n\tinterface XXXB {\n\t\tboolean f(A a, B b, C c);\n\t}\n\n\tinterface XXXXB {\n\t\tboolean f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBB {\n\t\tboolean f(boolean a, boolean b);\n\t}\n\n\tinterface BIB {\n\t\tboolean f(boolean a, int b);\n\t}\n\n\tinterface BLB {\n\t\tboolean f(boolean a, long b);\n\t}\n\n\tinterface BDB {\n\t\tboolean f(boolean a, double b);\n\t}\n\n\tinterface IBB {\n\t\tboolean f(int a, boolean b);\n\t}\n\n\tinterface IIB {\n\t\tboolean f(int a, int b);\n\t}\n\n\tinterface ILB {\n\t\tboolean f(int a, long b);\n\t}\n\n\tinterface IDB {\n\t\tboolean f(int a, double b);\n\t}\n\n\tinterface LBB {\n\t\tboolean f(long a, boolean b);\n\t}\n\n\tinterface LIB {\n\t\tboolean f(long a, int b);\n\t}\n\n\tinterface LLB {\n\t\tboolean f(long a, long b);\n\t}\n\n\tinterface LDB {\n\t\tboolean f(long a, double b);\n\t}\n\n\tinterface DBB {\n\t\tboolean f(double a, boolean b);\n\t}\n\n\tinterface DIB {\n\t\tboolean f(double a, int b);\n\t}\n\n\tinterface DLB {\n\t\tboolean f(double a, long b);\n\t}\n\n\tinterface DDB {\n\t\tboolean f(double a, double b);\n\t}\n\n\tinterface VI {\n\t\tint f();\n\t}\n\n\tinterface BI {\n\t\tint f(boolean a);\n\t}\n\n\tinterface BXI {\n\t\tint f(boolean a, A b);\n\t}\n\n\tinterface BXXI {\n\t\tint f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXI {\n\t\tint f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBI {\n\t\tint f(A a, boolean b);\n\t}\n\n\tinterface XXBI {\n\t\tint f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBI {\n\t\tint f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface II {\n\t\tint f(int a);\n\t}\n\n\tinterface IXI {\n\t\tint f(int a, A b);\n\t}\n\n\tinterface IXXI {\n\t\tint f(int a, A b, B c);\n\t}\n\n\tinterface IXXXI {\n\t\tint f(int a, A b, B c, C d);\n\t}\n\n\tinterface XII {\n\t\tint f(A a, int b);\n\t}\n\n\tinterface XXII {\n\t\tint f(A a, B b, int c);\n\t}\n\n\tinterface XXXII {\n\t\tint f(A a, B b, C c, int d);\n\t}\n\n\tinterface LI {\n\t\tint f(long a);\n\t}\n\n\tinterface LXI {\n\t\tint f(long a, A b);\n\t}\n\n\tinterface LXXI {\n\t\tint f(long a, A b, B c);\n\t}\n\n\tinterface LXXXI {\n\t\tint f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLI {\n\t\tint f(A a, long b);\n\t}\n\n\tinterface XXLI {\n\t\tint f(A a, B b, long c);\n\t}\n\n\tinterface XXXLI {\n\t\tint f(A a, B b, C c, long d);\n\t}\n\n\tinterface DI {\n\t\tint f(double a);\n\t}\n\n\tinterface DXI {\n\t\tint f(double a, A b);\n\t}\n\n\tinterface DXXI {\n\t\tint f(double a, A b, B c);\n\t}\n\n\tinterface DXXXI {\n\t\tint f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDI {\n\t\tint f(A a, double b);\n\t}\n\n\tinterface XXDI {\n\t\tint f(A a, B b, double c);\n\t}\n\n\tinterface XXXDI {\n\t\tint f(A a, B b, C c, double d);\n\t}\n\n\tinterface XI {\n\t\tint f(A a);\n\t}\n\n\tinterface XXI {\n\t\tint f(A a, B b);\n\t}\n\n\tinterface XXXI {\n\t\tint f(A a, B b, C c);\n\t}\n\n\tinterface XXXXI {\n\t\tint f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBI {\n\t\tint f(boolean a, boolean b);\n\t}\n\n\tinterface BII {\n\t\tint f(boolean a, int b);\n\t}\n\n\tinterface BLI {\n\t\tint f(boolean a, long b);\n\t}\n\n\tinterface BDI {\n\t\tint f(boolean a, double b);\n\t}\n\n\tinterface IBI {\n\t\tint f(int a, boolean b);\n\t}\n\n\tinterface III {\n\t\tint f(int a, int b);\n\t}\n\n\tinterface ILI {\n\t\tint f(int a, long b);\n\t}\n\n\tinterface IDI {\n\t\tint f(int a, double b);\n\t}\n\n\tinterface LBI {\n\t\tint f(long a, boolean b);\n\t}\n\n\tinterface LII {\n\t\tint f(long a, int b);\n\t}\n\n\tinterface LLI {\n\t\tint f(long a, long b);\n\t}\n\n\tinterface LDI {\n\t\tint f(long a, double b);\n\t}\n\n\tinterface DBI {\n\t\tint f(double a, boolean b);\n\t}\n\n\tinterface DII {\n\t\tint f(double a, int b);\n\t}\n\n\tinterface DLI {\n\t\tint f(double a, long b);\n\t}\n\n\tinterface DDI {\n\t\tint f(double a, double b);\n\t}\n\n\tinterface VL {\n\t\tlong f();\n\t}\n\n\tinterface BL {\n\t\tlong f(boolean a);\n\t}\n\n\tinterface BXL {\n\t\tlong f(boolean a, A b);\n\t}\n\n\tinterface BXXL {\n\t\tlong f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXL {\n\t\tlong f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBL {\n\t\tlong f(A a, boolean b);\n\t}\n\n\tinterface XXBL {\n\t\tlong f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBL {\n\t\tlong f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IL {\n\t\tlong f(int a);\n\t}\n\n\tinterface IXL {\n\t\tlong f(int a, A b);\n\t}\n\n\tinterface IXXL {\n\t\tlong f(int a, A b, B c);\n\t}\n\n\tinterface IXXXL {\n\t\tlong f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIL {\n\t\tlong f(A a, int b);\n\t}\n\n\tinterface XXIL {\n\t\tlong f(A a, B b, int c);\n\t}\n\n\tinterface XXXIL {\n\t\tlong f(A a, B b, C c, int d);\n\t}\n\n\tinterface LL {\n\t\tlong f(long a);\n\t}\n\n\tinterface LXL {\n\t\tlong f(long a, A b);\n\t}\n\n\tinterface LXXL {\n\t\tlong f(long a, A b, B c);\n\t}\n\n\tinterface LXXXL {\n\t\tlong f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLL {\n\t\tlong f(A a, long b);\n\t}\n\n\tinterface XXLL {\n\t\tlong f(A a, B b, long c);\n\t}\n\n\tinterface XXXLL {\n\t\tlong f(A a, B b, C c, long d);\n\t}\n\n\tinterface DL {\n\t\tlong f(double a);\n\t}\n\n\tinterface DXL {\n\t\tlong f(double a, A b);\n\t}\n\n\tinterface DXXL {\n\t\tlong f(double a, A b, B c);\n\t}\n\n\tinterface DXXXL {\n\t\tlong f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDL {\n\t\tlong f(A a, double b);\n\t}\n\n\tinterface XXDL {\n\t\tlong f(A a, B b, double c);\n\t}\n\n\tinterface XXXDL {\n\t\tlong f(A a, B b, C c, double d);\n\t}\n\n\tinterface XL {\n\t\tlong f(A a);\n\t}\n\n\tinterface XXL {\n\t\tlong f(A a, B b);\n\t}\n\n\tinterface XXXL {\n\t\tlong f(A a, B b, C c);\n\t}\n\n\tinterface XXXXL {\n\t\tlong f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBL {\n\t\tlong f(boolean a, boolean b);\n\t}\n\n\tinterface BIL {\n\t\tlong f(boolean a, int b);\n\t}\n\n\tinterface BLL {\n\t\tlong f(boolean a, long b);\n\t}\n\n\tinterface BDL {\n\t\tlong f(boolean a, double b);\n\t}\n\n\tinterface IBL {\n\t\tlong f(int a, boolean b);\n\t}\n\n\tinterface IIL {\n\t\tlong f(int a, int b);\n\t}\n\n\tinterface ILL {\n\t\tlong f(int a, long b);\n\t}\n\n\tinterface IDL {\n\t\tlong f(int a, double b);\n\t}\n\n\tinterface LBL {\n\t\tlong f(long a, boolean b);\n\t}\n\n\tinterface LIL {\n\t\tlong f(long a, int b);\n\t}\n\n\tinterface LLL {\n\t\tlong f(long a, long b);\n\t}\n\n\tinterface LDL {\n\t\tlong f(long a, double b);\n\t}\n\n\tinterface DBL {\n\t\tlong f(double a, boolean b);\n\t}\n\n\tinterface DIL {\n\t\tlong f(double a, int b);\n\t}\n\n\tinterface DLL {\n\t\tlong f(double a, long b);\n\t}\n\n\tinterface DDL {\n\t\tlong f(double a, double b);\n\t}\n\n\tinterface VD {\n\t\tdouble f();\n\t}\n\n\tinterface BD {\n\t\tdouble f(boolean a);\n\t}\n\n\tinterface BXD {\n\t\tdouble f(boolean a, A b);\n\t}\n\n\tinterface BXXD {\n\t\tdouble f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXD {\n\t\tdouble f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBD {\n\t\tdouble f(A a, boolean b);\n\t}\n\n\tinterface XXBD {\n\t\tdouble f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBD {\n\t\tdouble f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface ID {\n\t\tdouble f(int a);\n\t}\n\n\tinterface IXD {\n\t\tdouble f(int a, A b);\n\t}\n\n\tinterface IXXD {\n\t\tdouble f(int a, A b, B c);\n\t}\n\n\tinterface IXXXD {\n\t\tdouble f(int a, A b, B c, C d);\n\t}\n\n\tinterface XID {\n\t\tdouble f(A a, int b);\n\t}\n\n\tinterface XXID {\n\t\tdouble f(A a, B b, int c);\n\t}\n\n\tinterface XXXID {\n\t\tdouble f(A a, B b, C c, int d);\n\t}\n\n\tinterface LD {\n\t\tdouble f(long a);\n\t}\n\n\tinterface LXD {\n\t\tdouble f(long a, A b);\n\t}\n\n\tinterface LXXD {\n\t\tdouble f(long a, A b, B c);\n\t}\n\n\tinterface LXXXD {\n\t\tdouble f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLD {\n\t\tdouble f(A a, long b);\n\t}\n\n\tinterface XXLD {\n\t\tdouble f(A a, B b, long c);\n\t}\n\n\tinterface XXXLD {\n\t\tdouble f(A a, B b, C c, long d);\n\t}\n\n\tinterface DD {\n\t\tdouble f(double a);\n\t}\n\n\tinterface DXD {\n\t\tdouble f(double a, A b);\n\t}\n\n\tinterface DXXD {\n\t\tdouble f(double a, A b, B c);\n\t}\n\n\tinterface DXXXD {\n\t\tdouble f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDD {\n\t\tdouble f(A a, double b);\n\t}\n\n\tinterface XXDD {\n\t\tdouble f(A a, B b, double c);\n\t}\n\n\tinterface XXXDD {\n\t\tdouble f(A a, B b, C c, double d);\n\t}\n\n\tinterface XD {\n\t\tdouble f(A a);\n\t}\n\n\tinterface XXD {\n\t\tdouble f(A a, B b);\n\t}\n\n\tinterface XXXD {\n\t\tdouble f(A a, B b, C c);\n\t}\n\n\tinterface XXXXD {\n\t\tdouble f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBD {\n\t\tdouble f(boolean a, boolean b);\n\t}\n\n\tinterface BID {\n\t\tdouble f(boolean a, int b);\n\t}\n\n\tinterface BLD {\n\t\tdouble f(boolean a, long b);\n\t}\n\n\tinterface BDD {\n\t\tdouble f(boolean a, double b);\n\t}\n\n\tinterface IBD {\n\t\tdouble f(int a, boolean b);\n\t}\n\n\tinterface IID {\n\t\tdouble f(int a, int b);\n\t}\n\n\tinterface ILD {\n\t\tdouble f(int a, long b);\n\t}\n\n\tinterface IDD {\n\t\tdouble f(int a, double b);\n\t}\n\n\tinterface LBD {\n\t\tdouble f(long a, boolean b);\n\t}\n\n\tinterface LID {\n\t\tdouble f(long a, int b);\n\t}\n\n\tinterface LLD {\n\t\tdouble f(long a, long b);\n\t}\n\n\tinterface LDD {\n\t\tdouble f(long a, double b);\n\t}\n\n\tinterface DBD {\n\t\tdouble f(double a, boolean b);\n\t}\n\n\tinterface DID {\n\t\tdouble f(double a, int b);\n\t}\n\n\tinterface DLD {\n\t\tdouble f(double a, long b);\n\t}\n\n\tinterface DDD {\n\t\tdouble f(double a, double b);\n\t}\n\n\tinterface VX {\n\t\tA f();\n\t}\n\n\tinterface BX {\n\t\tA f(boolean a);\n\t}\n\n\tinterface BXX {\n\t\tB f(boolean a, A b);\n\t}\n\n\tinterface BXXX {\n\t\tC f(boolean a, A b, B c);\n\t}\n\n\tinterface BXXXX {\n\t\tD f(boolean a, A b, B c, C d);\n\t}\n\n\tinterface XBX {\n\t\tB f(A a, boolean b);\n\t}\n\n\tinterface XXBX {\n\t\tC f(A a, B b, boolean c);\n\t}\n\n\tinterface XXXBX {\n\t\tD f(A a, B b, C c, boolean d);\n\t}\n\n\tinterface IX {\n\t\tA f(int a);\n\t}\n\n\tinterface IXX {\n\t\tB f(int a, A b);\n\t}\n\n\tinterface IXXX {\n\t\tC f(int a, A b, B c);\n\t}\n\n\tinterface IXXXX {\n\t\tD f(int a, A b, B c, C d);\n\t}\n\n\tinterface XIX {\n\t\tB f(A a, int b);\n\t}\n\n\tinterface XXIX {\n\t\tC f(A a, B b, int c);\n\t}\n\n\tinterface XXXIX {\n\t\tD f(A a, B b, C c, int d);\n\t}\n\n\tinterface LX {\n\t\tA f(long a);\n\t}\n\n\tinterface LXX {\n\t\tB f(long a, A b);\n\t}\n\n\tinterface LXXX {\n\t\tC f(long a, A b, B c);\n\t}\n\n\tinterface LXXXX {\n\t\tD f(long a, A b, B c, C d);\n\t}\n\n\tinterface XLX {\n\t\tB f(A a, long b);\n\t}\n\n\tinterface XXLX {\n\t\tC f(A a, B b, long c);\n\t}\n\n\tinterface XXXLX {\n\t\tD f(A a, B b, C c, long d);\n\t}\n\n\tinterface DX {\n\t\tA f(double a);\n\t}\n\n\tinterface DXX {\n\t\tB f(double a, A b);\n\t}\n\n\tinterface DXXX {\n\t\tC f(double a, A b, B c);\n\t}\n\n\tinterface DXXXX {\n\t\tD f(double a, A b, B c, C d);\n\t}\n\n\tinterface XDX {\n\t\tB f(A a, double b);\n\t}\n\n\tinterface XXDX {\n\t\tC f(A a, B b, double c);\n\t}\n\n\tinterface XXXDX {\n\t\tD f(A a, B b, C c, double d);\n\t}\n\n\tinterface XX {\n\t\tB f(A a);\n\t}\n\n\tinterface XXX {\n\t\tC f(A a, B b);\n\t}\n\n\tinterface XXXX {\n\t\tD f(A a, B b, C c);\n\t}\n\n\tinterface XXXXX {\n\t\tE f(A a, B b, C c, D d);\n\t}\n\n\tinterface BBX {\n\t\tA f(boolean a, boolean b);\n\t}\n\n\tinterface BIX {\n\t\tA f(boolean a, int b);\n\t}\n\n\tinterface BLX {\n\t\tA f(boolean a, long b);\n\t}\n\n\tinterface BDX {\n\t\tA f(boolean a, double b);\n\t}\n\n\tinterface IBX {\n\t\tA f(int a, boolean b);\n\t}\n\n\tinterface IIX {\n\t\tA f(int a, int b);\n\t}\n\n\tinterface ILX {\n\t\tA f(int a, long b);\n\t}\n\n\tinterface IDX {\n\t\tA f(int a, double b);\n\t}\n\n\tinterface LBX {\n\t\tA f(long a, boolean b);\n\t}\n\n\tinterface LIX {\n\t\tA f(long a, int b);\n\t}\n\n\tinterface LLX {\n\t\tA f(long a, long b);\n\t}\n\n\tinterface LDX {\n\t\tA f(long a, double b);\n\t}\n\n\tinterface DBX {\n\t\tA f(double a, boolean b);\n\t}\n\n\tinterface DIX {\n\t\tA f(double a, int b);\n\t}\n\n\tinterface DLX {\n\t\tA f(double a, long b);\n\t}\n\n\tinterface DDX {\n\t\tA f(double a, double b);\n\t}\n}\n\nclass SA { // suffix array\n\tstatic int[] makeSA(String s) {\n\t\tint n = s.length() + 1;\n\t\tint[] cs = new int[n];\n\t\tcs[n - 1] = 0;\n\t\tfor (int i = 0; i < n - 1; i++)\n\t\t\tcs[i] = s.charAt(i) + 1;\n\t\tArrayList acs = U.make(n, i -> cs[i]);\n\t\tTreeMap tm = U.compress(acs).a;\n\t\tint k = tm.size();\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tcs[i] = tm.get(cs[i]);\n\t\treturn makeSA(cs, n, k);\n\t}\n\n\tstatic int[] makeLCP(String s, int[] sa) { // lcp(i, i+1)\n\t\tint n = sa.length;\n\t\tint[] r = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tr[sa[i]] = i;\n\t\tint[] lcp = new int[n];\n\t\tint l = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint idx = r[i];\n\t\t\tif (idx == n - 1) {\n\t\t\t\tlcp[idx] = -1;\n\t\t\t\tl = 0;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tint p = sa[idx];\n\t\t\tint q = sa[idx + 1];\n\t\t\tif (l > 0)\n\t\t\t\tl--;\n\t\t\twhile (p + l < n - 1 && q + l < n - 1 && s.charAt(p + l) == s.charAt(q + l))\n\t\t\t\tl++;\n\t\t\tlcp[idx] = l;\n\t\t}\n\t\treturn lcp;\n\t}\n\n\tstatic F.III lcpQuery(String s) {\n\t\tint n = s.length() + 1;\n\t\tint[] sa = makeSA(s);\n\t\tint[] lcp = makeLCP(s, sa);\n\t\tint[] inv = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tinv[sa[i]] = i;\n\t\t}\n\t\tST st = new ST(n, (a, b) -> a < b ? a : b, Integer.MAX_VALUE);\n\t\tst.init(i -> i < n ? lcp[i] : Integer.MAX_VALUE);\n\t\treturn (i, j) -> {\n\t\t\tif (i == j)\n\t\t\t\treturn n - 1 - i;\n\t\t\ti = inv[i];\n\t\t\tj = inv[j];\n\t\t\tif (i > j) {\n\t\t\t\ti ^= j;\n\t\t\t\tj ^= i;\n\t\t\t\ti ^= j;\n\t\t\t}\n\t\t\treturn st.query(i, j);\n\t\t};\n\t}\n\n\tprivate static int[] makeSA(int[] cs, int n, int k) {\n\t\tboolean[] isS = new boolean[n];\n\t\tboolean[] isLms = new boolean[n];\n\t\tint[] lmss = new int[n];\n\t\tint numLmss = 0;\n\t\tisS[n - 1] = true;\n\t\tfor (int i = n - 2; i >= 0; i--)\n\t\t\tisS[i] = cs[i] < cs[i + 1] || cs[i] == cs[i + 1] && isS[i + 1];\n\t\tfor (int i = 1; i < n; i++)\n\t\t\tif (!isS[i - 1] && isS[i]) {\n\t\t\t\tlmss[numLmss++] = i;\n\t\t\t\tisLms[i] = true;\n\t\t\t}\n\t\tint[] sa = inducedSort(cs, n, numLmss, k, lmss, isS);\n\t\tint[] lmss2 = new int[numLmss];\n\t\tnumLmss = 0;\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tif (isLms[sa[i]])\n\t\t\t\tlmss2[numLmss++] = sa[i];\n\t\tint num = 0;\n\t\tsa[lmss2[0]] = 0;\n\t\tfor (int i = 0; i < numLmss - 1; i++) {\n\t\t\tint p = lmss2[i];\n\t\t\tint q = lmss2[i + 1];\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (cs[p] != cs[q] || isLms[p] != isLms[q]) {\n\t\t\t\t\tsa[lmss2[i + 1]] = ++num;\n\t\t\t\t\tbreak;\n\t\t\t\t} else if (j > 0 && (isLms[p] || isLms[q])) {\n\t\t\t\t\tsa[lmss2[i + 1]] = num;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tp++;\n\t\t\t\tq++;\n\t\t\t}\n\t\t}\n\t\tif (num + 1 < numLmss) {\n\t\t\tnumLmss = 0;\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tif (isLms[i])\n\t\t\t\t\tlmss2[numLmss++] = sa[i];\n\t\t\tlmss2 = makeSA(lmss2, numLmss, num + 1);\n\t\t\tfor (int i = 0; i < numLmss; i++)\n\t\t\t\tlmss2[i] = lmss[lmss2[i]];\n\t\t}\n\t\treturn inducedSort(cs, n, numLmss, k, lmss2, isS);\n\t}\n\n\tprivate static int[] inducedSort(int[] cs, int n, int numLmss, int k, int[] lmss, boolean[] isS) {\n\t\tint[] sa = new int[n];\n\t\tint[] bin = new int[k + 1];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tbin[cs[i] + 1]++;\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tbin[i + 1] += bin[i];\n\t\tint[] counts = new int[k];\n\t\tfor (int i = numLmss - 1; i >= 0; i--) { // put LMS backward\n\t\t\tint c = cs[lmss[i]];\n\t\t\tsa[bin[c + 1] - 1 - counts[c]++] = lmss[i];\n\t\t}\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tcounts[i] = 0;\n\t\tfor (int i = 0; i < n; i++) { // put L forward\n\t\t\tint s = sa[i] - 1;\n\t\t\tif (s < 0 || isS[s])\n\t\t\t\tcontinue;\n\t\t\tint c = cs[s];\n\t\t\tsa[bin[c] + counts[c]++] = s;\n\t\t}\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tcounts[i] = 0;\n\t\tfor (int i = n - 1; i >= 0; i--) { // put S backward\n\t\t\tint s = sa[i] - 1;\n\t\t\tif (s < 0 || !isS[s])\n\t\t\t\tcontinue;\n\t\t\tint c = cs[s];\n\t\t\tsa[bin[c + 1] - 1 - counts[c]++] = s;\n\t\t}\n\t\treturn sa;\n\t}\n}\n\nclass ST { // Segment Tree\n\tprivate ArrayList as;\n\tprivate int h;\n\tprivate int n;\n\tprivate F.XXX merger;\n\tprivate A e;\n\n\tST(int num, F.XXX merger, A e) {\n\t\tthis.merger = merger;\n\t\tthis.e = e;\n\t\th = 0;\n\t\twhile ((1 << h) < num)\n\t\t\th++;\n\t\tn = 1 << h;\n\t\tas = U.make(2 * n, i -> e);\n\t}\n\n\tvoid init(A a) {\n\t\tinit(i -> a);\n\t}\n\n\tvoid init(A[] as) {\n\t\tinit(i -> i < as.length ? as[i] : e);\n\t}\n\n\tvoid init(F.IX maker) {\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tas.set(n + i, maker.f(i));\n\t\tfor (int i = n - 1; i > 0; i--)\n\t\t\tas.set(i, merge(as.get(i << 1), as.get(i << 1 | 1)));\n\t}\n\n\tA get(int i) {\n\t\treturn query(i, i + 1);\n\t}\n\n\tvoid set(int i, A a) {\n\t\tas.set(i += n, a);\n\t\twhile ((i >>= 1) > 0)\n\t\t\tas.set(i, merge(as.get(i << 1), as.get(i << 1 | 1)));\n\t}\n\n\tA query(int l, int r) {\n\t\tl += n;\n\t\tr += n;\n\t\tA al = e;\n\t\tA ar = e;\n\t\twhile (l < r) {\n\t\t\tif ((l & 1) != 0)\n\t\t\t\tal = merge(al, as.get(l++));\n\t\t\tif ((r & 1) != 0)\n\t\t\t\tar = merge(as.get(--r), ar);\n\t\t\tl >>= 1;\n\t\t\tr >>= 1;\n\t\t}\n\t\treturn merge(al, ar);\n\t}\n\n\tprivate A merge(A a, A b) {\n\t\treturn a == e ? b : b == e ? a : merger.f(a, b);\n\t}\n}\n\nclass LST { // Lazy Segment Tree\n\tprivate ArrayList as;\n\tprivate ArrayList lazy;\n\tprivate F.XXX merger;\n\tprivate F.XXIX applier;\n\tprivate F.XXX opMerger;\n\tprivate A e;\n\tprivate Op id;\n\tprivate int h;\n\tprivate int n;\n\n\tLST(int num, F.XXX merger, F.XXIX applier, F.XXX opMerger, A e, Op id) {\n\t\tthis.merger = merger;\n\t\tthis.applier = applier;\n\t\tthis.opMerger = opMerger;\n\t\tthis.e = e;\n\t\tthis.id = id;\n\t\th = 0;\n\t\twhile ((1 << h) < num)\n\t\t\th++;\n\t\tn = 1 << h;\n\t\tint size = n << 1;\n\t\tas = U.make(size, i -> e);\n\t\tlazy = U.make(size, i -> id);\n\t}\n\n\tvoid init(A a) {\n\t\tinit(i -> a);\n\t}\n\n\tvoid init(A[] as) {\n\t\tinit(i -> i < as.length ? as[i] : e);\n\t}\n\n\tvoid init(F.IX maker) {\n\t\tfor (int i = 0; i < n << 1; i++)\n\t\t\tlazy.set(i, id);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tas.set(n + i, maker.f(i));\n\t\tfor (int i = n - 1; i > 0; i--)\n\t\t\tas.set(i, merge(as.get(i << 1), as.get(i << 1 | 1)));\n\t}\n\n\tA get(int i) {\n\t\treturn query(i, i + 1);\n\t}\n\n\tvoid set(int i, A a) {\n\t\tprop(i += n);\n\t\tas.set(i, a);\n\t\tlazy.set(i, id);\n\t\tbackprop(i);\n\t}\n\n\tA query(int l, int r) {\n\t\tprop(l += n);\n\t\tprop(r += n - 1);\n\t\tr++;\n\t\tA al = e;\n\t\tA ar = e;\n\t\tint len = 1;\n\t\twhile (l < r) {\n\t\t\tif ((l & 1) != 0)\n\t\t\t\tal = merge(al, eval(l++, len));\n\t\t\tif ((r & 1) != 0)\n\t\t\t\tar = merge(eval(--r, len), ar);\n\t\t\tl >>= 1;\n\t\t\tr >>= 1;\n\t\t\tlen <<= 1;\n\t\t}\n\t\treturn merge(al, ar);\n\t}\n\n\tvoid apply(int l, int r, Op o) {\n\t\tprop(l += n);\n\t\tprop(r += n - 1);\n\t\tint a = l;\n\t\tint b = r;\n\t\tr++;\n\t\twhile (l < r) {\n\t\t\tif ((l & 1) != 0)\n\t\t\t\tlazy.set(l, mergeOp(lazy.get(l++), o));\n\t\t\tif ((r & 1) != 0)\n\t\t\t\tlazy.set(--r, mergeOp(lazy.get(r), o));\n\t\t\tl >>= 1;\n\t\t\tr >>= 1;\n\t\t}\n\t\tbackprop(a);\n\t\tbackprop(b);\n\t}\n\n\tint size() {\n\t\treturn n;\n\t}\n\n\tprivate A merge(A a, A b) {\n\t\treturn a == e ? b : b == e ? a : merger.f(a, b);\n\t}\n\n\tprivate Op mergeOp(Op o, Op p) {\n\t\treturn o == id ? p : p == id ? o : opMerger.f(o, p);\n\t}\n\n\tprivate A apply(A a, Op o, int len) {\n\t\treturn o == id ? a : applier.f(a, o, len);\n\t}\n\n\tprivate A eval(int k, int len) {\n\t\treturn apply(as.get(k), lazy.get(k), len);\n\t}\n\n\tprivate void flush(int k, int len) {\n\t\tOp o = lazy.get(k);\n\t\tif (o == id)\n\t\t\treturn;\n\t\tlazy.set(k << 1, mergeOp(lazy.get(k << 1), o));\n\t\tlazy.set(k << 1 | 1, mergeOp(lazy.get(k << 1 | 1), o));\n\t\tas.set(k, apply(as.get(k), o, len));\n\t\tlazy.set(k, id);\n\t}\n\n\tprivate void prop(int k) {\n\t\tfor (int i = h; i > 0; i--)\n\t\t\tflush(k >> i, 1 << i);\n\t}\n\n\tprivate void backprop(int k) {\n\t\tint len = 1;\n\t\twhile ((k >>= 1) > 0) {\n\t\t\tas.set(k, merge(eval(k << 1, len), eval(k << 1 | 1, len)));\n\t\t\tlen <<= 1;\n\t\t}\n\t}\n}\n\ninterface Magma {\n\tA g(A a, A b);\n}\n\ninterface Associative {\n}\n\ninterface Unital {\n\tA e();\n}\n\ninterface Invertible {\n\tA inv(A a);\n}\n\ninterface Commutative {\n}\n\ninterface SemiGroup extends Magma, Associative {\n}\n\ninterface Monoid extends SemiGroup, Unital {\n\tstatic Monoid make(F.XXX g, A e) {\n\t\treturn new Monoid() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface CommutativeMonoid extends Monoid, Commutative {\n\tstatic CommutativeMonoid make(F.XXX g, A e) {\n\t\treturn new CommutativeMonoid() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface Group extends Monoid, Invertible {\n\tstatic Group make(F.XXX g, F.XX inv, A e) {\n\t\treturn new Group() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\n\t\t\tpublic A inv(A a) {\n\t\t\t\treturn a.equals(e) ? e : inv.f(a);\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface AbelianGroup extends Group, CommutativeMonoid {\n\tstatic AbelianGroup make(F.XXX g, F.XX inv, A e) {\n\t\treturn new AbelianGroup() {\n\t\t\tpublic A g(A a, A b) {\n\t\t\t\treturn a.equals(e) ? b : b.equals(e) ? a : g.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A e() {\n\t\t\t\treturn e;\n\t\t\t}\n\n\t\t\tpublic A inv(A a) {\n\t\t\t\treturn a.equals(e) ? e : inv.f(a);\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface Ring {\n\tAbelianGroup add();\n\n\tMonoid mul();\n\n\tdefault A zero() {\n\t\treturn add().e();\n\t}\n\n\tdefault A one() {\n\t\treturn mul().e();\n\t}\n\n\tstatic Ring make(F.XXX add, F.XX neg, F.XXX mul, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), Monoid.make(mul, one));\n\t}\n\n\tstatic Ring make(AbelianGroup add, Monoid mul) {\n\t\treturn new Ring() {\n\t\t\tpublic AbelianGroup add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic Monoid mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface CommutativeRing extends Ring {\n\tCommutativeMonoid mul();\n\n\tstatic CommutativeRing make(F.XXX add, F.XX neg, F.XXX mul, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), CommutativeMonoid.make(mul, one));\n\t}\n\n\tstatic CommutativeRing make(AbelianGroup add, CommutativeMonoid mul) {\n\t\treturn new CommutativeRing() {\n\t\t\tpublic AbelianGroup add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic CommutativeMonoid mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface EuclideanRing extends CommutativeRing {\n\tA div(A a, A b);\n\n\tA mod(A a, A b);\n\n\tstatic EuclideanRing make(F.XXX add, F.XX neg, F.XXX mul, F.XXX div,\n\t\t\tF.XXX mod, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), CommutativeMonoid.make(mul, one), div, mod);\n\t}\n\n\tstatic EuclideanRing make(AbelianGroup add, CommutativeMonoid mul, F.XXX div,\n\t\t\tF.XXX mod) {\n\t\tfinal A zero = add.e();\n\t\tfinal A one = mul.e();\n\t\treturn new EuclideanRing() {\n\t\t\tpublic AbelianGroup add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic CommutativeMonoid mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\n\t\t\tpublic A div(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn b.equals(one) ? a : div.f(a, b);\n\t\t\t}\n\n\t\t\tpublic A mod(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn b.equals(one) ? zero : mod.f(a, b);\n\t\t\t}\n\t\t};\n\t}\n}\n\ninterface Field extends EuclideanRing {\n\tAbelianGroup mul();\n\n\tstatic Field make(F.XXX add, F.XX neg, F.XXX mul, F.XX inv, A zero, A one) {\n\t\treturn make(AbelianGroup.make(add, neg, zero), AbelianGroup.make(mul, inv, one));\n\t}\n\n\tstatic Field make(AbelianGroup add, AbelianGroup mul) {\n\t\tfinal A zero = add.e();\n\t\tfinal A one = mul.e();\n\t\treturn new Field() {\n\t\t\tpublic AbelianGroup add() {\n\t\t\t\treturn add;\n\t\t\t}\n\n\t\t\tpublic AbelianGroup mul() {\n\t\t\t\treturn mul;\n\t\t\t}\n\n\t\t\tpublic A div(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn b.equals(one) ? a : mul.g(a, mul.inv(b));\n\t\t\t}\n\n\t\t\tpublic A mod(A a, A b) {\n\t\t\t\tif (b.equals(zero))\n\t\t\t\t\tthrow new ArithmeticException(\"division by zero\");\n\t\t\t\treturn zero;\n\t\t\t}\n\t\t};\n\t}\n}\n\nfinal class Alg {\n\tprivate Alg() {\n\t}\n\n\tstatic > A gcd(A a, A b, EuclideanRing ring) {\n\t\tAbelianGroup add = ring.add();\n\t\tA zero = add.e();\n\t\tint sa = a.compareTo(zero);\n\t\tint sb = b.compareTo(zero);\n\t\tif (sa == 0)\n\t\t\treturn b;\n\t\tif (sb == 0)\n\t\t\treturn a;\n\t\tif (sa < 0)\n\t\t\ta = add.inv(a);\n\t\tif (sb < 0)\n\t\t\tb = add.inv(b);\n\t\tif (a.compareTo(b) < 0) {\n\t\t\tA tmp = a;\n\t\t\ta = b;\n\t\t\tb = tmp;\n\t\t}\n\t\twhile (true) {\n\t\t\tA c = ring.mod(a, b);\n\t\t\tif (c.compareTo(zero) == 0)\n\t\t\t\treturn b;\n\t\t\ta = b;\n\t\t\tb = c;\n\t\t}\n\t}\n\n\tstatic long gcd(long a, long b) {\n\t\tif (a == 0)\n\t\t\treturn b;\n\t\tif (b == 0)\n\t\t\treturn a;\n\t\tif (a < 0)\n\t\t\ta = -a;\n\t\tif (b < 0)\n\t\t\tb = -b;\n\t\tif (a < b) {\n\t\t\ta ^= b;\n\t\t\tb ^= a;\n\t\t\ta ^= b;\n\t\t}\n\t\twhile (true) {\n\t\t\tlong c = a % b;\n\t\t\tif (c == 0)\n\t\t\t\treturn b;\n\t\t\ta = b;\n\t\t\tb = c;\n\t\t}\n\t}\n\n\tstatic int gcd(int a, int b) {\n\t\treturn (int) gcd((long) a, (long) b);\n\t}\n\n\tstatic > int[] lis(F.IX access, int size) {\n\t\tObject[] dp = new Object[size];\n\t\tint[][] dpIndices = new int[size][2];\n\t\tdp[0] = access.f(0);\n\t\tint len = 1;\n\t\tint lidx = 0;\n\t\tfor (int i = 1; i < size; i++) {\n\t\t\tA ai = access.f(i);\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tint idx = U.searchI(-1, len, j -> ai.compareTo((A) dp[j]) <= 0); // replace <= with < to return NLDS\n\t\t\tdp[idx] = ai;\n\t\t\tdpIndices[idx][0] = i;\n\t\t\tif (idx == len) {\n\t\t\t\tlidx = i;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t\tif (idx > 0)\n\t\t\t\tdpIndices[i][1] = dpIndices[idx - 1][0];\n\t\t}\n\t\tint[] res = new int[len];\n\t\tres[len - 1] = lidx;\n\t\tfor (int i = len - 1; i >= 0; i--) {\n\t\t\tres[i] = lidx;\n\t\t\tlidx = dpIndices[lidx][1];\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic A pow(A a, long b, Monoid monoid) {\n\t\tA res = monoid.e();\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) != 0)\n\t\t\t\tres = monoid.g(res, a);\n\t\t\ta = monoid.g(a, a);\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic A pow(A a, BigInteger b, Monoid monoid) {\n\t\tA res = monoid.e();\n\t\twhile (b.compareTo(BigInteger.ZERO) > 0) {\n\t\t\tif ((b.and(BigInteger.ONE)).intValueExact() != 0)\n\t\t\t\tres = monoid.g(res, a);\n\t\t\ta = monoid.g(a, a);\n\t\t\tb = b.divide(BigInteger.valueOf(2));\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic long pow(long a, long b) {\n\t\tlong res = 1;\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) != 0)\n\t\t\t\tres *= a;\n\t\t\ta *= a;\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tstatic > T extgcd(A a, A b, EuclideanRing ring) { // returns (x, y, d) s.t. ax + by = d\n\t\tAbelianGroup add = ring.add();\n\t\tCommutativeMonoid mul = ring.mul();\n\t\tA zero = add.e();\n\t\tA one = mul.e();\n\t\tA sa = a.compareTo(zero) < 0 ? add.inv(one) : one;\n\t\tA sb = b.compareTo(zero) < 0 ? add.inv(one) : one;\n\t\ta = mul.g(a, sa);\n\t\tb = mul.g(b, sb);\n\t\tA x = one;\n\t\tA y = zero;\n\t\tA z = zero;\n\t\tA w = one;\n\t\twhile (b.compareTo(zero) > 0) {\n\t\t\tA q = ring.div(a, b);\n\t\t\tA t = z;\n\t\t\tz = add.g(x, add.inv(mul.g(q, z)));\n\t\t\tx = t;\n\t\t\tt = w;\n\t\t\tw = add.g(y, add.inv(mul.g(q, w)));\n\t\t\ty = t;\n\t\t\tt = b;\n\t\t\tb = add.g(a, add.inv(mul.g(q, b)));\n\t\t\ta = t;\n\t\t}\n\t\treturn T.make(mul.g(x, sa), mul.g(y, sb), a);\n\t}\n\n\tstatic TL extgcd(long a, long b) {\n\t\tint sa = a < 0 ? -1 : 1;\n\t\tint sb = b < 0 ? -1 : 1;\n\t\ta *= sa;\n\t\tb *= sb;\n\t\tlong x = 1;\n\t\tlong y = 0;\n\t\tlong z = 0;\n\t\tlong w = 1;\n\t\twhile (b > 0) {\n\t\t\tlong q = a / b;\n\t\t\tlong t = z;\n\t\t\tz = x - q * z;\n\t\t\tx = t;\n\t\t\tt = w;\n\t\t\tw = y - q * w;\n\t\t\ty = t;\n\t\t\tt = b;\n\t\t\tb = a - q * b;\n\t\t\ta = t;\n\t\t}\n\t\treturn TL.make(x * sa, y * sb, a);\n\t}\n\n\tstatic TI extgcd(int a, int b) {\n\t\treturn extgcd((long) a, (long) b).toInt();\n\t}\n\n\tstatic ArrayList factorize(int n) { // factor, exponent\n\t\tArrayList res = new ArrayList();\n\t\tfor (int i = 2; i * i <= n; i++) {\n\t\t\tint count = 0;\n\t\t\twhile (n % i == 0) {\n\t\t\t\tn /= i;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count > 0)\n\t\t\t\tres.add(PI.make(i, count));\n\t\t}\n\t\tif (n > 1)\n\t\t\tres.add(PI.make(n, 1));\n\t\treturn res;\n\t}\n\n\tstatic ArrayList factorize(long n) { // factor, exponent\n\t\tArrayList res = new ArrayList();\n\t\tfor (int i = 2; i * i <= n; i++) {\n\t\t\tint count = 0;\n\t\t\twhile (n % i == 0) {\n\t\t\t\tn /= i;\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tif (count > 0)\n\t\t\t\tres.add(PL.make(i, count));\n\t\t}\n\t\tif (n > 1)\n\t\t\tres.add(PL.make(n, 1));\n\t\treturn res;\n\t}\n\n\tstatic A arithSum(A a, A d, long num, Ring ring) {\n\t\treturn arithGeomSum(a, d, ring.one(), ring.one(), num, ring);\n\t}\n\n\tstatic A geomSum(A b, A r, long num, Ring ring) {\n\t\treturn arithGeomSum(ring.one(), ring.zero(), b, r, num, ring);\n\t}\n\n\tstatic A arithGeomSum(A a, A d, A b, A r, long num, Ring ring) { // Σ(a+(i-1)d)br^(i-1)\n\t\tAbelianGroup add = ring.add();\n\t\tMonoid mul = ring.mul();\n\t\tMonoid> matMul = Mat.mulRing(3, ring);\n\t\tA zero = ring.zero();\n\t\tA one = ring.one();\n\t\tMN mat = pow(Mat.make(new Object[][] { { r, d, a }, { zero, r, r }, { zero, zero, one } }), num - 1, matMul);\n\t\treturn mul.g(add.g(add.g(mul.g(mat.at(0, 0), a), mul.g(mat.at(0, 1), r)), mat.at(0, 2)), b);\n\t}\n}\n\nclass MN {\n\tfinal int m;\n\tfinal int n;\n\tprivate final Object[][] as;\n\n\tstatic class Scalar extends MN {\n\t\tfinal long l;\n\t\tA a;\n\n\t\tScalar(int m, int n, long l, A zero, A oneTimesL) {\n\t\t\tsuper(m, n, (i, j) -> i == j ? oneTimesL : zero);\n\t\t\tthis.a = oneTimesL;\n\t\t\tthis.l = l;\n\t\t}\n\t}\n\n\tMN(int m, int n, Mat.Accessor accessor) {\n\t\tthis.m = m;\n\t\tthis.n = n;\n\t\tas = new Object[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tas[i][j] = accessor.at(i, j);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic String toString() {\n\t\tString s = \"\";\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\ts += i == 0 ? \"[[ \" : \" [ \";\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\ts += (j == 0 ? \"\" : \", \") + as[i][j];\n\t\t\t}\n\t\t\ts += i == m - 1 ? \" ]]\" : \" ]\\n\";\n\t\t}\n\t\treturn s;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tA at(int i, int j) {\n\t\treturn (A) as[i][j];\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tA[][] toArray() {\n\t\tA[][] res = (A[][]) Array.newInstance(as[0][0].getClass(), m, n);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (A) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tint[][] toIntArray() {\n\t\tint[][] res = new int[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (int) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tlong[][] toLongArray() {\n\t\tlong[][] res = new long[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (long) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\tdouble[][] toDoubleArray() {\n\t\tdouble[][] res = new double[m][n];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tres[i][j] = (double) as[i][j];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n}\n\nclass Mat {\n\tinterface Accessor {\n\t\tA at(int i, int j);\n\t}\n\n\tprivate static MN.Scalar make(int m, int n, long l, A zero, A oneTimesL) {\n\t\treturn new MN.Scalar(m, n, l, zero, oneTimesL);\n\t}\n\n\tstatic MN make(int m, int n, Accessor accessor) {\n\t\treturn new MN(m, n, accessor);\n\t}\n\n\tstatic MN make(int m, int n, A[][] as) {\n\t\treturn new MN(m, n, (i, j) -> as[i][j]);\n\t}\n\n\tstatic MN make(int[][] as) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> (long) as[i][j]);\n\t}\n\n\tstatic MN make(long[][] as) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> as[i][j]);\n\t}\n\n\tstatic MN make(double[][] as) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> as[i][j]);\n\t}\n\n\tstatic MN make(int[][] as, F.IX toA) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\tstatic MN make(long[][] as, F.LX toA) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\tstatic MN make(double[][] as, F.DX toA) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\tstatic MN make(B[][] as, F.XX toA) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> toA.f(as[i][j]));\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tstatic MN make(Object[][] as) {\n\t\treturn new MN(as.length, as.length == 0 ? 0 : as[0].length, (i, j) -> (A) as[i][j]);\n\t}\n\n\tstatic MN eye(int n, Ring ring) {\n\t\treturn make(n, n, (i, j) -> i == j ? ring.mul().e() : ring.add().e());\n\t}\n\n\tstatic AbelianGroup> add(int m, int n, Ring ring) {\n\t\treturn AbelianGroup.make((a, b) -> add(a, b, ring), a -> neg(a, ring), make(m, n, 0, ring.zero(), ring.zero()));\n\t}\n\n\tstatic Monoid> mulRing(int n, Ring ring) {\n\t\treturn Monoid.make((a, b) -> mul(a, b, ring), make(n, n, 1, ring.zero(), ring.one()));\n\t}\n\n\tstatic AbelianGroup> mulField(int n, Field field) {\n\t\treturn AbelianGroup.make((a, b) -> mul(a, b, field), a -> inv(a, field),\n\t\t\t\tmake(n, n, 1, field.zero(), field.one()));\n\t}\n\n\tstatic MN add(MN a, MN b, Ring ring) {\n\t\tint m = U.max(a.m, b.m);\n\t\tint n = U.max(a.n, b.n);\n\t\tAbelianGroup add = ring.add();\n\t\tif (a instanceof MN.Scalar && b instanceof MN.Scalar) {\n\t\t\tMN.Scalar as = ((MN.Scalar) a);\n\t\t\tMN.Scalar bs = ((MN.Scalar) b);\n\t\t\treturn make(m, n, as.l + bs.l, ring.zero(), add.g(as.a, bs.a));\n\t\t}\n\t\treturn make(m, n, (i, j) -> add.g(a.at(i, j), b.at(i, j)));\n\t}\n\n\tstatic MN neg(MN a, Ring ring) {\n\t\tif (a instanceof MN.Scalar) {\n\t\t\tMN.Scalar as = ((MN.Scalar) a);\n\t\t\treturn make(a.m, a.n, -as.l, ring.zero(), ring.add().inv(as.a));\n\t\t}\n\t\treturn make(a.m, a.n, (i, j) -> ring.add().inv(a.at(i, j)));\n\t}\n\n\tstatic MN mul(MN a, MN b, Ring ring) {\n\t\tint m = a.m;\n\t\tint u = U.max(a.n, b.m);\n\t\tint n = b.n;\n\t\tAbelianGroup add = ring.add();\n\t\tMonoid mul = ring.mul();\n\t\tif (a instanceof MN.Scalar && b instanceof MN.Scalar) {\n\t\t\tMN.Scalar as = ((MN.Scalar) a);\n\t\t\tMN.Scalar bs = ((MN.Scalar) b);\n\t\t\treturn make(m, n, as.l * bs.l, ring.zero(), mul.g(as.a, bs.a));\n\t\t}\n\t\treturn make(m, n, (i, j) -> {\n\t\t\tA res = ring.zero();\n\t\t\tfor (int k = 0; k < u; k++)\n\t\t\t\tres = add.g(res, mul.g(a.at(i, k), b.at(k, j)));\n\t\t\treturn res;\n\t\t});\n\t}\n\n\tstatic A det(MN a, Field field) {\n\t\treturn detInv(a, field).a;\n\t}\n\n\tstatic MN inv(MN a, Field field) {\n\t\tUP> detInv = detInv(a, field);\n\t\tif (detInv.a.equals(field.zero()))\n\t\t\tthrow new ArithmeticException(\"inverse does not exist: det=0\");\n\t\treturn detInv.b;\n\t}\n\n\t@SuppressWarnings(\"unchecked\")\n\tprivate static UP> detInv(MN a, Field field) {\n\t\tif (a.m != a.n)\n\t\t\tthrow new IllegalArgumentException(\"matrix not square\");\n\t\tif (field.zero() instanceof Long) {\n\t\t\tUP> detInv = detInvLong((MN) a, (Field) field);\n\t\t\treturn UP.make((A) detInv.a, (MN) detInv.b);\n\t\t}\n\t\tint n = a.n;\n\t\tAbelianGroup add = field.add();\n\t\tAbelianGroup mul = field.mul();\n\t\tA zero = field.zero();\n\t\tA one = field.one();\n\t\tA[][] m1 = a.toArray();\n\t\tA[][] m2 = eye(n, field).toArray();\n\t\tA res = one;\n\t\tint sign = 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint pivot = -1;\n\t\t\tfor (int j = i; j < n; j++) {\n\t\t\t\tif (!m1[j][i].equals(zero)) {\n\t\t\t\t\tpivot = j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (pivot == -1) {\n\t\t\t\treturn UP.make(zero, null);\n\t\t\t}\n\t\t\tif (pivot != i) {\n\t\t\t\tsign = -sign;\n\t\t\t\tA tmp;\n\t\t\t\tfor (int j = i; j < n; j++) { // [0, i) are zero\n\t\t\t\t\ttmp = m1[i][j];\n\t\t\t\t\tm1[i][j] = m1[pivot][j];\n\t\t\t\t\tm1[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\ttmp = m2[i][j];\n\t\t\t\t\tm2[i][j] = m2[pivot][j];\n\t\t\t\t\tm2[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t\tA d = m1[i][i];\n\t\t\tres = mul.g(res, d);\n\t\t\td = mul.inv(d);\n\t\t\tm1[i][i] = one;\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tm1[i][j] = mul.g(m1[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tm2[i][j] = mul.g(m2[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (i == j)\n\t\t\t\t\tcontinue;\n\t\t\t\tA mult = m1[j][i];\n\t\t\t\tm1[j][i] = zero;\n\t\t\t\tfor (int k = i + 1; k < n; k++) {\n\t\t\t\t\tm1[j][k] = add.g(m1[j][k], add.inv(mul.g(m1[i][k], mult)));\n\t\t\t\t}\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tm2[j][k] = add.g(m2[j][k], add.inv(mul.g(m2[i][k], mult)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn UP.make(sign == 1 ? res : add.inv(res), make(m2));\n\t}\n\n\tprivate static UP> detInvLong(MN a, Field field) {\n\t\tif (a.m != a.n)\n\t\t\tthrow new IllegalArgumentException(\"matrix not square\");\n\t\tint n = a.n;\n\t\tAbelianGroup add = field.add();\n\t\tAbelianGroup mul = field.mul();\n\t\tlong zero = field.zero();\n\t\tlong one = field.one();\n\t\tlong[][] m1 = a.toLongArray();\n\t\tlong[][] m2 = eye(n, field).toLongArray();\n\t\tlong res = one;\n\t\tint sign = 1;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint pivot = -1;\n\t\t\tfor (int j = i; j < n; j++) {\n\t\t\t\tif (m1[j][i] != zero) {\n\t\t\t\t\tpivot = j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (pivot == -1) {\n\t\t\t\treturn UP.make(zero, null);\n\t\t\t}\n\t\t\tif (pivot != i) {\n\t\t\t\tsign = -sign;\n\t\t\t\tlong tmp;\n\t\t\t\tfor (int j = i; j < n; j++) { // [0, i) are zero\n\t\t\t\t\ttmp = m1[i][j];\n\t\t\t\t\tm1[i][j] = m1[pivot][j];\n\t\t\t\t\tm1[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\t\ttmp = m2[i][j];\n\t\t\t\t\tm2[i][j] = m2[pivot][j];\n\t\t\t\t\tm2[pivot][j] = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong d = m1[i][i];\n\t\t\tres = mul.g(res, d);\n\t\t\td = mul.inv(d);\n\t\t\tm1[i][i] = one;\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tm1[i][j] = mul.g(m1[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tm2[i][j] = mul.g(m2[i][j], d);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (i == j)\n\t\t\t\t\tcontinue;\n\t\t\t\tlong mult = m1[j][i];\n\t\t\t\tm1[j][i] = zero;\n\t\t\t\tfor (int k = i + 1; k < n; k++) {\n\t\t\t\t\tm1[j][k] = add.g(m1[j][k], add.inv(mul.g(m1[i][k], mult)));\n\t\t\t\t}\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tm2[j][k] = add.g(m2[j][k], add.inv(mul.g(m2[i][k], mult)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn UP.make(sign == 1 ? res : add.inv(res), make(m2));\n\t}\n\n\tstatic Ring> ring(int n, Ring ring) {\n\t\treturn Ring.make(add(n, n, ring), mulRing(n, ring));\n\t}\n\n\tstatic Field> field(int n, Field field) {\n\t\treturn Field.make(add(n, n, field), mulField(n, field));\n\t}\n\n\tstatic VM> vm(int n, Ring ring) {\n\t\tif (ring instanceof Field)\n\t\t\treturn vmField(n, (Field) ring);\n\t\treturn vmRing(n, ring);\n\t}\n\n\tprivate static VM> vmRing(int n, Ring ring) {\n\t\tRing> matRing = ring(n, ring);\n\t\tMonoid> matMul = matRing.mul();\n\t\tAbelianGroup add = ring.add();\n\t\tMonoid mul = ring.mul();\n\t\tA zero = add.e();\n\t\tA one = mul.e();\n\t\treturn new VM>(matRing, null, null, (a, b) -> {\n\t\t\tif (b instanceof MN.Scalar) {\n\t\t\t\tMN.Scalar bs = ((MN.Scalar) b);\n\t\t\t\tif (bs.l < 0)\n\t\t\t\t\tthrow new RuntimeException(\"pow(MN, <0) is not defined\");\n\t\t\t\treturn Alg.pow(a, bs.l, matMul);\n\t\t\t}\n\t\t\tthrow new RuntimeException(\"pow(MN, MN) is not defined\");\n\t\t}, null, l -> make(n, n, l, zero, Alg.pow(one, l, add)), a -> a);\n\t}\n\n\tprivate static VM> vmField(int n, Field field) {\n\t\tField> matField = field(n, field);\n\t\tAbelianGroup> matMul = matField.mul();\n\t\tA zero = field.zero();\n\t\tA one = field.one();\n\t\treturn new VM>(matField, (a, b) -> {\n\t\t\tif (b instanceof MN.Scalar) {\n\t\t\t\tMN.Scalar bs = ((MN.Scalar) b);\n\t\t\t\tif (bs.l < 0)\n\t\t\t\t\treturn Alg.pow(inv(a, field), -bs.l, matMul);\n\t\t\t\treturn Alg.pow(a, bs.l, matMul);\n\t\t\t}\n\t\t\tthrow new RuntimeException(\"pow(MN, MN) is not defined\");\n\t\t}, a -> inv(a, field), l -> make(n, n, l, zero, Alg.pow(one, l, field.add())), a -> a);\n\t}\n}\n\nclass VM {\n\tprivate final HashMap env;\n\tprivate final Evaluator etor;\n\tprivate final F.XX filter;\n\n\tVM(F.XXX add, F.XXX sub, F.XXX mul, F.XXX div, F.XXX mod,\n\t\t\tF.XXX pow, F.XX neg, F.XX fact, F.LX fromInt, F.XX filter) {\n\t\tenv = new HashMap();\n\t\tetor = SimpleLang.makeEvaluator((s, a) -> {\n\t\t\tenv.put(s, a);\n\t\t\treturn a;\n\t\t}, add, sub, mul, div, mod, pow, neg, fact, fromInt, s -> {\n\t\t\tif (env.containsKey(s))\n\t\t\t\treturn env.get(s);\n\t\t\tthrow new RuntimeException(\"no such variable: \" + s);\n\t\t});\n\t\tthis.filter = filter;\n\t}\n\n\tVM(Ring ring, F.XXX div, F.XXX mod, F.XXX pow, F.XX fact, F.LX fromInt,\n\t\t\tF.XX filter) {\n\t\tthis(ring.add()::g, (a, b) -> ring.add().g(a, ring.add().inv(b)), ring.mul()::g, div, mod, pow, ring.add()::inv,\n\t\t\t\tfact, fromInt, filter);\n\t}\n\n\tVM(EuclideanRing ring, F.XXX pow, F.XX fact, F.LX fromInt, F.XX filter) {\n\t\tthis(ring, ring::div, ring::mod, pow, fact, fromInt, filter);\n\t}\n\n\tvoid clear() {\n\t\tenv.clear();\n\t}\n\n\tA get(String id) {\n\t\treturn env.get(id);\n\t}\n\n\tvoid print(String id, F.XV printer) {\n\t\tprinter.f(\"\" + get(id));\n\t}\n\n\t@SafeVarargs\n\tfinal void set(String idsSp, A... as) {\n\t\tString[] ids = idsSp.trim().split(\" +\");\n\t\tint n = ids.length;\n\t\tif (as.length != n)\n\t\t\tthrow new IllegalArgumentException(\"argument size mismatch: \" + n + \" != \" + as.length);\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tset(ids[i], as[i]);\n\t}\n\n\tvoid set(String id, A a) {\n\t\tenv.put(id, filter.f(a));\n\t}\n\n\tA run(String expr) {\n\t\treturn AST.eval(SimpleLang.parse(expr), etor);\n\t}\n}\n\nclass AST { // Abstract Syntax Tree\n\tstatic class AssignOp extends AST {\n\t\tString id;\n\t\tAST r;\n\n\t\tAssignOp(String id, AST r) {\n\t\t\tthis.id = id;\n\t\t\tthis.r = r;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"Assign(\" + id + \", \" + r + \")\";\n\t\t}\n\t}\n\n\tstatic class Multi extends AST {\n\t\tArrayList as;\n\n\t\tMulti(ArrayList as) {\n\t\t\tthis.as = as;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\tString s = \"\";\n\t\t\tfor (AST a : as)\n\t\t\t\ts += s.isEmpty() ? a : \"; \" + a;\n\t\t\treturn \"Multi(\" + s + \")\";\n\t\t}\n\t}\n\n\tstatic class BinOp extends AST {\n\t\tAST l;\n\t\tAST r;\n\t\tString op;\n\n\t\tBinOp(AST l, String op, AST r) {\n\t\t\tthis.l = l;\n\t\t\tthis.op = op;\n\t\t\tthis.r = r;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"BinOp(\" + l + \", \" + op + \", \" + r + \")\";\n\t\t}\n\t}\n\n\tstatic class UnOp extends AST {\n\t\tAST a;\n\t\tString op;\n\n\t\tUnOp(String op, AST a) {\n\t\t\tthis.op = op;\n\t\t\tthis.a = a;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"UnOp(\" + op + \", \" + a + \")\";\n\t\t}\n\t}\n\n\tstatic class Int extends AST {\n\t\tlong v;\n\n\t\tInt(long v) {\n\t\t\tthis.v = v;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"Int(\" + v + \")\";\n\t\t}\n\t}\n\n\tstatic class Id extends AST {\n\t\tString s;\n\n\t\tId(String s) {\n\t\t\tthis.s = s;\n\t\t}\n\n\t\tpublic String toString() {\n\t\t\treturn \"Id(\" + s + \")\";\n\t\t}\n\t}\n\n\tstatic A eval(AST a, Evaluator etor) {\n\t\tif (a instanceof AssignOp)\n\t\t\treturn etor.assign(((AssignOp) a).id, eval(((AssignOp) a).r, etor));\n\t\tif (a instanceof Multi) {\n\t\t\tA last = null;\n\t\t\tfor (AST a2 : ((Multi) a).as)\n\t\t\t\tlast = eval(a2, etor);\n\t\t\treturn last;\n\t\t}\n\t\tif (a instanceof BinOp)\n\t\t\treturn etor.binOp(((BinOp) a).op, eval(((BinOp) a).l, etor), eval(((BinOp) a).r, etor));\n\t\tif (a instanceof UnOp)\n\t\t\treturn etor.unOp(((UnOp) a).op, eval(((UnOp) a).a, etor));\n\t\tif (a instanceof Int)\n\t\t\treturn etor.fromInt(((Int) a).v);\n\t\tif (a instanceof Id)\n\t\t\treturn etor.id(((Id) a).s);\n\t\tthrow new RuntimeException(\"unexpected ast: \" + a);\n\t}\n}\n\ninterface Evaluator {\n\tA assign(String s, A a);\n\n\tA binOp(String op, A a, A b);\n\n\tA unOp(String op, A a);\n\n\tA fromInt(long a);\n\n\tA id(String s);\n}\n\nclass Seq {\n\tArrayList as;\n\tint ptr;\n\n\tSeq(ArrayList as) {\n\t\tthis.as = as;\n\t\tptr = 0;\n\t}\n\n\tboolean hasNext(int num) {\n\t\treturn ptr + num < as.size();\n\t}\n\n\tboolean hasNext() {\n\t\treturn hasNext(0);\n\t}\n\n\tA next(int num) {\n\t\treturn ptr + num < as.size() ? as.get(ptr + num) : null;\n\t}\n\n\tA next() {\n\t\treturn next(0);\n\t}\n\n\tA read() {\n\t\treturn hasNext() ? as.get(ptr++) : null;\n\t}\n\n\tA read(A a) {\n\t\tif (!hasNext())\n\t\t\tthrow new RuntimeException(\"unexpected EOF\");\n\t\tif (!isNext(a))\n\t\t\tthrow new RuntimeException(\"expected \" + a + \" but got\" + next());\n\t\treturn read();\n\t}\n\n\tA read(F.XX f) {\n\t\tif (!hasNext())\n\t\t\tthrow new RuntimeException(\"unexpected EOF\");\n\t\tif (!f.f(next()))\n\t\t\tthrow new RuntimeException(\"f(\" + next() + \") returned false\");\n\t\treturn read();\n\t}\n\n\tboolean isNext(A a) {\n\t\treturn a.equals(next());\n\t}\n\n\tboolean isNext(@SuppressWarnings(\"unchecked\") A... as) {\n\t\tfor (A a : as)\n\t\t\tif (isNext(a))\n\t\t\t\treturn true;\n\t\treturn false;\n\t}\n\n\tboolean isNext(F.XX f) {\n\t\treturn hasNext() && f.f(next());\n\t}\n\n\tA readIf(F.XX f) {\n\t\tif (isNext(f))\n\t\t\treturn read();\n\t\treturn null;\n\t}\n\n\tA readIf(@SuppressWarnings(\"unchecked\") A... as) {\n\t\tfor (A a : as)\n\t\t\tif (isNext(a)) {\n\t\t\t\tptr++;\n\t\t\t\treturn a;\n\t\t\t}\n\t\treturn null;\n\t}\n\n\tpublic String toString() {\n\t\treturn as.toString();\n\t}\n}\n\nclass Token extends P {\n\tprivate static final int ID = 1;\n\tprivate static final int SYM = 2;\n\tprivate static final int INT = 3;\n\n\tToken(String s, int type) {\n\t\tsuper(s, type);\n\t}\n\n\tboolean is(String s) {\n\t\treturn a.equals(s);\n\t}\n\n\tstatic Token ofId(String s) {\n\t\treturn new Token(s, ID);\n\t}\n\n\tstatic Token ofSym(String s) {\n\t\treturn new Token(s, SYM);\n\t}\n\n\tstatic Token ofInt(String s) {\n\t\treturn new Token(s, INT);\n\t}\n\n\tboolean isId() {\n\t\treturn b == ID;\n\t}\n\n\tboolean isSym() {\n\t\treturn b == SYM;\n\t}\n\n\tboolean isInt() {\n\t\treturn b == INT;\n\t}\n}\n\nclass SimpleLang {\n\tprivate static class Tokenizer {\n\t\tprivate static final String SYMS = \"+-*/%^!()=;\";\n\n\t\tSeq sc;\n\t\tArrayList ts;\n\n\t\tTokenizer(String s) {\n\t\t\tsc = new Seq(U.make(s.length(), i -> s.charAt(i)));\n\t\t}\n\n\t\tSeq parse() {\n\t\t\tts = new ArrayList();\n\t\t\tparseAll();\n\t\t\treturn new Seq(ts);\n\t\t}\n\n\t\tprivate static boolean isSpace(char c) {\n\t\t\treturn c == ' ' || c == '\\t' || c == '\\r' || c == '\\n';\n\t\t}\n\n\t\tprivate static boolean isDigit(char c) {\n\t\t\treturn c >= '0' && c <= '9';\n\t\t}\n\n\t\tprivate static boolean isSymbol(char c) {\n\t\t\treturn SYMS.indexOf(c) != -1;\n\t\t}\n\n\t\tprivate static boolean isAlpha(char c) {\n\t\t\treturn c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z' || c == '_';\n\t\t}\n\n\t\tprivate void parseAll() {\n\t\t\twhile (sc.hasNext()) {\n\t\t\t\twhile (sc.isNext(Tokenizer::isSpace))\n\t\t\t\t\tsc.read();\n\t\t\t\tif (!sc.hasNext())\n\t\t\t\t\tbreak;\n\t\t\t\tif (sc.isNext(Tokenizer::isAlpha)) {\n\t\t\t\t\tparseId();\n\t\t\t\t} else if (sc.isNext(Tokenizer::isDigit)) {\n\t\t\t\t\tparseInt();\n\t\t\t\t} else if (sc.isNext(Tokenizer::isSymbol)) {\n\t\t\t\t\tparseSym();\n\t\t\t\t} else {\n\t\t\t\t\tthrow new RuntimeException(\"invalid character: \" + sc.next());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprivate void parseId() {\n\t\t\tString s = sc.read().toString();\n\t\t\twhile (sc.isNext(Tokenizer::isAlpha) || sc.isNext(Tokenizer::isDigit))\n\t\t\t\ts += sc.read().toString();\n\t\t\tts.add(Token.ofId(s));\n\t\t}\n\n\t\tprivate void parseInt() {\n\t\t\tString s = sc.read().toString();\n\t\t\twhile (sc.isNext(Tokenizer::isDigit))\n\t\t\t\ts += sc.read().toString();\n\t\t\tts.add(Token.ofInt(s));\n\t\t}\n\n\t\tprivate void parseSym() {\n\t\t\tString s = sc.read().toString();\n\t\t\tts.add(Token.ofSym(s));\n\t\t}\n\t}\n\n\tprivate static class Parser {\n\t\tSeq ts;\n\n\t\tParser(Seq ts) {\n\t\t\tthis.ts = ts;\n\t\t}\n\n\t\tAST parse() {\n\t\t\treturn parseExpr();\n\t\t}\n\n\t\tprivate AST parseExpr() {\n\t\t\treturn parseMultiExpr();\n\t\t}\n\n\t\tprivate AST parseMultiExpr() {\n\t\t\treadSemicolons();\n\t\t\tAST a = parseAssignExpr();\n\t\t\tif (readSemicolons()) {\n\t\t\t\tArrayList as = new ArrayList();\n\t\t\t\tas.add(a);\n\t\t\t\tdo {\n\t\t\t\t\tif (!ts.hasNext())\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tas.add(parseAssignExpr());\n\t\t\t\t} while (readSemicolons());\n\t\t\t\tif (as.size() == 1)\n\t\t\t\t\treturn a;\n\t\t\t\treturn new AST.Multi(as);\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate boolean readSemicolons() {\n\t\t\tif (!ts.isNext(t -> t.is(\";\")))\n\t\t\t\treturn false;\n\t\t\tdo {\n\t\t\t\tts.read();\n\t\t\t} while (ts.isNext(t -> t.is(\";\")));\n\t\t\treturn true;\n\t\t}\n\n\t\tprivate AST parseAssignExpr() {\n\t\t\tAST a = parseAddSubOp();\n\t\t\tif (ts.isNext(t -> t.is(\"=\"))) {\n\t\t\t\tts.read();\n\t\t\t\tif (!(a instanceof AST.Id))\n\t\t\t\t\tthrow new RuntimeException(\"cannot assign to \" + a);\n\t\t\t\treturn new AST.AssignOp(((AST.Id) a).s, parseAssignExpr());\n\t\t\t}\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parseAddSubOp() {\n\t\t\tAST a = parseMulDivModOp();\n\t\t\twhile (ts.isNext(t -> t.is(\"+\") || t.is(\"-\")))\n\t\t\t\ta = new AST.BinOp(a, ts.read().a, parseMulDivModOp());\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parseMulDivModOp() {\n\t\t\tAST a = parsePowOp();\n\t\t\twhile (ts.isNext(t -> t.is(\"*\") || t.is(\"/\") || t.is(\"%\")))\n\t\t\t\ta = new AST.BinOp(a, ts.read().a, parsePowOp());\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parsePowOp() {\n\t\t\tAST a = parseNegateOp();\n\t\t\tif (ts.isNext(t -> t.is(\"^\")))\n\t\t\t\treturn new AST.BinOp(a, ts.read().a, parsePowOp());\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parseNegateOp() {\n\t\t\tif (ts.isNext(t -> t.is(\"-\")))\n\t\t\t\treturn new AST.UnOp(ts.read().a, parseNegateOp());\n\t\t\treturn parseFactOp();\n\t\t}\n\n\t\tprivate AST parseFactOp() {\n\t\t\tAST a = parsePrimary();\n\t\t\twhile (ts.isNext(t -> t.is(\"!\")))\n\t\t\t\ta = new AST.UnOp(ts.read().a, a);\n\t\t\treturn a;\n\t\t}\n\n\t\tprivate AST parsePrimary() {\n\t\t\tif (ts.isNext(t -> t.isId()))\n\t\t\t\treturn new AST.Id(ts.read().a);\n\t\t\tif (ts.isNext(t -> t.isInt()))\n\t\t\t\treturn new AST.Int(Long.parseLong(ts.read().a));\n\t\t\tif (ts.readIf(t -> t.is(\"(\")) != null) {\n\t\t\t\tAST e = parseExpr();\n\t\t\t\tts.read(t -> t.is(\")\"));\n\t\t\t\treturn e;\n\t\t\t}\n\t\t\tthrow new RuntimeException(\"unexpected token: \" + ts.next());\n\t\t}\n\t}\n\n\tstatic HashMap cache = new HashMap();\n\n\tstatic Evaluator makeEvaluator(F.XXX assign, F.XXX add, F.XXX sub,\n\t\t\tF.XXX mul, F.XXX div, F.XXX mod, F.XXX pow, F.XX neg,\n\t\t\tF.XX fact, F.LX fromInt, F.XX id) {\n\t\treturn new Evaluator() {\n\t\t\tpublic A assign(String s, A a) {\n\t\t\t\treturn assign.f(s, a);\n\t\t\t}\n\n\t\t\tpublic A binOp(String op, A a, A b) {\n\t\t\t\tswitch (op) {\n\t\t\t\tcase \"+\":\n\t\t\t\t\treturn add.f(a, b);\n\t\t\t\tcase \"-\":\n\t\t\t\t\treturn sub.f(a, b);\n\t\t\t\tcase \"*\":\n\t\t\t\t\treturn mul.f(a, b);\n\t\t\t\tcase \"/\":\n\t\t\t\t\treturn div.f(a, b);\n\t\t\t\tcase \"%\":\n\t\t\t\t\treturn mod.f(a, b);\n\t\t\t\tcase \"^\":\n\t\t\t\t\treturn pow.f(a, b);\n\t\t\t\t}\n\t\t\t\tthrow new RuntimeException(\"invalid binOp: \" + op);\n\t\t\t}\n\n\t\t\tpublic A unOp(String op, A a) {\n\t\t\t\tswitch (op) {\n\t\t\t\tcase \"-\":\n\t\t\t\t\treturn neg.f(a);\n\t\t\t\tcase \"!\":\n\t\t\t\t\treturn fact.f(a);\n\t\t\t\t}\n\t\t\t\tthrow new RuntimeException(\"invalid unOp: \" + op);\n\t\t\t}\n\n\t\t\tpublic A fromInt(long a) {\n\t\t\t\treturn fromInt.f(a);\n\t\t\t}\n\n\t\t\tpublic A id(String s) {\n\t\t\t\treturn id.f(s);\n\t\t\t}\n\t\t};\n\t}\n\n\tstatic AST parse(String s) {\n\t\tif (cache.containsKey(cache)) {\n\t\t\treturn cache.get(s);\n\t\t}\n\t\tTokenizer l = new Tokenizer(s);\n\t\tSeq ts = l.parse();\n\t\tParser p = new Parser(ts);\n\t\tAST a = p.parse();\n\t\tcache.put(s, a);\n\t\treturn a;\n\t}\n}\n\nclass Mod {\n\tfinal long mod;\n\tfinal AbelianGroup add;\n\tfinal AbelianGroup mul;\n\tfinal Field field;\n\tfinal VM vm;\n\tprivate final boolean prime;\n\tprivate final HashMap logMap;\n\tprivate long[] facts;\n\tprivate long[] invs;\n\tprivate long[] invFacts;\n\tprivate long[] factors;\n\n\tMod(long mod) {\n\t\tthis.mod = mod;\n\t\tprepareFacts(0);\n\t\tprime = BigInteger.valueOf(mod).isProbablePrime(100);\n\t\tadd = AbelianGroup.make((a, b) -> (a + b) % mod, a -> mod - a, 0l);\n\t\tmul = AbelianGroup.make((a, b) -> (a * b) % mod, a -> {\n\t\t\tif (prime)\n\t\t\t\treturn pow(a, mod - 2);\n\t\t\tTL t = Alg.extgcd(a, mod);\n\t\t\tif (t.c != 1)\n\t\t\t\tthrow new ArithmeticException(\"inv(\" + a + \") does not exist\");\n\t\t\treturn (t.a % mod + mod) % mod;\n\t\t}, 1l);\n\t\tfield = Field.make(add, mul);\n\t\tlogMap = new HashMap();\n\t\tvm = new VM(field, this::pow, this::fact, a -> (a % mod + mod) % mod, a -> (a % mod + mod) % mod);\n\t}\n\n\tlong fact(long a) {\n\t\tif (a >= Integer.MAX_VALUE)\n\t\t\tthrow new RuntimeException(\"fact(\" + a + \") too big\");\n\t\tprepareFacts((int) a);\n\t\treturn facts[(int) (a % mod)];\n\t}\n\n\tlong invFact(int a) {\n\t\tprepareFacts(a);\n\t\treturn invFacts[(int) (a % mod)];\n\t}\n\n\tlong inv(long a) {\n\t\treturn mul.inv(a);\n\t}\n\n\tlong pow(long a, long b) {\n\t\tif (b == 0)\n\t\t\treturn 1;\n\t\tif (b == 1)\n\t\t\treturn a;\n\t\tif (b < 0) {\n\t\t\ta = inv(a);\n\t\t\tb = -b;\n\t\t}\n\t\ta %= mod;\n\t\tlong res = 1;\n\t\twhile (b > 0) {\n\t\t\tif ((b & 1) != 0)\n\t\t\t\tres = res * a % mod;\n\t\t\ta = a * a % mod;\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\n\tlong order(long a) { // computes the order of `a` in O(sqrt(mod)) time\n\t\ta %= mod;\n\t\tif (a == 0)\n\t\t\treturn 0;\n\t\tif (a == 1)\n\t\t\treturn 1;\n\t\tif (factors == null) {\n\t\t\tArrayList fs = new ArrayList();\n\t\t\tfor (long i = 2; i * i < mod; i++) {\n\t\t\t\tif ((mod - 1) % i == 0)\n\t\t\t\t\tfs.add(i);\n\t\t\t}\n\t\t\tfactors = new long[fs.size()];\n\t\t\tfor (int i = 0; i < fs.size(); i++) {\n\t\t\t\tfactors[i] = fs.get(i);\n\t\t\t}\n\t\t}\n\t\tfor (long f : factors) {\n\t\t\tif (pow(a, f) == 1)\n\t\t\t\treturn f;\n\t\t}\n\t\treturn mod - 1;\n\t}\n\n\tPL log(long a, long b) { // log_b(a) in O(sqrt(mod)) time\n\t\ta %= mod;\n\t\tb %= mod;\n\t\tif (b == 1 || b == 0)\n\t\t\treturn a == b ? PL.make(1, 1) : PL.make(-1, 0);\n\t\tif (a == 0)\n\t\t\treturn PL.make(-1, 0);\n\t\tlong order = order(b);\n\t\tif (a == 1)\n\t\t\treturn PL.make(0, order);\n\t\tlong orderSqrtL = sqrtCeil(order);\n\t\tif (orderSqrtL > Integer.MAX_VALUE)\n\t\t\tthrow new RuntimeException(\"order(\" + b + \") too big: \" + order);\n\t\tint orderSqrt = (int) sqrtCeil(order);\n\t\tlogMap.clear();\n\t\tlogMap.put(1l, 0);\n\t\tlong p = 1;\n\t\tfor (int i = 1; i < orderSqrt; i++) {\n\t\t\tp = p * b % mod;\n\t\t\tlogMap.put(p, i);\n\t\t}\n\t\tlong ib = pow(b, mod - orderSqrt - 1);\n\t\tp = a;\n\t\tfor (int i = 1; i < orderSqrt; i++) {\n\t\t\tp = p * ib % mod;\n\t\t\tif (logMap.containsKey(p))\n\t\t\t\treturn PL.make((i * orderSqrt + logMap.get(p)) % order, order);\n\t\t}\n\t\treturn PL.make(-1, 0);\n\t}\n\n\tprivate long sqrtCeil(long a) {\n\t\treturn U.searchL((long) Math.sqrt(a * 0.9), (long) Math.sqrt(a * 1.1) + 1, mid -> mid * mid >= a);\n\t}\n\n\tprivate void prepareFacts(int n) {\n\t\tif (facts == null) {\n\t\t\tfacts = new long[1024];\n\t\t\tinvs = new long[1024];\n\t\t\tinvFacts = new long[1024];\n\t\t\tprepareFactsIn(0, 1024);\n\t\t}\n\t\tif (n >= mod)\n\t\t\tn = (int) (mod - 1);\n\t\twhile (facts.length <= n) {\n\t\t\tint prevL = facts.length;\n\t\t\tint newL = prevL << 1;\n\t\t\tfacts = Arrays.copyOf(facts, newL);\n\t\t\tinvs = Arrays.copyOf(invs, newL);\n\t\t\tinvFacts = Arrays.copyOf(invFacts, newL);\n\t\t\tprepareFactsIn(prevL, newL);\n\t\t}\n\t}\n\n\tprivate void prepareFactsIn(int from, int until) {\n\t\tif (until > mod)\n\t\t\tuntil = (int) mod;\n\t\tfor (int i = from; i < until; i++) {\n\t\t\tif (i == 0) {\n\t\t\t\tfacts[0] = 1;\n\t\t\t\tinvs[0] = 0;\n\t\t\t\tinvFacts[0] = 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (i == 1) {\n\t\t\t\tfacts[1] = 1;\n\t\t\t\tinvs[1] = 1;\n\t\t\t\tinvFacts[1] = 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfacts[i] = facts[i - 1] * i % mod;\n\t\t\tinvs[i] = (mod - mod / i) * invs[(int) (mod % i)] % mod;\n\t\t\tinvFacts[i] = invFacts[i - 1] * invs[i] % mod;\n\t\t}\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "sample_input": "2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02831", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86721, "cpu_time_ms": 76, "memory_kb": 23508}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s610431657", "group_id": "codeNet:p02838", "input_text": "import java.util.*;\nimport java.io.*;\npublic class Main {\n static long mod = 1000000007;\n static ArrayList A = new ArrayList();\n public static void main(String[] args) throws Exception {\n InputStreamReader r = new InputStreamReader(System.in);\n int N = nextInt(r);\n A.add(nextLong(r));\n long ans = 0;\n for (int i = 1; i < N; i++) {\n long n = nextLong(r);\n ans += xorSum(n) % mod;\n A.add(n);\n }\n System.out.println(ans % mod);\n }\n\n public static int nextInt(InputStreamReader r) throws Exception {\n String str = \"\";\n while (true) {\n int c = r.read();\n if (c == 32 || c == 10 || c == -1) {\n break;\n }\n str += (char)c;\n }\n return Integer.parseInt(str);\n }\n\n public static long nextLong(InputStreamReader r) throws Exception {\n String str = \"\";\n while (true) {\n int c = r.read();\n if (c == 32 || c == 10 || c == -1) {\n break;\n }\n str += (char)c;\n }\n return Long.parseLong(str);\n }\n\n public static long xorSum(long n) {\n long res = 0;\n int[] now = set(n);\n for (long x : A) {\n int[] xor = set(x);\n res += sum(now, xor);\n }\n return res % mod;\n }\n\n public static int[] set(long n) {\n int[] res = new int[60];\n for (int i = 0; i < 60; i++) {\n res[i] = n % 2 == 1 ? 1 : 0;\n n = n / 2;\n if (n == 0) break;\n }\n return res;\n }\n\n public static long sum(int[] now, int[] xor) {\n long res = 0;\n for (int i = 0; i < 60; i++) {\n if (now[i] != xor[i]) {\n res += pow(i) % mod;\n }\n }\n return res % mod;\n }\n\n public static long pow(int i) {\n return i == 0 ? 1 : 2 * pow(i-1);\n }\n}\n", "language": "Java", "metadata": {"date": 1578806664, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02838.html", "problem_id": "p02838", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02838/input.txt", "sample_output_relpath": "derived/input_output/data/p02838/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02838/Java/s610431657.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s610431657", "user_id": "u405466046"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\npublic class Main {\n static long mod = 1000000007;\n static ArrayList A = new ArrayList();\n public static void main(String[] args) throws Exception {\n InputStreamReader r = new InputStreamReader(System.in);\n int N = nextInt(r);\n A.add(nextLong(r));\n long ans = 0;\n for (int i = 1; i < N; i++) {\n long n = nextLong(r);\n ans += xorSum(n) % mod;\n A.add(n);\n }\n System.out.println(ans % mod);\n }\n\n public static int nextInt(InputStreamReader r) throws Exception {\n String str = \"\";\n while (true) {\n int c = r.read();\n if (c == 32 || c == 10 || c == -1) {\n break;\n }\n str += (char)c;\n }\n return Integer.parseInt(str);\n }\n\n public static long nextLong(InputStreamReader r) throws Exception {\n String str = \"\";\n while (true) {\n int c = r.read();\n if (c == 32 || c == 10 || c == -1) {\n break;\n }\n str += (char)c;\n }\n return Long.parseLong(str);\n }\n\n public static long xorSum(long n) {\n long res = 0;\n int[] now = set(n);\n for (long x : A) {\n int[] xor = set(x);\n res += sum(now, xor);\n }\n return res % mod;\n }\n\n public static int[] set(long n) {\n int[] res = new int[60];\n for (int i = 0; i < 60; i++) {\n res[i] = n % 2 == 1 ? 1 : 0;\n n = n / 2;\n if (n == 0) break;\n }\n return res;\n }\n\n public static long sum(int[] now, int[] xor) {\n long res = 0;\n for (int i = 0; i < 60; i++) {\n if (now[i] != xor[i]) {\n res += pow(i) % mod;\n }\n }\n return res % mod;\n }\n\n public static long pow(int i) {\n return i == 0 ? 1 : 2 * pow(i-1);\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02838", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1966, "cpu_time_ms": 2110, "memory_kb": 349136}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s605923781", "group_id": "codeNet:p02838", "input_text": "import java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Scanner;\nclass Main{\n\n\n\tstatic final int MOD = 1000000007;\n\n\tstatic int MAX = 10000000;\n\tstatic\tArrayList tree;\n\tstatic HashSet set;\n\tstatic long ans;\n\n\tstatic HashSet memo;\n\tstatic HashMap map;\n\n\tstatic ArrayList> xdata;\n\tstatic ArrayList> ydata; \n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\t\t\t//文字の入力\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\ta[i] = sc.nextLong();\n\t\t}\n\t\t\n\t\t//計算量を考えると、愚直に二重ループを回すと間に合わない。\n\t\t//桁に注目すると60桁しかないため、桁で回すことを考える。\n\t\t//シグマは結局全ての組み合わせであり(順番は関係ない)、各組み合わせのxorでbitが立つのは、片方のi桁目のbitが1でもう片方が0の時のみ\n\t\t//各桁について、全てのa[i]についてbitが0か1か調べてその個数を記録\n\t\t//i桁目について、0の個数がa,1の個数がbの時、全てのxorの組み合わせの総和は、2のi乗*(a*b)\n\t\t//これを全ての桁で行う。\n\t\tlong ans = 0;\n\n\t\tfor(int i = 0;i <= 60;i++){\n\t\t\tint on = 0;\t\t\t\t\t\t//bit立っている\n\t\t\tint off = 0;\t\t\t\t\t\n\t\t\t\n\t\t\t//各a[j]についてi桁目のbit確認\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tif(((a[j] >>> i) & 1) != 0){\n\t\t\t\t\ton++;\n\t\t\t\t}else{\n\t\t\t\t\toff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong p = 1;\n\t\t\tfor(int j = 0;j < i;j++){\n\t\t\t\tp*=2;\n\t\t\t\tp%= MOD;\n\t\t\t}\n\t\t\tlong sub = (on*off)%MOD;\n\t\t\tans += sub*p;\n\t\t\tans %= MOD;\n//\t\t\tSystem.out.println(i + \" on \" +on + \" off \" +off + \" ans \" + ans );\n\n\t\t\t\n\t\t}\n\t\tSystem.out.print(ans);\n\n\n\t}\n\t\n\n\n\n\n\n\nstatic long fac[] = new long[MAX];\nstatic long finv[] = new long[MAX];\nstatic long inv[] = new long[MAX];\n\n\n\n//テーブルの作成\nstatic void COMinit() {\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor (int i = 2; i < MAX; i++){\n\t\tfac[i] = fac[i - 1] * i % MOD;\n\t\tinv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n\t\tfinv[i] = finv[i - 1] * inv[i] % MOD;\n\t}\n}\n\n// 二項係数計算\nstatic\tlong COM(int n, int k){\n\tif (n < k) return 0;\n\tif (n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\n\n\n\n\n\n\n\nstatic int upperbond(int k,ArrayList data){\t\t//k以下で最大の値をdataの中から探し、返す二分探索\n\tif(data == null){\n\t\treturn -1;\n\t}\n\tint max = data.size();\n\tint min = -1;\n\twhile(max-min > 1){\n\t\tint mid = (max+min)/2;\n\t\tif(data.get(mid) <= k){\n\t\t\tmin = mid;\n\t\t}else{\n\t\t\tmax = mid;\n\t\t}\n\t}\n\n\n\t//\t\tif(min != -1){\n\t//\t\t\tmin = data.get(min);\n\t//\t\t}\n\n\t//\t\tSystem.out.println(max);\n\treturn min;\t\t\t\t\t//indexを返している\n}\n\nstatic int lowerbond(int k,ArrayList data){\t\t//k以上で最小の値をdataの中から探し、返す二分探索\n\tif(data == null){\n\t\treturn -1;\n\t}\n\t//\t\tSystem.out.println(\"lo\");\n\t//\t\tSystem.out.println(\"lo\");\n\tint max = data.size();\n\tint min = -1;\n\n\twhile(max-min > 1){\n\t\tint mid = (max+min)/2;\n\t\tif(data.get(mid) >= k){\n\t\t\tmax = mid;\n\t\t}else{\n\t\t\tmin = mid;\n\t\t}\n\t}\n\n\treturn max;\t\t\t//indexを返���ている\n}\n\n\n\nstatic int gcd(int a,int b){\t\t\t\t//最大公約数を返す\n\tif(b == 0){\n\t\treturn a;\n\t}else{\n\t\treturn gcd(b, a%b);\n\t}\n}\nstatic long gcd(long a,long b){\n\tif(b == 0){\n\t\treturn a;\n\t}else{\n\t\treturn gcd(b, a%b);\n\t}\n}\n\n\n\nstatic long lcm (long a, long b) {\n\tlong g = gcd(a,b);\n\treturn a/g*b;\n}\n}\n\n\n\nclass TreeNode{\n\tint value;\n\tArrayList children;\n\tboolean root;\n\tboolean fchild;\n\n\tpublic TreeNode(int value,ArrayList children,boolean root) {\n\t\tthis.value = value;\n\t\tthis.children = children;\n\t\tthis.root = root;\n\t}\n\n\n}\n\nclass Pair implements Comparable{\n\tint from;\n\tint end;\n\tpublic Pair(int from,int end) {\n\t\tthis.from = from;\n\t\tthis.end = end;\n\t\t// TODO 自動生成されたコンストラクター・スタブ\n\t}\n\n\t@Override\n\tpublic int compareTo(Object other) {\n\t\tPair otherpair = (Pair)other;\n\n\t\treturn from - otherpair.from;\n\t}\n\n\n\n\n\n\n\n\n}\n\n\n\n\n", "language": "Java", "metadata": {"date": 1576890111, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02838.html", "problem_id": "p02838", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02838/input.txt", "sample_output_relpath": "derived/input_output/data/p02838/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02838/Java/s605923781.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s605923781", "user_id": "u632953742"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Scanner;\nclass Main{\n\n\n\tstatic final int MOD = 1000000007;\n\n\tstatic int MAX = 10000000;\n\tstatic\tArrayList tree;\n\tstatic HashSet set;\n\tstatic long ans;\n\n\tstatic HashSet memo;\n\tstatic HashMap map;\n\n\tstatic ArrayList> xdata;\n\tstatic ArrayList> ydata; \n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\t\t\t//文字の入力\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[n];\n\t\tfor(int i = 0;i < n;i++){\n\t\t\ta[i] = sc.nextLong();\n\t\t}\n\t\t\n\t\t//計算量を考えると、愚直に二重ループを回すと間に合わない。\n\t\t//桁に注目すると60桁しかないため、桁で回すことを考える。\n\t\t//シグマは結局全ての組み合わせであり(順番は関係ない)、各組み合わせのxorでbitが立つのは、片方のi桁目のbitが1でもう片方が0の時のみ\n\t\t//各桁について、全てのa[i]についてbitが0か1か調べてその個数を記録\n\t\t//i桁目について、0の個数がa,1の個数がbの時、全てのxorの組み合わせの総和は、2のi乗*(a*b)\n\t\t//これを全ての桁で行う。\n\t\tlong ans = 0;\n\n\t\tfor(int i = 0;i <= 60;i++){\n\t\t\tint on = 0;\t\t\t\t\t\t//bit立っている\n\t\t\tint off = 0;\t\t\t\t\t\n\t\t\t\n\t\t\t//各a[j]についてi桁目のbit確認\n\t\t\tfor(int j = 0;j < n;j++){\n\t\t\t\tif(((a[j] >>> i) & 1) != 0){\n\t\t\t\t\ton++;\n\t\t\t\t}else{\n\t\t\t\t\toff++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong p = 1;\n\t\t\tfor(int j = 0;j < i;j++){\n\t\t\t\tp*=2;\n\t\t\t\tp%= MOD;\n\t\t\t}\n\t\t\tlong sub = (on*off)%MOD;\n\t\t\tans += sub*p;\n\t\t\tans %= MOD;\n//\t\t\tSystem.out.println(i + \" on \" +on + \" off \" +off + \" ans \" + ans );\n\n\t\t\t\n\t\t}\n\t\tSystem.out.print(ans);\n\n\n\t}\n\t\n\n\n\n\n\n\nstatic long fac[] = new long[MAX];\nstatic long finv[] = new long[MAX];\nstatic long inv[] = new long[MAX];\n\n\n\n//テーブルの作成\nstatic void COMinit() {\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor (int i = 2; i < MAX; i++){\n\t\tfac[i] = fac[i - 1] * i % MOD;\n\t\tinv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n\t\tfinv[i] = finv[i - 1] * inv[i] % MOD;\n\t}\n}\n\n// 二項係数計算\nstatic\tlong COM(int n, int k){\n\tif (n < k) return 0;\n\tif (n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\n\n\n\n\n\n\n\nstatic int upperbond(int k,ArrayList data){\t\t//k以下で最大の値をdataの中から探し、返す二分探索\n\tif(data == null){\n\t\treturn -1;\n\t}\n\tint max = data.size();\n\tint min = -1;\n\twhile(max-min > 1){\n\t\tint mid = (max+min)/2;\n\t\tif(data.get(mid) <= k){\n\t\t\tmin = mid;\n\t\t}else{\n\t\t\tmax = mid;\n\t\t}\n\t}\n\n\n\t//\t\tif(min != -1){\n\t//\t\t\tmin = data.get(min);\n\t//\t\t}\n\n\t//\t\tSystem.out.println(max);\n\treturn min;\t\t\t\t\t//indexを返している\n}\n\nstatic int lowerbond(int k,ArrayList data){\t\t//k以上で最小の値をdataの中から探し、返す二分探索\n\tif(data == null){\n\t\treturn -1;\n\t}\n\t//\t\tSystem.out.println(\"lo\");\n\t//\t\tSystem.out.println(\"lo\");\n\tint max = data.size();\n\tint min = -1;\n\n\twhile(max-min > 1){\n\t\tint mid = (max+min)/2;\n\t\tif(data.get(mid) >= k){\n\t\t\tmax = mid;\n\t\t}else{\n\t\t\tmin = mid;\n\t\t}\n\t}\n\n\treturn max;\t\t\t//indexを返している\n}\n\n\n\nstatic int gcd(int a,int b){\t\t\t\t//最大公約数を返す\n\tif(b == 0){\n\t\treturn a;\n\t}else{\n\t\treturn gcd(b, a%b);\n\t}\n}\nstatic long gcd(long a,long b){\n\tif(b == 0){\n\t\treturn a;\n\t}else{\n\t\treturn gcd(b, a%b);\n\t}\n}\n\n\n\nstatic long lcm (long a, long b) {\n\tlong g = gcd(a,b);\n\treturn a/g*b;\n}\n}\n\n\n\nclass TreeNode{\n\tint value;\n\tArrayList children;\n\tboolean root;\n\tboolean fchild;\n\n\tpublic TreeNode(int value,ArrayList children,boolean root) {\n\t\tthis.value = value;\n\t\tthis.children = children;\n\t\tthis.root = root;\n\t}\n\n\n}\n\nclass Pair implements Comparable{\n\tint from;\n\tint end;\n\tpublic Pair(int from,int end) {\n\t\tthis.from = from;\n\t\tthis.end = end;\n\t\t// TODO 自動生成されたコンストラクター・スタブ\n\t}\n\n\t@Override\n\tpublic int compareTo(Object other) {\n\t\tPair otherpair = (Pair)other;\n\n\t\treturn from - otherpair.from;\n\t}\n\n\n\n\n\n\n\n\n}\n\n\n\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02838", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4059, "cpu_time_ms": 876, "memory_kb": 332040}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s975696873", "group_id": "codeNet:p02838", "input_text": "import java.util.*;\nimport java.io.*;\nimport java.lang.*;\npublic class Main{\n\tpublic static long sumXOR(long arr[], int n) \n { \n \tlong mod= (long)1e9+7;\n long sum = 0; \n for (long i = 0; i < 63; i++) \n { \n long zc = 0; \n long idsum = 0; \n long k=(long)(1l << i);\n for (int j = 0; j < n; j++) \n { \n if ((arr[j]&k)==0) \n {zc++;} \n } \n k%=mod;\n long x=(long)zc*(n-zc);\n x%=mod;\n idsum = (long) x*k; \n sum = (long)(sum+idsum)%mod; \n } \n return sum; \n } \npublic static void main(String[] args) throws FileNotFoundException, IOException{\n Scanner s=new Scanner(System.in);\n int n=s.nextInt();\n long[] arr=new long[n];\n for(int i=0;i[][] dp = new TreeSet[h][w];\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n dp[i][j] = new TreeSet<>();\n if (i == 0 && j == 0) {\n dp[0][0].add(a[0][0] - b[0][0]);\n dp[0][0].add(b[0][0] - a[0][0]);\n } else {\n if (i > 0) {\n for (int x : dp[i - 1][j]) {\n int tmp1 = x + a[i][j] - b[i][j];\n int tmp2 = x + b[i][j] - a[i][j];\n if (Math.abs(tmp1) <= MAX / 2) dp[i][j].add(tmp1);\n if (Math.abs(tmp2) <= MAX / 2) dp[i][j].add(tmp2);\n }\n }\n if (j > 0) {\n for (int x : dp[i][j - 1]) {\n int tmp1 = x + a[i][j] - b[i][j];\n int tmp2 = x + b[i][j] - a[i][j];\n if (Math.abs(tmp1) <= MAX / 2) dp[i][j].add(tmp1);\n if (Math.abs(tmp2) <= MAX / 2) dp[i][j].add(tmp2);\n }\n }\n }\n }\n }\n\n int ans = Constants.INF;\n for (int x : dp[h - 1][w - 1]) {\n ans = Math.min(ans, Math.abs(x));\n }\n out.printLine(ans);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int[][] readIntTable(int rowCount, int columnCount) {\n int[][] table = new int[rowCount][];\n for (int i = 0; i < rowCount; i++) {\n table[i] = readIntArray(columnCount);\n }\n return table;\n }\n\n public int[] readIntArray(int size) {\n int[] array = new int[size];\n for (int i = 0; i < size; i++) {\n array[i] = readInt();\n }\n return array;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class Constants {\n public static final int INF = (int) 1e9 + 1;\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1575862766, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02839.html", "problem_id": "p02839", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02839/input.txt", "sample_output_relpath": "derived/input_output/data/p02839/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02839/Java/s630895844.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s630895844", "user_id": "u038084150"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.TreeSet;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n EBalancedPath solver = new EBalancedPath();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class EBalancedPath {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int h = in.readInt();\n int w = in.readInt();\n int[][] a = in.readIntTable(h, w);\n int[][] b = in.readIntTable(h, w);\n\n int MAX = 80 * (h + w - 1);\n TreeSet[][] dp = new TreeSet[h][w];\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n dp[i][j] = new TreeSet<>();\n if (i == 0 && j == 0) {\n dp[0][0].add(a[0][0] - b[0][0]);\n dp[0][0].add(b[0][0] - a[0][0]);\n } else {\n if (i > 0) {\n for (int x : dp[i - 1][j]) {\n int tmp1 = x + a[i][j] - b[i][j];\n int tmp2 = x + b[i][j] - a[i][j];\n if (Math.abs(tmp1) <= MAX / 2) dp[i][j].add(tmp1);\n if (Math.abs(tmp2) <= MAX / 2) dp[i][j].add(tmp2);\n }\n }\n if (j > 0) {\n for (int x : dp[i][j - 1]) {\n int tmp1 = x + a[i][j] - b[i][j];\n int tmp2 = x + b[i][j] - a[i][j];\n if (Math.abs(tmp1) <= MAX / 2) dp[i][j].add(tmp1);\n if (Math.abs(tmp2) <= MAX / 2) dp[i][j].add(tmp2);\n }\n }\n }\n }\n }\n\n int ans = Constants.INF;\n for (int x : dp[h - 1][w - 1]) {\n ans = Math.min(ans, Math.abs(x));\n }\n out.printLine(ans);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int[][] readIntTable(int rowCount, int columnCount) {\n int[][] table = new int[rowCount][];\n for (int i = 0; i < rowCount; i++) {\n table[i] = readIntArray(columnCount);\n }\n return table;\n }\n\n public int[] readIntArray(int size) {\n int[] array = new int[size];\n for (int i = 0; i < size; i++) {\n array[i] = readInt();\n }\n return array;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class Constants {\n public static final int INF = (int) 1e9 + 1;\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n}\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\n\nThe square (i, j) has two numbers A_{ij} and B_{ij} written on it.\n\nFirst, for each square, Takahashi paints one of the written numbers red and the other blue.\n\nThen, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.\n\nLet the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).\n\nTakahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.\n\nFind the minimum unbalancedness possible.\n\nConstraints\n\n2 \\leq H \\leq 80\n\n2 \\leq W \\leq 80\n\n0 \\leq A_{ij} \\leq 80\n\n0 \\leq B_{ij} \\leq 80\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11} A_{12} \\ldots A_{1W}\n:\nA_{H1} A_{H2} \\ldots A_{HW}\nB_{11} B_{12} \\ldots B_{1W}\n:\nB_{H1} B_{H2} \\ldots B_{HW}\n\nOutput\n\nPrint the minimum unbalancedness possible.\n\nSample Input 1\n\n2 2\n1 2\n3 4\n3 4\n2 1\n\nSample Output 1\n\n0\n\nBy painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.\n\nSample Input 2\n\n2 3\n1 10 80\n80 10 1\n1 2 3\n4 5 6\n\nSample Output 2\n\n2", "sample_input": "2 2\n1 2\n3 4\n3 4\n2 1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02839", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\n\nThe square (i, j) has two numbers A_{ij} and B_{ij} written on it.\n\nFirst, for each square, Takahashi paints one of the written numbers red and the other blue.\n\nThen, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.\n\nLet the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).\n\nTakahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.\n\nFind the minimum unbalancedness possible.\n\nConstraints\n\n2 \\leq H \\leq 80\n\n2 \\leq W \\leq 80\n\n0 \\leq A_{ij} \\leq 80\n\n0 \\leq B_{ij} \\leq 80\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11} A_{12} \\ldots A_{1W}\n:\nA_{H1} A_{H2} \\ldots A_{HW}\nB_{11} B_{12} \\ldots B_{1W}\n:\nB_{H1} B_{H2} \\ldots B_{HW}\n\nOutput\n\nPrint the minimum unbalancedness possible.\n\nSample Input 1\n\n2 2\n1 2\n3 4\n3 4\n2 1\n\nSample Output 1\n\n0\n\nBy painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.\n\nSample Input 2\n\n2 3\n1 10 80\n80 10 1\n1 2 3\n4 5 6\n\nSample Output 2\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5610, "cpu_time_ms": 2110, "memory_kb": 202624}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s708005547", "group_id": "codeNet:p02842", "input_text": "import java.util.*;\npublic class Main{\n public static void main(String[]args){\n Scanner sc=new Scanner(System.in);\n double N=sc.nextDouble();\n double X;\n double X1;\n X=N/1.08;\n X1=X*1.08;\n double X2=Math.floor(X);\n double X3=Math.floor(X)*1.08;\n double X4=Math.floor(X3);\n \n if(N==Math.floor(X4)){\n System.out.println(\"X\");\n }else{\n System.out.println(\":(\");\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1575258369, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02842.html", "problem_id": "p02842", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02842/input.txt", "sample_output_relpath": "derived/input_output/data/p02842/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02842/Java/s708005547.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s708005547", "user_id": "u093172826"}, "prompt_components": {"gold_output": "400\n", "input_to_evaluate": "import java.util.*;\npublic class Main{\n public static void main(String[]args){\n Scanner sc=new Scanner(System.in);\n double N=sc.nextDouble();\n double X;\n double X1;\n X=N/1.08;\n X1=X*1.08;\n double X2=Math.floor(X);\n double X3=Math.floor(X)*1.08;\n double X4=Math.floor(X3);\n \n if(N==Math.floor(X4)){\n System.out.println(\"X\");\n }else{\n System.out.println(\":(\");\n }\n }\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nTakahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.\n\nThe consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \\times 1.08 yen (rounded down to the nearest integer).\n\nTakahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.\n\nIf there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.\n\nConstraints\n\n1 \\leq N \\leq 50000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there are values that could be X, the price of the apple pie before tax, print any one of them.\n\nIf there are multiple such values, printing any one of them will be accepted.\n\nIf no value could be X, print :(.\n\nSample Input 1\n\n432\n\nSample Output 1\n\n400\n\nIf the apple pie is priced at 400 yen before tax, you have to pay 400 \\times 1.08 = 432 yen to buy one.\n\nOtherwise, the amount you have to pay will not be 432 yen.\n\nSample Input 2\n\n1079\n\nSample Output 2\n\n:(\n\nThere is no possible price before tax for which you have to pay 1079 yen with tax.\n\nSample Input 3\n\n1001\n\nSample Output 3\n\n927\n\nIf the apple pie is priced 927 yen before tax, by rounding down 927 \\times 1.08 = 1001.16, you have to pay 1001 yen.", "sample_input": "432\n"}, "reference_outputs": ["400\n"], "source_document_id": "p02842", "source_text": "Score: 200 points\n\nProblem Statement\n\nTakahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.\n\nThe consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \\times 1.08 yen (rounded down to the nearest integer).\n\nTakahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.\n\nIf there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.\n\nConstraints\n\n1 \\leq N \\leq 50000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there are values that could be X, the price of the apple pie before tax, print any one of them.\n\nIf there are multiple such values, printing any one of them will be accepted.\n\nIf no value could be X, print :(.\n\nSample Input 1\n\n432\n\nSample Output 1\n\n400\n\nIf the apple pie is priced at 400 yen before tax, you have to pay 400 \\times 1.08 = 432 yen to buy one.\n\nOtherwise, the amount you have to pay will not be 432 yen.\n\nSample Input 2\n\n1079\n\nSample Output 2\n\n:(\n\nThere is no possible price before tax for which you have to pay 1079 yen with tax.\n\nSample Input 3\n\n1001\n\nSample Output 3\n\n927\n\nIf the apple pie is priced 927 yen before tax, by rounding down 927 \\times 1.08 = 1001.16, you have to pay 1001 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 420, "cpu_time_ms": 108, "memory_kb": 23892}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s927114461", "group_id": "codeNet:p02844", "input_text": "import java.util.*;\n\n// さっき提出したのがTLEになったので、\n// 答えが必ず1000未満になることを利用して配列で結果管理するよう修正\n// でも結局Ｏ(n^3)だからやっぱりダメかも？\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tString s = sc.next();\n\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = Integer.valueOf(s.substring(i, i + 1));\n\t\t}\n\n\t\tint[] dic = new int[1000];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tfor (int k = j + 1; k < n; k++) {\n\t\t\t\t\tdic[a[i] * 100 + a[j] * 10 + a[k]] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < 1000; i++) {\n\t\t\tsum += dic[i];\n\t\t}\n\t\tSystem.out.println(sum);\n\n\t}\n}\n", "language": "Java", "metadata": {"date": 1600306075, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02844.html", "problem_id": "p02844", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02844/input.txt", "sample_output_relpath": "derived/input_output/data/p02844/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02844/Java/s927114461.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s927114461", "user_id": "u788489345"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\n// さっき提出したのがTLEになったので、\n// 答えが必ず1000未満になることを利用して配列で結果管理するよう修正\n// でも結局Ｏ(n^3)だからやっぱりダメかも？\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tString s = sc.next();\n\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = Integer.valueOf(s.substring(i, i + 1));\n\t\t}\n\n\t\tint[] dic = new int[1000];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tfor (int k = j + 1; k < n; k++) {\n\t\t\t\t\tdic[a[i] * 100 + a[j] * 10 + a[k]] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < 1000; i++) {\n\t\t\tsum += dic[i];\n\t\t}\n\t\tSystem.out.println(sum);\n\n\t}\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nAtCoder Inc. has decided to lock the door of its office with a 3-digit PIN code.\n\nThe company has an N-digit lucky number, S. Takahashi, the president, will erase N-3 digits from S and concatenate the remaining 3 digits without changing the order to set the PIN code.\n\nHow many different PIN codes can he set this way?\n\nBoth the lucky number and the PIN code may begin with a 0.\n\nConstraints\n\n4 \\leq N \\leq 30000\n\nS is a string of length N consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of different PIN codes Takahashi can set.\n\nSample Input 1\n\n4\n0224\n\nSample Output 1\n\n3\n\nTakahashi has the following options:\n\nErase the first digit of S and set 224.\n\nErase the second digit of S and set 024.\n\nErase the third digit of S and set 024.\n\nErase the fourth digit of S and set 022.\n\nThus, he can set three different PIN codes: 022, 024, and 224.\n\nSample Input 2\n\n6\n123123\n\nSample Output 2\n\n17\n\nSample Input 3\n\n19\n3141592653589793238\n\nSample Output 3\n\n329", "sample_input": "4\n0224\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02844", "source_text": "Score: 400 points\n\nProblem Statement\n\nAtCoder Inc. has decided to lock the door of its office with a 3-digit PIN code.\n\nThe company has an N-digit lucky number, S. Takahashi, the president, will erase N-3 digits from S and concatenate the remaining 3 digits without changing the order to set the PIN code.\n\nHow many different PIN codes can he set this way?\n\nBoth the lucky number and the PIN code may begin with a 0.\n\nConstraints\n\n4 \\leq N \\leq 30000\n\nS is a string of length N consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of different PIN codes Takahashi can set.\n\nSample Input 1\n\n4\n0224\n\nSample Output 1\n\n3\n\nTakahashi has the following options:\n\nErase the first digit of S and set 224.\n\nErase the second digit of S and set 024.\n\nErase the third digit of S and set 024.\n\nErase the fourth digit of S and set 022.\n\nThus, he can set three different PIN codes: 022, 024, and 224.\n\nSample Input 2\n\n6\n123123\n\nSample Output 2\n\n17\n\nSample Input 3\n\n19\n3141592653589793238\n\nSample Output 3\n\n329", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 814, "cpu_time_ms": 2207, "memory_kb": 39160}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s409442501", "group_id": "codeNet:p02847", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString day = sc.next();\n\t\tint i = 0;\n\t\tswitch (day) {\n\t\tcase \"SUN\":\n\t\t\ti = 7;\n\t\t\tbreak;\n\t\tcase \"MON\":\n\t\t\ti = 6;\n\t\t\tbreak;\n\t\tcase\" TUE\":\n\t\t\ti = 5;\n\t\t\tbreak;\n\t\tcase \"WED\":\n\t\t\ti = 4;\n\t\t\tbreak;\n\t\tcase \"THU\":\n\t\t\ti = 3;\n\t\t\tbreak;\n\t\tcase \"FRI\":\n\t\t\ti = 2;\n\t\t\tbreak;\n\t\tcase \"SAT\" :\n\t\t\ti = 1;\n\t\t\tbreak;\n\t\t}\n\n\t\tSystem.out.println(i);\n\t}\n}", "language": "Java", "metadata": {"date": 1574647651, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02847.html", "problem_id": "p02847", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02847/input.txt", "sample_output_relpath": "derived/input_output/data/p02847/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02847/Java/s409442501.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s409442501", "user_id": "u488281731"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString day = sc.next();\n\t\tint i = 0;\n\t\tswitch (day) {\n\t\tcase \"SUN\":\n\t\t\ti = 7;\n\t\t\tbreak;\n\t\tcase \"MON\":\n\t\t\ti = 6;\n\t\t\tbreak;\n\t\tcase\" TUE\":\n\t\t\ti = 5;\n\t\t\tbreak;\n\t\tcase \"WED\":\n\t\t\ti = 4;\n\t\t\tbreak;\n\t\tcase \"THU\":\n\t\t\ti = 3;\n\t\t\tbreak;\n\t\tcase \"FRI\":\n\t\t\ti = 2;\n\t\t\tbreak;\n\t\tcase \"SAT\" :\n\t\t\ti = 1;\n\t\t\tbreak;\n\t\t}\n\n\t\tSystem.out.println(i);\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a string S representing the day of the week today.\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.\n\nAfter how many days is the next Sunday (tomorrow or later)?\n\nConstraints\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of days before the next Sunday.\n\nSample Input 1\n\nSAT\n\nSample Output 1\n\n1\n\nIt is Saturday today, and tomorrow will be Sunday.\n\nSample Input 2\n\nSUN\n\nSample Output 2\n\n7\n\nIt is Sunday today, and seven days later, it will be Sunday again.", "sample_input": "SAT\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02847", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a string S representing the day of the week today.\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.\n\nAfter how many days is the next Sunday (tomorrow or later)?\n\nConstraints\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of days before the next Sunday.\n\nSample Input 1\n\nSAT\n\nSample Output 1\n\n1\n\nIt is Saturday today, and tomorrow will be Sunday.\n\nSample Input 2\n\nSUN\n\nSample Output 2\n\n7\n\nIt is Sunday today, and seven days later, it will be Sunday again.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 457, "cpu_time_ms": 102, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s985113705", "group_id": "codeNet:p02848", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint N = Integer.parseInt(sc.next());\n\n\t\tString s = sc.next();\n\n\t\tsc.close();\n\n\t\tString ret = \"\";\n\n\t\tfor(int i = 0;i < s.length();i++) {\n\t\t\tchar c = (char)(s.charAt(i) + N);\n\t\t\tif(c > 'Z') {\n\t\t\t\tc -= 26;\n\t\t\t}\n\t\t\tret += c;\n\t\t}\n\n\t\tSystem.out.println(ret);\n\n//\t\tFastScanner fs = new FastScanner();\n//\t\tint N = fs.nextInt();\n\n\n\t}\n}\n\n//import java.io.IOException;\n//import java.io.InputStream;\n//import java.util.NoSuchElementException;\n//\n//class FastScanner {\n// private final InputStream in = System.in;\n// private final byte[] buffer = new byte[1024];\n// private int ptr = 0;\n// private int buflen = 0;\n// private boolean hasNextByte() {\n// if (ptr < buflen) {\n// return true;\n// }else{\n// ptr = 0;\n// try {\n// buflen = in.read(buffer);\n// } catch (IOException e) {\n// e.printStackTrace();\n// }\n// if (buflen <= 0) {\n// return false;\n// }\n// }\n// return true;\n// }\n// private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n// private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n// public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n// public String next() {\n// if (!hasNext()) throw new NoSuchElementException();\n// StringBuilder sb = new StringBuilder();\n// int b = readByte();\n// while(isPrintableChar(b)) {\n// sb.appendCodePoint(b);\n// b = readByte();\n// }\n// return sb.toString();\n// }\n// public long nextLong() {\n// if (!hasNext()) throw new NoSuchElementException();\n// long n = 0;\n// boolean minus = false;\n// int b = readByte();\n// if (b == '-') {\n// minus = true;\n// b = readByte();\n// }\n// if (b < '0' || '9' < b) {\n// throw new NumberFormatException();\n// }\n// while(true){\n// if ('0' <= b && b <= '9') {\n// n *= 10;\n// n += b - '0';\n// }else if(b == -1 || !isPrintableChar(b)){\n// return minus ? -n : n;\n// }else{\n// throw new NumberFormatException();\n// }\n// b = readByte();\n// }\n// }\n// public int nextInt() {\n// long nl = nextLong();\n// if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n// return (int) nl;\n// }\n// public double nextDouble() { return Double.parseDouble(next());}\n//}\n", "language": "Java", "metadata": {"date": 1574647519, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02848.html", "problem_id": "p02848", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02848/input.txt", "sample_output_relpath": "derived/input_output/data/p02848/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02848/Java/s985113705.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s985113705", "user_id": "u887142477"}, "prompt_components": {"gold_output": "CDEZAB\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint N = Integer.parseInt(sc.next());\n\n\t\tString s = sc.next();\n\n\t\tsc.close();\n\n\t\tString ret = \"\";\n\n\t\tfor(int i = 0;i < s.length();i++) {\n\t\t\tchar c = (char)(s.charAt(i) + N);\n\t\t\tif(c > 'Z') {\n\t\t\t\tc -= 26;\n\t\t\t}\n\t\t\tret += c;\n\t\t}\n\n\t\tSystem.out.println(ret);\n\n//\t\tFastScanner fs = new FastScanner();\n//\t\tint N = fs.nextInt();\n\n\n\t}\n}\n\n//import java.io.IOException;\n//import java.io.InputStream;\n//import java.util.NoSuchElementException;\n//\n//class FastScanner {\n// private final InputStream in = System.in;\n// private final byte[] buffer = new byte[1024];\n// private int ptr = 0;\n// private int buflen = 0;\n// private boolean hasNextByte() {\n// if (ptr < buflen) {\n// return true;\n// }else{\n// ptr = 0;\n// try {\n// buflen = in.read(buffer);\n// } catch (IOException e) {\n// e.printStackTrace();\n// }\n// if (buflen <= 0) {\n// return false;\n// }\n// }\n// return true;\n// }\n// private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n// private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n// public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n// public String next() {\n// if (!hasNext()) throw new NoSuchElementException();\n// StringBuilder sb = new StringBuilder();\n// int b = readByte();\n// while(isPrintableChar(b)) {\n// sb.appendCodePoint(b);\n// b = readByte();\n// }\n// return sb.toString();\n// }\n// public long nextLong() {\n// if (!hasNext()) throw new NoSuchElementException();\n// long n = 0;\n// boolean minus = false;\n// int b = readByte();\n// if (b == '-') {\n// minus = true;\n// b = readByte();\n// }\n// if (b < '0' || '9' < b) {\n// throw new NumberFormatException();\n// }\n// while(true){\n// if ('0' <= b && b <= '9') {\n// n *= 10;\n// n += b - '0';\n// }else if(b == -1 || !isPrintableChar(b)){\n// return minus ? -n : n;\n// }else{\n// throw new NumberFormatException();\n// }\n// b = readByte();\n// }\n// }\n// public int nextInt() {\n// long nl = nextLong();\n// if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n// return (int) nl;\n// }\n// public double nextDouble() { return Double.parseDouble(next());}\n//}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a string S consisting of uppercase English letters. Additionally, an integer N will be given.\n\nShift each character of S by N in alphabetical order (see below), and print the resulting string.\n\nWe assume that A follows Z. For example, shifting A by 2 results in C (A \\to B \\to C), and shifting Y by 3 results in B (Y \\to Z \\to A \\to B).\n\nConstraints\n\n0 \\leq N \\leq 26\n\n1 \\leq |S| \\leq 10^4\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the string resulting from shifting each character of S by N in alphabetical order.\n\nSample Input 1\n\n2\nABCXYZ\n\nSample Output 1\n\nCDEZAB\n\nNote that A follows Z.\n\nSample Input 2\n\n0\nABCXYZ\n\nSample Output 2\n\nABCXYZ\n\nSample Input 3\n\n13\nABCDEFGHIJKLMNOPQRSTUVWXYZ\n\nSample Output 3\n\nNOPQRSTUVWXYZABCDEFGHIJKLM", "sample_input": "2\nABCXYZ\n"}, "reference_outputs": ["CDEZAB\n"], "source_document_id": "p02848", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a string S consisting of uppercase English letters. Additionally, an integer N will be given.\n\nShift each character of S by N in alphabetical order (see below), and print the resulting string.\n\nWe assume that A follows Z. For example, shifting A by 2 results in C (A \\to B \\to C), and shifting Y by 3 results in B (Y \\to Z \\to A \\to B).\n\nConstraints\n\n0 \\leq N \\leq 26\n\n1 \\leq |S| \\leq 10^4\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the string resulting from shifting each character of S by N in alphabetical order.\n\nSample Input 1\n\n2\nABCXYZ\n\nSample Output 1\n\nCDEZAB\n\nNote that A follows Z.\n\nSample Input 2\n\n0\nABCXYZ\n\nSample Output 2\n\nABCXYZ\n\nSample Input 3\n\n13\nABCDEFGHIJKLMNOPQRSTUVWXYZ\n\nSample Output 3\n\nNOPQRSTUVWXYZABCDEFGHIJKLM", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2655, "cpu_time_ms": 210, "memory_kb": 148152}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s886041301", "group_id": "codeNet:p02850", "input_text": "import java.util.*;\npublic class Main {\n static class Node{\n List to;\n Node(){\n to = new ArrayList();\n }\n }\n static public class IntPair{\n int x, y;\n public IntPair(int xx, int yy){\n x = xx;\n y = yy;\n }\n @Override\n public int hashCode(){\n return Long.hashCode((long)(x << 31) + y);\n }\n @Override\n public boolean equals(Object o){\n if(!(o instanceof IntPair)){\n return false;\n }\n IntPair temp = (IntPair) o;\n return x == temp.x && y == temp.y;\n }\n }\n static Node g[];\n static int ans[];\n static Map mp;\n public static void dfs(int s, int p, int c){\n if(p != -1){\n ans[mp.get(new IntPair(s, p))] = c;\n }\n int now = 1;\n for(Integer x : g[s].to){\n if(x == p)continue;\n if(now == c)now++;\n dfs(x, s, now++);\n }\n }\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n g = new Node[n];\n ans = new int[n - 1];\n mp = new HashMap<>();\n for(int i = 0; i < n; i++){\n g[i] = new Node();\n }\n for(int i = 0; i < n - 1; i++){\n Integer a = sc.nextInt() - 1;\n Integer b = sc.nextInt() - 1;\n g[a].to.add(b);\n g[b].to.add(a);\n mp.put(new IntPair(a, b), i);\n mp.put(new IntPair(b, a), i);\n }\n dfs(0, -1, 10000000);\n int mx = -1;\n for(int i : ans){\n mx = Math.max(mx, i);\n }\n System.out.println(mx);\n for(int i : ans){\n System.out.println(i);\n }\n }\n}\n\n", "language": "Java", "metadata": {"date": 1576612746, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02850.html", "problem_id": "p02850", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02850/input.txt", "sample_output_relpath": "derived/input_output/data/p02850/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02850/Java/s886041301.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s886041301", "user_id": "u628047647"}, "prompt_components": {"gold_output": "2\n1\n2\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n static class Node{\n List to;\n Node(){\n to = new ArrayList();\n }\n }\n static public class IntPair{\n int x, y;\n public IntPair(int xx, int yy){\n x = xx;\n y = yy;\n }\n @Override\n public int hashCode(){\n return Long.hashCode((long)(x << 31) + y);\n }\n @Override\n public boolean equals(Object o){\n if(!(o instanceof IntPair)){\n return false;\n }\n IntPair temp = (IntPair) o;\n return x == temp.x && y == temp.y;\n }\n }\n static Node g[];\n static int ans[];\n static Map mp;\n public static void dfs(int s, int p, int c){\n if(p != -1){\n ans[mp.get(new IntPair(s, p))] = c;\n }\n int now = 1;\n for(Integer x : g[s].to){\n if(x == p)continue;\n if(now == c)now++;\n dfs(x, s, now++);\n }\n }\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n g = new Node[n];\n ans = new int[n - 1];\n mp = new HashMap<>();\n for(int i = 0; i < n; i++){\n g[i] = new Node();\n }\n for(int i = 0; i < n - 1; i++){\n Integer a = sc.nextInt() - 1;\n Integer b = sc.nextInt() - 1;\n g[a].to.add(b);\n g[b].to.add(a);\n mp.put(new IntPair(a, b), i);\n mp.put(new IntPair(b, a), i);\n }\n dfs(0, -1, 10000000);\n int mx = -1;\n for(int i : ans){\n mx = Math.max(mx, i);\n }\n System.out.println(mx);\n for(int i : ans){\n System.out.println(i);\n }\n }\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a tree G with N vertices.\nThe vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nConsider painting the edges in G with some number of colors.\nWe want to paint them so that, for each vertex, the colors of the edges incident to that vertex are all different.\n\nAmong the colorings satisfying the condition above, construct one that uses the minimum number of colors.\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le a_i \\lt b_i \\le N\n\nAll values in input are integers.\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nPrint N lines.\n\nThe first line should contain K, the number of colors used.\n\nThe (i+1)-th line (1 \\le i \\le N-1) should contain c_i, the integer representing the color of the i-th edge, where 1 \\le c_i \\le K must hold.\n\nIf there are multiple colorings with the minimum number of colors that satisfy the condition, printing any of them will be accepted.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n2\n1\n2\n\nSample Input 2\n\n8\n1 2\n2 3\n2 4\n2 5\n4 7\n5 6\n6 8\n\nSample Output 2\n\n4\n1\n2\n3\n4\n1\n1\n2\n\nSample Input 3\n\n6\n1 2\n1 3\n1 4\n1 5\n1 6\n\nSample Output 3\n\n5\n1\n2\n3\n4\n5", "sample_input": "3\n1 2\n2 3\n"}, "reference_outputs": ["2\n1\n2\n"], "source_document_id": "p02850", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a tree G with N vertices.\nThe vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nConsider painting the edges in G with some number of colors.\nWe want to paint them so that, for each vertex, the colors of the edges incident to that vertex are all different.\n\nAmong the colorings satisfying the condition above, construct one that uses the minimum number of colors.\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le a_i \\lt b_i \\le N\n\nAll values in input are integers.\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nPrint N lines.\n\nThe first line should contain K, the number of colors used.\n\nThe (i+1)-th line (1 \\le i \\le N-1) should contain c_i, the integer representing the color of the i-th edge, where 1 \\le c_i \\le K must hold.\n\nIf there are multiple colorings with the minimum number of colors that satisfy the condition, printing any of them will be accepted.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n2\n1\n2\n\nSample Input 2\n\n8\n1 2\n2 3\n2 4\n2 5\n4 7\n5 6\n6 8\n\nSample Output 2\n\n4\n1\n2\n3\n4\n1\n1\n2\n\nSample Input 3\n\n6\n1 2\n1 3\n1 4\n1 5\n1 6\n\nSample Output 3\n\n5\n1\n2\n3\n4\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1827, "cpu_time_ms": 2109, "memory_kb": 117960}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s177797773", "group_id": "codeNet:p02854", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[n];\n\t\ta[0] = sc.nextLong();\n\t\tfor(int i = 1; i < n; i++) {\n\t\t\ta[i] = sc.nextLong()+a[i-1];\n\t\t}\n\t\tlong ans = Long.MAX_VALUE;\n\t\tlong dis = Long.MAX_VALUE;\n\t\tint num = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tlong temp = Math.abs(a[n-1]/2-a[i]);\n\t\t\tif(dis > temp) {\n\t\t\t\tdis = temp;\n\t\t\t\tnum = i;\n\t\t\t}\n\t\t}\n\t\tif(a[n-1]%2==1) {\n\t\t\tans = 1+Math.min(Math.abs((a[n-1]+1)/2-a[num]),Math.abs ((a[n-1]-1)/2-a[num]));\n\t\t}\n\t\telse {\n\t\t\tans = Math.abs(dis);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1593746854, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02854.html", "problem_id": "p02854", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02854/input.txt", "sample_output_relpath": "derived/input_output/data/p02854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02854/Java/s177797773.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s177797773", "user_id": "u095200025"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong[] a = new long[n];\n\t\ta[0] = sc.nextLong();\n\t\tfor(int i = 1; i < n; i++) {\n\t\t\ta[i] = sc.nextLong()+a[i-1];\n\t\t}\n\t\tlong ans = Long.MAX_VALUE;\n\t\tlong dis = Long.MAX_VALUE;\n\t\tint num = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tlong temp = Math.abs(a[n-1]/2-a[i]);\n\t\t\tif(dis > temp) {\n\t\t\t\tdis = temp;\n\t\t\t\tnum = i;\n\t\t\t}\n\t\t}\n\t\tif(a[n-1]%2==1) {\n\t\t\tans = 1+Math.min(Math.abs((a[n-1]+1)/2-a[num]),Math.abs ((a[n-1]-1)/2-a[num]));\n\t\t}\n\t\telse {\n\t\t\tans = Math.abs(dis);\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nTakahashi, who works at DISCO, is standing before an iron bar.\nThe bar has N-1 notches, which divide the bar into N sections. The i-th section from the left has a length of A_i millimeters.\n\nTakahashi wanted to choose a notch and cut the bar at that point into two parts with the same length.\nHowever, this may not be possible as is, so he will do the following operations some number of times before he does the cut:\n\nChoose one section and expand it, increasing its length by 1 millimeter. Doing this operation once costs 1 yen (the currency of Japan).\n\nChoose one section of length at least 2 millimeters and shrink it, decreasing its length by 1 millimeter. Doing this operation once costs 1 yen.\n\nFind the minimum amount of money needed before cutting the bar into two parts with the same length.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 2020202020\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_N\n\nOutput\n\nPrint an integer representing the minimum amount of money needed before cutting the bar into two parts with the same length.\n\nSample Input 1\n\n3\n2 4 3\n\nSample Output 1\n\n3\n\nThe initial lengths of the sections are [2, 4, 3] (in millimeters). Takahashi can cut the bar equally after doing the following operations for 3 yen:\n\nShrink the second section from the left. The lengths of the sections are now [2, 3, 3].\n\nShrink the first section from the left. The lengths of the sections are now [1, 3, 3].\n\nShrink the second section from the left. The lengths of the sections are now [1, 2, 3], and we can cut the bar at the second notch from the left into two parts of length 3 each.\n\nSample Input 2\n\n12\n100 104 102 105 103 103 101 105 104 102 104 101\n\nSample Output 2\n\n0", "sample_input": "3\n2 4 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02854", "source_text": "Score: 200 points\n\nProblem Statement\n\nTakahashi, who works at DISCO, is standing before an iron bar.\nThe bar has N-1 notches, which divide the bar into N sections. The i-th section from the left has a length of A_i millimeters.\n\nTakahashi wanted to choose a notch and cut the bar at that point into two parts with the same length.\nHowever, this may not be possible as is, so he will do the following operations some number of times before he does the cut:\n\nChoose one section and expand it, increasing its length by 1 millimeter. Doing this operation once costs 1 yen (the currency of Japan).\n\nChoose one section of length at least 2 millimeters and shrink it, decreasing its length by 1 millimeter. Doing this operation once costs 1 yen.\n\nFind the minimum amount of money needed before cutting the bar into two parts with the same length.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 2020202020\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_N\n\nOutput\n\nPrint an integer representing the minimum amount of money needed before cutting the bar into two parts with the same length.\n\nSample Input 1\n\n3\n2 4 3\n\nSample Output 1\n\n3\n\nThe initial lengths of the sections are [2, 4, 3] (in millimeters). Takahashi can cut the bar equally after doing the following operations for 3 yen:\n\nShrink the second section from the left. The lengths of the sections are now [2, 3, 3].\n\nShrink the first section from the left. The lengths of the sections are now [1, 3, 3].\n\nShrink the second section from the left. The lengths of the sections are now [1, 2, 3], and we can cut the bar at the second notch from the left into two parts of length 3 each.\n\nSample Input 2\n\n12\n100 104 102 105 103 103 101 105 104 102 104 101\n\nSample Output 2\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 647, "cpu_time_ms": 561, "memory_kb": 61272}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s291891956", "group_id": "codeNet:p02856", "input_text": "import java.util.*;\nimport java.io.*;\n\nclass Main{\n public static void main(String[] args){\n FastScanner fsc=new FastScanner();\n int m=fsc.nextInt();\n long[] d=new long[m];\n long[] c=new long[m];\n long numSum=0;\n long digSum=0;\n for(int i=0;i Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n public void close(){\n try{in.close();}\n catch(IOException e){e.printStackTrace();}\n }\n }\n}", "language": "Java", "metadata": {"date": 1574564883, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02856.html", "problem_id": "p02856", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02856/input.txt", "sample_output_relpath": "derived/input_output/data/p02856/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02856/Java/s291891956.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s291891956", "user_id": "u541055501"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\n\nclass Main{\n public static void main(String[] args){\n FastScanner fsc=new FastScanner();\n int m=fsc.nextInt();\n long[] d=new long[m];\n long[] c=new long[m];\n long numSum=0;\n long digSum=0;\n for(int i=0;i Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n public void close(){\n try{in.close();}\n catch(IOException e){e.printStackTrace();}\n }\n }\n}", "problem_context": "Score: 500 points\n\nProblem Statement\n\nN programmers are going to participate in the preliminary stage of DDCC 20XX. Due to the size of the venue, however, at most 9 contestants can participate in the finals.\n\nThe preliminary stage consists of several rounds, which will take place as follows:\n\nAll the N contestants will participate in the first round.\n\nWhen X contestants participate in some round, the number of contestants advancing to the next round will be decided as follows:\n\nThe organizer will choose two consecutive digits in the decimal notation of X, and replace them with the sum of these digits. The number resulted will be the number of contestants advancing to the next round.\n\nFor example, when X = 2378, the number of contestants advancing to the next round will be 578 (if 2 and 3 are chosen), 2108 (if 3 and 7 are chosen), or 2315 (if 7 and 8 are chosen).\n\nWhen X = 100, the number of contestants advancing to the next round will be 10, no matter which two digits are chosen.\n\nThe preliminary stage ends when 9 or fewer contestants remain.\n\nRingo, the chief organizer, wants to hold as many rounds as possible.\nFind the maximum possible number of rounds in the preliminary stage.\n\nSince the number of contestants, N, can be enormous, it is given to you as two integer sequences d_1, \\ldots, d_M and c_1, \\ldots, c_M, which means the following: the decimal notation of N consists of c_1 + c_2 + \\ldots + c_M digits, whose first c_1 digits are all d_1, the following c_2 digits are all d_2, \\ldots, and the last c_M digits are all d_M.\n\nConstraints\n\n1 \\leq M \\leq 200000\n\n0 \\leq d_i \\leq 9\n\nd_1 \\neq 0\n\nd_i \\neq d_{i+1}\n\nc_i \\geq 1\n\n2 \\leq c_1 + \\ldots + c_M \\leq 10^{15}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\nd_1 c_1\nd_2 c_2\n:\nd_M c_M\n\nOutput\n\nPrint the maximum possible number of rounds in the preliminary stage.\n\nSample Input 1\n\n2\n2 2\n9 1\n\nSample Output 1\n\n3\n\nIn this case, N = 229 contestants will participate in the first round. One possible progression of the preliminary stage is as follows:\n\n229 contestants participate in Round 1, 49 contestants participate in Round 2, 13 contestants participate in Round 3, and 4 contestants advance to the finals.\n\nHere, three rounds take place in the preliminary stage, which is the maximum possible number.\n\nSample Input 2\n\n3\n1 1\n0 8\n7 1\n\nSample Output 2\n\n9\n\nIn this case, 1000000007 will participate in the first round.", "sample_input": "2\n2 2\n9 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02856", "source_text": "Score: 500 points\n\nProblem Statement\n\nN programmers are going to participate in the preliminary stage of DDCC 20XX. Due to the size of the venue, however, at most 9 contestants can participate in the finals.\n\nThe preliminary stage consists of several rounds, which will take place as follows:\n\nAll the N contestants will participate in the first round.\n\nWhen X contestants participate in some round, the number of contestants advancing to the next round will be decided as follows:\n\nThe organizer will choose two consecutive digits in the decimal notation of X, and replace them with the sum of these digits. The number resulted will be the number of contestants advancing to the next round.\n\nFor example, when X = 2378, the number of contestants advancing to the next round will be 578 (if 2 and 3 are chosen), 2108 (if 3 and 7 are chosen), or 2315 (if 7 and 8 are chosen).\n\nWhen X = 100, the number of contestants advancing to the next round will be 10, no matter which two digits are chosen.\n\nThe preliminary stage ends when 9 or fewer contestants remain.\n\nRingo, the chief organizer, wants to hold as many rounds as possible.\nFind the maximum possible number of rounds in the preliminary stage.\n\nSince the number of contestants, N, can be enormous, it is given to you as two integer sequences d_1, \\ldots, d_M and c_1, \\ldots, c_M, which means the following: the decimal notation of N consists of c_1 + c_2 + \\ldots + c_M digits, whose first c_1 digits are all d_1, the following c_2 digits are all d_2, \\ldots, and the last c_M digits are all d_M.\n\nConstraints\n\n1 \\leq M \\leq 200000\n\n0 \\leq d_i \\leq 9\n\nd_1 \\neq 0\n\nd_i \\neq d_{i+1}\n\nc_i \\geq 1\n\n2 \\leq c_1 + \\ldots + c_M \\leq 10^{15}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\nd_1 c_1\nd_2 c_2\n:\nd_M c_M\n\nOutput\n\nPrint the maximum possible number of rounds in the preliminary stage.\n\nSample Input 1\n\n2\n2 2\n9 1\n\nSample Output 1\n\n3\n\nIn this case, N = 229 contestants will participate in the first round. One possible progression of the preliminary stage is as follows:\n\n229 contestants participate in Round 1, 49 contestants participate in Round 2, 13 contestants participate in Round 3, and 4 contestants advance to the finals.\n\nHere, three rounds take place in the preliminary stage, which is the maximum possible number.\n\nSample Input 2\n\n3\n1 1\n0 8\n7 1\n\nSample Output 2\n\n9\n\nIn this case, 1000000007 will participate in the first round.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2880, "cpu_time_ms": 121, "memory_kb": 27320}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s433378515", "group_id": "codeNet:p02859", "input_text": "import java.io.*;\nimport java.sql.ClientInfoStatus;\nimport java.time.Year;\nimport java.util.*;\nimport java.util.concurrent.Executors;\nimport java.util.concurrent.ScheduledExecutorService;\nimport java.util.concurrent.TimeUnit;\nimport java.util.function.BiPredicate;\nimport java.util.function.Function;\nimport java.util.function.IntBinaryOperator;\nimport java.util.function.Predicate;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\nimport static java.lang.Math.*;\nimport static java.lang.String.format;\n\npublic class Main {\n public static void main(String[] args) {\n solve();\n }\n final static long INF = Long.MAX_VALUE>>2;\n final static int MOD = 1_000_000_007;\n final static int[] dx4 = { 0, 1, 0, -1 };\n final static int[] dy4 = { 1, 0, -1, 0 };\n final static int[] dx9 = {-1, -1, -1, 0, 0, 0, 1, 1,1};\n final static int[] dy9 = {-1, 0, 1, -1, 0, 1, -1, 0,1};\n final static Runnable me=()->{};\n public static void solve(){\n //TODO:Solve problem like ***\n Scanner sc=new Scanner();\n int n = sc.nextInt();\n put(n*n);\n }\n static class Accepter{\n private T val;\n private final Predicate p;\n public Accepter(T defaultValue,Predicate p){\n this.val=defaultValue;\n this.p=p;\n }\n\n /**\n * @return accepted newval?\n */\n public boolean replace(T newVal){\n if(p.test(newVal)){\n this.val=newVal;\n return true;\n }\n return false;\n }\n }\n //runWhenEAで使う\n private static Runnable func(Object... objects){\n try{\n assert false;\n return me;\n }catch(AssertionError e){\n return ()->{put(objects);};\n }\n }\n private static void print(Object... objects){\n if(objects.length==1){\n System.out.print(objects[0]);\n }else{\n System.out.print(Arrays.toString(objects));\n }\n }\n private static void put(Object... objects) {\n print(objects);\n put();\n }\n private static void put(){\n System.out.println();\n }\n\n\n private static void runWhenEA(Runnable runnable){\n try{\n assert false;\n }catch(AssertionError e){\n PrintStream ps=System.out;\n PrintStream pse=System.err;\n System.setOut(pse);\n runnable.run();\n System.setOut(ps);\n }\n }\n private static void putM(String name,char[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n private static void putM(String name,int[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n private static void putM(String name,long[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n private static void putM(String name,boolean[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n final static private class Scanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n static private class FixedIntPair {\n final public int x, y;\n final static public FixedIntPair ZEROS=new FixedIntPair(0,0);\n FixedIntPair(int x, int y) {\n this.x = x;\n this.y = y;\n }\n @Override\n public String toString() {\n return format(FixedIntPair.class.getSimpleName()+\":(%d,%d)\", x, y);\n }\n }\n final static private class FixedLongPair {\n final public long x, y;\n final static public FixedLongPair ZEROS=new FixedLongPair(0,0);\n FixedLongPair(long x, long y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public int hashCode() {\n return (int)x+(int)y;\n }\n\n @Override\n public boolean equals(Object obj) {\n if(obj==null)return false;\n if(!(obj instanceof FixedLongPair)) return false;\n FixedLongPair pair=(FixedLongPair)obj;\n return this.x==pair.x&&this.y==pair.y;\n }\n\n @Override\n public String toString() {\n return format(FixedLongPair.class.getSimpleName()+\":(%d,%d)\", x, y);\n }\n }\n final static private class Binary{\n public static String toZeroPadding(int i){\n return format(\"%\"+Integer.toBinaryString(-1).length()+\"s\",Integer.toBinaryString(i)).replace(' ','0');\n }\n public static String toZeroPadding(long i){\n return format(\"%\"+Long.toBinaryString(-1).length()+\"s\",Long.toBinaryString(i)).replace(' ','0');\n }\n }\n public static class BinaryIndexedTree {\n public static void main(String... args){\n int a[]={1,3,2,5,7,6,4};\n System.out.println(inv(a));\n }\n final int n;\n final long[] array;\n BinaryIndexedTree(long[] array){\n this.n=array.length;\n this.array=new long[n];\n for(int i=0;i=0;index=(index&(index+1))-1){\n result+=array[index];\n }\n return result;\n }\n\n /**\n *\n * @param array arrayが1～nの順列になっていないならば定義されない\n * @return 転倒数\n */\n public static int inv(int[] array){\n int[] a=new int[array.length];\n BinaryIndexedTree bit=new BinaryIndexedTree(a);\n bit.add(array[0]-1,1);\n int result=0;\n for(int i=1;i=0&&i=0&&j>2;\n final static int MOD = 1_000_000_007;\n final static int[] dx4 = { 0, 1, 0, -1 };\n final static int[] dy4 = { 1, 0, -1, 0 };\n final static int[] dx9 = {-1, -1, -1, 0, 0, 0, 1, 1,1};\n final static int[] dy9 = {-1, 0, 1, -1, 0, 1, -1, 0,1};\n final static Runnable me=()->{};\n public static void solve(){\n //TODO:Solve problem like ***\n Scanner sc=new Scanner();\n int n = sc.nextInt();\n put(n*n);\n }\n static class Accepter{\n private T val;\n private final Predicate p;\n public Accepter(T defaultValue,Predicate p){\n this.val=defaultValue;\n this.p=p;\n }\n\n /**\n * @return accepted newval?\n */\n public boolean replace(T newVal){\n if(p.test(newVal)){\n this.val=newVal;\n return true;\n }\n return false;\n }\n }\n //runWhenEAで使う\n private static Runnable func(Object... objects){\n try{\n assert false;\n return me;\n }catch(AssertionError e){\n return ()->{put(objects);};\n }\n }\n private static void print(Object... objects){\n if(objects.length==1){\n System.out.print(objects[0]);\n }else{\n System.out.print(Arrays.toString(objects));\n }\n }\n private static void put(Object... objects) {\n print(objects);\n put();\n }\n private static void put(){\n System.out.println();\n }\n\n\n private static void runWhenEA(Runnable runnable){\n try{\n assert false;\n }catch(AssertionError e){\n PrintStream ps=System.out;\n PrintStream pse=System.err;\n System.setOut(pse);\n runnable.run();\n System.setOut(ps);\n }\n }\n private static void putM(String name,char[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n private static void putM(String name,int[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n private static void putM(String name,long[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n private static void putM(String name,boolean[][] mat){\n put(\"---------------------\"+name+\"-----------------\");\n for (int i = 0; i < mat.length; i++) {\n put(Arrays.toString(mat[i]));\n }\n }\n final static private class Scanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n static private class FixedIntPair {\n final public int x, y;\n final static public FixedIntPair ZEROS=new FixedIntPair(0,0);\n FixedIntPair(int x, int y) {\n this.x = x;\n this.y = y;\n }\n @Override\n public String toString() {\n return format(FixedIntPair.class.getSimpleName()+\":(%d,%d)\", x, y);\n }\n }\n final static private class FixedLongPair {\n final public long x, y;\n final static public FixedLongPair ZEROS=new FixedLongPair(0,0);\n FixedLongPair(long x, long y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public int hashCode() {\n return (int)x+(int)y;\n }\n\n @Override\n public boolean equals(Object obj) {\n if(obj==null)return false;\n if(!(obj instanceof FixedLongPair)) return false;\n FixedLongPair pair=(FixedLongPair)obj;\n return this.x==pair.x&&this.y==pair.y;\n }\n\n @Override\n public String toString() {\n return format(FixedLongPair.class.getSimpleName()+\":(%d,%d)\", x, y);\n }\n }\n final static private class Binary{\n public static String toZeroPadding(int i){\n return format(\"%\"+Integer.toBinaryString(-1).length()+\"s\",Integer.toBinaryString(i)).replace(' ','0');\n }\n public static String toZeroPadding(long i){\n return format(\"%\"+Long.toBinaryString(-1).length()+\"s\",Long.toBinaryString(i)).replace(' ','0');\n }\n }\n public static class BinaryIndexedTree {\n public static void main(String... args){\n int a[]={1,3,2,5,7,6,4};\n System.out.println(inv(a));\n }\n final int n;\n final long[] array;\n BinaryIndexedTree(long[] array){\n this.n=array.length;\n this.array=new long[n];\n for(int i=0;i=0;index=(index&(index+1))-1){\n result+=array[index];\n }\n return result;\n }\n\n /**\n *\n * @param array arrayが1～nの順列になっていないならば定義されない\n * @return 転倒数\n */\n public static int inv(int[] array){\n int[] a=new int[array.length];\n BinaryIndexedTree bit=new BinaryIndexedTree(a);\n bit.add(array[0]-1,1);\n int result=0;\n for(int i=1;i=0&&i=0&&j p = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n int x = sc.nextInt();\n int y = sc.nextInt();\n p.add(new Pair(x, y));\n }\n int[] data = new int[n];\n for (int i = 0; i < n; i++) {\n data[i] = i;\n }\n\n double ans = 0;\n double cnt = 0;\n do {\n cnt++;\n double dist = 0;\n for (int i = 0; i < n - 1; i++) {\n double x = Math.abs(p.get(data[i]).x - p.get(data[i + 1]).x);\n double y = Math.abs(p.get(data[i]).y - p.get(data[i + 1]).y);\n dist += Math.sqrt(x * x + y * y);\n }\n ans += dist;\n } while (findNextPermutation(data));\n\n ans /= cnt;\n System.out.printf(\"%.9f%n\", ans);\n\n }\n\n public static boolean findNextPermutation(int data[]) {\n\n // If the given dataset is empty\n // or contains only one element\n // next_permutation is not possible\n if (data.length <= 1)\n return false;\n\n int last = data.length - 2;\n\n // find the longest non-increasing suffix\n // and find the pivot\n while (last >= 0) {\n if (data[last] < data[last + 1]) {\n break;\n }\n last--;\n }\n if (last < 0)\n return false;\n\n int nextGreater = data.length - 1;\n\n // Find the rightmost successor to the pivot\n for (int i = data.length - 1; i > last; i--) {\n if (data[i] > data[last]) {\n nextGreater = i;\n break;\n }\n }\n\n // Swap the successor and the pivot\n data = swap(data, nextGreater, last);\n\n // Reverse the suffix\n data = reverse(data, last + 1, data.length - 1);\n return true;\n }\n\n public static int[] swap(int data[], int left, int right) {\n // Swap the data\n int temp = data[left];\n data[left] = data[right];\n data[right] = temp;\n // Return the updated array\n return data;\n }\n\n public static int[] reverse(int data[], int left, int right) {\n // Reverse the sub-array\n while (left < right) {\n int temp = data[left];\n data[left++] = data[right];\n data[right--] = temp;\n }\n // Return the updated array\n return data;\n }\n}\n\nclass Pair {\n long x;\n long y;\n\n public Pair(long x, long y) {\n this.x = x;\n this.y = y;\n }\n\n public long compareTo(Pair p) {\n return this.y - p.y;\n }\n\n public boolean equals(Object o) {\n if (o == this) {\n return true;\n }\n if (o == null || getClass() != o.getClass()) {\n return false;\n }\n Pair p = (Pair) o;\n return this.x == p.x && this.y == p.y;\n }\n\n public int hashCode() {\n return Objects.hash(x, y);\n }\n\n public String toString() {\n return String.format(\"x = %s,y = %s\", x, y);\n }\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "language": "Java", "metadata": {"date": 1573958234, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02861.html", "problem_id": "p02861", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02861/input.txt", "sample_output_relpath": "derived/input_output/data/p02861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02861/Java/s839048120.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s839048120", "user_id": "u076522215"}, "prompt_components": {"gold_output": "2.2761423749\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n int n = sc.nextInt();\n List p = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n int x = sc.nextInt();\n int y = sc.nextInt();\n p.add(new Pair(x, y));\n }\n int[] data = new int[n];\n for (int i = 0; i < n; i++) {\n data[i] = i;\n }\n\n double ans = 0;\n double cnt = 0;\n do {\n cnt++;\n double dist = 0;\n for (int i = 0; i < n - 1; i++) {\n double x = Math.abs(p.get(data[i]).x - p.get(data[i + 1]).x);\n double y = Math.abs(p.get(data[i]).y - p.get(data[i + 1]).y);\n dist += Math.sqrt(x * x + y * y);\n }\n ans += dist;\n } while (findNextPermutation(data));\n\n ans /= cnt;\n System.out.printf(\"%.9f%n\", ans);\n\n }\n\n public static boolean findNextPermutation(int data[]) {\n\n // If the given dataset is empty\n // or contains only one element\n // next_permutation is not possible\n if (data.length <= 1)\n return false;\n\n int last = data.length - 2;\n\n // find the longest non-increasing suffix\n // and find the pivot\n while (last >= 0) {\n if (data[last] < data[last + 1]) {\n break;\n }\n last--;\n }\n if (last < 0)\n return false;\n\n int nextGreater = data.length - 1;\n\n // Find the rightmost successor to the pivot\n for (int i = data.length - 1; i > last; i--) {\n if (data[i] > data[last]) {\n nextGreater = i;\n break;\n }\n }\n\n // Swap the successor and the pivot\n data = swap(data, nextGreater, last);\n\n // Reverse the suffix\n data = reverse(data, last + 1, data.length - 1);\n return true;\n }\n\n public static int[] swap(int data[], int left, int right) {\n // Swap the data\n int temp = data[left];\n data[left] = data[right];\n data[right] = temp;\n // Return the updated array\n return data;\n }\n\n public static int[] reverse(int data[], int left, int right) {\n // Reverse the sub-array\n while (left < right) {\n int temp = data[left];\n data[left++] = data[right];\n data[right--] = temp;\n }\n // Return the updated array\n return data;\n }\n}\n\nclass Pair {\n long x;\n long y;\n\n public Pair(long x, long y) {\n this.x = x;\n this.y = y;\n }\n\n public long compareTo(Pair p) {\n return this.y - p.y;\n }\n\n public boolean equals(Object o) {\n if (o == this) {\n return true;\n }\n if (o == null || getClass() != o.getClass()) {\n return false;\n }\n Pair p = (Pair) o;\n return this.x == p.x && this.y == p.y;\n }\n\n public int hashCode() {\n return Objects.hash(x, y);\n }\n\n public String toString() {\n return String.format(\"x = %s,y = %s\", x, y);\n }\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "sample_input": "3\n0 0\n1 0\n0 1\n"}, "reference_outputs": ["2.2761423749\n"], "source_document_id": "p02861", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5455, "cpu_time_ms": 121, "memory_kb": 23016}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s372318738", "group_id": "codeNet:p02862", "input_text": "import java.io.*;\nimport java.util.*;\nimport static java.lang.System.out;\n\npublic class Main{\n static MyReader in = new MyReader();\n\n public static void main(String[] args){\n int X, Y; {int[] a = in.ii(); X = a[0]; Y = a[1];}\n int sum = X+Y;\n long ans = 0;\n if(sum % 3 == 0){\n int m = (2*X-Y)/3;\n int n = (-X+2*Y)/3;\n if(m >= 0 && n >= 0){\n ans = ModOp.nCr(m+n, m);\n }\n }\n out.println(ans);\n }\n\n static class ModOp {\n static long MOD = 1000000007;\n\n static long pow(long a, long b){\n long ret = 1;\n while(b > 0){\n if(b%2 == 1){\n ret = ret*a%MOD;\n }\n a = a*a%MOD;\n b /= 2;\n }\n return ret;\n }\n\n static long mul(int s, int e){\n long ret = 1;\n for(int i = s; i <= e; i++){\n ret = ret*i%MOD;\n }\n return ret;\n }\n\n static long fact(int n){\n return mul(1, n);\n }\n\n static long nCr(int n, int r){\n return mul(n-r+1, n) * pow(fact(r), MOD-2) % MOD;\n }\n\n }\n\n static class MyReader extends BufferedReader{\n MyReader(){\n super(new InputStreamReader(System.in));\n }\n\n String s(){\n try{return readLine();}catch(IOException e){return \"\";}\n }\n\n String[] ss(){\n return s().split(\" \");\n }\n\n int i(){\n return Integer.parseInt(s());\n }\n\n int[] ii(){\n String[] ss = ss();\n int[] ii = new int[ss.length];\n for(int j = 0; j < ss.length; j++) ii[j] = Integer.parseInt(ss[j]);\n return ii;\n }\n\n ArrayList li(){\n String[] ss = ss();\n ArrayList li = new ArrayList<>();\n for(int j = 0; j < ss.length; j++) li.add(Integer.parseInt(ss[j]));\n return li;\n }\n\n long l(){\n return Long.parseLong(s());\n }\n\n long[] ll(){\n String[] ss = ss();\n long[] ll = new long[ss.length];\n for(int j = 0; j < ss.length; j++) ll[j] = Long.parseLong(ss[j]);\n return ll;\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1582491173, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02862.html", "problem_id": "p02862", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02862/input.txt", "sample_output_relpath": "derived/input_output/data/p02862/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02862/Java/s372318738.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s372318738", "user_id": "u752907799"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nimport static java.lang.System.out;\n\npublic class Main{\n static MyReader in = new MyReader();\n\n public static void main(String[] args){\n int X, Y; {int[] a = in.ii(); X = a[0]; Y = a[1];}\n int sum = X+Y;\n long ans = 0;\n if(sum % 3 == 0){\n int m = (2*X-Y)/3;\n int n = (-X+2*Y)/3;\n if(m >= 0 && n >= 0){\n ans = ModOp.nCr(m+n, m);\n }\n }\n out.println(ans);\n }\n\n static class ModOp {\n static long MOD = 1000000007;\n\n static long pow(long a, long b){\n long ret = 1;\n while(b > 0){\n if(b%2 == 1){\n ret = ret*a%MOD;\n }\n a = a*a%MOD;\n b /= 2;\n }\n return ret;\n }\n\n static long mul(int s, int e){\n long ret = 1;\n for(int i = s; i <= e; i++){\n ret = ret*i%MOD;\n }\n return ret;\n }\n\n static long fact(int n){\n return mul(1, n);\n }\n\n static long nCr(int n, int r){\n return mul(n-r+1, n) * pow(fact(r), MOD-2) % MOD;\n }\n\n }\n\n static class MyReader extends BufferedReader{\n MyReader(){\n super(new InputStreamReader(System.in));\n }\n\n String s(){\n try{return readLine();}catch(IOException e){return \"\";}\n }\n\n String[] ss(){\n return s().split(\" \");\n }\n\n int i(){\n return Integer.parseInt(s());\n }\n\n int[] ii(){\n String[] ss = ss();\n int[] ii = new int[ss.length];\n for(int j = 0; j < ss.length; j++) ii[j] = Integer.parseInt(ss[j]);\n return ii;\n }\n\n ArrayList li(){\n String[] ss = ss();\n ArrayList li = new ArrayList<>();\n for(int j = 0; j < ss.length; j++) li.add(Integer.parseInt(ss[j]));\n return li;\n }\n\n long l(){\n return Long.parseLong(s());\n }\n\n long[] ll(){\n String[] ss = ss();\n long[] ll = new long[ss.length];\n for(int j = 0; j < ss.length; j++) ll[j] = Long.parseLong(ss[j]);\n return ll;\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "sample_input": "3 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02862", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2331, "cpu_time_ms": 85, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s440042426", "group_id": "codeNet:p02862", "input_text": "import java.util.*;\n\npublic class Main{\n static int mod = 1000000007;\n public static long frac(int n){//n!(mod)の導��\n\n long ans = 1;\n for(int i=2;i <=n; i++){\n ans *= i;\n ans %= mod;\n }\n\n return ans;\n }\n\n public static long modpow(long a,long n, long mod){\n //a^n modの計算\n long res = 1;\n while(n>0){\n if(n%2==1){res = res * a % mod;}\n a = a * a % mod;\n n>>=1;//右に１ビット論理シフト\n }\n return res;\n }\n\n static long modinv(long a,long mod){\n //a^(-1)modの計算（逆元の計算）\n return modpow(a,mod-2,mod);\n }\n\n public static void main(String[] args){\n\n Scanner sc = new Scanner(System.in);\n\n int x = sc.nextInt();\n int y = sc.nextInt();\n\n double a = (2*(double)x-(double)y)/3;\n double b = (2*(double)y-(double)x)/3;\n\n if(((2*x-y)%3==0&&(2*y-x)%3==0)&&(2*x-y>=0&&2*y-x>=0)){\n int aa = (int)a;\n int bb = (int)b;\n int cc = aa + bb;\n\n //(aa+bb)Caaの組み合わせ解のmodの導出\n long ans1 = frac(aa+bb); //(aa+bb)!のmod\n long ans2 = modinv(frac(aa),mod);\n long ans3 = modinv(frac(bb),mod);\n long ans4 = ((ans1*ans2)%mod*ans3)%mod;\n System.out.println(ans4);\n\n\n\n\n }else{\n System.out.println(\"0\");\n }\n\n }\n}\n", "language": "Java", "metadata": {"date": 1574054211, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02862.html", "problem_id": "p02862", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02862/input.txt", "sample_output_relpath": "derived/input_output/data/p02862/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02862/Java/s440042426.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s440042426", "user_id": "u008695540"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n static int mod = 1000000007;\n public static long frac(int n){//n!(mod)の導出\n\n long ans = 1;\n for(int i=2;i <=n; i++){\n ans *= i;\n ans %= mod;\n }\n\n return ans;\n }\n\n public static long modpow(long a,long n, long mod){\n //a^n modの計算\n long res = 1;\n while(n>0){\n if(n%2==1){res = res * a % mod;}\n a = a * a % mod;\n n>>=1;//右に１ビット論理シフト\n }\n return res;\n }\n\n static long modinv(long a,long mod){\n //a^(-1)modの計算（逆元の計算）\n return modpow(a,mod-2,mod);\n }\n\n public static void main(String[] args){\n\n Scanner sc = new Scanner(System.in);\n\n int x = sc.nextInt();\n int y = sc.nextInt();\n\n double a = (2*(double)x-(double)y)/3;\n double b = (2*(double)y-(double)x)/3;\n\n if(((2*x-y)%3==0&&(2*y-x)%3==0)&&(2*x-y>=0&&2*y-x>=0)){\n int aa = (int)a;\n int bb = (int)b;\n int cc = aa + bb;\n\n //(aa+bb)Caaの組み合わせ解のmodの導出\n long ans1 = frac(aa+bb); //(aa+bb)!のmod\n long ans2 = modinv(frac(aa),mod);\n long ans3 = modinv(frac(bb),mod);\n long ans4 = ((ans1*ans2)%mod*ans3)%mod;\n System.out.println(ans4);\n\n\n\n\n }else{\n System.out.println(\"0\");\n }\n\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "sample_input": "3 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02862", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1281, "cpu_time_ms": 119, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s690690478", "group_id": "codeNet:p02865", "input_text": "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tif(n % 2 == 0) {\n\t\t\tint ans = n/2 - 1;\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t\telse {\n\t\t\tint ans = (n-1)/2;\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1573351334, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02865.html", "problem_id": "p02865", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02865/input.txt", "sample_output_relpath": "derived/input_output/data/p02865/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02865/Java/s690690478.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s690690478", "user_id": "u920212194"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tif(n % 2 == 0) {\n\t\t\tint ans = n/2 - 1;\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t\telse {\n\t\t\tint ans = (n-1)/2;\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many ways are there to choose two distinct positive integers totaling N, disregarding the order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n1\n\nThere is only one way to choose two distinct integers totaling 4: to choose 1 and 3. (Choosing 3 and 1 is not considered different from this.)\n\nSample Input 2\n\n999999\n\nSample Output 2\n\n499999", "sample_input": "4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02865", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many ways are there to choose two distinct positive integers totaling N, disregarding the order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n1\n\nThere is only one way to choose two distinct integers totaling 4: to choose 1 and 3. (Choosing 3 and 1 is not considered different from this.)\n\nSample Input 2\n\n999999\n\nSample Output 2\n\n499999", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 302, "cpu_time_ms": 113, "memory_kb": 22612}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s353305688", "group_id": "codeNet:p02866", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n int n = sc.nextInt();\n int[] def = new int[n];\n\n int f = sc.nextInt();\n def[f]++;\n for (int i=1;i Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n }\n public static class Basic {\n //math\n private final int MAX = 51;\n private final long MOD = Main.MOD;\n private final long[] fac = new long[MAX];\n private final long[] finv = new long[MAX];\n private final long[] inv = new long[MAX];\n public long factorial(long num) {\n if (num < 2) return 1;\n else return num * factorial(num - 1);\n }\n public long modFactorial(long num) {\n if (num < 2) return 1;\n else return num*modFactorial(num-1)%MOD;\n }\n public int arraySum(int[] array) {\n int ans = 0;\n for (int value : array) ans += value;\n return ans;\n }\n public double log(double base, double antilogarithm) {\n return Math.log(antilogarithm) / Math.log(base);\n }\n public long gcd(long x, long y) {\n if (y == 0) return x;\n else return gcd(y, x % y);\n }\n public long lcm(long x, long y) {\n return x / gcd(x, y) * y;\n }\n public HashMap factorization(long num) {\n HashMap hash = new HashMap<>();\n long n = num;\n long count = 2;\n while (n > 1) {\n while (n % count == 0) {\n n /= count;\n if (hash.containsKey(count)) hash.put(count, hash.get(count) + 1);\n else hash.put(count, 1L);\n }\n count++;\n }\n return hash;\n }\n public int sum(int[] num) {\n int ans = 0;\n for (int i = 0; i < num.length; i++) {\n ans += num[i];\n }\n return ans;\n }\n public int[] reduce(int small, int big) {\n int ins = 2;\n while (ins <= small) {\n if (small % ins == 0 && big % ins == 0) {\n small /= ins;\n big /= ins;\n ins = 2;\n } else {\n ins++;\n }\n }\n return new int[]{small, big};\n }\n public int reduceCount(int small, int big) {\n int ins = 2;\n int ans = 0;\n while (ins <= small) {\n if (small % ins == 0 && big % ins == 0) {\n small /= ins;\n big /= ins;\n ins = 2;\n ans++;\n } else {\n ins++;\n }\n }\n return ans;\n }\n public int binarySearch(int[] array, int target) {\n int pos = -1;\n int left = 0;\n int right = array.length - 1;\n int middle;\n while (pos == -1 && left <= right) {\n middle = (left + right) / 2;\n if (array[middle] == target) pos = middle;\n else if (array[middle] > target) right = middle - 1;\n else left = middle + 1;\n }\n return pos;\n }\n public int upperBound(int[] ar, long d, int n, int f){\n int p = n;\n int q = f;\n while (p-q>1){\n int mid = (p+q)/2;\n if (ar[mid]==d){\n return mid+1;\n }\n if (ar[mid] 0) {\n if ((n & 1) != 0) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n }\n public long modinv(long a, long mod) {\n return modPow(a, mod - 2, mod);\n }\n public void COMinit() {\n fac[0] = 1;\n fac[1] = 1;\n finv[0] = 1;\n finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[(int)(MOD % i)] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n public long COM(int n, int k) {\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n-k]%MOD)% MOD;\n }\n public long PER(int n, int k){\n return fac[n]*finv[n-k]%MOD;\n }\n public long HCOM(int n, int k) {\n return COM(n + k - 1, k);\n }\n public boolean[] getIsPrimeArray(int max){\n boolean[] ret = new boolean[max+1];\n Arrays.fill(ret,true);\n ret[0]=false;\n ret[1]=false;\n for (int i=2;i<=max;i++){\n if (ret[i]){\n int c = 2*i;\n while (c<=max){\n ret[c]=false;\n c+=i;\n }\n }\n }\n return ret;\n }\n\n //array\n public int[] remove(int[] ar, int pos) {\n int[] ret = new int[ar.length - 1];\n for (int i = 0; i < pos; i++) ret[i] = ar[i];\n for (int i = pos + 1; i < ar.length; i++) ret[i - 1] = ar[i];\n return ret;\n }\n public int[] nextArray(int size,int cons){\n int[] ret = new int[size];\n for (int i=0;i ans[a[0]] + a[2]) {\n ans[a[1]] = ans[a[0]] + a[2];\n if (i == size - 1) {\n System.out.println(\"negative loop\");\n break;\n }\n }\n }\n }\n return ans;\n }//辺を配列の要素として管理。\n\n\n }\n public static class Queue{\n private final int max = 1000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){return (head == (tail+1)%max);}\n public void enqueue(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T dequeue(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n }\n public static class Deque{\n private final int max = 10000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){\n return (head == (tail+1)%max);\n }\n public void pushFirst(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n head--;\n if (head==-1)head=max-1;\n queue[head] = v;\n }\n public void pushLast(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T popFirst(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n public T popLast(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n if (--tail==-1)tail=max-1;\n return queue[tail];\n }\n\n public T peekFirst(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n return queue[head];\n }\n public T peekLast(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n return queue[tail];\n }\n }\n public static class Stack{\n private final int max = 100000;\n private final T[] stack =(T[]) new Object[max];\n private int top = 0;\n public boolean isEmpty(){return (top==0);}\n public boolean isFull(){return (top==max);}\n public void init(){top=0;}\n public void push(T v){\n if (isFull()){\n System.out.println(\"error: stack is full.\");\n return;\n }\n stack[top++] = v;\n }\n public T pop(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[--top];\n }\n public T peek(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[top];\n }\n }\n public static class Pair{\n private K A;\n private V B;\n Pair(K a,V b){\n A=a;\n B=b;\n }\n public void changeA(K a){A=a;}\n public void changeB(V b){B=b;}\n public void changeAB(K a,V b){A=a;B=b;}\n public static Comparator numberSortWithA = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A){\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B)return 0;\n else return 1;\n }\n else return 1;\n }\n };\n public static Comparator numberSortWithB = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B){\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A)return 0;\n else return 1;\n }\n else return 1;\n }\n };\n }\n public static class Graph{\n private final HashMap> graph = new HashMap<>();\n private final int Size;\n Graph(int size){\n for (int i=0;i());\n Size = size;\n }\n\n public void addEdge(int node1,int node2){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).add(node2);\n graph.get(node2).add(node1);\n }\n }\n public void addDirectEdge(int from,int to){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).add(to);\n }\n }\n public int[] depth(int root){\n Queue q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n int[] depth = new int[Size];\n Arrays.fill(depth,-1);\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v)){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+1;\n }\n }\n }\n return depth;\n }\n public HashSet getConnected(int pos){return graph.get(pos);}\n }\n public static class WeightedGraph{\n private final HashMap> graph = new HashMap<>();\n private final int Size;\n private long[] Depth;\n WeightedGraph(int size){\n for (int i=0;i());\n Size = size;\n }\n\n public void addEdge(int node1,int node2,int weight){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).put(node2,weight);\n graph.get(node2).put(node1,weight);\n }\n }\n public void addDirectEdge(int from,int to,int weight){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).put(to,weight);\n }\n }\n public int[] dijkstra(int root){\n Comparator c = new Comparator() {\n @Override\n public int compare(int[] o1, int[] o2) {\n return Integer.compare(o1[1], o2[1]);\n }\n };\n PriorityQueue q = new PriorityQueue<>(c);\n q.add(new int[]{root,0});\n int[] ret = new int[Size];\n Arrays.fill(ret,Integer.MAX_VALUE);\n ret[root]=0;\n while (!q.isEmpty()){\n int[] v = q.poll();\n if (v[1]<=ret[v[0]]){\n HashMap h = graph.get(v[0]);\n for (int u : h.keySet()){\n if (ret[u]>v[1]+h.get(u)){\n ret[u]=v[1]+h.get(u);\n q.add(new int[]{u,ret[u]});\n }\n }\n }\n }\n return ret;\n }\n\n public long[] Depth(int root){\n Queue q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n long[] depth = new long[Size];\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v).keySet()){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+graph.get(v).get(u);\n }\n }\n }\n Depth = depth.clone();\n return depth;\n }\n\n }\n public static class UnionFindTree{\n int[] parent;\n int[] rank;\n int[] Size;\n int Number;\n public UnionFindTree(int size){\n this.parent = new int[size];\n this.rank = new int[size];\n this.Size = new int[size];\n makeSet();\n }\n public void makeSet(){\n for (int i=0;irank[yRoot]){\n parent[yRoot] = xRoot;\n Size[xRoot]+=Size[yRoot];\n Number--;\n }else if (rank[xRoot]{\n T[] Array;\n int Width;\n int Length;\n BitSearch(T[] t, int width){\n Array = t;\n Width = width;\n Length = Array.length;\n }\n void start(){\n long max = (long)Math.pow(Width,Length);\n for (long i=0;i Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n }\n public static class Basic {\n //math\n private final int MAX = 51;\n private final long MOD = Main.MOD;\n private final long[] fac = new long[MAX];\n private final long[] finv = new long[MAX];\n private final long[] inv = new long[MAX];\n public long factorial(long num) {\n if (num < 2) return 1;\n else return num * factorial(num - 1);\n }\n public long modFactorial(long num) {\n if (num < 2) return 1;\n else return num*modFactorial(num-1)%MOD;\n }\n public int arraySum(int[] array) {\n int ans = 0;\n for (int value : array) ans += value;\n return ans;\n }\n public double log(double base, double antilogarithm) {\n return Math.log(antilogarithm) / Math.log(base);\n }\n public long gcd(long x, long y) {\n if (y == 0) return x;\n else return gcd(y, x % y);\n }\n public long lcm(long x, long y) {\n return x / gcd(x, y) * y;\n }\n public HashMap factorization(long num) {\n HashMap hash = new HashMap<>();\n long n = num;\n long count = 2;\n while (n > 1) {\n while (n % count == 0) {\n n /= count;\n if (hash.containsKey(count)) hash.put(count, hash.get(count) + 1);\n else hash.put(count, 1L);\n }\n count++;\n }\n return hash;\n }\n public int sum(int[] num) {\n int ans = 0;\n for (int i = 0; i < num.length; i++) {\n ans += num[i];\n }\n return ans;\n }\n public int[] reduce(int small, int big) {\n int ins = 2;\n while (ins <= small) {\n if (small % ins == 0 && big % ins == 0) {\n small /= ins;\n big /= ins;\n ins = 2;\n } else {\n ins++;\n }\n }\n return new int[]{small, big};\n }\n public int reduceCount(int small, int big) {\n int ins = 2;\n int ans = 0;\n while (ins <= small) {\n if (small % ins == 0 && big % ins == 0) {\n small /= ins;\n big /= ins;\n ins = 2;\n ans++;\n } else {\n ins++;\n }\n }\n return ans;\n }\n public int binarySearch(int[] array, int target) {\n int pos = -1;\n int left = 0;\n int right = array.length - 1;\n int middle;\n while (pos == -1 && left <= right) {\n middle = (left + right) / 2;\n if (array[middle] == target) pos = middle;\n else if (array[middle] > target) right = middle - 1;\n else left = middle + 1;\n }\n return pos;\n }\n public int upperBound(int[] ar, long d, int n, int f){\n int p = n;\n int q = f;\n while (p-q>1){\n int mid = (p+q)/2;\n if (ar[mid]==d){\n return mid+1;\n }\n if (ar[mid] 0) {\n if ((n & 1) != 0) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n }\n public long modinv(long a, long mod) {\n return modPow(a, mod - 2, mod);\n }\n public void COMinit() {\n fac[0] = 1;\n fac[1] = 1;\n finv[0] = 1;\n finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++) {\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[(int)(MOD % i)] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n public long COM(int n, int k) {\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n-k]%MOD)% MOD;\n }\n public long PER(int n, int k){\n return fac[n]*finv[n-k]%MOD;\n }\n public long HCOM(int n, int k) {\n return COM(n + k - 1, k);\n }\n public boolean[] getIsPrimeArray(int max){\n boolean[] ret = new boolean[max+1];\n Arrays.fill(ret,true);\n ret[0]=false;\n ret[1]=false;\n for (int i=2;i<=max;i++){\n if (ret[i]){\n int c = 2*i;\n while (c<=max){\n ret[c]=false;\n c+=i;\n }\n }\n }\n return ret;\n }\n\n //array\n public int[] remove(int[] ar, int pos) {\n int[] ret = new int[ar.length - 1];\n for (int i = 0; i < pos; i++) ret[i] = ar[i];\n for (int i = pos + 1; i < ar.length; i++) ret[i - 1] = ar[i];\n return ret;\n }\n public int[] nextArray(int size,int cons){\n int[] ret = new int[size];\n for (int i=0;i ans[a[0]] + a[2]) {\n ans[a[1]] = ans[a[0]] + a[2];\n if (i == size - 1) {\n System.out.println(\"negative loop\");\n break;\n }\n }\n }\n }\n return ans;\n }//辺を配列の要素として管理。\n\n\n }\n public static class Queue{\n private final int max = 1000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){return (head == (tail+1)%max);}\n public void enqueue(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T dequeue(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n }\n public static class Deque{\n private final int max = 10000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){\n return (head == (tail+1)%max);\n }\n public void pushFirst(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n head--;\n if (head==-1)head=max-1;\n queue[head] = v;\n }\n public void pushLast(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T popFirst(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n public T popLast(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n if (--tail==-1)tail=max-1;\n return queue[tail];\n }\n\n public T peekFirst(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n return queue[head];\n }\n public T peekLast(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n return queue[tail];\n }\n }\n public static class Stack{\n private final int max = 100000;\n private final T[] stack =(T[]) new Object[max];\n private int top = 0;\n public boolean isEmpty(){return (top==0);}\n public boolean isFull(){return (top==max);}\n public void init(){top=0;}\n public void push(T v){\n if (isFull()){\n System.out.println(\"error: stack is full.\");\n return;\n }\n stack[top++] = v;\n }\n public T pop(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[--top];\n }\n public T peek(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[top];\n }\n }\n public static class Pair{\n private K A;\n private V B;\n Pair(K a,V b){\n A=a;\n B=b;\n }\n public void changeA(K a){A=a;}\n public void changeB(V b){B=b;}\n public void changeAB(K a,V b){A=a;B=b;}\n public static Comparator numberSortWithA = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A){\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B)return 0;\n else return 1;\n }\n else return 1;\n }\n };\n public static Comparator numberSortWithB = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B){\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A)return 0;\n else return 1;\n }\n else return 1;\n }\n };\n }\n public static class Graph{\n private final HashMap> graph = new HashMap<>();\n private final int Size;\n Graph(int size){\n for (int i=0;i());\n Size = size;\n }\n\n public void addEdge(int node1,int node2){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).add(node2);\n graph.get(node2).add(node1);\n }\n }\n public void addDirectEdge(int from,int to){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).add(to);\n }\n }\n public int[] depth(int root){\n Queue q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n int[] depth = new int[Size];\n Arrays.fill(depth,-1);\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v)){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+1;\n }\n }\n }\n return depth;\n }\n public HashSet getConnected(int pos){return graph.get(pos);}\n }\n public static class WeightedGraph{\n private final HashMap> graph = new HashMap<>();\n private final int Size;\n private long[] Depth;\n WeightedGraph(int size){\n for (int i=0;i());\n Size = size;\n }\n\n public void addEdge(int node1,int node2,int weight){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).put(node2,weight);\n graph.get(node2).put(node1,weight);\n }\n }\n public void addDirectEdge(int from,int to,int weight){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).put(to,weight);\n }\n }\n public int[] dijkstra(int root){\n Comparator c = new Comparator() {\n @Override\n public int compare(int[] o1, int[] o2) {\n return Integer.compare(o1[1], o2[1]);\n }\n };\n PriorityQueue q = new PriorityQueue<>(c);\n q.add(new int[]{root,0});\n int[] ret = new int[Size];\n Arrays.fill(ret,Integer.MAX_VALUE);\n ret[root]=0;\n while (!q.isEmpty()){\n int[] v = q.poll();\n if (v[1]<=ret[v[0]]){\n HashMap h = graph.get(v[0]);\n for (int u : h.keySet()){\n if (ret[u]>v[1]+h.get(u)){\n ret[u]=v[1]+h.get(u);\n q.add(new int[]{u,ret[u]});\n }\n }\n }\n }\n return ret;\n }\n\n public long[] Depth(int root){\n Queue q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n long[] depth = new long[Size];\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v).keySet()){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+graph.get(v).get(u);\n }\n }\n }\n Depth = depth.clone();\n return depth;\n }\n\n }\n public static class UnionFindTree{\n int[] parent;\n int[] rank;\n int[] Size;\n int Number;\n public UnionFindTree(int size){\n this.parent = new int[size];\n this.rank = new int[size];\n this.Size = new int[size];\n makeSet();\n }\n public void makeSet(){\n for (int i=0;irank[yRoot]){\n parent[yRoot] = xRoot;\n Size[xRoot]+=Size[yRoot];\n Number--;\n }else if (rank[xRoot]{\n T[] Array;\n int Width;\n int Length;\n BitSearch(T[] t, int width){\n Array = t;\n Width = width;\n Length = Array.length;\n }\n void start(){\n long max = (long)Math.pow(Width,Length);\n for (long i=0;i map = new HashMap<>();\n\t\tfor(i=0;i list = new ArrayList<>(map.keySet());\n\t\t\tCollections.sort(list);\n\t\t\tboolean f=true;\n\t\t\tfor (i = 1;i < list.size(); i++) {\n\t\t\t\tif(list.get(i)-list.get(i-1)!=1) {\n\t\t\t\t\tf=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(list.get(0)>1)f=false; \n\t\t\tif(f) {\n\t\t\t\tans=1;\n\t\t\t\ti=0;\n\t\t\t\tint pre = list.get(i);\n\t\t\t\ti++;\n\t\t\t\tif(pre==0) {\n\t\t\t\t\tpre = list.get(i);\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\tfor (; i < list.size(); i++) {\n\t\t\t\t\tfor (j = 0; j < map.get(list.get(i)); j++) {\n\t\t\t\t\t\tans*=(long)map.get(pre);\n\t\t\t\t\t\tif(ans>=MOD)ans%=MOD;\n\t\t\t\t\t}\n\t\t\t\t\tpre = list.get(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1573357734, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02866.html", "problem_id": "p02866", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02866/input.txt", "sample_output_relpath": "derived/input_output/data/p02866/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02866/Java/s837737689.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s837737689", "user_id": "u892395063"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\nimport java.io.PrintWriter;\nimport static java.lang.Integer.*;\nimport static java.lang.Long.*;\nimport static java.lang.Math.*;\nimport static java.lang.System.*;\n\npublic class Main {\n\tpublic static long MOD = 998244353;\n\tpublic static void main(String[] args) {\n\t\tint i,j;\n\t\tScanner sc = new Scanner(in);\n\t\tint n = parseInt(sc.next());\n\t\tint[] d = new int[n];\n\t\tHashMap map = new HashMap<>();\n\t\tfor(i=0;i list = new ArrayList<>(map.keySet());\n\t\t\tCollections.sort(list);\n\t\t\tboolean f=true;\n\t\t\tfor (i = 1;i < list.size(); i++) {\n\t\t\t\tif(list.get(i)-list.get(i-1)!=1) {\n\t\t\t\t\tf=false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(list.get(0)>1)f=false; \n\t\t\tif(f) {\n\t\t\t\tans=1;\n\t\t\t\ti=0;\n\t\t\t\tint pre = list.get(i);\n\t\t\t\ti++;\n\t\t\t\tif(pre==0) {\n\t\t\t\t\tpre = list.get(i);\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\tfor (; i < list.size(); i++) {\n\t\t\t\t\tfor (j = 0; j < map.get(list.get(i)); j++) {\n\t\t\t\t\t\tans*=(long)map.get(pre);\n\t\t\t\t\t\tif(ans>=MOD)ans%=MOD;\n\t\t\t\t\t}\n\t\t\t\t\tpre = list.get(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout.println(ans);\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is an integer sequence D_1,...,D_N of N elements. Find the number, modulo 998244353, of trees with N vertices numbered 1 to N that satisfy the following condition:\n\nFor every integer i from 1 to N, the distance between Vertex 1 and Vertex i is D_i.\n\nNotes\n\nA tree of N vertices is a connected undirected graph with N vertices and N-1 edges, and the distance between two vertices are the number of edges in the shortest path between them.\n\nTwo trees are considered different if and only if there are two vertices x and y such that there is an edge between x and y in one of those trees and not in the other.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq D_i \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n0 1 1 2\n\nSample Output 1\n\n2\n\nFor example, a tree with edges (1,2), (1,3), and (2,4) satisfies the condition.\n\nSample Input 2\n\n4\n1 1 1 1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n7\n0 3 2 1 2 2 1\n\nSample Output 3\n\n24", "sample_input": "4\n0 1 1 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02866", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is an integer sequence D_1,...,D_N of N elements. Find the number, modulo 998244353, of trees with N vertices numbered 1 to N that satisfy the following condition:\n\nFor every integer i from 1 to N, the distance between Vertex 1 and Vertex i is D_i.\n\nNotes\n\nA tree of N vertices is a connected undirected graph with N vertices and N-1 edges, and the distance between two vertices are the number of edges in the shortest path between them.\n\nTwo trees are considered different if and only if there are two vertices x and y such that there is an edge between x and y in one of those trees and not in the other.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq D_i \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n0 1 1 2\n\nSample Output 1\n\n2\n\nFor example, a tree with edges (1,2), (1,3), and (2,4) satisfies the condition.\n\nSample Input 2\n\n4\n1 1 1 1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n7\n0 3 2 1 2 2 1\n\nSample Output 3\n\n24", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1223, "cpu_time_ms": 473, "memory_kb": 52216}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s813720479", "group_id": "codeNet:p02866", "input_text": "import java.math.BigInteger;\nimport java.util.Scanner;\n\nclass Solver {\n\tstatic final Solver INSTANCE = new Solver();\n\n\tvoid solve(Scanner sc) {\n\t\tint N = sc.nextInt();\n\t\tint[] count = new int[N];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcount[sc.nextInt()]++;\n\t\t}\n\t\tif (count[0] != 1) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tBigInteger multiply = BigInteger.ONE;\n\t\tBigInteger prev = BigInteger.valueOf(count[0]);\n\t\tBigInteger mod = BigInteger.valueOf(998244353);\n\t\tfor (int i = 1; i < count.length; i++) {\n\t\t\tif (count[i] < 1) break;\n\t\t\tBigInteger pow = prev.modPow(prev = BigInteger.valueOf(count[i]), mod);\n\t\t\tmultiply = multiply.multiply(pow).mod(mod);\n\t\t}\n\t\tSystem.out.println(multiply);\n\t}\n}\n\nclass Main {\n\tpublic static void main(String... args) {\n\t\tScanner in = new Scanner(System.in);\n\n\t\tSolver.INSTANCE.solve(in);\n\n\t\tin.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1573357160, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02866.html", "problem_id": "p02866", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02866/input.txt", "sample_output_relpath": "derived/input_output/data/p02866/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02866/Java/s813720479.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s813720479", "user_id": "u316542627"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.math.BigInteger;\nimport java.util.Scanner;\n\nclass Solver {\n\tstatic final Solver INSTANCE = new Solver();\n\n\tvoid solve(Scanner sc) {\n\t\tint N = sc.nextInt();\n\t\tint[] count = new int[N];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcount[sc.nextInt()]++;\n\t\t}\n\t\tif (count[0] != 1) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tBigInteger multiply = BigInteger.ONE;\n\t\tBigInteger prev = BigInteger.valueOf(count[0]);\n\t\tBigInteger mod = BigInteger.valueOf(998244353);\n\t\tfor (int i = 1; i < count.length; i++) {\n\t\t\tif (count[i] < 1) break;\n\t\t\tBigInteger pow = prev.modPow(prev = BigInteger.valueOf(count[i]), mod);\n\t\t\tmultiply = multiply.multiply(pow).mod(mod);\n\t\t}\n\t\tSystem.out.println(multiply);\n\t}\n}\n\nclass Main {\n\tpublic static void main(String... args) {\n\t\tScanner in = new Scanner(System.in);\n\n\t\tSolver.INSTANCE.solve(in);\n\n\t\tin.close();\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is an integer sequence D_1,...,D_N of N elements. Find the number, modulo 998244353, of trees with N vertices numbered 1 to N that satisfy the following condition:\n\nFor every integer i from 1 to N, the distance between Vertex 1 and Vertex i is D_i.\n\nNotes\n\nA tree of N vertices is a connected undirected graph with N vertices and N-1 edges, and the distance between two vertices are the number of edges in the shortest path between them.\n\nTwo trees are considered different if and only if there are two vertices x and y such that there is an edge between x and y in one of those trees and not in the other.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq D_i \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n0 1 1 2\n\nSample Output 1\n\n2\n\nFor example, a tree with edges (1,2), (1,3), and (2,4) satisfies the condition.\n\nSample Input 2\n\n4\n1 1 1 1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n7\n0 3 2 1 2 2 1\n\nSample Output 3\n\n24", "sample_input": "4\n0 1 1 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02866", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is an integer sequence D_1,...,D_N of N elements. Find the number, modulo 998244353, of trees with N vertices numbered 1 to N that satisfy the following condition:\n\nFor every integer i from 1 to N, the distance between Vertex 1 and Vertex i is D_i.\n\nNotes\n\nA tree of N vertices is a connected undirected graph with N vertices and N-1 edges, and the distance between two vertices are the number of edges in the shortest path between them.\n\nTwo trees are considered different if and only if there are two vertices x and y such that there is an edge between x and y in one of those trees and not in the other.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq D_i \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n0 1 1 2\n\nSample Output 1\n\n2\n\nFor example, a tree with edges (1,2), (1,3), and (2,4) satisfies the condition.\n\nSample Input 2\n\n4\n1 1 1 1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n7\n0 3 2 1 2 2 1\n\nSample Output 3\n\n24", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 841, "cpu_time_ms": 525, "memory_kb": 60840}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s003860526", "group_id": "codeNet:p02873", "input_text": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\tprivate static void solve(){\n\t//Implement solution here.\n\t\tString s = next();\n\t\tint n = s.length() + 1;\n\t\tchar[] c = s.toCharArray();\n\t\tlong result = 0;\n\t\tint cnt = 0;\n\t\tint[] l = new int[n];\n\t\tint[] r = new int[n];\n\t\tfor(int i = 0; i < n - 1; i++) {\n\t\t\tif(c[i] == '<') {\n\t\t\t\tcnt++;\n\t\t\t\tl[i + 1] = cnt;\n\t\t\t} else {\n\t\t\t\tcnt = 0;\n\t\t\t}\n\t\t}\n\t\t\n\t\tcnt = 0;\n\t\tfor(int i = n - 2; i >= 0; i--) {\n\t\t\tif(c[i] == '>') {\n\t\t\t\tcnt++;\n\t\t\t\tr[i] = cnt;\n\t\t\t} else {\n\t\t\t\tcnt = 0;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tresult += Math.max(l[i], r[i]);\n\t\t}\n\t\t\n\t\tSystem.out.println(result);\n\t}\n\n //Switch input source (stdin/file)\n\tprivate static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\tpublic static void main(String[] args){\n String debugDataPath = System.getenv(\"DD_PATH\"); \n if(debugDataPath != null){\n try{\n \tbr = new BufferedReader(new InputStreamReader(new FileInputStream(new File(debugDataPath))));\n }catch(Exception e){\n throw new RuntimeException(e);\n }\n }\n solve();\n\t}\n\n //Input read utility\n\tprivate static StringTokenizer tokenizer = null;\n\tpublic static String next() {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\ttokenizer = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n //Get next single int\n\tprivate static int ni() {\n\t\treturn Integer.parseInt(next());\n\t}\n //Get next single long\n\tprivate static long nl() {\n\t\treturn Long.parseLong(next());\n\t}\n //Get next single double\n\tprivate static double nd() {\n\t\treturn Double.parseDouble(next());\n\t}\n //Get next int array from one line\n\tprivate static int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\t//Get next char array from one line\n\tprivate static char[] ns() {\n\t\treturn next().toCharArray();\n\t}\n //Get next long array from one line\n\tprivate static long[] nal(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n}", "language": "Java", "metadata": {"date": 1573008080, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02873.html", "problem_id": "p02873", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02873/input.txt", "sample_output_relpath": "derived/input_output/data/p02873/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02873/Java/s003860526.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s003860526", "user_id": "u703108590"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\tprivate static void solve(){\n\t//Implement solution here.\n\t\tString s = next();\n\t\tint n = s.length() + 1;\n\t\tchar[] c = s.toCharArray();\n\t\tlong result = 0;\n\t\tint cnt = 0;\n\t\tint[] l = new int[n];\n\t\tint[] r = new int[n];\n\t\tfor(int i = 0; i < n - 1; i++) {\n\t\t\tif(c[i] == '<') {\n\t\t\t\tcnt++;\n\t\t\t\tl[i + 1] = cnt;\n\t\t\t} else {\n\t\t\t\tcnt = 0;\n\t\t\t}\n\t\t}\n\t\t\n\t\tcnt = 0;\n\t\tfor(int i = n - 2; i >= 0; i--) {\n\t\t\tif(c[i] == '>') {\n\t\t\t\tcnt++;\n\t\t\t\tr[i] = cnt;\n\t\t\t} else {\n\t\t\t\tcnt = 0;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tresult += Math.max(l[i], r[i]);\n\t\t}\n\t\t\n\t\tSystem.out.println(result);\n\t}\n\n //Switch input source (stdin/file)\n\tprivate static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\tpublic static void main(String[] args){\n String debugDataPath = System.getenv(\"DD_PATH\"); \n if(debugDataPath != null){\n try{\n \tbr = new BufferedReader(new InputStreamReader(new FileInputStream(new File(debugDataPath))));\n }catch(Exception e){\n throw new RuntimeException(e);\n }\n }\n solve();\n\t}\n\n //Input read utility\n\tprivate static StringTokenizer tokenizer = null;\n\tpublic static String next() {\n\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\ttokenizer = new StringTokenizer(br.readLine());\n\t\t\t} catch (Exception e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n //Get next single int\n\tprivate static int ni() {\n\t\treturn Integer.parseInt(next());\n\t}\n //Get next single long\n\tprivate static long nl() {\n\t\treturn Long.parseLong(next());\n\t}\n //Get next single double\n\tprivate static double nd() {\n\t\treturn Double.parseDouble(next());\n\t}\n //Get next int array from one line\n\tprivate static int[] na(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = ni();\n\t\treturn a;\n\t}\n\t//Get next char array from one line\n\tprivate static char[] ns() {\n\t\treturn next().toCharArray();\n\t}\n //Get next long array from one line\n\tprivate static long[] nal(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nl();\n\t\treturn a;\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S of length N-1.\nEach character in S is < or >.\n\nA sequence of N non-negative integers, a_1,a_2,\\cdots,a_N, is said to be good when the following condition is satisfied for all i (1 \\leq i \\leq N-1):\n\nIf S_i= <: a_i: a_i>a_{i+1}\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^5\n\nS is a string of length N-1 consisting of < and >.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nSample Input 1\n\n<>>\n\nSample Output 1\n\n3\n\na=(0,2,1,0) is a good sequence whose sum is 3.\nThere is no good sequence whose sum is less than 3.\n\nSample Input 2\n\n<>>><<><<<<<>>><\n\nSample Output 2\n\n28", "sample_input": "<>>\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02873", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S of length N-1.\nEach character in S is < or >.\n\nA sequence of N non-negative integers, a_1,a_2,\\cdots,a_N, is said to be good when the following condition is satisfied for all i (1 \\leq i \\leq N-1):\n\nIf S_i= <: a_i: a_i>a_{i+1}\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^5\n\nS is a string of length N-1 consisting of < and >.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nSample Input 1\n\n<>>\n\nSample Output 1\n\n3\n\na=(0,2,1,0) is a good sequence whose sum is 3.\nThere is no good sequence whose sum is less than 3.\n\nSample Input 2\n\n<>>><<><<<<<>>><\n\nSample Output 2\n\n28", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2196, "cpu_time_ms": 151, "memory_kb": 33160}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s034711567", "group_id": "codeNet:p02874", "input_text": "import java.util.*;\n\nimport java.io.*;\nimport java.nio.charset.StandardCharsets;\n\npublic class Main {\n\tint N;\n\tList segments, segments2;\n\tList LList, RList;\n\n\tstatic class Tuple {\n\t\tlong L, R;\n\n\t\tTuple(String line) {\n\t\t\tString[] tokens = line.split(\" \");\n\t\t\tL = Long.parseLong(tokens[0]);\n\t\t\tR = Long.parseLong(tokens[1]);\n\t\t}\n\t}\n\n\tMain(BufferedReader in) throws IOException {\n\t\tthis.N = Integer.parseInt(in.readLine());\n\t\tthis.segments = new ArrayList<>();\n\t\tthis.segments2 = new ArrayList<>();\n\t\tthis.RList = new ArrayList<>();\n\t\tthis.LList = new ArrayList<>();\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tTuple tuple = new Tuple(in.readLine());\n\t\t\tthis.segments.add(tuple);\n\t\t\tthis.segments2.add(tuple);\n\t\t\tRList.add(tuple.R);\n\t\t\tLList.add(tuple.L);\n\t\t}\n\t\tCollections.sort(this.segments, new Comparator() {\n\t\t\t@Override\n\t\t\tpublic int compare(Tuple o1, Tuple o2) {\n\t\t\t\tif (o1.L != o2.L) {\n\t\t\t\t\treturn Long.compare(o1.L, o2.L);\n\t\t\t\t} else {\n\t\t\t\t\treturn -1 * Long.compare(o1.R, o2.R);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\tCollections.sort(this.segments2, new Comparator() {\n\t\t\t@Override\n\t\t\tpublic int compare(Tuple o1, Tuple o2) {\n\t\t\t\tif (o1.R != o2.R) {\n\t\t\t\t\treturn -1 * Long.compare(o1.R, o2.R);\n\t\t\t\t} else {\n\t\t\t\t\treturn Long.compare(o1.L, o2.L);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\tCollections.sort(RList);\n\t\tCollections.sort(LList, new Comparator() {\n\t\t\t@Override\n\t\t\tpublic int compare(Long o1, Long o2) {\n\t\t\t\treturn -1 * Long.compare(o1, o2);\n\t\t\t}\n\t\t});\n\t\tcalc();\n\t}\n\n\tlong sub2(List segments, int target) {\n\t\tTuple seg = segments.get(target);\n\t\t// 中抜きパターン\n\t\tlong result = seg.R - seg.L + 1;\n\t\tlong R = 0, L = 0;\n\t\tif (seg.R != RList.get(0)) {\n\t\t\tR = RList.get(0);\n\t\t} else {\n\t\t\tR = RList.get(1);\n\t\t}\n\t\tif (seg.L != LList.get(0)) {\n\t\t\tL = LList.get(0);\n\t\t} else {\n\t\t\tL = LList.get(1);\n\t\t}\n\t\tresult += Math.max(0, R - L + 1);\n\t\treturn result;\n\t}\n\n\tlong sub(List segments) {\n\t\tList upper = new ArrayList<>();\n\t\tupper.add(segments.get(0).R - segments.get(0).L + 1);\n\t\tlong lMax = segments.get(0).L;\n\t\tlong rMin = segments.get(0).R;\n\t\tfor (int i = 1; i < segments.size(); ++i) {\n\t\t\tTuple seg = segments.get(i);\n\t\t\tlMax = Math.max(lMax, seg.L);\n\t\t\trMin = Math.min(rMin, seg.R);\n\t\t\tupper.add(Math.max(0, rMin - lMax + 1));\n\t\t}\n\t\tList lower = new ArrayList<>();\n\t\tlMax = segments.get(segments.size() - 1).L;\n\t\trMin = segments.get(segments.size() - 1).R;\n\t\tlower.add(rMin - lMax + 1);\n\t\tfor (int i = segments.size() - 2; i >= 0; --i) {\n\t\t\tTuple seg = segments.get(i);\n\t\t\tlMax = Math.max(lMax, seg.L);\n\t\t\trMin = Math.min(rMin, seg.R);\n\t\t\tlower.add(Math.max(0, rMin - lMax + 1));\n\t\t}\n\t\tCollections.reverse(lower);\n\t\tlong result = 0;\n\t\tfor (int i = 0; i + 1 < upper.size(); ++i) {\n\t\t\tresult = Math.max(result, lower.get(i + 1) + upper.get(i));\n\t\t}\n\t\treturn result;\n\t}\n\n\tvoid calc() {\n\t\tlong calcA = sub(this.segments);\n\t\tlong calcB = sub(this.segments2);\n\t\tlong result = Math.max(calcA, calcB);\n\t\tfor (int i = 0; i < segments.size(); ++i) {\n\t\t\tlong sub2Result = sub2(segments, i);\n\t\t\tresult = Math.max(result, sub2Result);\n\t\t}\n\t\t/*\n\t\t * Collections.reverse(this.segments2); for (int i = 0; i < segments2.size();\n\t\t * ++i) { long sub2Result = sub2(segments2, i); result = Math.max(result,\n\t\t * sub2Result); }\n\t\t */\n\t\tSystem.out.println(result);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);\n\t\tBufferedReader in = new BufferedReader(reader);\n\t\tMain ins = new Main(in);\n\t}\n};", "language": "Java", "metadata": {"date": 1572850320, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02874.html", "problem_id": "p02874", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02874/input.txt", "sample_output_relpath": "derived/input_output/data/p02874/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02874/Java/s034711567.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s034711567", "user_id": "u655125439"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.*;\n\nimport java.io.*;\nimport java.nio.charset.StandardCharsets;\n\npublic class Main {\n\tint N;\n\tList segments, segments2;\n\tList LList, RList;\n\n\tstatic class Tuple {\n\t\tlong L, R;\n\n\t\tTuple(String line) {\n\t\t\tString[] tokens = line.split(\" \");\n\t\t\tL = Long.parseLong(tokens[0]);\n\t\t\tR = Long.parseLong(tokens[1]);\n\t\t}\n\t}\n\n\tMain(BufferedReader in) throws IOException {\n\t\tthis.N = Integer.parseInt(in.readLine());\n\t\tthis.segments = new ArrayList<>();\n\t\tthis.segments2 = new ArrayList<>();\n\t\tthis.RList = new ArrayList<>();\n\t\tthis.LList = new ArrayList<>();\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tTuple tuple = new Tuple(in.readLine());\n\t\t\tthis.segments.add(tuple);\n\t\t\tthis.segments2.add(tuple);\n\t\t\tRList.add(tuple.R);\n\t\t\tLList.add(tuple.L);\n\t\t}\n\t\tCollections.sort(this.segments, new Comparator() {\n\t\t\t@Override\n\t\t\tpublic int compare(Tuple o1, Tuple o2) {\n\t\t\t\tif (o1.L != o2.L) {\n\t\t\t\t\treturn Long.compare(o1.L, o2.L);\n\t\t\t\t} else {\n\t\t\t\t\treturn -1 * Long.compare(o1.R, o2.R);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\tCollections.sort(this.segments2, new Comparator() {\n\t\t\t@Override\n\t\t\tpublic int compare(Tuple o1, Tuple o2) {\n\t\t\t\tif (o1.R != o2.R) {\n\t\t\t\t\treturn -1 * Long.compare(o1.R, o2.R);\n\t\t\t\t} else {\n\t\t\t\t\treturn Long.compare(o1.L, o2.L);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\tCollections.sort(RList);\n\t\tCollections.sort(LList, new Comparator() {\n\t\t\t@Override\n\t\t\tpublic int compare(Long o1, Long o2) {\n\t\t\t\treturn -1 * Long.compare(o1, o2);\n\t\t\t}\n\t\t});\n\t\tcalc();\n\t}\n\n\tlong sub2(List segments, int target) {\n\t\tTuple seg = segments.get(target);\n\t\t// 中抜きパターン\n\t\tlong result = seg.R - seg.L + 1;\n\t\tlong R = 0, L = 0;\n\t\tif (seg.R != RList.get(0)) {\n\t\t\tR = RList.get(0);\n\t\t} else {\n\t\t\tR = RList.get(1);\n\t\t}\n\t\tif (seg.L != LList.get(0)) {\n\t\t\tL = LList.get(0);\n\t\t} else {\n\t\t\tL = LList.get(1);\n\t\t}\n\t\tresult += Math.max(0, R - L + 1);\n\t\treturn result;\n\t}\n\n\tlong sub(List segments) {\n\t\tList upper = new ArrayList<>();\n\t\tupper.add(segments.get(0).R - segments.get(0).L + 1);\n\t\tlong lMax = segments.get(0).L;\n\t\tlong rMin = segments.get(0).R;\n\t\tfor (int i = 1; i < segments.size(); ++i) {\n\t\t\tTuple seg = segments.get(i);\n\t\t\tlMax = Math.max(lMax, seg.L);\n\t\t\trMin = Math.min(rMin, seg.R);\n\t\t\tupper.add(Math.max(0, rMin - lMax + 1));\n\t\t}\n\t\tList lower = new ArrayList<>();\n\t\tlMax = segments.get(segments.size() - 1).L;\n\t\trMin = segments.get(segments.size() - 1).R;\n\t\tlower.add(rMin - lMax + 1);\n\t\tfor (int i = segments.size() - 2; i >= 0; --i) {\n\t\t\tTuple seg = segments.get(i);\n\t\t\tlMax = Math.max(lMax, seg.L);\n\t\t\trMin = Math.min(rMin, seg.R);\n\t\t\tlower.add(Math.max(0, rMin - lMax + 1));\n\t\t}\n\t\tCollections.reverse(lower);\n\t\tlong result = 0;\n\t\tfor (int i = 0; i + 1 < upper.size(); ++i) {\n\t\t\tresult = Math.max(result, lower.get(i + 1) + upper.get(i));\n\t\t}\n\t\treturn result;\n\t}\n\n\tvoid calc() {\n\t\tlong calcA = sub(this.segments);\n\t\tlong calcB = sub(this.segments2);\n\t\tlong result = Math.max(calcA, calcB);\n\t\tfor (int i = 0; i < segments.size(); ++i) {\n\t\t\tlong sub2Result = sub2(segments, i);\n\t\t\tresult = Math.max(result, sub2Result);\n\t\t}\n\t\t/*\n\t\t * Collections.reverse(this.segments2); for (int i = 0; i < segments2.size();\n\t\t * ++i) { long sub2Result = sub2(segments2, i); result = Math.max(result,\n\t\t * sub2Result); }\n\t\t */\n\t\tSystem.out.println(result);\n\t}\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tInputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);\n\t\tBufferedReader in = new BufferedReader(reader);\n\t\tMain ins = new Main(in);\n\t}\n};", "problem_context": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "sample_input": "4\n4 7\n1 4\n5 8\n2 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02874", "source_text": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3501, "cpu_time_ms": 941, "memory_kb": 74076}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s652676799", "group_id": "codeNet:p02880", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tfor(int i = 1;i<=9;i++) {\n\t\t\tfor(int j = 1;j<=9;j++) {\n\t\t\t\tif(j*i==N) {\n\t\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"No\");\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1573221417, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p02880.html", "problem_id": "p02880", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02880/input.txt", "sample_output_relpath": "derived/input_output/data/p02880/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02880/Java/s652676799.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s652676799", "user_id": "u240764465"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tfor(int i = 1;i<=9;i++) {\n\t\t\tfor(int j = 1;j<=9;j++) {\n\t\t\t\tif(j*i==N) {\n\t\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"No\");\n\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "sample_input": "10\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02880", "source_text": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 322, "cpu_time_ms": 111, "memory_kb": 22740}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s555860576", "group_id": "codeNet:p02880", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint x = sc.nextInt();\n\t\tsc.close();\n\t\tfor (int a = 1; a <= 9; a++) {\n\t\t\tif (x % a == 0 && x / a < 10) {\n\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t\tbreak;\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"No\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1572355787, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02880.html", "problem_id": "p02880", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02880/input.txt", "sample_output_relpath": "derived/input_output/data/p02880/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02880/Java/s555860576.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s555860576", "user_id": "u699252741"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint x = sc.nextInt();\n\t\tsc.close();\n\t\tfor (int a = 1; a <= 9; a++) {\n\t\t\tif (x % a == 0 && x / a < 10) {\n\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t\tbreak;\n\t\t\t} else {\n\t\t\t\tSystem.out.println(\"No\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "sample_input": "10\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02880", "source_text": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 94, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s399038567", "group_id": "codeNet:p02880", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\n\npublic class Main implements Runnable {\n\n\tpublic static void main(String[] args) {\n\n\t\tnew Thread(null, new Main(), \"\", 16 * 1024 * 1024).start();\n\n\t}\n\n\t@Override\n\tpublic void run() {\n\t\texec();\n\t}\n\n\tprivate void exec() {\n\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\tint n = sc.nextInt();\n\n\t\tString ans = \"No\";\n\t\tfor(int i = 1 ; i <= 9 ; i++) {\n\t\t\tfor(int j = 1 ; j <= 9 ; j++) {\n\t\t\t\tif(n == i * j) {\n\t\t\t\t\tans = \"Yes\";\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t}\n\n}\n\nclass FastScanner {\n\n\tprivate final InputStream in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tpublic FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n\n\tprivate boolean hasNextByte() {\n\t\tif(ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif(buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif(hasNextByte()) {\n\t\t\treturn buffer[ptr++];\n\t\t} else {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile(hasNextByte() && !isPrintableChar(buffer[ptr])) {\n\t\t\tptr++;\n\t\t}\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile(isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext()) {\n\t\t\tthrow new NoSuchElementException();\n\t\t}\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1572224673, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02880.html", "problem_id": "p02880", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02880/input.txt", "sample_output_relpath": "derived/input_output/data/p02880/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02880/Java/s399038567.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s399038567", "user_id": "u325942975"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\n\npublic class Main implements Runnable {\n\n\tpublic static void main(String[] args) {\n\n\t\tnew Thread(null, new Main(), \"\", 16 * 1024 * 1024).start();\n\n\t}\n\n\t@Override\n\tpublic void run() {\n\t\texec();\n\t}\n\n\tprivate void exec() {\n\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\tint n = sc.nextInt();\n\n\t\tString ans = \"No\";\n\t\tfor(int i = 1 ; i <= 9 ; i++) {\n\t\t\tfor(int j = 1 ; j <= 9 ; j++) {\n\t\t\t\tif(n == i * j) {\n\t\t\t\t\tans = \"Yes\";\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t}\n\n}\n\nclass FastScanner {\n\n\tprivate final InputStream in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tpublic FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n\n\tprivate boolean hasNextByte() {\n\t\tif(ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif(buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif(hasNextByte()) {\n\t\t\treturn buffer[ptr++];\n\t\t} else {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile(hasNextByte() && !isPrintableChar(buffer[ptr])) {\n\t\t\tptr++;\n\t\t}\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile(isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext()) {\n\t\t\tthrow new NoSuchElementException();\n\t\t}\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true){\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)){\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else{\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "sample_input": "10\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02880", "source_text": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2343, "cpu_time_ms": 72, "memory_kb": 21460}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s354317766", "group_id": "codeNet:p02881", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.List;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CWalkOnMultiplicationTable solver = new CWalkOnMultiplicationTable();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CWalkOnMultiplicationTable {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int[] primes = sieveOfEratosthenes(1000000);\n long n = in.nextLong();\n long auxN = n;\n List fact = new ArrayList<>();\n for (int i = 2; i < primes.length && n > 1; i++) {\n if (primes[i] == 0) {\n while (n % i == 0) {\n fact.add((long) i);\n n /= i;\n }\n }\n }\n if (fact.isEmpty()) {\n out.println(auxN - 1);\n } else {\n long b = -1;\n long a = -1;\n long temp = (long) Math.sqrt(auxN);\n while (temp > 1) {\n if (auxN % temp == 0) {\n b = temp;\n a = auxN / temp;\n break;\n }\n temp--;\n }\n long ans = (a - 1) + (b - 1);\n out.println(ans);\n }\n }\n\n int[] sieveOfEratosthenes(int n) {\n int prime[] = new int[n + 1];\n for (int p = 2; p * p <= n; p++) {\n if (prime[p] == 0) {\n for (int i = p * p; i <= n; i += p)\n prime[i] = 1;\n }\n }\n return prime;\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1572230367, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02881.html", "problem_id": "p02881", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02881/input.txt", "sample_output_relpath": "derived/input_output/data/p02881/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02881/Java/s354317766.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s354317766", "user_id": "u588760359"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.List;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CWalkOnMultiplicationTable solver = new CWalkOnMultiplicationTable();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CWalkOnMultiplicationTable {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int[] primes = sieveOfEratosthenes(1000000);\n long n = in.nextLong();\n long auxN = n;\n List fact = new ArrayList<>();\n for (int i = 2; i < primes.length && n > 1; i++) {\n if (primes[i] == 0) {\n while (n % i == 0) {\n fact.add((long) i);\n n /= i;\n }\n }\n }\n if (fact.isEmpty()) {\n out.println(auxN - 1);\n } else {\n long b = -1;\n long a = -1;\n long temp = (long) Math.sqrt(auxN);\n while (temp > 1) {\n if (auxN % temp == 0) {\n b = temp;\n a = auxN / temp;\n break;\n }\n temp--;\n }\n long ans = (a - 1) + (b - 1);\n out.println(ans);\n }\n }\n\n int[] sieveOfEratosthenes(int n) {\n int prime[] = new int[n + 1];\n for (int p = 2; p * p <= n; p++) {\n if (prime[p] == 0) {\n for (int i = p * p; i <= n; i += p)\n prime[i] = 1;\n }\n }\n return prime;\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is standing on a multiplication table with infinitely many rows and columns.\n\nThe square (i,j) contains the integer i \\times j. Initially, Takahashi is standing at (1,1).\n\nIn one move, he can move from (i,j) to either (i+1,j) or (i,j+1).\n\nGiven an integer N, find the minimum number of moves needed to reach a square that contains N.\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum number of moves needed to reach a square that contains the integer N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n5\n\n(2,5) can be reached in five moves. We cannot reach a square that contains 10 in less than five moves.\n\nSample Input 2\n\n50\n\nSample Output 2\n\n13\n\n(5, 10) can be reached in 13 moves.\n\nSample Input 3\n\n10000000019\n\nSample Output 3\n\n10000000018\n\nBoth input and output may be enormous.", "sample_input": "10\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02881", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is standing on a multiplication table with infinitely many rows and columns.\n\nThe square (i,j) contains the integer i \\times j. Initially, Takahashi is standing at (1,1).\n\nIn one move, he can move from (i,j) to either (i+1,j) or (i,j+1).\n\nGiven an integer N, find the minimum number of moves needed to reach a square that contains N.\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum number of moves needed to reach a square that contains the integer N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n5\n\n(2,5) can be reached in five moves. We cannot reach a square that contains 10 in less than five moves.\n\nSample Input 2\n\n50\n\nSample Output 2\n\n13\n\n(5, 10) can be reached in 13 moves.\n\nSample Input 3\n\n10000000019\n\nSample Output 3\n\n10000000018\n\nBoth input and output may be enormous.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3017, "cpu_time_ms": 109, "memory_kb": 27604}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s014967198", "group_id": "codeNet:p02882", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a=sc.nextInt(),b=sc.nextInt(),x=sc.nextInt();\n\t\tdouble ans = (double)2*(a*a*b-x)/(a*a*a);\n\t\tSystem.out.println(ans);\n\t\tdouble res = (double)Math.atan(ans)*180/Math.PI;\n\t\tSystem.out.printf(\"%.10f\\n\",res);\n\t}\n}", "language": "Java", "metadata": {"date": 1589420104, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02882.html", "problem_id": "p02882", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02882/input.txt", "sample_output_relpath": "derived/input_output/data/p02882/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02882/Java/s014967198.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s014967198", "user_id": "u131881594"}, "prompt_components": {"gold_output": "45.0000000000\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a=sc.nextInt(),b=sc.nextInt(),x=sc.nextInt();\n\t\tdouble ans = (double)2*(a*a*b-x)/(a*a*a);\n\t\tSystem.out.println(ans);\n\t\tdouble res = (double)Math.atan(ans)*180/Math.PI;\n\t\tSystem.out.printf(\"%.10f\\n\",res);\n\t}\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\\mathrm{cm} and whose height is b~\\mathrm{cm}. (The thickness of the bottle can be ignored.)\n\nWe will pour x~\\mathrm{cm}^3 of water into the bottle, and gradually tilt the bottle around one of the sides of the base.\n\nWhen will the water be spilled? More formally, find the maximum angle in which we can tilt the bottle without spilling any water.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq a \\leq 100\n\n1 \\leq b \\leq 100\n\n1 \\leq x \\leq a^2b\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the maximum angle in which we can tilt the bottle without spilling any water, in degrees.\nYour output will be judged as correct when the absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n2 2 4\n\nSample Output 1\n\n45.0000000000\n\nThis bottle has a cubic shape, and it is half-full. The water gets spilled when we tilt the bottle more than 45 degrees.\n\nSample Input 2\n\n12 21 10\n\nSample Output 2\n\n89.7834636934\n\nThis bottle is almost empty. When the water gets spilled, the bottle is nearly horizontal.\n\nSample Input 3\n\n3 1 8\n\nSample Output 3\n\n4.2363947991\n\nThis bottle is almost full. When the water gets spilled, the bottle is still nearly vertical.", "sample_input": "2 2 4\n"}, "reference_outputs": ["45.0000000000\n"], "source_document_id": "p02882", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\\mathrm{cm} and whose height is b~\\mathrm{cm}. (The thickness of the bottle can be ignored.)\n\nWe will pour x~\\mathrm{cm}^3 of water into the bottle, and gradually tilt the bottle around one of the sides of the base.\n\nWhen will the water be spilled? More formally, find the maximum angle in which we can tilt the bottle without spilling any water.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq a \\leq 100\n\n1 \\leq b \\leq 100\n\n1 \\leq x \\leq a^2b\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the maximum angle in which we can tilt the bottle without spilling any water, in degrees.\nYour output will be judged as correct when the absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n2 2 4\n\nSample Output 1\n\n45.0000000000\n\nThis bottle has a cubic shape, and it is half-full. The water gets spilled when we tilt the bottle more than 45 degrees.\n\nSample Input 2\n\n12 21 10\n\nSample Output 2\n\n89.7834636934\n\nThis bottle is almost empty. When the water gets spilled, the bottle is nearly horizontal.\n\nSample Input 3\n\n3 1 8\n\nSample Output 3\n\n4.2363947991\n\nThis bottle is almost full. When the water gets spilled, the bottle is still nearly vertical.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 99, "memory_kb": 23892}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s868183894", "group_id": "codeNet:p02882", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n double a = sc.nextDouble();\n double b = sc.nextDouble();\n double v = sc.nextDouble();\n double height = v / (a * a);\n double max = height* 2 - b;\n if(max >= 0){\n double rResult = (Math.PI/ 2) - Math.atan2(a, b-max);\n double result = rResult * 180.0 / Math.PI;\n System.out.println(result);\n }else{\n double p = 2 * v / ( a * b );\n double rResult = Math.atan2(b, p);\n double result = rResult * 180.0 / Math.PI;\n System.out.println(result);\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1572229658, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02882.html", "problem_id": "p02882", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02882/input.txt", "sample_output_relpath": "derived/input_output/data/p02882/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02882/Java/s868183894.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s868183894", "user_id": "u475382171"}, "prompt_components": {"gold_output": "45.0000000000\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n double a = sc.nextDouble();\n double b = sc.nextDouble();\n double v = sc.nextDouble();\n double height = v / (a * a);\n double max = height* 2 - b;\n if(max >= 0){\n double rResult = (Math.PI/ 2) - Math.atan2(a, b-max);\n double result = rResult * 180.0 / Math.PI;\n System.out.println(result);\n }else{\n double p = 2 * v / ( a * b );\n double rResult = Math.atan2(b, p);\n double result = rResult * 180.0 / Math.PI;\n System.out.println(result);\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\\mathrm{cm} and whose height is b~\\mathrm{cm}. (The thickness of the bottle can be ignored.)\n\nWe will pour x~\\mathrm{cm}^3 of water into the bottle, and gradually tilt the bottle around one of the sides of the base.\n\nWhen will the water be spilled? More formally, find the maximum angle in which we can tilt the bottle without spilling any water.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq a \\leq 100\n\n1 \\leq b \\leq 100\n\n1 \\leq x \\leq a^2b\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the maximum angle in which we can tilt the bottle without spilling any water, in degrees.\nYour output will be judged as correct when the absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n2 2 4\n\nSample Output 1\n\n45.0000000000\n\nThis bottle has a cubic shape, and it is half-full. The water gets spilled when we tilt the bottle more than 45 degrees.\n\nSample Input 2\n\n12 21 10\n\nSample Output 2\n\n89.7834636934\n\nThis bottle is almost empty. When the water gets spilled, the bottle is nearly horizontal.\n\nSample Input 3\n\n3 1 8\n\nSample Output 3\n\n4.2363947991\n\nThis bottle is almost full. When the water gets spilled, the bottle is still nearly vertical.", "sample_input": "2 2 4\n"}, "reference_outputs": ["45.0000000000\n"], "source_document_id": "p02882", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\\mathrm{cm} and whose height is b~\\mathrm{cm}. (The thickness of the bottle can be ignored.)\n\nWe will pour x~\\mathrm{cm}^3 of water into the bottle, and gradually tilt the bottle around one of the sides of the base.\n\nWhen will the water be spilled? More formally, find the maximum angle in which we can tilt the bottle without spilling any water.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq a \\leq 100\n\n1 \\leq b \\leq 100\n\n1 \\leq x \\leq a^2b\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the maximum angle in which we can tilt the bottle without spilling any water, in degrees.\nYour output will be judged as correct when the absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n2 2 4\n\nSample Output 1\n\n45.0000000000\n\nThis bottle has a cubic shape, and it is half-full. The water gets spilled when we tilt the bottle more than 45 degrees.\n\nSample Input 2\n\n12 21 10\n\nSample Output 2\n\n89.7834636934\n\nThis bottle is almost empty. When the water gets spilled, the bottle is nearly horizontal.\n\nSample Input 3\n\n3 1 8\n\nSample Output 3\n\n4.2363947991\n\nThis bottle is almost full. When the water gets spilled, the bottle is still nearly vertical.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 711, "cpu_time_ms": 114, "memory_kb": 23508}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s863695962", "group_id": "codeNet:p02883", "input_text": "import java.lang.reflect.Array;\nimport java.net.Inet4Address;\nimport java.util.Arrays;\nimport java.util.OptionalInt;\nimport java.util.Scanner;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.stream.Collectors;\nimport java.util.HashSet;\nimport java.util.HashMap;\n\npublic class Main {\n\n static long gcd(long p, long q) { if(q == 0) return p; return gcd(q, p % q);}\n static Scanner sc = new Scanner(System.in);\n /////////\n\n static int N, K;\n static ArrayList A = new ArrayList<>();\n static ArrayList F = new ArrayList<>();\n\n static boolean check(long mid) {\n long needs = 0;\n\n for(int i = 0; i < N; i++) {\n if(A.get(i) * F.get(i) <= mid) continue;\n /*\n if A[i] * F[i] > mid\n (A[i] - x) * F[i] <= mid 가 되는 최소 x\n A[i] - x <= mid / F[i]\n A[i] - mid / F[i] <= x\n Ceil(A[i] - mid / F[i])\n\n */\n needs += (long)Math.ceil(A.get(i) - (double)mid / F.get(i));\n }\n\n if(needs <= K) return true;\n else return false;\n\n }\n\n static long parametric_search(long l, long r) {\n if(r < l) return Long.MAX_VALUE;\n long mid = l + (r - l) / 2;\n\n if(check(mid)) {\n return Math.min(mid, parametric_search(l, mid - 1));\n } else {\n return parametric_search(mid + 1, r);\n }\n }\n\n\n public static void main(String[] args) {\n N = sc.nextInt(); K = sc.nextInt();\n\n for(int i = 0; i < N; i++) {\n A.add(sc.nextLong());\n }\n\n for(int i = 0; i < N; i++) {\n F.add(sc.nextLong());\n }\n\n A = A.stream().sorted().collect(Collectors.toCollection(ArrayList::new));\n F = F.stream().sorted(Collections.reverseOrder()).collect(Collectors.toCollection(ArrayList::new));\n\n System.out.println(parametric_search(0, Long.MAX_VALUE));\n //System.out.println(parametric_search(12, 12));\n\n }\n}\n//[B@25618e91\n//[B@326de728\n//", "language": "Java", "metadata": {"date": 1595891585, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02883.html", "problem_id": "p02883", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02883/input.txt", "sample_output_relpath": "derived/input_output/data/p02883/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02883/Java/s863695962.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s863695962", "user_id": "u285118720"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.lang.reflect.Array;\nimport java.net.Inet4Address;\nimport java.util.Arrays;\nimport java.util.OptionalInt;\nimport java.util.Scanner;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.stream.Collectors;\nimport java.util.HashSet;\nimport java.util.HashMap;\n\npublic class Main {\n\n static long gcd(long p, long q) { if(q == 0) return p; return gcd(q, p % q);}\n static Scanner sc = new Scanner(System.in);\n /////////\n\n static int N, K;\n static ArrayList A = new ArrayList<>();\n static ArrayList F = new ArrayList<>();\n\n static boolean check(long mid) {\n long needs = 0;\n\n for(int i = 0; i < N; i++) {\n if(A.get(i) * F.get(i) <= mid) continue;\n /*\n if A[i] * F[i] > mid\n (A[i] - x) * F[i] <= mid 가 되는 최소 x\n A[i] - x <= mid / F[i]\n A[i] - mid / F[i] <= x\n Ceil(A[i] - mid / F[i])\n\n */\n needs += (long)Math.ceil(A.get(i) - (double)mid / F.get(i));\n }\n\n if(needs <= K) return true;\n else return false;\n\n }\n\n static long parametric_search(long l, long r) {\n if(r < l) return Long.MAX_VALUE;\n long mid = l + (r - l) / 2;\n\n if(check(mid)) {\n return Math.min(mid, parametric_search(l, mid - 1));\n } else {\n return parametric_search(mid + 1, r);\n }\n }\n\n\n public static void main(String[] args) {\n N = sc.nextInt(); K = sc.nextInt();\n\n for(int i = 0; i < N; i++) {\n A.add(sc.nextLong());\n }\n\n for(int i = 0; i < N; i++) {\n F.add(sc.nextLong());\n }\n\n A = A.stream().sorted().collect(Collectors.toCollection(ArrayList::new));\n F = F.stream().sorted(Collections.reverseOrder()).collect(Collectors.toCollection(ArrayList::new));\n\n System.out.println(parametric_search(0, Long.MAX_VALUE));\n //System.out.println(parametric_search(12, 12));\n\n }\n}\n//[B@25618e91\n//[B@326de728\n//", "problem_context": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "sample_input": "3 5\n4 2 1\n2 3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02883", "source_text": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2025, "cpu_time_ms": 1391, "memory_kb": 74156}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s182520032", "group_id": "codeNet:p02885", "input_text": "import java.io.*;\n// import java.math.*;\n// import java.util.*;\n// import java.util.Map.*;\n// import java.util.stream.*;\n\npublic class Main {\n public static void main (String[] args) throws Exception {\n BufferedReader reader =\n new BufferedReader (new InputStreamReader (System.in));\n String[] arr = reader.readLine().split (\" \");\n int A, B;\n A = Integer.parseInt (arr[0]);\n B = Integer.parseInt (arr[1]);\n System.out.println (2 * B < A ? A - 2 * B : 0);\n return;\n }\n}", "language": "Java", "metadata": {"date": 1593288164, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02885.html", "problem_id": "p02885", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02885/input.txt", "sample_output_relpath": "derived/input_output/data/p02885/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02885/Java/s182520032.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s182520032", "user_id": "u796942881"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.*;\n// import java.math.*;\n// import java.util.*;\n// import java.util.Map.*;\n// import java.util.stream.*;\n\npublic class Main {\n public static void main (String[] args) throws Exception {\n BufferedReader reader =\n new BufferedReader (new InputStreamReader (System.in));\n String[] arr = reader.readLine().split (\" \");\n int A, B;\n A = Integer.parseInt (arr[0]);\n B = Integer.parseInt (arr[1]);\n System.out.println (2 * B < A ? A - 2 * B : 0);\n return;\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "sample_input": "12 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02885", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 534, "cpu_time_ms": 85, "memory_kb": 32624}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s018796808", "group_id": "codeNet:p02888", "input_text": "//繰り返し二乗法 repow(b,p)(b,p,modder)\n//ユークリッド互除法で最大公約数 gcd\n//gcdで最小公倍数 lcm\n//約数列挙divList(int)\n//約数列挙divSet(int)\n//素数判定iP(long)とtameshiwari(long)\n//BSA()()()(List,T,int,int,Comparator)\n//BSF()()()(List,T,int,int,Comparator)\n//BSL()()()(List,T,int,int,Comparator)\n//int kmp(String t,String p)\n//文字列文字ソートStSort(String)\n//二次元整数座標オブジェクトXy\n////マンハッタン距離manht(Xy)\n////toString\n////偏角ソート用hencom\n////偏角henkaku\n////equals\n//ユニオンファインドUnFd\n////boolean isRoot(i)\n////int rootOf(i)\n////boolean ud(i,j)\n////boolean marge(i,j)\n////int[] roots()\n//スキャナーScnr\n////next nextBuilder nextInt nextLong nextDouble()\n////nextAInt nextALong nextADouble(n)(a[],n)(a[],off,len)\n////nextLInt nextLLong nextLDouble(n)\n//static PrintWriter out = new PrintWriter(System.out);\nimport java.util.*;\nimport java.io.*;\n\nclass Main{\n static int repow(int b,int p){\n long a = b;\n long res=1;\n while(p>0){\n if(p%2==1){\n res*=a;\n }\n a*=a;\n p/=2;\n }\n return (int)res;\n }\n static int repow(int b,int p,int modder){\n long a = b%modder;\n long res=1;\n while(p>0){\n if(p%2==1){\n res=(res*a)%modder;\n }\n a=(a*a)%modder;\n p/=2;\n }\n return (int)res;\n }\n static long repow(long b,long p){\n long a = b;\n long res=1;\n while(p>0){\n if(p%2==1){\n res*=a;\n }\n a*=a;\n p/=2;\n }\n return res;\n }\n static long repow(long b,long p,long modder){\n long a = b%modder;\n long res=1;\n while(p>0){\n if(p%2==1){\n res=(res*a)%modder;\n }\n a=(a*a)%modder;\n p/=2;\n }\n return res;\n }\n static long gcd(long c,long d){\n while(true){\n long f=c%d;\n if(f==0){\n return d;\n }\n c=d;\n d=f;\n }\n }\n static long lcm(long c,long d){\n return c/gcd(c,d)*d;\n }\n static ArrayList divList(int n){\n ArrayList div=new ArrayList();\n for(int i=1;i*i<=n;i++){\n if(n%i==0){\n div.add(i);\n if(i*i!=n){\n div.add((int)(n/i));\n }\n }\n }\n return div;\n }\n static HashSet divSet(int n){\n HashSet div=new HashSet();\n for(int i=1;i*i<=n;i++){\n if(n%i==0){\n div.add(i);\n div.add((int)(n/i));\n }\n }\n return div;\n }\n static boolean iP(long n){\n if(n==2){\n return true;\n }\n if((n&1)==0||n==1){\n return false;\n }\n// if(n>3037007383L){\n if(n>Integer.MAX_VALUE){\n return tameshiwari(n);\n }\n long d=n-1;\n int s=0;\n while((d&1)==0){\n d/=2;\n s++;\n }\n int[] aa = {2,3,5,7,11,13,17};\n for(int i=0;i<7&&aa[i]> int BSA(List l,T target){\n return BSA(l,target,0,l.size(),(s1,s2)->s1.compareTo(s2));\n }\n static int BSA(List l,T target,Comparator c){\n return BSA(l,target,0,l.size(),c);\n }\n static > int BSA(List l,T target,int left,int right){\n return BSA(l,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static int BSA(List l,T target,int left,int right,Comparator c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=l.get(lt+(rt-lt)/2);\n if(c.compare(gaze,target)<0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>0){\n rt=lt+(rt-lt)/2-1;\n }else{\n return lt+(rt-lt)/2;\n }\n }\n return -1;\n }\n static > int BSF(List l,T target){\n return BSF(l,target,0,l.size(),(s1,s2)->s1.compareTo(s2));\n }\n static int BSF(List l,T target,Comparator c){\n return BSF(l,target,0,l.size(),c);\n }\n static > int BSF(List l,T target,int left,int right){\n return BSF(l,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static int BSF(List l,T target,int left,int right,Comparator c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=l.get(lt+(rt-lt)/2);\n if(c.compare(gaze,target)<0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>=0){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static > int BSL(List l,T target){\n return BSL(l,target,0,l.size(),(s1,s2)->s1.compareTo(s2));\n }\n static int BSL(List l,T target,Comparator c){\n return BSL(l,target,0,l.size(),c);\n }\n static > int BSL(List l,T target,int left,int right){\n return BSL(l,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static int BSL(List l,T target,int left,int right,Comparator c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=l.get(lt+(rt-lt)/2);\n if(c.compare(gaze,target)<=0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>0){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static int kmp(String t,String p){\n int[] f=new int[p.length()+1];\n int i=0;\n int j=1;\n f[1]=0;\n while(jsb.charAt(i)){\n r=gaze-1;\n }\n }\n sb.insert(l,sb.charAt(i));\n sb.deleteCharAt(i+1);\n }\n return sb.toString();\n }\n static class Xy{\n int x;\n int y;\n Xy(int x,int y){\n this.x=x;\n this.y=y;\n }\n public int manht(Xy o){\n return Math.abs(x-o.x)+Math.abs(y-o.y);\n }\n public String toString(){\n return \"[\"+x+\",\"+y+\"]\";\n }\n public double henkaku(){\n return Math.atan2(y,x);\n }\n public static int hencom(Xy s1,Xy s2){\n return (int)Math.signum(s1.henkaku()-s2.henkaku());\n }\n public boolean equals(Object o){\n return x==((Xy)o).x&&y==((Xy)o).y;\n }\n }\n static class UnFd{\n int n;\n int[] a;\n int forest;\n UnFd(int n){\n forest=this.n=n;\n a = new int[n];\n for(int i=0;i nextLInt(int n){\n List l = new ArrayList<>(n);\n for(int i=0;i nextLLong(int n){\n List l = new ArrayList<>(n);\n for(int i=0;i nextLDouble(int n){\n List l = new ArrayList<>(n);\n for(int i=0;i l = sc.nextLInt(n);\n Collections.sort(l);\n int cnt=0;\n for(int i=0;i,T,int,int,Comparator)\n//BSF()()()(List,T,int,int,Comparator)\n//BSL()()()(List,T,int,int,Comparator)\n//int kmp(String t,String p)\n//文字列文字ソートStSort(String)\n//二次元整数座標オブジェクトXy\n////マンハッタン距離manht(Xy)\n////toString\n////偏角ソート用hencom\n////偏角henkaku\n////equals\n//ユニオンファインドUnFd\n////boolean isRoot(i)\n////int rootOf(i)\n////boolean ud(i,j)\n////boolean marge(i,j)\n////int[] roots()\n//スキャナーScnr\n////next nextBuilder nextInt nextLong nextDouble()\n////nextAInt nextALong nextADouble(n)(a[],n)(a[],off,len)\n////nextLInt nextLLong nextLDouble(n)\n//static PrintWriter out = new PrintWriter(System.out);\nimport java.util.*;\nimport java.io.*;\n\nclass Main{\n static int repow(int b,int p){\n long a = b;\n long res=1;\n while(p>0){\n if(p%2==1){\n res*=a;\n }\n a*=a;\n p/=2;\n }\n return (int)res;\n }\n static int repow(int b,int p,int modder){\n long a = b%modder;\n long res=1;\n while(p>0){\n if(p%2==1){\n res=(res*a)%modder;\n }\n a=(a*a)%modder;\n p/=2;\n }\n return (int)res;\n }\n static long repow(long b,long p){\n long a = b;\n long res=1;\n while(p>0){\n if(p%2==1){\n res*=a;\n }\n a*=a;\n p/=2;\n }\n return res;\n }\n static long repow(long b,long p,long modder){\n long a = b%modder;\n long res=1;\n while(p>0){\n if(p%2==1){\n res=(res*a)%modder;\n }\n a=(a*a)%modder;\n p/=2;\n }\n return res;\n }\n static long gcd(long c,long d){\n while(true){\n long f=c%d;\n if(f==0){\n return d;\n }\n c=d;\n d=f;\n }\n }\n static long lcm(long c,long d){\n return c/gcd(c,d)*d;\n }\n static ArrayList divList(int n){\n ArrayList div=new ArrayList();\n for(int i=1;i*i<=n;i++){\n if(n%i==0){\n div.add(i);\n if(i*i!=n){\n div.add((int)(n/i));\n }\n }\n }\n return div;\n }\n static HashSet divSet(int n){\n HashSet div=new HashSet();\n for(int i=1;i*i<=n;i++){\n if(n%i==0){\n div.add(i);\n div.add((int)(n/i));\n }\n }\n return div;\n }\n static boolean iP(long n){\n if(n==2){\n return true;\n }\n if((n&1)==0||n==1){\n return false;\n }\n// if(n>3037007383L){\n if(n>Integer.MAX_VALUE){\n return tameshiwari(n);\n }\n long d=n-1;\n int s=0;\n while((d&1)==0){\n d/=2;\n s++;\n }\n int[] aa = {2,3,5,7,11,13,17};\n for(int i=0;i<7&&aa[i]> int BSA(List l,T target){\n return BSA(l,target,0,l.size(),(s1,s2)->s1.compareTo(s2));\n }\n static int BSA(List l,T target,Comparator c){\n return BSA(l,target,0,l.size(),c);\n }\n static > int BSA(List l,T target,int left,int right){\n return BSA(l,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static int BSA(List l,T target,int left,int right,Comparator c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=l.get(lt+(rt-lt)/2);\n if(c.compare(gaze,target)<0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>0){\n rt=lt+(rt-lt)/2-1;\n }else{\n return lt+(rt-lt)/2;\n }\n }\n return -1;\n }\n static > int BSF(List l,T target){\n return BSF(l,target,0,l.size(),(s1,s2)->s1.compareTo(s2));\n }\n static int BSF(List l,T target,Comparator c){\n return BSF(l,target,0,l.size(),c);\n }\n static > int BSF(List l,T target,int left,int right){\n return BSF(l,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static int BSF(List l,T target,int left,int right,Comparator c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=l.get(lt+(rt-lt)/2);\n if(c.compare(gaze,target)<0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>=0){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static > int BSL(List l,T target){\n return BSL(l,target,0,l.size(),(s1,s2)->s1.compareTo(s2));\n }\n static int BSL(List l,T target,Comparator c){\n return BSL(l,target,0,l.size(),c);\n }\n static > int BSL(List l,T target,int left,int right){\n return BSL(l,target,left,right,(s1,s2)->s1.compareTo(s2));\n }\n static int BSL(List l,T target,int left,int right,Comparator c){\n int lt = left;\n int rt = right-1;\n while(lt<=rt){\n T gaze=l.get(lt+(rt-lt)/2);\n if(c.compare(gaze,target)<=0){\n lt=lt+(rt-lt)/2+1;\n }else if(c.compare(gaze,target)>0){\n rt=lt+(rt-lt)/2-1;\n }\n }\n return lt;\n }\n static int kmp(String t,String p){\n int[] f=new int[p.length()+1];\n int i=0;\n int j=1;\n f[1]=0;\n while(jsb.charAt(i)){\n r=gaze-1;\n }\n }\n sb.insert(l,sb.charAt(i));\n sb.deleteCharAt(i+1);\n }\n return sb.toString();\n }\n static class Xy{\n int x;\n int y;\n Xy(int x,int y){\n this.x=x;\n this.y=y;\n }\n public int manht(Xy o){\n return Math.abs(x-o.x)+Math.abs(y-o.y);\n }\n public String toString(){\n return \"[\"+x+\",\"+y+\"]\";\n }\n public double henkaku(){\n return Math.atan2(y,x);\n }\n public static int hencom(Xy s1,Xy s2){\n return (int)Math.signum(s1.henkaku()-s2.henkaku());\n }\n public boolean equals(Object o){\n return x==((Xy)o).x&&y==((Xy)o).y;\n }\n }\n static class UnFd{\n int n;\n int[] a;\n int forest;\n UnFd(int n){\n forest=this.n=n;\n a = new int[n];\n for(int i=0;i nextLInt(int n){\n List l = new ArrayList<>(n);\n for(int i=0;i nextLLong(int n){\n List l = new ArrayList<>(n);\n for(int i=0;i nextLDouble(int n){\n List l = new ArrayList<>(n);\n for(int i=0;i l = sc.nextLInt(n);\n Collections.sort(l);\n int cnt=0;\n for(int i=0;i a[i][k] + a[k][j]) {\n\t\t\t\t\t\ta[i][j] = Math.min(a[i][j], a[i][k] + a[k][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint answer = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (a[i][j] < 1000000) {\n\t\t\t\t\tanswer = Math.max(answer, a[i][j]);\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer + 1);\n\t}\n\n\n\tprivate static boolean isBipartite(int v, int c) {\n\t\tcolor[v] = c;\n\t\tfor (int i = 0; i < a[v].length; i++) {\n\t\t\tif (a[v][i] != 1000000) {\n\t\t\t\tif (color[i] == c) return false;\n\t\t\t\tif (color[i] == 0 && !isBipartite(i, -c)) return false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n}\n", "language": "Java", "metadata": {"date": 1570671691, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02892.html", "problem_id": "p02892", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02892/input.txt", "sample_output_relpath": "derived/input_output/data/p02892/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02892/Java/s884153056.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s884153056", "user_id": "u018646913"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n\tprivate static int[][] a;\n\tprivate static int[] color;\n\tprivate static int dist[];\n\tprivate static boolean visited[];\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\ta = new int[n][n];\n\t\tsc.nextLine();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tchar[] s = sc.nextLine().toCharArray();\n\t\t\tfor (int j = 0; j < s.length; j++) {\n\t\t\t\tif (s[j] == '1') {\n\t\t\t\t\ta[i][j] = 1;\n\t\t\t\t} else {\n\t\t\t\t\ta[i][j] = 1000000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcolor = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (color[i] == 0) {\n\t\t\t\tif (!isBipartite(i, 1)) {\n\t\t\t\t\tSystem.out.println(-1);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tif (a[i][j] > a[i][k] + a[k][j]) {\n\t\t\t\t\t\ta[i][j] = Math.min(a[i][j], a[i][k] + a[k][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint answer = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (a[i][j] < 1000000) {\n\t\t\t\t\tanswer = Math.max(answer, a[i][j]);\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answer + 1);\n\t}\n\n\n\tprivate static boolean isBipartite(int v, int c) {\n\t\tcolor[v] = c;\n\t\tfor (int i = 0; i < a[v].length; i++) {\n\t\t\tif (a[v][i] != 1000000) {\n\t\t\t\tif (color[i] == c) return false;\n\t\t\t\tif (color[i] == 0 && !isBipartite(i, -c)) return false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S.\nIf S_{i,j} is 1, there is an edge connecting Vertex i and j; otherwise, there is no such edge.\n\nDetermine whether it is possible to divide the vertices into non-empty sets V_1, \\dots, V_k such that the following condition is satisfied. If the answer is yes, find the maximum possible number of sets, k, in such a division.\n\nEvery edge connects two vertices belonging to two \"adjacent\" sets. More formally, for every edge (i,j), there exists 1\\leq t\\leq k-1 such that i\\in V_t,j\\in V_{t+1} or i\\in V_{t+1},j\\in V_t holds.\n\nConstraints\n\n2 \\leq N \\leq 200\n\nS_{i,j} is 0 or 1.\n\nS_{i,i} is 0.\n\nS_{i,j}=S_{j,i}\n\nThe given graph is connected.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}...S_{1,N}\n:\nS_{N,1}...S_{N,N}\n\nOutput\n\nIf it is impossible to divide the vertices into sets so that the condition is satisfied, print -1.\nOtherwise, print the maximum possible number of sets, k, in a division that satisfies the condition.\n\nSample Input 1\n\n2\n01\n10\n\nSample Output 1\n\n2\n\nWe can put Vertex 1 in V_1 and Vertex 2 in V_2.\n\nSample Input 2\n\n3\n011\n101\n110\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n6\n010110\n101001\n010100\n101000\n100000\n010000\n\nSample Output 3\n\n4", "sample_input": "2\n01\n10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02892", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S.\nIf S_{i,j} is 1, there is an edge connecting Vertex i and j; otherwise, there is no such edge.\n\nDetermine whether it is possible to divide the vertices into non-empty sets V_1, \\dots, V_k such that the following condition is satisfied. If the answer is yes, find the maximum possible number of sets, k, in such a division.\n\nEvery edge connects two vertices belonging to two \"adjacent\" sets. More formally, for every edge (i,j), there exists 1\\leq t\\leq k-1 such that i\\in V_t,j\\in V_{t+1} or i\\in V_{t+1},j\\in V_t holds.\n\nConstraints\n\n2 \\leq N \\leq 200\n\nS_{i,j} is 0 or 1.\n\nS_{i,i} is 0.\n\nS_{i,j}=S_{j,i}\n\nThe given graph is connected.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}...S_{1,N}\n:\nS_{N,1}...S_{N,N}\n\nOutput\n\nIf it is impossible to divide the vertices into sets so that the condition is satisfied, print -1.\nOtherwise, print the maximum possible number of sets, k, in a division that satisfies the condition.\n\nSample Input 1\n\n2\n01\n10\n\nSample Output 1\n\n2\n\nWe can put Vertex 1 in V_1 and Vertex 2 in V_2.\n\nSample Input 2\n\n3\n011\n101\n110\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n6\n010110\n101001\n010100\n101000\n100000\n010000\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1370, "cpu_time_ms": 155, "memory_kb": 24532}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s336338765", "group_id": "codeNet:p02897", "input_text": "\n\nimport java.awt.Point;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintStream;\nimport java.io.PrintWriter;\nimport java.io.Serializable;\nimport java.util.AbstractList;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.util.Comparator;\nimport java.util.Iterator;\nimport java.util.Locale;\nimport java.util.NoSuchElementException;\nimport java.util.RandomAccess;\nimport java.util.function.BinaryOperator;\nimport java.util.function.UnaryOperator;\n\npublic class Main implements Runnable{\n\n\tprivate void solve(FastIO io) {\n\t\t/*\n\t\t * author: 31536000\n\t\t * ABC142 A問題\n\t\t * 考察メモ\n\t\t *\n\t\t */\n\t\tint N = io.nextInt();\n\t\tio.println((N + 1) / 2 / (double)N);\n\t}\n\n\t/** デバッグ用コードのお供に */\n\tprivate static boolean DEBUG = false;\n\t/** 確保するメモリの大きさ(単位: MB)*/\n\tprivate static final long MEMORY = 64;\n\tprivate final FastIO io;\n\n\tpublic static void main(String[] args) {\n\t Thread.setDefaultUncaughtExceptionHandler((t, e) -> e.printStackTrace());\n\t new Thread(null, new Main(), \"\", MEMORY * 1048576).start();\n\t}\n\n\tpublic Main() {\n\t\tio = new FastIO();\n\t\tassert (DEBUG = true) | true; // yukicoderだと-eaが付いてるので正しく動かないことに注意\n\t\tif (DEBUG) {\n\t\t\tio.setAutoFlush(true);\n\t\t\tio.println(\"debug mode\");\n\t\t}\n\t}\n\n\t@Override\n\tpublic void run() {\n\t\tsolve(io);\n\t\tio.flush();\n\t}\n\n\t// 以下、ライブラリ\n\n\tpublic static class FastIO {\n\t\tprivate final InputStream in;\n\t\tprivate final byte[] buffer = new byte[1024];\n\t\tprivate int read = 0;\n\t\tprivate int length = 0;\n\t\tpublic final PrintWriter out;\n\t\tpublic final PrintWriter err;\n\t\tprivate boolean autoFlush = false;\n\n\t\tpublic FastIO() {\n\t\t\tthis(System.in, System.out, System.err);\n\t\t}\n\n\t\tpublic FastIO(InputStream in, PrintStream out, PrintStream err) {\n\t\t\tthis.in = in;\n\t\t\tthis.out = new PrintWriter(out, false);\n\t\t\tthis.err = new PrintWriter(err, false);\n\t\t}\n\n\t\tpublic void setAutoFlush(boolean flush) {\n\t\t\tautoFlush = flush;\n\t\t}\n\n\t\tprivate boolean hasNextByte() {\n\t\t\tif (read < length) return true;\n\t\t\tread = 0;\n\t\t\ttry {\n\t\t\t\tlength = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn length > 0;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\treturn hasNextByte() ? buffer[read++] : -1;\n\t\t}\n\n\t\tprivate static boolean isPrintableChar(int c) {\n\t\t\treturn 33 <= c && c <= 126;\n\t\t}\n\n\t\tprivate static boolean isNumber(int c) {\n\t\t\treturn '0' <= c && c <= '9';\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\twhile (hasNextByte() && !isPrintableChar(buffer[read])) read++;\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic char nextChar() {\n\t\t\tif (!hasNextByte()) throw new NoSuchElementException();\n\t\t\treturn (char)readByte();\n\t\t}\n\n\t\tpublic char[][] nextChar(int height) {\n\t\t\tchar[][] ret = new char[height][];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = next().toCharArray();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b;\n\t\t\twhile (isPrintableChar(b = readByte())) sb.appendCodePoint(b);\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b;\n\t\t\twhile(!isPrintableChar(b = readByte()));\n\t\t\tdo sb.appendCodePoint(b); while(isPrintableChar(b = readByte()) || b == ' ');\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tlong n = 0;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\tif (!isNumber(b)) throw new NumberFormatException();\n\t\t\twhile (true) {\n\t\t\t\tif (isNumber(b)) {\n\t\t\t\t\tn *= 10;\n\t\t\t\t\tn += b - '0';\n\t\t\t\t} else if (b == -1 || !isPrintableChar(b)) return minus ? -n : n;\n\t\t\t\telse throw new NumberFormatException();\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tlong nl = nextLong();\n\t\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\t\treturn (int) nl;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextInt(int width) {\n\t\t\tint[] ret = new int[width];\n\t\t\tfor (int i = 0;i < width;++ i) ret[i] = nextInt();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic int[] nextInts() {\n\t\t\treturn nextInts(\" \");\n\t\t}\n\n\t\tpublic int[] nextInts(String parse) {\n\t\t\tString[] get = nextLine().split(parse);\n\t\t\tint[] ret = new int[get.length];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = Integer.valueOf(get[i]);\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long[] nextLong(int width) {\n\t\t\tlong[] ret = new long[width];\n\t\t\tfor (int i = 0;i < width;++ i) ret[i] = nextLong();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long[] nextLongs() {\n\t\t\treturn nextLongs(\" \");\n\t\t}\n\n\t\tpublic long[] nextLongs(String parse) {\n\t\t\tString[] get = nextLine().split(parse);\n\t\t\tlong[] ret = new long[get.length];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = Long.valueOf(get[i]);\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic int[][] nextInt(int width, int height) {\n\t\t\tint[][] ret = new int[height][width];\n\t\t\tfor (int i = 0, j;i < height;++ i) for (j = 0;j < width;++ j) ret[i][j] = nextInt();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long[][] nextLong(int width, int height) {\n\t\t\tlong[][] ret = new long[height][width];\n\t\t\tfor (int i = 0, j;i < height;++ i) for (j = 0;j < width;++ j) ret[j][i] = nextLong();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic boolean[] nextBoolean(char T) {\n\t\t\tchar[] s = next().toCharArray();\n\t\t\tboolean[] ret = new boolean[s.length];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = s[i] == T;\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic boolean[][] nextBoolean(char T, int height) {\n\t\t\tboolean[][] ret = new boolean[height][];\n\t\t\tfor (int i = 0;i < ret.length;++ i) {\n\t\t\t\tchar[] s = next().toCharArray();\n\t\t\t\tret[i] = new boolean[s.length];\n\t\t\t\tfor (int j = 0;j < ret[i].length;++ j) ret[i][j] = s[j] == T;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic Point nextPoint() {\n\t\t\treturn new Point(nextInt(), nextInt());\n\t\t}\n\n\t\tpublic Point[] nextPoint(int width) {\n\t\t\tPoint[] ret = new Point[width];\n\t\t\tfor (int i = 0;i < width;++ i) ret[i] = nextPoint();\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tprotected void finalize() throws Throwable {\n\t\t\ttry {\n\t\t\t\tsuper.finalize();\n\t\t\t} finally {\n\t\t\t\tin.close();\n\t\t\t\tout.close();\n\t\t\t\terr.close();\n\t\t\t}\n\t\t}\n\n\t\tpublic boolean print(boolean b) {\n\t\t\tout.print(b);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn b;\n\t\t}\n\n\t\tpublic Object print(boolean b, Object t, Object f) {\n\t\t\treturn b ? print(t) : print(f);\n\t\t}\n\n\t\tpublic char print(char c) {\n\t\t\tout.print(c);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn c;\n\t\t}\n\n\t\tpublic char[] print(char[] s) {\n\t\t\tout.print(s);\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic double print(double d) {\n\t\t\tout.print(d);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic double print(double d, int length) {\n\t\t\tif (d < 0) {\n\t\t\t\tout.print('-');\n\t\t\t\td = -d;\n\t\t\t}\n\t\t\td += Math.pow(10, -length) / 2;\n\t\t\tout.print((long)d);\n\t\t\tout.print('.');\n\t\t\td -= (long)d;\n\t\t\tfor (int i = 0;i < length;++ i) {\n\t\t\t\td *= 10;\n\t\t\t\tout.print((int)d);\n\t\t\t\td -= (int)d;\n\t\t\t}\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic float print(float f) {\n\t\t\tout.print(f);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn f;\n\t\t}\n\n\t\tpublic int print(int i) {\n\t\t\tout.print(i);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn i;\n\t\t}\n\n\t\tpublic long print(long l) {\n\t\t\tout.print(l);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn l;\n\t\t}\n\n\t\tpublic Object print(Object obj) {\n\t\t\tif (obj.getClass().isArray()) {\n\t\t\t\tif (obj instanceof boolean[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof byte[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof short[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof int[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof long[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof float[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof double[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof char[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof Object[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse print(obj, \" \");\n\t\t\t} else {\n\t\t\t\tout.print(obj);\n\t\t\t\tif (autoFlush) flush();\n\t\t\t}\n\t\t\treturn obj;\n\t\t}\n\n\t\tpublic String print(String s) {\n\t\t\tout.print(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic Object print(Object array, String... parse) {\n\t\t\tprint(array, 0, parse);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn array;\n\t\t}\n\n\t\tprivate Object print(Object array, int check, String... parse) {\n\t\t\tif (check >= parse.length) {\n\t\t\t\tif (array.getClass().isArray()) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\t\tprint(array);\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tString str = parse[check];\n\t\t\tif (array instanceof Object[]) {\n\t\t\t\tObject[] obj = (Object[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0], check + 1, parse);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i], check + 1, parse);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tif (array instanceof Collection) {\n\t\t\t\tIterator iter = ((Collection)array).iterator();\n\t\t\t\tif (!iter.hasNext()) return array;\n\t\t\t\tprint(iter.next(), check + 1, parse);\n\t\t\t\twhile(iter.hasNext()) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(iter.next(), check + 1, parse);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tif (!array.getClass().isArray()) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\tif (check != parse.length - 1) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\tif (array instanceof boolean[]) {\n\t\t\t\tboolean[] obj = (boolean[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof byte[]) {\n\t\t\t\tbyte[] obj = (byte[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t} else if (array instanceof short[]) {\n\t\t\t\tshort[] obj = (short[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof int[]) {\n\t\t\t\tint[] obj = (int[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof long[]) {\n\t\t\t\tlong[] obj = (long[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof float[]) {\n\t\t\t\tfloat[] obj = (float[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof double[]) {\n\t\t\t\tdouble[] obj = (double[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof char[]) {\n\t\t\t\tchar[] obj = (char[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else throw new AssertionError();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic Object[] print(String parse, Object... args) {\n\t\t\tprint(args[0]);\n\t\t\tfor (int i = 1;i < args.length;++ i) {\n\t\t\t\tprint(parse);\n\t\t\t\tprint(args[i]);\n\t\t\t}\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic Object[] printf(String format, Object... args) {\n\t\t\tout.printf(format, args);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic Object printf(Locale l, String format, Object... args) {\n\t\t\tout.printf(l, format, args);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic void println() {\n\t\t\tout.println();\n\t\t\tif (autoFlush) flush();\n\t\t}\n\n\t\tpublic boolean println(boolean b) {\n\t\t\tout.println(b);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn b;\n\t\t}\n\n\t\tpublic Object println(boolean b, Object t, Object f) {\n\t\t\treturn b ? println(t) : println(f);\n\t\t}\n\n\t\tpublic char println(char c) {\n\t\t\tout.println(c);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn c;\n\t\t}\n\n\t\tpublic char[] println(char[] s) {\n\t\t\tout.println(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic double println(double d) {\n\t\t\tout.println(d);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic double println(double d, int length) {\n\t\t\tprint(d, length);\n\t\t\tprintln();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic float println(float f) {\n\t\t\tout.println(f);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn f;\n\t\t}\n\n\t\tpublic int println(int i) {\n\t\t\tout.println(i);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn i;\n\t\t}\n\n\t\tpublic long println(long l) {\n\t\t\tout.println(l);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn l;\n\t\t}\n\n\t\tpublic Object println(Object obj) {\n\t\t\tprint(obj);\n\t\t\tprintln();\n\t\t\treturn obj;\n\t\t}\n\n\t\tpublic String println(String s) {\n\t\t\tout.println(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic Object println(Object array, String... parse) {\n\t\t\tprint(array, parse);\n\t\t\tprintln();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic void flush() {\n\t\t\tout.flush();\n\t\t\terr.flush();\n\t\t}\n\t}\n\n\tpublic enum BoundType {\n\t\tCLOSED, OPEN;\n\t}\n\n\tpublic static class Range implements Serializable{\n\n\t\tprivate static final long serialVersionUID = -4702828934863023392L;\n\t\tprotected C lower;\n\t\tprotected C upper;\n\t\tprotected BoundType lowerType;\n\t\tprotected BoundType upperType;\n\t\tprivate Comparator comparator;\n\n\t\tprotected Range(C lower, BoundType lowerType, C upper, BoundType upperType) {\n\t\t\tthis(lower, lowerType, upper, upperType, null);\n\t\t}\n\n\t\tprotected Range(C lower, BoundType lowerType, C upper, BoundType upperType, Comparator comparator) {\n\t\t\tthis.lower = lower;\n\t\t\tthis.upper = upper;\n\t\t\tthis.lowerType = lowerType;\n\t\t\tthis.upperType = upperType;\n\t\t\tthis.comparator = comparator;\n\t\t}\n\n\t\tpublic static > Range range(C lower, BoundType lowerType, C upper, BoundType upperType) {\n\t\t\tif (lower != null && upper != null) {\n\t\t\t\tint comp = lower.compareTo(upper);\n\t\t\t\tif (comp > 0) return new Range(null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t\t\telse if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))return new Range(null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t\t}\n\t\t\treturn new Range(lower, lowerType, upper, upperType);\n\t\t}\n\n\t\tpublic static Range range(C lower, BoundType lowerType, C upper, BoundType upperType, Comparator comparator) {\n\t\t\tif (lower != null && upper != null) {\n\t\t\t\tint comp = comparator.compare(lower, upper);\n\t\t\t\tif (comp > 0) return new Range(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);\n\t\t\t\telse if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN)) return new Range(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);\n\t\t\t}\n\t\t\treturn new Range(lower, lowerType, upper, upperType, comparator);\n\t\t}\n\n\t\tpublic static > Range all() {\n\t\t\treturn range((C)null, BoundType.OPEN, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range all(Comparator comparator) {\n\t\t\treturn range((C)null, BoundType.OPEN, null, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range atMost(C upper) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range atMost(C upper, Comparator comparator) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static > Range lessThan(C upper) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range lessThan(C upper, Comparator comparator) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range downTo(C upper, BoundType boundType) {\n\t\t\treturn range(null, BoundType.OPEN, upper, boundType);\n\t\t}\n\n\t\tpublic static Range downTo(C upper, BoundType boundType, Comparator comparator) {\n\t\t\treturn range(null, BoundType.OPEN, upper, boundType, comparator);\n\t\t}\n\n\t\tpublic static > Range atLeast(C lower) {\n\t\t\treturn range(lower, BoundType.CLOSED, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range atLeast(C lower, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.CLOSED, null, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range greaterThan(C lower) {\n\t\t\treturn range(lower, BoundType.OPEN, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range greaterThan(C lower, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.OPEN, null, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range upTo(C lower, BoundType boundType) {\n\t\t\treturn range(lower, boundType, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range upTo(C lower, BoundType boundType, Comparator comparator) {\n\t\t\treturn range(lower, boundType, null, BoundType.OPEN, comparator );\n\t\t}\n\n\t\tpublic static > Range open(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range open(C lower, C upper, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range openClosed(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range openClosed(C lower, C upper, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static > Range closedOpen(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range closedOpen(C lower, C upper, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range closed(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range closed(C lower, C upper, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static > Range singleton(C value) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range singleton(C value, Comparator comparator) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static > Range empty() {\n\t\t\treturn range((C)null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range empty(Comparator comparator) {\n\t\t\treturn range((C)null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static > Range encloseAll(Iterable values) {\n\t\t\tC lower = values.iterator().next();\n\t\t\tC upper = lower;\n\t\t\tfor (C i : values) {\n\t\t\t\tif (lower.compareTo(i) > 0) lower = i;\n\t\t\t\tif (upper.compareTo(i) < 0) upper = i;\n\t\t\t}\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range encloseAll(Iterable values, Comparator comparator) {\n\t\t\tC lower = values.iterator().next();\n\t\t\tC upper = lower;\n\t\t\tfor (C i : values) {\n\t\t\t\tif (comparator.compare(lower, i) > 0) lower = i;\n\t\t\t\tif (comparator.compare(upper, i) < 0) upper = i;\n\t\t\t}\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tprotected int compareLower(C value) {\n\t\t\treturn compareLower(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareLower(C value, BoundType boundType) {\n\t\t\treturn compareLower(lower, lowerType, value, boundType);\n\t\t}\n\n\t\tprotected int compareLower(C lower, BoundType lowerType, C value) {\n\t\t\treturn compareLower(lower, lowerType, value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareLower(C lower, BoundType lowerType, C value, BoundType boundType) {\n\t\t\tif (lower == null) return value == null ? 0 : -1;\n\t\t\telse if (value == null) return 1;\n\t\t\tint compare;\n\t\t\tif (comparator == null) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tComparable comp = (Comparable)lower;\n\t\t\t\tcompare = comp.compareTo(value);\n\t\t\t} else compare = comparator.compare(lower, value);\n\t\t\tif (compare == 0) {\n\t\t\t\tif (lowerType == BoundType.CLOSED) -- compare;\n\t\t\t\tif (boundType == BoundType.CLOSED) ++ compare;\n\t\t\t}\n\t\t\treturn compare;\n\t\t}\n\n\t\tprotected int compareUpper(C value) {\n\t\t\treturn compareUpper(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareUpper(C value, BoundType boundType) {\n\t\t\treturn compareUpper(upper, upperType, value, boundType);\n\t\t}\n\n\t\tprotected int compareUpper(C upper, BoundType upperType, C value) {\n\t\t\treturn compareUpper(upper, upperType, value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareUpper(C upper, BoundType upperType, C value, BoundType boundType) {\n\t\t\tif (upper == null) return value == null ? 0 : 1;\n\t\t\tif (value == null) return -1;\n\t\t\tint compare;\n\t\t\tif (comparator == null) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tComparable comp = (Comparable)upper;\n\t\t\t\tcompare = comp.compareTo(value);\n\t\t\t} else compare = comparator.compare(upper, value);\n\t\t\tif (compare == 0) {\n\t\t\t\tif (upperType == BoundType.CLOSED) ++ compare;\n\t\t\t\tif (boundType == BoundType.CLOSED) -- compare;\n\t\t\t}\n\t\t\treturn compare;\n\t\t}\n\n\t\tpublic boolean hasLowerBound() {\n\t\t\treturn lower != null;\n\t\t}\n\n\t\tpublic C lowerEndpoint() {\n\t\t\tif (hasLowerBound()) return lower;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\tpublic BoundType lowerBoundType() {\n\t\t\tif (hasLowerBound()) return lowerType;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\tpublic boolean hasUpperBound() {\n\t\t\treturn upper != null;\n\t\t}\n\n\t\tpublic C upperEndpoint() {\n\t\t\tif (hasUpperBound()) return upper;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\tpublic BoundType upperBoundType() {\n\t\t\tif (hasUpperBound()) return upperType;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\t/**\n\t\t * この区間が空集合か判定します。\n\t\t * @return 空集合ならばtrue\n\t\t */\n\t\tpublic boolean isEmpty() {\n\t\t\treturn lower == null && upper == null && lowerType == BoundType.CLOSED;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数が区間の左側に位置するか判定します。
\n\t\t * 接する場合は区間の左側ではないと判定します。\n\t\t * @param value 調べる引数\n\t\t * @return 区間の左側に位置するならtrue\n\t\t */\n\t\tpublic boolean isLess(C value) {\n\t\t\treturn isLess(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected boolean isLess(C value, BoundType boundType) {\n\t\t\treturn compareLower(value, boundType) > 0;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数が区間の右側に位置するか判定します。
\n\t\t * 接する場合は区間の右側ではないと判定します。\n\t\t * @param value 調べる引数\n\t\t * @return 区間の右側に位置するならtrue\n\t\t */\n\t\tpublic boolean isGreater(C value) {\n\t\t\treturn isGreater(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprivate boolean isGreater(C value, BoundType boundType) {\n\t\t\treturn compareUpper(value, boundType) < 0;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数が区間内に位置するか判定します。
\n\t\t * 接する場合も区間内に位置すると判定します。\n\t\t * @param value 調べる引数\n\t\t * @return 区間内に位置するならtrue\n\t\t */\n\t\tpublic boolean contains(C value) {\n\t\t\treturn !isLess(value) && !isGreater(value) && !isEmpty();\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数すべてが区間内に位置するか判定します。
\n\t\t * 接する場合も区間内に位置すると判定します。\n\t\t * @param value 調べる要素\n\t\t * @return 全ての要素が区間内に位置するならtrue\n\t\t */\n\t\tpublic boolean containsAll(Iterable values) {\n\t\t\tfor (C i : values) if (!contains(i)) return false;\n\t\t\treturn true;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた区間がこの区間に内包されるか判定します。
\n\t\t *\n\t\t * @param other\n\t\t * @return 与えられた区間がこの区間に内包されるならtrue\n\t\t */\n\t\tpublic boolean encloses(Range other) {\n\t\t\treturn !isLess(other.lower, other.lowerType) && !isGreater(other.upper, other.upperType);\n\t\t}\n\n\t\t/**\n\t\t * 与えられた区間がこの区間と公差するか判定します。
\n\t\t * 接する場合は公差するものとします。\n\t\t * @param value 調べる引数\n\t\t * @return 区間が交差するならtrue\n\t\t */\n\t\tpublic boolean isConnected(Range other) {\n\t\t\tif (this.isEmpty() || other.isEmpty()) return false;\n\t\t\tC lower, upper;\n\t\t\tBoundType lowerType, upperType;\n\t\t\tif (isLess(other.lower, other.lowerType)) {\n\t\t\t\tlower = other.lower;\n\t\t\t\tlowerType = other.lowerType;\n\t\t\t} else {\n\t\t\t\tlower = this.lower;\n\t\t\t\tlowerType = this.lowerType;\n\t\t\t}\n\t\t\tif (isGreater(other.upper, other.upperType)) {\n\t\t\t\tupper = other.upper;\n\t\t\t\tupperType = other.upperType;\n\t\t\t} else {\n\t\t\t\tupper = this.upper;\n\t\t\t\tupperType = this.upperType;\n\t\t\t}\n\t\t\tif (lower == null || upper == null) return true;\n\t\t\tint comp = compareLower(lower, lowerType, upper, upperType);\n\t\t\treturn comp <= 0;\n\t\t}\n\t\t/**\n\t\t * この区間との積集合を返します。\n\t\t * @param connectedRange 積集合を求める区間\n\t\t * @return 積集合\n\t\t */\n\t\tpublic Range intersection(Range connectedRange) {\n\t\t\tif (this.isEmpty() || connectedRange.isEmpty()) {\n\t\t\t\tif (comparator == null) return new Range(null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t\t\treturn empty(comparator);\n\t\t\t}\n\t\t\tC lower, upper;\n\t\t\tBoundType lowerType, upperType;\n\t\t\tif (isLess(connectedRange.lower, connectedRange.lowerType)) {\n\t\t\t\tlower = connectedRange.lower;\n\t\t\t\tlowerType = connectedRange.lowerType;\n\t\t\t} else {\n\t\t\t\tlower = this.lower;\n\t\t\t\tlowerType = this.lowerType;\n\t\t\t}\n\t\t\tif (isGreater(connectedRange.upper, connectedRange.upperType)) {\n\t\t\t\tupper = connectedRange.upper;\n\t\t\t\tupperType = connectedRange.upperType;\n\t\t\t} else {\n\t\t\t\tupper = this.upper;\n\t\t\t\tupperType = this.upperType;\n\t\t\t}\n\t\t\tif (comparator == null) {\n\t\t\t\treturn new Range(lower, lowerType, upper, upperType);\n\t\t\t}\n\t\t\treturn range(lower, lowerType, upper, upperType, comparator);\n\t\t}\n\n\t\t/**\n\t\t * この区間との和集合を返します。\n\t\t * @param other 和集合を求める区間\n\t\t * @return 和集合\n\t\t */\n\t\tpublic Range span(Range other) {\n\t\t\tif (other.isEmpty()) return new Range(lower, lowerType, upper, upperType);\n\t\t\tC lower, upper;\n\t\t\tBoundType lowerType, upperType;\n\t\t\tif (isLess(other.lower, other.lowerType)) {\n\t\t\t\tlower = this.lower;\n\t\t\t\tlowerType = this.lowerType;\n\t\t\t} else {\n\t\t\t\tlower = other.lower;\n\t\t\t\tlowerType = other.lowerType;\n\t\t\t}\n\t\t\tif (isGreater(other.upper, other.upperType)) {\n\t\t\t\tupper = this.upper;\n\t\t\t\tupperType = this.upperType;\n\t\t\t} else {\n\t\t\t\tupper = other.upper;\n\t\t\t\tupperType = other.upperType;\n\t\t\t}\n\t\t\treturn new Range(lower, lowerType, upper, upperType, comparator);\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object object) {\n\t\t\tif (this == object) return true;\n\t\t\tif (object instanceof Range) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tRange comp = (Range) object;\n\t\t\t\treturn compareLower(comp.lower, comp.lowerType) == 0 && compareUpper(comp.upper, comp.upperType) == 0 && lowerType == comp.lowerType && upperType == comp.upperType;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tif (lower == null && upper == null) return 0;\n\t\t\telse if (lower == null) return upper.hashCode();\n\t\t\telse if (upper == null) return lower.hashCode();\n\t\t\treturn lower.hashCode() ^ upper.hashCode();\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\tif (isEmpty()) return \"()\";\n\t\t\treturn (lowerType == BoundType.OPEN ? \"(\" : \"[\") + (lower == null ? \"\" : lower.toString()) + \"..\" + (upper == null ? \"\" : upper.toString()) + (upperType == BoundType.OPEN ? \")\" : \"]\");\n\t\t}\n\t}\n\n\tpublic static class IterableRange extends Range implements Iterable{\n\n\t\tprivate static final long serialVersionUID = 9065915259748260688L;\n\t\tprotected UnaryOperator func;\n\n\t\tprotected IterableRange(C lower, BoundType lowerType, C upper, BoundType upperType, UnaryOperator func) {\n\t\t\tsuper(lower, lowerType, upper, upperType);\n\t\t\tthis.func = func;\n\t\t}\n\n\t\tpublic static > IterableRange range(C lower, BoundType lowerType, C upper, BoundType upperType, UnaryOperator func) {\n\t\t\tif (lower == null || upper == null) return new IterableRange(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\tint comp = lower.compareTo(upper);\n\t\t\tif (comp > 0) return new IterableRange(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\telse if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN)) return new IterableRange(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\treturn new IterableRange(lower, lowerType, upper, upperType, func);\n\t\t}\n\n\t\tpublic static > IterableRange open(C lower, C upper, UnaryOperator func) {\n\t\t\tif (lower == null) return new IterableRange(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\treturn range(func.apply(lower), BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static > IterableRange openClosed(C lower, C upper, UnaryOperator func) {\n\t\t\tif (lower == null) return new IterableRange(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\treturn range(func.apply(lower), BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static > IterableRange closedOpen(C lower, C upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static > IterableRange closed(C lower, C upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static > IterableRange singleton(C value, UnaryOperator func) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);\n\t\t}\n\n\t\tprotected class Iter implements Iterator {\n\t\t\tC now;\n\t\t\tIter() {\n\t\t\t\tnow = lower;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic final boolean hasNext() {\n\t\t\t\treturn !isGreater(now);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final C next() {\n\t\t\t\tC ret = now;\n\t\t\t\tnow = func.apply(now);\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\tprotected class EmptyIter implements Iterator {\n\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic C next() {\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator iterator() {\n\t\t\treturn lower == null || upper == null ? new EmptyIter() : new Iter();\n\t\t}\n\n\t\tpublic int getDistance() {\n\t\t\tC check = upper;\n\t\t\tint ret = 0;\n\t\t\twhile (lower != check) {\n\t\t\t\tcheck = func.apply(check);\n\t\t\t\t++ ret;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\tpublic static class IntRange extends IterableRange{\n\n\t\tprivate static final long serialVersionUID = 5623995336491967216L;\n\t\tprivate final boolean useFastIter;\n\n\t\tprivate static class Next implements UnaryOperator {\n\n\t\t\t@Override\n\t\t\tpublic Integer apply(Integer value) {\n\t\t\t\treturn value + 1;\n\t\t\t}\n\t\t}\n\n\t\tprotected IntRange() {\n\t\t\tsuper(null, BoundType.CLOSED, null, BoundType.CLOSED, new Next());\n\t\t\tuseFastIter = true;\n\t\t}\n\n\t\tprotected IntRange(UnaryOperator func) {\n\t\t\tsuper(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\tuseFastIter = false;\n\t\t}\n\n\t\tprotected IntRange(int lower, BoundType lowerType, int upper, BoundType upperType) {\n\t\t\tsuper(lower, lowerType, upper, upperType, new Next());\n\t\t\tuseFastIter = true;\n\t\t}\n\n\t\tprotected IntRange(int lower, BoundType lowerType, int upper, BoundType upperType, UnaryOperator func) {\n\t\t\tsuper(lower, lowerType, upper, upperType, func);\n\t\t\tuseFastIter = false;\n\t\t}\n\n\t\tpublic static IntRange range(int lower, BoundType lowerType, int upper, BoundType upperType) {\n\t\t\tif (lower > upper) return new IntRange();\n\t\t\tif (lowerType == BoundType.OPEN) ++ lower;\n\t\t\tif (upperType == BoundType.OPEN) -- upper;\n\t\t\treturn new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange range(int lower, BoundType lowerType, int upper, BoundType upperType, UnaryOperator func) {\n\t\t\tif (lower > upper) return new IntRange(func);\n\t\t\tif (lowerType == BoundType.OPEN) ++ lower;\n\t\t\tif (upperType == BoundType.OPEN) -- upper;\n\t\t\treturn new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange open(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static IntRange open(int lower, int upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static IntRange open(int upper) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static IntRange open(int upper, UnaryOperator func) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static IntRange openClosed(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange openClosed(int lower, int upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange closedOpen(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static IntRange closedOpen(int lower, int upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static IntRange closed(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange closed(int lower, int upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange closed(int upper) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange closed(int upper, UnaryOperator func) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange singleton(int value) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange singleton(int value, UnaryOperator func) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);\n\t\t}\n\n\t\tprivate class FastIter implements Iterator {\n\t\t\tint now;\n\t\t\tpublic FastIter() {\n\t\t\t\tnow = lower;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic final boolean hasNext() {\n\t\t\t\treturn now <= upper;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final Integer next() {\n\t\t\t\treturn now++;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\tprivate class Iter implements Iterator {\n\t\t\tint now;\n\t\t\tpublic Iter() {\n\t\t\t\tnow = lower;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic final boolean hasNext() {\n\t\t\t\treturn now <= upper;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final Integer next() {\n\t\t\t\tint ret = now;\n\t\t\t\tnow = func.apply(now);\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator iterator() {\n\t\t\treturn lower == null || upper == null ? new EmptyIter() : useFastIter ? new FastIter() : new Iter();\n\t\t}\n\n\t\t@Override\n\t\tpublic int getDistance() {\n\t\t\tint ret = upper - lower;\n\t\t\tif (upperType == BoundType.CLOSED) ++ ret;\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic int getClosedLower() {\n\t\t\treturn lower;\n\t\t}\n\n\t\tpublic int getOpenLower() {\n\t\t\treturn lower - 1;\n\t\t}\n\n\t\tpublic int getClosedUpper() {\n\t\t\treturn upperType == BoundType.CLOSED ? upper : upper - 1;\n\t\t}\n\n\t\tpublic int getOpenUpper() {\n\t\t\treturn upperType == BoundType.CLOSED ? upper + 1 : upper;\n\t\t}\n\t}\n\n\t/**\n\t * 演算が結合法則を満たすことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Associative extends BinaryOperator{\n\t\t/**\n\t\t * repeat個のelementを順次演算した値を返します。\n\t\t * @param element 演算する値\n\t\t * @param repeat 繰り返す回数、1以上であること\n\t\t * @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値\n\t\t */\n\t\tpublic default T hyper(T element, int repeat) {\n\t\t\tif (repeat < 1) throw new IllegalArgumentException(\"undefined operation\");\n\t\t\tT ret = element;\n\t\t\t-- repeat;\n\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t/**\n\t* この演算が逆元を持つことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Inverse extends BinaryOperator{\n\t\tpublic T inverse(T element);\n\t}\n\n\t/**\n\t * 演算が交換法則を満たすことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Commutative extends BinaryOperator{\n\n\t}\n\n\t/**\n\t * 演算が単位元を持つことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Unit extends BinaryOperator{\n\t\t/**\n\t\t * 単位元を返します。\n\t\t * @return 単位元\n\t\t */\n\t\tpublic T unit();\n\t}\n\n\t/**\n\t * 演算が群であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Group extends Monoid, Inverse{\n\t\t/**\n\t\t * repeat���のelementを順次演算した値を返します。\n\t\t * @param element 演算する値\n\t\t * @param repeat 繰り返す回数\n\t\t * @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値\n\t\t */\n\t\t@Override\n\t\tpublic default T hyper(T element, int repeat) {\n\t\t\tT ret = unit();\n\t\t\tif (repeat < 0) {\n\t\t\t\trepeat = -repeat;\n\t\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\t\treturn inverse(ret);\n\t\t\t}\n\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t/**\n\t * 演算がモノイドであることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Monoid extends Associative, Unit {\n\t\t/**\n\t\t * repeat個のelementを順次演算した値を返します。\n\t\t * @param element 演算する値\n\t\t * @param repeat 繰り返す回数、0以上であること\n\t\t * @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値\n\t\t */\n\t\t@Override\n\t\tpublic default T hyper(T element, int repeat) {\n\t\t\tif (repeat < 0) throw new IllegalArgumentException(\"undefined operation\");\n\t\t\tT ret = unit();\n\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t/**\n\t * 演算が可換モノイドであることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface CommutativeMonoid extends Monoid, Commutative {\n\n\t}\n\n\t/**\n\t * 演算がアーベル群(可換群)であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Abelian extends Group, CommutativeMonoid {\n\n\t}\n\n\t/**\n\t * 演算が半環であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t * @param 和に関する演算\n\t * @param 積に関する演算\n\t */\n\tpublic interface Semiring, M extends Monoid> {\n\t\tpublic A getAddition();\n\t\tpublic M getMultiplication();\n\t}\n\n\t/**\n\t * 演算が環であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t * @param 和に関する演算\n\t * @param 積に関する演算\n\t */\n\tpublic interface Ring, M extends Monoid> extends Semiring{\n\n\t}\n\n\t/**\n\t * 演算が可換環に属することを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t * @param 和に関する演算\n\t * @param 積に関する演算\n\t */\n\tpublic interface CommutativeRing, M extends CommutativeMonoid> extends Ring{\n\n\t}\n\n\tpublic static class ModInteger extends Number implements CommutativeRing, CommutativeMonoid>{\n\n\t\tprivate static final long serialVersionUID = -8595710127161317579L;\n\t\tprivate final int mod;\n\t\tprivate int num;\n\n\t\tprivate final Addition add;\n\t\tprivate final Multiplication mul;\n\n\t\tprivate class Addition implements Abelian {\n\n\t\t\t@Override\n\t\t\tpublic ModInteger unit() {\n\t\t\t\treturn new ModInteger(mod, 0);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger inverse(ModInteger element) {\n\t\t\t\treturn new ModInteger(element, element.mod - element.num);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger apply(ModInteger left, ModInteger right) {\n\t\t\t\treturn new ModInteger(left).addEqual(right);\n\t\t\t}\n\t\t}\n\n\t\tprivate class Multiplication implements Abelian {\n\n\t\t\t@Override\n\t\t\tpublic ModInteger unit() {\n\t\t\t\treturn new ModInteger(mod, 1);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger apply(ModInteger left, ModInteger right) {\n\t\t\t\treturn new ModInteger(left).multiplyEqual(right);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger inverse(ModInteger element) {\n\t\t\t\treturn new ModInteger(element, element.inverse(element.num));\n\t\t\t}\n\n\t\t}\n\n\t\tpublic ModInteger(int mod) {\n\t\t\tthis.mod = mod;\n\t\t\tnum = 0;\n\t\t\tadd = new Addition();\n\t\t\tmul = new Multiplication();\n\t\t}\n\n\t\tpublic ModInteger(int mod, int num) {\n\t\t\tthis.mod = mod;\n\t\t\tthis.num = validNum(num);\n\t\t\tadd = new Addition();\n\t\t\tmul = new Multiplication();\n\t\t}\n\n\t\tpublic ModInteger(ModInteger n) {\n\t\t\tmod = n.mod;\n\t\t\tnum = n.num;\n\t\t\tadd = n.add;\n\t\t\tmul = n.mul;\n\t\t}\n\n\t\tprivate ModInteger(ModInteger n, int num) {\n\t\t\tmod = n.mod;\n\t\t\tthis.num = num;\n\t\t\tadd = n.add;\n\t\t\tmul = n.mul;\n\t\t}\n\n\t\tprivate int validNum(int n) {\n\t\t\tn %= mod;\n\t\t\tif (n < 0) n += mod;\n\t\t\treturn n;\n\t\t}\n\n\t\tprivate int validNum(long n) {\n\t\t\tn %= mod;\n\t\t\tif (n < 0) n += mod;\n\t\t\treturn (int)n;\n\t\t}\n\n\t\tprotected int inverse(int n) {\n\t\t\tint m = mod, u = 0, v = 1, t;\n\t\t\twhile(n != 0) {\n\t\t\t\tt = m / n;\n\t\t\t\tm -= t * n;\n\t\t\t\tu -= t * v;\n\t\t\t\tif (m != 0) {\n\t\t\t\t\tt = n / m;\n\t\t\t\t\tn -= t * m;\n\t\t\t\t\tv -= t * u;\n\t\t\t\t} else {\n\t\t\t\t\tv %= mod;\n\t\t\t\t\tif (v < 0) v += mod;\n\t\t\t\t\treturn v;\n\t\t\t\t}\n\t\t\t}\n\t\t\tu %= mod;\n\t\t\tif (u < 0) u += mod;\n\t\t\treturn u;\n\t\t}\n\n\t\tpublic boolean isPrime(int n) {\n\t\t\tif ((n & 1) == 0) return false; // 偶数\n\t\t\tfor (int i = 3, j = 8, k = 9;k <= n;i += 2, k += j += 8) if (n % i == 0) return false;\n\t\t\treturn true;\n\t\t}\n\n\t\t@Override\n\t\tpublic int intValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\t@Override\n\t\tpublic long longValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\t@Override\n\t\tpublic float floatValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\t@Override\n\t\tpublic double doubleValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\tpublic ModInteger add(int n) {\n\t\t\treturn new ModInteger(this).addEqual(n);\n\t\t}\n\n\t\tpublic ModInteger add(long n) {\n\t\t\treturn new ModInteger(this).addEqual(n);\n\t\t}\n\n\t\tpublic ModInteger add(ModInteger n) {\n\t\t\treturn new ModInteger(this).addEqual(n);\n\t\t}\n\n\t\tpublic ModInteger addEqual(int n) {\n\t\t\tnum = validNum(num + n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger addEqual(long n) {\n\t\t\tnum = validNum(num + n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger addEqual(ModInteger n) {\n\t\t\tif ((num += n.num) >= mod) num -= mod;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger subtract(int n) {\n\t\t\treturn new ModInteger(this).subtractEqual(n);\n\t\t}\n\n\t\tpublic ModInteger subtract(long n) {\n\t\t\treturn new ModInteger(this).subtractEqual(n);\n\t\t}\n\n\t\tpublic ModInteger subtract(ModInteger n) {\n\t\t\treturn new ModInteger(this).subtractEqual(n);\n\t\t}\n\n\t\tpublic ModInteger subtractEqual(int n) {\n\t\t\tnum = validNum(num - n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger subtractEqual(long n) {\n\t\t\tnum = validNum(num - n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger subtractEqual(ModInteger n) {\n\t\t\tif ((num -= n.num) < 0) num += mod;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger multiply(int n) {\n\t\t\treturn new ModInteger(this).multiplyEqual(n);\n\t\t}\n\n\t\tpublic ModInteger multiply(long n) {\n\t\t\treturn new ModInteger(this).multiplyEqual(n);\n\t\t}\n\n\t\tpublic ModInteger multiply(ModInteger n) {\n\t\t\treturn new ModInteger(this).multiplyEqual(n);\n\t\t}\n\n\t\tpublic ModInteger multiplyEqual(int n) {\n\t\t\tnum = (int)((long)num * n % mod);\n\t\t\tif (num < 0) num += mod;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger multiplyEqual(long n) {\n\t\t\treturn multiplyEqual((int) (n % mod));\n\t\t}\n\n\t\tpublic ModInteger multiplyEqual(ModInteger n) {\n\t\t\tnum = (int)((long)num * n.num % mod);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger divide(int n) {\n\t\t\treturn new ModInteger(this).divideEqual(n);\n\t\t}\n\n\t\tpublic ModInteger divide(long n) {\n\t\t\treturn new ModInteger(this).divideEqual(n);\n\t\t}\n\n\t\tpublic ModInteger divide(ModInteger n) {\n\t\t\treturn new ModInteger(this).divideEqual(n);\n\t\t}\n\n\t\tpublic ModInteger divideEqual(int n) {\n\t\t\tnum = (int)((long)num * inverse(validNum(n)) % mod);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger divideEqual(long n) {\n\t\t\treturn divideEqual((int)(n % mod));\n\t\t}\n\n\t\tpublic ModInteger divideEqual(ModInteger n) {\n\t\t\tnum = (int)((long)num * n.inverse(n.num) % mod);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger pow(int n) {\n\t\t\treturn new ModInteger(this).powEqual(n);\n\t\t}\n\n\t\tpublic ModInteger pow(long n) {\n\t\t\treturn new ModInteger(this).powEqual(n);\n\t\t}\n\n\t\tpublic ModInteger pow(ModInteger n) {\n\t\t\treturn new ModInteger(this).powEqual(n);\n\t\t}\n\n\t\tpublic ModInteger powEqual(int n) {\n\t\t\tlong ans = 1, num = this.num;\n\t\t\tif (n < 0) {\n\t\t\t\tn = -n;\n\t\t\t\twhile (n != 0) {\n\t\t\t\t\tif ((n & 1) != 0) ans = ans * num % mod;\n\t\t\t\t\tn >>>= 1;\n\t\t\tnum = num * num % mod;\n\t\t\t\t}\n\t\t\t\tthis.num = inverse((int)ans);\n\t\t\t\treturn this;\n\t\t\t}\n\t\t\twhile (n != 0) {\n\t\t\t\tif ((n & 1) != 0) ans = ans * num % mod;\n\t\t\t\tn >>>= 1;\n\t\t\t\t\tnum = num * num % mod;\n\t\t\t}\n\t\t\tthis.num = (int)ans;\n\t\t\treturn this;\n\t\t}\n\t\tpublic ModInteger powEqual(long n) {\n\t\t\treturn powEqual((int)(n % (mod - 1)));\n\t\t}\n\n\t\tpublic ModInteger powEqual(ModInteger n) {\n\t\t\tlong num = this.num;\n\t\t\tthis.num = 1;\n\t\t\tint mul = n.num;\n\t\t\twhile (mul != 0) {\n\t\t\t\tif ((mul & 1) != 0) this.num *= num;\n\t\t\t\tmul >>>= 1;\n\t\t\t\tnum *= num;\n\t\t\t\tnum %= mod;\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger equal(int n) {\n\t\t\tnum = validNum(n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger equal(long n) {\n\t\t\tnum = validNum(n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger equal(ModInteger n) {\n\t\t\tnum = n.num;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic int toInt() {\n\t\t\treturn num;\n\t\t}\n\n\t\tpublic int getMod() {\n\t\t\treturn mod;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object x) {\n\t\t\tif (x instanceof ModInteger) return ((ModInteger)x).num == num && ((ModInteger)x).mod == mod;\n\t\t\treturn false;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\treturn num ^ mod;\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn String.valueOf(num);\n\t\t}\n\n\t\t@Deprecated\n\t\tpublic String debug() {\n\t\t\tint min = num, ans = 1;\n\t\t\tfor (int i = 2;i < min;++ i) {\n\t\t\t\tint tmp = multiply(i).num;\n\t\t\t\tif (min > tmp) {\n\t\t\t\t\tmin = tmp;\n\t\t\t\t\tans = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min + \"/\" + ans;\n\t\t}\n\n\t\t@Override\n\t\tpublic Addition getAddition() {\n\t\t\treturn add;\n\t\t}\n\n\t\t@Override\n\t\tpublic Multiplication getMultiplication() {\n\t\t\treturn mul;\n\t\t}\n\t}\n\n\t/**\n\t * 素数を法とする演算上で、組み合わせの計算を高速に行います。\n\t * @author 31536000\n\t *\n\t */\n\tpublic static class ModUtility {\n\t\tprivate final int mod, totient;\n\t\tprivate int[] fact, inv, invfact;\n\t\t/**\n\t\t * modを法とする\n\t\t * @param mod\n\t\t */\n\t\tpublic ModUtility(int mod) {\n\t\t\tthis(mod, 2);\n\t\t}\n\n\t\tpublic ModUtility(int mod, int calc) {\n\t\t\tif (mod <= 0) throw new IllegalArgumentException(\"illegal mod: \" + mod);\n\t\t\tthis.mod = mod;\n\t\t\tint totient = mod;\n\t\t\tfor (int i = 2;i * i <= mod;++ i) {\n\t\t\t\tif (mod % i == 0) {\n\t\t\t\t\ttotient = totient / i * (i - 1);\n\t\t\t\t\twhile ((mod %= i) % i == 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis.totient = totient;\n\t\t\tprecalc(calc);\n\t\t}\n\n\t\tpublic void precalc(int calc) {\n\t\t\tif (calc < 2) calc = 2;\n\t\t\tfact = new int[calc];\n\t\t\tinv = new int[calc];\n\t\t\tinvfact = new int[calc];\n\t\t\tfact[0] = invfact[0] = fact[1] = invfact[1] = inv[1] = 1;\n\t\t\tfor (int i = 2;i < calc;++ i) {\n\t\t\t\tfact[i] = (int)((long)fact[i - 1] * i % mod);\n\t\t\t\tinv[i] = (int)(mod - (long)inv[mod % i] * (mod / i) % mod);\n\t\t\t\tinvfact[i] = (int)((long)invfact[i - 1] * inv[i] % mod);\n\t\t\t}\n\t\t}\n\n\t\tpublic ModInteger create() {\n\t\t\treturn create(0);\n\t\t}\n\n\t\tpublic ModInteger create(int n) {\n\t\t\treturn new ModInt(n);\n\t\t}\n\n\t\tprivate class ModInt extends ModInteger {\n\n\t\t\tprivate static final long serialVersionUID = -2435281861935422575L;\n\n\t\t\tpublic ModInt(int n) {\n\t\t\t\tsuper(mod, n);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tprotected int inverse(int n) {\n\t\t\t\treturn ModUtility.this.inverse(n);\n\t\t\t}\n\t\t}\n\n\t\tpublic int inverse(int n) {\n\t\t\ttry {\n\t\t\t\tif (inv.length > n) return inv[n];\n\t\t\t\tint m = mod, u = 0, v = 1, t;\n\t\t\t\twhile(n != 0) {\n\t\t\t\t\tt = m / n;\n\t\t\t\t\tm -= t * n;\n\t\t\t\t\tu -= t * v;\n\t\t\t\t\tif (m != 0) {\n\t\t\t\t\t\tt = n / m;\n\t\t\t\t\t\tn -= t * m;\n\t\t\t\t\t\tv -= t * u;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tv %= mod;\n\t\t\t\t\t\tif (v < 0) v += mod;\n\t\t\t\t\t\treturn v;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tu %= mod;\n\t\t\t\tif (u < 0) u += mod;\n\t\t\t\treturn u;\n\t\t\t} catch (ArrayIndexOutOfBoundsException e) {\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\t}\n\t\t}\n\n\t\tpublic int factorial(int n) {\n\t\t\ttry {\n\t\t\t\tif (fact.length > n) return fact[n];\n\t\t\t\tlong ret = fact[fact.length - 1];\n\t\t\t\tfor (int i = fact.length;i <= n;++ i) ret = ret * i % mod;\n\t\t\t\treturn (int)ret;\n\t\t\t} catch (ArrayIndexOutOfBoundsException e) {\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\t}\n\t\t}\n\n\t\tpublic int permutation(int n, int k) {\n\t\t\tif (k < 0) throw new IllegalArgumentException();\n\t\t\tif (n < k) return 0;\n\t\t\tif (fact.length > n) return (int)((long)fact[n] * invfact[n - k] % mod);\n\t\t\tlong ret = 1;\n\t\t\tfor (int i = n - k + 1;i <= n;++ i) ret = ret * i % mod;\n\t\t\treturn (int)ret;\n\t\t}\n\n\t\tpublic int combination(int n, int k) {\n\t\t\tif (k < 0) throw new IllegalArgumentException();\n\t\t\tif (n < k) return 0;\n\t\t\tif (fact.length > n) return (int)((long)fact[n] * invfact[k] % mod * invfact[n - k] % mod);\n\t\t\tlong ret = 1;\n\t\t\tif (n < 2 * k) k = n - k;\n\t\t\tif (invfact.length > k) ret = invfact[k];\n\t\t\telse ret = inverse(factorial(k));\n\t\t\tfor (int i = n - k + 1;i <= n;++ i) ret = ret * i % mod;\n\t\t\treturn (int)ret;\n\t\t}\n\n\t\tpublic int multinomial(int n, int... k) {\n\t\t\tint sum = 0;\n\t\t\tfor (int i : k) sum += i;\n\t\t\tlong ret = factorial(n);\n\t\t\tif (fact.length > n) {\n\t\t\t\tfor (int i : k) {\n\t\t\t\t\tif (i < 0) throw new IllegalArgumentException();\n\t\t\t\t\tret = ret * invfact[i] % mod;\n\t\t\t\t\tsum += i;\n\t\t\t\t}\n\t\t\t\tif (sum > n) return 0;\n\t\t\t\tret = ret * invfact[n - sum] % mod;\n\t\t\t} else {\n\t\t\t\tfor (int i : k) {\n\t\t\t\t\tif (i < 0) throw new IllegalArgumentException();\n\t\t\t\t\tif (invfact.length > i) ret = ret * invfact[i] % mod;\n\t\t\t\t\telse ret = ret * inverse(factorial(i)) % mod;\n\t\t\t\t\tsum += i;\n\t\t\t\t}\n\t\t\t\tif (sum > n) return 0;\n\t\t\t\tif (invfact.length > n - sum) ret = ret * invfact[n - sum] % mod;\n\t\t\t\telse ret = ret * inverse(factorial(n - sum)) % mod;\n\t\t\t}\n\t\t\treturn (int)ret;\n\t\t}\n\n\t\tpublic int multichoose(int n, int k) {\n\t\t\treturn combination(mod(n + k - 1), k);\n\t\t}\n\n\t\tpublic int catalan(int n) {\n\t\t\treturn divide(combination(mod(2 * n), n), mod(n + 1));\n\t\t}\n\n\t\tpublic int pow(int n, int m) {\n\t\t\tlong ans = 1, num = n;\n\t\t\tif (m < 0) {\n\t\t\t\tm = -m;\n\t\t\t\twhile (m != 0) {\n\t\t\t\t\tif ((m & 1) != 0) ans = ans * num % mod;\n\t\t\t\t\tm >>>= 1;\n\t\t\tnum = num * num % mod;\n\t\t\t\t}\n\t\t\t\treturn inverse((int)ans);\n\t\t\t}\n\t\t\twhile (m != 0) {\n\t\t\t\tif ((m & 1) != 0) ans = ans * num % mod;\n\t\t\t\tm >>>= 1;\n\t\t\tnum = num * num % mod;\n\t\t\t}\n\t\t\treturn (int)ans;\n\t\t}\n\n\t\tpublic int pow(long n, long m) {\n\t\t\treturn pow((int)(n % mod), (int)(m % (mod - 1)));\n\t\t}\n\n\t\tpublic int totient() {\n\t\t\treturn totient;\n\t\t}\n\n\t\tpublic boolean isPrime() {\n\t\t\treturn totient == mod - 1;\n\t\t}\n\n\t\tpublic int mod(int n) {\n\t\t\treturn (n %= mod) < 0 ? n + mod : n;\n\t\t}\n\n\t\tpublic int mod(long n) {\n\t\t\treturn (int)((n %= mod) < 0 ? n + mod : n);\n\t\t}\n\n\t\tpublic int add(int n, int m) {\n\t\t\treturn mod(n + m);\n\t\t}\n\n\t\tpublic int add(long n, long m) {\n\t\t\treturn mod(n + m);\n\t\t}\n\n\t\tpublic int subtract(int n, int m) {\n\t\t\treturn mod(n - m);\n\t\t}\n\n\t\tpublic int subtract(long n, long m) {\n\t\t\treturn mod(n - m);\n\t\t}\n\n\t\tpublic int multiply(int n, int m) {\n\t\t\tint ans = (int)((long)n * m % mod);\n\t\t\treturn ans < 0 ? ans + mod : ans;\n\t\t}\n\n\t\tpublic int multiply(long n, long m) {\n\t\t\treturn multiply(mod(n), mod(m));\n\t\t}\n\n\t\tpublic int divide(int n, int m) {\n\t\t\treturn multiply(n, inverse(mod(m)));\n\t\t}\n\n\t\tpublic int divide(long n, long m) {\n\t\t\treturn multiply(n, inverse(mod(m)));\n\t\t}\n\n\t\tpublic ModInteger lagrangePolynomial(ModInteger[] f, int x) {\n\t\t\tif (f.length > x) return f[x];\n\t\t\tif (x > fact.length) precalc(x);\n\t\t\tModInteger ret = create(0);\n\t\t\tModInteger[] dp = new ModInteger[f.length], dp2 = new ModInteger[f.length];\n\t\t\tdp[0] = create(1);\n\t\t\tdp2[f.length - 1] = create(1);\n\t\t\tfor (int i = 1;i < f.length;++ i) {\n\t\t\t\tdp[i] = dp[i - 1].multiply(x - i - 1);\n\t\t\t\tdp2[f.length - i - 1] = dp2[f.length - i].multiply(x - f.length + i);\n\t\t\t}\n\t\t\tfor (int i = 0;i < f.length;++ i) {\n\t\t\t\tModInteger tmp = f[i].multiply(dp[i]).multiplyEqual(dp2[i]).multiplyEqual(inv[i]).multiplyEqual(inv[f.length - 1 - i]);\n\t\t\t\tif ((f.length - i & 1) == 0) ret.addEqual(tmp);\n\t\t\t\telse ret.subtractEqual(tmp);\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\tpublic static class AbstractArray extends AbstractList implements RandomAccess{\n\n\t\tprivate final Object[] array;\n\n\t\tpublic AbstractArray(int size) {\n\t\t\tarray = new Object[size];\n\t\t}\n\n\t\tpublic AbstractArray(T[] array) {\n\t\t\tthis(array.length);\n\t\t\tSystem.arraycopy(array, 0, this.array, 0, array.length);\n\t\t}\n\n\t\t@Override\n\t\tpublic T set(int index, T element) {\n\t\t\tT ret = get(index);\n\t\t\tarray[index] = element;\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic T get(int index) {\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tT ret = (T)array[index];\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic Object[] get() {\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic T[] get(T[] array) {\n\t\t\tif (array.length < this.array.length) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tT[] ret = (T[])Arrays.copyOfRange(this.array, 0, this.array.length, array.getClass());\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tSystem.arraycopy(this.array, 0, array, 0, this.array.length);\n\t\t\treturn array;\n\t\t}\n\n\t\t@Override\n\t\tpublic int size() {\n\t\t\treturn array.length;\n\t\t}\n\n\t\tpublic int length() {\n\t\t\treturn size();\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\treturn Arrays.hashCode(array);\n\t\t}\n\n\t\tprivate class Iter implements Iterator {\n\t\t\tprivate int index;\n\n\t\t\tprivate Iter() {\n\t\t\t\tindex = 0;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn index < array.length;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic T next() {\n\t\t\t\treturn get(index++);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator iterator() {\n\t\t\treturn new Iter();\n\t\t}\n\t}\n\n\tpublic static class Array extends AbstractArray implements Serializable{\n\n\t\tprivate static final long serialVersionUID = 2749604433067098063L;\n\n\t\tpublic Array(int size) {\n\t\t\tsuper(size);\n\t\t}\n\n\t\tpublic Array(T[] array) {\n\t\t\tsuper(array);\n\t\t}\n\n\t\tpublic T front() {\n\t\t\treturn get(0);\n\t\t}\n\n\t\tpublic T back() {\n\t\t\treturn get(size() - 1);\n\t\t}\n\t}\n\n\tpublic static abstract class Enumeration implements Iterator>, Iterable> {\n\n\t\tpublic static class Entry {\n\t\t\tpublic final int index;\n\t\t\tpublic final V value;\n\n\t\t\tpublic Entry(int index, V value) {\n\t\t\t\tthis.index = index;\n\t\t\t\tthis.value = value;\n\t\t\t}\n\n\t\t\tpublic int getIndex() {\n\t\t\t\treturn index;\n\t\t\t}\n\n\t\t\tpublic V getValue() {\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic String toString() {\n\t\t\t\treturn index + \":\" + value.toString();\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator> iterator() {\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic static Enumeration create(V[] array) {\n\t\t\treturn new EnumerationArray<>(array);\n\t\t}\n\n\t\tpublic static Enumeration create(Collection collection) {\n\t\t\treturn new EnumerationCollection<>(collection);\n\t\t}\n\n\t\tprivate static class EnumerationArray extends Enumeration {\n\t\t\tprivate int index;\n\t\t\tprivate final V[] array;\n\n\t\t\tpublic EnumerationArray(V[] array) {\n\t\t\t\tindex = 0;\n\t\t\t\tthis.array = array;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn index != array.length;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic Entry next() {\n\t\t\t\tEntry ret = new Entry<>(index, array[index]);\n\t\t\t\t++ index;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t}\n\n\t\tprivate static class EnumerationCollection extends Enumeration {\n\t\t\tprivate int index;\n\t\t\tprivate final Iterator iterator;\n\n\t\t\tpublic EnumerationCollection(Collection collection) {\n\t\t\t\tindex = 0;\n\t\t\t\titerator = collection.iterator();\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn iterator.hasNext();\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic Entry next() {\n\t\t\t\tEntry ret = new Entry<>(index, iterator.next());\n\t\t\t\t++ index;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1569718871, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02897.html", "problem_id": "p02897", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02897/input.txt", "sample_output_relpath": "derived/input_output/data/p02897/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02897/Java/s336338765.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s336338765", "user_id": "u550314572"}, "prompt_components": {"gold_output": "0.5000000000\n", "input_to_evaluate": "\n\nimport java.awt.Point;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintStream;\nimport java.io.PrintWriter;\nimport java.io.Serializable;\nimport java.util.AbstractList;\nimport java.util.Arrays;\nimport java.util.Collection;\nimport java.util.Comparator;\nimport java.util.Iterator;\nimport java.util.Locale;\nimport java.util.NoSuchElementException;\nimport java.util.RandomAccess;\nimport java.util.function.BinaryOperator;\nimport java.util.function.UnaryOperator;\n\npublic class Main implements Runnable{\n\n\tprivate void solve(FastIO io) {\n\t\t/*\n\t\t * author: 31536000\n\t\t * ABC142 A問題\n\t\t * 考察メモ\n\t\t *\n\t\t */\n\t\tint N = io.nextInt();\n\t\tio.println((N + 1) / 2 / (double)N);\n\t}\n\n\t/** デバッグ用コードのお供に */\n\tprivate static boolean DEBUG = false;\n\t/** 確保するメモリの大きさ(単位: MB)*/\n\tprivate static final long MEMORY = 64;\n\tprivate final FastIO io;\n\n\tpublic static void main(String[] args) {\n\t Thread.setDefaultUncaughtExceptionHandler((t, e) -> e.printStackTrace());\n\t new Thread(null, new Main(), \"\", MEMORY * 1048576).start();\n\t}\n\n\tpublic Main() {\n\t\tio = new FastIO();\n\t\tassert (DEBUG = true) | true; // yukicoderだと-eaが付いてるので正しく動かないことに注意\n\t\tif (DEBUG) {\n\t\t\tio.setAutoFlush(true);\n\t\t\tio.println(\"debug mode\");\n\t\t}\n\t}\n\n\t@Override\n\tpublic void run() {\n\t\tsolve(io);\n\t\tio.flush();\n\t}\n\n\t// 以下、ライブラリ\n\n\tpublic static class FastIO {\n\t\tprivate final InputStream in;\n\t\tprivate final byte[] buffer = new byte[1024];\n\t\tprivate int read = 0;\n\t\tprivate int length = 0;\n\t\tpublic final PrintWriter out;\n\t\tpublic final PrintWriter err;\n\t\tprivate boolean autoFlush = false;\n\n\t\tpublic FastIO() {\n\t\t\tthis(System.in, System.out, System.err);\n\t\t}\n\n\t\tpublic FastIO(InputStream in, PrintStream out, PrintStream err) {\n\t\t\tthis.in = in;\n\t\t\tthis.out = new PrintWriter(out, false);\n\t\t\tthis.err = new PrintWriter(err, false);\n\t\t}\n\n\t\tpublic void setAutoFlush(boolean flush) {\n\t\t\tautoFlush = flush;\n\t\t}\n\n\t\tprivate boolean hasNextByte() {\n\t\t\tif (read < length) return true;\n\t\t\tread = 0;\n\t\t\ttry {\n\t\t\t\tlength = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\treturn length > 0;\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\treturn hasNextByte() ? buffer[read++] : -1;\n\t\t}\n\n\t\tprivate static boolean isPrintableChar(int c) {\n\t\t\treturn 33 <= c && c <= 126;\n\t\t}\n\n\t\tprivate static boolean isNumber(int c) {\n\t\t\treturn '0' <= c && c <= '9';\n\t\t}\n\n\t\tpublic boolean hasNext() {\n\t\t\twhile (hasNextByte() && !isPrintableChar(buffer[read])) read++;\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tpublic char nextChar() {\n\t\t\tif (!hasNextByte()) throw new NoSuchElementException();\n\t\t\treturn (char)readByte();\n\t\t}\n\n\t\tpublic char[][] nextChar(int height) {\n\t\t\tchar[][] ret = new char[height][];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = next().toCharArray();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b;\n\t\t\twhile (isPrintableChar(b = readByte())) sb.appendCodePoint(b);\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b;\n\t\t\twhile(!isPrintableChar(b = readByte()));\n\t\t\tdo sb.appendCodePoint(b); while(isPrintableChar(b = readByte()) || b == ' ');\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext()) throw new NoSuchElementException();\n\t\t\tlong n = 0;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\tif (!isNumber(b)) throw new NumberFormatException();\n\t\t\twhile (true) {\n\t\t\t\tif (isNumber(b)) {\n\t\t\t\t\tn *= 10;\n\t\t\t\t\tn += b - '0';\n\t\t\t\t} else if (b == -1 || !isPrintableChar(b)) return minus ? -n : n;\n\t\t\t\telse throw new NumberFormatException();\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tlong nl = nextLong();\n\t\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\t\treturn (int) nl;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextInt(int width) {\n\t\t\tint[] ret = new int[width];\n\t\t\tfor (int i = 0;i < width;++ i) ret[i] = nextInt();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic int[] nextInts() {\n\t\t\treturn nextInts(\" \");\n\t\t}\n\n\t\tpublic int[] nextInts(String parse) {\n\t\t\tString[] get = nextLine().split(parse);\n\t\t\tint[] ret = new int[get.length];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = Integer.valueOf(get[i]);\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long[] nextLong(int width) {\n\t\t\tlong[] ret = new long[width];\n\t\t\tfor (int i = 0;i < width;++ i) ret[i] = nextLong();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long[] nextLongs() {\n\t\t\treturn nextLongs(\" \");\n\t\t}\n\n\t\tpublic long[] nextLongs(String parse) {\n\t\t\tString[] get = nextLine().split(parse);\n\t\t\tlong[] ret = new long[get.length];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = Long.valueOf(get[i]);\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic int[][] nextInt(int width, int height) {\n\t\t\tint[][] ret = new int[height][width];\n\t\t\tfor (int i = 0, j;i < height;++ i) for (j = 0;j < width;++ j) ret[i][j] = nextInt();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long[][] nextLong(int width, int height) {\n\t\t\tlong[][] ret = new long[height][width];\n\t\t\tfor (int i = 0, j;i < height;++ i) for (j = 0;j < width;++ j) ret[j][i] = nextLong();\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic boolean[] nextBoolean(char T) {\n\t\t\tchar[] s = next().toCharArray();\n\t\t\tboolean[] ret = new boolean[s.length];\n\t\t\tfor (int i = 0;i < ret.length;++ i) ret[i] = s[i] == T;\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic boolean[][] nextBoolean(char T, int height) {\n\t\t\tboolean[][] ret = new boolean[height][];\n\t\t\tfor (int i = 0;i < ret.length;++ i) {\n\t\t\t\tchar[] s = next().toCharArray();\n\t\t\t\tret[i] = new boolean[s.length];\n\t\t\t\tfor (int j = 0;j < ret[i].length;++ j) ret[i][j] = s[j] == T;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic Point nextPoint() {\n\t\t\treturn new Point(nextInt(), nextInt());\n\t\t}\n\n\t\tpublic Point[] nextPoint(int width) {\n\t\t\tPoint[] ret = new Point[width];\n\t\t\tfor (int i = 0;i < width;++ i) ret[i] = nextPoint();\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tprotected void finalize() throws Throwable {\n\t\t\ttry {\n\t\t\t\tsuper.finalize();\n\t\t\t} finally {\n\t\t\t\tin.close();\n\t\t\t\tout.close();\n\t\t\t\terr.close();\n\t\t\t}\n\t\t}\n\n\t\tpublic boolean print(boolean b) {\n\t\t\tout.print(b);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn b;\n\t\t}\n\n\t\tpublic Object print(boolean b, Object t, Object f) {\n\t\t\treturn b ? print(t) : print(f);\n\t\t}\n\n\t\tpublic char print(char c) {\n\t\t\tout.print(c);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn c;\n\t\t}\n\n\t\tpublic char[] print(char[] s) {\n\t\t\tout.print(s);\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic double print(double d) {\n\t\t\tout.print(d);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic double print(double d, int length) {\n\t\t\tif (d < 0) {\n\t\t\t\tout.print('-');\n\t\t\t\td = -d;\n\t\t\t}\n\t\t\td += Math.pow(10, -length) / 2;\n\t\t\tout.print((long)d);\n\t\t\tout.print('.');\n\t\t\td -= (long)d;\n\t\t\tfor (int i = 0;i < length;++ i) {\n\t\t\t\td *= 10;\n\t\t\t\tout.print((int)d);\n\t\t\t\td -= (int)d;\n\t\t\t}\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic float print(float f) {\n\t\t\tout.print(f);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn f;\n\t\t}\n\n\t\tpublic int print(int i) {\n\t\t\tout.print(i);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn i;\n\t\t}\n\n\t\tpublic long print(long l) {\n\t\t\tout.print(l);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn l;\n\t\t}\n\n\t\tpublic Object print(Object obj) {\n\t\t\tif (obj.getClass().isArray()) {\n\t\t\t\tif (obj instanceof boolean[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof byte[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof short[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof int[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof long[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof float[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof double[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof char[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse if (obj instanceof Object[][]) print(obj, \"\\n\", \" \");\n\t\t\t\telse print(obj, \" \");\n\t\t\t} else {\n\t\t\t\tout.print(obj);\n\t\t\t\tif (autoFlush) flush();\n\t\t\t}\n\t\t\treturn obj;\n\t\t}\n\n\t\tpublic String print(String s) {\n\t\t\tout.print(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic Object print(Object array, String... parse) {\n\t\t\tprint(array, 0, parse);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn array;\n\t\t}\n\n\t\tprivate Object print(Object array, int check, String... parse) {\n\t\t\tif (check >= parse.length) {\n\t\t\t\tif (array.getClass().isArray()) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\t\tprint(array);\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tString str = parse[check];\n\t\t\tif (array instanceof Object[]) {\n\t\t\t\tObject[] obj = (Object[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0], check + 1, parse);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i], check + 1, parse);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tif (array instanceof Collection) {\n\t\t\t\tIterator iter = ((Collection)array).iterator();\n\t\t\t\tif (!iter.hasNext()) return array;\n\t\t\t\tprint(iter.next(), check + 1, parse);\n\t\t\t\twhile(iter.hasNext()) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(iter.next(), check + 1, parse);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t}\n\t\t\tif (!array.getClass().isArray()) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\tif (check != parse.length - 1) throw new IllegalArgumentException(\"not equal dimension\");\n\t\t\tif (array instanceof boolean[]) {\n\t\t\t\tboolean[] obj = (boolean[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof byte[]) {\n\t\t\t\tbyte[] obj = (byte[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t\treturn array;\n\t\t\t} else if (array instanceof short[]) {\n\t\t\t\tshort[] obj = (short[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof int[]) {\n\t\t\t\tint[] obj = (int[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof long[]) {\n\t\t\t\tlong[] obj = (long[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof float[]) {\n\t\t\t\tfloat[] obj = (float[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof double[]) {\n\t\t\t\tdouble[] obj = (double[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else if (array instanceof char[]) {\n\t\t\t\tchar[] obj = (char[]) array;\n\t\t\t\tif (obj.length == 0) return array;\n\t\t\t\tprint(obj[0]);\n\t\t\t\tfor (int i = 1;i < obj.length;++ i) {\n\t\t\t\t\tprint(str);\n\t\t\t\t\tprint(obj[i]);\n\t\t\t\t}\n\t\t\t} else throw new AssertionError();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic Object[] print(String parse, Object... args) {\n\t\t\tprint(args[0]);\n\t\t\tfor (int i = 1;i < args.length;++ i) {\n\t\t\t\tprint(parse);\n\t\t\t\tprint(args[i]);\n\t\t\t}\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic Object[] printf(String format, Object... args) {\n\t\t\tout.printf(format, args);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic Object printf(Locale l, String format, Object... args) {\n\t\t\tout.printf(l, format, args);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn args;\n\t\t}\n\n\t\tpublic void println() {\n\t\t\tout.println();\n\t\t\tif (autoFlush) flush();\n\t\t}\n\n\t\tpublic boolean println(boolean b) {\n\t\t\tout.println(b);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn b;\n\t\t}\n\n\t\tpublic Object println(boolean b, Object t, Object f) {\n\t\t\treturn b ? println(t) : println(f);\n\t\t}\n\n\t\tpublic char println(char c) {\n\t\t\tout.println(c);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn c;\n\t\t}\n\n\t\tpublic char[] println(char[] s) {\n\t\t\tout.println(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic double println(double d) {\n\t\t\tout.println(d);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic double println(double d, int length) {\n\t\t\tprint(d, length);\n\t\t\tprintln();\n\t\t\treturn d;\n\t\t}\n\n\t\tpublic float println(float f) {\n\t\t\tout.println(f);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn f;\n\t\t}\n\n\t\tpublic int println(int i) {\n\t\t\tout.println(i);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn i;\n\t\t}\n\n\t\tpublic long println(long l) {\n\t\t\tout.println(l);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn l;\n\t\t}\n\n\t\tpublic Object println(Object obj) {\n\t\t\tprint(obj);\n\t\t\tprintln();\n\t\t\treturn obj;\n\t\t}\n\n\t\tpublic String println(String s) {\n\t\t\tout.println(s);\n\t\t\tif (autoFlush) flush();\n\t\t\treturn s;\n\t\t}\n\n\t\tpublic Object println(Object array, String... parse) {\n\t\t\tprint(array, parse);\n\t\t\tprintln();\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic void flush() {\n\t\t\tout.flush();\n\t\t\terr.flush();\n\t\t}\n\t}\n\n\tpublic enum BoundType {\n\t\tCLOSED, OPEN;\n\t}\n\n\tpublic static class Range implements Serializable{\n\n\t\tprivate static final long serialVersionUID = -4702828934863023392L;\n\t\tprotected C lower;\n\t\tprotected C upper;\n\t\tprotected BoundType lowerType;\n\t\tprotected BoundType upperType;\n\t\tprivate Comparator comparator;\n\n\t\tprotected Range(C lower, BoundType lowerType, C upper, BoundType upperType) {\n\t\t\tthis(lower, lowerType, upper, upperType, null);\n\t\t}\n\n\t\tprotected Range(C lower, BoundType lowerType, C upper, BoundType upperType, Comparator comparator) {\n\t\t\tthis.lower = lower;\n\t\t\tthis.upper = upper;\n\t\t\tthis.lowerType = lowerType;\n\t\t\tthis.upperType = upperType;\n\t\t\tthis.comparator = comparator;\n\t\t}\n\n\t\tpublic static > Range range(C lower, BoundType lowerType, C upper, BoundType upperType) {\n\t\t\tif (lower != null && upper != null) {\n\t\t\t\tint comp = lower.compareTo(upper);\n\t\t\t\tif (comp > 0) return new Range(null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t\t\telse if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))return new Range(null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t\t}\n\t\t\treturn new Range(lower, lowerType, upper, upperType);\n\t\t}\n\n\t\tpublic static Range range(C lower, BoundType lowerType, C upper, BoundType upperType, Comparator comparator) {\n\t\t\tif (lower != null && upper != null) {\n\t\t\t\tint comp = comparator.compare(lower, upper);\n\t\t\t\tif (comp > 0) return new Range(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);\n\t\t\t\telse if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN)) return new Range(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);\n\t\t\t}\n\t\t\treturn new Range(lower, lowerType, upper, upperType, comparator);\n\t\t}\n\n\t\tpublic static > Range all() {\n\t\t\treturn range((C)null, BoundType.OPEN, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range all(Comparator comparator) {\n\t\t\treturn range((C)null, BoundType.OPEN, null, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range atMost(C upper) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range atMost(C upper, Comparator comparator) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static > Range lessThan(C upper) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range lessThan(C upper, Comparator comparator) {\n\t\t\treturn range(null, BoundType.OPEN, upper, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range downTo(C upper, BoundType boundType) {\n\t\t\treturn range(null, BoundType.OPEN, upper, boundType);\n\t\t}\n\n\t\tpublic static Range downTo(C upper, BoundType boundType, Comparator comparator) {\n\t\t\treturn range(null, BoundType.OPEN, upper, boundType, comparator);\n\t\t}\n\n\t\tpublic static > Range atLeast(C lower) {\n\t\t\treturn range(lower, BoundType.CLOSED, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range atLeast(C lower, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.CLOSED, null, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range greaterThan(C lower) {\n\t\t\treturn range(lower, BoundType.OPEN, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range greaterThan(C lower, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.OPEN, null, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range upTo(C lower, BoundType boundType) {\n\t\t\treturn range(lower, boundType, null, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range upTo(C lower, BoundType boundType, Comparator comparator) {\n\t\t\treturn range(lower, boundType, null, BoundType.OPEN, comparator );\n\t\t}\n\n\t\tpublic static > Range open(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range open(C lower, C upper, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range openClosed(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range openClosed(C lower, C upper, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static > Range closedOpen(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static Range closedOpen(C lower, C upper, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN, comparator);\n\t\t}\n\n\t\tpublic static > Range closed(C lower, C upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range closed(C lower, C upper, Comparator comparator) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static > Range singleton(C value) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range singleton(C value, Comparator comparator) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static > Range empty() {\n\t\t\treturn range((C)null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range empty(Comparator comparator) {\n\t\t\treturn range((C)null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tpublic static > Range encloseAll(Iterable values) {\n\t\t\tC lower = values.iterator().next();\n\t\t\tC upper = lower;\n\t\t\tfor (C i : values) {\n\t\t\t\tif (lower.compareTo(i) > 0) lower = i;\n\t\t\t\tif (upper.compareTo(i) < 0) upper = i;\n\t\t\t}\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static Range encloseAll(Iterable values, Comparator comparator) {\n\t\t\tC lower = values.iterator().next();\n\t\t\tC upper = lower;\n\t\t\tfor (C i : values) {\n\t\t\t\tif (comparator.compare(lower, i) > 0) lower = i;\n\t\t\t\tif (comparator.compare(upper, i) < 0) upper = i;\n\t\t\t}\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);\n\t\t}\n\n\t\tprotected int compareLower(C value) {\n\t\t\treturn compareLower(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareLower(C value, BoundType boundType) {\n\t\t\treturn compareLower(lower, lowerType, value, boundType);\n\t\t}\n\n\t\tprotected int compareLower(C lower, BoundType lowerType, C value) {\n\t\t\treturn compareLower(lower, lowerType, value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareLower(C lower, BoundType lowerType, C value, BoundType boundType) {\n\t\t\tif (lower == null) return value == null ? 0 : -1;\n\t\t\telse if (value == null) return 1;\n\t\t\tint compare;\n\t\t\tif (comparator == null) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tComparable comp = (Comparable)lower;\n\t\t\t\tcompare = comp.compareTo(value);\n\t\t\t} else compare = comparator.compare(lower, value);\n\t\t\tif (compare == 0) {\n\t\t\t\tif (lowerType == BoundType.CLOSED) -- compare;\n\t\t\t\tif (boundType == BoundType.CLOSED) ++ compare;\n\t\t\t}\n\t\t\treturn compare;\n\t\t}\n\n\t\tprotected int compareUpper(C value) {\n\t\t\treturn compareUpper(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareUpper(C value, BoundType boundType) {\n\t\t\treturn compareUpper(upper, upperType, value, boundType);\n\t\t}\n\n\t\tprotected int compareUpper(C upper, BoundType upperType, C value) {\n\t\t\treturn compareUpper(upper, upperType, value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected int compareUpper(C upper, BoundType upperType, C value, BoundType boundType) {\n\t\t\tif (upper == null) return value == null ? 0 : 1;\n\t\t\tif (value == null) return -1;\n\t\t\tint compare;\n\t\t\tif (comparator == null) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tComparable comp = (Comparable)upper;\n\t\t\t\tcompare = comp.compareTo(value);\n\t\t\t} else compare = comparator.compare(upper, value);\n\t\t\tif (compare == 0) {\n\t\t\t\tif (upperType == BoundType.CLOSED) ++ compare;\n\t\t\t\tif (boundType == BoundType.CLOSED) -- compare;\n\t\t\t}\n\t\t\treturn compare;\n\t\t}\n\n\t\tpublic boolean hasLowerBound() {\n\t\t\treturn lower != null;\n\t\t}\n\n\t\tpublic C lowerEndpoint() {\n\t\t\tif (hasLowerBound()) return lower;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\tpublic BoundType lowerBoundType() {\n\t\t\tif (hasLowerBound()) return lowerType;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\tpublic boolean hasUpperBound() {\n\t\t\treturn upper != null;\n\t\t}\n\n\t\tpublic C upperEndpoint() {\n\t\t\tif (hasUpperBound()) return upper;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\tpublic BoundType upperBoundType() {\n\t\t\tif (hasUpperBound()) return upperType;\n\t\t\tthrow new IllegalStateException();\n\t\t}\n\n\t\t/**\n\t\t * この区間が空集合か判定します。\n\t\t * @return 空集合ならばtrue\n\t\t */\n\t\tpublic boolean isEmpty() {\n\t\t\treturn lower == null && upper == null && lowerType == BoundType.CLOSED;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数が区間の左側に位置するか判定します。
\n\t\t * 接する場合は区間の左側ではないと判定します。\n\t\t * @param value 調べる引数\n\t\t * @return 区間の左側に位置するならtrue\n\t\t */\n\t\tpublic boolean isLess(C value) {\n\t\t\treturn isLess(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprotected boolean isLess(C value, BoundType boundType) {\n\t\t\treturn compareLower(value, boundType) > 0;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数が区間の右側に位置するか判定します。
\n\t\t * 接する場合は区間の右側ではないと判定します。\n\t\t * @param value 調べる引数\n\t\t * @return 区間の右側に位置するならtrue\n\t\t */\n\t\tpublic boolean isGreater(C value) {\n\t\t\treturn isGreater(value, BoundType.CLOSED);\n\t\t}\n\n\t\tprivate boolean isGreater(C value, BoundType boundType) {\n\t\t\treturn compareUpper(value, boundType) < 0;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数が区間内に位置するか判定します。
\n\t\t * 接する場合も区間内に位置すると判定します。\n\t\t * @param value 調べる引数\n\t\t * @return 区間内に位置するならtrue\n\t\t */\n\t\tpublic boolean contains(C value) {\n\t\t\treturn !isLess(value) && !isGreater(value) && !isEmpty();\n\t\t}\n\n\t\t/**\n\t\t * 与えられた引数すべてが区間内に位置するか判定します。
\n\t\t * 接する場合も区間内に位置すると判定します。\n\t\t * @param value 調べる要素\n\t\t * @return 全ての要素が区間内に位置するならtrue\n\t\t */\n\t\tpublic boolean containsAll(Iterable values) {\n\t\t\tfor (C i : values) if (!contains(i)) return false;\n\t\t\treturn true;\n\t\t}\n\n\t\t/**\n\t\t * 与えられた区間がこの区間に内包されるか判定します。
\n\t\t *\n\t\t * @param other\n\t\t * @return 与えられた区間がこの区間に内包されるならtrue\n\t\t */\n\t\tpublic boolean encloses(Range other) {\n\t\t\treturn !isLess(other.lower, other.lowerType) && !isGreater(other.upper, other.upperType);\n\t\t}\n\n\t\t/**\n\t\t * 与えられた区間がこの区間と公差するか判定します。
\n\t\t * 接する場合は公差するものとします。\n\t\t * @param value 調べる引数\n\t\t * @return 区間が交差するならtrue\n\t\t */\n\t\tpublic boolean isConnected(Range other) {\n\t\t\tif (this.isEmpty() || other.isEmpty()) return false;\n\t\t\tC lower, upper;\n\t\t\tBoundType lowerType, upperType;\n\t\t\tif (isLess(other.lower, other.lowerType)) {\n\t\t\t\tlower = other.lower;\n\t\t\t\tlowerType = other.lowerType;\n\t\t\t} else {\n\t\t\t\tlower = this.lower;\n\t\t\t\tlowerType = this.lowerType;\n\t\t\t}\n\t\t\tif (isGreater(other.upper, other.upperType)) {\n\t\t\t\tupper = other.upper;\n\t\t\t\tupperType = other.upperType;\n\t\t\t} else {\n\t\t\t\tupper = this.upper;\n\t\t\t\tupperType = this.upperType;\n\t\t\t}\n\t\t\tif (lower == null || upper == null) return true;\n\t\t\tint comp = compareLower(lower, lowerType, upper, upperType);\n\t\t\treturn comp <= 0;\n\t\t}\n\t\t/**\n\t\t * この区間との積集合を返します。\n\t\t * @param connectedRange 積集合を求める区間\n\t\t * @return 積集合\n\t\t */\n\t\tpublic Range intersection(Range connectedRange) {\n\t\t\tif (this.isEmpty() || connectedRange.isEmpty()) {\n\t\t\t\tif (comparator == null) return new Range(null, BoundType.CLOSED, null, BoundType.CLOSED);\n\t\t\t\treturn empty(comparator);\n\t\t\t}\n\t\t\tC lower, upper;\n\t\t\tBoundType lowerType, upperType;\n\t\t\tif (isLess(connectedRange.lower, connectedRange.lowerType)) {\n\t\t\t\tlower = connectedRange.lower;\n\t\t\t\tlowerType = connectedRange.lowerType;\n\t\t\t} else {\n\t\t\t\tlower = this.lower;\n\t\t\t\tlowerType = this.lowerType;\n\t\t\t}\n\t\t\tif (isGreater(connectedRange.upper, connectedRange.upperType)) {\n\t\t\t\tupper = connectedRange.upper;\n\t\t\t\tupperType = connectedRange.upperType;\n\t\t\t} else {\n\t\t\t\tupper = this.upper;\n\t\t\t\tupperType = this.upperType;\n\t\t\t}\n\t\t\tif (comparator == null) {\n\t\t\t\treturn new Range(lower, lowerType, upper, upperType);\n\t\t\t}\n\t\t\treturn range(lower, lowerType, upper, upperType, comparator);\n\t\t}\n\n\t\t/**\n\t\t * この区間との和集合を返します。\n\t\t * @param other 和集合を求める区間\n\t\t * @return 和集合\n\t\t */\n\t\tpublic Range span(Range other) {\n\t\t\tif (other.isEmpty()) return new Range(lower, lowerType, upper, upperType);\n\t\t\tC lower, upper;\n\t\t\tBoundType lowerType, upperType;\n\t\t\tif (isLess(other.lower, other.lowerType)) {\n\t\t\t\tlower = this.lower;\n\t\t\t\tlowerType = this.lowerType;\n\t\t\t} else {\n\t\t\t\tlower = other.lower;\n\t\t\t\tlowerType = other.lowerType;\n\t\t\t}\n\t\t\tif (isGreater(other.upper, other.upperType)) {\n\t\t\t\tupper = this.upper;\n\t\t\t\tupperType = this.upperType;\n\t\t\t} else {\n\t\t\t\tupper = other.upper;\n\t\t\t\tupperType = other.upperType;\n\t\t\t}\n\t\t\treturn new Range(lower, lowerType, upper, upperType, comparator);\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object object) {\n\t\t\tif (this == object) return true;\n\t\t\tif (object instanceof Range) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tRange comp = (Range) object;\n\t\t\t\treturn compareLower(comp.lower, comp.lowerType) == 0 && compareUpper(comp.upper, comp.upperType) == 0 && lowerType == comp.lowerType && upperType == comp.upperType;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tif (lower == null && upper == null) return 0;\n\t\t\telse if (lower == null) return upper.hashCode();\n\t\t\telse if (upper == null) return lower.hashCode();\n\t\t\treturn lower.hashCode() ^ upper.hashCode();\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\tif (isEmpty()) return \"()\";\n\t\t\treturn (lowerType == BoundType.OPEN ? \"(\" : \"[\") + (lower == null ? \"\" : lower.toString()) + \"..\" + (upper == null ? \"\" : upper.toString()) + (upperType == BoundType.OPEN ? \")\" : \"]\");\n\t\t}\n\t}\n\n\tpublic static class IterableRange extends Range implements Iterable{\n\n\t\tprivate static final long serialVersionUID = 9065915259748260688L;\n\t\tprotected UnaryOperator func;\n\n\t\tprotected IterableRange(C lower, BoundType lowerType, C upper, BoundType upperType, UnaryOperator func) {\n\t\t\tsuper(lower, lowerType, upper, upperType);\n\t\t\tthis.func = func;\n\t\t}\n\n\t\tpublic static > IterableRange range(C lower, BoundType lowerType, C upper, BoundType upperType, UnaryOperator func) {\n\t\t\tif (lower == null || upper == null) return new IterableRange(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\tint comp = lower.compareTo(upper);\n\t\t\tif (comp > 0) return new IterableRange(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\telse if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN)) return new IterableRange(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\treturn new IterableRange(lower, lowerType, upper, upperType, func);\n\t\t}\n\n\t\tpublic static > IterableRange open(C lower, C upper, UnaryOperator func) {\n\t\t\tif (lower == null) return new IterableRange(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\treturn range(func.apply(lower), BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static > IterableRange openClosed(C lower, C upper, UnaryOperator func) {\n\t\t\tif (lower == null) return new IterableRange(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\treturn range(func.apply(lower), BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static > IterableRange closedOpen(C lower, C upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static > IterableRange closed(C lower, C upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static > IterableRange singleton(C value, UnaryOperator func) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);\n\t\t}\n\n\t\tprotected class Iter implements Iterator {\n\t\t\tC now;\n\t\t\tIter() {\n\t\t\t\tnow = lower;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic final boolean hasNext() {\n\t\t\t\treturn !isGreater(now);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final C next() {\n\t\t\t\tC ret = now;\n\t\t\t\tnow = func.apply(now);\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\tprotected class EmptyIter implements Iterator {\n\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic C next() {\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator iterator() {\n\t\t\treturn lower == null || upper == null ? new EmptyIter() : new Iter();\n\t\t}\n\n\t\tpublic int getDistance() {\n\t\t\tC check = upper;\n\t\t\tint ret = 0;\n\t\t\twhile (lower != check) {\n\t\t\t\tcheck = func.apply(check);\n\t\t\t\t++ ret;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\tpublic static class IntRange extends IterableRange{\n\n\t\tprivate static final long serialVersionUID = 5623995336491967216L;\n\t\tprivate final boolean useFastIter;\n\n\t\tprivate static class Next implements UnaryOperator {\n\n\t\t\t@Override\n\t\t\tpublic Integer apply(Integer value) {\n\t\t\t\treturn value + 1;\n\t\t\t}\n\t\t}\n\n\t\tprotected IntRange() {\n\t\t\tsuper(null, BoundType.CLOSED, null, BoundType.CLOSED, new Next());\n\t\t\tuseFastIter = true;\n\t\t}\n\n\t\tprotected IntRange(UnaryOperator func) {\n\t\t\tsuper(null, BoundType.CLOSED, null, BoundType.CLOSED, func);\n\t\t\tuseFastIter = false;\n\t\t}\n\n\t\tprotected IntRange(int lower, BoundType lowerType, int upper, BoundType upperType) {\n\t\t\tsuper(lower, lowerType, upper, upperType, new Next());\n\t\t\tuseFastIter = true;\n\t\t}\n\n\t\tprotected IntRange(int lower, BoundType lowerType, int upper, BoundType upperType, UnaryOperator func) {\n\t\t\tsuper(lower, lowerType, upper, upperType, func);\n\t\t\tuseFastIter = false;\n\t\t}\n\n\t\tpublic static IntRange range(int lower, BoundType lowerType, int upper, BoundType upperType) {\n\t\t\tif (lower > upper) return new IntRange();\n\t\t\tif (lowerType == BoundType.OPEN) ++ lower;\n\t\t\tif (upperType == BoundType.OPEN) -- upper;\n\t\t\treturn new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange range(int lower, BoundType lowerType, int upper, BoundType upperType, UnaryOperator func) {\n\t\t\tif (lower > upper) return new IntRange(func);\n\t\t\tif (lowerType == BoundType.OPEN) ++ lower;\n\t\t\tif (upperType == BoundType.OPEN) -- upper;\n\t\t\treturn new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange open(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static IntRange open(int lower, int upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static IntRange open(int upper) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static IntRange open(int upper, UnaryOperator func) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static IntRange openClosed(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange openClosed(int lower, int upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.OPEN, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange closedOpen(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN);\n\t\t}\n\n\t\tpublic static IntRange closedOpen(int lower, int upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);\n\t\t}\n\n\t\tpublic static IntRange closed(int lower, int upper) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange closed(int lower, int upper, UnaryOperator func) {\n\t\t\treturn range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange closed(int upper) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange closed(int upper, UnaryOperator func) {\n\t\t\treturn range(0, BoundType.CLOSED, upper, BoundType.CLOSED, func);\n\t\t}\n\n\t\tpublic static IntRange singleton(int value) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED);\n\t\t}\n\n\t\tpublic static IntRange singleton(int value, UnaryOperator func) {\n\t\t\treturn range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);\n\t\t}\n\n\t\tprivate class FastIter implements Iterator {\n\t\t\tint now;\n\t\t\tpublic FastIter() {\n\t\t\t\tnow = lower;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic final boolean hasNext() {\n\t\t\t\treturn now <= upper;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final Integer next() {\n\t\t\t\treturn now++;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\tprivate class Iter implements Iterator {\n\t\t\tint now;\n\t\t\tpublic Iter() {\n\t\t\t\tnow = lower;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic final boolean hasNext() {\n\t\t\t\treturn now <= upper;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final Integer next() {\n\t\t\t\tint ret = now;\n\t\t\t\tnow = func.apply(now);\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic final void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator iterator() {\n\t\t\treturn lower == null || upper == null ? new EmptyIter() : useFastIter ? new FastIter() : new Iter();\n\t\t}\n\n\t\t@Override\n\t\tpublic int getDistance() {\n\t\t\tint ret = upper - lower;\n\t\t\tif (upperType == BoundType.CLOSED) ++ ret;\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic int getClosedLower() {\n\t\t\treturn lower;\n\t\t}\n\n\t\tpublic int getOpenLower() {\n\t\t\treturn lower - 1;\n\t\t}\n\n\t\tpublic int getClosedUpper() {\n\t\t\treturn upperType == BoundType.CLOSED ? upper : upper - 1;\n\t\t}\n\n\t\tpublic int getOpenUpper() {\n\t\t\treturn upperType == BoundType.CLOSED ? upper + 1 : upper;\n\t\t}\n\t}\n\n\t/**\n\t * 演算が結合法則を満たすことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Associative extends BinaryOperator{\n\t\t/**\n\t\t * repeat個のelementを順次演算した値を返します。\n\t\t * @param element 演算する値\n\t\t * @param repeat 繰り返す回数、1以上であること\n\t\t * @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値\n\t\t */\n\t\tpublic default T hyper(T element, int repeat) {\n\t\t\tif (repeat < 1) throw new IllegalArgumentException(\"undefined operation\");\n\t\t\tT ret = element;\n\t\t\t-- repeat;\n\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t/**\n\t* この演算が逆元を持つことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Inverse extends BinaryOperator{\n\t\tpublic T inverse(T element);\n\t}\n\n\t/**\n\t * 演算が交換法則を満たすことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Commutative extends BinaryOperator{\n\n\t}\n\n\t/**\n\t * 演算が単位元を持つことを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Unit extends BinaryOperator{\n\t\t/**\n\t\t * 単位元を返します。\n\t\t * @return 単位元\n\t\t */\n\t\tpublic T unit();\n\t}\n\n\t/**\n\t * 演算が群であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Group extends Monoid, Inverse{\n\t\t/**\n\t\t * repeat個のelementを順次演算した値を返します。\n\t\t * @param element 演算する値\n\t\t * @param repeat 繰り返す回数\n\t\t * @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値\n\t\t */\n\t\t@Override\n\t\tpublic default T hyper(T element, int repeat) {\n\t\t\tT ret = unit();\n\t\t\tif (repeat < 0) {\n\t\t\t\trepeat = -repeat;\n\t\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\t\treturn inverse(ret);\n\t\t\t}\n\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t/**\n\t * 演算がモノイドであることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Monoid extends Associative, Unit {\n\t\t/**\n\t\t * repeat個のelementを順次演算した値を返します。\n\t\t * @param element 演算する値\n\t\t * @param repeat 繰り返す回数、0以上であること\n\t\t * @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値\n\t\t */\n\t\t@Override\n\t\tpublic default T hyper(T element, int repeat) {\n\t\t\tif (repeat < 0) throw new IllegalArgumentException(\"undefined operation\");\n\t\t\tT ret = unit();\n\t\t\tfor (T mul = element;repeat > 0;repeat >>= 1, mul = apply(mul, mul)) if ((repeat & 1) != 0) ret = apply(ret, mul);\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\t/**\n\t * 演算が可換モノイドであることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface CommutativeMonoid extends Monoid, Commutative {\n\n\t}\n\n\t/**\n\t * 演算がアーベル群(可換群)であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t */\n\tpublic interface Abelian extends Group, CommutativeMonoid {\n\n\t}\n\n\t/**\n\t * 演算が半環であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t * @param 和に関する演算\n\t * @param 積に関する演算\n\t */\n\tpublic interface Semiring, M extends Monoid> {\n\t\tpublic A getAddition();\n\t\tpublic M getMultiplication();\n\t}\n\n\t/**\n\t * 演算が環であることを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t * @param 和に関する演算\n\t * @param 積に関する演算\n\t */\n\tpublic interface Ring, M extends Monoid> extends Semiring{\n\n\t}\n\n\t/**\n\t * 演算が可換環に属することを示すために使用するマーカー・インターフェースです。\n\t * @author 31536000\n\t *\n\t * @param 二項演算の型\n\t * @param 和に関する演算\n\t * @param 積に関する演算\n\t */\n\tpublic interface CommutativeRing, M extends CommutativeMonoid> extends Ring{\n\n\t}\n\n\tpublic static class ModInteger extends Number implements CommutativeRing, CommutativeMonoid>{\n\n\t\tprivate static final long serialVersionUID = -8595710127161317579L;\n\t\tprivate final int mod;\n\t\tprivate int num;\n\n\t\tprivate final Addition add;\n\t\tprivate final Multiplication mul;\n\n\t\tprivate class Addition implements Abelian {\n\n\t\t\t@Override\n\t\t\tpublic ModInteger unit() {\n\t\t\t\treturn new ModInteger(mod, 0);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger inverse(ModInteger element) {\n\t\t\t\treturn new ModInteger(element, element.mod - element.num);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger apply(ModInteger left, ModInteger right) {\n\t\t\t\treturn new ModInteger(left).addEqual(right);\n\t\t\t}\n\t\t}\n\n\t\tprivate class Multiplication implements Abelian {\n\n\t\t\t@Override\n\t\t\tpublic ModInteger unit() {\n\t\t\t\treturn new ModInteger(mod, 1);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger apply(ModInteger left, ModInteger right) {\n\t\t\t\treturn new ModInteger(left).multiplyEqual(right);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic ModInteger inverse(ModInteger element) {\n\t\t\t\treturn new ModInteger(element, element.inverse(element.num));\n\t\t\t}\n\n\t\t}\n\n\t\tpublic ModInteger(int mod) {\n\t\t\tthis.mod = mod;\n\t\t\tnum = 0;\n\t\t\tadd = new Addition();\n\t\t\tmul = new Multiplication();\n\t\t}\n\n\t\tpublic ModInteger(int mod, int num) {\n\t\t\tthis.mod = mod;\n\t\t\tthis.num = validNum(num);\n\t\t\tadd = new Addition();\n\t\t\tmul = new Multiplication();\n\t\t}\n\n\t\tpublic ModInteger(ModInteger n) {\n\t\t\tmod = n.mod;\n\t\t\tnum = n.num;\n\t\t\tadd = n.add;\n\t\t\tmul = n.mul;\n\t\t}\n\n\t\tprivate ModInteger(ModInteger n, int num) {\n\t\t\tmod = n.mod;\n\t\t\tthis.num = num;\n\t\t\tadd = n.add;\n\t\t\tmul = n.mul;\n\t\t}\n\n\t\tprivate int validNum(int n) {\n\t\t\tn %= mod;\n\t\t\tif (n < 0) n += mod;\n\t\t\treturn n;\n\t\t}\n\n\t\tprivate int validNum(long n) {\n\t\t\tn %= mod;\n\t\t\tif (n < 0) n += mod;\n\t\t\treturn (int)n;\n\t\t}\n\n\t\tprotected int inverse(int n) {\n\t\t\tint m = mod, u = 0, v = 1, t;\n\t\t\twhile(n != 0) {\n\t\t\t\tt = m / n;\n\t\t\t\tm -= t * n;\n\t\t\t\tu -= t * v;\n\t\t\t\tif (m != 0) {\n\t\t\t\t\tt = n / m;\n\t\t\t\t\tn -= t * m;\n\t\t\t\t\tv -= t * u;\n\t\t\t\t} else {\n\t\t\t\t\tv %= mod;\n\t\t\t\t\tif (v < 0) v += mod;\n\t\t\t\t\treturn v;\n\t\t\t\t}\n\t\t\t}\n\t\t\tu %= mod;\n\t\t\tif (u < 0) u += mod;\n\t\t\treturn u;\n\t\t}\n\n\t\tpublic boolean isPrime(int n) {\n\t\t\tif ((n & 1) == 0) return false; // 偶数\n\t\t\tfor (int i = 3, j = 8, k = 9;k <= n;i += 2, k += j += 8) if (n % i == 0) return false;\n\t\t\treturn true;\n\t\t}\n\n\t\t@Override\n\t\tpublic int intValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\t@Override\n\t\tpublic long longValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\t@Override\n\t\tpublic float floatValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\t@Override\n\t\tpublic double doubleValue() {\n\t\t\treturn num;\n\t\t}\n\n\t\tpublic ModInteger add(int n) {\n\t\t\treturn new ModInteger(this).addEqual(n);\n\t\t}\n\n\t\tpublic ModInteger add(long n) {\n\t\t\treturn new ModInteger(this).addEqual(n);\n\t\t}\n\n\t\tpublic ModInteger add(ModInteger n) {\n\t\t\treturn new ModInteger(this).addEqual(n);\n\t\t}\n\n\t\tpublic ModInteger addEqual(int n) {\n\t\t\tnum = validNum(num + n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger addEqual(long n) {\n\t\t\tnum = validNum(num + n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger addEqual(ModInteger n) {\n\t\t\tif ((num += n.num) >= mod) num -= mod;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger subtract(int n) {\n\t\t\treturn new ModInteger(this).subtractEqual(n);\n\t\t}\n\n\t\tpublic ModInteger subtract(long n) {\n\t\t\treturn new ModInteger(this).subtractEqual(n);\n\t\t}\n\n\t\tpublic ModInteger subtract(ModInteger n) {\n\t\t\treturn new ModInteger(this).subtractEqual(n);\n\t\t}\n\n\t\tpublic ModInteger subtractEqual(int n) {\n\t\t\tnum = validNum(num - n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger subtractEqual(long n) {\n\t\t\tnum = validNum(num - n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger subtractEqual(ModInteger n) {\n\t\t\tif ((num -= n.num) < 0) num += mod;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger multiply(int n) {\n\t\t\treturn new ModInteger(this).multiplyEqual(n);\n\t\t}\n\n\t\tpublic ModInteger multiply(long n) {\n\t\t\treturn new ModInteger(this).multiplyEqual(n);\n\t\t}\n\n\t\tpublic ModInteger multiply(ModInteger n) {\n\t\t\treturn new ModInteger(this).multiplyEqual(n);\n\t\t}\n\n\t\tpublic ModInteger multiplyEqual(int n) {\n\t\t\tnum = (int)((long)num * n % mod);\n\t\t\tif (num < 0) num += mod;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger multiplyEqual(long n) {\n\t\t\treturn multiplyEqual((int) (n % mod));\n\t\t}\n\n\t\tpublic ModInteger multiplyEqual(ModInteger n) {\n\t\t\tnum = (int)((long)num * n.num % mod);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger divide(int n) {\n\t\t\treturn new ModInteger(this).divideEqual(n);\n\t\t}\n\n\t\tpublic ModInteger divide(long n) {\n\t\t\treturn new ModInteger(this).divideEqual(n);\n\t\t}\n\n\t\tpublic ModInteger divide(ModInteger n) {\n\t\t\treturn new ModInteger(this).divideEqual(n);\n\t\t}\n\n\t\tpublic ModInteger divideEqual(int n) {\n\t\t\tnum = (int)((long)num * inverse(validNum(n)) % mod);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger divideEqual(long n) {\n\t\t\treturn divideEqual((int)(n % mod));\n\t\t}\n\n\t\tpublic ModInteger divideEqual(ModInteger n) {\n\t\t\tnum = (int)((long)num * n.inverse(n.num) % mod);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger pow(int n) {\n\t\t\treturn new ModInteger(this).powEqual(n);\n\t\t}\n\n\t\tpublic ModInteger pow(long n) {\n\t\t\treturn new ModInteger(this).powEqual(n);\n\t\t}\n\n\t\tpublic ModInteger pow(ModInteger n) {\n\t\t\treturn new ModInteger(this).powEqual(n);\n\t\t}\n\n\t\tpublic ModInteger powEqual(int n) {\n\t\t\tlong ans = 1, num = this.num;\n\t\t\tif (n < 0) {\n\t\t\t\tn = -n;\n\t\t\t\twhile (n != 0) {\n\t\t\t\t\tif ((n & 1) != 0) ans = ans * num % mod;\n\t\t\t\t\tn >>>= 1;\n\t\t\tnum = num * num % mod;\n\t\t\t\t}\n\t\t\t\tthis.num = inverse((int)ans);\n\t\t\t\treturn this;\n\t\t\t}\n\t\t\twhile (n != 0) {\n\t\t\t\tif ((n & 1) != 0) ans = ans * num % mod;\n\t\t\t\tn >>>= 1;\n\t\t\t\t\tnum = num * num % mod;\n\t\t\t}\n\t\t\tthis.num = (int)ans;\n\t\t\treturn this;\n\t\t}\n\t\tpublic ModInteger powEqual(long n) {\n\t\t\treturn powEqual((int)(n % (mod - 1)));\n\t\t}\n\n\t\tpublic ModInteger powEqual(ModInteger n) {\n\t\t\tlong num = this.num;\n\t\t\tthis.num = 1;\n\t\t\tint mul = n.num;\n\t\t\twhile (mul != 0) {\n\t\t\t\tif ((mul & 1) != 0) this.num *= num;\n\t\t\t\tmul >>>= 1;\n\t\t\t\tnum *= num;\n\t\t\t\tnum %= mod;\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger equal(int n) {\n\t\t\tnum = validNum(n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger equal(long n) {\n\t\t\tnum = validNum(n);\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic ModInteger equal(ModInteger n) {\n\t\t\tnum = n.num;\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic int toInt() {\n\t\t\treturn num;\n\t\t}\n\n\t\tpublic int getMod() {\n\t\t\treturn mod;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean equals(Object x) {\n\t\t\tif (x instanceof ModInteger) return ((ModInteger)x).num == num && ((ModInteger)x).mod == mod;\n\t\t\treturn false;\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\treturn num ^ mod;\n\t\t}\n\n\t\t@Override\n\t\tpublic String toString() {\n\t\t\treturn String.valueOf(num);\n\t\t}\n\n\t\t@Deprecated\n\t\tpublic String debug() {\n\t\t\tint min = num, ans = 1;\n\t\t\tfor (int i = 2;i < min;++ i) {\n\t\t\t\tint tmp = multiply(i).num;\n\t\t\t\tif (min > tmp) {\n\t\t\t\t\tmin = tmp;\n\t\t\t\t\tans = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min + \"/\" + ans;\n\t\t}\n\n\t\t@Override\n\t\tpublic Addition getAddition() {\n\t\t\treturn add;\n\t\t}\n\n\t\t@Override\n\t\tpublic Multiplication getMultiplication() {\n\t\t\treturn mul;\n\t\t}\n\t}\n\n\t/**\n\t * 素数を法とする演算上で、組み合わせの計算を高速に行います。\n\t * @author 31536000\n\t *\n\t */\n\tpublic static class ModUtility {\n\t\tprivate final int mod, totient;\n\t\tprivate int[] fact, inv, invfact;\n\t\t/**\n\t\t * modを法とする\n\t\t * @param mod\n\t\t */\n\t\tpublic ModUtility(int mod) {\n\t\t\tthis(mod, 2);\n\t\t}\n\n\t\tpublic ModUtility(int mod, int calc) {\n\t\t\tif (mod <= 0) throw new IllegalArgumentException(\"illegal mod: \" + mod);\n\t\t\tthis.mod = mod;\n\t\t\tint totient = mod;\n\t\t\tfor (int i = 2;i * i <= mod;++ i) {\n\t\t\t\tif (mod % i == 0) {\n\t\t\t\t\ttotient = totient / i * (i - 1);\n\t\t\t\t\twhile ((mod %= i) % i == 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis.totient = totient;\n\t\t\tprecalc(calc);\n\t\t}\n\n\t\tpublic void precalc(int calc) {\n\t\t\tif (calc < 2) calc = 2;\n\t\t\tfact = new int[calc];\n\t\t\tinv = new int[calc];\n\t\t\tinvfact = new int[calc];\n\t\t\tfact[0] = invfact[0] = fact[1] = invfact[1] = inv[1] = 1;\n\t\t\tfor (int i = 2;i < calc;++ i) {\n\t\t\t\tfact[i] = (int)((long)fact[i - 1] * i % mod);\n\t\t\t\tinv[i] = (int)(mod - (long)inv[mod % i] * (mod / i) % mod);\n\t\t\t\tinvfact[i] = (int)((long)invfact[i - 1] * inv[i] % mod);\n\t\t\t}\n\t\t}\n\n\t\tpublic ModInteger create() {\n\t\t\treturn create(0);\n\t\t}\n\n\t\tpublic ModInteger create(int n) {\n\t\t\treturn new ModInt(n);\n\t\t}\n\n\t\tprivate class ModInt extends ModInteger {\n\n\t\t\tprivate static final long serialVersionUID = -2435281861935422575L;\n\n\t\t\tpublic ModInt(int n) {\n\t\t\t\tsuper(mod, n);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tprotected int inverse(int n) {\n\t\t\t\treturn ModUtility.this.inverse(n);\n\t\t\t}\n\t\t}\n\n\t\tpublic int inverse(int n) {\n\t\t\ttry {\n\t\t\t\tif (inv.length > n) return inv[n];\n\t\t\t\tint m = mod, u = 0, v = 1, t;\n\t\t\t\twhile(n != 0) {\n\t\t\t\t\tt = m / n;\n\t\t\t\t\tm -= t * n;\n\t\t\t\t\tu -= t * v;\n\t\t\t\t\tif (m != 0) {\n\t\t\t\t\t\tt = n / m;\n\t\t\t\t\t\tn -= t * m;\n\t\t\t\t\t\tv -= t * u;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tv %= mod;\n\t\t\t\t\t\tif (v < 0) v += mod;\n\t\t\t\t\t\treturn v;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tu %= mod;\n\t\t\t\tif (u < 0) u += mod;\n\t\t\t\treturn u;\n\t\t\t} catch (ArrayIndexOutOfBoundsException e) {\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\t}\n\t\t}\n\n\t\tpublic int factorial(int n) {\n\t\t\ttry {\n\t\t\t\tif (fact.length > n) return fact[n];\n\t\t\t\tlong ret = fact[fact.length - 1];\n\t\t\t\tfor (int i = fact.length;i <= n;++ i) ret = ret * i % mod;\n\t\t\t\treturn (int)ret;\n\t\t\t} catch (ArrayIndexOutOfBoundsException e) {\n\t\t\t\tthrow new IllegalArgumentException();\n\t\t\t}\n\t\t}\n\n\t\tpublic int permutation(int n, int k) {\n\t\t\tif (k < 0) throw new IllegalArgumentException();\n\t\t\tif (n < k) return 0;\n\t\t\tif (fact.length > n) return (int)((long)fact[n] * invfact[n - k] % mod);\n\t\t\tlong ret = 1;\n\t\t\tfor (int i = n - k + 1;i <= n;++ i) ret = ret * i % mod;\n\t\t\treturn (int)ret;\n\t\t}\n\n\t\tpublic int combination(int n, int k) {\n\t\t\tif (k < 0) throw new IllegalArgumentException();\n\t\t\tif (n < k) return 0;\n\t\t\tif (fact.length > n) return (int)((long)fact[n] * invfact[k] % mod * invfact[n - k] % mod);\n\t\t\tlong ret = 1;\n\t\t\tif (n < 2 * k) k = n - k;\n\t\t\tif (invfact.length > k) ret = invfact[k];\n\t\t\telse ret = inverse(factorial(k));\n\t\t\tfor (int i = n - k + 1;i <= n;++ i) ret = ret * i % mod;\n\t\t\treturn (int)ret;\n\t\t}\n\n\t\tpublic int multinomial(int n, int... k) {\n\t\t\tint sum = 0;\n\t\t\tfor (int i : k) sum += i;\n\t\t\tlong ret = factorial(n);\n\t\t\tif (fact.length > n) {\n\t\t\t\tfor (int i : k) {\n\t\t\t\t\tif (i < 0) throw new IllegalArgumentException();\n\t\t\t\t\tret = ret * invfact[i] % mod;\n\t\t\t\t\tsum += i;\n\t\t\t\t}\n\t\t\t\tif (sum > n) return 0;\n\t\t\t\tret = ret * invfact[n - sum] % mod;\n\t\t\t} else {\n\t\t\t\tfor (int i : k) {\n\t\t\t\t\tif (i < 0) throw new IllegalArgumentException();\n\t\t\t\t\tif (invfact.length > i) ret = ret * invfact[i] % mod;\n\t\t\t\t\telse ret = ret * inverse(factorial(i)) % mod;\n\t\t\t\t\tsum += i;\n\t\t\t\t}\n\t\t\t\tif (sum > n) return 0;\n\t\t\t\tif (invfact.length > n - sum) ret = ret * invfact[n - sum] % mod;\n\t\t\t\telse ret = ret * inverse(factorial(n - sum)) % mod;\n\t\t\t}\n\t\t\treturn (int)ret;\n\t\t}\n\n\t\tpublic int multichoose(int n, int k) {\n\t\t\treturn combination(mod(n + k - 1), k);\n\t\t}\n\n\t\tpublic int catalan(int n) {\n\t\t\treturn divide(combination(mod(2 * n), n), mod(n + 1));\n\t\t}\n\n\t\tpublic int pow(int n, int m) {\n\t\t\tlong ans = 1, num = n;\n\t\t\tif (m < 0) {\n\t\t\t\tm = -m;\n\t\t\t\twhile (m != 0) {\n\t\t\t\t\tif ((m & 1) != 0) ans = ans * num % mod;\n\t\t\t\t\tm >>>= 1;\n\t\t\tnum = num * num % mod;\n\t\t\t\t}\n\t\t\t\treturn inverse((int)ans);\n\t\t\t}\n\t\t\twhile (m != 0) {\n\t\t\t\tif ((m & 1) != 0) ans = ans * num % mod;\n\t\t\t\tm >>>= 1;\n\t\t\tnum = num * num % mod;\n\t\t\t}\n\t\t\treturn (int)ans;\n\t\t}\n\n\t\tpublic int pow(long n, long m) {\n\t\t\treturn pow((int)(n % mod), (int)(m % (mod - 1)));\n\t\t}\n\n\t\tpublic int totient() {\n\t\t\treturn totient;\n\t\t}\n\n\t\tpublic boolean isPrime() {\n\t\t\treturn totient == mod - 1;\n\t\t}\n\n\t\tpublic int mod(int n) {\n\t\t\treturn (n %= mod) < 0 ? n + mod : n;\n\t\t}\n\n\t\tpublic int mod(long n) {\n\t\t\treturn (int)((n %= mod) < 0 ? n + mod : n);\n\t\t}\n\n\t\tpublic int add(int n, int m) {\n\t\t\treturn mod(n + m);\n\t\t}\n\n\t\tpublic int add(long n, long m) {\n\t\t\treturn mod(n + m);\n\t\t}\n\n\t\tpublic int subtract(int n, int m) {\n\t\t\treturn mod(n - m);\n\t\t}\n\n\t\tpublic int subtract(long n, long m) {\n\t\t\treturn mod(n - m);\n\t\t}\n\n\t\tpublic int multiply(int n, int m) {\n\t\t\tint ans = (int)((long)n * m % mod);\n\t\t\treturn ans < 0 ? ans + mod : ans;\n\t\t}\n\n\t\tpublic int multiply(long n, long m) {\n\t\t\treturn multiply(mod(n), mod(m));\n\t\t}\n\n\t\tpublic int divide(int n, int m) {\n\t\t\treturn multiply(n, inverse(mod(m)));\n\t\t}\n\n\t\tpublic int divide(long n, long m) {\n\t\t\treturn multiply(n, inverse(mod(m)));\n\t\t}\n\n\t\tpublic ModInteger lagrangePolynomial(ModInteger[] f, int x) {\n\t\t\tif (f.length > x) return f[x];\n\t\t\tif (x > fact.length) precalc(x);\n\t\t\tModInteger ret = create(0);\n\t\t\tModInteger[] dp = new ModInteger[f.length], dp2 = new ModInteger[f.length];\n\t\t\tdp[0] = create(1);\n\t\t\tdp2[f.length - 1] = create(1);\n\t\t\tfor (int i = 1;i < f.length;++ i) {\n\t\t\t\tdp[i] = dp[i - 1].multiply(x - i - 1);\n\t\t\t\tdp2[f.length - i - 1] = dp2[f.length - i].multiply(x - f.length + i);\n\t\t\t}\n\t\t\tfor (int i = 0;i < f.length;++ i) {\n\t\t\t\tModInteger tmp = f[i].multiply(dp[i]).multiplyEqual(dp2[i]).multiplyEqual(inv[i]).multiplyEqual(inv[f.length - 1 - i]);\n\t\t\t\tif ((f.length - i & 1) == 0) ret.addEqual(tmp);\n\t\t\t\telse ret.subtractEqual(tmp);\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t}\n\n\tpublic static class AbstractArray extends AbstractList implements RandomAccess{\n\n\t\tprivate final Object[] array;\n\n\t\tpublic AbstractArray(int size) {\n\t\t\tarray = new Object[size];\n\t\t}\n\n\t\tpublic AbstractArray(T[] array) {\n\t\t\tthis(array.length);\n\t\t\tSystem.arraycopy(array, 0, this.array, 0, array.length);\n\t\t}\n\n\t\t@Override\n\t\tpublic T set(int index, T element) {\n\t\t\tT ret = get(index);\n\t\t\tarray[index] = element;\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic T get(int index) {\n\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\tT ret = (T)array[index];\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic Object[] get() {\n\t\t\treturn array;\n\t\t}\n\n\t\tpublic T[] get(T[] array) {\n\t\t\tif (array.length < this.array.length) {\n\t\t\t\t@SuppressWarnings(\"unchecked\")\n\t\t\t\tT[] ret = (T[])Arrays.copyOfRange(this.array, 0, this.array.length, array.getClass());\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tSystem.arraycopy(this.array, 0, array, 0, this.array.length);\n\t\t\treturn array;\n\t\t}\n\n\t\t@Override\n\t\tpublic int size() {\n\t\t\treturn array.length;\n\t\t}\n\n\t\tpublic int length() {\n\t\t\treturn size();\n\t\t}\n\n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\treturn Arrays.hashCode(array);\n\t\t}\n\n\t\tprivate class Iter implements Iterator {\n\t\t\tprivate int index;\n\n\t\t\tprivate Iter() {\n\t\t\t\tindex = 0;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn index < array.length;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic T next() {\n\t\t\t\treturn get(index++);\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic void remove() {\n\t\t\t\tthrow new UnsupportedOperationException();\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator iterator() {\n\t\t\treturn new Iter();\n\t\t}\n\t}\n\n\tpublic static class Array extends AbstractArray implements Serializable{\n\n\t\tprivate static final long serialVersionUID = 2749604433067098063L;\n\n\t\tpublic Array(int size) {\n\t\t\tsuper(size);\n\t\t}\n\n\t\tpublic Array(T[] array) {\n\t\t\tsuper(array);\n\t\t}\n\n\t\tpublic T front() {\n\t\t\treturn get(0);\n\t\t}\n\n\t\tpublic T back() {\n\t\t\treturn get(size() - 1);\n\t\t}\n\t}\n\n\tpublic static abstract class Enumeration implements Iterator>, Iterable> {\n\n\t\tpublic static class Entry {\n\t\t\tpublic final int index;\n\t\t\tpublic final V value;\n\n\t\t\tpublic Entry(int index, V value) {\n\t\t\t\tthis.index = index;\n\t\t\t\tthis.value = value;\n\t\t\t}\n\n\t\t\tpublic int getIndex() {\n\t\t\t\treturn index;\n\t\t\t}\n\n\t\t\tpublic V getValue() {\n\t\t\t\treturn value;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic String toString() {\n\t\t\t\treturn index + \":\" + value.toString();\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic Iterator> iterator() {\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic static Enumeration create(V[] array) {\n\t\t\treturn new EnumerationArray<>(array);\n\t\t}\n\n\t\tpublic static Enumeration create(Collection collection) {\n\t\t\treturn new EnumerationCollection<>(collection);\n\t\t}\n\n\t\tprivate static class EnumerationArray extends Enumeration {\n\t\t\tprivate int index;\n\t\t\tprivate final V[] array;\n\n\t\t\tpublic EnumerationArray(V[] array) {\n\t\t\t\tindex = 0;\n\t\t\t\tthis.array = array;\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn index != array.length;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic Entry next() {\n\t\t\t\tEntry ret = new Entry<>(index, array[index]);\n\t\t\t\t++ index;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t}\n\n\t\tprivate static class EnumerationCollection extends Enumeration {\n\t\t\tprivate int index;\n\t\t\tprivate final Iterator iterator;\n\n\t\t\tpublic EnumerationCollection(Collection collection) {\n\t\t\t\tindex = 0;\n\t\t\t\titerator = collection.iterator();\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\treturn iterator.hasNext();\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic Entry next() {\n\t\t\t\tEntry ret = new Entry<>(index, iterator.next());\n\t\t\t\t++ index;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t}\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer N.\n\nTakahashi chooses an integer a from the positive integers not greater than N with equal probability.\n\nFind the probability that a is odd.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the probability that a is odd.\nYour output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n0.5000000000\n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among them, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0.6000000000\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1.0000000000", "sample_input": "4\n"}, "reference_outputs": ["0.5000000000\n"], "source_document_id": "p02897", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer N.\n\nTakahashi chooses an integer a from the positive integers not greater than N with equal probability.\n\nFind the probability that a is odd.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the probability that a is odd.\nYour output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n0.5000000000\n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among them, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0.6000000000\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1.0000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57532, "cpu_time_ms": 189, "memory_kb": 30548}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s688256592", "group_id": "codeNet:p02898", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n\n int N = s.nextInt();\n int K = s.nextInt();\n\n int counter = 0;\n\n while (--N >= 0) {\n int height = s.nextInt();\n\n if (height >= K)\n counter++;\n }\n\n System.out.println(counter);\n }\n}", "language": "Java", "metadata": {"date": 1574588752, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02898.html", "problem_id": "p02898", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02898/input.txt", "sample_output_relpath": "derived/input_output/data/p02898/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02898/Java/s688256592.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s688256592", "user_id": "u210201926"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n\n int N = s.nextInt();\n int K = s.nextInt();\n\n int counter = 0;\n\n while (--N >= 0) {\n int height = s.nextInt();\n\n if (height >= K)\n counter++;\n }\n\n System.out.println(counter);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "sample_input": "4 150\n150 140 100 200\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02898", "source_text": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 399, "cpu_time_ms": 388, "memory_kb": 48344}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s673715232", "group_id": "codeNet:p02898", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author AyushKM\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n BRollerCoaster solver = new BRollerCoaster();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class BRollerCoaster {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n int k = in.nextInt();\n int count = 0;\n for (int x = 0; x < n; x++) {\n if (in.nextInt() >= k) {\n count++;\n }\n }\n out.println(count);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(int i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1571531806, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02898.html", "problem_id": "p02898", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02898/input.txt", "sample_output_relpath": "derived/input_output/data/p02898/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02898/Java/s673715232.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673715232", "user_id": "u932104884"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author AyushKM\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n BRollerCoaster solver = new BRollerCoaster();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class BRollerCoaster {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.nextInt();\n int k = in.nextInt();\n int count = 0;\n for (int x = 0; x < n; x++) {\n if (in.nextInt() >= k) {\n count++;\n }\n }\n out.println(count);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(int i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "sample_input": "4 150\n150 140 100 200\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02898", "source_text": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3315, "cpu_time_ms": 86, "memory_kb": 23508}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s776691345", "group_id": "codeNet:p02899", "input_text": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\t// write your code here\n Scanner scan = new Scanner(System.in);\n int size= 0;\n size=scan.nextInt();\n\n int[] arr = new int[size];\n for(int i=0;i j)\n\t\t\t\treturn seg[node];\n\t\t\tif(i == j && j == k) {\n\t\t\t\ta[k] = value;\n\t\t\t\tseg[node] = value;\n\t\t\t\treturn value;\n\t\t\t}\n\t\t\t\n\t\t\tint m = (i + j) / 2;\n\t\t\tlong first = update(node * 2, i, m, k, value);\n\t\t\tlong second = update(node * 2 + 1, m + 1, j, k, value);\n\t\t\treturn seg[node] = combine(first, second);\n\t\t}\n\t\t\n\t\tlong query(int l, int r) {\n\t\t\treturn query(1, 0, n-1, l, r);\n\t\t}\n\t\t\n\t\tprivate long query(int node, int i, int j, int l, int r) {\n\t\t\tif(l <= i && j <= r)\n\t\t\t\treturn seg[node];\n\t\t\tif(j < l || i > r)\n\t\t\t\treturn DEFAULT_VALUE;\n\t\t\tint m = (i + j) / 2;\n\t\t\tlong first = query(node * 2, i, m, l, r);\n\t\t\tlong second = query(node * 2 + 1, m+1, j, l, r);\n\t\t\treturn combine(first, second);\n\t\t}\n \n\t\tprivate long combine(long a, long b) {\n\t\t\treturn a + b;\n\t\t}\n\t}\n\t\n\tstatic class DisjointSet {\n\t\tint n;\n\t\tint[] g;\n\t\tint[] h;\n\t\tpublic DisjointSet(int n) {\n\t\t\tsuper();\n\t\t\tthis.n = n;\n\t\t\tg = new int[n];\n\t\t\th = new int[n];\n\t\t\tfor(int i = 0; i < n; ++i) {\n\t\t\t\tg[i] = i;\n\t\t\t\th[i] = 1;\n\t\t\t}\n\t\t}\n\t\tint find(int x) {\n\t\t\tif(g[x] == x)\n\t\t\t\treturn x;\n\t\t\treturn g[x] = find(g[x]);\n\t\t}\n\t\tvoid union(int x, int y) {\n\t\t\tx = find(x); y = find(y);\n\t\t\tif(x == y)\n\t\t\t\treturn;\n\t\t\tif(h[x] >= h[y]) {\n\t\t\t\tg[y] = x;\n\t\t\t\tif(h[x] == h[y])\n\t\t\t\t\th[x]++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tg[x] = y;\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n\tstatic int[] getPi(char[] a) {\n\t\tint m = a.length;\n\t\tint j = 0;\n\t\tint[] pi = new int[m];\n\t\tfor(int i = 1; i < m; ++i) {\n\t\t\twhile(j > 0 && a[i] != a[j])\n\t\t\t\tj = pi[j-1];\n\t\t\tif(a[i] == a[j]) {\n\t\t\t\tpi[i] = j + 1;\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t\treturn pi;\n\t}\n\t\n\tstatic long lcm(long a, long b) {\n\t\treturn a * b / gcd(a, b);\n\t}\n\t\n\tstatic boolean nextPermutation(int[] a) {\n\t\tfor(int i = a.length - 2; i >= 0; --i) {\n\t\t\tif(a[i] < a[i+1]) {\n\t\t\t\tfor(int j = a.length - 1; ; --j) {\n\t\t\t\t\tif(a[i] < a[j]) {\n\t\t\t\t\t\tint t = a[i];\n\t\t\t\t\t\ta[i] = a[j];\n\t\t\t\t\t\ta[j] = t;\n\t\t\t\t\t\tfor(i++, j = a.length - 1; i < j; ++i, --j) {\n\t\t\t\t\t\t\tt = a[i];\n\t\t\t\t\t\t\ta[i] = a[j];\n\t\t\t\t\t\t\ta[j] = t;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\t\n\t\n\tstatic void shuffle(int[] a) {\n\t\tRandom r = new Random();\n\t\tfor(int i = a.length - 1; i > 0; --i) {\n\t\t\tint si = r.nextInt(i);\n\t\t\tint t = a[si];\n\t\t\ta[si] = a[i];\n\t\t\ta[i] = t;\n\t\t}\n\t}\n\t\n\tstatic void shuffle(long[] a) {\n\t\tRandom r = new Random();\n\t\tfor(int i = a.length - 1; i > 0; --i) {\n\t\t\tint si = r.nextInt(i);\n\t\t\tlong t = a[si];\n\t\t\ta[si] = a[i];\n\t\t\ta[i] = t;\n\t\t}\n\t}\n\t\n\tstatic int lower_bound(int[] a, int n, int k) {\n\t\tint s = 0;\n\t\tint e = n;\n\t\tint m;\n\t\twhile (e - s > 0) {\n\t\t\tm = (s + e) / 2;\n\t\t\tif (a[m] < k)\n\t\t\t\ts = m + 1;\n\t\t\telse\n\t\t\t\te = m;\n\t\t}\n\t\treturn e;\n\t}\n\tstatic int lower_bound(long[] a, int n, long k) {\n\t\tint s = 0;\n\t\tint e = n;\n\t\tint m;\n\t\twhile (e - s > 0) {\n\t\t\tm = (s + e) / 2;\n\t\t\tif (a[m] < k)\n\t\t\t\ts = m + 1;\n\t\t\telse\n\t\t\t\te = m;\n\t\t}\n\t\treturn e;\n\t}\n\t\n\tstatic int gcd(int a, int b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\tstatic long gcd(long a, long b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\t\n\tstatic class Pair implements Comparable {\n\t\tint first, second;\n \n\t\tpublic Pair(int first, int second) {\n\t\t\tsuper();\n\t\t\tthis.first = first;\n\t\t\tthis.second = second;\n\t\t}\n \n\t\t@Override\n\t\tpublic int compareTo(Pair o) {\n\t\t\treturn this.first != o.first ? this.first - o.first : this.second - o.second;\n\t\t}\n\t\t\n//\t\t@Override\n//\t\tpublic int compareTo(Pair o) {\n//\t\t\treturn this.first != o.first ? o.first - this.first : o.second - this.second;\n//\t\t}\n \n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tfinal int prime = 31;\n\t\t\tint result = 1;\n\t\t\tresult = prime * result + first;\n\t\t\tresult = prime * result + second;\n\t\t\treturn result;\n\t\t}\n \n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (this == obj)\n\t\t\t\treturn true;\n\t\t\tif (obj == null)\n\t\t\t\treturn false;\n\t\t\tif (getClass() != obj.getClass())\n\t\t\t\treturn false;\n\t\t\tPair other = (Pair) obj;\n\t\t\tif (first != other.first)\n\t\t\t\treturn false;\n\t\t\tif (second != other.second)\n\t\t\t\treturn false;\n\t\t\treturn true;\n\t\t}\n\t}\n}\n \n \n \nclass InputReader {\n \n\tprivate final InputStream stream;\n\tprivate final byte[] buf = new byte[8192];\n\tprivate int curChar, snumChars;\n \n\tpublic InputReader(InputStream st) {\n\t\tthis.stream = st;\n\t}\n \n\tpublic int read() {\n\t\tif (snumChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= snumChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tsnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (snumChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n \n\tpublic int nextInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tpublic long nextLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tpublic int[] nextIntArray(int n) {\n\t\tint a[] = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = nextInt();\n\t\t}\n\t\treturn a;\n\t}\n \n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n \n\tpublic String nextLine() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isEndOfLine(c));\n\t\treturn res.toString();\n\t}\n \n\tpublic boolean isSpaceChar(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n \n\tprivate boolean isEndOfLine(int c) {\n\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t}\n \n}", "language": "Java", "metadata": {"date": 1569719434, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02899.html", "problem_id": "p02899", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02899/input.txt", "sample_output_relpath": "derived/input_output/data/p02899/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02899/Java/s926259887.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s926259887", "user_id": "u990857161"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n \n \n \npublic class Main {\n\t\n\tstatic InputReader in = new InputReader(System.in);\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\t\n\tstatic int oo = (int)1e9;\n\tstatic int mod = 1_000_000_007;\n\t\n\tstatic int[] di = {-1, 1, 0, 0};\n\tstatic int[] dj = {0, 0, -1, 1};\n\n\tstatic int[][] memo;\n\t\n\tpublic static void main(String[] args) throws IOException {\n \n\t\tint n = in.nextInt();\n\t\tint[] ans = new int[n+1];\n\t\tfor(int i = 1; i <= n; ++i) {\n\t\t\tint x = in.nextInt();\n\t\t\tans[x] = i;\n\t\t}\n\t\tfor(int i = 1; i <= n; ++i) {\n\t\t\tSystem.out.print(ans[i] + \" \");\n\t\t}\n\t\t\n\t\tout.close();\n\t}\n\t\n\t\n\tstatic class SegmentTree {\n\t\tint n;\n\t\tlong[] a, seg;\n\t\tint DEFAULT_VALUE = 0;\n\t\t\n\t\tpublic SegmentTree(long[] a, int n) {\n\t\t\tsuper();\n\t\t\tthis.a = a;\n\t\t\tthis.n = n;\n\t\t\tseg = new long[n * 4 + 1];\n\t\t\tbuild(1, 0, n-1);\n\t\t}\n\t\t\n\t\tprivate long build(int node, int i, int j) {\n\t\t\tif(i == j)\n\t\t\t\treturn seg[node] = a[i];\n\t\t\tlong first = build(node * 2, i, (i+j) / 2);\n\t\t\tlong second = build(node * 2 + 1, (i+j) / 2 + 1, j);\n\t\t\treturn seg[node] = combine(first, second);\n\t\t}\n\t\t\n\t\tlong update(int k, long value) {\n\t\t\treturn update(1, 0, n-1, k, value);\n\t\t}\n\t\t\n\t\tprivate long update(int node, int i, int j, int k, long value) {\n\t\t\tif(k < i || k > j)\n\t\t\t\treturn seg[node];\n\t\t\tif(i == j && j == k) {\n\t\t\t\ta[k] = value;\n\t\t\t\tseg[node] = value;\n\t\t\t\treturn value;\n\t\t\t}\n\t\t\t\n\t\t\tint m = (i + j) / 2;\n\t\t\tlong first = update(node * 2, i, m, k, value);\n\t\t\tlong second = update(node * 2 + 1, m + 1, j, k, value);\n\t\t\treturn seg[node] = combine(first, second);\n\t\t}\n\t\t\n\t\tlong query(int l, int r) {\n\t\t\treturn query(1, 0, n-1, l, r);\n\t\t}\n\t\t\n\t\tprivate long query(int node, int i, int j, int l, int r) {\n\t\t\tif(l <= i && j <= r)\n\t\t\t\treturn seg[node];\n\t\t\tif(j < l || i > r)\n\t\t\t\treturn DEFAULT_VALUE;\n\t\t\tint m = (i + j) / 2;\n\t\t\tlong first = query(node * 2, i, m, l, r);\n\t\t\tlong second = query(node * 2 + 1, m+1, j, l, r);\n\t\t\treturn combine(first, second);\n\t\t}\n \n\t\tprivate long combine(long a, long b) {\n\t\t\treturn a + b;\n\t\t}\n\t}\n\t\n\tstatic class DisjointSet {\n\t\tint n;\n\t\tint[] g;\n\t\tint[] h;\n\t\tpublic DisjointSet(int n) {\n\t\t\tsuper();\n\t\t\tthis.n = n;\n\t\t\tg = new int[n];\n\t\t\th = new int[n];\n\t\t\tfor(int i = 0; i < n; ++i) {\n\t\t\t\tg[i] = i;\n\t\t\t\th[i] = 1;\n\t\t\t}\n\t\t}\n\t\tint find(int x) {\n\t\t\tif(g[x] == x)\n\t\t\t\treturn x;\n\t\t\treturn g[x] = find(g[x]);\n\t\t}\n\t\tvoid union(int x, int y) {\n\t\t\tx = find(x); y = find(y);\n\t\t\tif(x == y)\n\t\t\t\treturn;\n\t\t\tif(h[x] >= h[y]) {\n\t\t\t\tg[y] = x;\n\t\t\t\tif(h[x] == h[y])\n\t\t\t\t\th[x]++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tg[x] = y;\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n\tstatic int[] getPi(char[] a) {\n\t\tint m = a.length;\n\t\tint j = 0;\n\t\tint[] pi = new int[m];\n\t\tfor(int i = 1; i < m; ++i) {\n\t\t\twhile(j > 0 && a[i] != a[j])\n\t\t\t\tj = pi[j-1];\n\t\t\tif(a[i] == a[j]) {\n\t\t\t\tpi[i] = j + 1;\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t\treturn pi;\n\t}\n\t\n\tstatic long lcm(long a, long b) {\n\t\treturn a * b / gcd(a, b);\n\t}\n\t\n\tstatic boolean nextPermutation(int[] a) {\n\t\tfor(int i = a.length - 2; i >= 0; --i) {\n\t\t\tif(a[i] < a[i+1]) {\n\t\t\t\tfor(int j = a.length - 1; ; --j) {\n\t\t\t\t\tif(a[i] < a[j]) {\n\t\t\t\t\t\tint t = a[i];\n\t\t\t\t\t\ta[i] = a[j];\n\t\t\t\t\t\ta[j] = t;\n\t\t\t\t\t\tfor(i++, j = a.length - 1; i < j; ++i, --j) {\n\t\t\t\t\t\t\tt = a[i];\n\t\t\t\t\t\t\ta[i] = a[j];\n\t\t\t\t\t\t\ta[j] = t;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\t\n\t\n\tstatic void shuffle(int[] a) {\n\t\tRandom r = new Random();\n\t\tfor(int i = a.length - 1; i > 0; --i) {\n\t\t\tint si = r.nextInt(i);\n\t\t\tint t = a[si];\n\t\t\ta[si] = a[i];\n\t\t\ta[i] = t;\n\t\t}\n\t}\n\t\n\tstatic void shuffle(long[] a) {\n\t\tRandom r = new Random();\n\t\tfor(int i = a.length - 1; i > 0; --i) {\n\t\t\tint si = r.nextInt(i);\n\t\t\tlong t = a[si];\n\t\t\ta[si] = a[i];\n\t\t\ta[i] = t;\n\t\t}\n\t}\n\t\n\tstatic int lower_bound(int[] a, int n, int k) {\n\t\tint s = 0;\n\t\tint e = n;\n\t\tint m;\n\t\twhile (e - s > 0) {\n\t\t\tm = (s + e) / 2;\n\t\t\tif (a[m] < k)\n\t\t\t\ts = m + 1;\n\t\t\telse\n\t\t\t\te = m;\n\t\t}\n\t\treturn e;\n\t}\n\tstatic int lower_bound(long[] a, int n, long k) {\n\t\tint s = 0;\n\t\tint e = n;\n\t\tint m;\n\t\twhile (e - s > 0) {\n\t\t\tm = (s + e) / 2;\n\t\t\tif (a[m] < k)\n\t\t\t\ts = m + 1;\n\t\t\telse\n\t\t\t\te = m;\n\t\t}\n\t\treturn e;\n\t}\n\t\n\tstatic int gcd(int a, int b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\tstatic long gcd(long a, long b) {\n\t\treturn b == 0 ? a : gcd(b, a % b);\n\t}\n\t\n\tstatic class Pair implements Comparable {\n\t\tint first, second;\n \n\t\tpublic Pair(int first, int second) {\n\t\t\tsuper();\n\t\t\tthis.first = first;\n\t\t\tthis.second = second;\n\t\t}\n \n\t\t@Override\n\t\tpublic int compareTo(Pair o) {\n\t\t\treturn this.first != o.first ? this.first - o.first : this.second - o.second;\n\t\t}\n\t\t\n//\t\t@Override\n//\t\tpublic int compareTo(Pair o) {\n//\t\t\treturn this.first != o.first ? o.first - this.first : o.second - this.second;\n//\t\t}\n \n\t\t@Override\n\t\tpublic int hashCode() {\n\t\t\tfinal int prime = 31;\n\t\t\tint result = 1;\n\t\t\tresult = prime * result + first;\n\t\t\tresult = prime * result + second;\n\t\t\treturn result;\n\t\t}\n \n\t\t@Override\n\t\tpublic boolean equals(Object obj) {\n\t\t\tif (this == obj)\n\t\t\t\treturn true;\n\t\t\tif (obj == null)\n\t\t\t\treturn false;\n\t\t\tif (getClass() != obj.getClass())\n\t\t\t\treturn false;\n\t\t\tPair other = (Pair) obj;\n\t\t\tif (first != other.first)\n\t\t\t\treturn false;\n\t\t\tif (second != other.second)\n\t\t\t\treturn false;\n\t\t\treturn true;\n\t\t}\n\t}\n}\n \n \n \nclass InputReader {\n \n\tprivate final InputStream stream;\n\tprivate final byte[] buf = new byte[8192];\n\tprivate int curChar, snumChars;\n \n\tpublic InputReader(InputStream st) {\n\t\tthis.stream = st;\n\t}\n \n\tpublic int read() {\n\t\tif (snumChars == -1)\n\t\t\tthrow new InputMismatchException();\n\t\tif (curChar >= snumChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tsnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (snumChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n \n\tpublic int nextInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tpublic long nextLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n \n\tpublic int[] nextIntArray(int n) {\n\t\tint a[] = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = nextInt();\n\t\t}\n\t\treturn a;\n\t}\n \n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n \n\tpublic String nextLine() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isEndOfLine(c));\n\t\treturn res.toString();\n\t}\n \n\tpublic boolean isSpaceChar(int c) {\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n \n\tprivate boolean isEndOfLine(int c) {\n\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t}\n \n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "sample_input": "3\n2 3 1\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02899", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7004, "cpu_time_ms": 416, "memory_kb": 41920}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s815445823", "group_id": "codeNet:p02900", "input_text": "import java.util.*;\n \npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n long a = sc.nextLong();\n long b = sc.nextLong();\n HashSet al = getPrimeFactorization(a);\n HashSet bl = getPrimeFactorization(b);\n int prime = 1;\n for(long p : bl){\n if(al.contains(p)){\n prime++;\n }\n }\n System.out.println(prime);\n }\n \n static HashSet getPrimeFactorization(long x) {\n HashSet result = new HashSet();\n while (x >= 2 && x % 2 == 0) {\n result.add(2L);\n x /= 2;\n }\n long d = 3;\n long q = x / d;\n while (q >= d) {\n if (x % d == 0) {\n result.add(d);\n x = q;\n } else {\n d += 2;\n }\n q = x / d;\n }\n result.add(x);\n return result;\n }\n}", "language": "Java", "metadata": {"date": 1587658325, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02900.html", "problem_id": "p02900", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02900/input.txt", "sample_output_relpath": "derived/input_output/data/p02900/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02900/Java/s815445823.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s815445823", "user_id": "u578775554"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n \npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n long a = sc.nextLong();\n long b = sc.nextLong();\n HashSet al = getPrimeFactorization(a);\n HashSet bl = getPrimeFactorization(b);\n int prime = 1;\n for(long p : bl){\n if(al.contains(p)){\n prime++;\n }\n }\n System.out.println(prime);\n }\n \n static HashSet getPrimeFactorization(long x) {\n HashSet result = new HashSet();\n while (x >= 2 && x % 2 == 0) {\n result.add(2L);\n x /= 2;\n }\n long d = 3;\n long q = x / d;\n while (q >= d) {\n if (x % d == 0) {\n result.add(d);\n x = q;\n } else {\n d += 2;\n }\n q = x / d;\n }\n result.add(x);\n return result;\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 999, "cpu_time_ms": 123, "memory_kb": 21972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s719243471", "group_id": "codeNet:p02901", "input_text": "\nimport java.util.Scanner;\n\npublic class Main {\n public static void debug(String str) {\n System.out.println(str);\n }\n\n public static void main(String[] args) {\n\n int N;\n int M;\n int[] am;\n int[] bm;\n int[][] cibi;\n\n try (Scanner sc = new Scanner(System.in)) {\n N = sc.nextInt();\n M = sc.nextInt();\n am = new int[M];\n bm = new int[M];\n cibi = new int[M][];\n for(int i =0;i < M;i++){\n am[i] = sc.nextInt();\n bm[i] = sc.nextInt();\n cibi[i] = new int[bm[i]];\n int v = 0;\n for(int temp :cibi[i]){\n cibi[i][v] = sc.nextInt();\n v++;\n }\n\n }\n }\n long dp[] = new long[1 << N];\n for (int i = 0; i < dp.length; i++) {\n dp[i] = 1000000009;\n }\n dp[0] =0;\n //鍵 1→Mまで\n for(int i=1;i<=M;i++){\n //i番目を使って移動する集合\n int set = 0;\n for(int j = 0;j < cibi[i-1].length;j++){\n set = set | (1 << (cibi[i-1][j] -1));\n }\n for(int s = 0;s < (1< dp[s]+am[i-1]){\n dp[s|set] =dp[s]+am[i-1];\n }\n }\n\n }\n if(dp[(1 << N)-1] == 1000000009){\n dp[(1 << N)-1] = -1;\n }\n\n System.out.println(dp[(1 << N)-1]);\n\n }\n\n}\n", "language": "Java", "metadata": {"date": 1571665623, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02901.html", "problem_id": "p02901", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02901/input.txt", "sample_output_relpath": "derived/input_output/data/p02901/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02901/Java/s719243471.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s719243471", "user_id": "u499889187"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "\nimport java.util.Scanner;\n\npublic class Main {\n public static void debug(String str) {\n System.out.println(str);\n }\n\n public static void main(String[] args) {\n\n int N;\n int M;\n int[] am;\n int[] bm;\n int[][] cibi;\n\n try (Scanner sc = new Scanner(System.in)) {\n N = sc.nextInt();\n M = sc.nextInt();\n am = new int[M];\n bm = new int[M];\n cibi = new int[M][];\n for(int i =0;i < M;i++){\n am[i] = sc.nextInt();\n bm[i] = sc.nextInt();\n cibi[i] = new int[bm[i]];\n int v = 0;\n for(int temp :cibi[i]){\n cibi[i][v] = sc.nextInt();\n v++;\n }\n\n }\n }\n long dp[] = new long[1 << N];\n for (int i = 0; i < dp.length; i++) {\n dp[i] = 1000000009;\n }\n dp[0] =0;\n //鍵 1→Mまで\n for(int i=1;i<=M;i++){\n //i番目を使って移動する集合\n int set = 0;\n for(int j = 0;j < cibi[i-1].length;j++){\n set = set | (1 << (cibi[i-1][j] -1));\n }\n for(int s = 0;s < (1< dp[s]+am[i-1]){\n dp[s|set] =dp[s]+am[i-1];\n }\n }\n\n }\n if(dp[(1 << N)-1] == 1000000009){\n dp[(1 << N)-1] = -1;\n }\n\n System.out.println(dp[(1 << N)-1]);\n\n }\n\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N locked treasure boxes, numbered 1 to N.\n\nA shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of times.\n\nFind the minimum cost required to unlock all the treasure boxes. If it is impossible to unlock all of them, print -1.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 12\n\n1 \\leq M \\leq 10^3\n\n1 \\leq a_i \\leq 10^5\n\n1 \\leq b_i \\leq N\n\n1 \\leq c_{i1} < c_{i2} < ... < c_{i{b_i}} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\nc_{11} c_{12} ... c_{1{b_1}}\n:\na_M b_M\nc_{M1} c_{M2} ... c_{M{b_M}}\n\nOutput\n\nPrint the minimum cost required to unlock all the treasure boxes.\nIf it is impossible to unlock all of them, print -1.\n\nSample Input 1\n\n2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n\nSample Output 1\n\n25\n\nWe can unlock all the boxes by purchasing the first and second keys, at the cost of 25 yen, which is the minimum cost required.\n\nSample Input 2\n\n12 1\n100000 1\n2\n\nSample Output 2\n\n-1\n\nWe cannot unlock all the boxes.\n\nSample Input 3\n\n4 6\n67786 3\n1 3 4\n3497 1\n2\n44908 3\n2 3 4\n2156 3\n2 3 4\n26230 1\n2\n86918 1\n3\n\nSample Output 3\n\n69942", "sample_input": "2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n"}, "reference_outputs": ["25\n"], "source_document_id": "p02901", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N locked treasure boxes, numbered 1 to N.\n\nA shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of times.\n\nFind the minimum cost required to unlock all the treasure boxes. If it is impossible to unlock all of them, print -1.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 12\n\n1 \\leq M \\leq 10^3\n\n1 \\leq a_i \\leq 10^5\n\n1 \\leq b_i \\leq N\n\n1 \\leq c_{i1} < c_{i2} < ... < c_{i{b_i}} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\nc_{11} c_{12} ... c_{1{b_1}}\n:\na_M b_M\nc_{M1} c_{M2} ... c_{M{b_M}}\n\nOutput\n\nPrint the minimum cost required to unlock all the treasure boxes.\nIf it is impossible to unlock all of them, print -1.\n\nSample Input 1\n\n2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n\nSample Output 1\n\n25\n\nWe can unlock all the boxes by purchasing the first and second keys, at the cost of 25 yen, which is the minimum cost required.\n\nSample Input 2\n\n12 1\n100000 1\n2\n\nSample Output 2\n\n-1\n\nWe cannot unlock all the boxes.\n\nSample Input 3\n\n4 6\n67786 3\n1 3 4\n3497 1\n2\n44908 3\n2 3 4\n2156 3\n2 3 4\n26230 1\n2\n86918 1\n3\n\nSample Output 3\n\n69942", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1524, "cpu_time_ms": 232, "memory_kb": 32840}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s799904965", "group_id": "codeNet:p02910", "input_text": "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n\n int cnt=0;\n\n for(int i =0;i 0 ) result[num] = true;\n\t\t}\n\n\t\tfor ( int i = 1; i <= n; i++ ) {\n\t\t\tif ( point[i] > 0 ) System.out.println(\"Yes\");\n\t\t\telse System.out.println(\"No\");\n\n\t\t}\n\t\t\n//\t\tfor ( int i = 1; i <= n; i++ ) {\n//\t\t\tSystem.out.println(point[i]);\n//\t\t}\n\n\t\tin.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1568597430, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02911.html", "problem_id": "p02911", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02911/input.txt", "sample_output_relpath": "derived/input_output/data/p02911/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02911/Java/s406920940.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s406920940", "user_id": "u605722824"}, "prompt_components": {"gold_output": "No\nNo\nYes\nNo\nNo\nNo\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tint k = in.nextInt();\n\t\tint q = in.nextInt();\n\n\t\tint[] point = new int[n + 1]; // i番目の選手のポイント\n\t\tboolean[] result = new boolean[n + 1];\n\t\tArrays.fill(point, -q+k);\n\n\t\tfor ( int i = 1; i <= q; i++ ) {\n\t\t\tint num = in.nextInt();\n\t\t\tpoint[num]++;\n\t\t\tif ( point[num] > 0 ) result[num] = true;\n\t\t}\n\n\t\tfor ( int i = 1; i <= n; i++ ) {\n\t\t\tif ( point[i] > 0 ) System.out.println(\"Yes\");\n\t\t\telse System.out.println(\"No\");\n\n\t\t}\n\t\t\n//\t\tfor ( int i = 1; i <= n; i++ ) {\n//\t\t\tSystem.out.println(point[i]);\n//\t\t}\n\n\t\tin.close();\n\t}\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.\n\nA game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.\n\nWhen a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.\n\nAt the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.\n\nIn the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.\nFor Kizahashi, write a program that determines whether each of the N players survived this game.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq A_i \\leq N\\ (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K Q\nA_1\nA_2\n.\n.\n.\nA_Q\n\nOutput\n\nPrint N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.\n\nSample Input 1\n\n6 3 4\n3\n1\n3\n2\n\nSample Output 1\n\nNo\nNo\nYes\nNo\nNo\nNo\n\nIn the beginning, the players' scores are (3, 3, 3, 3, 3, 3).\n\nPlayer 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).\n\nPlayer 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).\n\nPlayer 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).\n\nPlayer 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).\n\nPlayers 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.\n\nSample Input 2\n\n6 5 4\n3\n1\n3\n2\n\nSample Output 2\n\nYes\nYes\nYes\nYes\nYes\nYes\n\nSample Input 3\n\n10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo", "sample_input": "6 3 4\n3\n1\n3\n2\n"}, "reference_outputs": ["No\nNo\nYes\nNo\nNo\nNo\n"], "source_document_id": "p02911", "source_text": "Score: 300 points\n\nProblem Statement\n\nTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.\n\nA game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.\n\nWhen a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.\n\nAt the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.\n\nIn the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.\nFor Kizahashi, write a program that determines whether each of the N players survived this game.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq A_i \\leq N\\ (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K Q\nA_1\nA_2\n.\n.\n.\nA_Q\n\nOutput\n\nPrint N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.\n\nSample Input 1\n\n6 3 4\n3\n1\n3\n2\n\nSample Output 1\n\nNo\nNo\nYes\nNo\nNo\nNo\n\nIn the beginning, the players' scores are (3, 3, 3, 3, 3, 3).\n\nPlayer 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).\n\nPlayer 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).\n\nPlayer 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).\n\nPlayer 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).\n\nPlayers 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.\n\nSample Input 2\n\n6 5 4\n3\n1\n3\n2\n\nSample Output 2\n\nYes\nYes\nYes\nYes\nYes\nYes\n\nSample Input 3\n\n10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 717, "cpu_time_ms": 975, "memory_kb": 55704}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s297077477", "group_id": "codeNet:p02915", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint N = Integer.parseInt(scan.next());\n\t\t\n\t\tscan.close();\n\t\t\n System.out.println(N * N * N);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1569291029, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02915.html", "problem_id": "p02915", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02915/input.txt", "sample_output_relpath": "derived/input_output/data/p02915/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02915/Java/s297077477.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s297077477", "user_id": "u928621155"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint N = Integer.parseInt(scan.next());\n\t\t\n\t\tscan.close();\n\t\t\n System.out.println(N * N * N);\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "sample_input": "2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02915", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 240, "cpu_time_ms": 89, "memory_kb": 23252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s139436976", "group_id": "codeNet:p02915", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\t\n\t\tSystem.out.println(Math.pow(n, 3));\n\t}\n}", "language": "Java", "metadata": {"date": 1567910000, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02915.html", "problem_id": "p02915", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02915/input.txt", "sample_output_relpath": "derived/input_output/data/p02915/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02915/Java/s139436976.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s139436976", "user_id": "u862553306"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\t\n\t\tSystem.out.println(Math.pow(n, 3));\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "sample_input": "2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02915", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 100, "memory_kb": 21972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s525713056", "group_id": "codeNet:p02916", "input_text": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStreamReader isr;\n\t\tBufferedReader br;\n\t\ttry {\n\t \t\tbr = createBufferedReader();\n\t String line = br.readLine();\n\t \tfinal int n = Integer.parseInt(line);\n\t if (n < 2 || n > 20) {\n\t \tthrow new IllegalArgumentException();\n\t }\n\t int[] a = new int[n];\n\t int[] b = new int[n];\n\t int[] c = new int[n - 1];\n\t line = br.readLine();\n\t StringTokenizer st = new StringTokenizer(line, \" \");\n\t for (int i = 0; i < n; i++) {\n\t \ta[i] = Integer.parseInt(st.nextToken());\n\t }\n\t line = br.readLine();\n\t st = new StringTokenizer(line, \" \");\n\t for (int i = 0; i < n; i++) {\n\t \tb[i] = Integer.parseInt(st.nextToken());\n\t }\n\t line = br.readLine();\n\t st = new StringTokenizer(line, \" \");\n\t for (int i = 0; i < n - 1; i++) {\n\t \tc[i] = Integer.parseInt(st.nextToken());\n\t }\n\t int result = 0;\n\t for (int i = 0; i < n; i++) {\n\t \tresult += b[a[i] - 1];\n\t \tif (i > 0 && a[i] - a[i - 1] == 1) {\n\t \t\tresult += c[a[i] - 2];\n\t \t}\n\t }\n\t System.out.println(result);\n\t\t} catch (IOException ioe) {\n\t\t\tioe.printStackTrace();\n\t\t} catch (IllegalArgumentException iae) {\n\t\t\tiae.printStackTrace();\n\t\t\tSystem.err.println(\"入力が正しくありません。\");\n\t\t}\n\t}\n\n\t// 以下問題問わずに共通部分\n\t// 標準入力の BufferedReader を返す.\n\tprivate static BufferedReader createBufferedReader() {\n\t\tInputStreamReader isr =new InputStreamReader(System.in);\n\t \treturn new BufferedReader(isr);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1567905439, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02916.html", "problem_id": "p02916", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02916/input.txt", "sample_output_relpath": "derived/input_output/data/p02916/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02916/Java/s525713056.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s525713056", "user_id": "u917917206"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStreamReader isr;\n\t\tBufferedReader br;\n\t\ttry {\n\t \t\tbr = createBufferedReader();\n\t String line = br.readLine();\n\t \tfinal int n = Integer.parseInt(line);\n\t if (n < 2 || n > 20) {\n\t \tthrow new IllegalArgumentException();\n\t }\n\t int[] a = new int[n];\n\t int[] b = new int[n];\n\t int[] c = new int[n - 1];\n\t line = br.readLine();\n\t StringTokenizer st = new StringTokenizer(line, \" \");\n\t for (int i = 0; i < n; i++) {\n\t \ta[i] = Integer.parseInt(st.nextToken());\n\t }\n\t line = br.readLine();\n\t st = new StringTokenizer(line, \" \");\n\t for (int i = 0; i < n; i++) {\n\t \tb[i] = Integer.parseInt(st.nextToken());\n\t }\n\t line = br.readLine();\n\t st = new StringTokenizer(line, \" \");\n\t for (int i = 0; i < n - 1; i++) {\n\t \tc[i] = Integer.parseInt(st.nextToken());\n\t }\n\t int result = 0;\n\t for (int i = 0; i < n; i++) {\n\t \tresult += b[a[i] - 1];\n\t \tif (i > 0 && a[i] - a[i - 1] == 1) {\n\t \t\tresult += c[a[i] - 2];\n\t \t}\n\t }\n\t System.out.println(result);\n\t\t} catch (IOException ioe) {\n\t\t\tioe.printStackTrace();\n\t\t} catch (IllegalArgumentException iae) {\n\t\t\tiae.printStackTrace();\n\t\t\tSystem.err.println(\"入力が正しくありません。\");\n\t\t}\n\t}\n\n\t// 以下問題問わずに共通部分\n\t// 標準入力の BufferedReader を返す.\n\tprivate static BufferedReader createBufferedReader() {\n\t\tInputStreamReader isr =new InputStreamReader(System.in);\n\t \treturn new BufferedReader(isr);\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dish 2, \\ldots, Dish N) once.\n\nThe i-th dish (1 \\leq i \\leq N) he ate was Dish A_i.\n\nWhen he eats Dish i (1 \\leq i \\leq N), he gains B_i satisfaction points.\n\nAdditionally, when he eats Dish i+1 just after eating Dish i (1 \\leq i \\leq N - 1), he gains C_i more satisfaction points.\n\nFind the sum of the satisfaction points he gained.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 20\n\n1 \\leq A_i \\leq N\n\nA_1, A_2, ..., A_N are all different.\n\n1 \\leq B_i \\leq 50\n\n1 \\leq C_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\nC_1 C_2 ... C_{N-1}\n\nOutput\n\nPrint the sum of the satisfaction points Takahashi gained, as an integer.\n\nSample Input 1\n\n3\n3 1 2\n2 5 4\n3 6\n\nSample Output 1\n\n14\n\nTakahashi gained 14 satisfaction points in total, as follows:\n\nFirst, he ate Dish 3 and gained 4 satisfaction points.\n\nNext, he ate Dish 1 and gained 2 satisfaction points.\n\nLastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.\n\nSample Input 2\n\n4\n2 3 4 1\n13 5 8 24\n45 9 15\n\nSample Output 2\n\n74\n\nSample Input 3\n\n2\n1 2\n50 50\n50\n\nSample Output 3\n\n150", "sample_input": "3\n3 1 2\n2 5 4\n3 6\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02916", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dish 2, \\ldots, Dish N) once.\n\nThe i-th dish (1 \\leq i \\leq N) he ate was Dish A_i.\n\nWhen he eats Dish i (1 \\leq i \\leq N), he gains B_i satisfaction points.\n\nAdditionally, when he eats Dish i+1 just after eating Dish i (1 \\leq i \\leq N - 1), he gains C_i more satisfaction points.\n\nFind the sum of the satisfaction points he gained.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 20\n\n1 \\leq A_i \\leq N\n\nA_1, A_2, ..., A_N are all different.\n\n1 \\leq B_i \\leq 50\n\n1 \\leq C_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\nC_1 C_2 ... C_{N-1}\n\nOutput\n\nPrint the sum of the satisfaction points Takahashi gained, as an integer.\n\nSample Input 1\n\n3\n3 1 2\n2 5 4\n3 6\n\nSample Output 1\n\n14\n\nTakahashi gained 14 satisfaction points in total, as follows:\n\nFirst, he ate Dish 3 and gained 4 satisfaction points.\n\nNext, he ate Dish 1 and gained 2 satisfaction points.\n\nLastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.\n\nSample Input 2\n\n4\n2 3 4 1\n13 5 8 24\n45 9 15\n\nSample Output 2\n\n74\n\nSample Input 3\n\n2\n1 2\n50 50\n50\n\nSample Output 3\n\n150", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1692, "cpu_time_ms": 79, "memory_kb": 22612}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s104787980", "group_id": "codeNet:p02917", "input_text": "import java.io.BufferedOutputStream;\nimport java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Comparator;\nimport java.util.LinkedHashMap;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\nimport java.util.stream.Collectors;\n\nclass Main {\n\n private static PrintWriter out;\n\n private static void mprintln(Object... ar) {\n for (Object i : ar) {\n out.print(i + \" \");\n }\n out.println();\n }\n\n public static void main(String[] args) throws FileNotFoundException {\n\n // Input from file\n // File inputFile = new File(\"JavaFile.txt\");\n // File outputFile = new File(\"JavaOutputFile.txt\");\n // FileReader fileReader = new FileReader(inputFile);\n // Here it ends\n\n MyScanner sc = new MyScanner();\n // MyScanner sc = new MyScanner(fileReader);\n\n out = new PrintWriter(new BufferedOutputStream(System.out)); // Output to console\n // out = new PrintWriter(new PrintStream(outputFile)); // Output to file\n\n getAns(sc);\n\n out.close();\n }\n\n /*\n *Don't use builtin function (Math.ceil)\n */\n\n static final long MOD = (long) (1e9 + 7);\n\n private static void getAns(MyScanner sc) {\n int n = sc.ni();\n int[] br = sc.niArr0(n - 1);\n int ans = br[0] + br[n - 2];\n\n for(int i = 1; i < n - 1; i++) ans += Integer.min(br[i], br[i - 1]);\n\n out.println(ans);\n }\n\n static class MyScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n MyScanner(FileReader fileReader) {\n br = new BufferedReader(fileReader);\n }\n\n MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String nn() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n String nextLine() {\n String ans = \"\";\n try {\n ans = br.readLine();\n } catch (IOException ex) {\n ex.printStackTrace();\n }\n return ans;\n }\n\n char nc() {\n return nn().charAt(0);\n }\n\n int ni() {\n return Integer.parseInt(nn());\n }\n\n long nl() {\n return Long.parseLong(nn());\n }\n\n double nd() {\n return Double.parseDouble(nn());\n }\n\n int[] niArr0(int n) {\n int[] ar = new int[n];\n for (int i = 0; i < n; i++) {\n ar[i] = ni();\n }\n return ar;\n }\n\n int[] niArr1(int n) {\n int[] ar = new int[n + 1];\n for (int i = 1; i <= n; i++) {\n ar[i] = ni();\n }\n return ar;\n }\n\n long[] nlArr0(int n) {\n long[] ar = new long[n];\n for (int i = 0; i < n; i++) {\n ar[i] = nl();\n }\n return ar;\n }\n\n long[] nlArr1(int n) {\n long[] ar = new long[n + 1];\n for (int i = 1; i <= n; i++) {\n ar[i] = nl();\n }\n return ar;\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1568050556, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02917.html", "problem_id": "p02917", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02917/input.txt", "sample_output_relpath": "derived/input_output/data/p02917/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02917/Java/s104787980.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s104787980", "user_id": "u420105436"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.io.BufferedOutputStream;\nimport java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Comparator;\nimport java.util.LinkedHashMap;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\nimport java.util.stream.Collectors;\n\nclass Main {\n\n private static PrintWriter out;\n\n private static void mprintln(Object... ar) {\n for (Object i : ar) {\n out.print(i + \" \");\n }\n out.println();\n }\n\n public static void main(String[] args) throws FileNotFoundException {\n\n // Input from file\n // File inputFile = new File(\"JavaFile.txt\");\n // File outputFile = new File(\"JavaOutputFile.txt\");\n // FileReader fileReader = new FileReader(inputFile);\n // Here it ends\n\n MyScanner sc = new MyScanner();\n // MyScanner sc = new MyScanner(fileReader);\n\n out = new PrintWriter(new BufferedOutputStream(System.out)); // Output to console\n // out = new PrintWriter(new PrintStream(outputFile)); // Output to file\n\n getAns(sc);\n\n out.close();\n }\n\n /*\n *Don't use builtin function (Math.ceil)\n */\n\n static final long MOD = (long) (1e9 + 7);\n\n private static void getAns(MyScanner sc) {\n int n = sc.ni();\n int[] br = sc.niArr0(n - 1);\n int ans = br[0] + br[n - 2];\n\n for(int i = 1; i < n - 1; i++) ans += Integer.min(br[i], br[i - 1]);\n\n out.println(ans);\n }\n\n static class MyScanner {\n\n BufferedReader br;\n StringTokenizer st;\n\n MyScanner(FileReader fileReader) {\n br = new BufferedReader(fileReader);\n }\n\n MyScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String nn() {\n while (st == null || !st.hasMoreElements()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n String nextLine() {\n String ans = \"\";\n try {\n ans = br.readLine();\n } catch (IOException ex) {\n ex.printStackTrace();\n }\n return ans;\n }\n\n char nc() {\n return nn().charAt(0);\n }\n\n int ni() {\n return Integer.parseInt(nn());\n }\n\n long nl() {\n return Long.parseLong(nn());\n }\n\n double nd() {\n return Double.parseDouble(nn());\n }\n\n int[] niArr0(int n) {\n int[] ar = new int[n];\n for (int i = 0; i < n; i++) {\n ar[i] = ni();\n }\n return ar;\n }\n\n int[] niArr1(int n) {\n int[] ar = new int[n + 1];\n for (int i = 1; i <= n; i++) {\n ar[i] = ni();\n }\n return ar;\n }\n\n long[] nlArr0(int n) {\n long[] ar = new long[n];\n for (int i = 0; i < n; i++) {\n ar[i] = nl();\n }\n return ar;\n }\n\n long[] nlArr1(int n) {\n long[] ar = new long[n + 1];\n for (int i = 1; i <= n; i++) {\n ar[i] = nl();\n }\n return ar;\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "sample_input": "3\n2 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02917", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3503, "cpu_time_ms": 81, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s740233637", "group_id": "codeNet:p02918", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int k = sc.nextInt();\n String str = sc.next();\n char c[] = str.toCharArray();\n char dir = c[0];\n \n int begin = 0;\n int end = n - 1;\n int flag = 0;\n for (int i = 0; i < n; i++) {\n if (dir != c[i]) {\n if (flag == 0) {\n begin = i;\n if (dir == 'L') {\n dir = 'R';\n } else {\n dir = 'L';\n }\n flag = 1;\n } else {\n end = i;\n dir = c[i];\n for (int j = begin; j < end; j++) {\n c[j] = dir;\n }\n begin = i;\n end = n - 1;\n k--;\n flag = 0;\n }\n }\n \n if (k == 0) {\n break;\n }\n }\n \n if (k > 0) {\n if (dir == 'L') {\n dir = 'R';\n } else {\n dir = 'L';\n }\n \n for (int i = begin; i < n; i++) {\n c[i] = dir;\n } \n }\n \n int count = 0;\n for (int i = 0; i < n; i++) {\n if (c[i] == 'L') {\n if (i == 0) continue;\n if (c[i - 1] == c[i]) {\n count++;\n }\n } else {\n if (i == n - 1) continue;\n if (c[i + 1] == c[i]) {\n count++;\n }\n }\n }\n \n System.out.println(count);\n }\n}\n", "language": "Java", "metadata": {"date": 1572909999, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02918.html", "problem_id": "p02918", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02918/input.txt", "sample_output_relpath": "derived/input_output/data/p02918/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02918/Java/s740233637.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s740233637", "user_id": "u273816974"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int k = sc.nextInt();\n String str = sc.next();\n char c[] = str.toCharArray();\n char dir = c[0];\n \n int begin = 0;\n int end = n - 1;\n int flag = 0;\n for (int i = 0; i < n; i++) {\n if (dir != c[i]) {\n if (flag == 0) {\n begin = i;\n if (dir == 'L') {\n dir = 'R';\n } else {\n dir = 'L';\n }\n flag = 1;\n } else {\n end = i;\n dir = c[i];\n for (int j = begin; j < end; j++) {\n c[j] = dir;\n }\n begin = i;\n end = n - 1;\n k--;\n flag = 0;\n }\n }\n \n if (k == 0) {\n break;\n }\n }\n \n if (k > 0) {\n if (dir == 'L') {\n dir = 'R';\n } else {\n dir = 'L';\n }\n \n for (int i = begin; i < n; i++) {\n c[i] = dir;\n } \n }\n \n int count = 0;\n for (int i = 0; i < n; i++) {\n if (c[i] == 'L') {\n if (i == 0) continue;\n if (c[i - 1] == c[i]) {\n count++;\n }\n } else {\n if (i == n - 1) continue;\n if (c[i + 1] == c[i]) {\n count++;\n }\n }\n }\n \n System.out.println(count);\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing in a queue from west to east.\n\nGiven is a string S of length N representing the directions of the people.\nThe i-th person from the west is facing west if the i-th character of S is L, and east if that character of S is R.\n\nA person is happy if the person in front of him/her is facing the same direction.\nIf no person is standing in front of a person, however, he/she is not happy.\n\nYou can perform the following operation any number of times between 0 and K (inclusive):\n\nOperation: Choose integers l and r such that 1 \\leq l \\leq r \\leq N, and rotate by 180 degrees the part of the queue: the l-th, (l+1)-th, ..., r-th persons. That is, for each i = 0, 1, ..., r-l, the (l + i)-th person from the west will stand the (r - i)-th from the west after the operation, facing east if he/she is facing west now, and vice versa.\n\nWhat is the maximum possible number of happy people you can have?\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\n|S| = N\n\nEach character of S is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of happy people after at most K operations.\n\nSample Input 1\n\n6 1\nLRLRRL\n\nSample Output 1\n\n3\n\nIf we choose (l, r) = (2, 5), we have LLLRLL, where the 2-nd, 3-rd, and 6-th persons from the west are happy.\n\nSample Input 2\n\n13 3\nLRRLRLRRLRLLR\n\nSample Output 2\n\n9\n\nSample Input 3\n\n10 1\nLLLLLRRRRR\n\nSample Output 3\n\n9\n\nSample Input 4\n\n9 2\nRRRLRLRLL\n\nSample Output 4\n\n7", "sample_input": "6 1\nLRLRRL\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02918", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing in a queue from west to east.\n\nGiven is a string S of length N representing the directions of the people.\nThe i-th person from the west is facing west if the i-th character of S is L, and east if that character of S is R.\n\nA person is happy if the person in front of him/her is facing the same direction.\nIf no person is standing in front of a person, however, he/she is not happy.\n\nYou can perform the following operation any number of times between 0 and K (inclusive):\n\nOperation: Choose integers l and r such that 1 \\leq l \\leq r \\leq N, and rotate by 180 degrees the part of the queue: the l-th, (l+1)-th, ..., r-th persons. That is, for each i = 0, 1, ..., r-l, the (l + i)-th person from the west will stand the (r - i)-th from the west after the operation, facing east if he/she is facing west now, and vice versa.\n\nWhat is the maximum possible number of happy people you can have?\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\n|S| = N\n\nEach character of S is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of happy people after at most K operations.\n\nSample Input 1\n\n6 1\nLRLRRL\n\nSample Output 1\n\n3\n\nIf we choose (l, r) = (2, 5), we have LLLRLL, where the 2-nd, 3-rd, and 6-th persons from the west are happy.\n\nSample Input 2\n\n13 3\nLRRLRLRRLRLLR\n\nSample Output 2\n\n9\n\nSample Input 3\n\n10 1\nLLLLLRRRRR\n\nSample Output 3\n\n9\n\nSample Input 4\n\n9 2\nRRRLRLRLL\n\nSample Output 4\n\n7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1892, "cpu_time_ms": 151, "memory_kb": 26096}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s198466528", "group_id": "codeNet:p02918", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.Reader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DFaceProducesUnhappiness solver = new DFaceProducesUnhappiness();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DFaceProducesUnhappiness {\n public void solve(int testNumber, MyInput in, PrintWriter out) {\n int n = in.nextInt();\n int k = in.nextInt();\n char[] s = in.nextChars();\n\n int ans = 0;\n\n for (int t = 0; t < 2; t++) {\n int rev = 0;\n int seg = 0;\n int edge = 0;\n for (int i = 0, cur = 0; i < n; i++) {\n if (i > 0 && s[i - 1] != s[i]) {\n if (s[i] == 'L') {\n rev++;\n edge += seg == 0 ? 1 : 0;\n }\n cur = 0;\n seg++;\n }\n cur++;\n if (i == n - 1) {\n if (s[i] == 'L') {\n rev++;\n }\n seg++;\n }\n }\n\n int val = n - seg + Math.min(k, rev - edge) * 2;\n if (k > rev - edge) {\n val++;\n }\n\n ans = Math.max(ans, val);\n\n for (int i = 0; i < n; i++) {\n s[i] = s[i] == 'L' ? 'R' : 'L';\n }\n for (int i = 0; i < n / 2; i++) {\n swap(s, i, n - 1 - i);\n }\n }\n\n out.println(ans);\n }\n\n static void swap(char[] xs, int i, int j) {\n char t = xs[i];\n xs[i] = xs[j];\n xs[j] = t;\n }\n\n }\n\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n public char[] nextChars() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n return Arrays.copyOf(str, len);\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1569384854, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02918.html", "problem_id": "p02918", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02918/input.txt", "sample_output_relpath": "derived/input_output/data/p02918/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02918/Java/s198466528.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s198466528", "user_id": "u429053592"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.Reader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DFaceProducesUnhappiness solver = new DFaceProducesUnhappiness();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DFaceProducesUnhappiness {\n public void solve(int testNumber, MyInput in, PrintWriter out) {\n int n = in.nextInt();\n int k = in.nextInt();\n char[] s = in.nextChars();\n\n int ans = 0;\n\n for (int t = 0; t < 2; t++) {\n int rev = 0;\n int seg = 0;\n int edge = 0;\n for (int i = 0, cur = 0; i < n; i++) {\n if (i > 0 && s[i - 1] != s[i]) {\n if (s[i] == 'L') {\n rev++;\n edge += seg == 0 ? 1 : 0;\n }\n cur = 0;\n seg++;\n }\n cur++;\n if (i == n - 1) {\n if (s[i] == 'L') {\n rev++;\n }\n seg++;\n }\n }\n\n int val = n - seg + Math.min(k, rev - edge) * 2;\n if (k > rev - edge) {\n val++;\n }\n\n ans = Math.max(ans, val);\n\n for (int i = 0; i < n; i++) {\n s[i] = s[i] == 'L' ? 'R' : 'L';\n }\n for (int i = 0; i < n / 2; i++) {\n swap(s, i, n - 1 - i);\n }\n }\n\n out.println(ans);\n }\n\n static void swap(char[] xs, int i, int j) {\n char t = xs[i];\n xs[i] = xs[j];\n xs[j] = t;\n }\n\n }\n\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n public char[] nextChars() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n return Arrays.copyOf(str, len);\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n\n }\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing in a queue from west to east.\n\nGiven is a string S of length N representing the directions of the people.\nThe i-th person from the west is facing west if the i-th character of S is L, and east if that character of S is R.\n\nA person is happy if the person in front of him/her is facing the same direction.\nIf no person is standing in front of a person, however, he/she is not happy.\n\nYou can perform the following operation any number of times between 0 and K (inclusive):\n\nOperation: Choose integers l and r such that 1 \\leq l \\leq r \\leq N, and rotate by 180 degrees the part of the queue: the l-th, (l+1)-th, ..., r-th persons. That is, for each i = 0, 1, ..., r-l, the (l + i)-th person from the west will stand the (r - i)-th from the west after the operation, facing east if he/she is facing west now, and vice versa.\n\nWhat is the maximum possible number of happy people you can have?\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\n|S| = N\n\nEach character of S is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of happy people after at most K operations.\n\nSample Input 1\n\n6 1\nLRLRRL\n\nSample Output 1\n\n3\n\nIf we choose (l, r) = (2, 5), we have LLLRLL, where the 2-nd, 3-rd, and 6-th persons from the west are happy.\n\nSample Input 2\n\n13 3\nLRRLRLRRLRLLR\n\nSample Output 2\n\n9\n\nSample Input 3\n\n10 1\nLLLLLRRRRR\n\nSample Output 3\n\n9\n\nSample Input 4\n\n9 2\nRRRLRLRLL\n\nSample Output 4\n\n7", "sample_input": "6 1\nLRLRRL\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02918", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing in a queue from west to east.\n\nGiven is a string S of length N representing the directions of the people.\nThe i-th person from the west is facing west if the i-th character of S is L, and east if that character of S is R.\n\nA person is happy if the person in front of him/her is facing the same direction.\nIf no person is standing in front of a person, however, he/she is not happy.\n\nYou can perform the following operation any number of times between 0 and K (inclusive):\n\nOperation: Choose integers l and r such that 1 \\leq l \\leq r \\leq N, and rotate by 180 degrees the part of the queue: the l-th, (l+1)-th, ..., r-th persons. That is, for each i = 0, 1, ..., r-l, the (l + i)-th person from the west will stand the (r - i)-th from the west after the operation, facing east if he/she is facing west now, and vice versa.\n\nWhat is the maximum possible number of happy people you can have?\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\n|S| = N\n\nEach character of S is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of happy people after at most K operations.\n\nSample Input 1\n\n6 1\nLRLRRL\n\nSample Output 1\n\n3\n\nIf we choose (l, r) = (2, 5), we have LLLRLL, where the 2-nd, 3-rd, and 6-th persons from the west are happy.\n\nSample Input 2\n\n13 3\nLRRLRLRRLRLLR\n\nSample Output 2\n\n9\n\nSample Input 3\n\n10 1\nLLLLLRRRRR\n\nSample Output 3\n\n9\n\nSample Input 4\n\n9 2\nRRRLRLRLL\n\nSample Output 4\n\n7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5212, "cpu_time_ms": 109, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s081601807", "group_id": "codeNet:p02918", "input_text": "\nimport java.util.Scanner;\n\n\npublic class Main {\n\t\n\t\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\t\n\t\tString s = sc.next();\n\t\tint count = 0;\n\t\tfor (int i=0;i Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "language": "Java", "metadata": {"date": 1589294181, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02921.html", "problem_id": "p02921", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02921/input.txt", "sample_output_relpath": "derived/input_output/data/p02921/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02921/Java/s800345226.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s800345226", "user_id": "u871244227"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nimport java.text.DecimalFormat;\nimport java.util.stream.LongStream;\nimport java.util.stream.IntStream;\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n \n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n \n AtCoder problem = new AtCoder(sc);\n problem.solve(out);\n \n out.flush();\n }\n \n}\n\nclass AtCoder {\n final String S, T;\n AtCoder(FastScanner sc) {\n S = sc.next();\n T = sc.next();\n }\n \n void solve(PrintWriter out) {\n int ans = 0;\n for (int i = 0; i < S.length(); i++) {\n if (S.charAt(i) == T.charAt(i)) ans++;\n }\n out.println(ans);\n }\n \n}\n\n// https://qiita.com/p_shiki37/items/a0f6aac33bf60f5f65e4\nclass FastScanner {\n \n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n \n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n \n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n \n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n \n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n \n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n \n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n \n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "sample_input": "CSS\nCSR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02921", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3169, "cpu_time_ms": 73, "memory_kb": 23508}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s588102566", "group_id": "codeNet:p02921", "input_text": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\t// practice contest\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\t\tint a = 0;\n\t\tif (s.charAt(0) == (t.charAt(0))) {\n\t\t\ta += 1;\n\t\t}\n\t\tif (s.charAt(1) == (t.charAt(1))) {\n\t\t\ta += 1;\n\t\t}\n\t\tif (s.charAt(2) == (t.charAt(2))) {\n\t\t\ta += 1;\n\t\t}\n\t\tSystem.out.println(a);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1581268231, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02921.html", "problem_id": "p02921", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02921/input.txt", "sample_output_relpath": "derived/input_output/data/p02921/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02921/Java/s588102566.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s588102566", "user_id": "u207799478"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\t// practice contest\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tString s = sc.next();\n\t\tString t = sc.next();\n\t\tint a = 0;\n\t\tif (s.charAt(0) == (t.charAt(0))) {\n\t\t\ta += 1;\n\t\t}\n\t\tif (s.charAt(1) == (t.charAt(1))) {\n\t\t\ta += 1;\n\t\t}\n\t\tif (s.charAt(2) == (t.charAt(2))) {\n\t\t\ta += 1;\n\t\t}\n\t\tSystem.out.println(a);\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "sample_input": "CSS\nCSR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02921", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 396, "cpu_time_ms": 106, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s822029213", "group_id": "codeNet:p02921", "input_text": "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scanner = new Scanner(System.in);\n\t\tString S = scanner.nextLine();\n\t\tString T = scanner.nextLine();\n\t\tint count = 0;\n\t\tif(S.substring(0,1).equals(T.substring(0,1))){\n\t\t\tcount++;\n\t\t}if(S.substring(1,2).equals(T.substring(1,2))){\n\t\t\tcount++;\n\t\t}if(S.substring(2,3).equals(T.substring(2,3))){\n\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t\t}\n\t}\n", "language": "Java", "metadata": {"date": 1570988697, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02921.html", "problem_id": "p02921", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02921/input.txt", "sample_output_relpath": "derived/input_output/data/p02921/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02921/Java/s822029213.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s822029213", "user_id": "u804197006"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner scanner = new Scanner(System.in);\n\t\tString S = scanner.nextLine();\n\t\tString T = scanner.nextLine();\n\t\tint count = 0;\n\t\tif(S.substring(0,1).equals(T.substring(0,1))){\n\t\t\tcount++;\n\t\t}if(S.substring(1,2).equals(T.substring(1,2))){\n\t\t\tcount++;\n\t\t}if(S.substring(2,3).equals(T.substring(2,3))){\n\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t\t}\n\t}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "sample_input": "CSS\nCSR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02921", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 433, "cpu_time_ms": 91, "memory_kb": 23252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s592595845", "group_id": "codeNet:p02921", "input_text": "import java.io.PrintStream;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = null;\n\t\tPrintStream out = null;\n\t\ttry {\n\t\t\tsc = new Scanner(System.in);\n\t\t\tout = System.out;\n\t\t\texec(sc, out);\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t} finally {\n\t\t\tif(out != null) {\n\t\t\t\tout.close();\n\t\t\t}\n\t\t\tif(sc != null) {\n\t\t\t\tsc.close();\n\t\t\t}\n\t\t}\n\t\tSystem.exit(0);\n\t}\n\tpublic static void exec(final Scanner sc, final PrintStream out) throws Exception{\n\t\tfinal String S = sc.next();\n\t\tfinal String T = sc.next();\n\n\t\tint cnt = 0;\n\t\tfor(int i=0;i<3;i++) {\n\t\t\tif(S.charAt(i)==T.charAt(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tout.println(cnt);\n\n\t}\n}\n", "language": "Java", "metadata": {"date": 1567367476, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02921.html", "problem_id": "p02921", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02921/input.txt", "sample_output_relpath": "derived/input_output/data/p02921/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02921/Java/s592595845.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s592595845", "user_id": "u365078800"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.PrintStream;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = null;\n\t\tPrintStream out = null;\n\t\ttry {\n\t\t\tsc = new Scanner(System.in);\n\t\t\tout = System.out;\n\t\t\texec(sc, out);\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t} finally {\n\t\t\tif(out != null) {\n\t\t\t\tout.close();\n\t\t\t}\n\t\t\tif(sc != null) {\n\t\t\t\tsc.close();\n\t\t\t}\n\t\t}\n\t\tSystem.exit(0);\n\t}\n\tpublic static void exec(final Scanner sc, final PrintStream out) throws Exception{\n\t\tfinal String S = sc.next();\n\t\tfinal String T = sc.next();\n\n\t\tint cnt = 0;\n\t\tfor(int i=0;i<3;i++) {\n\t\t\tif(S.charAt(i)==T.charAt(i)) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\tout.println(cnt);\n\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "sample_input": "CSS\nCSR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02921", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 700, "cpu_time_ms": 97, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s577502902", "group_id": "codeNet:p02922", "input_text": "import java.util.*;\n\npublic class Main{\n void solve(){\n Scanner scan = new Scanner(System.in);\n int a = scan.nextInt();\n int b = scan.nextInt();\n if(b == 1) System.out.println(0);\n else if(b <= a) System.out.println(1);\n else{\n b -= a;\n System.out.println(1 + b / (a - 1) + b % (a - 1));\n }\n }\n\n public static void main(String[] args){\n new Main().solve();\n }\n}\n", "language": "Java", "metadata": {"date": 1600015281, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02922.html", "problem_id": "p02922", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02922/input.txt", "sample_output_relpath": "derived/input_output/data/p02922/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02922/Java/s577502902.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s577502902", "user_id": "u459100168"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n void solve(){\n Scanner scan = new Scanner(System.in);\n int a = scan.nextInt();\n int b = scan.nextInt();\n if(b == 1) System.out.println(0);\n else if(b <= a) System.out.println(1);\n else{\n b -= a;\n System.out.println(1 + b / (a - 1) + b % (a - 1));\n }\n }\n\n public static void main(String[] args){\n new Main().solve();\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 452, "cpu_time_ms": 121, "memory_kb": 35664}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s113045380", "group_id": "codeNet:p02922", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tdouble a = stdIn.nextInt();\n\t\tdouble b = stdIn.nextInt();\n\n\t\tint ans = 1;\n\t\tdouble check = (b % a)/a;\n\n\n\t\tif(a != b) {\n\t\t\tans = (int) ((b-1)/(a-1));\n\t\t\tif(check < 0.5){\n\t\t\t\tans = ans + 1;\n\t\t\t}\n\t\t}else {\n\t\t}\n\t\tSystem.out.println(ans);\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1591622055, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02922.html", "problem_id": "p02922", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02922/input.txt", "sample_output_relpath": "derived/input_output/data/p02922/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02922/Java/s113045380.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s113045380", "user_id": "u715468508"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner stdIn = new Scanner(System.in);\n\t\tdouble a = stdIn.nextInt();\n\t\tdouble b = stdIn.nextInt();\n\n\t\tint ans = 1;\n\t\tdouble check = (b % a)/a;\n\n\n\t\tif(a != b) {\n\t\t\tans = (int) ((b-1)/(a-1));\n\t\t\tif(check < 0.5){\n\t\t\t\tans = ans + 1;\n\t\t\t}\n\t\t}else {\n\t\t}\n\t\tSystem.out.println(ans);\n\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 375, "cpu_time_ms": 92, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s958433919", "group_id": "codeNet:p02922", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n for (int i = 1; i <= 410; i++) {\n if (A * i >= B) {\n System.out.println(i);\n return;\n }\n }\n }\n}", "language": "Java", "metadata": {"date": 1573076205, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02922.html", "problem_id": "p02922", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02922/input.txt", "sample_output_relpath": "derived/input_output/data/p02922/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02922/Java/s958433919.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s958433919", "user_id": "u466371843"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n for (int i = 1; i <= 410; i++) {\n if (A * i >= B) {\n System.out.println(i);\n return;\n }\n }\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 94, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s990262459", "group_id": "codeNet:p02922", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n int count = 0;\n int sockets = 1;\n for (int i = 1; i < b; i+=a) {\n i--;\n count++;\n }\n\n System.out.println(count);\n }\n}", "language": "Java", "metadata": {"date": 1568021075, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02922.html", "problem_id": "p02922", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02922/input.txt", "sample_output_relpath": "derived/input_output/data/p02922/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02922/Java/s990262459.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s990262459", "user_id": "u326014872"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n int count = 0;\n int sockets = 1;\n for (int i = 1; i < b; i+=a) {\n i--;\n count++;\n }\n\n System.out.println(count);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 371, "cpu_time_ms": 97, "memory_kb": 23252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s809095035", "group_id": "codeNet:p02922", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n\t Scanner sc = new Scanner(System.in);\n\t int A = Integer.parseInt(sc.next());\n\t int B = Integer.parseInt(sc.next());\n\t \n\t int count = 1;\n\t int temp = A;\n\t while(temp < B) {\n\t\t temp += temp -1;\n\t\t count++;\n\t }\n\t System.out.println(count);\n\t sc.close();\n\t \n }\n}\n", "language": "Java", "metadata": {"date": 1567859786, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02922.html", "problem_id": "p02922", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02922/input.txt", "sample_output_relpath": "derived/input_output/data/p02922/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02922/Java/s809095035.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s809095035", "user_id": "u792095741"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n\t Scanner sc = new Scanner(System.in);\n\t int A = Integer.parseInt(sc.next());\n\t int B = Integer.parseInt(sc.next());\n\t \n\t int count = 1;\n\t int temp = A;\n\t while(temp < B) {\n\t\t temp += temp -1;\n\t\t count++;\n\t }\n\t System.out.println(count);\n\t sc.close();\n\t \n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 357, "cpu_time_ms": 93, "memory_kb": 21972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s446924902", "group_id": "codeNet:p02923", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n logic pos = new logic();\n System.out.println(pos.move());\n }\n\n public static class logic{\n int num;\n int ans = 0;\n \n private int move(){\n Scanner sc = new Scanner(System.in);\n num = sc.nextInt();\n int mass[] = new int[num];\n for (int i = 0; i < mass.length; i++) {\n mass[i] = sc.nextInt();\n }\n sc.close();\n for (int i = 0; i < mass.length - 1; i++) {\n if (mass[i] >= mass[i + 1]) {\n ans++;\n }else{\n ans = 0;\n }\n }\n \n return ans;\n }\n }\n}", "language": "Java", "metadata": {"date": 1567886102, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02923.html", "problem_id": "p02923", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02923/input.txt", "sample_output_relpath": "derived/input_output/data/p02923/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02923/Java/s446924902.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s446924902", "user_id": "u012232498"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n logic pos = new logic();\n System.out.println(pos.move());\n }\n\n public static class logic{\n int num;\n int ans = 0;\n \n private int move(){\n Scanner sc = new Scanner(System.in);\n num = sc.nextInt();\n int mass[] = new int[num];\n for (int i = 0; i < mass.length; i++) {\n mass[i] = sc.nextInt();\n }\n sc.close();\n for (int i = 0; i < mass.length - 1; i++) {\n if (mass[i] >= mass[i + 1]) {\n ans++;\n }else{\n ans = 0;\n }\n }\n \n return ans;\n }\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right.\n\nThe height of the i-th square from the left is H_i.\n\nYou will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square is not greater than that of the current square.\n\nFind the maximum number of times you can move.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the maximum number of times you can move.\n\nSample Input 1\n\n5\n10 4 8 7 3\n\nSample Output 1\n\n2\n\nBy landing on the third square from the left, you can move to the right twice.\n\nSample Input 2\n\n7\n4 4 5 6 6 5 5\n\nSample Output 2\n\n3\n\nBy landing on the fourth square from the left, you can move to the right three times.\n\nSample Input 3\n\n4\n1 2 3 4\n\nSample Output 3\n\n0", "sample_input": "5\n10 4 8 7 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02923", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right.\n\nThe height of the i-th square from the left is H_i.\n\nYou will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square is not greater than that of the current square.\n\nFind the maximum number of times you can move.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the maximum number of times you can move.\n\nSample Input 1\n\n5\n10 4 8 7 3\n\nSample Output 1\n\n2\n\nBy landing on the third square from the left, you can move to the right twice.\n\nSample Input 2\n\n7\n4 4 5 6 6 5 5\n\nSample Output 2\n\n3\n\nBy landing on the fourth square from the left, you can move to the right three times.\n\nSample Input 3\n\n4\n1 2 3 4\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 795, "cpu_time_ms": 465, "memory_kb": 50348}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s423366860", "group_id": "codeNet:p02926", "input_text": "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\t\tint n = sc.nextInt();\n\t\t\tint[] x = new int[n];\n\t\t\tint[] y = new int[n];\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tx[i] = sc.nextInt();\n\t\t\t\ty[i] = sc.nextInt();\n\t\t\t}\n\n\t\t\tlong result = 0;\n\t\t\tlong nowX = 0;\n\t\t\tlong nowY = 0;\n\t\t\t// x+, y+\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (0 <= x[i] && 0 <= y[i]) {\n\t\t\t\t\tnowX += x[i];\n\t\t\t\t\tnowY += y[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (x[i] < 0 || y[i] < 0) {\n\t\t\t\t\tif(calc(nowX, nowY) < calc(nowX + x[i], nowY + y[i])) {\n\t\t\t\t\t\tnowX += x[i];\n\t\t\t\t\t\tnowY += y[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tresult = calc(nowX, nowY);\n\t\t\t// x+, y-\n\t\t\tnowX = 0;\n\t\t\tnowY = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (0 <= x[i] && y[i] <= 0) {\n\t\t\t\t\tnowX += x[i];\n\t\t\t\t\tnowY += y[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (x[i] < 0 || 0 < y[i]) {\n\t\t\t\t\tif(calc(nowX, nowY) < calc(nowX + x[i], nowY + y[i])) {\n\t\t\t\t\t\tnowX += x[i];\n\t\t\t\t\t\tnowY += y[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (result < calc(nowX, nowY)) {\n\t\t\t\tresult = calc(nowX, nowY);\n\t\t\t}\n\t\t\t// x-, y-\n\t\t\tnowX = 0;\n\t\t\tnowY = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (x[i] <= 0 && y[i] <= 0) {\n\t\t\t\t\tnowX += x[i];\n\t\t\t\t\tnowY += y[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (0 < x[i] || 0 < y[i]) {\n\t\t\t\t\tif(calc(nowX, nowY) < calc(nowX + x[i], nowY + y[i])) {\n\t\t\t\t\t\tnowX += x[i];\n\t\t\t\t\t\tnowY += y[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (result < calc(nowX, nowY)) {\n\t\t\t\tresult = calc(nowX, nowY);\n\t\t\t}\n\t\t\t// x-, y+\n\t\t\tnowX = 0;\n\t\t\tnowY = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (x[i] <= 0 && 0 <= y[i]) {\n\t\t\t\t\tnowX += x[i];\n\t\t\t\t\tnowY += y[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (0 < x[i] || y[i] < 0) {\n\t\t\t\t\tif(calc(nowX, nowY) < calc(nowX + x[i], nowY + y[i])) {\n\t\t\t\t\t\tnowX += x[i];\n\t\t\t\t\t\tnowY += y[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (result < calc(nowX, nowY)) {\n\t\t\t\tresult = calc(nowX, nowY);\n\t\t\t}\n\n\t\t\tSystem.out.println(Math.sqrt(result));\n\t\t}\n\t}\n\n\tprivate static long calc(long x, long y) {\n\t\treturn x * x + y * y;\n\t}\n}\n", "language": "Java", "metadata": {"date": 1567367641, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02926.html", "problem_id": "p02926", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02926/input.txt", "sample_output_relpath": "derived/input_output/data/p02926/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02926/Java/s423366860.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s423366860", "user_id": "u578423830"}, "prompt_components": {"gold_output": "10.000000000000000000000000000000000000000000000000\n", "input_to_evaluate": "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\t\tint n = sc.nextInt();\n\t\t\tint[] x = new int[n];\n\t\t\tint[] y = new int[n];\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tx[i] = sc.nextInt();\n\t\t\t\ty[i] = sc.nextInt();\n\t\t\t}\n\n\t\t\tlong result = 0;\n\t\t\tlong nowX = 0;\n\t\t\tlong nowY = 0;\n\t\t\t// x+, y+\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (0 <= x[i] && 0 <= y[i]) {\n\t\t\t\t\tnowX += x[i];\n\t\t\t\t\tnowY += y[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (x[i] < 0 || y[i] < 0) {\n\t\t\t\t\tif(calc(nowX, nowY) < calc(nowX + x[i], nowY + y[i])) {\n\t\t\t\t\t\tnowX += x[i];\n\t\t\t\t\t\tnowY += y[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tresult = calc(nowX, nowY);\n\t\t\t// x+, y-\n\t\t\tnowX = 0;\n\t\t\tnowY = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (0 <= x[i] && y[i] <= 0) {\n\t\t\t\t\tnowX += x[i];\n\t\t\t\t\tnowY += y[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (x[i] < 0 || 0 < y[i]) {\n\t\t\t\t\tif(calc(nowX, nowY) < calc(nowX + x[i], nowY + y[i])) {\n\t\t\t\t\t\tnowX += x[i];\n\t\t\t\t\t\tnowY += y[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (result < calc(nowX, nowY)) {\n\t\t\t\tresult = calc(nowX, nowY);\n\t\t\t}\n\t\t\t// x-, y-\n\t\t\tnowX = 0;\n\t\t\tnowY = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (x[i] <= 0 && y[i] <= 0) {\n\t\t\t\t\tnowX += x[i];\n\t\t\t\t\tnowY += y[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (0 < x[i] || 0 < y[i]) {\n\t\t\t\t\tif(calc(nowX, nowY) < calc(nowX + x[i], nowY + y[i])) {\n\t\t\t\t\t\tnowX += x[i];\n\t\t\t\t\t\tnowY += y[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (result < calc(nowX, nowY)) {\n\t\t\t\tresult = calc(nowX, nowY);\n\t\t\t}\n\t\t\t// x-, y+\n\t\t\tnowX = 0;\n\t\t\tnowY = 0;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (x[i] <= 0 && 0 <= y[i]) {\n\t\t\t\t\tnowX += x[i];\n\t\t\t\t\tnowY += y[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (0 < x[i] || y[i] < 0) {\n\t\t\t\t\tif(calc(nowX, nowY) < calc(nowX + x[i], nowY + y[i])) {\n\t\t\t\t\t\tnowX += x[i];\n\t\t\t\t\t\tnowY += y[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (result < calc(nowX, nowY)) {\n\t\t\t\tresult = calc(nowX, nowY);\n\t\t\t}\n\n\t\t\tSystem.out.println(Math.sqrt(result));\n\t\t}\n\t}\n\n\tprivate static long calc(long x, long y) {\n\t\treturn x * x + y * y;\n\t}\n}\n", "problem_context": "Score: 600 points\n\nProblem Statement\n\nE869120 is initially standing at the origin (0, 0) in a two-dimensional plane.\n\nHe has N engines, which can be used as follows:\n\nWhen E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).\n\nE869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.\n\nHe wants to go as far as possible from the origin.\nLet (X, Y) be his final coordinates. Find the maximum possible value of \\sqrt{X^2 + Y^2}, the distance from the origin.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n-1 \\ 000 \\ 000 \\leq x_i \\leq 1 \\ 000 \\ 000\n\n-1 \\ 000 \\ 000 \\leq y_i \\leq 1 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n: :\nx_N y_N\n\nOutput\n\nPrint the maximum possible final distance from the origin, as a real value.\nYour output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.\n\nSample Input 1\n\n3\n0 10\n5 -5\n-5 -5\n\nSample Output 1\n\n10.000000000000000000000000000000000000000000000000\n\nThe final distance from the origin can be 10 if we use the engines in one of the following three ways:\n\nUse Engine 1 to move to (0, 10).\n\nUse Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).\n\nUse Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).\n\nThe distance cannot be greater than 10, so the maximum possible distance is 10.\n\nSample Input 2\n\n5\n1 1\n1 0\n0 1\n-1 0\n0 -1\n\nSample Output 2\n\n2.828427124746190097603377448419396157139343750753\n\nThe maximum possible final distance is 2 \\sqrt{2} = 2.82842....\nOne of the ways to achieve it is:\n\nUse Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).\n\nSample Input 3\n\n5\n1 1\n2 2\n3 3\n4 4\n5 5\n\nSample Output 3\n\n21.213203435596425732025330863145471178545078130654\n\nIf we use all the engines in the order 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 \\rightarrow 5, we will end up at (15, 15), with the distance 15 \\sqrt{2} = 21.2132... from the origin.\n\nSample Input 4\n\n3\n0 0\n0 1\n1 0\n\nSample Output 4\n\n1.414213562373095048801688724209698078569671875376\n\nThere can be useless engines with (x_i, y_i) = (0, 0).\n\nSample Input 5\n\n1\n90447 91000\n\nSample Output 5\n\n128303.000000000000000000000000000000000000000000000000\n\nNote that there can be only one engine.\n\nSample Input 6\n\n2\n96000 -72000\n-72000 54000\n\nSample Output 6\n\n120000.000000000000000000000000000000000000000000000000\n\nThere can be only two engines, too.\n\nSample Input 7\n\n10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n\nSample Output 7\n\n148.660687473185055226120082139313966514489855137208", "sample_input": "3\n0 10\n5 -5\n-5 -5\n"}, "reference_outputs": ["10.000000000000000000000000000000000000000000000000\n"], "source_document_id": "p02926", "source_text": "Score: 600 points\n\nProblem Statement\n\nE869120 is initially standing at the origin (0, 0) in a two-dimensional plane.\n\nHe has N engines, which can be used as follows:\n\nWhen E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).\n\nE869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.\n\nHe wants to go as far as possible from the origin.\nLet (X, Y) be his final coordinates. Find the maximum possible value of \\sqrt{X^2 + Y^2}, the distance from the origin.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n-1 \\ 000 \\ 000 \\leq x_i \\leq 1 \\ 000 \\ 000\n\n-1 \\ 000 \\ 000 \\leq y_i \\leq 1 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n: :\nx_N y_N\n\nOutput\n\nPrint the maximum possible final distance from the origin, as a real value.\nYour output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.\n\nSample Input 1\n\n3\n0 10\n5 -5\n-5 -5\n\nSample Output 1\n\n10.000000000000000000000000000000000000000000000000\n\nThe final distance from the origin can be 10 if we use the engines in one of the following three ways:\n\nUse Engine 1 to move to (0, 10).\n\nUse Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).\n\nUse Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).\n\nThe distance cannot be greater than 10, so the maximum possible distance is 10.\n\nSample Input 2\n\n5\n1 1\n1 0\n0 1\n-1 0\n0 -1\n\nSample Output 2\n\n2.828427124746190097603377448419396157139343750753\n\nThe maximum possible final distance is 2 \\sqrt{2} = 2.82842....\nOne of the ways to achieve it is:\n\nUse Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).\n\nSample Input 3\n\n5\n1 1\n2 2\n3 3\n4 4\n5 5\n\nSample Output 3\n\n21.213203435596425732025330863145471178545078130654\n\nIf we use all the engines in the order 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 \\rightarrow 5, we will end up at (15, 15), with the distance 15 \\sqrt{2} = 21.2132... from the origin.\n\nSample Input 4\n\n3\n0 0\n0 1\n1 0\n\nSample Output 4\n\n1.414213562373095048801688724209698078569671875376\n\nThere can be useless engines with (x_i, y_i) = (0, 0).\n\nSample Input 5\n\n1\n90447 91000\n\nSample Output 5\n\n128303.000000000000000000000000000000000000000000000000\n\nNote that there can be only one engine.\n\nSample Input 6\n\n2\n96000 -72000\n-72000 54000\n\nSample Output 6\n\n120000.000000000000000000000000000000000000000000000000\n\nThere can be only two engines, too.\n\nSample Input 7\n\n10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n\nSample Output 7\n\n148.660687473185055226120082139313966514489855137208", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2058, "cpu_time_ms": 116, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s913972161", "group_id": "codeNet:p02927", "input_text": "import java.io.*;\nimport java.util.*;\n\n/**\n * @author masayamatu\n * \n */\npublic class Main {\n \n public static void main(String[] args) throws IOException{\n FastScanner sc = new FastScanner();\n int m = sc.nextInt();\n int d = sc.nextInt();\n int count = 0;\n for(int i = 4; i <= m; i++) {\n for(int j = 22; j <= d; j++) {\n if((j/10)*(j%10) == i) {\n count++;\n }\n }\n }\n System.out.println(count);\n }\n}\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}", "language": "Java", "metadata": {"date": 1566695844, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02927.html", "problem_id": "p02927", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02927/input.txt", "sample_output_relpath": "derived/input_output/data/p02927/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02927/Java/s913972161.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s913972161", "user_id": "u434746933"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\n/**\n * @author masayamatu\n * \n */\npublic class Main {\n \n public static void main(String[] args) throws IOException{\n FastScanner sc = new FastScanner();\n int m = sc.nextInt();\n int d = sc.nextInt();\n int count = 0;\n for(int i = 4; i <= m; i++) {\n for(int j = 22; j <= d; j++) {\n if((j/10)*(j%10) == i) {\n count++;\n }\n }\n }\n System.out.println(count);\n }\n}\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "15 40\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02927", "source_text": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2410, "cpu_time_ms": 73, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s734475097", "group_id": "codeNet:p02928", "input_text": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n void run() {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long k = sc.nextInt();\n\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n\n int[] b = new int[n], c = new int[n];\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n if (i < j && a[i] > a[j]) {\n b[j]++;\n }\n if (a[i] > a[j]) {\n c[j]++;\n }\n }\n\n\n long MOD = (long)(1e9) + 7;\n long INV2 = (MOD + 1) / 2;\n long cnt = 0;\n for (int i = 0; i < n; i++) {\n cnt = (cnt + k * b[i]) % MOD;\n long mult = k * c[i] % MOD * (k - 1) % MOD * INV2 % MOD;\n cnt = (cnt + mult) % MOD;\n }\n System.out.println(cnt);\n }\n\n void debug(Object...os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "language": "Java", "metadata": {"date": 1566696363, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02928.html", "problem_id": "p02928", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02928/input.txt", "sample_output_relpath": "derived/input_output/data/p02928/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02928/Java/s734475097.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s734475097", "user_id": "u726872801"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n void run() {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long k = sc.nextInt();\n\n int[] a = new int[n];\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n\n int[] b = new int[n], c = new int[n];\n for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {\n if (i < j && a[i] > a[j]) {\n b[j]++;\n }\n if (a[i] > a[j]) {\n c[j]++;\n }\n }\n\n\n long MOD = (long)(1e9) + 7;\n long INV2 = (MOD + 1) / 2;\n long cnt = 0;\n for (int i = 0; i < n; i++) {\n cnt = (cnt + k * b[i]) % MOD;\n long mult = k * c[i] % MOD * (k - 1) % MOD * INV2 % MOD;\n cnt = (cnt + mult) % MOD;\n }\n System.out.println(cnt);\n }\n\n void debug(Object...os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a sequence of N integers A~=~A_0,~A_1,~...,~A_{N - 1}.\n\nLet B be a sequence of K \\times N integers obtained by concatenating K copies of A. For example, if A~=~1,~3,~2 and K~=~2, B~=~1,~3,~2,~1,~3,~2.\n\nFind the inversion number of B, modulo 10^9 + 7.\n\nHere the inversion number of B is defined as the number of ordered pairs of integers (i,~j)~(0 \\leq i < j \\leq K \\times N - 1) such that B_i > B_j.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_0 A_1 ... A_{N - 1}\n\nOutput\n\nPrint the inversion number of B, modulo 10^9 + 7.\n\nSample Input 1\n\n2 2\n2 1\n\nSample Output 1\n\n3\n\nIn this case, B~=~2,~1,~2,~1. We have:\n\nB_0 > B_1\n\nB_0 > B_3\n\nB_2 > B_3\n\nThus, the inversion number of B is 3.\n\nSample Input 2\n\n3 5\n1 1 1\n\nSample Output 2\n\n0\n\nA may contain multiple occurrences of the same number.\n\nSample Input 3\n\n10 998244353\n10 9 8 7 5 6 3 4 2 1\n\nSample Output 3\n\n185297239\n\nBe sure to print the output modulo 10^9 + 7.", "sample_input": "2 2\n2 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02928", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a sequence of N integers A~=~A_0,~A_1,~...,~A_{N - 1}.\n\nLet B be a sequence of K \\times N integers obtained by concatenating K copies of A. For example, if A~=~1,~3,~2 and K~=~2, B~=~1,~3,~2,~1,~3,~2.\n\nFind the inversion number of B, modulo 10^9 + 7.\n\nHere the inversion number of B is defined as the number of ordered pairs of integers (i,~j)~(0 \\leq i < j \\leq K \\times N - 1) such that B_i > B_j.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_0 A_1 ... A_{N - 1}\n\nOutput\n\nPrint the inversion number of B, modulo 10^9 + 7.\n\nSample Input 1\n\n2 2\n2 1\n\nSample Output 1\n\n3\n\nIn this case, B~=~2,~1,~2,~1. We have:\n\nB_0 > B_1\n\nB_0 > B_3\n\nB_2 > B_3\n\nThus, the inversion number of B is 3.\n\nSample Input 2\n\n3 5\n1 1 1\n\nSample Output 2\n\n0\n\nA may contain multiple occurrences of the same number.\n\nSample Input 3\n\n10 998244353\n10 9 8 7 5 6 3 4 2 1\n\nSample Output 3\n\n185297239\n\nBe sure to print the output modulo 10^9 + 7.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1080, "cpu_time_ms": 192, "memory_kb": 26152}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s366643291", "group_id": "codeNet:p02930", "input_text": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n// import java.awt.Point;\n \npublic class Main {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n static int mod = 1_000_000_007;\n // int mod = 998244353;\n // long inf = Long.MAX_VALUE/2;\n int inf = Integer.MAX_VALUE/2;\n\n void solve(){\n int n = ni();\n int count = 2;\n int[] p = new int[1000];\n Arrays.fill(p,2);\n int m = 2;\n int r = 2;\n for(int i = 0; i < 9; i++){\n p[m] = r++;\n m *= 2;\n }\n for(int i = 0; i < n; i++){\n for(int j = i+1; j < n; j++){\n if((i+j)%2==1) out.print(1+\" \");\n else{\n int res = j-i;\n int total = 1;\n while(res>0){\n res/=2;\n total *= 2;\n if(res%2==1){\n out.print(p[total]+\" \");\n break;\n }\n }\n }\n }\n out.println();\n }\n\n }\n\n void run() throws Exception\n {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }\n \n public static void main(String[] args) throws Exception { new Main().run(); }\n \n private byte[] inbuf = new byte[1024];\n private int lenbuf = 0, ptrbuf = 0;\n \n private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n \n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n \n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n \n private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b) && b != ' ')){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n \n private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n \n private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n \n private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n \n private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n \n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n \n private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n \n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n \n private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }\n \n}\n", "language": "Java", "metadata": {"date": 1566698301, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02930.html", "problem_id": "p02930", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02930/input.txt", "sample_output_relpath": "derived/input_output/data/p02930/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02930/Java/s366643291.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s366643291", "user_id": "u675503966"}, "prompt_components": {"gold_output": "1 2\n1\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n// import java.awt.Point;\n \npublic class Main {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n static int mod = 1_000_000_007;\n // int mod = 998244353;\n // long inf = Long.MAX_VALUE/2;\n int inf = Integer.MAX_VALUE/2;\n\n void solve(){\n int n = ni();\n int count = 2;\n int[] p = new int[1000];\n Arrays.fill(p,2);\n int m = 2;\n int r = 2;\n for(int i = 0; i < 9; i++){\n p[m] = r++;\n m *= 2;\n }\n for(int i = 0; i < n; i++){\n for(int j = i+1; j < n; j++){\n if((i+j)%2==1) out.print(1+\" \");\n else{\n int res = j-i;\n int total = 1;\n while(res>0){\n res/=2;\n total *= 2;\n if(res%2==1){\n out.print(p[total]+\" \");\n break;\n }\n }\n }\n }\n out.println();\n }\n\n }\n\n void run() throws Exception\n {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }\n \n public static void main(String[] args) throws Exception { new Main().run(); }\n \n private byte[] inbuf = new byte[1024];\n private int lenbuf = 0, ptrbuf = 0;\n \n private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n \n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n \n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n \n private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b) && b != ' ')){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n \n private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n \n private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n \n private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n \n private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n \n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n \n private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n \n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n \n private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }\n \n}\n", "problem_context": "Score: 600 points\n\nProblem Statement\n\nAtCoder's head office consists of N rooms numbered 1 to N. For any two rooms, there is a direct passage connecting these rooms.\n\nFor security reasons, Takahashi the president asked you to set a level for every passage, which is a positive integer and must satisfy the following condition:\n\nFor each room i\\ (1 \\leq i \\leq N), if we leave Room i, pass through some passages whose levels are all equal and get back to Room i, the number of times we pass through a passage is always even.\n\nYour task is to set levels to the passages so that the highest level of a passage is minimized.\n\nConstraints\n\nN is an integer between 2 and 500 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint one way to set levels to the passages so that the objective is achieved, as follows:\n\na_{1,2} a_{1,3} ... a_{1,N}\na_{2,3} ... a_{2,N}\n.\n.\n.\na_{N-1,N}\n\nHere a_{i,j} is the level of the passage connecting Room i and Room j.\n\nIf there are multiple solutions, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 2\n1\n\nThe following image describes this output:\n\nFor example, if we leave Room 2, traverse the path 2 \\to 3 \\to 2 \\to 3 \\to 2 \\to 1 \\to 2 while only passing passages of level 1 and get back to Room 2, we pass through a passage six times.", "sample_input": "3\n"}, "reference_outputs": ["1 2\n1\n"], "source_document_id": "p02930", "source_text": "Score: 600 points\n\nProblem Statement\n\nAtCoder's head office consists of N rooms numbered 1 to N. For any two rooms, there is a direct passage connecting these rooms.\n\nFor security reasons, Takahashi the president asked you to set a level for every passage, which is a positive integer and must satisfy the following condition:\n\nFor each room i\\ (1 \\leq i \\leq N), if we leave Room i, pass through some passages whose levels are all equal and get back to Room i, the number of times we pass through a passage is always even.\n\nYour task is to set levels to the passages so that the highest level of a passage is minimized.\n\nConstraints\n\nN is an integer between 2 and 500 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint one way to set levels to the passages so that the objective is achieved, as follows:\n\na_{1,2} a_{1,3} ... a_{1,N}\na_{2,3} ... a_{2,N}\n.\n.\n.\na_{N-1,N}\n\nHere a_{i,j} is the level of the passage connecting Room i and Room j.\n\nIf there are multiple solutions, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 2\n1\n\nThe following image describes this output:\n\nFor example, if we leave Room 2, traverse the path 2 \\to 3 \\to 2 \\to 3 \\to 2 \\to 1 \\to 2 while only passing passages of level 1 and get back to Room 2, we pass through a passage six times.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4178, "cpu_time_ms": 143, "memory_kb": 30292}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s656000502", "group_id": "codeNet:p02934", "input_text": "import java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n \tScanner parameter = new Scanner(System.in);\n\n \tString[] line1 = parameter.nextLine().split(\" \");\n String[] line2 = parameter.nextLine().split(\" \");\n\n int[] intNumber = new int[line2.length];\n int maxNumber = 0;\n\n for (int i = 0; i < line2.length; i++) {\n\n \tintNumber[i] = Integer.parseInt(line2[i]);\n\n \tif (maxNumber < intNumber[i]) {\n\n \t\tmaxNumber = intNumber[i];\n \t}\n }\n\n double sumNumber = 0;\n\n for (int nowNumber : intNumber) {\n\n \tsumNumber = sumNumber + maxNumber/ nowNumber;\n }\n\n double lastNumber = maxNumber / sumNumber;\n\n System.out.println(lastNumber);\n }\n}\n", "language": "Java", "metadata": {"date": 1566335668, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02934.html", "problem_id": "p02934", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02934/input.txt", "sample_output_relpath": "derived/input_output/data/p02934/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02934/Java/s656000502.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s656000502", "user_id": "u333277287"}, "prompt_components": {"gold_output": "7.5\n", "input_to_evaluate": "import java.util.Scanner;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n \tScanner parameter = new Scanner(System.in);\n\n \tString[] line1 = parameter.nextLine().split(\" \");\n String[] line2 = parameter.nextLine().split(\" \");\n\n int[] intNumber = new int[line2.length];\n int maxNumber = 0;\n\n for (int i = 0; i < line2.length; i++) {\n\n \tintNumber[i] = Integer.parseInt(line2[i]);\n\n \tif (maxNumber < intNumber[i]) {\n\n \t\tmaxNumber = intNumber[i];\n \t}\n }\n\n double sumNumber = 0;\n\n for (int nowNumber : intNumber) {\n\n \tsumNumber = sumNumber + maxNumber/ nowNumber;\n }\n\n double lastNumber = maxNumber / sumNumber;\n\n System.out.println(lastNumber);\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "sample_input": "2\n10 30\n"}, "reference_outputs": ["7.5\n"], "source_document_id": "p02934", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 776, "cpu_time_ms": 96, "memory_kb": 20948}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s603608882", "group_id": "codeNet:p02934", "input_text": "import java.io.BufferedReader;\nimport java.io.Closeable;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Iterator;\nimport java.util.LinkedList;\nimport java.util.Map.Entry;\n\nimport java.util.PriorityQueue;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\ttry(final Scanner sc = new Scanner(System.in)){\n\t\t\tfinal int N = sc.nextInt();\n\t\t\t\n\t\t\tdouble answer = 0;\n\t\t\tfor(int i = 0; i < N; i++) {\n\t\t\t\tanswer += 1 / sc.nextDouble();\n\t\t\t}\n\t\t\t\n\t\t\tSystem.out.printf(\"%.10f\\n\", 1 / answer);\n\t\t}\n\t}\n\n\tpublic static class Scanner implements Closeable {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tok;\n\n\t\tpublic Scanner(InputStream is) throws IOException {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\n\t\tprivate void getLine() throws IOException {\n\t\t\twhile(!hasNext()){\n\t\t\t\ttok = new StringTokenizer(br.readLine());\n\t\t\t}\n\t\t}\n\n\t\tprivate boolean hasNext() {\n\t\t\treturn tok != null && tok.hasMoreTokens();\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tgetLine();\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) throws IOException {\n\t\t\tfinal int[] ret = new int[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextInt();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) throws IOException {\n\t\t\tfinal long[] ret = new long[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextLong();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\tbr.close();\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1566176551, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02934.html", "problem_id": "p02934", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02934/input.txt", "sample_output_relpath": "derived/input_output/data/p02934/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02934/Java/s603608882.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s603608882", "user_id": "u316432228"}, "prompt_components": {"gold_output": "7.5\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.Closeable;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Iterator;\nimport java.util.LinkedList;\nimport java.util.Map.Entry;\n\nimport java.util.PriorityQueue;\nimport java.util.StringTokenizer;\nimport java.util.TreeSet;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\ttry(final Scanner sc = new Scanner(System.in)){\n\t\t\tfinal int N = sc.nextInt();\n\t\t\t\n\t\t\tdouble answer = 0;\n\t\t\tfor(int i = 0; i < N; i++) {\n\t\t\t\tanswer += 1 / sc.nextDouble();\n\t\t\t}\n\t\t\t\n\t\t\tSystem.out.printf(\"%.10f\\n\", 1 / answer);\n\t\t}\n\t}\n\n\tpublic static class Scanner implements Closeable {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tok;\n\n\t\tpublic Scanner(InputStream is) throws IOException {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\n\t\tprivate void getLine() throws IOException {\n\t\t\twhile(!hasNext()){\n\t\t\t\ttok = new StringTokenizer(br.readLine());\n\t\t\t}\n\t\t}\n\n\t\tprivate boolean hasNext() {\n\t\t\treturn tok != null && tok.hasMoreTokens();\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tgetLine();\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) throws IOException {\n\t\t\tfinal int[] ret = new int[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextInt();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long[] nextLongArray(int n) throws IOException {\n\t\t\tfinal long[] ret = new long[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextLong();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\tbr.close();\n\t\t}\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "sample_input": "2\n10 30\n"}, "reference_outputs": ["7.5\n"], "source_document_id": "p02934", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1982, "cpu_time_ms": 79, "memory_kb": 21076}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s322399045", "group_id": "codeNet:p02935", "input_text": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = Integer.parseInt(sc.nextLine());\n\t\tList v = new ArrayList<>();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tv.add(sc.nextDouble());\n\t\t}\n\t\tv.sort(null);\n\t\twhile (v.size() > 1) {\n\t\t\tdouble vv = (v.remove(0) + v.remove(0)) / 2;\n\t\t\tint idx = Collections.binarySearch(v, vv);\n\t\t\tif (idx >= 0) {\n\t\t\t\tv.add(idx, vv);\n\t\t\t}\n\t\t\telse if (idx == -1) {\n\t\t\t\tv.add(vv);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (-idx < v.size()) {\n\t\t\t\t\tv.add(-idx, vv);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tv.add(vv);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(v.get(0));\n\t}\n}", "language": "Java", "metadata": {"date": 1567475447, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02935.html", "problem_id": "p02935", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02935/input.txt", "sample_output_relpath": "derived/input_output/data/p02935/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02935/Java/s322399045.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s322399045", "user_id": "u423952743"}, "prompt_components": {"gold_output": "3.5\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = Integer.parseInt(sc.nextLine());\n\t\tList v = new ArrayList<>();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tv.add(sc.nextDouble());\n\t\t}\n\t\tv.sort(null);\n\t\twhile (v.size() > 1) {\n\t\t\tdouble vv = (v.remove(0) + v.remove(0)) / 2;\n\t\t\tint idx = Collections.binarySearch(v, vv);\n\t\t\tif (idx >= 0) {\n\t\t\t\tv.add(idx, vv);\n\t\t\t}\n\t\t\telse if (idx == -1) {\n\t\t\t\tv.add(vv);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (-idx < v.size()) {\n\t\t\t\t\tv.add(-idx, vv);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tv.add(vv);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(v.get(0));\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq v_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nv_1 v_2 \\ldots v_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n3 4\n\nSample Output 1\n\n3.5\n\nIf you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.\n\nPrinting 3.50001, 3.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n500 300 200\n\nSample Output 2\n\n375\n\nYou start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:\n\nUse the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.\n\nUse the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.\n\nUse the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.\n\nThus, the maximum possible value of the last ingredient remaining is 375.\n\nPrinting 375.0 and so on will also be accepted.\n\nSample Input 3\n\n5\n138 138 138 138 138\n\nSample Output 3\n\n138", "sample_input": "2\n3 4\n"}, "reference_outputs": ["3.5\n"], "source_document_id": "p02935", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq v_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nv_1 v_2 \\ldots v_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n3 4\n\nSample Output 1\n\n3.5\n\nIf you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.\n\nPrinting 3.50001, 3.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n500 300 200\n\nSample Output 2\n\n375\n\nYou start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:\n\nUse the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.\n\nUse the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.\n\nUse the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.\n\nThus, the maximum possible value of the last ingredient remaining is 375.\n\nPrinting 375.0 and so on will also be accepted.\n\nSample Input 3\n\n5\n138 138 138 138 138\n\nSample Output 3\n\n138", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 720, "cpu_time_ms": 115, "memory_kb": 23252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s412300812", "group_id": "codeNet:p02937", "input_text": "import java.io.ByteArrayInputStream;\nimport java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n main1(sc);\n }\n\n private static class KP {\n \tchar a;\n \tlong index;\n\n \tKP(char a, long index) {\n \t\tthis.a = a;\n \t\tthis.index = index;\n \t}\n\n \tpublic String toString() {\n \t\treturn \"{c:\" + a + \", i\" + index + \"}\";\n \t}\n }\n\n public static void main1(Scanner sc) {\n\n \tString base = sc.next();\n \tString target = sc.next();\n\n \tHashSet bs = new HashSet(50);\n \tHashSet cs = new HashSet(50);\n\n \tfor (char c : base.toCharArray()) {\n \t\tcs.add(c);\n \t}\n\n \tLinkedList l = new LinkedList();\n \tint i = 0;\n \tfor (char c : base.toCharArray()) {\n \t\tbs.add(c);\n \t\tif (cs.contains(c)) {\n \t\t\tl.add(new KP(c, i));\n \t\t}\n \t\ti++;\n \t}\n\n \tfor (char c: target.toCharArray()) {\n \t\tif (!bs.contains(c)) {\n \t\t\tSystem.out.println(\"-1\");\n \t\t\treturn;\n \t\t}\n \t}\n\n \tint cnt = 0;\n \tchar[] tgt = target.toCharArray();\n \tfor (int k = 0; k < 100000; k++) {\n \t\tfor (KP ent: l) {\n \t\t\tif (tgt[cnt] == ent.a) {\n \t\t\t\tif (cnt < tgt.length -1 ) {\n \t\t\t\tcnt++;\n \t\t\t\t} else {\n \t\t\t\t\tSystem.out.println((k) * base.length() + ent.index + 1);\n \t\t\t\t\treturn;\n \t\t\t\t}\n \t\t\t}\n \t\t}\n \t}\n\n }\n\n\tpublic static void maina(String[] args) throws Exception {\n\t\tString in2 = \"contest\\r\\n\" +\n\t\t\t\t\"son\";\n\n\t\tString in3 = \"contest\\r\\n\" +\n\t\t\t\t\"programming\";\n\n\t\tString in = \"contest\\r\\n\" +\n\t\t\t\t\"sentence\";\n\n\t\tScanner sc = new Scanner(new ByteArrayInputStream(in.getBytes()));\n\t\tmain1(sc);\n\t}\n}", "language": "Java", "metadata": {"date": 1566332703, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02937.html", "problem_id": "p02937", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02937/input.txt", "sample_output_relpath": "derived/input_output/data/p02937/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02937/Java/s412300812.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s412300812", "user_id": "u804922227"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.io.ByteArrayInputStream;\nimport java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n main1(sc);\n }\n\n private static class KP {\n \tchar a;\n \tlong index;\n\n \tKP(char a, long index) {\n \t\tthis.a = a;\n \t\tthis.index = index;\n \t}\n\n \tpublic String toString() {\n \t\treturn \"{c:\" + a + \", i\" + index + \"}\";\n \t}\n }\n\n public static void main1(Scanner sc) {\n\n \tString base = sc.next();\n \tString target = sc.next();\n\n \tHashSet bs = new HashSet(50);\n \tHashSet cs = new HashSet(50);\n\n \tfor (char c : base.toCharArray()) {\n \t\tcs.add(c);\n \t}\n\n \tLinkedList l = new LinkedList();\n \tint i = 0;\n \tfor (char c : base.toCharArray()) {\n \t\tbs.add(c);\n \t\tif (cs.contains(c)) {\n \t\t\tl.add(new KP(c, i));\n \t\t}\n \t\ti++;\n \t}\n\n \tfor (char c: target.toCharArray()) {\n \t\tif (!bs.contains(c)) {\n \t\t\tSystem.out.println(\"-1\");\n \t\t\treturn;\n \t\t}\n \t}\n\n \tint cnt = 0;\n \tchar[] tgt = target.toCharArray();\n \tfor (int k = 0; k < 100000; k++) {\n \t\tfor (KP ent: l) {\n \t\t\tif (tgt[cnt] == ent.a) {\n \t\t\t\tif (cnt < tgt.length -1 ) {\n \t\t\t\tcnt++;\n \t\t\t\t} else {\n \t\t\t\t\tSystem.out.println((k) * base.length() + ent.index + 1);\n \t\t\t\t\treturn;\n \t\t\t\t}\n \t\t\t}\n \t\t}\n \t}\n\n }\n\n\tpublic static void maina(String[] args) throws Exception {\n\t\tString in2 = \"contest\\r\\n\" +\n\t\t\t\t\"son\";\n\n\t\tString in3 = \"contest\\r\\n\" +\n\t\t\t\t\"programming\";\n\n\t\tString in = \"contest\\r\\n\" +\n\t\t\t\t\"sentence\";\n\n\t\tScanner sc = new Scanner(new ByteArrayInputStream(in.getBytes()));\n\t\tmain1(sc);\n\t}\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.\n\nLet s' be the concatenation of 10^{100} copies of s. t is a subsequence of the string {s'}_1{s'}_2\\ldots{s'}_i (the first i characters in s').\n\nNotes\n\nA subsequence of a string a is a string obtained by deleting zero or more characters from a and concatenating the remaining characters without changing the relative order. For example, the subsequences of contest include net, c, and contest.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\n1 \\leq |t| \\leq 10^5\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf there exists an integer i satisfying the following condition, print the minimum such i; otherwise, print -1.\n\nSample Input 1\n\ncontest\nson\n\nSample Output 1\n\n10\n\nt = son is a subsequence of the string contestcon (the first 10 characters in s' = contestcontestcontest...), so i = 10 satisfies the condition.\n\nOn the other hand, t is not a subsequence of the string contestco (the first 9 characters in s'), so i = 9 does not satisfy the condition.\n\nSimilarly, any integer less than 9 does not satisfy the condition, either. Thus, the minimum integer i satisfying the condition is 10.\n\nSample Input 2\n\ncontest\nprogramming\n\nSample Output 2\n\n-1\n\nt = programming is not a substring of s' = contestcontestcontest.... Thus, there is no integer i satisfying the condition.\n\nSample Input 3\n\ncontest\nsentence\n\nSample Output 3\n\n33\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "contest\nson\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02937", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.\n\nLet s' be the concatenation of 10^{100} copies of s. t is a subsequence of the string {s'}_1{s'}_2\\ldots{s'}_i (the first i characters in s').\n\nNotes\n\nA subsequence of a string a is a string obtained by deleting zero or more characters from a and concatenating the remaining characters without changing the relative order. For example, the subsequences of contest include net, c, and contest.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\n1 \\leq |t| \\leq 10^5\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf there exists an integer i satisfying the following condition, print the minimum such i; otherwise, print -1.\n\nSample Input 1\n\ncontest\nson\n\nSample Output 1\n\n10\n\nt = son is a subsequence of the string contestcon (the first 10 characters in s' = contestcontestcontest...), so i = 10 satisfies the condition.\n\nOn the other hand, t is not a subsequence of the string contestco (the first 9 characters in s'), so i = 9 does not satisfy the condition.\n\nSimilarly, any integer less than 9 does not satisfy the condition, either. Thus, the minimum integer i satisfying the condition is 10.\n\nSample Input 2\n\ncontest\nprogramming\n\nSample Output 2\n\n-1\n\nt = programming is not a substring of s' = contestcontestcontest.... Thus, there is no integer i satisfying the condition.\n\nSample Input 3\n\ncontest\nsentence\n\nSample Output 3\n\n33\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1772, "cpu_time_ms": 2109, "memory_kb": 32500}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s654331507", "group_id": "codeNet:p02937", "input_text": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport java.util.function.Function;\nimport java.util.stream.Collectors;\n\n@SuppressWarnings(\"unused\")\npublic class Main {\n FastScanner in = new FastScanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n final int MOD = (int)1e9+7;\n void printlnYN(boolean b){out.println((b ? \"Yes\" : \"No\"));}\n\n void solve() throws Exception{\n String s = in.nextStr(), t = in.nextStr();\n ArrayList> alp = new ArrayList<>();\n for(int i = 0; i < 26; i++) alp.add(new ArrayList<>());\n for(int i = 0; i < s.length(); i++){\n alp.get(s.charAt(i)-'a').add(i);\n }\n\n for(int i = 0; i < t.length(); i++){\n if(alp.get(t.charAt(i)-'a').size() == 0){\n out.println(\"-1\");\n return;\n }\n }\n\n\n long len = 0;\n int num = 1, now = -1;\n for(int i = 0; i < t.length(); i++){\n int index = (t.charAt(i)-'a');\n int d = lowerBound(alp.get(index), now);\n if(d == alp.get(index).size()){\n num++;\n len += s.length();\n now = alp.get(index).get(0);\n }else{\n now = alp.get(index).get(d);\n }\n }\n out.println((1 + now + len));\n\n }\n\n int lowerBound(ArrayList a, int key){\n int ng = -1;\n int ok = a.size();\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2;\n if(a.get(mid) > key) ok = mid;\n else ng = mid;\n }\n return ok;\n }\n\n public static void main(String[] args) throws Exception {\n new Main().m();\n }\n\n void m() throws Exception {\n solve();\n out.flush();\n }\n\n static class FastScanner {\n Reader input;\n\n FastScanner() {this(System.in);}\n FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n\n int nextInt() {return (int) nextLong();}\n\n long nextLong() {\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }\n\n double nextDouble() {\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }\n\n char nextChar() {\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }\n\n String nextStr() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n\n public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }\n\n public int[] nextIntArrayDec(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }\n\n public int[] nextIntArray1Index(int n) {\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }\n\n public long[] nextLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }\n\n public long[] nextLongArrayDec(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }\n\n public long[] nextLongArray1Index(int n) {\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }\n\n public double[] nextDoubleArray(int n) {\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }\n }\n}\n/* end Main */\n", "language": "Java", "metadata": {"date": 1566179365, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02937.html", "problem_id": "p02937", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02937/input.txt", "sample_output_relpath": "derived/input_output/data/p02937/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02937/Java/s654331507.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s654331507", "user_id": "u234826697"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport java.util.function.Function;\nimport java.util.stream.Collectors;\n\n@SuppressWarnings(\"unused\")\npublic class Main {\n FastScanner in = new FastScanner(System.in);\n PrintWriter out = new PrintWriter(System.out);\n final int MOD = (int)1e9+7;\n void printlnYN(boolean b){out.println((b ? \"Yes\" : \"No\"));}\n\n void solve() throws Exception{\n String s = in.nextStr(), t = in.nextStr();\n ArrayList> alp = new ArrayList<>();\n for(int i = 0; i < 26; i++) alp.add(new ArrayList<>());\n for(int i = 0; i < s.length(); i++){\n alp.get(s.charAt(i)-'a').add(i);\n }\n\n for(int i = 0; i < t.length(); i++){\n if(alp.get(t.charAt(i)-'a').size() == 0){\n out.println(\"-1\");\n return;\n }\n }\n\n\n long len = 0;\n int num = 1, now = -1;\n for(int i = 0; i < t.length(); i++){\n int index = (t.charAt(i)-'a');\n int d = lowerBound(alp.get(index), now);\n if(d == alp.get(index).size()){\n num++;\n len += s.length();\n now = alp.get(index).get(0);\n }else{\n now = alp.get(index).get(d);\n }\n }\n out.println((1 + now + len));\n\n }\n\n int lowerBound(ArrayList a, int key){\n int ng = -1;\n int ok = a.size();\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2;\n if(a.get(mid) > key) ok = mid;\n else ng = mid;\n }\n return ok;\n }\n\n public static void main(String[] args) throws Exception {\n new Main().m();\n }\n\n void m() throws Exception {\n solve();\n out.flush();\n }\n\n static class FastScanner {\n Reader input;\n\n FastScanner() {this(System.in);}\n FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n\n int nextInt() {return (int) nextLong();}\n\n long nextLong() {\n try {\n int sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n long ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) return ret * sign;\n ret *= 10;\n ret += b - '0';\n }\n } catch (IOException e) {\n e.printStackTrace();\n return -1;\n }\n }\n\n double nextDouble() {\n try {\n double sign = 1;\n int b = input.read();\n while ((b < '0' || '9' < b) && b != '-' && b != '+') {\n b = input.read();\n }\n if (b == '-') {\n sign = -1;\n b = input.read();\n } else if (b == '+') {\n b = input.read();\n }\n double ret = b - '0';\n while (true) {\n b = input.read();\n if (b < '0' || '9' < b) break;\n ret *= 10;\n ret += b - '0';\n }\n if (b != '.') return sign * ret;\n double div = 1;\n b = input.read();\n while ('0' <= b && b <= '9') {\n ret *= 10;\n ret += b - '0';\n div *= 10;\n b = input.read();\n }\n return sign * ret / div;\n } catch (IOException e) {\n e.printStackTrace();\n return Double.NaN;\n }\n }\n\n char nextChar() {\n try {\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n return (char) b;\n } catch (IOException e) {\n e.printStackTrace();\n return 0;\n }\n }\n\n String nextStr() {\n try {\n StringBuilder sb = new StringBuilder();\n int b = input.read();\n while (Character.isWhitespace(b)) {\n b = input.read();\n }\n while (b != -1 && !Character.isWhitespace(b)) {\n sb.append((char) b);\n b = input.read();\n }\n return sb.toString();\n } catch (IOException e) {\n e.printStackTrace();\n return \"\";\n }\n }\n\n public int[] nextIntArray(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt();\n }\n return res;\n }\n\n public int[] nextIntArrayDec(int n) {\n int[] res = new int[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextInt() - 1;\n }\n return res;\n }\n\n public int[] nextIntArray1Index(int n) {\n int[] res = new int[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextInt();\n }\n return res;\n }\n\n public long[] nextLongArray(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong();\n }\n return res;\n }\n\n public long[] nextLongArrayDec(int n) {\n long[] res = new long[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextLong() - 1;\n }\n return res;\n }\n\n public long[] nextLongArray1Index(int n) {\n long[] res = new long[n + 1];\n for (int i = 0; i < n; i++) {\n res[i + 1] = nextLong();\n }\n return res;\n }\n\n public double[] nextDoubleArray(int n) {\n double[] res = new double[n];\n for (int i = 0; i < n; i++) {\n res[i] = nextDouble();\n }\n return res;\n }\n }\n}\n/* end Main */\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.\n\nLet s' be the concatenation of 10^{100} copies of s. t is a subsequence of the string {s'}_1{s'}_2\\ldots{s'}_i (the first i characters in s').\n\nNotes\n\nA subsequence of a string a is a string obtained by deleting zero or more characters from a and concatenating the remaining characters without changing the relative order. For example, the subsequences of contest include net, c, and contest.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\n1 \\leq |t| \\leq 10^5\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf there exists an integer i satisfying the following condition, print the minimum such i; otherwise, print -1.\n\nSample Input 1\n\ncontest\nson\n\nSample Output 1\n\n10\n\nt = son is a subsequence of the string contestcon (the first 10 characters in s' = contestcontestcontest...), so i = 10 satisfies the condition.\n\nOn the other hand, t is not a subsequence of the string contestco (the first 9 characters in s'), so i = 9 does not satisfy the condition.\n\nSimilarly, any integer less than 9 does not satisfy the condition, either. Thus, the minimum integer i satisfying the condition is 10.\n\nSample Input 2\n\ncontest\nprogramming\n\nSample Output 2\n\n-1\n\nt = programming is not a substring of s' = contestcontestcontest.... Thus, there is no integer i satisfying the condition.\n\nSample Input 3\n\ncontest\nsentence\n\nSample Output 3\n\n33\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "contest\nson\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02937", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.\n\nLet s' be the concatenation of 10^{100} copies of s. t is a subsequence of the string {s'}_1{s'}_2\\ldots{s'}_i (the first i characters in s').\n\nNotes\n\nA subsequence of a string a is a string obtained by deleting zero or more characters from a and concatenating the remaining characters without changing the relative order. For example, the subsequences of contest include net, c, and contest.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\n1 \\leq |t| \\leq 10^5\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf there exists an integer i satisfying the following condition, print the minimum such i; otherwise, print -1.\n\nSample Input 1\n\ncontest\nson\n\nSample Output 1\n\n10\n\nt = son is a subsequence of the string contestcon (the first 10 characters in s' = contestcontestcontest...), so i = 10 satisfies the condition.\n\nOn the other hand, t is not a subsequence of the string contestco (the first 9 characters in s'), so i = 9 does not satisfy the condition.\n\nSimilarly, any integer less than 9 does not satisfy the condition, either. Thus, the minimum integer i satisfying the condition is 10.\n\nSample Input 2\n\ncontest\nprogramming\n\nSample Output 2\n\n-1\n\nt = programming is not a substring of s' = contestcontestcontest.... Thus, there is no integer i satisfying the condition.\n\nSample Input 3\n\ncontest\nsentence\n\nSample Output 3\n\n33\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6541, "cpu_time_ms": 179, "memory_kb": 30616}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s355209796", "group_id": "codeNet:p02945", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n System.out.println(Math.max(a*b,Math.max(a+b,a-b)));\n }\n}\n", "language": "Java", "metadata": {"date": 1591309321, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02945.html", "problem_id": "p02945", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02945/input.txt", "sample_output_relpath": "derived/input_output/data/p02945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02945/Java/s355209796.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s355209796", "user_id": "u578775554"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n System.out.println(Math.max(a*b,Math.max(a+b,a-b)));\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "sample_input": "-13 3\n"}, "reference_outputs": ["-10\n"], "source_document_id": "p02945", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 304, "cpu_time_ms": 95, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s996420444", "group_id": "codeNet:p02947", "input_text": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tString s[] = new String[N];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\ts[i] = sc.next();\n\t\t}\n\t\tString t[] = new String[N];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tchar[] chars = s[i].toCharArray();\n\t\t\tArrays.sort(chars);\n\t\t\tt[i] = new String(chars);\n\t\t}\n\t\tArrays.sort(t);\n\t\tlong ans = 0;\n\t\tint tmp = 0;\n\t\tfor (int i = 0; i < N - 1; i++) {\n\t\t\tif (t[i].equals(t[i + 1])) {\n\t\t\t\ttmp++;\n\t\t\t} else {\n\t\t\t\tif (tmp >= 1) {\n\t\t\t\t\tans += (tmp+1)*tmp/2; \n\t\t\t\t\ttmp = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (tmp >= 0) {\n\t\t\tans += (tmp+1)*tmp/2; \n\t\t\ttmp = 0;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}", "language": "Java", "metadata": {"date": 1572208692, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02947.html", "problem_id": "p02947", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02947/input.txt", "sample_output_relpath": "derived/input_output/data/p02947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02947/Java/s996420444.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s996420444", "user_id": "u881359256"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tString s[] = new String[N];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\ts[i] = sc.next();\n\t\t}\n\t\tString t[] = new String[N];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tchar[] chars = s[i].toCharArray();\n\t\t\tArrays.sort(chars);\n\t\t\tt[i] = new String(chars);\n\t\t}\n\t\tArrays.sort(t);\n\t\tlong ans = 0;\n\t\tint tmp = 0;\n\t\tfor (int i = 0; i < N - 1; i++) {\n\t\t\tif (t[i].equals(t[i + 1])) {\n\t\t\t\ttmp++;\n\t\t\t} else {\n\t\t\t\tif (tmp >= 1) {\n\t\t\t\t\tans += (tmp+1)*tmp/2; \n\t\t\t\t\ttmp = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (tmp >= 0) {\n\t\t\tans += (tmp+1)*tmp/2; \n\t\t\ttmp = 0;\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "3\nacornistnt\npeanutbomb\nconstraint\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02947", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 730, "cpu_time_ms": 564, "memory_kb": 52096}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s150751547", "group_id": "codeNet:p02947", "input_text": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.TreeMap;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong count = 0L;\n\t\tbyte[][] array = new byte[n][26];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString s = sc.next();\n\t\t\tfor (int j = 0; j < 10; j++) {\n\t\t\t\tarray[i][(int) (s.charAt(j) - 'a')]++;\n\t\t\t}\n\t\t}\n\t\tboolean[] flagArray = new boolean[n];\n\t\tArrays.fill(flagArray, true);\n\t\tfor (int i = 0; i < n - 1; i++) {\n\t\t\tlong tmpCount = 0L;\n\t\t\tif (!flagArray[i]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tboolean[] tmpflag = new boolean[n];\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tif (!flagArray[j]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tboolean flag = true;\n\t\t\t\tfor (int k = 0; k < array[i].length; k++) {\n\t\t\t\t\tif (array[i][k] != array[j][k]) {\n\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (flag) {\n\t\t\t\t\ttmpflag[j] = true;\n\t\t\t\t\t++tmpCount;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int j = 0; j < tmpflag.length; j++) {\n\t\t\t\tif (tmpflag[j]) {\n\t\t\t\t\tflagArray[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttmpCount = (long) Math.pow(tmpCount, 2);\n\t\t\tif (tmpCount > 1) {\n\t\t\t\t--tmpCount;\n\t\t\t}\n\t\t\tcount += tmpCount;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1566502982, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02947.html", "problem_id": "p02947", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02947/input.txt", "sample_output_relpath": "derived/input_output/data/p02947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02947/Java/s150751547.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s150751547", "user_id": "u289565504"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.TreeMap;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tlong count = 0L;\n\t\tbyte[][] array = new byte[n][26];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tString s = sc.next();\n\t\t\tfor (int j = 0; j < 10; j++) {\n\t\t\t\tarray[i][(int) (s.charAt(j) - 'a')]++;\n\t\t\t}\n\t\t}\n\t\tboolean[] flagArray = new boolean[n];\n\t\tArrays.fill(flagArray, true);\n\t\tfor (int i = 0; i < n - 1; i++) {\n\t\t\tlong tmpCount = 0L;\n\t\t\tif (!flagArray[i]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tboolean[] tmpflag = new boolean[n];\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tif (!flagArray[j]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tboolean flag = true;\n\t\t\t\tfor (int k = 0; k < array[i].length; k++) {\n\t\t\t\t\tif (array[i][k] != array[j][k]) {\n\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (flag) {\n\t\t\t\t\ttmpflag[j] = true;\n\t\t\t\t\t++tmpCount;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int j = 0; j < tmpflag.length; j++) {\n\t\t\t\tif (tmpflag[j]) {\n\t\t\t\t\tflagArray[j] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttmpCount = (long) Math.pow(tmpCount, 2);\n\t\t\tif (tmpCount > 1) {\n\t\t\t\t--tmpCount;\n\t\t\t}\n\t\t\tcount += tmpCount;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "3\nacornistnt\npeanutbomb\nconstraint\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02947", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1328, "cpu_time_ms": 2110, "memory_kb": 96840}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s396827282", "group_id": "codeNet:p02947", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tString[] str = new String[n];\n\n\t\tfor (int i = 0; i < n; i ++) {\n\t\t\tchar[] arr = sc.next().toCharArray();\n\t\t\tArrays.sort(arr);\n\t\t\tstr[i] = String.valueOf(arr);\n\t\t}\n\n\t\tArrays.sort(str);\n\n\t\tint ans = 0;\n\t\tint same = 1;\n\t\tfor (int i = 0; i < n - 1; i++) {\n\t\t\tif (str[i].equals(str[i + 1])) {\n\t\t\t\tsame++;\n\t\t\t} else {\n\t\t\t\tans += cmb(same);\n\t\t\t\tsame = 1;\n\t\t\t}\n\n\t\t\tif (i == n - 2) {\n\t\t\t\tans += cmb(same);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n\n\tstatic long cmb(long n) {\n\t\tlong c = 1;\n\t\tfor (long i = n; i > 0; i--)\n\t\t\tc *= i;\n\t\treturn c / 2;\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1565487194, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02947.html", "problem_id": "p02947", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02947/input.txt", "sample_output_relpath": "derived/input_output/data/p02947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02947/Java/s396827282.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s396827282", "user_id": "u818498408"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tString[] str = new String[n];\n\n\t\tfor (int i = 0; i < n; i ++) {\n\t\t\tchar[] arr = sc.next().toCharArray();\n\t\t\tArrays.sort(arr);\n\t\t\tstr[i] = String.valueOf(arr);\n\t\t}\n\n\t\tArrays.sort(str);\n\n\t\tint ans = 0;\n\t\tint same = 1;\n\t\tfor (int i = 0; i < n - 1; i++) {\n\t\t\tif (str[i].equals(str[i + 1])) {\n\t\t\t\tsame++;\n\t\t\t} else {\n\t\t\t\tans += cmb(same);\n\t\t\t\tsame = 1;\n\t\t\t}\n\n\t\t\tif (i == n - 2) {\n\t\t\t\tans += cmb(same);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n\n\tstatic long cmb(long n) {\n\t\tlong c = 1;\n\t\tfor (long i = n; i > 0; i--)\n\t\t\tc *= i;\n\t\treturn c / 2;\n\t}\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "3\nacornistnt\npeanutbomb\nconstraint\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02947", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 731, "cpu_time_ms": 585, "memory_kb": 49664}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s157347991", "group_id": "codeNet:p02951", "input_text": "import java.util.*;\nimport java.io.*;\nimport static java.lang.System.*;\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}\n\nclass Main {\n public static final int MOD = 1000000007;\n public static final int INF = 1000000000;\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n out.println(Math.max(0, C - (A-B) ) );\n }\n}", "language": "Java", "metadata": {"date": 1564966966, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02951.html", "problem_id": "p02951", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02951/input.txt", "sample_output_relpath": "derived/input_output/data/p02951/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02951/Java/s157347991.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s157347991", "user_id": "u593180859"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\nimport static java.lang.System.*;\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}\n\nclass Main {\n public static final int MOD = 1000000007;\n public static final int INF = 1000000000;\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n out.println(Math.max(0, C - (A-B) ) );\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "sample_input": "6 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02951", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2344, "cpu_time_ms": 70, "memory_kb": 22868}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s177392679", "group_id": "codeNet:p02952", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int ans = 0;\n for(int i = 1; i <= n; i++){\n String s = String.valueOf(i);\n ans += s.length()%2 != 0 ? 1 : 0;\n }\n System.out.println(ans);\n }\n}\n", "language": "Java", "metadata": {"date": 1591488362, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02952.html", "problem_id": "p02952", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02952/input.txt", "sample_output_relpath": "derived/input_output/data/p02952/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02952/Java/s177392679.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s177392679", "user_id": "u578775554"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int ans = 0;\n for(int i = 1; i <= n; i++){\n String s = String.valueOf(i);\n ans += s.length()%2 != 0 ? 1 : 0;\n }\n System.out.println(ans);\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of positive integers less than or equal to N that have an odd number of digits (in base ten without leading zeros).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of positive integers less than or equal to N that have an odd number of digits.\n\nSample Input 1\n\n11\n\nSample Output 1\n\n9\n\nAmong the positive integers less than or equal to 11, nine integers have an odd number of digits: 1, 2, \\ldots, 9.\n\nSample Input 2\n\n136\n\nSample Output 2\n\n46\n\nIn addition to 1, 2, \\ldots, 9, another 37 integers also have an odd number of digits: 100, 101, \\ldots, 136.\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n90909", "sample_input": "11\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02952", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of positive integers less than or equal to N that have an odd number of digits (in base ten without leading zeros).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of positive integers less than or equal to N that have an odd number of digits.\n\nSample Input 1\n\n11\n\nSample Output 1\n\n9\n\nAmong the positive integers less than or equal to 11, nine integers have an odd number of digits: 1, 2, \\ldots, 9.\n\nSample Input 2\n\n136\n\nSample Output 2\n\n46\n\nIn addition to 1, 2, \\ldots, 9, another 37 integers also have an odd number of digits: 100, 101, \\ldots, 136.\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n90909", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 402, "cpu_time_ms": 125, "memory_kb": 28372}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s486720127", "group_id": "codeNet:p02952", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint odd = 0;\n\t\t\n\t\tfor(int i=1; i<=N; i++) {\n\t\t\tString tmp = String.valueOf(i);\n\t\t\tif(tmp.length() % 2 != 0) {\n\t\t\t\todd++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(odd);\n\t\tsc.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1574892868, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02952.html", "problem_id": "p02952", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02952/input.txt", "sample_output_relpath": "derived/input_output/data/p02952/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02952/Java/s486720127.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s486720127", "user_id": "u919902859"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint odd = 0;\n\t\t\n\t\tfor(int i=1; i<=N; i++) {\n\t\t\tString tmp = String.valueOf(i);\n\t\t\tif(tmp.length() % 2 != 0) {\n\t\t\t\todd++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(odd);\n\t\tsc.close();\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of positive integers less than or equal to N that have an odd number of digits (in base ten without leading zeros).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of positive integers less than or equal to N that have an odd number of digits.\n\nSample Input 1\n\n11\n\nSample Output 1\n\n9\n\nAmong the positive integers less than or equal to 11, nine integers have an odd number of digits: 1, 2, \\ldots, 9.\n\nSample Input 2\n\n136\n\nSample Output 2\n\n46\n\nIn addition to 1, 2, \\ldots, 9, another 37 integers also have an odd number of digits: 100, 101, \\ldots, 136.\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n90909", "sample_input": "11\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02952", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of positive integers less than or equal to N that have an odd number of digits (in base ten without leading zeros).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of positive integers less than or equal to N that have an odd number of digits.\n\nSample Input 1\n\n11\n\nSample Output 1\n\n9\n\nAmong the positive integers less than or equal to 11, nine integers have an odd number of digits: 1, 2, \\ldots, 9.\n\nSample Input 2\n\n136\n\nSample Output 2\n\n46\n\nIn addition to 1, 2, \\ldots, 9, another 37 integers also have an odd number of digits: 100, 101, \\ldots, 136.\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n90909", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 125, "memory_kb": 30420}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s007338367", "group_id": "codeNet:p02954", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n char[] c = sc.next().toCharArray();\n int[] cnt = new int[c.length];\n\n for (int i = 0; i < c.length; i++) {\n int index = i;\n int tmp = 0;\n while (c[i] == c[index]) {\n if (c[index] == 'R')\n index++;\n else\n index--;\n tmp++;\n }\n\n if (tmp % 2 != 0) {\n if (c[index] == 'R')\n index++;\n else\n index--;\n }\n cnt[index]++;\n }\n\n for (int i = 0; i < c.length; i++) {\n System.out.print(cnt[i] + \" \");\n }\n }\n}", "language": "Java", "metadata": {"date": 1565049585, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02954.html", "problem_id": "p02954", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02954/input.txt", "sample_output_relpath": "derived/input_output/data/p02954/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02954/Java/s007338367.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s007338367", "user_id": "u387806792"}, "prompt_components": {"gold_output": "0 1 2 1 1\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n char[] c = sc.next().toCharArray();\n int[] cnt = new int[c.length];\n\n for (int i = 0; i < c.length; i++) {\n int index = i;\n int tmp = 0;\n while (c[i] == c[index]) {\n if (c[index] == 'R')\n index++;\n else\n index--;\n tmp++;\n }\n\n if (tmp % 2 != 0) {\n if (c[index] == 'R')\n index++;\n else\n index--;\n }\n cnt[index]++;\n }\n\n for (int i = 0; i < c.length; i++) {\n System.out.print(cnt[i] + \" \");\n }\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of L and R.\n\nLet N be the length of S. There are N squares arranged from left to right, and the i-th character of S from the left is written on the i-th square from the left.\n\nThe character written on the leftmost square is always R, and the character written on the rightmost square is always L.\n\nInitially, one child is standing on each square.\n\nEach child will perform the move below 10^{100} times:\n\nMove one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.\n\nFind the number of children standing on each square after the children performed the moves.\n\nConstraints\n\nS is a string of length between 2 and 10^5 (inclusive).\n\nEach character of S is L or R.\n\nThe first and last characters of S are R and L, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of children standing on each square after the children performed the moves, in order from left to right.\n\nSample Input 1\n\nRRLRL\n\nSample Output 1\n\n0 1 2 1 1\n\nAfter each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n\nAfter each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nAfter each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nSample Input 2\n\nRRLLLLRLRRLL\n\nSample Output 2\n\n0 3 3 0 0 0 1 1 0 2 2 0\n\nSample Input 3\n\nRRRLLRLLRRRLLLLL\n\nSample Output 3\n\n0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0", "sample_input": "RRLRL\n"}, "reference_outputs": ["0 1 2 1 1\n"], "source_document_id": "p02954", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of L and R.\n\nLet N be the length of S. There are N squares arranged from left to right, and the i-th character of S from the left is written on the i-th square from the left.\n\nThe character written on the leftmost square is always R, and the character written on the rightmost square is always L.\n\nInitially, one child is standing on each square.\n\nEach child will perform the move below 10^{100} times:\n\nMove one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.\n\nFind the number of children standing on each square after the children performed the moves.\n\nConstraints\n\nS is a string of length between 2 and 10^5 (inclusive).\n\nEach character of S is L or R.\n\nThe first and last characters of S are R and L, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of children standing on each square after the children performed the moves, in order from left to right.\n\nSample Input 1\n\nRRLRL\n\nSample Output 1\n\n0 1 2 1 1\n\nAfter each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n\nAfter each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nAfter each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nSample Input 2\n\nRRLLLLRLRRLL\n\nSample Output 2\n\n0 3 3 0 0 0 1 1 0 2 2 0\n\nSample Input 3\n\nRRRLLRLLRRRLLLLL\n\nSample Output 3\n\n0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 817, "cpu_time_ms": 2109, "memory_kb": 45112}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s981259297", "group_id": "codeNet:p02958", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\t//int array[] = new int [N];\n\t\tint tmp1 = sc.nextInt();\n\t\tint count = 0;\n\t\tint check1 = 0;\n\t\tint check2 = 0;\n\t\tint last = 0;\n\t\tint first = 0;\n\t\tint flag = 0;\n\t\t//int check1 = new int[3];\n\t\t//int check2 = new int[3];\n\t\tfor(int i = 0; i < N-1; i++) {\n\t\t\tint tmp2 = sc.nextInt();\n\t\t\tif(tmp1 > tmp2 ) {\n\t\t\t\tcount++;\n\t\t\t\tif(flag == 0) {\n\t\t\t\t\tcheck1 = tmp2;\n\t\t\t\t\tfirst = tmp1;\n\t\t\t\t\tflag++;\n\t\t\t\t}\n\t\t\t\tcheck2 = tmp1;\n\t\t\t\tlast = tmp2;\n\t\t\t\tif(count>=3) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttmp1 = tmp2;\n\t\t}\n\n\t\tif(count==1 || count>=3) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t}else if(check1<=last && count!=0) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t}else if(check2>=first && count!=0) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t}else {\n\t\t\tSystem.out.println(\"YES\");\n\t\t}\n\n\n\n\t}\n\n}", "language": "Java", "metadata": {"date": 1564278606, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02958.html", "problem_id": "p02958", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02958/input.txt", "sample_output_relpath": "derived/input_output/data/p02958/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02958/Java/s981259297.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981259297", "user_id": "u948694207"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\t//int array[] = new int [N];\n\t\tint tmp1 = sc.nextInt();\n\t\tint count = 0;\n\t\tint check1 = 0;\n\t\tint check2 = 0;\n\t\tint last = 0;\n\t\tint first = 0;\n\t\tint flag = 0;\n\t\t//int check1 = new int[3];\n\t\t//int check2 = new int[3];\n\t\tfor(int i = 0; i < N-1; i++) {\n\t\t\tint tmp2 = sc.nextInt();\n\t\t\tif(tmp1 > tmp2 ) {\n\t\t\t\tcount++;\n\t\t\t\tif(flag == 0) {\n\t\t\t\t\tcheck1 = tmp2;\n\t\t\t\t\tfirst = tmp1;\n\t\t\t\t\tflag++;\n\t\t\t\t}\n\t\t\t\tcheck2 = tmp1;\n\t\t\t\tlast = tmp2;\n\t\t\t\tif(count>=3) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttmp1 = tmp2;\n\t\t}\n\n\t\tif(count==1 || count>=3) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t}else if(check1<=last && count!=0) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t}else if(check2>=first && count!=0) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t}else {\n\t\t\tSystem.out.println(\"YES\");\n\t\t}\n\n\n\n\t}\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a sequence p = {p_1,\\ p_2,\\ ...,\\ p_N} which is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nYou can perform the following operation at most once: choose integers i and j (1 \\leq i < j \\leq N), and swap p_i and p_j. Note that you can also choose not to perform it.\n\nPrint YES if you can sort p in ascending order in this way, and NO otherwise.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\np is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 ... p_N\n\nOutput\n\nPrint YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.\n\nSample Input 1\n\n5\n5 2 3 4 1\n\nSample Output 1\n\nYES\n\nYou can sort p in ascending order by swapping p_1 and p_5.\n\nSample Input 2\n\n5\n2 4 3 5 1\n\nSample Output 2\n\nNO\n\nIn this case, swapping any two elements does not sort p in ascending order.\n\nSample Input 3\n\n7\n1 2 3 4 5 6 7\n\nSample Output 3\n\nYES\n\np is already sorted in ascending order, so no operation is needed.", "sample_input": "5\n5 2 3 4 1\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02958", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a sequence p = {p_1,\\ p_2,\\ ...,\\ p_N} which is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nYou can perform the following operation at most once: choose integers i and j (1 \\leq i < j \\leq N), and swap p_i and p_j. Note that you can also choose not to perform it.\n\nPrint YES if you can sort p in ascending order in this way, and NO otherwise.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\np is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 ... p_N\n\nOutput\n\nPrint YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.\n\nSample Input 1\n\n5\n5 2 3 4 1\n\nSample Output 1\n\nYES\n\nYou can sort p in ascending order by swapping p_1 and p_5.\n\nSample Input 2\n\n5\n2 4 3 5 1\n\nSample Output 2\n\nNO\n\nIn this case, swapping any two elements does not sort p in ascending order.\n\nSample Input 3\n\n7\n1 2 3 4 5 6 7\n\nSample Output 3\n\nYES\n\np is already sorted in ascending order, so no operation is needed.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 891, "cpu_time_ms": 107, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s551464371", "group_id": "codeNet:p02959", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int n = input.nextInt();\n int[] a = new int[100005];\n int[] b = new int[100005];\n for(int i = 0; i < n + 1; ++i){\n a[i] = input.nextInt();\n }\n for(int i = 0; i < n; ++i){\n b[i] = input.nextInt();\n }\n long sum = 0;\n for(int i = 0; i < n + 1; ++i){\n if(i == 0){\n if(b[i] > a[i]){\n sum += a[i];\n b[i] -= a[i];\n }\n else{\n sum += b[i];\n b[i] = 0;\n }\n }\n else{\n if(b[i - 1] > a[i]){\n sum += a[i];\n b[i - 1] -= a[i];\n }\n else{\n a[i] -= b[i - 1];\n sum += b[i - 1];\n b[i - 1] = 0;\n }\n if(b[i] > a[i]){\n sum += a[i];\n b[i] -= a[i];\n }\n else{\n sum += b[i];\n b[i] = 0;\n }\n }\n }\n System.out.println(sum);\n }\n}\n", "language": "Java", "metadata": {"date": 1584199928, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02959.html", "problem_id": "p02959", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02959/input.txt", "sample_output_relpath": "derived/input_output/data/p02959/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02959/Java/s551464371.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s551464371", "user_id": "u343463670"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner input = new Scanner(System.in);\n int n = input.nextInt();\n int[] a = new int[100005];\n int[] b = new int[100005];\n for(int i = 0; i < n + 1; ++i){\n a[i] = input.nextInt();\n }\n for(int i = 0; i < n; ++i){\n b[i] = input.nextInt();\n }\n long sum = 0;\n for(int i = 0; i < n + 1; ++i){\n if(i == 0){\n if(b[i] > a[i]){\n sum += a[i];\n b[i] -= a[i];\n }\n else{\n sum += b[i];\n b[i] = 0;\n }\n }\n else{\n if(b[i - 1] > a[i]){\n sum += a[i];\n b[i - 1] -= a[i];\n }\n else{\n a[i] -= b[i - 1];\n sum += b[i - 1];\n b[i - 1] = 0;\n }\n if(b[i] > a[i]){\n sum += a[i];\n b[i] -= a[i];\n }\n else{\n sum += b[i];\n b[i] = 0;\n }\n }\n }\n System.out.println(sum);\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N+1 towns. The i-th town is being attacked by A_i monsters.\n\nWe have N heroes. The i-th hero can defeat monsters attacking the i-th or (i+1)-th town, for a total of at most B_i monsters.\n\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N+1}\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the maximum total number of monsters the heroes can defeat.\n\nSample Input 1\n\n2\n3 5 2\n4 5\n\nSample Output 1\n\n9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\nThe first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n\nThe second hero defeats three monsters attacking the second town and two monsters attacking the third town.\n\nSample Input 2\n\n3\n5 6 3 8\n5 100 8\n\nSample Output 2\n\n22\n\nSample Input 3\n\n2\n100 1 1\n1 100\n\nSample Output 3\n\n3", "sample_input": "2\n3 5 2\n4 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02959", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N+1 towns. The i-th town is being attacked by A_i monsters.\n\nWe have N heroes. The i-th hero can defeat monsters attacking the i-th or (i+1)-th town, for a total of at most B_i monsters.\n\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N+1}\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the maximum total number of monsters the heroes can defeat.\n\nSample Input 1\n\n2\n3 5 2\n4 5\n\nSample Output 1\n\n9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\nThe first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n\nThe second hero defeats three monsters attacking the second town and two monsters attacking the third town.\n\nSample Input 2\n\n3\n5 6 3 8\n5 100 8\n\nSample Output 2\n\n22\n\nSample Input 3\n\n2\n100 1 1\n1 100\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1311, "cpu_time_ms": 599, "memory_kb": 66168}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s161064174", "group_id": "codeNet:p02959", "input_text": "import java.util.*;\n\nclass Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int n=sc.nextInt();\n int[] a= new int[n+1];\n int[] b= new int[n];\n for(int i=0;i<=n;i++){\n a[i]=sc.nextInt();\n }\n for(int i=0;i A=new ArrayList<>();\n ArrayList>R=new ArrayList<>();\n for(int i=0;iB=new ArrayList<>();\n do {\n B.addAll(A);\n for(int i=0;i(B));\n if(R.size()>K)\n {\n break;\n }\n\n }while(B.size()!=0);\n long loop=R.size();\n ArrayList result=R.get((int)((K-1)%loop));\n StringBuilder br=new StringBuilder();\n for(int i :result){\n br.append(i);\n br.append(' ');\n }\n System.out.println(br.toString());\n\n\n\n }\n}\n", "language": "Java", "metadata": {"date": 1563765198, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02964.html", "problem_id": "p02964", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02964/input.txt", "sample_output_relpath": "derived/input_output/data/p02964/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02964/Java/s028771636.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s028771636", "user_id": "u142032032"}, "prompt_components": {"gold_output": "2 3\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n\n Scanner sc = new Scanner(System.in);\n // 整数の入力\n int N=sc.nextInt();\n long K=sc.nextLong();\n ArrayList A=new ArrayList<>();\n ArrayList>R=new ArrayList<>();\n for(int i=0;iB=new ArrayList<>();\n do {\n B.addAll(A);\n for(int i=0;i(B));\n if(R.size()>K)\n {\n break;\n }\n\n }while(B.size()!=0);\n long loop=R.size();\n ArrayList result=R.get((int)((K-1)%loop));\n StringBuilder br=new StringBuilder();\n for(int i :result){\n br.append(i);\n br.append(' ');\n }\n System.out.println(br.toString());\n\n\n\n }\n}\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a sequence of N \\times K integers: X=(X_0,X_1,\\cdots,X_{N \\times K-1}).\nIts elements are represented by another sequence of N integers: A=(A_0,A_1,\\cdots,A_{N-1}). For each pair i, j (0 \\leq i \\leq K-1,\\ 0 \\leq j \\leq N-1), X_{i \\times N + j}=A_j holds.\n\nSnuke has an integer sequence s, which is initially empty.\nFor each i=0,1,2,\\cdots,N \\times K-1, in this order, he will perform the following operation:\n\nIf s does not contain X_i: add X_i to the end of s.\n\nIf s does contain X_i: repeatedly delete the element at the end of s until s no longer contains X_i. Note that, in this case, we do not add X_i to the end of s.\n\nFind the elements of s after Snuke finished the operations.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq 10^{12}\n\n1 \\leq A_i \\leq 2 \\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_0 A_1 \\cdots A_{N-1}\n\nOutput\n\nPrint the elements of s after Snuke finished the operations, in order from beginning to end, with spaces in between.\n\nSample Input 1\n\n3 2\n1 2 3\n\nSample Output 1\n\n2 3\n\nIn this case, X=(1,2,3,1,2,3).\nWe will perform the operations as follows:\n\ni=0: s does not contain 1, so we add 1 to the end of s, resulting in s=(1).\n\ni=1: s does not contain 2, so we add 2 to the end of s, resulting in s=(1,2).\n\ni=2: s does not contain 3, so we add 3 to the end of s, resulting in s=(1,2,3).\n\ni=3: s does contain 1, so we repeatedly delete the element at the end of s as long as s contains 1, which causes the following changes to s: (1,2,3)→(1,2)→(1)→().\n\ni=4: s does not contain 2, so we add 2 to the end of s, resulting in s=(2).\n\ni=5: s does not contain 3, so we add 3 to the end of s, resulting in s=(2,3).\n\nSample Input 2\n\n5 10\n1 2 3 2 3\n\nSample Output 2\n\n3\n\nSample Input 3\n\n6 1000000000000\n1 1 2 2 3 3\n\nSample Output 3\n\ns may be empty in the end.\n\nSample Input 4\n\n11 97\n3 1 4 1 5 9 2 6 5 3 5\n\nSample Output 4\n\n9 2 6", "sample_input": "3 2\n1 2 3\n"}, "reference_outputs": ["2 3\n"], "source_document_id": "p02964", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a sequence of N \\times K integers: X=(X_0,X_1,\\cdots,X_{N \\times K-1}).\nIts elements are represented by another sequence of N integers: A=(A_0,A_1,\\cdots,A_{N-1}). For each pair i, j (0 \\leq i \\leq K-1,\\ 0 \\leq j \\leq N-1), X_{i \\times N + j}=A_j holds.\n\nSnuke has an integer sequence s, which is initially empty.\nFor each i=0,1,2,\\cdots,N \\times K-1, in this order, he will perform the following operation:\n\nIf s does not contain X_i: add X_i to the end of s.\n\nIf s does contain X_i: repeatedly delete the element at the end of s until s no longer contains X_i. Note that, in this case, we do not add X_i to the end of s.\n\nFind the elements of s after Snuke finished the operations.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq 10^{12}\n\n1 \\leq A_i \\leq 2 \\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_0 A_1 \\cdots A_{N-1}\n\nOutput\n\nPrint the elements of s after Snuke finished the operations, in order from beginning to end, with spaces in between.\n\nSample Input 1\n\n3 2\n1 2 3\n\nSample Output 1\n\n2 3\n\nIn this case, X=(1,2,3,1,2,3).\nWe will perform the operations as follows:\n\ni=0: s does not contain 1, so we add 1 to the end of s, resulting in s=(1).\n\ni=1: s does not contain 2, so we add 2 to the end of s, resulting in s=(1,2).\n\ni=2: s does not contain 3, so we add 3 to the end of s, resulting in s=(1,2,3).\n\ni=3: s does contain 1, so we repeatedly delete the element at the end of s as long as s contains 1, which causes the following changes to s: (1,2,3)→(1,2)→(1)→().\n\ni=4: s does not contain 2, so we add 2 to the end of s, resulting in s=(2).\n\ni=5: s does not contain 3, so we add 3 to the end of s, resulting in s=(2,3).\n\nSample Input 2\n\n5 10\n1 2 3 2 3\n\nSample Output 2\n\n3\n\nSample Input 3\n\n6 1000000000000\n1 1 2 2 3 3\n\nSample Output 3\n\ns may be empty in the end.\n\nSample Input 4\n\n11 97\n3 1 4 1 5 9 2 6 5 3 5\n\nSample Output 4\n\n9 2 6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1433, "cpu_time_ms": 2110, "memory_kb": 284656}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s285798059", "group_id": "codeNet:p02970", "input_text": "import java.util.*;\nimport java.io.*;\nimport java.util.function.*;\n// import lib.util.*;\n// import lib.graph.*;\n// import lib.io.*;\n// import lib.math.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n int N = sc.nextInt();\n int D = sc.nextInt();\n int res = 0;\n while (N > 0) {\n res++;\n N -= 2 * D + 1;\n }\n\n out.println(res);\n out.flush();\n }\n}\n\nclass pair {\n int l, r;\n\n public pair(int l, int r) {\n this.l = l;\n this.r = r;\n }\n}\n\nclass UnionFindTree {\n int[] root;\n int[] rank;\n int[] size;\n int m;\n\n public UnionFindTree(int n) {\n this.root = new int[n];\n this.rank = new int[n];\n this.size = new int[n];\n this.m = n;\n for (int i = 0; i < n; i++) {\n root[i] = i;\n size[i] = 1;\n }\n }\n\n public int find(int x) {\n if (root[x] == x)\n return x;\n else {\n return root[x] = find(root[x]);\n }\n }\n\n public void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y)\n return;\n if (rank[x] < rank[y]) {\n size[find(y)] = size[find(x)];\n root[x] = y;\n } else {\n size[find(x)] = size[find(y)];\n root[y] = x;\n if (rank[x] == rank[y])\n rank[x]++;\n }\n m--;\n }\n\n public boolean same(int x, int y) {\n return find(x) == find(y);\n }\n\n public int size(int i) {\n return this.size[find(i)];\n }\n}\n\nclass Dijkstra {\n private static int prev[];\n private static long dist[];\n\n public Dijkstra(AbstractGraph graph, int s) {\n prev = new int[graph.n];\n dist = new long[graph.n];\n Arrays.fill(prev, -1);\n Arrays.fill(dist, Long.MAX_VALUE);\n PriorityQueue searching = new PriorityQueue<>((x, y) -> Long.compare(dist[x], dist[y]));\n dist[s] = 0;\n searching.add(s);\n while (searching.size() > 0) {\n int now = searching.poll();\n for (Edge e : graph.getEdges(now)) {\n int next = e.to;\n long c = e.cost;\n if (dist[now] + c < dist[next]) {\n dist[next] = dist[now] + c;\n prev[next] = now;\n searching.add(next);\n }\n }\n }\n }\n\n public int[] path(int to) {\n ArrayList rev = new ArrayList<>();\n for (int now = to; now != -1; now = this.prev[now]) {\n rev.add(now);\n }\n int[] path = new int[rev.size()];\n for (int i = 0; i < path.length; i++) {\n path[i] = rev.get(path.length - i - 1);\n }\n return path;\n }\n}\n\nclass WF {\n private static long[][] dist;\n\n public WF(AbstractGraph graph) {\n dist = new long[graph.n][graph.n];\n for (int i = 0; i < dist.length; i++) {\n Arrays.fill(dist[i], Integer.MAX_VALUE);\n }\n for (int i = 0; i < graph.n; i++) {\n for (Edge e : graph.getEdges(i)) {\n dist[i][e.to] = e.cost;\n }\n dist[i][i] = 0;\n }\n for (int k = 0; k < graph.n; k++) {\n for (int i = 0; i < graph.n; i++) {\n for (int j = 0; j < graph.n; j++) {\n if (dist[i][k] != Integer.MAX_VALUE && dist[k][j] != Integer.MAX_VALUE) {\n dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n }\n }\n\n public static long getShortest(int s, int t) {\n return dist[s][t];\n }\n\n public static long[][] getAllDist() {\n return dist;\n }\n\n public static boolean isNegativeLoop() {\n for (int i = 0; i < dist.length; i++) {\n if (dist[i][i] < 0) {\n return true;\n }\n }\n return false;\n }\n}\n\nclass Edge {\n int from, to;\n long cost;\n\n public Edge(int from, int to, long cost) {\n this.from = from;\n this.to = to;\n this.cost = cost;\n }\n\n public Edge(int from, int to) {\n this.from = from;\n this.to = to;\n this.cost = 1;\n }\n\n public Edge reverse() {\n return new Edge(to, from, cost);\n }\n}\n\n@SuppressWarnings(\"unchecked\")\nabstract class AbstractGraph {\n int n;\n int m;\n ArrayList[] edges;\n\n public AbstractGraph(int n) {\n this.n = n;\n this.m = 0;\n this.edges = new ArrayList[n];\n for (int i = 0; i < n; i++) {\n this.edges[i] = new ArrayList();\n }\n }\n\n public void addEdge(Edge e) {\n this.m++;\n this.edges[e.from].add(e);\n }\n\n public int getV() {\n return this.n;\n }\n\n public int getE() {\n return this.m;\n }\n\n public ArrayList getEdges(int v) {\n return this.edges[v];\n }\n\n abstract public boolean isBipartite();\n\n public boolean isTree() {\n // require Modifying.\n return false;\n }\n}\n\nclass Graph extends AbstractGraph {\n int n;\n int m;\n // array of edges which is connect to the node\n ArrayList[] edges;\n\n public Graph(int n) {\n super(n);\n }\n\n public void addEdge(int from, int to, int cost) {\n Edge e = new Edge(from, to, cost);\n super.addEdge(e);\n super.addEdge(e.reverse());\n this.m++;\n }\n\n @Override\n public void addEdge(Edge e) {\n this.edges[e.from].add(e);\n this.edges[e.to].add(e.reverse());\n this.m++;\n }\n\n public int getV(int v) {\n return n;\n }\n\n public int getE() {\n return m;\n }\n\n public boolean isBipartite() {\n int[] color = new int[n];\n PriorityQueue queue = new PriorityQueue<>();\n HashSet visited = new HashSet<>();\n queue.add(0);\n color[0] = 1;\n while (queue.size() > 0) {\n int now = queue.poll();\n visited.add(now);\n for (Edge e : getEdges(now)) {\n if (visited.contains(e.to)) {\n continue;\n }\n if (color[e.to] == color[now])\n return false;\n queue.add(e.to);\n if (color[e.to] == 0)\n color[e.to] = -1 * color[now];\n }\n }\n return true;\n }\n}\n\nclass DirectedGraph extends AbstractGraph {\n int n;\n int m;\n // array of edges which is connect to the node\n ArrayList[] edges;\n\n public DirectedGraph(int n) {\n super(n);\n }\n\n public void addEdge(int from, int to, int cost) {\n Edge e = new Edge(from, to, cost);\n super.addEdge(e);\n this.m++;\n }\n\n @Override\n public void addEdge(Edge e) {\n this.edges[e.from].add(e);\n this.m++;\n }\n\n public int getV(int v) {\n return this.n;\n }\n\n public int getE() {\n return this.m;\n }\n\n public boolean isBipartite() {\n // need to rewrite to work\n return false;\n }\n\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n\nclass MyMath {\n public static long gcm(long a, long b) {\n\n if (a < b)\n return gcm(b, a);\n\n if (a % b == 0 || b == 0)\n return b;\n\n long remainder = a % b;\n return gcm(b, remainder);\n }\n\n public static long summation(long a, long b) {\n return b * (b + 1) / 2 - a * (a - 1) / 2;\n }\n\n public static long factorial(long n) {\n\n if (n <= 1)\n return 1;\n else\n return factorial(n - 1) * n;\n }\n\n public static long[][] binomialTable(int a, long m) {\n long[][] table = new long[a + 1][a + 1];\n for (int i = 0; i < a + 1; i++) {\n table[0][a] = 0;\n table[i][0] = 1;\n table[i][i] = 1;\n }\n for (int i = 1; i < a + 1; i++) {\n for (int j = 1; j < a + 1; j++) {\n if (i < j)\n table[i][j] = 0;\n else {\n table[i][j] = (table[i - 1][j - 1] + table[i - 1][j]) % m;\n }\n }\n }\n return table;\n }\n\n public static long binomial(int n, int k, long m) {\n long res = 1;\n for (int l = n - k + 1; l <= n; l++) {\n res = (res % m) * (l % m) % m;\n }\n for (int r = 1; r <= k; r++) {\n res = (res % m) * modinv(r, m) % m;\n }\n return res;\n }\n\n public static long repeatSquarePow(long a, long n, long p) {\n if (n == 0)\n return 1;\n if (n == 1)\n return a % p;\n if (n % 2 == 1)\n return a * repeatSquarePow(a, n - 1, p) % p;\n long tmp = repeatSquarePow(a, n / 2, p) % p;\n return tmp * tmp % p;\n }\n\n public static long modinv(long a, long p) {\n long b, x, u, q, abs_p, tmp;\n abs_p = Math.abs(p);\n b = p;\n x = 1;\n u = 0;\n while (b > 0) {\n q = a / b;\n tmp = u;\n u = x - q * u;\n x = tmp;\n tmp = b;\n b = a - q * b;\n a = tmp;\n }\n return (x < 0) ? abs_p + x : x;\n }\n\n public static Long[] eratosthenes(int n) {\n Long[] factor_table = new Long[n];\n for (long i = 1; i <= n; i++) {\n factor_table[(int) (i - 1)] = i;\n }\n for (long i = 1; i <= n; i++) {\n if (factor_table[(int) (i - 1)] == i) {\n int j = 2;\n while (i * j <= n) {\n factor_table[(int) (i * j - 1)] = i;\n j++;\n }\n }\n }\n\n return factor_table;\n }\n\n public static HashMap primeFactorization(long n) {\n HashMap primes = new HashMap<>();\n for (long p = 2; p * p <= n; p++) {\n int q = 0;\n while (n % p == 0) {\n n /= p;\n q++;\n }\n if (q > 0)\n primes.put(p, q);\n }\n if (n > 1)\n primes.put(n, 1);\n return primes;\n }\n\n public static ArrayList divisor(int n) {\n ArrayList ret = new ArrayList();\n for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n ret.add(i);\n // n=PQ+0→ PもQも約数. ただし、Q=Pは↑で登録済みなので登録しない\n if (i != n / i)\n ret.add(n / i);\n }\n }\n return ret;\n }\n}\n\nclass nextPermutation {\n public static int[] swap(int data[], int left, int right) {\n\n // Swap the data\n int temp = data[left];\n data[left] = data[right];\n data[right] = temp;\n\n // Return the updated array\n return data;\n }\n\n // Function to reverse the sub-array\n // starting from left to the right\n // both inclusive\n public static int[] reverse(int data[], int left, int right) {\n\n // Reverse the sub-array\n while (left < right) {\n int temp = data[left];\n data[left++] = data[right];\n data[right--] = temp;\n }\n\n // Return the updated array\n return data;\n }\n\n // Function to find the next permutation\n // of the given integer array\n public static boolean findNextPermutation(int data[]) {\n\n // If the given dataset is empty\n // or contains only one element\n // next_permutation is not possible\n if (data.length <= 1)\n return false;\n\n int last = data.length - 2;\n\n // find the longest non-increasing suffix\n // and find the pivot\n while (last >= 0) {\n if (data[last] < data[last + 1]) {\n break;\n }\n last--;\n }\n\n // If there is no increasing pair\n // there is no higher order permutation\n if (last < 0)\n return false;\n\n int nextGreater = data.length - 1;\n\n // Find the rightmost successor to the pivot\n for (int i = data.length - 1; i > last; i--) {\n if (data[i] > data[last]) {\n nextGreater = i;\n break;\n }\n }\n\n // Swap the successor and the pivot\n data = swap(data, nextGreater, last);\n\n // Reverse the suffix\n data = reverse(data, last + 1, data.length - 1);\n\n // Return true as the next_permutation is done\n return true;\n }\n}\n\nclass ArrayUtil {\n private static long INF = 1_000_000_000_0L;\n\n public static int UpperBound(long[] array, long obj) {\n int l = 0, r = array.length - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj < array[c]) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n\n public static int LowerBound(long[] array, long obj) {\n int l = 0, r = array.length - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj <= array[c]) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n\n // return the length of array's LIS\n public static int LIS(long[] array) {\n long[] dp = new long[array.length + 1];\n Arrays.fill(dp, INF);\n for (int i = 0; i < array.length; i++) {\n int idx = LowerBound(dp, array[i]);\n dp[idx] = array[i];\n }\n return LowerBound(dp, INF - 1);\n }\n\n public static int StrictLIS(long[] array) {\n long[] dp = new long[array.length + 1];\n Arrays.fill(dp, INF);\n for (int i = 0; i < array.length; i++) {\n int idx = UpperBound(dp, array[i]);\n dp[idx] = array[i];\n }\n return UpperBound(dp, INF - 1);\n }\n}\n", "language": "Java", "metadata": {"date": 1586893282, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02970.html", "problem_id": "p02970", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02970/input.txt", "sample_output_relpath": "derived/input_output/data/p02970/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02970/Java/s285798059.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s285798059", "user_id": "u288042356"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\nimport java.util.function.*;\n// import lib.util.*;\n// import lib.graph.*;\n// import lib.io.*;\n// import lib.math.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n int N = sc.nextInt();\n int D = sc.nextInt();\n int res = 0;\n while (N > 0) {\n res++;\n N -= 2 * D + 1;\n }\n\n out.println(res);\n out.flush();\n }\n}\n\nclass pair {\n int l, r;\n\n public pair(int l, int r) {\n this.l = l;\n this.r = r;\n }\n}\n\nclass UnionFindTree {\n int[] root;\n int[] rank;\n int[] size;\n int m;\n\n public UnionFindTree(int n) {\n this.root = new int[n];\n this.rank = new int[n];\n this.size = new int[n];\n this.m = n;\n for (int i = 0; i < n; i++) {\n root[i] = i;\n size[i] = 1;\n }\n }\n\n public int find(int x) {\n if (root[x] == x)\n return x;\n else {\n return root[x] = find(root[x]);\n }\n }\n\n public void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y)\n return;\n if (rank[x] < rank[y]) {\n size[find(y)] = size[find(x)];\n root[x] = y;\n } else {\n size[find(x)] = size[find(y)];\n root[y] = x;\n if (rank[x] == rank[y])\n rank[x]++;\n }\n m--;\n }\n\n public boolean same(int x, int y) {\n return find(x) == find(y);\n }\n\n public int size(int i) {\n return this.size[find(i)];\n }\n}\n\nclass Dijkstra {\n private static int prev[];\n private static long dist[];\n\n public Dijkstra(AbstractGraph graph, int s) {\n prev = new int[graph.n];\n dist = new long[graph.n];\n Arrays.fill(prev, -1);\n Arrays.fill(dist, Long.MAX_VALUE);\n PriorityQueue searching = new PriorityQueue<>((x, y) -> Long.compare(dist[x], dist[y]));\n dist[s] = 0;\n searching.add(s);\n while (searching.size() > 0) {\n int now = searching.poll();\n for (Edge e : graph.getEdges(now)) {\n int next = e.to;\n long c = e.cost;\n if (dist[now] + c < dist[next]) {\n dist[next] = dist[now] + c;\n prev[next] = now;\n searching.add(next);\n }\n }\n }\n }\n\n public int[] path(int to) {\n ArrayList rev = new ArrayList<>();\n for (int now = to; now != -1; now = this.prev[now]) {\n rev.add(now);\n }\n int[] path = new int[rev.size()];\n for (int i = 0; i < path.length; i++) {\n path[i] = rev.get(path.length - i - 1);\n }\n return path;\n }\n}\n\nclass WF {\n private static long[][] dist;\n\n public WF(AbstractGraph graph) {\n dist = new long[graph.n][graph.n];\n for (int i = 0; i < dist.length; i++) {\n Arrays.fill(dist[i], Integer.MAX_VALUE);\n }\n for (int i = 0; i < graph.n; i++) {\n for (Edge e : graph.getEdges(i)) {\n dist[i][e.to] = e.cost;\n }\n dist[i][i] = 0;\n }\n for (int k = 0; k < graph.n; k++) {\n for (int i = 0; i < graph.n; i++) {\n for (int j = 0; j < graph.n; j++) {\n if (dist[i][k] != Integer.MAX_VALUE && dist[k][j] != Integer.MAX_VALUE) {\n dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n }\n }\n\n public static long getShortest(int s, int t) {\n return dist[s][t];\n }\n\n public static long[][] getAllDist() {\n return dist;\n }\n\n public static boolean isNegativeLoop() {\n for (int i = 0; i < dist.length; i++) {\n if (dist[i][i] < 0) {\n return true;\n }\n }\n return false;\n }\n}\n\nclass Edge {\n int from, to;\n long cost;\n\n public Edge(int from, int to, long cost) {\n this.from = from;\n this.to = to;\n this.cost = cost;\n }\n\n public Edge(int from, int to) {\n this.from = from;\n this.to = to;\n this.cost = 1;\n }\n\n public Edge reverse() {\n return new Edge(to, from, cost);\n }\n}\n\n@SuppressWarnings(\"unchecked\")\nabstract class AbstractGraph {\n int n;\n int m;\n ArrayList[] edges;\n\n public AbstractGraph(int n) {\n this.n = n;\n this.m = 0;\n this.edges = new ArrayList[n];\n for (int i = 0; i < n; i++) {\n this.edges[i] = new ArrayList();\n }\n }\n\n public void addEdge(Edge e) {\n this.m++;\n this.edges[e.from].add(e);\n }\n\n public int getV() {\n return this.n;\n }\n\n public int getE() {\n return this.m;\n }\n\n public ArrayList getEdges(int v) {\n return this.edges[v];\n }\n\n abstract public boolean isBipartite();\n\n public boolean isTree() {\n // require Modifying.\n return false;\n }\n}\n\nclass Graph extends AbstractGraph {\n int n;\n int m;\n // array of edges which is connect to the node\n ArrayList[] edges;\n\n public Graph(int n) {\n super(n);\n }\n\n public void addEdge(int from, int to, int cost) {\n Edge e = new Edge(from, to, cost);\n super.addEdge(e);\n super.addEdge(e.reverse());\n this.m++;\n }\n\n @Override\n public void addEdge(Edge e) {\n this.edges[e.from].add(e);\n this.edges[e.to].add(e.reverse());\n this.m++;\n }\n\n public int getV(int v) {\n return n;\n }\n\n public int getE() {\n return m;\n }\n\n public boolean isBipartite() {\n int[] color = new int[n];\n PriorityQueue queue = new PriorityQueue<>();\n HashSet visited = new HashSet<>();\n queue.add(0);\n color[0] = 1;\n while (queue.size() > 0) {\n int now = queue.poll();\n visited.add(now);\n for (Edge e : getEdges(now)) {\n if (visited.contains(e.to)) {\n continue;\n }\n if (color[e.to] == color[now])\n return false;\n queue.add(e.to);\n if (color[e.to] == 0)\n color[e.to] = -1 * color[now];\n }\n }\n return true;\n }\n}\n\nclass DirectedGraph extends AbstractGraph {\n int n;\n int m;\n // array of edges which is connect to the node\n ArrayList[] edges;\n\n public DirectedGraph(int n) {\n super(n);\n }\n\n public void addEdge(int from, int to, int cost) {\n Edge e = new Edge(from, to, cost);\n super.addEdge(e);\n this.m++;\n }\n\n @Override\n public void addEdge(Edge e) {\n this.edges[e.from].add(e);\n this.m++;\n }\n\n public int getV(int v) {\n return this.n;\n }\n\n public int getE() {\n return this.m;\n }\n\n public boolean isBipartite() {\n // need to rewrite to work\n return false;\n }\n\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n\nclass MyMath {\n public static long gcm(long a, long b) {\n\n if (a < b)\n return gcm(b, a);\n\n if (a % b == 0 || b == 0)\n return b;\n\n long remainder = a % b;\n return gcm(b, remainder);\n }\n\n public static long summation(long a, long b) {\n return b * (b + 1) / 2 - a * (a - 1) / 2;\n }\n\n public static long factorial(long n) {\n\n if (n <= 1)\n return 1;\n else\n return factorial(n - 1) * n;\n }\n\n public static long[][] binomialTable(int a, long m) {\n long[][] table = new long[a + 1][a + 1];\n for (int i = 0; i < a + 1; i++) {\n table[0][a] = 0;\n table[i][0] = 1;\n table[i][i] = 1;\n }\n for (int i = 1; i < a + 1; i++) {\n for (int j = 1; j < a + 1; j++) {\n if (i < j)\n table[i][j] = 0;\n else {\n table[i][j] = (table[i - 1][j - 1] + table[i - 1][j]) % m;\n }\n }\n }\n return table;\n }\n\n public static long binomial(int n, int k, long m) {\n long res = 1;\n for (int l = n - k + 1; l <= n; l++) {\n res = (res % m) * (l % m) % m;\n }\n for (int r = 1; r <= k; r++) {\n res = (res % m) * modinv(r, m) % m;\n }\n return res;\n }\n\n public static long repeatSquarePow(long a, long n, long p) {\n if (n == 0)\n return 1;\n if (n == 1)\n return a % p;\n if (n % 2 == 1)\n return a * repeatSquarePow(a, n - 1, p) % p;\n long tmp = repeatSquarePow(a, n / 2, p) % p;\n return tmp * tmp % p;\n }\n\n public static long modinv(long a, long p) {\n long b, x, u, q, abs_p, tmp;\n abs_p = Math.abs(p);\n b = p;\n x = 1;\n u = 0;\n while (b > 0) {\n q = a / b;\n tmp = u;\n u = x - q * u;\n x = tmp;\n tmp = b;\n b = a - q * b;\n a = tmp;\n }\n return (x < 0) ? abs_p + x : x;\n }\n\n public static Long[] eratosthenes(int n) {\n Long[] factor_table = new Long[n];\n for (long i = 1; i <= n; i++) {\n factor_table[(int) (i - 1)] = i;\n }\n for (long i = 1; i <= n; i++) {\n if (factor_table[(int) (i - 1)] == i) {\n int j = 2;\n while (i * j <= n) {\n factor_table[(int) (i * j - 1)] = i;\n j++;\n }\n }\n }\n\n return factor_table;\n }\n\n public static HashMap primeFactorization(long n) {\n HashMap primes = new HashMap<>();\n for (long p = 2; p * p <= n; p++) {\n int q = 0;\n while (n % p == 0) {\n n /= p;\n q++;\n }\n if (q > 0)\n primes.put(p, q);\n }\n if (n > 1)\n primes.put(n, 1);\n return primes;\n }\n\n public static ArrayList divisor(int n) {\n ArrayList ret = new ArrayList();\n for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n ret.add(i);\n // n=PQ+0→ PもQも約数. ただし、Q=Pは↑で登録済みなので登録しない\n if (i != n / i)\n ret.add(n / i);\n }\n }\n return ret;\n }\n}\n\nclass nextPermutation {\n public static int[] swap(int data[], int left, int right) {\n\n // Swap the data\n int temp = data[left];\n data[left] = data[right];\n data[right] = temp;\n\n // Return the updated array\n return data;\n }\n\n // Function to reverse the sub-array\n // starting from left to the right\n // both inclusive\n public static int[] reverse(int data[], int left, int right) {\n\n // Reverse the sub-array\n while (left < right) {\n int temp = data[left];\n data[left++] = data[right];\n data[right--] = temp;\n }\n\n // Return the updated array\n return data;\n }\n\n // Function to find the next permutation\n // of the given integer array\n public static boolean findNextPermutation(int data[]) {\n\n // If the given dataset is empty\n // or contains only one element\n // next_permutation is not possible\n if (data.length <= 1)\n return false;\n\n int last = data.length - 2;\n\n // find the longest non-increasing suffix\n // and find the pivot\n while (last >= 0) {\n if (data[last] < data[last + 1]) {\n break;\n }\n last--;\n }\n\n // If there is no increasing pair\n // there is no higher order permutation\n if (last < 0)\n return false;\n\n int nextGreater = data.length - 1;\n\n // Find the rightmost successor to the pivot\n for (int i = data.length - 1; i > last; i--) {\n if (data[i] > data[last]) {\n nextGreater = i;\n break;\n }\n }\n\n // Swap the successor and the pivot\n data = swap(data, nextGreater, last);\n\n // Reverse the suffix\n data = reverse(data, last + 1, data.length - 1);\n\n // Return true as the next_permutation is done\n return true;\n }\n}\n\nclass ArrayUtil {\n private static long INF = 1_000_000_000_0L;\n\n public static int UpperBound(long[] array, long obj) {\n int l = 0, r = array.length - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj < array[c]) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n\n public static int LowerBound(long[] array, long obj) {\n int l = 0, r = array.length - 1;\n while (r - l >= 0) {\n int c = (l + r) / 2;\n if (obj <= array[c]) {\n r = c - 1;\n } else {\n l = c + 1;\n }\n }\n return l;\n }\n\n // return the length of array's LIS\n public static int LIS(long[] array) {\n long[] dp = new long[array.length + 1];\n Arrays.fill(dp, INF);\n for (int i = 0; i < array.length; i++) {\n int idx = LowerBound(dp, array[i]);\n dp[idx] = array[i];\n }\n return LowerBound(dp, INF - 1);\n }\n\n public static int StrictLIS(long[] array) {\n long[] dp = new long[array.length + 1];\n Arrays.fill(dp, INF);\n for (int i = 0; i < array.length; i++) {\n int idx = UpperBound(dp, array[i]);\n dp[idx] = array[i];\n }\n return UpperBound(dp, INF - 1);\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N apple trees in a row. People say that one of them will bear golden apples.\n\nWe want to deploy some number of inspectors so that each of these trees will be inspected.\n\nEach inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \\leq i \\leq N) will inspect the trees with numbers between i-D and i+D (inclusive).\n\nFind the minimum number of inspectors that we need to deploy to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq D \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\n\nOutput\n\nPrint the minimum number of inspectors that we need to deploy to achieve the objective.\n\nSample Input 1\n\n6 2\n\nSample Output 1\n\n2\n\nWe can achieve the objective by, for example, placing an inspector under Tree 3 and Tree 4.\n\nSample Input 2\n\n14 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n20 4\n\nSample Output 3\n\n3", "sample_input": "6 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02970", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N apple trees in a row. People say that one of them will bear golden apples.\n\nWe want to deploy some number of inspectors so that each of these trees will be inspected.\n\nEach inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \\leq i \\leq N) will inspect the trees with numbers between i-D and i+D (inclusive).\n\nFind the minimum number of inspectors that we need to deploy to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq D \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\n\nOutput\n\nPrint the minimum number of inspectors that we need to deploy to achieve the objective.\n\nSample Input 1\n\n6 2\n\nSample Output 1\n\n2\n\nWe can achieve the objective by, for example, placing an inspector under Tree 3 and Tree 4.\n\nSample Input 2\n\n14 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n20 4\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 16256, "cpu_time_ms": 73, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s021816014", "group_id": "codeNet:p02970", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int d = sc.nextInt();\n sc.close();\n\n int ans = n / (2 * d + 1);\n if (n % (2 * d + 1) != 0) {\n ans++;\n }\n System.out.println(ans);\n\n }\n\n}\n", "language": "Java", "metadata": {"date": 1577415729, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02970.html", "problem_id": "p02970", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02970/input.txt", "sample_output_relpath": "derived/input_output/data/p02970/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02970/Java/s021816014.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s021816014", "user_id": "u752146446"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int d = sc.nextInt();\n sc.close();\n\n int ans = n / (2 * d + 1);\n if (n % (2 * d + 1) != 0) {\n ans++;\n }\n System.out.println(ans);\n\n }\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N apple trees in a row. People say that one of them will bear golden apples.\n\nWe want to deploy some number of inspectors so that each of these trees will be inspected.\n\nEach inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \\leq i \\leq N) will inspect the trees with numbers between i-D and i+D (inclusive).\n\nFind the minimum number of inspectors that we need to deploy to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq D \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\n\nOutput\n\nPrint the minimum number of inspectors that we need to deploy to achieve the objective.\n\nSample Input 1\n\n6 2\n\nSample Output 1\n\n2\n\nWe can achieve the objective by, for example, placing an inspector under Tree 3 and Tree 4.\n\nSample Input 2\n\n14 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n20 4\n\nSample Output 3\n\n3", "sample_input": "6 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02970", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N apple trees in a row. People say that one of them will bear golden apples.\n\nWe want to deploy some number of inspectors so that each of these trees will be inspected.\n\nEach inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \\leq i \\leq N) will inspect the trees with numbers between i-D and i+D (inclusive).\n\nFind the minimum number of inspectors that we need to deploy to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq D \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\n\nOutput\n\nPrint the minimum number of inspectors that we need to deploy to achieve the objective.\n\nSample Input 1\n\n6 2\n\nSample Output 1\n\n2\n\nWe can achieve the objective by, for example, placing an inspector under Tree 3 and Tree 4.\n\nSample Input 2\n\n14 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n20 4\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 362, "cpu_time_ms": 95, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s898870695", "group_id": "codeNet:p02971", "input_text": "import java.io.PrintStream;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n static final Scanner sc = new Scanner(System.in);\n static final PrintStream so = System.out;\n\n public static void main(String[] args) {\n int N = nint();\n int[] A = nints(N);\n int[] sorted = Arrays.copyOf(A, N);\n Arrays.sort(sorted);\n int m = sorted[N-1];\n int n = sorted[N-2];\n for (int a: A) {\n so.println(a == m ? n : m);\n }\n }\n\n private static long nlong() {\n return sc.nextLong();\n }\n\n private static int nint() {\n return sc.nextInt();\n }\n\n private static String nstr() {\n return sc.next();\n }\n\n private static char[] nsToChars() {\n return sc.next().toCharArray();\n }\n\n private static long[] nlongs(int n) {\n return nlongs(n, 0, 0);\n }\n\n private static int[] nints(int n) {\n return nints(n, 0, 0);\n }\n\n private static int[] nints(int n, int padL, int padR) {\n int[] a = new int[padL + n + padR];\n for (int i = 0; i < n; i++)\n a[padL + i] = nint();\n return a;\n }\n\n private static long[] nlongs(int n, int padL, int padR) {\n long[] a = new long[padL + n + padR];\n for (int i = 0; i < n; i++)\n a[padL + i] = nlong();\n return a;\n }\n\n private static String[] nstrs(int n) {\n String[] a = new String[n];\n for (int i = 0; i < n; i++)\n a[i] = nstr();\n return a;\n }\n\n private static char[][] nsToChars2D(int h, int w) {\n return nsToChars2D(h, w, 0);\n }\n\n private static char[][] nsToChars2D(int h, int w, int pad) {\n char[][] a2 = new char[h + pad * 2][w + pad * 2];\n for (int i = 0; i < h; i++)\n System.arraycopy(nsToChars(), 0, a2[pad + i], pad, w);\n return a2;\n }\n}\n", "language": "Java", "metadata": {"date": 1565548741, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02971.html", "problem_id": "p02971", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02971/input.txt", "sample_output_relpath": "derived/input_output/data/p02971/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02971/Java/s898870695.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s898870695", "user_id": "u228127260"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "import java.io.PrintStream;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n static final Scanner sc = new Scanner(System.in);\n static final PrintStream so = System.out;\n\n public static void main(String[] args) {\n int N = nint();\n int[] A = nints(N);\n int[] sorted = Arrays.copyOf(A, N);\n Arrays.sort(sorted);\n int m = sorted[N-1];\n int n = sorted[N-2];\n for (int a: A) {\n so.println(a == m ? n : m);\n }\n }\n\n private static long nlong() {\n return sc.nextLong();\n }\n\n private static int nint() {\n return sc.nextInt();\n }\n\n private static String nstr() {\n return sc.next();\n }\n\n private static char[] nsToChars() {\n return sc.next().toCharArray();\n }\n\n private static long[] nlongs(int n) {\n return nlongs(n, 0, 0);\n }\n\n private static int[] nints(int n) {\n return nints(n, 0, 0);\n }\n\n private static int[] nints(int n, int padL, int padR) {\n int[] a = new int[padL + n + padR];\n for (int i = 0; i < n; i++)\n a[padL + i] = nint();\n return a;\n }\n\n private static long[] nlongs(int n, int padL, int padR) {\n long[] a = new long[padL + n + padR];\n for (int i = 0; i < n; i++)\n a[padL + i] = nlong();\n return a;\n }\n\n private static String[] nstrs(int n) {\n String[] a = new String[n];\n for (int i = 0; i < n; i++)\n a[i] = nstr();\n return a;\n }\n\n private static char[][] nsToChars2D(int h, int w) {\n return nsToChars2D(h, w, 0);\n }\n\n private static char[][] nsToChars2D(int h, int w, int pad) {\n char[][] a2 = new char[h + pad * 2][w + pad * 2];\n for (int i = 0; i < h; i++)\n System.arraycopy(nsToChars(), 0, a2[pad + i], pad, w);\n return a2;\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "sample_input": "3\n1\n4\n3\n"}, "reference_outputs": ["4\n3\n4\n"], "source_document_id": "p02971", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1891, "cpu_time_ms": 1996, "memory_kb": 93704}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s134478575", "group_id": "codeNet:p02971", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\n Scanner scanner = new Scanner(System.in);\n int N = scanner.nextInt();\n int[] ARRAY = new int[N];\n\n for (int i=0; i max) {\n max = ARRAY[k];\n MAX_ARRAY[i] = max;\n }\n }\n }\n for (int i=0; i max) {\n max = ARRAY[k];\n MAX_ARRAY[i] = max;\n }\n }\n }\n for (int i=0; i= numChars) \n {\n curChar = 0;\n try\n {\n numChars = stream.read(buf);\n }\n catch (IOException e)\n {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0) \n return -1;\n }\n return buf[curChar++];\n }\n \n public String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() \n {\n int c = read();\n \n while(isSpaceChar(c)) \n c = read();\n \n int sgn = 1;\n \n if (c == '-') \n {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do\n {\n if(c<'0'||c>'9') \n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c)); \n \n return res * sgn;\n }\n\t\t\n public long nextLong() \n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do \n {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\t\t\n public double nextDouble() \n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') \n {\n c = read();\n double m = 1;\n while (!isSpaceChar(c))\n {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public String readString() \n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do \n {\n res.appendCodePoint(c);\n c = read();\n } \n while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public boolean isSpaceChar(int c) \n {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next()\n {\n return readString();\n }\n \n public interface SpaceCharFilter\n {\n public boolean isSpaceChar(int ch);\n }\n\t\t\n }\n\t\n public static void main(String args[]) throws Exception \n {\n new Thread(null, new Main(),\"Main\",1<<27).start();\n }\n\t// **just change the name of class from Main to reuquired**\n public void run()\n {\n InputReader sc = new InputReader(System.in);\n PrintWriter w = new PrintWriter(System.out);\n\t\t\n\t\tint n=sc.nextInt();\n\t\tint a[]=new int[n+1];\n\t\tfor(int i=1;i<=n;++i) a[i]=sc.nextInt();\n\t\n\t\tint b[]=new int[n+1];\n\t\tfor(int i=n;i>=1;--i)\n\t\t{\n\t\t\tint total=0;\n\t\t\tfor(int j=i;j<=n;j+=i)\n\t\t\t{\n\t\t\t\ttotal+=b[j];\n\t\t\t}\n\t\t\t\n\t\t\tif((total%2)!=(a[i]%2))\n\t\t\t{\n\t\t\t\tb[i]++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint counter=0;\n\t\tArrayList al=new ArrayList<>();\n\t\tfor(int i=1;i<=n;++i) \n\t\t{\n\t\t\tif(b[i]>0)\n\t\t\t{\n\t\t\t\tcounter++;\n\t\t\t\tal.add(i);\n\t\t\t}\n\t\t}\n\t\t\n\t\tw.println(counter);\n\t\tfor(int e:al) w.print(e+\" \");\n\t\t\n System.out.flush();\n w.close();\n }\n}", "language": "Java", "metadata": {"date": 1593716522, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p02972.html", "problem_id": "p02972", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02972/input.txt", "sample_output_relpath": "derived/input_output/data/p02972/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02972/Java/s672090210.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s672090210", "user_id": "u758793356"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\nimport java.lang.*;\n \nimport static java.lang.Math.*;\n\npublic class Main implements Runnable \n{\n static class InputReader \n {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private SpaceCharFilter filter;\n private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n public InputReader(InputStream stream) \n {\n this.stream = stream;\n }\n \n public int read()\n {\n if (numChars==-1) \n throw new InputMismatchException();\n \n if (curChar >= numChars) \n {\n curChar = 0;\n try\n {\n numChars = stream.read(buf);\n }\n catch (IOException e)\n {\n throw new InputMismatchException();\n }\n \n if(numChars <= 0) \n return -1;\n }\n return buf[curChar++];\n }\n \n public String nextLine()\n {\n String str = \"\";\n try\n {\n str = br.readLine();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() \n {\n int c = read();\n \n while(isSpaceChar(c)) \n c = read();\n \n int sgn = 1;\n \n if (c == '-') \n {\n sgn = -1;\n c = read();\n }\n \n int res = 0;\n do\n {\n if(c<'0'||c>'9') \n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c)); \n \n return res * sgn;\n }\n\t\t\n public long nextLong() \n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n long res = 0;\n \n do \n {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\t\t\n public double nextDouble() \n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-')\n {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') \n {\n c = read();\n double m = 1;\n while (!isSpaceChar(c))\n {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n \n public String readString() \n {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do \n {\n res.appendCodePoint(c);\n c = read();\n } \n while (!isSpaceChar(c));\n \n return res.toString();\n }\n \n public boolean isSpaceChar(int c) \n {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n \n public String next()\n {\n return readString();\n }\n \n public interface SpaceCharFilter\n {\n public boolean isSpaceChar(int ch);\n }\n\t\t\n }\n\t\n public static void main(String args[]) throws Exception \n {\n new Thread(null, new Main(),\"Main\",1<<27).start();\n }\n\t// **just change the name of class from Main to reuquired**\n public void run()\n {\n InputReader sc = new InputReader(System.in);\n PrintWriter w = new PrintWriter(System.out);\n\t\t\n\t\tint n=sc.nextInt();\n\t\tint a[]=new int[n+1];\n\t\tfor(int i=1;i<=n;++i) a[i]=sc.nextInt();\n\t\n\t\tint b[]=new int[n+1];\n\t\tfor(int i=n;i>=1;--i)\n\t\t{\n\t\t\tint total=0;\n\t\t\tfor(int j=i;j<=n;j+=i)\n\t\t\t{\n\t\t\t\ttotal+=b[j];\n\t\t\t}\n\t\t\t\n\t\t\tif((total%2)!=(a[i]%2))\n\t\t\t{\n\t\t\t\tb[i]++;\n\t\t\t}\n\t\t}\n\t\t\n\t\tint counter=0;\n\t\tArrayList al=new ArrayList<>();\n\t\tfor(int i=1;i<=n;++i) \n\t\t{\n\t\t\tif(b[i]>0)\n\t\t\t{\n\t\t\t\tcounter++;\n\t\t\t\tal.add(i);\n\t\t\t}\n\t\t}\n\t\t\n\t\tw.println(counter);\n\t\tfor(int e:al) w.print(e+\" \");\n\t\t\n System.out.flush();\n w.close();\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "sample_input": "3\n1 0 0\n"}, "reference_outputs": ["1\n1\n"], "source_document_id": "p02972", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5630, "cpu_time_ms": 243, "memory_kb": 48688}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s801466620", "group_id": "codeNet:p02972", "input_text": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n int[] a = new int[n];\n int[] b = new int[n];\n\n for (int i = 0; i < n; i++) {\n a[i] = scanner.nextInt();\n b[i] = 0;\n }\n\n for (int i = n; i > 0; i--) {\n int count = 0;\n for (int j = 2 * i; j <= n; j += j) {\n if (b[j - 1] == 1) {\n count++;\n }\n }\n if ((a[i - 1] == 0 && count % 2 == 1) || (a[i - 1] == 1 && count % 2 == 0)) {\n b[i - 1] = 1;\n }\n }\n\n System.out.println(b.length);\n for (int i : b) {\n if (i == 1)\n System.out.print(i + \" \");\n }\n }\n}\n\n", "language": "Java", "metadata": {"date": 1563677607, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02972.html", "problem_id": "p02972", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02972/input.txt", "sample_output_relpath": "derived/input_output/data/p02972/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02972/Java/s801466620.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s801466620", "user_id": "u087672117"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n int[] a = new int[n];\n int[] b = new int[n];\n\n for (int i = 0; i < n; i++) {\n a[i] = scanner.nextInt();\n b[i] = 0;\n }\n\n for (int i = n; i > 0; i--) {\n int count = 0;\n for (int j = 2 * i; j <= n; j += j) {\n if (b[j - 1] == 1) {\n count++;\n }\n }\n if ((a[i - 1] == 0 && count % 2 == 1) || (a[i - 1] == 1 && count % 2 == 0)) {\n b[i - 1] = 1;\n }\n }\n\n System.out.println(b.length);\n for (int i : b) {\n if (i == 1)\n System.out.print(i + \" \");\n }\n }\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "sample_input": "3\n1 0 0\n"}, "reference_outputs": ["1\n1\n"], "source_document_id": "p02972", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 931, "cpu_time_ms": 792, "memory_kb": 83776}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s802872864", "group_id": "codeNet:p02975", "input_text": "\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int N = sc.nextInt();\n int[] a = new int[N];\n\n Map count = new HashMap<>();\n\n for (int i = 0; i < N; i++) {\n a[i] = sc.nextInt();\n if (!count.containsKey(a[i])) count.put(a[i], 0);\n count.put(a[i], count.get(a[i]) + 1);\n }\n\n int numValues = count.keySet().size();\n\n if (numValues == 1) {\n System.out.println(count.containsKey(0) ? \"Yes\" : \"No\");\n return;\n }\n\n if (numValues == 2 && N % 3 == 0 && count.containsKey(0)) {\n String sol = \"Yes\";\n for (int x : count.keySet()) {\n if (x == 0 && count.get(x) != N / 3) sol = \"No\";\n if (x != 0 && count.get(x) != 2 * (N / 3)) sol = \"No\";\n }\n System.out.println(sol);\n return;\n }\n\n if (numValues == 3 && N % 3 == 0) {\n String sol = \"Yes\";\n int xor = 0;\n for (int x : count.keySet()) xor ^= x;\n if (xor != 0) sol = \"No\";\n for (int c : count.values()) {\n if (c != N / 3) sol = \"No\";\n }\n System.out.println(sol);\n return;\n }\n\n System.out.println(\"No\");\n }\n}\n", "language": "Java", "metadata": {"date": 1569024323, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02975.html", "problem_id": "p02975", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02975/input.txt", "sample_output_relpath": "derived/input_output/data/p02975/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02975/Java/s802872864.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s802872864", "user_id": "u711414551"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int N = sc.nextInt();\n int[] a = new int[N];\n\n Map count = new HashMap<>();\n\n for (int i = 0; i < N; i++) {\n a[i] = sc.nextInt();\n if (!count.containsKey(a[i])) count.put(a[i], 0);\n count.put(a[i], count.get(a[i]) + 1);\n }\n\n int numValues = count.keySet().size();\n\n if (numValues == 1) {\n System.out.println(count.containsKey(0) ? \"Yes\" : \"No\");\n return;\n }\n\n if (numValues == 2 && N % 3 == 0 && count.containsKey(0)) {\n String sol = \"Yes\";\n for (int x : count.keySet()) {\n if (x == 0 && count.get(x) != N / 3) sol = \"No\";\n if (x != 0 && count.get(x) != 2 * (N / 3)) sol = \"No\";\n }\n System.out.println(sol);\n return;\n }\n\n if (numValues == 3 && N % 3 == 0) {\n String sol = \"Yes\";\n int xor = 0;\n for (int x : count.keySet()) xor ^= x;\n if (xor != 0) sol = \"No\";\n for (int c : count.values()) {\n if (c != N / 3) sol = \"No\";\n }\n System.out.println(sol);\n return;\n }\n\n System.out.println(\"No\");\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02975", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1439, "cpu_time_ms": 511, "memory_kb": 61020}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s020418622", "group_id": "codeNet:p02975", "input_text": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport java.util.function.Function;\nimport java.util.stream.Collectors;\n\n@SuppressWarnings(\"unused\")\npublic class Main {\n\tFastScanner in = new FastScanner(System.in);\n\tPrintWriter out = new PrintWriter(System.out);\n\tfinal int MOD = (int)1e9+7;\n\tvoid printlnYN(boolean b){out.println((b ? \"Yes\" : \"No\"));}\n\t\n\t//https://onlinejudge.u-aizu.ac.jp/challenges/sources/ICPC/Prelim/1618?year=2017\n\n\t//System.out.println();はつかわない！！\n\tvoid solve() throws Exception{\n\t\tint N = in.nextInt();\n\t\tint[] a = in.nextIntArray(N);\n\t\tArrays.sort(a);\n\t\tif(a[N-1] == 0){\n\t\t\tprintlnYN(true);\n\t\t}else if(N % 3 != 0){\n\t\t\tprintlnYN(false);\n\t\t}else{\n\t\t\tboolean tf = (a[0] == a[N/3-1] && a[N/3] == a[2*N/3-1] && a[2*N/3] == a[N-1] && (a[0] ^ a[N/3] ^ a[2*N/3]) == 0);\n\t\t\tprintlnYN(tf);\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().m();\n\t}\n\t\n\tvoid m() throws Exception {\n\t\tsolve();\n\t\tout.flush();\n\t}\n\t\n\tclass FastScanner {\n\t\tReader input;\n\n\t\tFastScanner() {this(System.in);}\n\t\tFastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n\t\t\n\t\tint nextInt() {return (int) nextLong();}\n\n\t\tlong nextLong() {\n\t\t\ttry {\n\t\t\t\tint sign = 1;\n\t\t\t\tint b = input.read();\n\t\t\t\twhile ((b < '0' || '9' < b) && b != '-' && b != '+') {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\tif (b == '-') {\n\t\t\t\t\tsign = -1;\n\t\t\t\t\tb = input.read();\n\t\t\t\t} else if (b == '+') {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\tlong ret = b - '0';\n\t\t\t\twhile (true) {\n\t\t\t\t\tb = input.read();\n\t\t\t\t\tif (b < '0' || '9' < b) return ret * sign;\n\t\t\t\t\tret *= 10;\n\t\t\t\t\tret += b - '0';\n\t\t\t\t}\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\ttry {\n\t\t\t\tdouble sign = 1;\n\t\t\t\tint b = input.read();\n\t\t\t\twhile ((b < '0' || '9' < b) && b != '-' && b != '+') {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\tif (b == '-') {\n\t\t\t\t\tsign = -1;\n\t\t\t\t\tb = input.read();\n\t\t\t\t} else if (b == '+') {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\tdouble ret = b - '0';\n\t\t\t\twhile (true) {\n\t\t\t\t\tb = input.read();\n\t\t\t\t\tif (b < '0' || '9' < b) break;\n\t\t\t\t\tret *= 10;\n\t\t\t\t\tret += b - '0';\n\t\t\t\t}\n\t\t\t\tif (b != '.') return sign * ret;\n\t\t\t\tdouble div = 1;\n\t\t\t\tb = input.read();\n\t\t\t\twhile ('0' <= b && b <= '9') {\n\t\t\t\t\tret *= 10;\n\t\t\t\t\tret += b - '0';\n\t\t\t\t\tdiv *= 10;\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\treturn sign * ret / div;\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn Double.NaN;\n\t\t\t}\n\t\t}\n\n\t\tchar nextChar() {\n\t\t\ttry {\n\t\t\t\tint b = input.read();\n\t\t\t\twhile (Character.isWhitespace(b)) {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\treturn (char) b;\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\n\t\tString nextStr() {\n\t\t\ttry {\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tint b = input.read();\n\t\t\t\twhile (Character.isWhitespace(b)) {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\twhile (b != -1 && !Character.isWhitespace(b)) {\n\t\t\t\t\tsb.append((char) b);\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\treturn sb.toString();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn \"\";\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic int[] nextIntArrayDec(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic int[] nextIntArray1Index(int n) {\n\t\t\tint[] res = new int[n + 1];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i + 1] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic long[] nextLongArrayDec(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic long[] nextLongArray1Index(int n) {\n\t\t\tlong[] res = new long[n + 1];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i + 1] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic double[] nextDoubleArray(int n) {\n\t\t\tdouble[] res = new double[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t}\n}\n/* end Main */", "language": "Java", "metadata": {"date": 1563430969, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02975.html", "problem_id": "p02975", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02975/input.txt", "sample_output_relpath": "derived/input_output/data/p02975/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02975/Java/s020418622.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s020418622", "user_id": "u234826697"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.*;\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport java.util.function.Function;\nimport java.util.stream.Collectors;\n\n@SuppressWarnings(\"unused\")\npublic class Main {\n\tFastScanner in = new FastScanner(System.in);\n\tPrintWriter out = new PrintWriter(System.out);\n\tfinal int MOD = (int)1e9+7;\n\tvoid printlnYN(boolean b){out.println((b ? \"Yes\" : \"No\"));}\n\t\n\t//https://onlinejudge.u-aizu.ac.jp/challenges/sources/ICPC/Prelim/1618?year=2017\n\n\t//System.out.println();はつかわない！！\n\tvoid solve() throws Exception{\n\t\tint N = in.nextInt();\n\t\tint[] a = in.nextIntArray(N);\n\t\tArrays.sort(a);\n\t\tif(a[N-1] == 0){\n\t\t\tprintlnYN(true);\n\t\t}else if(N % 3 != 0){\n\t\t\tprintlnYN(false);\n\t\t}else{\n\t\t\tboolean tf = (a[0] == a[N/3-1] && a[N/3] == a[2*N/3-1] && a[2*N/3] == a[N-1] && (a[0] ^ a[N/3] ^ a[2*N/3]) == 0);\n\t\t\tprintlnYN(tf);\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().m();\n\t}\n\t\n\tvoid m() throws Exception {\n\t\tsolve();\n\t\tout.flush();\n\t}\n\t\n\tclass FastScanner {\n\t\tReader input;\n\n\t\tFastScanner() {this(System.in);}\n\t\tFastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}\n\t\t\n\t\tint nextInt() {return (int) nextLong();}\n\n\t\tlong nextLong() {\n\t\t\ttry {\n\t\t\t\tint sign = 1;\n\t\t\t\tint b = input.read();\n\t\t\t\twhile ((b < '0' || '9' < b) && b != '-' && b != '+') {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\tif (b == '-') {\n\t\t\t\t\tsign = -1;\n\t\t\t\t\tb = input.read();\n\t\t\t\t} else if (b == '+') {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\tlong ret = b - '0';\n\t\t\t\twhile (true) {\n\t\t\t\t\tb = input.read();\n\t\t\t\t\tif (b < '0' || '9' < b) return ret * sign;\n\t\t\t\t\tret *= 10;\n\t\t\t\t\tret += b - '0';\n\t\t\t\t}\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\ttry {\n\t\t\t\tdouble sign = 1;\n\t\t\t\tint b = input.read();\n\t\t\t\twhile ((b < '0' || '9' < b) && b != '-' && b != '+') {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\tif (b == '-') {\n\t\t\t\t\tsign = -1;\n\t\t\t\t\tb = input.read();\n\t\t\t\t} else if (b == '+') {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\tdouble ret = b - '0';\n\t\t\t\twhile (true) {\n\t\t\t\t\tb = input.read();\n\t\t\t\t\tif (b < '0' || '9' < b) break;\n\t\t\t\t\tret *= 10;\n\t\t\t\t\tret += b - '0';\n\t\t\t\t}\n\t\t\t\tif (b != '.') return sign * ret;\n\t\t\t\tdouble div = 1;\n\t\t\t\tb = input.read();\n\t\t\t\twhile ('0' <= b && b <= '9') {\n\t\t\t\t\tret *= 10;\n\t\t\t\t\tret += b - '0';\n\t\t\t\t\tdiv *= 10;\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\treturn sign * ret / div;\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn Double.NaN;\n\t\t\t}\n\t\t}\n\n\t\tchar nextChar() {\n\t\t\ttry {\n\t\t\t\tint b = input.read();\n\t\t\t\twhile (Character.isWhitespace(b)) {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\treturn (char) b;\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\n\t\tString nextStr() {\n\t\t\ttry {\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tint b = input.read();\n\t\t\t\twhile (Character.isWhitespace(b)) {\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\twhile (b != -1 && !Character.isWhitespace(b)) {\n\t\t\t\t\tsb.append((char) b);\n\t\t\t\t\tb = input.read();\n\t\t\t\t}\n\t\t\t\treturn sb.toString();\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn \"\";\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic int[] nextIntArrayDec(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic int[] nextIntArray1Index(int n) {\n\t\t\tint[] res = new int[n + 1];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i + 1] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic long[] nextLongArray(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic long[] nextLongArrayDec(int n) {\n\t\t\tlong[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic long[] nextLongArray1Index(int n) {\n\t\t\tlong[] res = new long[n + 1];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i + 1] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n \n\t\tpublic double[] nextDoubleArray(int n) {\n\t\t\tdouble[] res = new double[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\t}\n}\n/* end Main */", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02975", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4220, "cpu_time_ms": 148, "memory_kb": 23636}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s206011951", "group_id": "codeNet:p02978", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tMyScanner sc = new MyScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tN = sc.nextInt() - 2;\n\t\tvalues = new long[N + 1];\n\t\tlong ans = sc.nextLong();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tvalues[i] = sc.nextLong();\n\t\t}\n\t\tans += sc.nextLong();\n\t\t\n\t\tnext = new int[1 << N][N+1];\n\t\tfor (int mask = 1; mask < 1 << N; mask++) {\n\t\t\tint prev = -1;\n\t\t\tfor (int i = 0; i < N; i++) if (contains(mask, i)) {\n\t\t\t\tif (prev != -1) next[mask][prev] = i;\n\t\t\t\telse next[mask][N] = i;\n\t\t\t\tprev = i;\n\t\t\t}\n\t\t\tnext[mask][prev] = N;\n\t\t}\n\t\tnext[0][N] = N;\n\t\t\n\t\trecurse((1 << N) - 1, (1 << N) - 1, 0, 0, false, -1, 0);\n\t\tans += best;\n\t\tout.println(ans);\n\t\t\n\t\tout.flush();\n\t}\n\t\n\tstatic int[][] next;\n\tstatic long best = Long.MAX_VALUE, sum = 0;\n\tstatic long[] values;\n\tstatic int N;\n\t\n\tstatic void recurse(int remainingMask, int availableMask, int myMask, int pos, boolean gotLast, int prev, int nextAvailableMask) {\n\t\tif (pos == N) {\n\t\t\tif (remainingMask != 0 && myMask == 0) return;\n\t\t\tint nextRemainingMask = remainingMask & ~myMask;\n\t\t\tif (gotLast) {\n\t\t\t\tsum += values[prev];\n\t\t\t}\n\t\t\tif (Integer.bitCount(nextRemainingMask) <= 3) {\n\t\t\t\tint tmp1 = next[nextRemainingMask][N];\n\t\t\t\tint tmp2 = next[nextRemainingMask][tmp1];\n\t\t\t\tint tmp3 = next[nextRemainingMask][tmp2];\n\t\t\t\tif (tmp3 == tmp1) {\n\t\t\t\t\ttmp1 = N;\n\t\t\t\t}\n\t\t\t\tif (values[tmp1] > values[tmp3]) {\n\t\t\t\t\tint tmp = tmp1;\n\t\t\t\t\ttmp1 = tmp3;\n\t\t\t\t\ttmp3 = tmp;\n\t\t\t\t}\n\t\t\t\tlong last = 2 * (values[tmp1] + values[tmp2] + values[tmp3]) + values[tmp1] + Math.min(3 * values[tmp2], Math.min(values[tmp1] + values[tmp2], values[tmp3]));\n\t\t\t\tbest = Math.min(best, sum + last);\n\t\t\t} else {\n\t\t\t\trecurse(nextRemainingMask, nextAvailableMask, 0, next[nextRemainingMask][N], false, -1, 0);\n\t\t\t}\n\t\t\tif (gotLast) {\n\t\t\t\tsum -= values[prev];\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tint nPos = next[remainingMask][pos];\n\t\tif (!gotLast && contains(availableMask, pos)) {\n\t\t\tint nAvaMask = nextAvailableMask;\n\t\t\tif (prev == -1) {\n\t\t\t\tsum += values[pos];\n\t\t\t} else {\n\t\t\t\tvalues[prev] += values[pos];\n\t\t\t\tnAvaMask |= 1 << prev;\n\t\t\t}\n\t\t\trecurse(remainingMask, availableMask, myMask | (1 << pos), nPos, true, pos, nAvaMask);\n\t\t\tif (prev == -1) {\n\t\t\t\tsum -= values[pos];\n\t\t\t} else {\n\t\t\t\tvalues[prev] -= values[pos];\n\t\t\t}\n\t\t}\n\t\tint nAvaMask = nextAvailableMask;\n\t\tif (gotLast) {\n\t\t\tvalues[pos] += values[prev];\n\t\t\tnAvaMask |= 1 << pos;\n\t\t}\n\t\trecurse(remainingMask, availableMask, myMask, nPos, false, pos, nAvaMask);\n\t\tif (gotLast) values[pos] -= values[prev];\n\t}\n\t\n\tstatic boolean contains(int mask, int pos) {\n\t\treturn (mask & (1 << pos)) != 0;\n\t}\n\t\n\tstatic class MyScanner {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tokenizer;\n\t\t\n\t\tpublic MyScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\t\t\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\t\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1563195291, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02978.html", "problem_id": "p02978", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02978/input.txt", "sample_output_relpath": "derived/input_output/data/p02978/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02978/Java/s206011951.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s206011951", "user_id": "u592387631"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tMyScanner sc = new MyScanner();\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tN = sc.nextInt() - 2;\n\t\tvalues = new long[N + 1];\n\t\tlong ans = sc.nextLong();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tvalues[i] = sc.nextLong();\n\t\t}\n\t\tans += sc.nextLong();\n\t\t\n\t\tnext = new int[1 << N][N+1];\n\t\tfor (int mask = 1; mask < 1 << N; mask++) {\n\t\t\tint prev = -1;\n\t\t\tfor (int i = 0; i < N; i++) if (contains(mask, i)) {\n\t\t\t\tif (prev != -1) next[mask][prev] = i;\n\t\t\t\telse next[mask][N] = i;\n\t\t\t\tprev = i;\n\t\t\t}\n\t\t\tnext[mask][prev] = N;\n\t\t}\n\t\tnext[0][N] = N;\n\t\t\n\t\trecurse((1 << N) - 1, (1 << N) - 1, 0, 0, false, -1, 0);\n\t\tans += best;\n\t\tout.println(ans);\n\t\t\n\t\tout.flush();\n\t}\n\t\n\tstatic int[][] next;\n\tstatic long best = Long.MAX_VALUE, sum = 0;\n\tstatic long[] values;\n\tstatic int N;\n\t\n\tstatic void recurse(int remainingMask, int availableMask, int myMask, int pos, boolean gotLast, int prev, int nextAvailableMask) {\n\t\tif (pos == N) {\n\t\t\tif (remainingMask != 0 && myMask == 0) return;\n\t\t\tint nextRemainingMask = remainingMask & ~myMask;\n\t\t\tif (gotLast) {\n\t\t\t\tsum += values[prev];\n\t\t\t}\n\t\t\tif (Integer.bitCount(nextRemainingMask) <= 3) {\n\t\t\t\tint tmp1 = next[nextRemainingMask][N];\n\t\t\t\tint tmp2 = next[nextRemainingMask][tmp1];\n\t\t\t\tint tmp3 = next[nextRemainingMask][tmp2];\n\t\t\t\tif (tmp3 == tmp1) {\n\t\t\t\t\ttmp1 = N;\n\t\t\t\t}\n\t\t\t\tif (values[tmp1] > values[tmp3]) {\n\t\t\t\t\tint tmp = tmp1;\n\t\t\t\t\ttmp1 = tmp3;\n\t\t\t\t\ttmp3 = tmp;\n\t\t\t\t}\n\t\t\t\tlong last = 2 * (values[tmp1] + values[tmp2] + values[tmp3]) + values[tmp1] + Math.min(3 * values[tmp2], Math.min(values[tmp1] + values[tmp2], values[tmp3]));\n\t\t\t\tbest = Math.min(best, sum + last);\n\t\t\t} else {\n\t\t\t\trecurse(nextRemainingMask, nextAvailableMask, 0, next[nextRemainingMask][N], false, -1, 0);\n\t\t\t}\n\t\t\tif (gotLast) {\n\t\t\t\tsum -= values[prev];\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tint nPos = next[remainingMask][pos];\n\t\tif (!gotLast && contains(availableMask, pos)) {\n\t\t\tint nAvaMask = nextAvailableMask;\n\t\t\tif (prev == -1) {\n\t\t\t\tsum += values[pos];\n\t\t\t} else {\n\t\t\t\tvalues[prev] += values[pos];\n\t\t\t\tnAvaMask |= 1 << prev;\n\t\t\t}\n\t\t\trecurse(remainingMask, availableMask, myMask | (1 << pos), nPos, true, pos, nAvaMask);\n\t\t\tif (prev == -1) {\n\t\t\t\tsum -= values[pos];\n\t\t\t} else {\n\t\t\t\tvalues[prev] -= values[pos];\n\t\t\t}\n\t\t}\n\t\tint nAvaMask = nextAvailableMask;\n\t\tif (gotLast) {\n\t\t\tvalues[pos] += values[prev];\n\t\t\tnAvaMask |= 1 << pos;\n\t\t}\n\t\trecurse(remainingMask, availableMask, myMask, nPos, false, pos, nAvaMask);\n\t\tif (gotLast) values[pos] -= values[prev];\n\t}\n\t\n\tstatic boolean contains(int mask, int pos) {\n\t\treturn (mask & (1 << pos)) != 0;\n\t}\n\t\n\tstatic class MyScanner {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tokenizer;\n\t\t\n\t\tpublic MyScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\t\t\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(br.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\t\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\t\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t}\n}\n", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nThere is a stack of N cards, each of which has a non-negative integer written on it. The integer written on the i-th card from the top is A_i.\n\nSnuke will repeat the following operation until two cards remain:\n\nChoose three consecutive cards from the stack.\n\nEat the middle card of the three.\n\nFor each of the other two cards, replace the integer written on it by the sum of that integer and the integer written on the card eaten.\n\nReturn the two cards to the original position in the stack, without swapping them.\n\nFind the minimum possible sum of the integers written on the last two cards remaining.\n\nConstraints\n\n2 \\leq N \\leq 18\n\n0 \\leq A_i \\leq 10^9 (1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sum of the integers written on the last two cards remaining.\n\nSample Input 1\n\n4\n3 1 4 2\n\nSample Output 1\n\n16\n\nWe can minimize the sum of the integers written on the last two cards remaining by doing as follows:\n\nInitially, the integers written on the cards are 3, 1, 4, and 2 from top to bottom.\n\nChoose the first, second, and third card from the top. Eat the second card with 1 written on it, add 1 to each of the other two cards, and return them to the original position in the stack. The integers written on the cards are now 4, 5, and 2 from top to bottom.\n\nChoose the first, second, and third card from the top. Eat the second card with 5 written on it, add 5 to each of the other two cards, and return them to the original position in the stack. The integers written on the cards are now 9 and 7 from top to bottom.\n\nThe sum of the integers written on the last two cards remaining is 16.\n\nSample Input 2\n\n6\n5 2 4 1 6 9\n\nSample Output 2\n\n51\n\nSample Input 3\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n115", "sample_input": "4\n3 1 4 2\n"}, "reference_outputs": ["16\n"], "source_document_id": "p02978", "source_text": "Score : 1000 points\n\nProblem Statement\n\nThere is a stack of N cards, each of which has a non-negative integer written on it. The integer written on the i-th card from the top is A_i.\n\nSnuke will repeat the following operation until two cards remain:\n\nChoose three consecutive cards from the stack.\n\nEat the middle card of the three.\n\nFor each of the other two cards, replace the integer written on it by the sum of that integer and the integer written on the card eaten.\n\nReturn the two cards to the original position in the stack, without swapping them.\n\nFind the minimum possible sum of the integers written on the last two cards remaining.\n\nConstraints\n\n2 \\leq N \\leq 18\n\n0 \\leq A_i \\leq 10^9 (1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sum of the integers written on the last two cards remaining.\n\nSample Input 1\n\n4\n3 1 4 2\n\nSample Output 1\n\n16\n\nWe can minimize the sum of the integers written on the last two cards remaining by doing as follows:\n\nInitially, the integers written on the cards are 3, 1, 4, and 2 from top to bottom.\n\nChoose the first, second, and third card from the top. Eat the second card with 1 written on it, add 1 to each of the other two cards, and return them to the original position in the stack. The integers written on the cards are now 4, 5, and 2 from top to bottom.\n\nChoose the first, second, and third card from the top. Eat the second card with 5 written on it, add 5 to each of the other two cards, and return them to the original position in the stack. The integers written on the cards are now 9 and 7 from top to bottom.\n\nThe sum of the integers written on the last two cards remaining is 16.\n\nSample Input 2\n\n6\n5 2 4 1 6 9\n\nSample Output 2\n\n51\n\nSample Input 3\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n115", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3398, "cpu_time_ms": 1799, "memory_kb": 30532}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s483974601", "group_id": "codeNet:p02981", "input_text": "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int A = sc.nextInt();\n int B = sc.nextInt();\n int T = N*A;\n if (T<=B){\n System.out.println(T);\n } else {\n System.out.println(B);\n } \n }\n}", "language": "Java", "metadata": {"date": 1580156111, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02981.html", "problem_id": "p02981", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02981/input.txt", "sample_output_relpath": "derived/input_output/data/p02981/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02981/Java/s483974601.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s483974601", "user_id": "u380131880"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int A = sc.nextInt();\n int B = sc.nextInt();\n int T = N*A;\n if (T<=B){\n System.out.println(T);\n } else {\n System.out.println(B);\n } \n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "sample_input": "4 2 9\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02981", "source_text": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 96, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s911376674", "group_id": "codeNet:p02981", "input_text": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n int NA,NB;\n\n NA = N*A;\n \n if(NA < B){\n System.out.println(NA);\n }else{\n System.out.println(B);\n }\n \n }\n\n}", "language": "Java", "metadata": {"date": 1562547820, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02981.html", "problem_id": "p02981", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02981/input.txt", "sample_output_relpath": "derived/input_output/data/p02981/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02981/Java/s911376674.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s911376674", "user_id": "u613944332"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int A = sc.nextInt();\n int B = sc.nextInt();\n\n int NA,NB;\n\n NA = N*A;\n \n if(NA < B){\n System.out.println(NA);\n }else{\n System.out.println(B);\n }\n \n }\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "sample_input": "4 2 9\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02981", "source_text": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 440, "cpu_time_ms": 92, "memory_kb": 21588}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s497599716", "group_id": "codeNet:p02982", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n BGoodDistance solver = new BGoodDistance();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class BGoodDistance {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int n = in.nextInt();\n int d = in.nextInt();\n int x[][] = new int[n][d];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < d; j++) {\n x[i][j] = in.nextInt();\n }\n }\n int nb = 0;\n for (int i = 0; i < n; i++)\n for (int j = i + 1; j < n; j++) {\n long res = 0;\n for (int k = 0; k < d; k++) {\n res += (x[i][k] - x[j][k]) * (x[i][k] - x[j][k]);\n }\n double result = Math.sqrt(res);\n int res1 = (int) result;\n if (Math.abs(result - res1) <= 0.000001 || Math.abs(result - res1 - 1) <= 0.000001)\n nb++;\n }\n out.println(nb);\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1563725462, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02982.html", "problem_id": "p02982", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02982/input.txt", "sample_output_relpath": "derived/input_output/data/p02982/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02982/Java/s497599716.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s497599716", "user_id": "u870426590"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n BGoodDistance solver = new BGoodDistance();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class BGoodDistance {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int n = in.nextInt();\n int d = in.nextInt();\n int x[][] = new int[n][d];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < d; j++) {\n x[i][j] = in.nextInt();\n }\n }\n int nb = 0;\n for (int i = 0; i < n; i++)\n for (int j = i + 1; j < n; j++) {\n long res = 0;\n for (int k = 0; k < d; k++) {\n res += (x[i][k] - x[j][k]) * (x[i][k] - x[j][k]);\n }\n double result = Math.sqrt(res);\n int res1 = (int) result;\n if (Math.abs(result - res1) <= 0.000001 || Math.abs(result - res1 - 1) <= 0.000001)\n nb++;\n }\n out.println(nb);\n }\n\n }\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "sample_input": "3 2\n1 2\n5 5\n-2 8\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02982", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1557, "cpu_time_ms": 109, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s601832472", "group_id": "codeNet:p02986", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n FColorfulTree solver = new FColorfulTree();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class FColorfulTree {\n int[] ans;\n Graph g;\n List> g2;\n List> qs;\n int[] cd;\n int[] cnt;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int q = in.readInt();\n\n g = new Graph(n);\n g2 = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n g2.add(new ArrayList<>());\n }\n for (int i = 0; i < n - 1; i++) {\n int a = in.readInt() - 1;\n int b = in.readInt() - 1;\n int c = in.readInt() - 1;\n int d = in.readInt();\n\n g.addWeightedEdge(a, b, d);\n g2.get(a).add(new Edge2(a, b, c, d));\n g2.get(b).add(new Edge2(b, a, c, d));\n }\n\n LCA l = new LCA(g);\n\n qs = new ArrayList<>();\n for (int i = 0; i < n; i++) qs.add(new ArrayList<>());\n for (int i = 0; i < q; i++) {\n int x = in.readInt() - 1;\n int y = in.readInt();\n int u = in.readInt() - 1;\n int v = in.readInt() - 1;\n qs.get(u).add(new Query(i, x, y, 1));\n qs.get(v).add(new Query(i, x, y, 1));\n qs.get(l.getLCA(u, v)).add(new Query(i, x, y, -2));\n }\n\n ans = new int[q];\n cd = new int[n];\n cnt = new int[n];\n dfs(0, -1, 0);\n for (int i = 0; i < q; i++) {\n out.printLine(ans[i]);\n }\n }\n\n void dfs(int i, int p, int d) {\n for (Query q : qs.get(i)) {\n ans[q.i] += (d + q.y * cnt[q.x] - cd[q.x]) * q.t;\n }\n for (Edge2 e : g2.get(i)) {\n int v = e.b;\n int c = e.c;\n int ed = e.d;\n if (v == p || ed < 0) continue;\n cnt[c]++;\n cd[c] += ed;\n dfs(v, i, d + ed);\n cd[c] -= ed;\n cnt[c]--;\n }\n }\n\n class Edge2 {\n int a;\n int b;\n int c;\n int d;\n\n public Edge2(int a, int b, int c, int d) {\n this.a = a;\n this.b = b;\n this.c = c;\n this.d = d;\n }\n\n }\n\n class Query {\n int i;\n int x;\n int y;\n int t;\n\n public Query(int i, int x, int y, int t) {\n this.i = i;\n this.x = x;\n this.y = y;\n this.t = t;\n }\n\n }\n\n }\n\n static class LCA {\n private final long[] order;\n private final int[] position;\n private final Graph graph;\n private final IntervalTree lcaTree;\n private final int[] level;\n\n public LCA(Graph graph) {\n this(graph, 0);\n }\n\n public LCA(Graph graph, int root) {\n this.graph = graph;\n order = new long[2 * graph.vertexCount() - 1];\n position = new int[graph.vertexCount()];\n level = new int[graph.vertexCount()];\n int[] index = new int[graph.vertexCount()];\n for (int i = 0; i < index.length; i++) {\n index[i] = graph.firstOutbound(i);\n }\n int[] last = new int[graph.vertexCount()];\n int[] stack = new int[graph.vertexCount()];\n stack[0] = root;\n int size = 1;\n int j = 0;\n last[root] = -1;\n Arrays.fill(position, -1);\n while (size > 0) {\n int vertex = stack[--size];\n if (position[vertex] == -1) {\n position[vertex] = j;\n }\n order[j++] = vertex;\n if (last[vertex] != -1) {\n level[vertex] = level[last[vertex]] + 1;\n }\n while (index[vertex] != -1 && last[vertex] == graph.destination(index[vertex])) {\n index[vertex] = graph.nextOutbound(index[vertex]);\n }\n if (index[vertex] != -1) {\n stack[size++] = vertex;\n stack[size++] = graph.destination(index[vertex]);\n last[graph.destination(index[vertex])] = vertex;\n index[vertex] = graph.nextOutbound(index[vertex]);\n }\n }\n lcaTree = new ReadOnlyIntervalTree(order) {\n\n protected long joinValue(long left, long right) {\n if (left == -1) {\n return right;\n }\n if (right == -1) {\n return left;\n }\n if (level[((int) left)] < level[((int) right)]) {\n return left;\n }\n return right;\n }\n\n\n protected long neutralValue() {\n return -1;\n }\n };\n lcaTree.init();\n }\n\n public int getLCA(int first, int second) {\n return (int) lcaTree\n .query(Math.min(position[first], position[second]), Math.max(position[first], position[second]));\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static abstract class ReadOnlyIntervalTree extends IntervalTree {\n protected long[] value;\n protected long[] array;\n\n protected ReadOnlyIntervalTree(long[] array) {\n super(array.length, false);\n this.array = array;\n init();\n }\n\n protected void initData(int size, int nodeCount) {\n value = new long[nodeCount];\n }\n\n protected void initAfter(int root, int left, int right, int middle) {\n value[root] = joinValue(value[2 * root + 1], value[2 * root + 2]);\n }\n\n protected void initBefore(int root, int left, int right, int middle) {\n }\n\n protected void initLeaf(int root, int index) {\n value[root] = array[index];\n }\n\n protected long queryPostProcess(int root, int left, int right, int from, int to, int middle, long leftResult,\n long rightResult) {\n return joinValue(leftResult, rightResult);\n }\n\n protected void queryPreProcess(int root, int left, int right, int from, int to, int middle) {\n }\n\n protected long queryFull(int root, int left, int right, int from, int to) {\n return value[root];\n }\n\n protected long emptySegmentResult() {\n return neutralValue();\n }\n\n protected abstract long neutralValue();\n\n protected abstract long joinValue(long left, long right);\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n\n static interface Edge {\n }\n\n static abstract class IntervalTree {\n protected int size;\n\n protected IntervalTree(int size) {\n this(size, true);\n }\n\n public IntervalTree(int size, boolean shouldInit) {\n this.size = size;\n int nodeCount = Math.max(1, Integer.highestOneBit(size) << 2);\n initData(size, nodeCount);\n if (shouldInit) {\n init();\n }\n }\n\n protected abstract void initData(int size, int nodeCount);\n\n protected abstract void initAfter(int root, int left, int right, int middle);\n\n protected abstract void initBefore(int root, int left, int right, int middle);\n\n protected abstract void initLeaf(int root, int index);\n\n protected abstract long queryPostProcess(int root, int left, int right, int from, int to, int middle,\n long leftResult, long rightResult);\n\n protected abstract void queryPreProcess(int root, int left, int right, int from, int to, int middle);\n\n protected abstract long queryFull(int root, int left, int right, int from, int to);\n\n protected abstract long emptySegmentResult();\n\n public void init() {\n if (size == 0) {\n return;\n }\n init(0, 0, size - 1);\n }\n\n private void init(int root, int left, int right) {\n if (left == right) {\n initLeaf(root, left);\n } else {\n int middle = (left + right) >> 1;\n initBefore(root, left, right, middle);\n init(2 * root + 1, left, middle);\n init(2 * root + 2, middle + 1, right);\n initAfter(root, left, right, middle);\n }\n }\n\n public long query(int from, int to) {\n return query(0, 0, size - 1, from, to);\n }\n\n protected long query(int root, int left, int right, int from, int to) {\n if (left > to || right < from) {\n return emptySegmentResult();\n }\n if (left >= from && right <= to) {\n return queryFull(root, left, right, from, to);\n }\n int middle = (left + right) >> 1;\n queryPreProcess(root, left, right, from, to, middle);\n long leftResult = query(2 * root + 1, left, middle, from, to);\n long rightResult = query(2 * root + 2, middle + 1, right, from, to);\n return queryPostProcess(root, left, right, from, to, middle, leftResult, rightResult);\n }\n\n }\n\n static class Graph {\n public static final int REMOVED_BIT = 0;\n protected int vertexCount;\n protected int edgeCount;\n private int[] firstOutbound;\n private int[] firstInbound;\n private Edge[] edges;\n private int[] nextInbound;\n private int[] nextOutbound;\n private int[] from;\n private int[] to;\n private long[] weight;\n public long[] capacity;\n private int[] reverseEdge;\n private int[] flags;\n\n public Graph(int vertexCount) {\n this(vertexCount, vertexCount);\n }\n\n public Graph(int vertexCount, int edgeCapacity) {\n this.vertexCount = vertexCount;\n firstOutbound = new int[vertexCount];\n Arrays.fill(firstOutbound, -1);\n\n from = new int[edgeCapacity];\n to = new int[edgeCapacity];\n nextOutbound = new int[edgeCapacity];\n flags = new int[edgeCapacity];\n }\n\n public int addEdge(int fromID, int toID, long weight, long capacity, int reverseEdge) {\n ensureEdgeCapacity(edgeCount + 1);\n if (firstOutbound[fromID] != -1) {\n nextOutbound[edgeCount] = firstOutbound[fromID];\n } else {\n nextOutbound[edgeCount] = -1;\n }\n firstOutbound[fromID] = edgeCount;\n if (firstInbound != null) {\n if (firstInbound[toID] != -1) {\n nextInbound[edgeCount] = firstInbound[toID];\n } else {\n nextInbound[edgeCount] = -1;\n }\n firstInbound[toID] = edgeCount;\n }\n this.from[edgeCount] = fromID;\n this.to[edgeCount] = toID;\n if (capacity != 0) {\n if (this.capacity == null) {\n this.capacity = new long[from.length];\n }\n this.capacity[edgeCount] = capacity;\n }\n if (weight != 0) {\n if (this.weight == null) {\n this.weight = new long[from.length];\n }\n this.weight[edgeCount] = weight;\n }\n if (reverseEdge != -1) {\n if (this.reverseEdge == null) {\n this.reverseEdge = new int[from.length];\n Arrays.fill(this.reverseEdge, 0, edgeCount, -1);\n }\n this.reverseEdge[edgeCount] = reverseEdge;\n }\n if (edges != null) {\n edges[edgeCount] = createEdge(edgeCount);\n }\n return edgeCount++;\n }\n\n protected final GraphEdge createEdge(int id) {\n return new GraphEdge(id);\n }\n\n public final int addFlowWeightedEdge(int from, int to, long weight, long capacity) {\n if (capacity == 0) {\n return addEdge(from, to, weight, 0, -1);\n } else {\n int lastEdgeCount = edgeCount;\n addEdge(to, from, -weight, 0, lastEdgeCount + entriesPerEdge());\n return addEdge(from, to, weight, capacity, lastEdgeCount);\n }\n }\n\n protected int entriesPerEdge() {\n return 1;\n }\n\n public final int addWeightedEdge(int from, int to, long weight) {\n return addFlowWeightedEdge(from, to, weight, 0);\n }\n\n public final int vertexCount() {\n return vertexCount;\n }\n\n public final int firstOutbound(int vertex) {\n int id = firstOutbound[vertex];\n while (id != -1 && isRemoved(id)) {\n id = nextOutbound[id];\n }\n return id;\n }\n\n public final int nextOutbound(int id) {\n id = nextOutbound[id];\n while (id != -1 && isRemoved(id)) {\n id = nextOutbound[id];\n }\n return id;\n }\n\n public final int destination(int id) {\n return to[id];\n }\n\n public final boolean flag(int id, int bit) {\n return (flags[id] >> bit & 1) != 0;\n }\n\n public final boolean isRemoved(int id) {\n return flag(id, REMOVED_BIT);\n }\n\n protected void ensureEdgeCapacity(int size) {\n if (from.length < size) {\n int newSize = Math.max(size, 2 * from.length);\n if (edges != null) {\n edges = resize(edges, newSize);\n }\n from = resize(from, newSize);\n to = resize(to, newSize);\n nextOutbound = resize(nextOutbound, newSize);\n if (nextInbound != null) {\n nextInbound = resize(nextInbound, newSize);\n }\n if (weight != null) {\n weight = resize(weight, newSize);\n }\n if (capacity != null) {\n capacity = resize(capacity, newSize);\n }\n if (reverseEdge != null) {\n reverseEdge = resize(reverseEdge, newSize);\n }\n flags = resize(flags, newSize);\n }\n }\n\n protected final int[] resize(int[] array, int size) {\n int[] newArray = new int[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n private long[] resize(long[] array, int size) {\n long[] newArray = new long[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n private Edge[] resize(Edge[] array, int size) {\n Edge[] newArray = new Edge[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n protected class GraphEdge implements Edge {\n protected int id;\n\n protected GraphEdge(int id) {\n this.id = id;\n }\n\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1565623987, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02986.html", "problem_id": "p02986", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02986/input.txt", "sample_output_relpath": "derived/input_output/data/p02986/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02986/Java/s601832472.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s601832472", "user_id": "u038084150"}, "prompt_components": {"gold_output": "130\n200\n60\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n FColorfulTree solver = new FColorfulTree();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class FColorfulTree {\n int[] ans;\n Graph g;\n List> g2;\n List> qs;\n int[] cd;\n int[] cnt;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int q = in.readInt();\n\n g = new Graph(n);\n g2 = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n g2.add(new ArrayList<>());\n }\n for (int i = 0; i < n - 1; i++) {\n int a = in.readInt() - 1;\n int b = in.readInt() - 1;\n int c = in.readInt() - 1;\n int d = in.readInt();\n\n g.addWeightedEdge(a, b, d);\n g2.get(a).add(new Edge2(a, b, c, d));\n g2.get(b).add(new Edge2(b, a, c, d));\n }\n\n LCA l = new LCA(g);\n\n qs = new ArrayList<>();\n for (int i = 0; i < n; i++) qs.add(new ArrayList<>());\n for (int i = 0; i < q; i++) {\n int x = in.readInt() - 1;\n int y = in.readInt();\n int u = in.readInt() - 1;\n int v = in.readInt() - 1;\n qs.get(u).add(new Query(i, x, y, 1));\n qs.get(v).add(new Query(i, x, y, 1));\n qs.get(l.getLCA(u, v)).add(new Query(i, x, y, -2));\n }\n\n ans = new int[q];\n cd = new int[n];\n cnt = new int[n];\n dfs(0, -1, 0);\n for (int i = 0; i < q; i++) {\n out.printLine(ans[i]);\n }\n }\n\n void dfs(int i, int p, int d) {\n for (Query q : qs.get(i)) {\n ans[q.i] += (d + q.y * cnt[q.x] - cd[q.x]) * q.t;\n }\n for (Edge2 e : g2.get(i)) {\n int v = e.b;\n int c = e.c;\n int ed = e.d;\n if (v == p || ed < 0) continue;\n cnt[c]++;\n cd[c] += ed;\n dfs(v, i, d + ed);\n cd[c] -= ed;\n cnt[c]--;\n }\n }\n\n class Edge2 {\n int a;\n int b;\n int c;\n int d;\n\n public Edge2(int a, int b, int c, int d) {\n this.a = a;\n this.b = b;\n this.c = c;\n this.d = d;\n }\n\n }\n\n class Query {\n int i;\n int x;\n int y;\n int t;\n\n public Query(int i, int x, int y, int t) {\n this.i = i;\n this.x = x;\n this.y = y;\n this.t = t;\n }\n\n }\n\n }\n\n static class LCA {\n private final long[] order;\n private final int[] position;\n private final Graph graph;\n private final IntervalTree lcaTree;\n private final int[] level;\n\n public LCA(Graph graph) {\n this(graph, 0);\n }\n\n public LCA(Graph graph, int root) {\n this.graph = graph;\n order = new long[2 * graph.vertexCount() - 1];\n position = new int[graph.vertexCount()];\n level = new int[graph.vertexCount()];\n int[] index = new int[graph.vertexCount()];\n for (int i = 0; i < index.length; i++) {\n index[i] = graph.firstOutbound(i);\n }\n int[] last = new int[graph.vertexCount()];\n int[] stack = new int[graph.vertexCount()];\n stack[0] = root;\n int size = 1;\n int j = 0;\n last[root] = -1;\n Arrays.fill(position, -1);\n while (size > 0) {\n int vertex = stack[--size];\n if (position[vertex] == -1) {\n position[vertex] = j;\n }\n order[j++] = vertex;\n if (last[vertex] != -1) {\n level[vertex] = level[last[vertex]] + 1;\n }\n while (index[vertex] != -1 && last[vertex] == graph.destination(index[vertex])) {\n index[vertex] = graph.nextOutbound(index[vertex]);\n }\n if (index[vertex] != -1) {\n stack[size++] = vertex;\n stack[size++] = graph.destination(index[vertex]);\n last[graph.destination(index[vertex])] = vertex;\n index[vertex] = graph.nextOutbound(index[vertex]);\n }\n }\n lcaTree = new ReadOnlyIntervalTree(order) {\n\n protected long joinValue(long left, long right) {\n if (left == -1) {\n return right;\n }\n if (right == -1) {\n return left;\n }\n if (level[((int) left)] < level[((int) right)]) {\n return left;\n }\n return right;\n }\n\n\n protected long neutralValue() {\n return -1;\n }\n };\n lcaTree.init();\n }\n\n public int getLCA(int first, int second) {\n return (int) lcaTree\n .query(Math.min(position[first], position[second]), Math.max(position[first], position[second]));\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static abstract class ReadOnlyIntervalTree extends IntervalTree {\n protected long[] value;\n protected long[] array;\n\n protected ReadOnlyIntervalTree(long[] array) {\n super(array.length, false);\n this.array = array;\n init();\n }\n\n protected void initData(int size, int nodeCount) {\n value = new long[nodeCount];\n }\n\n protected void initAfter(int root, int left, int right, int middle) {\n value[root] = joinValue(value[2 * root + 1], value[2 * root + 2]);\n }\n\n protected void initBefore(int root, int left, int right, int middle) {\n }\n\n protected void initLeaf(int root, int index) {\n value[root] = array[index];\n }\n\n protected long queryPostProcess(int root, int left, int right, int from, int to, int middle, long leftResult,\n long rightResult) {\n return joinValue(leftResult, rightResult);\n }\n\n protected void queryPreProcess(int root, int left, int right, int from, int to, int middle) {\n }\n\n protected long queryFull(int root, int left, int right, int from, int to) {\n return value[root];\n }\n\n protected long emptySegmentResult() {\n return neutralValue();\n }\n\n protected abstract long neutralValue();\n\n protected abstract long joinValue(long left, long right);\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n\n static interface Edge {\n }\n\n static abstract class IntervalTree {\n protected int size;\n\n protected IntervalTree(int size) {\n this(size, true);\n }\n\n public IntervalTree(int size, boolean shouldInit) {\n this.size = size;\n int nodeCount = Math.max(1, Integer.highestOneBit(size) << 2);\n initData(size, nodeCount);\n if (shouldInit) {\n init();\n }\n }\n\n protected abstract void initData(int size, int nodeCount);\n\n protected abstract void initAfter(int root, int left, int right, int middle);\n\n protected abstract void initBefore(int root, int left, int right, int middle);\n\n protected abstract void initLeaf(int root, int index);\n\n protected abstract long queryPostProcess(int root, int left, int right, int from, int to, int middle,\n long leftResult, long rightResult);\n\n protected abstract void queryPreProcess(int root, int left, int right, int from, int to, int middle);\n\n protected abstract long queryFull(int root, int left, int right, int from, int to);\n\n protected abstract long emptySegmentResult();\n\n public void init() {\n if (size == 0) {\n return;\n }\n init(0, 0, size - 1);\n }\n\n private void init(int root, int left, int right) {\n if (left == right) {\n initLeaf(root, left);\n } else {\n int middle = (left + right) >> 1;\n initBefore(root, left, right, middle);\n init(2 * root + 1, left, middle);\n init(2 * root + 2, middle + 1, right);\n initAfter(root, left, right, middle);\n }\n }\n\n public long query(int from, int to) {\n return query(0, 0, size - 1, from, to);\n }\n\n protected long query(int root, int left, int right, int from, int to) {\n if (left > to || right < from) {\n return emptySegmentResult();\n }\n if (left >= from && right <= to) {\n return queryFull(root, left, right, from, to);\n }\n int middle = (left + right) >> 1;\n queryPreProcess(root, left, right, from, to, middle);\n long leftResult = query(2 * root + 1, left, middle, from, to);\n long rightResult = query(2 * root + 2, middle + 1, right, from, to);\n return queryPostProcess(root, left, right, from, to, middle, leftResult, rightResult);\n }\n\n }\n\n static class Graph {\n public static final int REMOVED_BIT = 0;\n protected int vertexCount;\n protected int edgeCount;\n private int[] firstOutbound;\n private int[] firstInbound;\n private Edge[] edges;\n private int[] nextInbound;\n private int[] nextOutbound;\n private int[] from;\n private int[] to;\n private long[] weight;\n public long[] capacity;\n private int[] reverseEdge;\n private int[] flags;\n\n public Graph(int vertexCount) {\n this(vertexCount, vertexCount);\n }\n\n public Graph(int vertexCount, int edgeCapacity) {\n this.vertexCount = vertexCount;\n firstOutbound = new int[vertexCount];\n Arrays.fill(firstOutbound, -1);\n\n from = new int[edgeCapacity];\n to = new int[edgeCapacity];\n nextOutbound = new int[edgeCapacity];\n flags = new int[edgeCapacity];\n }\n\n public int addEdge(int fromID, int toID, long weight, long capacity, int reverseEdge) {\n ensureEdgeCapacity(edgeCount + 1);\n if (firstOutbound[fromID] != -1) {\n nextOutbound[edgeCount] = firstOutbound[fromID];\n } else {\n nextOutbound[edgeCount] = -1;\n }\n firstOutbound[fromID] = edgeCount;\n if (firstInbound != null) {\n if (firstInbound[toID] != -1) {\n nextInbound[edgeCount] = firstInbound[toID];\n } else {\n nextInbound[edgeCount] = -1;\n }\n firstInbound[toID] = edgeCount;\n }\n this.from[edgeCount] = fromID;\n this.to[edgeCount] = toID;\n if (capacity != 0) {\n if (this.capacity == null) {\n this.capacity = new long[from.length];\n }\n this.capacity[edgeCount] = capacity;\n }\n if (weight != 0) {\n if (this.weight == null) {\n this.weight = new long[from.length];\n }\n this.weight[edgeCount] = weight;\n }\n if (reverseEdge != -1) {\n if (this.reverseEdge == null) {\n this.reverseEdge = new int[from.length];\n Arrays.fill(this.reverseEdge, 0, edgeCount, -1);\n }\n this.reverseEdge[edgeCount] = reverseEdge;\n }\n if (edges != null) {\n edges[edgeCount] = createEdge(edgeCount);\n }\n return edgeCount++;\n }\n\n protected final GraphEdge createEdge(int id) {\n return new GraphEdge(id);\n }\n\n public final int addFlowWeightedEdge(int from, int to, long weight, long capacity) {\n if (capacity == 0) {\n return addEdge(from, to, weight, 0, -1);\n } else {\n int lastEdgeCount = edgeCount;\n addEdge(to, from, -weight, 0, lastEdgeCount + entriesPerEdge());\n return addEdge(from, to, weight, capacity, lastEdgeCount);\n }\n }\n\n protected int entriesPerEdge() {\n return 1;\n }\n\n public final int addWeightedEdge(int from, int to, long weight) {\n return addFlowWeightedEdge(from, to, weight, 0);\n }\n\n public final int vertexCount() {\n return vertexCount;\n }\n\n public final int firstOutbound(int vertex) {\n int id = firstOutbound[vertex];\n while (id != -1 && isRemoved(id)) {\n id = nextOutbound[id];\n }\n return id;\n }\n\n public final int nextOutbound(int id) {\n id = nextOutbound[id];\n while (id != -1 && isRemoved(id)) {\n id = nextOutbound[id];\n }\n return id;\n }\n\n public final int destination(int id) {\n return to[id];\n }\n\n public final boolean flag(int id, int bit) {\n return (flags[id] >> bit & 1) != 0;\n }\n\n public final boolean isRemoved(int id) {\n return flag(id, REMOVED_BIT);\n }\n\n protected void ensureEdgeCapacity(int size) {\n if (from.length < size) {\n int newSize = Math.max(size, 2 * from.length);\n if (edges != null) {\n edges = resize(edges, newSize);\n }\n from = resize(from, newSize);\n to = resize(to, newSize);\n nextOutbound = resize(nextOutbound, newSize);\n if (nextInbound != null) {\n nextInbound = resize(nextInbound, newSize);\n }\n if (weight != null) {\n weight = resize(weight, newSize);\n }\n if (capacity != null) {\n capacity = resize(capacity, newSize);\n }\n if (reverseEdge != null) {\n reverseEdge = resize(reverseEdge, newSize);\n }\n flags = resize(flags, newSize);\n }\n }\n\n protected final int[] resize(int[] array, int size) {\n int[] newArray = new int[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n private long[] resize(long[] array, int size) {\n long[] newArray = new long[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n private Edge[] resize(Edge[] array, int size) {\n Edge[] newArray = new Edge[size];\n System.arraycopy(array, 0, newArray, 0, array.length);\n return newArray;\n }\n\n protected class GraphEdge implements Edge {\n protected int id;\n\n protected GraphEdge(int id) {\n this.id = id;\n }\n\n }\n\n }\n}\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 to N.\nThe i-th edge in this tree connects Vertex a_i and Vertex b_i, and the color and length of that edge are c_i and d_i, respectively.\nHere the color of each edge is represented by an integer between 1 and N-1 (inclusive). The same integer corresponds to the same color, and different integers correspond to different colors.\n\nAnswer the following Q queries:\n\nQuery j (1 \\leq j \\leq Q): assuming that the length of every edge whose color is x_j is changed to y_j, find the distance between Vertex u_j and Vertex v_j. (The changes of the lengths of edges do not affect the subsequent queries.)\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\n1 \\leq c_i \\leq N-1\n\n1 \\leq d_i \\leq 10^4\n\n1 \\leq x_j \\leq N-1\n\n1 \\leq y_j \\leq 10^4\n\n1 \\leq u_j < v_j \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1 c_1 d_1\n:\na_{N-1} b_{N-1} c_{N-1} d_{N-1}\nx_1 y_1 u_1 v_1\n:\nx_Q y_Q u_Q v_Q\n\nOutput\n\nPrint Q lines. The j-th line (1 \\leq j \\leq Q) should contain the answer to Query j.\n\nSample Input 1\n\n5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n\nSample Output 1\n\n130\n200\n60\n\nThe graph in this input is as follows:\n\nHere the edges of Color 1 are shown as solid red lines, the edge of Color 2 is shown as a bold green line, and the edge of Color 4 is shown as a blue dashed line.\n\nQuery 1: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 4 is 100 + 30 = 130.\n\nQuery 2: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 5 is 100 + 100 = 200.\n\nQuery 3: Assuming that the length of every edge whose color is 3 is changed to 1000 (there is no such edge), the distance between Vertex 3 and Vertex 4 is 20 + 10 + 30 = 60. Note that the edges of Color 1 now have their original lengths.", "sample_input": "5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n"}, "reference_outputs": ["130\n200\n60\n"], "source_document_id": "p02986", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 to N.\nThe i-th edge in this tree connects Vertex a_i and Vertex b_i, and the color and length of that edge are c_i and d_i, respectively.\nHere the color of each edge is represented by an integer between 1 and N-1 (inclusive). The same integer corresponds to the same color, and different integers correspond to different colors.\n\nAnswer the following Q queries:\n\nQuery j (1 \\leq j \\leq Q): assuming that the length of every edge whose color is x_j is changed to y_j, find the distance between Vertex u_j and Vertex v_j. (The changes of the lengths of edges do not affect the subsequent queries.)\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\n1 \\leq c_i \\leq N-1\n\n1 \\leq d_i \\leq 10^4\n\n1 \\leq x_j \\leq N-1\n\n1 \\leq y_j \\leq 10^4\n\n1 \\leq u_j < v_j \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1 c_1 d_1\n:\na_{N-1} b_{N-1} c_{N-1} d_{N-1}\nx_1 y_1 u_1 v_1\n:\nx_Q y_Q u_Q v_Q\n\nOutput\n\nPrint Q lines. The j-th line (1 \\leq j \\leq Q) should contain the answer to Query j.\n\nSample Input 1\n\n5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n\nSample Output 1\n\n130\n200\n60\n\nThe graph in this input is as follows:\n\nHere the edges of Color 1 are shown as solid red lines, the edge of Color 2 is shown as a bold green line, and the edge of Color 4 is shown as a blue dashed line.\n\nQuery 1: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 4 is 100 + 30 = 130.\n\nQuery 2: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 5 is 100 + 100 = 200.\n\nQuery 3: Assuming that the length of every edge whose color is 3 is changed to 1000 (there is no such edge), the distance between Vertex 3 and Vertex 4 is 20 + 10 + 30 = 60. Note that the edges of Color 1 now have their original lengths.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 18716, "cpu_time_ms": 273, "memory_kb": 68892}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s300897268", "group_id": "codeNet:p02987", "input_text": "import java.util.*;\nimport java.io.*;\n \npublic class Main {\n public static void main(String[] args) throws Exception {\n FastScanner sc = new FastScanner(System.in);\n char[] l = sc.next().toCharArray();\n HashMap map = new HashMap<>();\n for(char c : l){\n map.put(c,map.getOrDefault(c,0)+1);\n }\n if(map.size() != 2){\n System.out.println(\"No\");\n return;\n }\n for(Map.Entry e : map.entrySet()){\n if(e.getValue() != 2){\n System.out.println(\"No\");\n return;\n }\n }\n System.out.println(\"Yes\");\n }\n}\n\nclass FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n \n public void close() throws Exception{\n this.reader.close();\n return;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n } \n}", "language": "Java", "metadata": {"date": 1592532960, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02987.html", "problem_id": "p02987", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02987/input.txt", "sample_output_relpath": "derived/input_output/data/p02987/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02987/Java/s300897268.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s300897268", "user_id": "u578775554"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\n \npublic class Main {\n public static void main(String[] args) throws Exception {\n FastScanner sc = new FastScanner(System.in);\n char[] l = sc.next().toCharArray();\n HashMap map = new HashMap<>();\n for(char c : l){\n map.put(c,map.getOrDefault(c,0)+1);\n }\n if(map.size() != 2){\n System.out.println(\"No\");\n return;\n }\n for(Map.Entry e : map.entrySet()){\n if(e.getValue() != 2){\n System.out.println(\"No\");\n return;\n }\n }\n System.out.println(\"Yes\");\n }\n}\n\nclass FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n \n public void close() throws Exception{\n this.reader.close();\n return;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n } \n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2234, "cpu_time_ms": 79, "memory_kb": 25288}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s938275687", "group_id": "codeNet:p02987", "input_text": "import java.io.*;\nimport java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n String S = scan.next();\n String[] Sarray = new String[S.length()];\n for(int i=0;i list = new ArrayList(); \n for(int i=0;i<4;i++){\n list.add(Sarray[i]);\n }\n Collections.sort(list);\n String[] array = list.toArray(new String[list.size()]);\n if((f==false)&&String.valueOf(array[0]).equals(String.valueOf(array[1]))&&String.valueOf(array[2]).equals(String.valueOf(array[3]))){\n System.out.println(\"Yes\");\n }else{\n System.out.println(\"No\");\n }\n }\n}", "language": "Java", "metadata": {"date": 1583613357, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02987.html", "problem_id": "p02987", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02987/input.txt", "sample_output_relpath": "derived/input_output/data/p02987/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02987/Java/s938275687.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s938275687", "user_id": "u387720785"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n String S = scan.next();\n String[] Sarray = new String[S.length()];\n for(int i=0;i list = new ArrayList(); \n for(int i=0;i<4;i++){\n list.add(Sarray[i]);\n }\n Collections.sort(list);\n String[] array = list.toArray(new String[list.size()]);\n if((f==false)&&String.valueOf(array[0]).equals(String.valueOf(array[1]))&&String.valueOf(array[2]).equals(String.valueOf(array[3]))){\n System.out.println(\"Yes\");\n }else{\n System.out.println(\"No\");\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1119, "cpu_time_ms": 94, "memory_kb": 23636}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s380738868", "group_id": "codeNet:p02987", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n AFiftyFifty solver = new AFiftyFifty();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class AFiftyFifty {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n String s = in.next();\n int[] hash = new int[26];\n int count = 0;\n for (int i = 0; i < s.length(); i++) {\n int c = s.charAt(i) - 'A';\n hash[c]++;\n if (hash[c] == 2)\n count++;\n }\n if (count == 2)\n out.println(\"Yes\");\n else\n out.println(\"No\");\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1563965714, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02987.html", "problem_id": "p02987", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02987/input.txt", "sample_output_relpath": "derived/input_output/data/p02987/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02987/Java/s380738868.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380738868", "user_id": "u588760359"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n AFiftyFifty solver = new AFiftyFifty();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class AFiftyFifty {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n String s = in.next();\n int[] hash = new int[26];\n int count = 0;\n for (int i = 0; i < s.length(); i++) {\n int c = s.charAt(i) - 'A';\n hash[c]++;\n if (hash[c] == 2)\n count++;\n }\n if (count == 2)\n out.println(\"Yes\");\n else\n out.println(\"No\");\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n }\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1923, "cpu_time_ms": 72, "memory_kb": 21460}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s246052124", "group_id": "codeNet:p02988", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args ) throws Exception {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int Nums[]=new int[N];\n int count=0;\n for(int i=0;iNums[i-1]&&Nums[i-1]>Nums[i]){\n count++;\n }\n \t}System.out.println(count);\n }\n}\n\n", "language": "Java", "metadata": {"date": 1567961910, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02988.html", "problem_id": "p02988", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02988/input.txt", "sample_output_relpath": "derived/input_output/data/p02988/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02988/Java/s246052124.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s246052124", "user_id": "u143789605"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args ) throws Exception {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int Nums[]=new int[N];\n int count=0;\n for(int i=0;iNums[i-1]&&Nums[i-1]>Nums[i]){\n count++;\n }\n \t}System.out.println(count);\n }\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "sample_input": "5\n1 3 5 4 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02988", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 474, "cpu_time_ms": 95, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s389049778", "group_id": "codeNet:p02988", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n Integer[] p = new Integer[n];\n for (int i = 0; i < n; i++) {\n p[i] = sc.nextInt();\n }\n sc.close();\n\n int count = 0;\n for (int i = 1; i < n - 1; i++) {\n if (p[i - 1] == p[i + 1]) {\n if (p[i] < p[i + 1]) {\n count++;\n }\n } else if (p[i - 1] < p[i + 1]) {\n if (p[i - 1] <= p[i] && p[i] < p[i + 1]) {\n count++;\n }\n } else if (p[i - 1] > p[i + 1]) {\n if (p[i - 1] > p[i] && p[i] >= p[i + 1]) {\n count++;\n }\n }\n }\n\n System.out.println(count);\n }\n}", "language": "Java", "metadata": {"date": 1561872014, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02988.html", "problem_id": "p02988", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02988/input.txt", "sample_output_relpath": "derived/input_output/data/p02988/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02988/Java/s389049778.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s389049778", "user_id": "u264555121"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n Integer[] p = new Integer[n];\n for (int i = 0; i < n; i++) {\n p[i] = sc.nextInt();\n }\n sc.close();\n\n int count = 0;\n for (int i = 1; i < n - 1; i++) {\n if (p[i - 1] == p[i + 1]) {\n if (p[i] < p[i + 1]) {\n count++;\n }\n } else if (p[i - 1] < p[i + 1]) {\n if (p[i - 1] <= p[i] && p[i] < p[i + 1]) {\n count++;\n }\n } else if (p[i - 1] > p[i + 1]) {\n if (p[i - 1] > p[i] && p[i] >= p[i + 1]) {\n count++;\n }\n }\n }\n\n System.out.println(count);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "sample_input": "5\n1 3 5 4 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02988", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 870, "cpu_time_ms": 96, "memory_kb": 21972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s580085720", "group_id": "codeNet:p02990", "input_text": "import java.math.BigDecimal;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int K = sc.nextInt();\n sc.close();\n\n int blue = K;\n int red = N - K;\n\n BigDecimal div = BigDecimal.valueOf((Math.pow(10, 9) + 7));\n\n Map redCombMap = new HashMap();\n Map blueCombMap = new HashMap();\n\n for (int i = 0; i < blue; i++) {\n // 赤いボールの中に青いボールが入る位置の組み合わせ\n BigDecimal r = BigDecimal.ZERO;\n if (i <= red) {\n if (redCombMap.containsKey(i + 1)) {\n r = redCombMap.get(i + 1);\n } else if (redCombMap.containsKey(red - i)) {\n r = redCombMap.get(red - i);\n } else {\n r = c(red + 1, i + 1);\n redCombMap.put(i + 1, r);\n }\n } else {\n System.out.println(0);\n continue;\n }\n // 青いボールの分け方\n BigDecimal b;\n if (blueCombMap.containsKey(i)) {\n b = blueCombMap.get(i);\n } else if (blueCombMap.containsKey(blue - 1 - i)) {\n b = blueCombMap.get(blue - 1 - i);\n } else {\n b = c(blue - 1, i);\n blueCombMap.put(i, b);\n }\n\n long ans = r.multiply(b).remainder(div).longValue();\n System.out.println(ans);\n }\n\n }\n\n private static BigDecimal factorial(int n) {\n if (n > 0) {\n return BigDecimal.valueOf(n).multiply(factorial(n - 1));\n } else {\n return BigDecimal.ONE;\n }\n }\n\n private static BigDecimal comb(int a, int b) {\n if (a >= b) {\n BigDecimal denominator = factorial(b);\n BigDecimal numerator = BigDecimal.ONE;\n for (int i = a; i > a - b; i--) {\n BigDecimal bi = BigDecimal.valueOf(i);\n numerator = numerator.multiply(bi);\n }\n return numerator.divide(denominator);\n } else {\n return BigDecimal.ONE;\n }\n }\n\n private static BigDecimal c(int a, int b) {\n int c = a - b;\n if (c < b) {\n return comb(a, c);\n } else {\n return comb(a, b);\n }\n }\n}", "language": "Java", "metadata": {"date": 1562473326, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02990.html", "problem_id": "p02990", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02990/input.txt", "sample_output_relpath": "derived/input_output/data/p02990/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02990/Java/s580085720.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s580085720", "user_id": "u264555121"}, "prompt_components": {"gold_output": "3\n6\n1\n", "input_to_evaluate": "import java.math.BigDecimal;\nimport java.util.HashMap;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int K = sc.nextInt();\n sc.close();\n\n int blue = K;\n int red = N - K;\n\n BigDecimal div = BigDecimal.valueOf((Math.pow(10, 9) + 7));\n\n Map redCombMap = new HashMap();\n Map blueCombMap = new HashMap();\n\n for (int i = 0; i < blue; i++) {\n // 赤いボールの中に青いボールが入る位置の組み合わせ\n BigDecimal r = BigDecimal.ZERO;\n if (i <= red) {\n if (redCombMap.containsKey(i + 1)) {\n r = redCombMap.get(i + 1);\n } else if (redCombMap.containsKey(red - i)) {\n r = redCombMap.get(red - i);\n } else {\n r = c(red + 1, i + 1);\n redCombMap.put(i + 1, r);\n }\n } else {\n System.out.println(0);\n continue;\n }\n // 青いボールの分け方\n BigDecimal b;\n if (blueCombMap.containsKey(i)) {\n b = blueCombMap.get(i);\n } else if (blueCombMap.containsKey(blue - 1 - i)) {\n b = blueCombMap.get(blue - 1 - i);\n } else {\n b = c(blue - 1, i);\n blueCombMap.put(i, b);\n }\n\n long ans = r.multiply(b).remainder(div).longValue();\n System.out.println(ans);\n }\n\n }\n\n private static BigDecimal factorial(int n) {\n if (n > 0) {\n return BigDecimal.valueOf(n).multiply(factorial(n - 1));\n } else {\n return BigDecimal.ONE;\n }\n }\n\n private static BigDecimal comb(int a, int b) {\n if (a >= b) {\n BigDecimal denominator = factorial(b);\n BigDecimal numerator = BigDecimal.ONE;\n for (int i = a; i > a - b; i--) {\n BigDecimal bi = BigDecimal.valueOf(i);\n numerator = numerator.multiply(bi);\n }\n return numerator.divide(denominator);\n } else {\n return BigDecimal.ONE;\n }\n }\n\n private static BigDecimal c(int a, int b) {\n int c = a - b;\n if (c < b) {\n return comb(a, c);\n } else {\n return comb(a, b);\n }\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "sample_input": "5 3\n"}, "reference_outputs": ["3\n6\n1\n"], "source_document_id": "p02990", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2581, "cpu_time_ms": 2109, "memory_kb": 251108}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s431969058", "group_id": "codeNet:p02993", "input_text": " import java.util.Scanner;\n \n public class Main{\n public static void main(String[] args){\n \tScanner in=new Scanner(System.in);\n \tint N=in.nextInt();\n int L=in.nextInt();\n int flavour=0;\n for(int i=1;i<=N;i++)\n flavour+=L+i-1;\n// System.out.println(flavour);\n \tint min=Integer.MIN_VALUE;\n for(int i=1;i<=N;i++){\n \tif(flavour-(L+i-1)>min){\n min=flavour-(L+i-1);\n }\n }\n System.out.println(min);\n in.close();\n }\n }", "language": "Java", "metadata": {"date": 1561257034, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02993.html", "problem_id": "p02993", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02993/input.txt", "sample_output_relpath": "derived/input_output/data/p02993/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02993/Java/s431969058.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s431969058", "user_id": "u633090093"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": " import java.util.Scanner;\n \n public class Main{\n public static void main(String[] args){\n \tScanner in=new Scanner(System.in);\n \tint N=in.nextInt();\n int L=in.nextInt();\n int flavour=0;\n for(int i=1;i<=N;i++)\n flavour+=L+i-1;\n// System.out.println(flavour);\n \tint min=Integer.MIN_VALUE;\n for(int i=1;i<=N;i++){\n \tif(flavour-(L+i-1)>min){\n min=flavour-(L+i-1);\n }\n }\n System.out.println(min);\n in.close();\n }\n }", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "sample_input": "3776\n"}, "reference_outputs": ["Bad\n"], "source_document_id": "p02993", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 541, "cpu_time_ms": 98, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s137973649", "group_id": "codeNet:p02993", "input_text": "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String[] $$) throws Exception {\n\t\tScanner $ = new Scanner(System.in);\n\t\tString S = $.next();\n\t\tint Flag = 0;\n\t\tfor (int i = 0; i < S.length() - 1; i++){\n\t\t\tif (S.substring(i, i + 1).equals(S.substring(i + 1, i + 2))){\n\t\t\t\tFlag += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (Flag == 0) System.out.println(\"Good\");\n\t\telse System.out.println(\"Bad\");\n\t\t/*\n\t\t3776 -> Bad\n\t\t8080 -> Good\n\t\t1333 -> Bad\n\t\t0024 -> Bad\n\t\t*/\n\t}\n}\n", "language": "Java", "metadata": {"date": 1561251990, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02993.html", "problem_id": "p02993", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02993/input.txt", "sample_output_relpath": "derived/input_output/data/p02993/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02993/Java/s137973649.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s137973649", "user_id": "u937566829"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String[] $$) throws Exception {\n\t\tScanner $ = new Scanner(System.in);\n\t\tString S = $.next();\n\t\tint Flag = 0;\n\t\tfor (int i = 0; i < S.length() - 1; i++){\n\t\t\tif (S.substring(i, i + 1).equals(S.substring(i + 1, i + 2))){\n\t\t\t\tFlag += 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (Flag == 0) System.out.println(\"Good\");\n\t\telse System.out.println(\"Bad\");\n\t\t/*\n\t\t3776 -> Bad\n\t\t8080 -> Good\n\t\t1333 -> Bad\n\t\t0024 -> Bad\n\t\t*/\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "sample_input": "3776\n"}, "reference_outputs": ["Bad\n"], "source_document_id": "p02993", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 469, "cpu_time_ms": 91, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s399170171", "group_id": "codeNet:p02996", "input_text": "import java.util.*;\nimport java.io.*;\n\nclass Task implements Comparable{\n int amount;\n int deadline;\n public Task(int a, int d){\n this.amount=a;\n this.deadline=d;\n }\n public int compareTo(Task another){\n return this.deadline-another.deadline;\n }\n public String toString(){\n return \"[\"+amount+\" \"+deadline+\"]\";\n }\n}\npublic class Main {\n static void possible(){\n System.out.println(\"Yes\");\n System.exit(0);\n }\n static void impossible(){\n System.out.println(\"No\");\n System.exit(0);\n }\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n Task[] task = new Task[N];\n for(int n=0; ntask[n].deadline) impossible();\n }\n possible();\n }\n}", "language": "Java", "metadata": {"date": 1561231449, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02996.html", "problem_id": "p02996", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02996/input.txt", "sample_output_relpath": "derived/input_output/data/p02996/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02996/Java/s399170171.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s399170171", "user_id": "u997055883"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\n\nclass Task implements Comparable{\n int amount;\n int deadline;\n public Task(int a, int d){\n this.amount=a;\n this.deadline=d;\n }\n public int compareTo(Task another){\n return this.deadline-another.deadline;\n }\n public String toString(){\n return \"[\"+amount+\" \"+deadline+\"]\";\n }\n}\npublic class Main {\n static void possible(){\n System.out.println(\"Yes\");\n System.exit(0);\n }\n static void impossible(){\n System.out.println(\"No\");\n System.exit(0);\n }\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n Task[] task = new Task[N];\n for(int n=0; ntask[n].deadline) impossible();\n }\n possible();\n }\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "sample_input": "5\n2 4\n1 9\n1 8\n4 9\n3 12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02996", "source_text": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1054, "cpu_time_ms": 970, "memory_kb": 105276}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s649974295", "group_id": "codeNet:p02999", "input_text": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main {\n\n private static PrintWriter out;\n\n private static void mprintln(T ... ar){\n for(T i: ar) out.print(i + \" \");\n out.println();\n }\n\n public static void main(String[] args) throws FileNotFoundException{\n\n // Input from file\n // File inputFile = new File(\"JavaFile.txt\");\n // File outputFile = new File(\"JavaOutputFile.txt\");\n // FileReader fileReader = new FileReader(inputFile);\n // Here it ends\n\n MyScanner sc = new MyScanner();\n // MyScanner sc = new MyScanner(fileReader);\n\n out = new PrintWriter(new BufferedOutputStream(System.out)); // Output to console\n // out = new PrintWriter(new PrintStream(outputFile)); // Output to file\n\n getAns(sc);\n\n out.close();\n }\n\n /*\n *Don't use builtin function (Math.ceil)\n */\n private static void getAns(MyScanner sc){\n int x = sc.ni(), a = sc.ni();\n out.println(x < a? 0: 10);\n }\n\n static class MyScanner{\n BufferedReader br;\n StringTokenizer st;\n\n MyScanner(FileReader fileReader){\n br = new BufferedReader(fileReader);\n }\n\n MyScanner(){\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String nn(){\n while(st == null || !st.hasMoreElements()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch(IOException e){\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n String nextLine(){\n String ans = \"\";\n try {\n ans = br.readLine();\n } catch (IOException ex) {\n ex.printStackTrace();\n }\n return ans;\n }\n\n char nc(){\n return nn().charAt(0);\n }\n\n int ni(){\n return Integer.parseInt(nn());\n }\n\n long nl(){\n return Long.parseLong(nn());\n }\n\n double nd(){\n return Double.parseDouble(nn());\n }\n\n int[] niArr0(int n){\n int[] ar = new int[n];\n for(int i = 0; i < n; i++) ar[i] = ni();\n return ar;\n }\n\n int[] niArr1(int n){\n int[] ar = new int[n + 1];\n for(int i = 1; i <= n; i++) ar[i] = ni();\n return ar;\n }\n\n long[] nlArr0(int n){\n long[] ar = new long[n];\n for(int i = 0; i < n; i++) ar[i] = nl();\n return ar;\n }\n\n long[] nlArr1(int n){\n long[] ar = new long[n + 1];\n for(int i = 1; i <= n; i++) ar[i] = nl();\n return ar;\n }\n }\n}", "language": "Java", "metadata": {"date": 1561763366, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p02999.html", "problem_id": "p02999", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02999/input.txt", "sample_output_relpath": "derived/input_output/data/p02999/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02999/Java/s649974295.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s649974295", "user_id": "u420105436"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "import java.io.*;\nimport java.math.BigInteger;\nimport java.util.*;\n\npublic class Main {\n\n private static PrintWriter out;\n\n private static void mprintln(T ... ar){\n for(T i: ar) out.print(i + \" \");\n out.println();\n }\n\n public static void main(String[] args) throws FileNotFoundException{\n\n // Input from file\n // File inputFile = new File(\"JavaFile.txt\");\n // File outputFile = new File(\"JavaOutputFile.txt\");\n // FileReader fileReader = new FileReader(inputFile);\n // Here it ends\n\n MyScanner sc = new MyScanner();\n // MyScanner sc = new MyScanner(fileReader);\n\n out = new PrintWriter(new BufferedOutputStream(System.out)); // Output to console\n // out = new PrintWriter(new PrintStream(outputFile)); // Output to file\n\n getAns(sc);\n\n out.close();\n }\n\n /*\n *Don't use builtin function (Math.ceil)\n */\n private static void getAns(MyScanner sc){\n int x = sc.ni(), a = sc.ni();\n out.println(x < a? 0: 10);\n }\n\n static class MyScanner{\n BufferedReader br;\n StringTokenizer st;\n\n MyScanner(FileReader fileReader){\n br = new BufferedReader(fileReader);\n }\n\n MyScanner(){\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n String nn(){\n while(st == null || !st.hasMoreElements()){\n try{\n st = new StringTokenizer(br.readLine());\n }catch(IOException e){\n e.printStackTrace();\n }\n }\n return st.nextToken();\n }\n\n String nextLine(){\n String ans = \"\";\n try {\n ans = br.readLine();\n } catch (IOException ex) {\n ex.printStackTrace();\n }\n return ans;\n }\n\n char nc(){\n return nn().charAt(0);\n }\n\n int ni(){\n return Integer.parseInt(nn());\n }\n\n long nl(){\n return Long.parseLong(nn());\n }\n\n double nd(){\n return Double.parseDouble(nn());\n }\n\n int[] niArr0(int n){\n int[] ar = new int[n];\n for(int i = 0; i < n; i++) ar[i] = ni();\n return ar;\n }\n\n int[] niArr1(int n){\n int[] ar = new int[n + 1];\n for(int i = 1; i <= n; i++) ar[i] = ni();\n return ar;\n }\n\n long[] nlArr0(int n){\n long[] ar = new long[n];\n for(int i = 0; i < n; i++) ar[i] = nl();\n return ar;\n }\n\n long[] nlArr1(int n){\n long[] ar = new long[n + 1];\n for(int i = 1; i <= n; i++) ar[i] = nl();\n return ar;\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "sample_input": "3 5\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02999", "source_text": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2803, "cpu_time_ms": 72, "memory_kb": 21332}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s642510110", "group_id": "codeNet:p03000", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String args[]) {\n\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int X = sc.nextInt();\n int[] list = new int[N];\n int pos =0; \n list[0] = 0; \n for (int i = 0; i < list.length; i++) {\n list[i] = sc.nextInt();\n }\n int ptr=0;\n while( pos <= X) {\n pos += list[ptr];\n ptr++;\n// System.out.println(\"pos:\"+pos+\" ptr: \"+ptr);\n }\n System.out.println(ptr);\n }\n}", "language": "Java", "metadata": {"date": 1565809825, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03000.html", "problem_id": "p03000", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03000/input.txt", "sample_output_relpath": "derived/input_output/data/p03000/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03000/Java/s642510110.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s642510110", "user_id": "u960916204"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String args[]) {\n\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int X = sc.nextInt();\n int[] list = new int[N];\n int pos =0; \n list[0] = 0; \n for (int i = 0; i < list.length; i++) {\n list[i] = sc.nextInt();\n }\n int ptr=0;\n while( pos <= X) {\n pos += list[ptr];\n ptr++;\n// System.out.println(\"pos:\"+pos+\" ptr: \"+ptr);\n }\n System.out.println(ptr);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "sample_input": "3 6\n3 4 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03000", "source_text": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 573, "cpu_time_ms": 109, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s565620643", "group_id": "codeNet:p03000", "input_text": "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int X = sc.nextInt();\n int[]L = new int[N];\n //跳ねる回数はN+1(1回目は0なのでLの入力自体はN個分のみ)\n for(int i = 0; i < N; i++){\n L[i] = sc.nextInt();\n }\n int i = 0; //座標用\n int j = 0; //跳ねた回数カウント用\n int a = 0; //配列を回す用\n while(i <= X){\n i = i + L[a];\n j++;\n a++;\n }\n System.out.println(j);\n }\n}", "language": "Java", "metadata": {"date": 1561104700, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03000.html", "problem_id": "p03000", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03000/input.txt", "sample_output_relpath": "derived/input_output/data/p03000/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03000/Java/s565620643.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s565620643", "user_id": "u224040141"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int X = sc.nextInt();\n int[]L = new int[N];\n //跳ねる回数はN+1(1回目は0なのでLの入力自体はN個分のみ)\n for(int i = 0; i < N; i++){\n L[i] = sc.nextInt();\n }\n int i = 0; //座標用\n int j = 0; //跳ねた回数カウント用\n int a = 0; //配列を回す用\n while(i <= X){\n i = i + L[a];\n j++;\n a++;\n }\n System.out.println(j);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "sample_input": "3 6\n3 4 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03000", "source_text": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 630, "cpu_time_ms": 109, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s109846902", "group_id": "codeNet:p03001", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.AbstractMap;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.NoSuchElementException;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\t\n\t\tfor(int i=0;i<1;i++) {\n\t\t\t\n\t\t\tslover();\n\t\t\tout.flush();\n\t\t}\n\t}\n\tstatic FastScanner sc = new FastScanner();\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\t\n\n\t\t\n\n\n\n\t\tprivate static class D{\n\t\t\n\t\t\tArrayList X=new ArrayList();\n\t\t\tArrayList Y=new ArrayList();\n\t\t\tint t=0;\n\t\t\tint index=0;\n\t\t\tD(ArrayList X,ArrayList Y,int t,int index){\n\t\t\t\tthis.X=X;;\n\t\t\t\tthis.Y=Y;\n\t\t\t\tthis.t=t;\n\t\t\t\tthis.index=index;\n\t\t\t}\n\n\t\t}\n\n\n\n\t//Set a=new HashSet();\n\t\n\t\n\t\n\t//Integer.toBinaryString(i);\n\t//Integer.toString(i, 2);\n//\t//Integer.parseInt(bin, 2);\n\t//bitset\n\t\t//StringBuffer S = new StringBuffer(sc.next());\n\t\t\t\t//String hoge2 = str.reverse().toString();\n\t\t\t\t//map.containsKey(A)\n\t\t\t\t//Map map = new HashMap(N);\n\t\t\t\t/*for ( キーのデータ型 key : マップの名前.keySet() ) {\n\t\t\t\t\tデータのデータ型 data = マップの名前.get( key );\n\n\t\t\t\t\t// keyやdataを使った処理;\n\t\t\t\t}*/\n\t\t\t\t//int i = Integer.parseInt(s);\n\t\t\t\t//Queue qq=new ArrayDeque<>(); //add,poll,peek BFSは前から実行される\n\t\t\t\t//Deque dd=new ArrayDeque<>();//push後ろに入れる,poll(pop)後ろからとる,peek addは先頭に入るからバグ注意\n\t\t\t\t//stackdfsは後ろから実行される\n\t\t\t\t//ArrayList cc = new ArrayList<>(N);\n\t\t\t\t//cc.contains(tmp)\n\t\t\t\t//Arrays.asList(c).contains(\"a\")\n\t\t\t\t//list.set(1,\"walk\");//1 1 2 3 5\n\t\t\t\t//PriorityQueue r=new PriorityQueue();//add poll\n\t\t\n\t\tpublic static class Pair extends AbstractMap.SimpleEntry implements Comparable> {\n\t\t\t/** serialVersionUID. */\n\t\t private static final long serialVersionUID = 6411527075103472113L;\n\t \n\t\t public Pair(final K key, final V value) {\n\t\t super(key, value);\n\t\t }\n\t \n\t\t\t@Override\n\t\t\tpublic int compareTo(Pair o) {\n\t \n\t\t\t\tComparable key = (Comparable)this.getKey();\n\t\t\t\tComparable key2 = (Comparable)o.getKey();\n\t \n\t\t\t\treturn key.compareTo(key2);\n\t\t\t}\n\t \n\t\t}\n\t \n\t\t// 文字列として入力を取得\n\t\t\n\t\t\n\t\t\n\t\t\n\tprivate static long mod=1000000009;\n\tprivate static int INF =999999999;\n\tprivate static long LINF=4000000000000000000L;\n\t\n\tprivate static long ncr(long n,long r) {\n\t\tlong res=1;\n\t\t\n\t\tfor(int i=0;i=0&&Queue[(index-1)/2]>value) {\n\t\t\t\tQueue[index]=Queue[(index-1)/2];\n\t\t\t\tpriority_queue_add(Queue,(index-1)/2,value);\n\t\t\t\t\n\t\t\t}\n\t\t\tif((index-2)/2>=0&&Queue[(index-2)/2]>value) {\n\t\t\t\tQueue[index]=Queue[(index-2)/2];\n\t\t\t\tpriority_queue_add(Queue,(index-2)/2,value);\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t}\nprivate static int priority_queue_getFirst(int[] Queue) {\n\t\tint res=Queue[0];\n\t\tQueue[0]=Queue[Queue.length-1];\n\t\tQueue[Queue.length-1]=INF;\n\t\t//System.out.println(Arrays.toString(Queue));\n\t\t//大きさのチェック\n\t\tQ_shape(Queue,0);\n\t\t\n\t\treturn res;\n\t}\n\tprivate static void Q_shape(int[] Queue,int index) {\n\t\t\t\n\t\t\t\n\t\t\n\t\t\tif(index*2+1>1;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tpublic static long gcd(long num1,long num2) {\n if(num2==0) return num1;\n else return gcd(num2,num1%num2);\n }\n\tpublic static long lcm(long num1,long num2) {\n\t\treturn num1*num2/gcd(num1,num2);\n\t}\n\t//O(N^0.5)\n\tprivate static boolean isPrime(long t) {\n\t\tif(t<2)return false;\n\t\tfor(int i=2;i*i<=t;i++) {\n\t\t\tif(t%i==0)return false;\n\t\t}\n\t\treturn true;\n\t}\n\tprivate static ArrayList Divisors(long t) {\n\t\tArrayList c=new ArrayList();\n\t\t\n\t\tfor(long i=1;i*i<=t;i++) {\n\t\t\tif(t%i==0) {\n\t\t\t\t\n\t\t\t\tif(i*i!=t) {\n\t\t\t\t\tc.add(t/i);\n\t\t\t\t}\n\t\t\t\tc.add((long)i);\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n\tprivate static ArrayList Sorted_Divisors(long t) {\n\t\tArrayList c=new ArrayList();\n\t\tfor(long i=2;i*i<=t;i++) {\n\t\t\t\n\t\t\t\n\t\t\tif(t%i==0) {\n\t\t\t\tp(t+\" \"+i);\n\t\t\t\tc.add((long)i);\n\t\t\t\tt/=i;\n\t\t\t\ti--;\n\t\t\t}\n\t\t}\n\t\tif(t!=1)c.add(t);\n\t\tCollections.sort(c);\n\t\t\n\t\treturn c;\n\t}\n\tprivate static void bubunwa() {\n\t\tint N=sc.nextInt();\n\t\tint K=sc.nextInt();\n\t\tint a[]=sc.nextIntArray(N, false);\n\n\t\tboolean dp[] =new boolean[K+1];\n\n\t\tArrays.fill(dp, false);\n\t\tdp[0]=true;\n\t\tfor(int i=0;i=0;x--) {\n\t\t\t\tif(dp[x])dp[x+a[i]]=true;\n\t\t\t}\n\t\t}\n\n\t\tp(dp[K] ? \"Yes\":\"No\");\n\t}\n\t\n\tprivate static String bitToString(int i) {\n\t\treturn Integer.toBinaryString(i);\n\t}\n/*********************************************************************/\n\t//target以下までの値のindexを返す\n\t//target以上が欲しいときは返り値+1すればいい\n\t//0-indexで個数を求めるときはさらにindex+1する必要あり\n\tprivate static int lower_bound(long a[],long target) {\n\t//p(target+ \" \"+Arrays.toString(a));\n\tif(a[0]>target)return -1;\n\t//最後の値がtarget以下であるときは最後のindexを返す。\n\t//target以上が欲しいときは注意する必要あり\n\tif(a[a.length-1]<=target) return a.length-1;\n\n\tint S=-1;\n\tint E=a.length;\n\n\twhile(Starget) {\n\t\t\treturn G;\n\n\t\t}else if(a[G]<=target){\n\t\t\tS=G;\n\t\t}else if(a[G]>target) {\n\t\t\tE=G;\n\t\t}\n\n\t}\n\n\n\treturn -1;\n\t}\n\tstatic String nextPermutation(String s) {\n\t\tArrayList list=new ArrayList();\n\t\tfor(int i=0;i=0;i--) {\n\t\t\tif(list.get(i)=L;i--) {\n\t\t\tif(pivot X=new ArrayList();\n\t\t\tArrayList Y=new ArrayList();\n\t\t\tint t=0;\n\t\t\tint index=0;\n\t\t\tD(ArrayList X,ArrayList Y,int t,int index){\n\t\t\t\tthis.X=X;;\n\t\t\t\tthis.Y=Y;\n\t\t\t\tthis.t=t;\n\t\t\t\tthis.index=index;\n\t\t\t}\n\n\t\t}\n\n\n\n\t//Set a=new HashSet();\n\t\n\t\n\t\n\t//Integer.toBinaryString(i);\n\t//Integer.toString(i, 2);\n//\t//Integer.parseInt(bin, 2);\n\t//bitset\n\t\t//StringBuffer S = new StringBuffer(sc.next());\n\t\t\t\t//String hoge2 = str.reverse().toString();\n\t\t\t\t//map.containsKey(A)\n\t\t\t\t//Map map = new HashMap(N);\n\t\t\t\t/*for ( キーのデータ型 key : マップの名前.keySet() ) {\n\t\t\t\t\tデータのデータ型 data = マップの名前.get( key );\n\n\t\t\t\t\t// keyやdataを使った処理;\n\t\t\t\t}*/\n\t\t\t\t//int i = Integer.parseInt(s);\n\t\t\t\t//Queue qq=new ArrayDeque<>(); //add,poll,peek BFSは前から実行される\n\t\t\t\t//Deque dd=new ArrayDeque<>();//push後ろに入れる,poll(pop)後ろからとる,peek addは先頭に入るからバグ注意\n\t\t\t\t//stackdfsは後ろから実行される\n\t\t\t\t//ArrayList cc = new ArrayList<>(N);\n\t\t\t\t//cc.contains(tmp)\n\t\t\t\t//Arrays.asList(c).contains(\"a\")\n\t\t\t\t//list.set(1,\"walk\");//1 1 2 3 5\n\t\t\t\t//PriorityQueue r=new PriorityQueue();//add poll\n\t\t\n\t\tpublic static class Pair extends AbstractMap.SimpleEntry implements Comparable> {\n\t\t\t/** serialVersionUID. */\n\t\t private static final long serialVersionUID = 6411527075103472113L;\n\t \n\t\t public Pair(final K key, final V value) {\n\t\t super(key, value);\n\t\t }\n\t \n\t\t\t@Override\n\t\t\tpublic int compareTo(Pair o) {\n\t \n\t\t\t\tComparable key = (Comparable)this.getKey();\n\t\t\t\tComparable key2 = (Comparable)o.getKey();\n\t \n\t\t\t\treturn key.compareTo(key2);\n\t\t\t}\n\t \n\t\t}\n\t \n\t\t// 文字列として入力を取得\n\t\t\n\t\t\n\t\t\n\t\t\n\tprivate static long mod=1000000009;\n\tprivate static int INF =999999999;\n\tprivate static long LINF=4000000000000000000L;\n\t\n\tprivate static long ncr(long n,long r) {\n\t\tlong res=1;\n\t\t\n\t\tfor(int i=0;i=0&&Queue[(index-1)/2]>value) {\n\t\t\t\tQueue[index]=Queue[(index-1)/2];\n\t\t\t\tpriority_queue_add(Queue,(index-1)/2,value);\n\t\t\t\t\n\t\t\t}\n\t\t\tif((index-2)/2>=0&&Queue[(index-2)/2]>value) {\n\t\t\t\tQueue[index]=Queue[(index-2)/2];\n\t\t\t\tpriority_queue_add(Queue,(index-2)/2,value);\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t}\nprivate static int priority_queue_getFirst(int[] Queue) {\n\t\tint res=Queue[0];\n\t\tQueue[0]=Queue[Queue.length-1];\n\t\tQueue[Queue.length-1]=INF;\n\t\t//System.out.println(Arrays.toString(Queue));\n\t\t//大きさのチェック\n\t\tQ_shape(Queue,0);\n\t\t\n\t\treturn res;\n\t}\n\tprivate static void Q_shape(int[] Queue,int index) {\n\t\t\t\n\t\t\t\n\t\t\n\t\t\tif(index*2+1>1;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tpublic static long gcd(long num1,long num2) {\n if(num2==0) return num1;\n else return gcd(num2,num1%num2);\n }\n\tpublic static long lcm(long num1,long num2) {\n\t\treturn num1*num2/gcd(num1,num2);\n\t}\n\t//O(N^0.5)\n\tprivate static boolean isPrime(long t) {\n\t\tif(t<2)return false;\n\t\tfor(int i=2;i*i<=t;i++) {\n\t\t\tif(t%i==0)return false;\n\t\t}\n\t\treturn true;\n\t}\n\tprivate static ArrayList Divisors(long t) {\n\t\tArrayList c=new ArrayList();\n\t\t\n\t\tfor(long i=1;i*i<=t;i++) {\n\t\t\tif(t%i==0) {\n\t\t\t\t\n\t\t\t\tif(i*i!=t) {\n\t\t\t\t\tc.add(t/i);\n\t\t\t\t}\n\t\t\t\tc.add((long)i);\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n\tprivate static ArrayList Sorted_Divisors(long t) {\n\t\tArrayList c=new ArrayList();\n\t\tfor(long i=2;i*i<=t;i++) {\n\t\t\t\n\t\t\t\n\t\t\tif(t%i==0) {\n\t\t\t\tp(t+\" \"+i);\n\t\t\t\tc.add((long)i);\n\t\t\t\tt/=i;\n\t\t\t\ti--;\n\t\t\t}\n\t\t}\n\t\tif(t!=1)c.add(t);\n\t\tCollections.sort(c);\n\t\t\n\t\treturn c;\n\t}\n\tprivate static void bubunwa() {\n\t\tint N=sc.nextInt();\n\t\tint K=sc.nextInt();\n\t\tint a[]=sc.nextIntArray(N, false);\n\n\t\tboolean dp[] =new boolean[K+1];\n\n\t\tArrays.fill(dp, false);\n\t\tdp[0]=true;\n\t\tfor(int i=0;i=0;x--) {\n\t\t\t\tif(dp[x])dp[x+a[i]]=true;\n\t\t\t}\n\t\t}\n\n\t\tp(dp[K] ? \"Yes\":\"No\");\n\t}\n\t\n\tprivate static String bitToString(int i) {\n\t\treturn Integer.toBinaryString(i);\n\t}\n/*********************************************************************/\n\t//target以下までの値のindexを返す\n\t//target以上が欲しいときは返り値+1すればいい\n\t//0-indexで個数を求めるときはさらにindex+1する必要あり\n\tprivate static int lower_bound(long a[],long target) {\n\t//p(target+ \" \"+Arrays.toString(a));\n\tif(a[0]>target)return -1;\n\t//最後の値がtarget以下であるときは最後のindexを返す。\n\t//target以上が欲しいときは注意する必要あり\n\tif(a[a.length-1]<=target) return a.length-1;\n\n\tint S=-1;\n\tint E=a.length;\n\n\twhile(Starget) {\n\t\t\treturn G;\n\n\t\t}else if(a[G]<=target){\n\t\t\tS=G;\n\t\t}else if(a[G]>target) {\n\t\t\tE=G;\n\t\t}\n\n\t}\n\n\n\treturn -1;\n\t}\n\tstatic String nextPermutation(String s) {\n\t\tArrayList list=new ArrayList();\n\t\tfor(int i=0;i=0;i--) {\n\t\t\tif(list.get(i)=L;i--) {\n\t\t\tif(pivot extends AbstractMap.SimpleEntry {\n\n public Pair(K key, V value) {\n super(key, value);\n }\n\n public Pair swap() {\n \treturn new Pair(getValue(), getKey());\n }\n }\n\nclass FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n}", "language": "Java", "metadata": {"date": 1560715353, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03001.html", "problem_id": "p03001", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03001/input.txt", "sample_output_relpath": "derived/input_output/data/p03001/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03001/Java/s535730862.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s535730862", "user_id": "u707045664"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tsolve(sc,out);\n\n\t\tout.flush();\n\t}\n\n\tpublic static void solve(FastScanner sc, PrintWriter out) {\n\t\tdouble w = sc.nextDouble();\n\t\tdouble h = sc.nextDouble();\n\t\tdouble x = sc.nextDouble();\n\t\tdouble y = sc.nextDouble();\n\t\t\n\t\tdouble a = 0;\n\t\tdouble b = 0;\n\t\t\n\t\ta = Math.min((h - y) * w, y * w);\n\t\tb = Math.min((w - x) * h, x * h);\n\t\t\n\t\tout.println(new BigDecimal(Math.max(a, b)).toPlainString()+\" \"+ (a == b ? 1 : 0));\n\t}\n\n\tpublic static long gcd(long a, long b) {\n\t\tif(a < b) return gcd(b, a);\n\t\tif(b == 0) return a;\n\t\treturn gcd(b, a % b);\n\t}\n\n\tpublic static long lcm(long a, long b) {\n\t\treturn a / gcd(a, b) * b;\n\t}\n}\n\nclass Pair extends AbstractMap.SimpleEntry {\n\n public Pair(K key, V value) {\n super(key, value);\n }\n\n public Pair swap() {\n \treturn new Pair(getValue(), getKey());\n }\n }\n\nclass FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "sample_input": "2 3 1 2\n"}, "reference_outputs": ["3.000000 0\n"], "source_document_id": "p03001", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2504, "cpu_time_ms": 76, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s955159713", "group_id": "codeNet:p03005", "input_text": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner scn = new Scanner(System.in);\n\t\tint n = scn.nextInt();\n \tint k = scn.nextInt();\n \tint ans = n-k;\n \tif(k==1) ans = 0;\n \tSystem.out.println(ans);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1598360258, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03005.html", "problem_id": "p03005", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03005/input.txt", "sample_output_relpath": "derived/input_output/data/p03005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03005/Java/s955159713.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s955159713", "user_id": "u659156129"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner scn = new Scanner(System.in);\n\t\tint n = scn.nextInt();\n \tint k = scn.nextInt();\n \tint ans = n-k;\n \tif(k==1) ans = 0;\n \tSystem.out.println(ans);\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is distributing N balls to K persons.\n\nIf each person has to receive at least one ball, what is the maximum possible difference in the number of balls received between the person with the most balls and the person with the fewest balls?\n\nConstraints\n\n1 \\leq K \\leq N \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the maximum possible difference in the number of balls received.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n1\n\nThe only way to distribute three balls to two persons so that each of them receives at least one ball is to give one ball to one person and give two balls to the other person.\n\nThus, the maximum possible difference in the number of balls received is 1.\n\nSample Input 2\n\n3 1\n\nSample Output 2\n\n0\n\nWe have no choice but to give three balls to the only person, in which case the difference in the number of balls received is 0.\n\nSample Input 3\n\n8 5\n\nSample Output 3\n\n3\n\nFor example, if we give 1, 4, 1, 1, 1 balls to the five persons, the number of balls received between the person with the most balls and the person with the fewest balls would be 3, which is the maximum result.", "sample_input": "3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03005", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is distributing N balls to K persons.\n\nIf each person has to receive at least one ball, what is the maximum possible difference in the number of balls received between the person with the most balls and the person with the fewest balls?\n\nConstraints\n\n1 \\leq K \\leq N \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the maximum possible difference in the number of balls received.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n1\n\nThe only way to distribute three balls to two persons so that each of them receives at least one ball is to give one ball to one person and give two balls to the other person.\n\nThus, the maximum possible difference in the number of balls received is 1.\n\nSample Input 2\n\n3 1\n\nSample Output 2\n\n0\n\nWe have no choice but to give three balls to the only person, in which case the difference in the number of balls received is 0.\n\nSample Input 3\n\n8 5\n\nSample Output 3\n\n3\n\nFor example, if we give 1, 4, 1, 1, 1 balls to the five persons, the number of balls received between the person with the most balls and the person with the fewest balls would be 3, which is the maximum result.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 278, "cpu_time_ms": 117, "memory_kb": 35700}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s508827869", "group_id": "codeNet:p03005", "input_text": "import java.util.*;\n \npublic class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n int k = sc.nextInt();\n if(k == 1){\n \tSystem.out.println(0);\n }else{\n \tSystem.out.println(n - k);\n }\n\t}\n}", "language": "Java", "metadata": {"date": 1598014216, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03005.html", "problem_id": "p03005", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03005/input.txt", "sample_output_relpath": "derived/input_output/data/p03005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03005/Java/s508827869.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s508827869", "user_id": "u811622556"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n \npublic class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n int k = sc.nextInt();\n if(k == 1){\n \tSystem.out.println(0);\n }else{\n \tSystem.out.println(n - k);\n }\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is distributing N balls to K persons.\n\nIf each person has to receive at least one ball, what is the maximum possible difference in the number of balls received between the person with the most balls and the person with the fewest balls?\n\nConstraints\n\n1 \\leq K \\leq N \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the maximum possible difference in the number of balls received.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n1\n\nThe only way to distribute three balls to two persons so that each of them receives at least one ball is to give one ball to one person and give two balls to the other person.\n\nThus, the maximum possible difference in the number of balls received is 1.\n\nSample Input 2\n\n3 1\n\nSample Output 2\n\n0\n\nWe have no choice but to give three balls to the only person, in which case the difference in the number of balls received is 0.\n\nSample Input 3\n\n8 5\n\nSample Output 3\n\n3\n\nFor example, if we give 1, 4, 1, 1, 1 balls to the five persons, the number of balls received between the person with the most balls and the person with the fewest balls would be 3, which is the maximum result.", "sample_input": "3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03005", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is distributing N balls to K persons.\n\nIf each person has to receive at least one ball, what is the maximum possible difference in the number of balls received between the person with the most balls and the person with the fewest balls?\n\nConstraints\n\n1 \\leq K \\leq N \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the maximum possible difference in the number of balls received.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n1\n\nThe only way to distribute three balls to two persons so that each of them receives at least one ball is to give one ball to one person and give two balls to the other person.\n\nThus, the maximum possible difference in the number of balls received is 1.\n\nSample Input 2\n\n3 1\n\nSample Output 2\n\n0\n\nWe have no choice but to give three balls to the only person, in which case the difference in the number of balls received is 0.\n\nSample Input 3\n\n8 5\n\nSample Output 3\n\n3\n\nFor example, if we give 1, 4, 1, 1, 1 balls to the five persons, the number of balls received between the person with the most balls and the person with the fewest balls would be 3, which is the maximum result.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 310, "cpu_time_ms": 122, "memory_kb": 35688}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s500254717", "group_id": "codeNet:p03005", "input_text": "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[]args){\n Scanner sc = new Scanner(System.in);\n \n int n = sc.nextInt();\n int k = sc.nextInt();\n int r = 0;\n \n if(1<=k && k<=n && n<=100){\n r = (n%k);\n System.out.println(r);\n }\n }\n}", "language": "Java", "metadata": {"date": 1560647430, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03005.html", "problem_id": "p03005", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03005/input.txt", "sample_output_relpath": "derived/input_output/data/p03005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03005/Java/s500254717.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s500254717", "user_id": "u865793058"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main{\n public static void main(String[]args){\n Scanner sc = new Scanner(System.in);\n \n int n = sc.nextInt();\n int k = sc.nextInt();\n int r = 0;\n \n if(1<=k && k<=n && n<=100){\n r = (n%k);\n System.out.println(r);\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is distributing N balls to K persons.\n\nIf each person has to receive at least one ball, what is the maximum possible difference in the number of balls received between the person with the most balls and the person with the fewest balls?\n\nConstraints\n\n1 \\leq K \\leq N \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the maximum possible difference in the number of balls received.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n1\n\nThe only way to distribute three balls to two persons so that each of them receives at least one ball is to give one ball to one person and give two balls to the other person.\n\nThus, the maximum possible difference in the number of balls received is 1.\n\nSample Input 2\n\n3 1\n\nSample Output 2\n\n0\n\nWe have no choice but to give three balls to the only person, in which case the difference in the number of balls received is 0.\n\nSample Input 3\n\n8 5\n\nSample Output 3\n\n3\n\nFor example, if we give 1, 4, 1, 1, 1 balls to the five persons, the number of balls received between the person with the most balls and the person with the fewest balls would be 3, which is the maximum result.", "sample_input": "3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03005", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is distributing N balls to K persons.\n\nIf each person has to receive at least one ball, what is the maximum possible difference in the number of balls received between the person with the most balls and the person with the fewest balls?\n\nConstraints\n\n1 \\leq K \\leq N \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the maximum possible difference in the number of balls received.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n1\n\nThe only way to distribute three balls to two persons so that each of them receives at least one ball is to give one ball to one person and give two balls to the other person.\n\nThus, the maximum possible difference in the number of balls received is 1.\n\nSample Input 2\n\n3 1\n\nSample Output 2\n\n0\n\nWe have no choice but to give three balls to the only person, in which case the difference in the number of balls received is 0.\n\nSample Input 3\n\n8 5\n\nSample Output 3\n\n3\n\nFor example, if we give 1, 4, 1, 1, 1 balls to the five persons, the number of balls received between the person with the most balls and the person with the fewest balls would be 3, which is the maximum result.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 294, "cpu_time_ms": 113, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s764508940", "group_id": "codeNet:p03007", "input_text": "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tInteger[] A = new Integer[N];\n\t\tint sum=0;\n\t\tint all_plus=0;\n\t\tint all_minus=0;\n\t\tfor (int i=0;i plus = new ArrayDeque();\n\t\tQueue minus = new ArrayDeque();\n\t\tList list = new LinkedList();\n\t\tfor (int i=0;i0) {\n\t\t\t\tplus.add(A[i]);\n\t\t\t\tall_plus=1;\n\t\t\t} else {\n\t\t\t\tlist.add(A[i]);\n\t\t\t\tall_minus=1;\n\t\t\t}\n\t\t}\n\t\tCollections.reverse(list);\n\t\tList list_2 = new ArrayList(list);\n\t\tfor (int i=0;i1) {\n\t\t\tint tmp=plus.remove();\n\t\t\tint tmp_2=minus.remove();\n\t\t\tSystem.out.print(tmp_2);\n\t\t\tSystem.out.print(\" \");\n\t\t\tSystem.out.println(tmp);\n\t\t\tminus.add(tmp_2-tmp);\n\t\t}\n\n\t\twhile (!minus.isEmpty()) {\n\t\t\tint tmp=plus.remove();\n\t\t\tint tmp_2=minus.remove();\n\t\t\tSystem.out.print(tmp);\n\t\t\tSystem.out.print(\" \");\n\t\t\tSystem.out.println(tmp_2);\n\t\t\tplus.add(tmp-tmp_2);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1560659923, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03007.html", "problem_id": "p03007", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03007/input.txt", "sample_output_relpath": "derived/input_output/data/p03007/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03007/Java/s764508940.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s764508940", "user_id": "u982630224"}, "prompt_components": {"gold_output": "4\n-1 1\n2 -2\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tInteger[] A = new Integer[N];\n\t\tint sum=0;\n\t\tint all_plus=0;\n\t\tint all_minus=0;\n\t\tfor (int i=0;i plus = new ArrayDeque();\n\t\tQueue minus = new ArrayDeque();\n\t\tList list = new LinkedList();\n\t\tfor (int i=0;i0) {\n\t\t\t\tplus.add(A[i]);\n\t\t\t\tall_plus=1;\n\t\t\t} else {\n\t\t\t\tlist.add(A[i]);\n\t\t\t\tall_minus=1;\n\t\t\t}\n\t\t}\n\t\tCollections.reverse(list);\n\t\tList list_2 = new ArrayList(list);\n\t\tfor (int i=0;i1) {\n\t\t\tint tmp=plus.remove();\n\t\t\tint tmp_2=minus.remove();\n\t\t\tSystem.out.print(tmp_2);\n\t\t\tSystem.out.print(\" \");\n\t\t\tSystem.out.println(tmp);\n\t\t\tminus.add(tmp_2-tmp);\n\t\t}\n\n\t\twhile (!minus.isEmpty()) {\n\t\t\tint tmp=plus.remove();\n\t\t\tint tmp_2=minus.remove();\n\t\t\tSystem.out.print(tmp);\n\t\t\tSystem.out.print(\" \");\n\t\t\tSystem.out.println(tmp_2);\n\t\t\tplus.add(tmp-tmp_2);\n\t\t}\n\t}\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "sample_input": "3\n1 -1 2\n"}, "reference_outputs": ["4\n-1 1\n2 -2\n"], "source_document_id": "p03007", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1660, "cpu_time_ms": 1962, "memory_kb": 88720}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s553498443", "group_id": "codeNet:p03007", "input_text": "import java.util.Scanner;\n\npublic class Main{\n static int pivot(int[] a,int i,int j){\n int k=i+1;\n while(k<=j && a[i]==a[k]) k++;\n if(k>j) return -1;\n if(a[i]>=a[k]) return i;\n return k;\n }\n\n static int partition(int[] a,int i,int j,int x){\n int l=i,r=j;\n\n while(l<=r){\n\n while(l<=j && a[l]=i && a[r]>=x) r--;\n\n if(l>r) break;\n int t=a[l];\n a[l]=a[r];\n a[r]=t;\n l++; r--;\n }\n return l;\n }\n\n public static void quickSort(int[] a,int i,int j){\n if(i==j) return;\n int p=pivot(a,i,j);\n if(p!=-1){\n int k=partition(a,i,j,a[p]);\n quickSort(a,i,k-1);\n quickSort(a,k,j);\n }\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n=scanner.nextInt();\n int a[]=new int[n];\n int flg=0;\n int cmd=0;\n long ans=0;\n //HashMap num=new HashMap();\n long x[]=new long[n];\n long y[]=new long[n];\n int cnt=0;\n\n for(int i=0;i0){\n flg=1;\n cmd=i;\n }\n }\n if(n==2&&a[0]==0){\n x[0]=a[1];\n y[0]=a[0];\n ans=a[1]-a[0];\n }\n else if(flg==1){\n x[cnt]=a[cmd];\n y[cnt]=a[cmd+1];\n cnt++;\n ans=a[cmd]-a[cmd+1];\n for(int i=cmd+2;ij) return -1;\n if(a[i]>=a[k]) return i;\n return k;\n }\n\n static int partition(int[] a,int i,int j,int x){\n int l=i,r=j;\n\n while(l<=r){\n\n while(l<=j && a[l]=i && a[r]>=x) r--;\n\n if(l>r) break;\n int t=a[l];\n a[l]=a[r];\n a[r]=t;\n l++; r--;\n }\n return l;\n }\n\n public static void quickSort(int[] a,int i,int j){\n if(i==j) return;\n int p=pivot(a,i,j);\n if(p!=-1){\n int k=partition(a,i,j,a[p]);\n quickSort(a,i,k-1);\n quickSort(a,k,j);\n }\n }\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int n=scanner.nextInt();\n int a[]=new int[n];\n int flg=0;\n int cmd=0;\n long ans=0;\n //HashMap num=new HashMap();\n long x[]=new long[n];\n long y[]=new long[n];\n int cnt=0;\n\n for(int i=0;i0){\n flg=1;\n cmd=i;\n }\n }\n if(n==2&&a[0]==0){\n x[0]=a[1];\n y[0]=a[0];\n ans=a[1]-a[0];\n }\n else if(flg==1){\n x[cnt]=a[cmd];\n y[cnt]=a[cmd+1];\n cnt++;\n ans=a[cmd]-a[cmd+1];\n for(int i=cmd+2;i=0;i--)\n suf[i] = suf[i+1] + a[i];\n\n int ma =Integer.MAX_VALUE;\n\n for(int i=0;i()\n {\n public int compare(int[] o1, int[] o2){\n return(Integer.valueOf(o1[col]).compareTo(o2[col]));\n }\n });\n\n }\n public static class DJSet {\n public int[] upper;\n\n public DJSet(int n) {\n upper = new int[n];\n Arrays.fill(upper, -1);\n }\n\n public int root(int x) {\n return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n }\n\n public boolean equiv(int x, int y) {\n return root(x) == root(y);\n }\n\n public boolean union(int x, int y) {\n x = root(x);\n y = root(y);\n if (x != y) {\n if (upper[y] < upper[x]) {\n int d = x;\n x = y;\n y = d;\n }\n upper[x] += upper[y];\n upper[y] = x;\n }\n return x == y;\n }\n }\n public static int[] radixSort(int[] f) {\n int[] to = new int[f.length];\n {\n int[] b = new int[65537];\n for(int i = 0;i < f.length;i++)b[1+(f[i]&0xffff)]++;\n for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];\n for(int i = 0;i < f.length;i++)to[b[f[i]&0xffff]++] = f[i];\n int[] d = f; f = to;to = d;\n }\n {\n int[] b = new int[65537];\n for(int i = 0;i < f.length;i++)b[1+(f[i]>>>16)]++;\n for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];\n for(int i = 0;i < f.length;i++)to[b[f[i]>>>16]++] = f[i];\n int[] d = f; f = to;to = d;\n }\n return f;\n }\n public void printArray(int[] a, int d){\n for(int i=0;i= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n\n while(isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n public static void main(String args[]) throws Exception {\n new Thread(null, new Main(),\"Main\",1<<26).start();\n }\n}", "language": "Java", "metadata": {"date": 1560128922, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03012.html", "problem_id": "p03012", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03012/input.txt", "sample_output_relpath": "derived/input_output/data/p03012/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03012/Java/s090910383.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s090910383", "user_id": "u768031280"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "\nimport java.io.*;\nimport java.util.*;\nimport java.lang.*;\nimport static java.lang.Math.*;\n\n\n class Main implements Runnable {\n long m = (int)1e9+7;\n PrintWriter w;\n InputReader c;\n final int MAXN = (int)1e6 + 100;\n\n public void run() {\n c = new InputReader(System.in);\n w = new PrintWriter(System.out);\n\n int n = c.nextInt();\n int a[] = scanArrayI(n);\n\n int pref[] = new int[n];\n int suf[] = new int[n];\n\n pref[0] = a[0];\n for(int i=1;i=0;i--)\n suf[i] = suf[i+1] + a[i];\n\n int ma =Integer.MAX_VALUE;\n\n for(int i=0;i()\n {\n public int compare(int[] o1, int[] o2){\n return(Integer.valueOf(o1[col]).compareTo(o2[col]));\n }\n });\n\n }\n public static class DJSet {\n public int[] upper;\n\n public DJSet(int n) {\n upper = new int[n];\n Arrays.fill(upper, -1);\n }\n\n public int root(int x) {\n return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n }\n\n public boolean equiv(int x, int y) {\n return root(x) == root(y);\n }\n\n public boolean union(int x, int y) {\n x = root(x);\n y = root(y);\n if (x != y) {\n if (upper[y] < upper[x]) {\n int d = x;\n x = y;\n y = d;\n }\n upper[x] += upper[y];\n upper[y] = x;\n }\n return x == y;\n }\n }\n public static int[] radixSort(int[] f) {\n int[] to = new int[f.length];\n {\n int[] b = new int[65537];\n for(int i = 0;i < f.length;i++)b[1+(f[i]&0xffff)]++;\n for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];\n for(int i = 0;i < f.length;i++)to[b[f[i]&0xffff]++] = f[i];\n int[] d = f; f = to;to = d;\n }\n {\n int[] b = new int[65537];\n for(int i = 0;i < f.length;i++)b[1+(f[i]>>>16)]++;\n for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];\n for(int i = 0;i < f.length;i++)to[b[f[i]>>>16]++] = f[i];\n int[] d = f; f = to;to = d;\n }\n return f;\n }\n public void printArray(int[] a, int d){\n for(int i=0;i= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n }\n catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if(numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public String nextLine() {\n String str = \"\";\n try {\n str = br.readLine();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n return str;\n }\n public int nextInt() {\n int c = read();\n\n while(isSpaceChar(c))\n c = read();\n\n int sgn = 1;\n\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n\n int res = 0;\n do {\n if(c<'0'||c>'9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res * sgn;\n }\n\n public long nextLong() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n\n do {\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n double res = 0;\n while (!isSpaceChar(c) && c != '.') {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n res *= 10;\n res += c - '0';\n c = read();\n }\n if (c == '.') {\n c = read();\n double m = 1;\n while (!isSpaceChar(c)) {\n if (c == 'e' || c == 'E')\n return res * Math.pow(10, nextInt());\n if (c < '0' || c > '9')\n throw new InputMismatchException();\n m /= 10;\n res += (c - '0') * m;\n c = read();\n }\n }\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n }\n while (!isSpaceChar(c));\n\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null)\n return filter.isSpaceChar(c);\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public String next() {\n return readString();\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n }\n }\n public static void main(String args[]) throws Exception {\n new Thread(null, new Main(),\"Main\",1<<26).start();\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N weights indexed 1 to N. The \bmass of the weight indexed i is W_i.\n\nWe will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \\leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be the sum of the masses of the weights in the latter group.\n\nConsider all possible such divisions and find the minimum possible absolute difference of S_1 and S_2.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq W_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1 W_2 ... W_{N-1} W_N\n\nOutput\n\nPrint the minimum possible absolute difference of S_1 and S_2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n0\n\nIf T = 2, S_1 = 1 + 2 = 3 and S_2 = 3, with the absolute difference of 0.\n\nSample Input 2\n\n4\n1 3 1 1\n\nSample Output 2\n\n2\n\nIf T = 2, S_1 = 1 + 3 = 4 and S_2 = 1 + 1 = 2, with the absolute difference of 2. We cannot have a smaller absolute difference.\n\nSample Input 3\n\n8\n27 23 76 2 3 5 62 52\n\nSample Output 3\n\n2", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03012", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N weights indexed 1 to N. The \bmass of the weight indexed i is W_i.\n\nWe will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \\leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be the sum of the masses of the weights in the latter group.\n\nConsider all possible such divisions and find the minimum possible absolute difference of S_1 and S_2.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq W_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1 W_2 ... W_{N-1} W_N\n\nOutput\n\nPrint the minimum possible absolute difference of S_1 and S_2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n0\n\nIf T = 2, S_1 = 1 + 2 = 3 and S_2 = 3, with the absolute difference of 0.\n\nSample Input 2\n\n4\n1 3 1 1\n\nSample Output 2\n\n2\n\nIf T = 2, S_1 = 1 + 3 = 4 and S_2 = 1 + 1 = 2, with the absolute difference of 2. We cannot have a smaller absolute difference.\n\nSample Input 3\n\n8\n27 23 76 2 3 5 62 52\n\nSample Output 3\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7708, "cpu_time_ms": 78, "memory_kb": 24404}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s407371187", "group_id": "codeNet:p03013", "input_text": "import java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint stepNum = sc.nextInt();\n\t\tint brokenNum = sc.nextInt();\n\t\tint[] brokenSteps = new int[brokenNum];\n\t\tfor(int i = 0; i < brokenNum; i++)brokenSteps[i] = sc.nextInt();\n \n Dp dp = new Dp(stepNum+1);\n for(int index : brokenSteps) Dp.dp[index] = 0;\n int ans = dp.part(stepNum);\n\n\t\tSystem.out.println(ans);\n }\n}\n\nclass Dp {\n public static int[] dp;\n public Dp (int num) {\n dp = new int[num];\n for(int i = 0; i < num; i++)dp[i] = -1;\n }\n\n public int part(int index) {\n if(dp[index] != -1)return dp[index];\n if(index == 0) dp[index] = 1;\n else if(index == 1) dp[index] = 1;\n else dp[index] = part(index-1) + part(index-2);\n while(dp[index] >= Mod.mod) dp[index] -= Mod.mod;\n return dp[index];\n }\n}\n\nclass Mod{\n static int mod = 1000000007;\n}", "language": "Java", "metadata": {"date": 1566101391, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03013.html", "problem_id": "p03013", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03013/input.txt", "sample_output_relpath": "derived/input_output/data/p03013/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03013/Java/s407371187.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s407371187", "user_id": "u346307762"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint stepNum = sc.nextInt();\n\t\tint brokenNum = sc.nextInt();\n\t\tint[] brokenSteps = new int[brokenNum];\n\t\tfor(int i = 0; i < brokenNum; i++)brokenSteps[i] = sc.nextInt();\n \n Dp dp = new Dp(stepNum+1);\n for(int index : brokenSteps) Dp.dp[index] = 0;\n int ans = dp.part(stepNum);\n\n\t\tSystem.out.println(ans);\n }\n}\n\nclass Dp {\n public static int[] dp;\n public Dp (int num) {\n dp = new int[num];\n for(int i = 0; i < num; i++)dp[i] = -1;\n }\n\n public int part(int index) {\n if(dp[index] != -1)return dp[index];\n if(index == 0) dp[index] = 1;\n else if(index == 1) dp[index] = 1;\n else dp[index] = part(index-1) + part(index-2);\n while(dp[index] >= Mod.mod) dp[index] -= Mod.mod;\n return dp[index];\n }\n}\n\nclass Mod{\n static int mod = 1000000007;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.\nHe can climb up one or two steps at a time.\n\nHowever, the treads of the a_1-th, a_2-th, a_3-th, \\ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.\n\nHow many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?\nFind the count modulo 1\\ 000\\ 000\\ 007.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq N-1\n\n1 \\leq a_1 < a_2 < ... < a_M \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1\na_2\n.\n.\n.\na_M\n\nOutput\n\nPrint the number of ways to climb up the stairs under the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n6 1\n3\n\nSample Output 1\n\n4\n\nThere are four ways to climb up the stairs, as follows:\n\n0 \\to 1 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 1 \\to 2 \\to 4 \\to 6\n\n0 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 2 \\to 4 \\to 6\n\nSample Input 2\n\n10 2\n4\n5\n\nSample Output 2\n\n0\n\nThere may be no way to climb up the stairs without setting foot on the broken steps.\n\nSample Input 3\n\n100 5\n1\n23\n45\n67\n89\n\nSample Output 3\n\n608200469\n\nBe sure to print the count modulo 1\\ 000\\ 000\\ 007.", "sample_input": "6 1\n3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03013", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.\nHe can climb up one or two steps at a time.\n\nHowever, the treads of the a_1-th, a_2-th, a_3-th, \\ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.\n\nHow many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?\nFind the count modulo 1\\ 000\\ 000\\ 007.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq N-1\n\n1 \\leq a_1 < a_2 < ... < a_M \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1\na_2\n.\n.\n.\na_M\n\nOutput\n\nPrint the number of ways to climb up the stairs under the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n6 1\n3\n\nSample Output 1\n\n4\n\nThere are four ways to climb up the stairs, as follows:\n\n0 \\to 1 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 1 \\to 2 \\to 4 \\to 6\n\n0 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 2 \\to 4 \\to 6\n\nSample Input 2\n\n10 2\n4\n5\n\nSample Output 2\n\n0\n\nThere may be no way to climb up the stairs without setting foot on the broken steps.\n\nSample Input 3\n\n100 5\n1\n23\n45\n67\n89\n\nSample Output 3\n\n608200469\n\nBe sure to print the count modulo 1\\ 000\\ 000\\ 007.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 956, "cpu_time_ms": 433, "memory_kb": 54120}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s686028876", "group_id": "codeNet:p03013", "input_text": "import java.util.Scanner;\npublic class Main {\n\tpublic static boolean Esta(int k, int[]A) {\n\t\tfor(int i=0;i= 0; --j) {\n\t\t\t\tif (matrix[i][j] == '#')\n\t\t\t\t\tcur = 0;\n\t\t\t\telse\n\t\t\t\t\t++cur;\n\t\t\t\tright[i][j] = cur;\n\t\t\t}\n\t\t}\n\n\t\tfor (int j = 0; j < w; ++j) {\n\t\t\tint cur = 0;\n\t\t\tfor (int i = 0; i < h; ++i) {\n\t\t\t\tif (matrix[i][j] == '#')\n\t\t\t\t\tcur = 0;\n\t\t\t\telse\n\t\t\t\t\t++cur;\n\t\t\t\ttop[i][j] = cur;\n\t\t\t}\n\t\t}\n\n\t\tfor (int j = 0; j < w; ++j) {\n\t\t\tint cur = 0;\n\t\t\tfor (int i = h - 1; i >= 0; --i) {\n\t\t\t\tif (matrix[i][j] == '#')\n\t\t\t\t\tcur = 0;\n\t\t\t\telse\n\t\t\t\t\t++cur;\n\t\t\t\tbottom[i][j] = cur;\n\t\t\t}\n\t\t}\n\n\t\tint max = 0;\n\n\t\tfor (int i = 0; i < h; i++) {\n\t\t\tfor (int j = 0; j < w; j++) {\n\t\t\t\tif (matrix[i][j] == '#')\n\t\t\t\t\tcontinue;\n\t\t\t\tmax = Math.max(max, left[i][j] + right[i][j] + top[i][j] + bottom[i][j] - 3);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(max);\n\t}\n\n}", "language": "Java", "metadata": {"date": 1598972566, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03014.html", "problem_id": "p03014", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03014/input.txt", "sample_output_relpath": "derived/input_output/data/p03014/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03014/Java/s648513648.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s648513648", "user_id": "u043263787"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n\t\tString str[] = br.readLine().split(\" \");\n\n\t\tint h = Integer.parseInt(str[0]);\n\t\tint w = Integer.parseInt(str[1]);\n\n\t\tchar matrix[][] = new char[h][w];\n\n\t\tfor (int i = 0; i < h; i++) {\n\t\t\tchar c[] = br.readLine().toCharArray();\n\t\t\tfor (int j = 0; j < w; j++) {\n\t\t\t\tmatrix[i][j] = c[j];\n\t\t\t}\n\t\t}\n\n\t\tint left[][] = new int[h + 10][w + 10];\n\t\tint right[][] = new int[h + 10][w + 10];\n\t\tint top[][] = new int[h + 10][w + 10];\n\t\tint bottom[][] = new int[h + 10][w + 10];\n\n\t\tfor (int i = 0; i < h; ++i) {\n\t\t\tint cur = 0;\n\t\t\tfor (int j = 0; j < w; ++j) {\n\t\t\t\tif (matrix[i][j] == '#')\n\t\t\t\t\tcur = 0;\n\t\t\t\telse\n\t\t\t\t\t++cur;\n\t\t\t\tleft[i][j] = cur;\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0; i < h; ++i) {\n\t\t\tint cur = 0;\n\t\t\tfor (int j = w - 1; j >= 0; --j) {\n\t\t\t\tif (matrix[i][j] == '#')\n\t\t\t\t\tcur = 0;\n\t\t\t\telse\n\t\t\t\t\t++cur;\n\t\t\t\tright[i][j] = cur;\n\t\t\t}\n\t\t}\n\n\t\tfor (int j = 0; j < w; ++j) {\n\t\t\tint cur = 0;\n\t\t\tfor (int i = 0; i < h; ++i) {\n\t\t\t\tif (matrix[i][j] == '#')\n\t\t\t\t\tcur = 0;\n\t\t\t\telse\n\t\t\t\t\t++cur;\n\t\t\t\ttop[i][j] = cur;\n\t\t\t}\n\t\t}\n\n\t\tfor (int j = 0; j < w; ++j) {\n\t\t\tint cur = 0;\n\t\t\tfor (int i = h - 1; i >= 0; --i) {\n\t\t\t\tif (matrix[i][j] == '#')\n\t\t\t\t\tcur = 0;\n\t\t\t\telse\n\t\t\t\t\t++cur;\n\t\t\t\tbottom[i][j] = cur;\n\t\t\t}\n\t\t}\n\n\t\tint max = 0;\n\n\t\tfor (int i = 0; i < h; i++) {\n\t\t\tfor (int j = 0; j < w; j++) {\n\t\t\t\tif (matrix[i][j] == '#')\n\t\t\t\t\tcontinue;\n\t\t\t\tmax = Math.max(max, left[i][j] + right[i][j] + top[i][j] + bottom[i][j] - 3);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(max);\n\t}\n\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares.\n\nSnuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it.\nThe lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and right.\nIn each direction, the beam will continue traveling until it hits a square occupied by an obstacle or it hits the border of the grid. It will light all the squares on the way, including the square on which the lamp is placed, but not the square occupied by an obstacle.\n\nSnuke wants to maximize the number of squares lighted by the lamp.\n\nYou are given H strings S_i (1 \\leq i \\leq H), each of length W. If the j-th character (1 \\leq j \\leq W) of S_i is #, there is an obstacle on the square at the i-th row from the top and the j-th column from the left; if that character is ., there is no obstacle on that square.\n\nFind the maximum possible number of squares lighted by the lamp.\n\nConstraints\n\n1 \\leq H \\leq 2,000\n\n1 \\leq W \\leq 2,000\n\nS_i is a string of length W consisting of # and ..\n\n. occurs at least once in one of the strings S_i (1 \\leq i \\leq H).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the maximum possible number of squares lighted by the lamp.\n\nSample Input 1\n\n4 6\n#..#..\n.....#\n....#.\n#.#...\n\nSample Output 1\n\n8\n\nIf Snuke places the lamp on the square at the second row from the top and the second column from the left, it will light the following squares: the first through fifth squares from the left in the second row, and the first through fourth squares from the top in the second column, for a total of eight squares.\n\nSample Input 2\n\n8 8\n..#...#.\n....#...\n##......\n..###..#\n...#..#.\n##....#.\n#...#...\n###.#..#\n\nSample Output 2\n\n13", "sample_input": "4 6\n#..#..\n.....#\n....#.\n#.#...\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03014", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares.\n\nSnuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it.\nThe lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and right.\nIn each direction, the beam will continue traveling until it hits a square occupied by an obstacle or it hits the border of the grid. It will light all the squares on the way, including the square on which the lamp is placed, but not the square occupied by an obstacle.\n\nSnuke wants to maximize the number of squares lighted by the lamp.\n\nYou are given H strings S_i (1 \\leq i \\leq H), each of length W. If the j-th character (1 \\leq j \\leq W) of S_i is #, there is an obstacle on the square at the i-th row from the top and the j-th column from the left; if that character is ., there is no obstacle on that square.\n\nFind the maximum possible number of squares lighted by the lamp.\n\nConstraints\n\n1 \\leq H \\leq 2,000\n\n1 \\leq W \\leq 2,000\n\nS_i is a string of length W consisting of # and ..\n\n. occurs at least once in one of the strings S_i (1 \\leq i \\leq H).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the maximum possible number of squares lighted by the lamp.\n\nSample Input 1\n\n4 6\n#..#..\n.....#\n....#.\n#.#...\n\nSample Output 1\n\n8\n\nIf Snuke places the lamp on the square at the second row from the top and the second column from the left, it will light the following squares: the first through fifth squares from the left in the second row, and the first through fourth squares from the top in the second column, for a total of eight squares.\n\nSample Input 2\n\n8 8\n..#...#.\n....#...\n##......\n..###..#\n...#..#.\n##....#.\n#...#...\n###.#..#\n\nSample Output 2\n\n13", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1690, "cpu_time_ms": 568, "memory_kb": 108720}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s424131314", "group_id": "codeNet:p03014", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber , InputReader in , PrintWriter out){\n int h = in.nextInt();\n int w = in.nextInt();\n HashMap> arr = new HashMap<>(h);\n HashMap> arr1 = new HashMap<>(w);\n for (int i = 0; i (h));\n }\n for (int i = 0; i (w));\n }\n int[][] count = new int[h][w];\n for (int i = 0; i > arr = new HashMap<>(h);\n HashMap> arr1 = new HashMap<>(w);\n for (int i = 0; i (h));\n }\n for (int i = 0; i (w));\n }\n int[][] count = new int[h][w];\n for (int i = 0; i = 0; j--) {\n if (map[i][j]=='#'){\n cnt = 0;\n }else{\n cnt++;\n }\n beam[i][j] += cnt;\n }\n }\n\n for (int j = 0; j < W; j++) {\n int cnt = 0;\n for (int i = 0; i < H; i++) {\n if (map[i][j]=='#'){\n cnt = 0;\n }else{\n cnt++;\n }\n beam[i][j] += cnt;\n }\n cnt = 0;\n for (int i = H-1; i >=0; i--) {\n if (map[i][j]=='#'){\n cnt = 0;\n }else{\n cnt++;\n }\n beam[i][j] += cnt;\n }\n }\n\n int max = 0;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n max = Math.max(max, beam[i][j]);\n }\n }\n out.println(max - 3);\n }\n\n }\n\n //--------------------------------------------------------------------\n\n private void solveAll() throws IOException {\n long timeStart = System.currentTimeMillis();\n if (T==0) {\n if (largeFakeTest) {\n T = largeFakeTest_T;\n } else {\n T = scanner.nextInt();\n }\n }\n final String[] results = new String[T+1];\n for (int test = 0; test < T; test++) {\n ByteArrayOutputStream baos = new ByteArrayOutputStream();\n PrintStream outLocal = new PrintStream(baos);\n Solver solver = new Solver(){\n @Override\n public void callback() {\n results[testNo] = answer;\n }\n };\n solver.out = outLocal;\n solver.testNo = test+1;\n if (largeFakeTest) {\n solver.readFakeInput();\n }else{\n solver.readInput();\n }\n solver.solveWrapped(baos);\n }\n\n long timeEnd = System.currentTimeMillis();\n if (isInputFromFile())\n System.out.println(\"All tasks are solved! Elapsed time \"+(timeEnd-timeStart)/1000.0+\" sec.\");\n\n // write all responses in the proper order\n if (!interactive) {\n for (int i = 1; i <= T; i++) {\n if (eventType == EventType.GOOGLE_CODE_JAM) {\n outGlobal.printf(\"Case #%d: %s\", i, results[i]);\n } else {\n outGlobal.print(results[i]);\n }\n }\n }\n }\n\n enum EventType{\n DEFAULT,\n GOOGLE_CODE_JAM\n }\n\n static boolean isInputFromFile() {\n return inputFilename != null;\n }\n\n public static abstract class SolverAbstract {\n PrintStream out;\n int testNo;\n String answer = null;\n\n public void callback(){};\n\n public abstract void readInput() throws IOException;\n\n //generate a randomized test with the maximal input values\n public void readFakeInput() throws IOException{\n throw new RuntimeException(\"not implemented\");\n }\n\n protected abstract void solve() throws IOException;\n\n protected void solveWrapped(ByteArrayOutputStream baos) throws IOException {\n if (isInputFromFile())\n System.out.println(\"SOLVER: solving task #\"+testNo+\" out of \"+ T+\"...\");\n solve();\n answer = baos.toString();\n if (isInputFromFile()) {\n System.out.println(\"\\t\"+answer);\n }\n callback();\n }\n }\n\n ////////////////////////////////////////////////////////\n // Link about multithreading: http://stackoverflow.com/questions/4521983/java-executorservice-that-blocks-on-submission-after-a-certain-queue-size\n\n\n // ------------- Some stardard tools that are currently not tested.\n //adopt for the lists of adjacent vertices\n static class Graph{\n\n int[][] G;\n int N;\n\n int[][] A;\n int[][] F;\n\n int[] path;\n int pathLen;\n boolean[] visited;\n int target;\n boolean flowFound;\n\n public Graph(int[][] g) {\n G = g;\n N = G.length;\n }\n\n public int[][] maxflow(int iSource, int iSink) {\n path = new int[N];\n visited = new boolean[N];\n\n A = new int[N][];\n for (int i = 0; i < N; i++) {\n A[i] = G[i].clone();\n }\n F = new int[N][N];\n\n target = iSink;\n //dfs from source to sink\n //increase path\n while(true){\n flowFound = false;\n visited[iSource] = true;\n pathLen = 0;\n path[pathLen++] = iSource;\n dfs(iSource);\n if (!flowFound)\n break;\n }\n return F;\n }\n\n private void dfs(int u) {\n if (u==target){\n flowFound = true;\n for (int i = 0; i < pathLen-1; i++) {\n int from = path[i];\n int to = path[i+1];\n F[from][to]++;\n F[to][from]--;\n }\n }else {\n for (int i = 0; i < N && !flowFound; i++) {\n if (!visited[i] && A[u][i] > F[u][i]) {\n visited[i] = true;\n path[pathLen] = i;\n pathLen++;\n dfs(i);\n visited[i] = false;\n pathLen--;\n }\n }\n }\n }\n }\n\n public static class Utilities{\n public static List getPrimes(int limit) {\n boolean[] primes = new boolean[limit+1];\n Arrays.fill(primes, true);\n\n primes[1] = false;\n for(int i=2; i<=limit; i++){\n if (primes[i]){\n for(int j=i+i; j<=limit; j+=i){\n primes[j] = false;\n }\n }\n }\n List listPrimes = new ArrayList<>();\n for(int i=2; i<=limit; i++){\n if (primes[i]){\n listPrimes.add(i);\n }\n }\n return listPrimes;\n }\n }\n\n public static class Modulo{\n long mod = (long)1e9+7;\n\n public Modulo(long mod) {\n super();\n this.mod = mod;\n }\n\n public long inv(long a) {\n long res = pow(a, mod-2);\n return res;\n }\n\n public long pow(long a, long x) {\n if (x==0)\n return 1;\n long part = 1;\n if ((x&1)!=0)\n part = a;\n return (part * pow((a*a)%mod, x>>1)) % mod;\n }\n\n public long c(long n, long m){\n long res = 1;\n for(int i=1; i<=m; i++){\n res = (res * (n-m+i)) % mod;\n res = (res * inv(i)) % mod;\n }\n return res;\n }\n }\n\n /**\n * Added 26.04.2013.\n * See KROK 2013, Round 1, Problem D.\n */\n static class DisjointUnionSet implements Cloneable{\n int[] rank;\n int[] parent;\n\n protected DisjointUnionSet clone(){\n DisjointUnionSet cloned = new DisjointUnionSet(parent.length);\n for(int i=0; i rank[p2]){\n parent[p2] = p1;\n }else if (rank[p2] > rank[p1]){\n parent[p1] = p2;\n }else{\n parent[p2] = p1;\n rank[p1]++;\n }\n }\n\n // O(alpha(n))\n private int find(int index) {\n if (parent[index] != index)\n parent[index] = find(parent[index]);\n return parent[index];\n }\n\n // O(N alpha(N)) ==> see find()\n public int getCountDisjointSets(){\n int[] used = new int[parent.length];\n for(int i=0; i=1; j--){\n int i = rnd.nextInt(j+1);\n swap(a, i, j);\n }\n }\n\n public static void swap(int[] a, int i, int j){\n int tmp = a[i];\n a[i] = a[j];\n a[j] = tmp;\n }\n }\n\n static class GraphSupport{\n /*\n //Added 20.02.2017.\n //See Codeforces Round 398, Div.2, C.\n // Recoursive call to dfs function may result in either MTL or StackOverflow.\n // Codeforces provide stacksize 64M\n \n private void dfs_no_recursion(int root, IntConsumer dfs_post){\n int[] stack = new int[N];\n int[] stackInt = new int[N];\n int iStack = 0;\n stack[iStack] = root;\n stackInt[iStack++] = 0;\n while(true){\n Node node = nodes[stack[iStack-1]];\n int childIdx = stackInt[iStack-1];\n if (childIdx < node.children.size()){\n stack[iStack] = node.children.get(childIdx).idx;\n stackInt[iStack++] = 0;\n }else{\n dfs_post.accept(node.idx);\n \n iStack--;\n if (iStack==0){\n break;\n }\n stackInt[iStack-1]++;\n }\n }\n }\n */\n }\n\n\n ////////////////////////////////////////////////////////\n /// Typically, you don't want to edit anything below\n ///////////////////////////////////////////////////////\n final int BUF_SIZE = 1024 * 1024 * 8;//important to read long-string tokens properly\n final int INPUT_BUFFER_SIZE = 1024 * 1024 * 8;\n final int BUF_SIZE_INPUT = 1024;\n\n boolean useClassResourceTopDir = true;\n String outSuffix = \".out\";\n\n static PrintStream outGlobal;\n static ByteScanner scanner;\n\n public void run() {\n try{\n InputStream bis;\n OutputStream bos;\n if (inputFilename !=null){\n File inputFile;\n File outputFile;\n if (useClassResourceTopDir) {\n File baseFile = new File(getClass().getResource(\"/\").getFile());\n inputFile = new File(baseFile, inputFilename);\n outputFile = new File(baseFile, inputFilename +outSuffix);\n }else{\n inputFile = new File(inputFilename);\n outputFile = new File(inputFilename +outSuffix);\n }\n System.out.println(\"Input file canonical path: \"+inputFile.getCanonicalPath());\n bis = new BufferedInputStream(\n new FileInputStream(inputFile),\n INPUT_BUFFER_SIZE);\n bos = new BufferedOutputStream(new FileOutputStream(outputFile));\n outGlobal = new PrintStream(bos);\n }else{\n bis = new BufferedInputStream(System.in, INPUT_BUFFER_SIZE);\n bos = new BufferedOutputStream(System.out);\n outGlobal = new PrintStream(bos);\n }\n scanner = new ByteScanner(bis, BUF_SIZE_INPUT, BUF_SIZE);\n\n solveAll();\n outGlobal.flush();\n }catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n public static class EofException extends IOException{\n }\n\n public static class ByteScanner{\n InputStream is;\n\n public ByteScanner(InputStream is, int bufSizeInput, int bufSize){\n this.is = is;\n this.bufSizeInput = bufSizeInput;\n this.bufSize = bufSize;\n\n byteBufInput = new byte[this.bufSizeInput];\n byteBuf = new byte[this.bufSize];\n }\n\n public ByteScanner(byte[] data){\n byteBufInput = data;\n bufSizeInput = data.length;\n bufSize = data.length;\n byteBuf = new byte[bufSize];\n byteRead = data.length;\n bytePos = 0;\n }\n\n private int bufSizeInput;\n private int bufSize;\n\n byte[] byteBufInput;\n byte by=-1;\n int byteRead=-1;\n int bytePos=-1;\n\n byte[] byteBuf;\n int totalBytes;\n\n boolean eofMet = false;\n\n private byte nextByte() throws IOException{\n if (bytePos<0 || bytePos>=byteRead){\n byteRead = is==null? -1: is.read(byteBufInput);\n bytePos=0;\n if (byteRead<0){\n byteBufInput[bytePos]=-1;//!!!\n if (eofMet)\n throw new EofException();\n eofMet = true;\n }\n }\n return byteBufInput[bytePos++];\n }\n\n public byte nextVisibleChar() throws IOException{\n while ((by=nextByte())<=0x20);\n return by;\n }\n\n public String nextLine() throws IOException {\n readToken((byte)0x20);\n return new String(byteBuf,0,totalBytes);\n }\n\n // Reads token. Spacebar is separator char.\n public String nextToken() throws IOException {\n readToken((byte)0x21);\n return new String(byteBuf,0,totalBytes);\n }\n\n // Spacebar is included as separator char\n private void readToken() throws IOException {\n readToken((byte)0x21);\n }\n\n private void readToken(byte acceptFrom) throws IOException {\n totalBytes = 0;\n while ((by=nextByte())=acceptFrom){\n byteBuf[totalBytes++] = by;\n }\n }\n\n public int nextInt() throws IOException{\n readToken();\n int num=0, i=0;\n boolean sign=false;\n if (byteBuf[i]=='-'){\n sign = true;\n i++;\n }\n for (; i= 0; j--) {\n if (map[i][j]=='#'){\n cnt = 0;\n }else{\n cnt++;\n }\n beam[i][j] += cnt;\n }\n }\n\n for (int j = 0; j < W; j++) {\n int cnt = 0;\n for (int i = 0; i < H; i++) {\n if (map[i][j]=='#'){\n cnt = 0;\n }else{\n cnt++;\n }\n beam[i][j] += cnt;\n }\n cnt = 0;\n for (int i = H-1; i >=0; i--) {\n if (map[i][j]=='#'){\n cnt = 0;\n }else{\n cnt++;\n }\n beam[i][j] += cnt;\n }\n }\n\n int max = 0;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n max = Math.max(max, beam[i][j]);\n }\n }\n out.println(max - 3);\n }\n\n }\n\n //--------------------------------------------------------------------\n\n private void solveAll() throws IOException {\n long timeStart = System.currentTimeMillis();\n if (T==0) {\n if (largeFakeTest) {\n T = largeFakeTest_T;\n } else {\n T = scanner.nextInt();\n }\n }\n final String[] results = new String[T+1];\n for (int test = 0; test < T; test++) {\n ByteArrayOutputStream baos = new ByteArrayOutputStream();\n PrintStream outLocal = new PrintStream(baos);\n Solver solver = new Solver(){\n @Override\n public void callback() {\n results[testNo] = answer;\n }\n };\n solver.out = outLocal;\n solver.testNo = test+1;\n if (largeFakeTest) {\n solver.readFakeInput();\n }else{\n solver.readInput();\n }\n solver.solveWrapped(baos);\n }\n\n long timeEnd = System.currentTimeMillis();\n if (isInputFromFile())\n System.out.println(\"All tasks are solved! Elapsed time \"+(timeEnd-timeStart)/1000.0+\" sec.\");\n\n // write all responses in the proper order\n if (!interactive) {\n for (int i = 1; i <= T; i++) {\n if (eventType == EventType.GOOGLE_CODE_JAM) {\n outGlobal.printf(\"Case #%d: %s\", i, results[i]);\n } else {\n outGlobal.print(results[i]);\n }\n }\n }\n }\n\n enum EventType{\n DEFAULT,\n GOOGLE_CODE_JAM\n }\n\n static boolean isInputFromFile() {\n return inputFilename != null;\n }\n\n public static abstract class SolverAbstract {\n PrintStream out;\n int testNo;\n String answer = null;\n\n public void callback(){};\n\n public abstract void readInput() throws IOException;\n\n //generate a randomized test with the maximal input values\n public void readFakeInput() throws IOException{\n throw new RuntimeException(\"not implemented\");\n }\n\n protected abstract void solve() throws IOException;\n\n protected void solveWrapped(ByteArrayOutputStream baos) throws IOException {\n if (isInputFromFile())\n System.out.println(\"SOLVER: solving task #\"+testNo+\" out of \"+ T+\"...\");\n solve();\n answer = baos.toString();\n if (isInputFromFile()) {\n System.out.println(\"\\t\"+answer);\n }\n callback();\n }\n }\n\n ////////////////////////////////////////////////////////\n // Link about multithreading: http://stackoverflow.com/questions/4521983/java-executorservice-that-blocks-on-submission-after-a-certain-queue-size\n\n\n // ------------- Some stardard tools that are currently not tested.\n //adopt for the lists of adjacent vertices\n static class Graph{\n\n int[][] G;\n int N;\n\n int[][] A;\n int[][] F;\n\n int[] path;\n int pathLen;\n boolean[] visited;\n int target;\n boolean flowFound;\n\n public Graph(int[][] g) {\n G = g;\n N = G.length;\n }\n\n public int[][] maxflow(int iSource, int iSink) {\n path = new int[N];\n visited = new boolean[N];\n\n A = new int[N][];\n for (int i = 0; i < N; i++) {\n A[i] = G[i].clone();\n }\n F = new int[N][N];\n\n target = iSink;\n //dfs from source to sink\n //increase path\n while(true){\n flowFound = false;\n visited[iSource] = true;\n pathLen = 0;\n path[pathLen++] = iSource;\n dfs(iSource);\n if (!flowFound)\n break;\n }\n return F;\n }\n\n private void dfs(int u) {\n if (u==target){\n flowFound = true;\n for (int i = 0; i < pathLen-1; i++) {\n int from = path[i];\n int to = path[i+1];\n F[from][to]++;\n F[to][from]--;\n }\n }else {\n for (int i = 0; i < N && !flowFound; i++) {\n if (!visited[i] && A[u][i] > F[u][i]) {\n visited[i] = true;\n path[pathLen] = i;\n pathLen++;\n dfs(i);\n visited[i] = false;\n pathLen--;\n }\n }\n }\n }\n }\n\n public static class Utilities{\n public static List getPrimes(int limit) {\n boolean[] primes = new boolean[limit+1];\n Arrays.fill(primes, true);\n\n primes[1] = false;\n for(int i=2; i<=limit; i++){\n if (primes[i]){\n for(int j=i+i; j<=limit; j+=i){\n primes[j] = false;\n }\n }\n }\n List listPrimes = new ArrayList<>();\n for(int i=2; i<=limit; i++){\n if (primes[i]){\n listPrimes.add(i);\n }\n }\n return listPrimes;\n }\n }\n\n public static class Modulo{\n long mod = (long)1e9+7;\n\n public Modulo(long mod) {\n super();\n this.mod = mod;\n }\n\n public long inv(long a) {\n long res = pow(a, mod-2);\n return res;\n }\n\n public long pow(long a, long x) {\n if (x==0)\n return 1;\n long part = 1;\n if ((x&1)!=0)\n part = a;\n return (part * pow((a*a)%mod, x>>1)) % mod;\n }\n\n public long c(long n, long m){\n long res = 1;\n for(int i=1; i<=m; i++){\n res = (res * (n-m+i)) % mod;\n res = (res * inv(i)) % mod;\n }\n return res;\n }\n }\n\n /**\n * Added 26.04.2013.\n * See KROK 2013, Round 1, Problem D.\n */\n static class DisjointUnionSet implements Cloneable{\n int[] rank;\n int[] parent;\n\n protected DisjointUnionSet clone(){\n DisjointUnionSet cloned = new DisjointUnionSet(parent.length);\n for(int i=0; i rank[p2]){\n parent[p2] = p1;\n }else if (rank[p2] > rank[p1]){\n parent[p1] = p2;\n }else{\n parent[p2] = p1;\n rank[p1]++;\n }\n }\n\n // O(alpha(n))\n private int find(int index) {\n if (parent[index] != index)\n parent[index] = find(parent[index]);\n return parent[index];\n }\n\n // O(N alpha(N)) ==> see find()\n public int getCountDisjointSets(){\n int[] used = new int[parent.length];\n for(int i=0; i=1; j--){\n int i = rnd.nextInt(j+1);\n swap(a, i, j);\n }\n }\n\n public static void swap(int[] a, int i, int j){\n int tmp = a[i];\n a[i] = a[j];\n a[j] = tmp;\n }\n }\n\n static class GraphSupport{\n /*\n //Added 20.02.2017.\n //See Codeforces Round 398, Div.2, C.\n // Recoursive call to dfs function may result in either MTL or StackOverflow.\n // Codeforces provide stacksize 64M\n \n private void dfs_no_recursion(int root, IntConsumer dfs_post){\n int[] stack = new int[N];\n int[] stackInt = new int[N];\n int iStack = 0;\n stack[iStack] = root;\n stackInt[iStack++] = 0;\n while(true){\n Node node = nodes[stack[iStack-1]];\n int childIdx = stackInt[iStack-1];\n if (childIdx < node.children.size()){\n stack[iStack] = node.children.get(childIdx).idx;\n stackInt[iStack++] = 0;\n }else{\n dfs_post.accept(node.idx);\n \n iStack--;\n if (iStack==0){\n break;\n }\n stackInt[iStack-1]++;\n }\n }\n }\n */\n }\n\n\n ////////////////////////////////////////////////////////\n /// Typically, you don't want to edit anything below\n ///////////////////////////////////////////////////////\n final int BUF_SIZE = 1024 * 1024 * 8;//important to read long-string tokens properly\n final int INPUT_BUFFER_SIZE = 1024 * 1024 * 8;\n final int BUF_SIZE_INPUT = 1024;\n\n boolean useClassResourceTopDir = true;\n String outSuffix = \".out\";\n\n static PrintStream outGlobal;\n static ByteScanner scanner;\n\n public void run() {\n try{\n InputStream bis;\n OutputStream bos;\n if (inputFilename !=null){\n File inputFile;\n File outputFile;\n if (useClassResourceTopDir) {\n File baseFile = new File(getClass().getResource(\"/\").getFile());\n inputFile = new File(baseFile, inputFilename);\n outputFile = new File(baseFile, inputFilename +outSuffix);\n }else{\n inputFile = new File(inputFilename);\n outputFile = new File(inputFilename +outSuffix);\n }\n System.out.println(\"Input file canonical path: \"+inputFile.getCanonicalPath());\n bis = new BufferedInputStream(\n new FileInputStream(inputFile),\n INPUT_BUFFER_SIZE);\n bos = new BufferedOutputStream(new FileOutputStream(outputFile));\n outGlobal = new PrintStream(bos);\n }else{\n bis = new BufferedInputStream(System.in, INPUT_BUFFER_SIZE);\n bos = new BufferedOutputStream(System.out);\n outGlobal = new PrintStream(bos);\n }\n scanner = new ByteScanner(bis, BUF_SIZE_INPUT, BUF_SIZE);\n\n solveAll();\n outGlobal.flush();\n }catch (Exception e) {\n e.printStackTrace();\n System.exit(1);\n }\n }\n\n public static class EofException extends IOException{\n }\n\n public static class ByteScanner{\n InputStream is;\n\n public ByteScanner(InputStream is, int bufSizeInput, int bufSize){\n this.is = is;\n this.bufSizeInput = bufSizeInput;\n this.bufSize = bufSize;\n\n byteBufInput = new byte[this.bufSizeInput];\n byteBuf = new byte[this.bufSize];\n }\n\n public ByteScanner(byte[] data){\n byteBufInput = data;\n bufSizeInput = data.length;\n bufSize = data.length;\n byteBuf = new byte[bufSize];\n byteRead = data.length;\n bytePos = 0;\n }\n\n private int bufSizeInput;\n private int bufSize;\n\n byte[] byteBufInput;\n byte by=-1;\n int byteRead=-1;\n int bytePos=-1;\n\n byte[] byteBuf;\n int totalBytes;\n\n boolean eofMet = false;\n\n private byte nextByte() throws IOException{\n if (bytePos<0 || bytePos>=byteRead){\n byteRead = is==null? -1: is.read(byteBufInput);\n bytePos=0;\n if (byteRead<0){\n byteBufInput[bytePos]=-1;//!!!\n if (eofMet)\n throw new EofException();\n eofMet = true;\n }\n }\n return byteBufInput[bytePos++];\n }\n\n public byte nextVisibleChar() throws IOException{\n while ((by=nextByte())<=0x20);\n return by;\n }\n\n public String nextLine() throws IOException {\n readToken((byte)0x20);\n return new String(byteBuf,0,totalBytes);\n }\n\n // Reads token. Spacebar is separator char.\n public String nextToken() throws IOException {\n readToken((byte)0x21);\n return new String(byteBuf,0,totalBytes);\n }\n\n // Spacebar is included as separator char\n private void readToken() throws IOException {\n readToken((byte)0x21);\n }\n\n private void readToken(byte acceptFrom) throws IOException {\n totalBytes = 0;\n while ((by=nextByte())=acceptFrom){\n byteBuf[totalBytes++] = by;\n }\n }\n\n public int nextInt() throws IOException{\n readToken();\n int num=0, i=0;\n boolean sign=false;\n if (byteBuf[i]=='-'){\n sign = true;\n i++;\n }\n for (; i checked = new HashSet();\n\n\tMain(int n, int a, int b, int c, int d, char[] s) {\n\t\tN = n;\n\t\tA = a;\n\t\tB = b;\n\t\tC = c;\n\t\tD = d;\n\t\tS = s;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tMain m;\n\t\ttry (Scanner s = new Scanner(System.in)) {\n\t\t\tm = new Main(s.nextInt(),\n\t\t\t\t\ts.nextInt(),\n\t\t\t\t\ts.nextInt(),\n\t\t\t\t\ts.nextInt(),\n\t\t\t\t\ts.nextInt(),\n\t\t\t\t\ts.next().toCharArray());\n\t\t}\n\n\t\tif (m.move(m.A, m.B)) {\n\t\t\tSystem.out.println(\"Yes\");\n\t\t} else {\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n\n\tboolean move(int a, int b) {\n\t\tif (a == C && b == D) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (checked.contains(a + \",\" + b)) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (a > C) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (b > D) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (a == b) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (S[b - 1] == '#') {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (S[a - 1] == '#') {\n\t\t\treturn false;\n\t\t}\n\n\t\tboolean x = move(a + 2, b);\n\t\tif (!x) {\n\t\t\tchecked.contains((a + 2) + \",\" + b);\n\t\t\tx = move(a, b + 2);\n\t\t}\n\t\tif (!x) {\n\t\t\tchecked.contains(a + \",\" + (b + 2));\n\t\t\tx = move(a + 1, b);\n\t\t}\n\t\tif (!x) {\n\t\t\tchecked.contains((a + 1) + \",\" + b);\n\t\t\tx = move(a, b + 1);\n\t\t}\n\t\tif (!x) {\n\t\t\tchecked.contains(a + \",\" + (b + 1));\n\t\t}\n\t\treturn x;\n\t}\n}\n", "language": "Java", "metadata": {"date": 1559527471, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03017.html", "problem_id": "p03017", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03017/input.txt", "sample_output_relpath": "derived/input_output/data/p03017/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03017/Java/s003508108.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s003508108", "user_id": "u195943121"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\tfinal int N, A, B, C, D;\n\tfinal char[] S;\n\tfinal Set checked = new HashSet();\n\n\tMain(int n, int a, int b, int c, int d, char[] s) {\n\t\tN = n;\n\t\tA = a;\n\t\tB = b;\n\t\tC = c;\n\t\tD = d;\n\t\tS = s;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tMain m;\n\t\ttry (Scanner s = new Scanner(System.in)) {\n\t\t\tm = new Main(s.nextInt(),\n\t\t\t\t\ts.nextInt(),\n\t\t\t\t\ts.nextInt(),\n\t\t\t\t\ts.nextInt(),\n\t\t\t\t\ts.nextInt(),\n\t\t\t\t\ts.next().toCharArray());\n\t\t}\n\n\t\tif (m.move(m.A, m.B)) {\n\t\t\tSystem.out.println(\"Yes\");\n\t\t} else {\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n\n\tboolean move(int a, int b) {\n\t\tif (a == C && b == D) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (checked.contains(a + \",\" + b)) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (a > C) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (b > D) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (a == b) {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (S[b - 1] == '#') {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (S[a - 1] == '#') {\n\t\t\treturn false;\n\t\t}\n\n\t\tboolean x = move(a + 2, b);\n\t\tif (!x) {\n\t\t\tchecked.contains((a + 2) + \",\" + b);\n\t\t\tx = move(a, b + 2);\n\t\t}\n\t\tif (!x) {\n\t\t\tchecked.contains(a + \",\" + (b + 2));\n\t\t\tx = move(a + 1, b);\n\t\t}\n\t\tif (!x) {\n\t\t\tchecked.contains((a + 1) + \",\" + b);\n\t\t\tx = move(a, b + 1);\n\t\t}\n\t\tif (!x) {\n\t\t\tchecked.contains(a + \",\" + (b + 1));\n\t\t}\n\t\treturn x;\n\t}\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "sample_input": "7 1 3 6 7\n.#..#..\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03017", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1323, "cpu_time_ms": 2111, "memory_kb": 343280}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s483841588", "group_id": "codeNet:p03017", "input_text": "// https://atcoder.jp/contests/agc034/tasks/agc034_a\n\nimport java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n int D = sc.nextInt();\n String S = sc.next();\n sc.close();\n boolean pass = true;\n for (int i=B;iD){\n if (i==D-1){\n if (s1.equals(\"#\") || s3.equals(\"#\")){\n pass = false;\n break;\n }\n }\n if (s1.equals(\".\") && s2.equals(\".\") && s3.equals(\".\")){\n pass = true;\n break;\n } else {\n pass = false;\n }\n }\n }\n if (pass){\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}", "language": "Java", "metadata": {"date": 1559526920, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03017.html", "problem_id": "p03017", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03017/input.txt", "sample_output_relpath": "derived/input_output/data/p03017/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03017/Java/s483841588.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s483841588", "user_id": "u807028974"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "// https://atcoder.jp/contests/agc034/tasks/agc034_a\n\nimport java.util.Scanner;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int A = sc.nextInt();\n int B = sc.nextInt();\n int C = sc.nextInt();\n int D = sc.nextInt();\n String S = sc.next();\n sc.close();\n boolean pass = true;\n for (int i=B;iD){\n if (i==D-1){\n if (s1.equals(\"#\") || s3.equals(\"#\")){\n pass = false;\n break;\n }\n }\n if (s1.equals(\".\") && s2.equals(\".\") && s3.equals(\".\")){\n pass = true;\n break;\n } else {\n pass = false;\n }\n }\n }\n if (pass){\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "sample_input": "7 1 3 6 7\n.#..#..\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03017", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1495, "cpu_time_ms": 207, "memory_kb": 42416}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s155600453", "group_id": "codeNet:p03023", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t//n角形のnの取得\n\t\tint n = scan.nextInt();\n //n角形の内角の和\n int ans = (n-2) * 180;\n \tSystem.out.println(ans);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1559441127, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03023.html", "problem_id": "p03023", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03023/input.txt", "sample_output_relpath": "derived/input_output/data/p03023/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03023/Java/s155600453.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s155600453", "user_id": "u985272901"}, "prompt_components": {"gold_output": "180\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t//n角形のnの取得\n\t\tint n = scan.nextInt();\n //n角形の内角の和\n int ans = (n-2) * 180;\n \tSystem.out.println(ans);\n\t}\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer N not less than 3, find the sum of the interior angles of a regular polygon with N sides.\n\nPrint the answer in degrees, but do not print units.\n\nConstraints\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint an integer representing the sum of the interior angles of a regular polygon with N sides.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n180\n\nThe sum of the interior angles of a regular triangle is 180 degrees.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n17640", "sample_input": "3\n"}, "reference_outputs": ["180\n"], "source_document_id": "p03023", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer N not less than 3, find the sum of the interior angles of a regular polygon with N sides.\n\nPrint the answer in degrees, but do not print units.\n\nConstraints\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint an integer representing the sum of the interior angles of a regular polygon with N sides.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n180\n\nThe sum of the interior angles of a regular triangle is 180 degrees.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n17640", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 286, "cpu_time_ms": 109, "memory_kb": 20820}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s448162639", "group_id": "codeNet:p03023", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n\n System.out.println(180 * (n - 2));\n }\n}\n", "language": "Java", "metadata": {"date": 1559437323, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03023.html", "problem_id": "p03023", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03023/input.txt", "sample_output_relpath": "derived/input_output/data/p03023/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03023/Java/s448162639.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s448162639", "user_id": "u387806792"}, "prompt_components": {"gold_output": "180\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n\n System.out.println(180 * (n - 2));\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer N not less than 3, find the sum of the interior angles of a regular polygon with N sides.\n\nPrint the answer in degrees, but do not print units.\n\nConstraints\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint an integer representing the sum of the interior angles of a regular polygon with N sides.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n180\n\nThe sum of the interior angles of a regular triangle is 180 degrees.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n17640", "sample_input": "3\n"}, "reference_outputs": ["180\n"], "source_document_id": "p03023", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer N not less than 3, find the sum of the interior angles of a regular polygon with N sides.\n\nPrint the answer in degrees, but do not print units.\n\nConstraints\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint an integer representing the sum of the interior angles of a regular polygon with N sides.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n180\n\nThe sum of the interior angles of a regular triangle is 180 degrees.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n17640", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 110, "memory_kb": 19668}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s993449731", "group_id": "codeNet:p03027", "input_text": "import java.util.*;\n\npublic class Main {\n public static long MOD = (long)Math.pow(10, 6) + 3;\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long[] kai = new long[(int)MOD];\n long[] inkai = new long[(int)MOD];\n long[] in = new long[(int)MOD];\n kai[0] = 1;\n kai[1] = 1;\n inkai[0] = 1;\n inkai[1] = 1;\n in[1] = 1;\n for(long i = 2; i < MOD; i++) {\n kai[(int)i] = (i * kai[(int)i - 1]) % MOD;\n inkai[(int)i] = func(kai[(int)i], MOD - 2);\n in[(int)i] = func(i, MOD - 2);\n }\n int q = sc.nextInt();\n for(int i = 0; i < q; i++) {\n long x = sc.nextLong();\n long d = sc.nextLong();\n long n = sc.nextLong();\n long ans = 0;\n if(d == 0) {\n if(x == 0) {\n ans = 0;\n } else {\n ans = func(x, n % (MOD - 1));\n }\n } else {\n x = (x * in[(int)d]) % MOD;\n if(x == 0) {\n ans = 0;\n } else {\n if((int)(x + n - 1) >= MOD) {\n ans = 0;\n } else {\n long t = func(d, n % (MOD - 1));\n ans = (((kai[(int)(x + n - 1)] * inkai[(int)(x - 1)]) % MOD) * t) % MOD;\n }\n }\n }\n System.out.println(ans);\n }\n }\n\n public static long func(long a, long x) {\n if(x == 0) return 1;\n if(x >= 1) {\n if(x % 2 == 0) {\n long t = func(a, x / 2);\n return (t * t) % MOD;\n } else {\n long t = func(a, x - 1);\n return (a * t) % MOD;\n }\n }\n return 0;\n } \n}", "language": "Java", "metadata": {"date": 1559529596, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03027.html", "problem_id": "p03027", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03027/input.txt", "sample_output_relpath": "derived/input_output/data/p03027/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03027/Java/s993449731.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s993449731", "user_id": "u653981267"}, "prompt_components": {"gold_output": "9009\n916936\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static long MOD = (long)Math.pow(10, 6) + 3;\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long[] kai = new long[(int)MOD];\n long[] inkai = new long[(int)MOD];\n long[] in = new long[(int)MOD];\n kai[0] = 1;\n kai[1] = 1;\n inkai[0] = 1;\n inkai[1] = 1;\n in[1] = 1;\n for(long i = 2; i < MOD; i++) {\n kai[(int)i] = (i * kai[(int)i - 1]) % MOD;\n inkai[(int)i] = func(kai[(int)i], MOD - 2);\n in[(int)i] = func(i, MOD - 2);\n }\n int q = sc.nextInt();\n for(int i = 0; i < q; i++) {\n long x = sc.nextLong();\n long d = sc.nextLong();\n long n = sc.nextLong();\n long ans = 0;\n if(d == 0) {\n if(x == 0) {\n ans = 0;\n } else {\n ans = func(x, n % (MOD - 1));\n }\n } else {\n x = (x * in[(int)d]) % MOD;\n if(x == 0) {\n ans = 0;\n } else {\n if((int)(x + n - 1) >= MOD) {\n ans = 0;\n } else {\n long t = func(d, n % (MOD - 1));\n ans = (((kai[(int)(x + n - 1)] * inkai[(int)(x - 1)]) % MOD) * t) % MOD;\n }\n }\n }\n System.out.println(ans);\n }\n }\n\n public static long func(long a, long x) {\n if(x == 0) return 1;\n if(x >= 1) {\n if(x % 2 == 0) {\n long t = func(a, x / 2);\n return (t * t) % MOD;\n } else {\n long t = func(a, x - 1);\n return (a * t) % MOD;\n }\n }\n return 0;\n } \n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nConsider the following arithmetic progression with n terms:\n\nx, x + d, x + 2d, \\ldots, x + (n-1)d\n\nWhat is the product of all terms in this sequence?\nCompute the answer modulo 1\\ 000\\ 003.\n\nYou are given Q queries of this form.\nIn the i-th query, compute the answer in case x = x_i, d = d_i, n = n_i.\n\nConstraints\n\n1 \\leq Q \\leq 10^5\n\n0 \\leq x_i, d_i \\leq 1\\ 000\\ 002\n\n1 \\leq n_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nx_1 d_1 n_1\n:\nx_Q d_Q n_Q\n\nOutput\n\nPrint Q lines.\n\nIn the i-th line, print the answer for the i-th query.\n\nSample Input 1\n\n2\n7 2 4\n12345 67890 2019\n\nSample Output 1\n\n9009\n916936\n\nFor the first query, the answer is 7 \\times 9 \\times 11 \\times 13 = 9009.\nDon't forget to compute the answer modulo 1\\ 000\\ 003.", "sample_input": "2\n7 2 4\n12345 67890 2019\n"}, "reference_outputs": ["9009\n916936\n"], "source_document_id": "p03027", "source_text": "Score : 600 points\n\nProblem Statement\n\nConsider the following arithmetic progression with n terms:\n\nx, x + d, x + 2d, \\ldots, x + (n-1)d\n\nWhat is the product of all terms in this sequence?\nCompute the answer modulo 1\\ 000\\ 003.\n\nYou are given Q queries of this form.\nIn the i-th query, compute the answer in case x = x_i, d = d_i, n = n_i.\n\nConstraints\n\n1 \\leq Q \\leq 10^5\n\n0 \\leq x_i, d_i \\leq 1\\ 000\\ 002\n\n1 \\leq n_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nx_1 d_1 n_1\n:\nx_Q d_Q n_Q\n\nOutput\n\nPrint Q lines.\n\nIn the i-th line, print the answer for the i-th query.\n\nSample Input 1\n\n2\n7 2 4\n12345 67890 2019\n\nSample Output 1\n\n9009\n916936\n\nFor the first query, the answer is 7 \\times 9 \\times 11 \\times 13 = 9009.\nDon't forget to compute the answer modulo 1\\ 000\\ 003.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1521, "cpu_time_ms": 2109, "memory_kb": 113588}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s931902005", "group_id": "codeNet:p03031", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic int n, m;\n\tstatic int[][] swi;\n\n\tstatic int[] p = new int[10];//m個\n\tstatic int count = 0;\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tn = Integer.parseInt(sc.next());\n\t\tm = Integer.parseInt(sc.next());\n\t\tswi = new int[m][n + 1];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint k = Integer.parseInt(sc.next());\n\t\t\tswi[i][0] = k;\n\t\t\tfor (int j = 1; j < k + 1; j++) {\n\t\t\t\tswi[i][j] = Integer.parseInt(sc.next());\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tp[i] = Integer.parseInt(sc.next());\n\t\t}\n\n\t\tdfs(0, new int[n]);\n\t\tSystem.out.println(count);\n\n\t}\n\n\tstatic void dfs(int i, int[] onOff) {\n\t\tif (i == n) {\n\t\t\tif (isLightAll(onOff))\n\t\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\n\t\tdfs(i + 1, rtnArr(onOff, i, true));\n\t\tdfs(i + 1, rtnArr(onOff, i, false));\n\t}\n\n\tstatic int[] rtnArr(int[] a1, int i, boolean b) {\n\t\tint[] a2 = Arrays.copyOf(a1, n);\n\t\ta2[i] = b ? 1 : 0;\n\t\treturn a2;\n\t}\n\n\tstatic boolean isLightAll(int[] onOff) {\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 1; j < swi[i][0] + 1; j++) {\n\t\t\t\tsum += onOff[swi[i][j] - 1];\n\t\t\t}\n\t\t\tif (sum % 2 != p[i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1568988827, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03031.html", "problem_id": "p03031", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03031/input.txt", "sample_output_relpath": "derived/input_output/data/p03031/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03031/Java/s931902005.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s931902005", "user_id": "u684504044"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tstatic int n, m;\n\tstatic int[][] swi;\n\n\tstatic int[] p = new int[10];//m個\n\tstatic int count = 0;\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tn = Integer.parseInt(sc.next());\n\t\tm = Integer.parseInt(sc.next());\n\t\tswi = new int[m][n + 1];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint k = Integer.parseInt(sc.next());\n\t\t\tswi[i][0] = k;\n\t\t\tfor (int j = 1; j < k + 1; j++) {\n\t\t\t\tswi[i][j] = Integer.parseInt(sc.next());\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tp[i] = Integer.parseInt(sc.next());\n\t\t}\n\n\t\tdfs(0, new int[n]);\n\t\tSystem.out.println(count);\n\n\t}\n\n\tstatic void dfs(int i, int[] onOff) {\n\t\tif (i == n) {\n\t\t\tif (isLightAll(onOff))\n\t\t\t\tcount++;\n\t\t\treturn;\n\t\t}\n\n\t\tdfs(i + 1, rtnArr(onOff, i, true));\n\t\tdfs(i + 1, rtnArr(onOff, i, false));\n\t}\n\n\tstatic int[] rtnArr(int[] a1, int i, boolean b) {\n\t\tint[] a2 = Arrays.copyOf(a1, n);\n\t\ta2[i] = b ? 1 : 0;\n\t\treturn a2;\n\t}\n\n\tstatic boolean isLightAll(int[] onOff) {\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 1; j < swi[i][0] + 1; j++) {\n\t\t\t\tsum += onOff[swi[i][j] - 1];\n\t\t\t}\n\t\t\tif (sum % 2 != p[i])\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N switches with \"on\" and \"off\" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.\n\nBulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are \"on\" among these switches is congruent to p_i modulo 2.\n\nHow many combinations of \"on\" and \"off\" states of the switches light all the bulbs?\n\nConstraints\n\n1 \\leq N, M \\leq 10\n\n1 \\leq k_i \\leq N\n\n1 \\leq s_{ij} \\leq N\n\ns_{ia} \\neq s_{ib} (a \\neq b)\n\np_i is 0 or 1.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nk_1 s_{11} s_{12} ... s_{1k_1}\n:\nk_M s_{M1} s_{M2} ... s_{Mk_M}\np_1 p_2 ... p_M\n\nOutput\n\nPrint the number of combinations of \"on\" and \"off\" states of the switches that light all the bulbs.\n\nSample Input 1\n\n2 2\n2 1 2\n1 2\n0 1\n\nSample Output 1\n\n1\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on, on), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all the bulbs, so we should print 1.\n\nSample Input 2\n\n2 3\n2 1 2\n1 1\n1 2\n0 0 1\n\nSample Output 2\n\n0\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n\nBulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light Bulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations of states of the switches that light all the bulbs, so we should print 0.\n\nSample Input 3\n\n5 2\n3 1 2 5\n2 2 3\n1 0\n\nSample Output 3\n\n8", "sample_input": "2 2\n2 1 2\n1 2\n0 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03031", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N switches with \"on\" and \"off\" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.\n\nBulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are \"on\" among these switches is congruent to p_i modulo 2.\n\nHow many combinations of \"on\" and \"off\" states of the switches light all the bulbs?\n\nConstraints\n\n1 \\leq N, M \\leq 10\n\n1 \\leq k_i \\leq N\n\n1 \\leq s_{ij} \\leq N\n\ns_{ia} \\neq s_{ib} (a \\neq b)\n\np_i is 0 or 1.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nk_1 s_{11} s_{12} ... s_{1k_1}\n:\nk_M s_{M1} s_{M2} ... s_{Mk_M}\np_1 p_2 ... p_M\n\nOutput\n\nPrint the number of combinations of \"on\" and \"off\" states of the switches that light all the bulbs.\n\nSample Input 1\n\n2 2\n2 1 2\n1 2\n0 1\n\nSample Output 1\n\n1\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on, on), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all the bulbs, so we should print 1.\n\nSample Input 2\n\n2 3\n2 1 2\n1 1\n1 2\n0 0 1\n\nSample Output 2\n\n0\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n\nBulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light Bulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations of states of the switches that light all the bulbs, so we should print 0.\n\nSample Input 3\n\n5 2\n3 1 2 5\n2 2 3\n1 0\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1219, "cpu_time_ms": 109, "memory_kb": 23636}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s677222879", "group_id": "codeNet:p03036", "input_text": "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\n\t\tint r = sc.nextInt();\n\t\n\t\tint D = sc.nextInt();\n\t\tint x2000 = sc.nextInt();\n \tint x = r*x2000 -D;\n \n for(int i=1;i<=10;i++){\n x = r*x2000 - D;\n System.out.print(x);\n }\n\t\n\t\t\n\n\t}\n}", "language": "Java", "metadata": {"date": 1574732309, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03036.html", "problem_id": "p03036", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03036/input.txt", "sample_output_relpath": "derived/input_output/data/p03036/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03036/Java/s677222879.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s677222879", "user_id": "u462723267"}, "prompt_components": {"gold_output": "30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\n\t\tint r = sc.nextInt();\n\t\n\t\tint D = sc.nextInt();\n\t\tint x2000 = sc.nextInt();\n \tint x = r*x2000 -D;\n \n for(int i=1;i<=10;i++){\n x = r*x2000 - D;\n System.out.print(x);\n }\n\t\n\t\t\n\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "sample_input": "2 10 20\n"}, "reference_outputs": ["30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n"], "source_document_id": "p03036", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 336, "cpu_time_ms": 93, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s824007244", "group_id": "codeNet:p03037", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc =new Scanner(System.in);\n\n\t\tint card = sc.nextInt();\n\t\tint gate = sc.nextInt();\n\t\tint min = 100000;\n\t\tint max = 0;\n\n\t\tint[] L = new int[gate];\n\t\tint[] R = new int[gate];\n\t\tfor(int i = 0; i[] adjList;\n\tstatic boolean[] vis;\n\tstatic int[] color;\n\t\n\tpublic static void dfs(int u) {\n\t\tvis[u] = true;\n\t\t\n\t\tfor(Pair p : adjList[u]) {\n\t\t\tif(!vis[p.v]) {\n\t\t\t\tcolor[p.v] = p.w % 2 == 0 ? color[u] : 1 - color[u];\n\t\t\t\tdfs(p.v);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\tadjList = new ArrayList[n];\n\t\tfor(int i = 0; i < adjList.length; i++)\n\t\t\tadjList[i] = new ArrayList();\n\t\t\n\t\tfor(int i = 0; i < n - 1; i++) {\n\t\t\tint u = sc.nextInt(), v = sc.nextInt(), w = sc.nextInt();\n\t\t\tadjList[u - 1].add(new Pair(v - 1, w));\n\t\t\tadjList[v - 1].add(new Pair(u - 1, w));\n\t\t}\n\t\t\n\t\tvis = new boolean[n];\n\t\tcolor = new int[n];\n\t\t\n\t\tdfs(0);\n\t\tfor(int i = 0; i < color.length; i++)\n\t\t\tSystem.out.println(color[i]);\n\t}\n\t\n\tpublic static class Pair implements Comparable{\n\t\tint v, w;\n\t\t\n\t\tpublic Pair(int v) {\n\t\t\tthis.v = v;\n\t\t}\n\t\t\n\t\tpublic Pair(int v, int w) {\n\t\t\tthis(v);\n\t\t\tthis.w = w;\n\t\t}\n\t\t\n\t\tpublic int compareTo(Pair p) {\n\t\t\tif(this.w == p.w)\n\t\t\t\treturn this.v - p.v;\n\t\t\treturn this.w - p.w;\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1558316189, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03044.html", "problem_id": "p03044", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03044/input.txt", "sample_output_relpath": "derived/input_output/data/p03044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03044/Java/s700534163.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s700534163", "user_id": "u310087127"}, "prompt_components": {"gold_output": "0\n0\n1\n", "input_to_evaluate": "import java.util.Scanner;\nimport java.util.ArrayList;\n\npublic class Main {\n\t\n\tstatic ArrayList[] adjList;\n\tstatic boolean[] vis;\n\tstatic int[] color;\n\t\n\tpublic static void dfs(int u) {\n\t\tvis[u] = true;\n\t\t\n\t\tfor(Pair p : adjList[u]) {\n\t\t\tif(!vis[p.v]) {\n\t\t\t\tcolor[p.v] = p.w % 2 == 0 ? color[u] : 1 - color[u];\n\t\t\t\tdfs(p.v);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\tadjList = new ArrayList[n];\n\t\tfor(int i = 0; i < adjList.length; i++)\n\t\t\tadjList[i] = new ArrayList();\n\t\t\n\t\tfor(int i = 0; i < n - 1; i++) {\n\t\t\tint u = sc.nextInt(), v = sc.nextInt(), w = sc.nextInt();\n\t\t\tadjList[u - 1].add(new Pair(v - 1, w));\n\t\t\tadjList[v - 1].add(new Pair(u - 1, w));\n\t\t}\n\t\t\n\t\tvis = new boolean[n];\n\t\tcolor = new int[n];\n\t\t\n\t\tdfs(0);\n\t\tfor(int i = 0; i < color.length; i++)\n\t\t\tSystem.out.println(color[i]);\n\t}\n\t\n\tpublic static class Pair implements Comparable{\n\t\tint v, w;\n\t\t\n\t\tpublic Pair(int v) {\n\t\t\tthis.v = v;\n\t\t}\n\t\t\n\t\tpublic Pair(int v, int w) {\n\t\t\tthis(v);\n\t\t\tthis.w = w;\n\t\t}\n\t\t\n\t\tpublic int compareTo(Pair p) {\n\t\t\tif(this.w == p.w)\n\t\t\t\treturn this.v - p.v;\n\t\t\treturn this.w - p.w;\n\t\t}\n\t}\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N.\nThe i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i.\nYour objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:\n\nFor any two vertices painted in the same color, the distance between them is an even number.\n\nFind a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq u_i < v_i \\leq N\n\n1 \\leq w_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1 w_1\nu_2 v_2 w_2\n.\n.\n.\nu_{N - 1} v_{N - 1} w_{N - 1}\n\nOutput\n\nPrint a coloring of the vertices that satisfies the condition, in N lines.\nThe i-th line should contain 0 if Vertex i is painted white and 1 if it is painted black.\n\nIf there are multiple colorings that satisfy the condition, any of them will be accepted.\n\nSample Input 1\n\n3\n1 2 2\n2 3 1\n\nSample Output 1\n\n0\n0\n1\n\nSample Input 2\n\n5\n2 5 2\n2 3 10\n1 3 8\n3 4 2\n\nSample Output 2\n\n1\n0\n1\n0\n1", "sample_input": "3\n1 2 2\n2 3 1\n"}, "reference_outputs": ["0\n0\n1\n"], "source_document_id": "p03044", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N.\nThe i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i.\nYour objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:\n\nFor any two vertices painted in the same color, the distance between them is an even number.\n\nFind a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq u_i < v_i \\leq N\n\n1 \\leq w_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1 w_1\nu_2 v_2 w_2\n.\n.\n.\nu_{N - 1} v_{N - 1} w_{N - 1}\n\nOutput\n\nPrint a coloring of the vertices that satisfies the condition, in N lines.\nThe i-th line should contain 0 if Vertex i is painted white and 1 if it is painted black.\n\nIf there are multiple colorings that satisfy the condition, any of them will be accepted.\n\nSample Input 1\n\n3\n1 2 2\n2 3 1\n\nSample Output 1\n\n0\n0\n1\n\nSample Input 2\n\n5\n2 5 2\n2 3 10\n1 3 8\n3 4 2\n\nSample Output 2\n\n1\n0\n1\n0\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1183, "cpu_time_ms": 1145, "memory_kb": 114196}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s900572277", "group_id": "codeNet:p03047", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc= new Scanner(System.in);\n\n int numbers = sc.nextInt();\n int end = sc.nextInt();\n int count = 0;\n\n while(end<=numbers){\n count++;\n end++;\n }\n\n System.out.println(count);\n }\n}", "language": "Java", "metadata": {"date": 1558319313, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03047.html", "problem_id": "p03047", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03047/input.txt", "sample_output_relpath": "derived/input_output/data/p03047/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03047/Java/s900572277.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s900572277", "user_id": "u013378977"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc= new Scanner(System.in);\n\n int numbers = sc.nextInt();\n int end = sc.nextInt();\n int count = 0;\n\n while(end<=numbers){\n count++;\n end++;\n }\n\n System.out.println(count);\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has N integers: 1,2,\\ldots,N.\nHe will choose K of them and give those to Takahashi.\n\nHow many ways are there to choose K consecutive integers?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K \\leq N \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2\n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\nSample Input 2\n\n13 3\n\nSample Output 2\n\n11", "sample_input": "3 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03047", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has N integers: 1,2,\\ldots,N.\nHe will choose K of them and give those to Takahashi.\n\nHow many ways are there to choose K consecutive integers?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K \\leq N \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2\n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\nSample Input 2\n\n13 3\n\nSample Output 2\n\n11", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 345, "cpu_time_ms": 93, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s369351767", "group_id": "codeNet:p03047", "input_text": "import java.io.*;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport java.util.stream.Collectors;\n\n@SuppressWarnings(\"unused\")\npublic class Main {\n\t\n\t//final boolean isDebug = true;\n\tfinal boolean isDebug = false;\n\tString fileName = \"input.txt\";\n\tFastScanner sc;\n\tPrintWriter out;\n\tfinal int MOD = (int)1e9+7;\n\tfinal int INF = Integer.MAX_VALUE / 2;\n\t\n\tvoid solve() throws Exception{\n\t\tSystem.out.println((sc.nextInt() - sc.nextInt() + 1));\n\t}\n\t\n\t/* end solve */\n\t\n\t/* main */\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().m();\n\t}\n\t\n\tvoid m() throws Exception {\n\t\tlong S = System.currentTimeMillis();\n\t\tsc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\tif(isDebug){\n\t\t\tSystem.out.println(\"---Debug---\");\n\t\t\tSystem.out.printf(\"%8d ms\\n\", (G-S));\n\t\t}\n\t}\n\t/* end main */\n}\n/* end Main */\n\nclass Pair{\n\tint x, y;\n\tpublic Pair(int y, int x){\n\t\tthis.x = x; this.y = y;\n\t}\n}\n\nclass FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() {\n \tif (hasNextByte()) return buffer[ptr++];\n \telse return -1;\n }\n private static boolean isPrintableChar(int c){\n \treturn 33 <= c && c <= 126;\n }\n public boolean hasNext() {\n \twhile(hasNextByte() && !isPrintableChar(buffer[ptr]))\n \t\tptr++; return hasNextByte();\n }\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public String nextLine() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(b != 10) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n}", "language": "Java", "metadata": {"date": 1557655253, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03047.html", "problem_id": "p03047", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03047/input.txt", "sample_output_relpath": "derived/input_output/data/p03047/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03047/Java/s369351767.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s369351767", "user_id": "u234826697"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nimport java.util.Map.Entry;\nimport java.util.stream.Collectors;\n\n@SuppressWarnings(\"unused\")\npublic class Main {\n\t\n\t//final boolean isDebug = true;\n\tfinal boolean isDebug = false;\n\tString fileName = \"input.txt\";\n\tFastScanner sc;\n\tPrintWriter out;\n\tfinal int MOD = (int)1e9+7;\n\tfinal int INF = Integer.MAX_VALUE / 2;\n\t\n\tvoid solve() throws Exception{\n\t\tSystem.out.println((sc.nextInt() - sc.nextInt() + 1));\n\t}\n\t\n\t/* end solve */\n\t\n\t/* main */\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().m();\n\t}\n\t\n\tvoid m() throws Exception {\n\t\tlong S = System.currentTimeMillis();\n\t\tsc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\tif(isDebug){\n\t\t\tSystem.out.println(\"---Debug---\");\n\t\t\tSystem.out.printf(\"%8d ms\\n\", (G-S));\n\t\t}\n\t}\n\t/* end main */\n}\n/* end Main */\n\nclass Pair{\n\tint x, y;\n\tpublic Pair(int y, int x){\n\t\tthis.x = x; this.y = y;\n\t}\n}\n\nclass FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() {\n \tif (hasNextByte()) return buffer[ptr++];\n \telse return -1;\n }\n private static boolean isPrintableChar(int c){\n \treturn 33 <= c && c <= 126;\n }\n public boolean hasNext() {\n \twhile(hasNextByte() && !isPrintableChar(buffer[ptr]))\n \t\tptr++; return hasNextByte();\n }\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public String nextLine() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(b != 10) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has N integers: 1,2,\\ldots,N.\nHe will choose K of them and give those to Takahashi.\n\nHow many ways are there to choose K consecutive integers?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K \\leq N \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2\n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\nSample Input 2\n\n13 3\n\nSample Output 2\n\n11", "sample_input": "3 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03047", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has N integers: 1,2,\\ldots,N.\nHe will choose K of them and give those to Takahashi.\n\nHow many ways are there to choose K consecutive integers?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K \\leq N \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2\n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\nSample Input 2\n\n13 3\n\nSample Output 2\n\n11", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3525, "cpu_time_ms": 69, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s550492207", "group_id": "codeNet:p03049", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n String[] wordArr = new String[N];\n for (int i = 0; i < N; i++) {\n wordArr[i] = sc.next();\n }\n long lastA = Arrays.stream(wordArr).filter(s -> s.endsWith(\"A\")).count(); // O(N)\n long startB = Arrays.stream(wordArr).filter(s -> s.startsWith(\"B\")).count(); // O(N)\n long containsAB = Arrays.stream(wordArr).filter(s -> s.contains(\"AB\")).count(); // O(N)\n\n long min = Math.min(lastA, startB);\n\n if (lastA < 1 || startB < 1) {\n System.out.println(containsAB);\n } else {\n System.out.println(containsAB + min);\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1557688448, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03049.html", "problem_id": "p03049", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03049/input.txt", "sample_output_relpath": "derived/input_output/data/p03049/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03049/Java/s550492207.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s550492207", "user_id": "u701531204"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n String[] wordArr = new String[N];\n for (int i = 0; i < N; i++) {\n wordArr[i] = sc.next();\n }\n long lastA = Arrays.stream(wordArr).filter(s -> s.endsWith(\"A\")).count(); // O(N)\n long startB = Arrays.stream(wordArr).filter(s -> s.startsWith(\"B\")).count(); // O(N)\n long containsAB = Arrays.stream(wordArr).filter(s -> s.contains(\"AB\")).count(); // O(N)\n\n long min = Math.min(lastA, startB);\n\n if (lastA < 1 || startB < 1) {\n System.out.println(containsAB);\n } else {\n System.out.println(containsAB + min);\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "sample_input": "3\nABCA\nXBAZ\nBAD\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03049", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 813, "cpu_time_ms": 340, "memory_kb": 32744}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s090525316", "group_id": "codeNet:p03050", "input_text": "import java.io.*;\nimport java.util.ArrayList;\n\nclass Main{\n public static void main(String[] args) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String str = br.readLine();\n long N = Long.parseLong(str);\n ArrayList num = new ArrayList<>();\n long div;\n for (int i=1;i num = new ArrayList<>();\n long div;\n for (int i=1;i=i*a){\n ans += b;\n }\n }\n System.out.println(ans);\n }\n}\n", "language": "Java", "metadata": {"date": 1556413667, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03059.html", "problem_id": "p03059", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03059/input.txt", "sample_output_relpath": "derived/input_output/data/p03059/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03059/Java/s996875577.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s996875577", "user_id": "u527616458"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int t = sc.nextInt();\n int ans = 0;\n \n for(int i=1;i<=t;i++){\n if(t>=i*a){\n ans += b;\n }\n }\n System.out.println(ans);\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "sample_input": "3 5 7\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03059", "source_text": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 125, "memory_kb": 23508}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s240270466", "group_id": "codeNet:p03060", "input_text": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n \n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\tint []v = new int [n];\n\t\tint []c = new int [n];\n\t\tint []a = new int [n];\n\t\t\n\t\tfor(int i = 0; i < n;i++) {\n\t\t\tv[i] = sc.nextInt();\n\t\t}\n\t\tfor(int j = 0; j < n; j++) {\n\t\t\tc[j] = sc.nextInt();\n\t\t\ta[j] = v[j] - c[j];\n\t\t}\t\t\n\t\tint ans = 0;\n\t\tfor(int i = 0; i < n ; i++) {\n\t\t\tif (a[i] >= 0) {\n\t\t\t\tans += a[i];\n\t\t\t}\n\t\t\t\t\n\t\t}\n\t\tSystem.out.println(ans);\n\t\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1560978540, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03060.html", "problem_id": "p03060", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03060/input.txt", "sample_output_relpath": "derived/input_output/data/p03060/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03060/Java/s240270466.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s240270466", "user_id": "u920212194"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n \n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\tint []v = new int [n];\n\t\tint []c = new int [n];\n\t\tint []a = new int [n];\n\t\t\n\t\tfor(int i = 0; i < n;i++) {\n\t\t\tv[i] = sc.nextInt();\n\t\t}\n\t\tfor(int j = 0; j < n; j++) {\n\t\t\tc[j] = sc.nextInt();\n\t\t\ta[j] = v[j] - c[j];\n\t\t}\t\t\n\t\tint ans = 0;\n\t\tfor(int i = 0; i < n ; i++) {\n\t\t\tif (a[i] >= 0) {\n\t\t\t\tans += a[i];\n\t\t\t}\n\t\t\t\t\n\t\t}\n\t\tSystem.out.println(ans);\n\t\n\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "sample_input": "3\n10 2 5\n6 3 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03060", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 516, "cpu_time_ms": 104, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s001924904", "group_id": "codeNet:p03062", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.NoSuchElementException;\n\n\npublic class Main{\n\tstatic FastScanner sc = new FastScanner();\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\t//static String S;\n\t//static int h;\n\t//static int w;\n\tstatic int n;\n\n\t\n\tpublic static void main(String[] args) {\n\t\tn = sc.nextInt();\n\t\t\n\t\tlong a [] = sc.nextLongArray(n, false);\n\t\t\n\t\tif (n==2) {\n\t\t\tout.println(Math.min(a[0]+a[1], -a[0]-a[1]));\n\t\t}\n\t\t\n\t\telse {\n\t\t\tlong ans = 0;\n\t\t\t\n\t\t\tArrays.sort(a);\n\t\t\t\n\t\t\tlong aa = 0;\n\t\t\tlong bb = 0;\n\t\t\tint ind = 0;\n\t\t\t\n\t\t\tfor (int i=0; ip=new ArrayList<>();\n\t\tListm=new ArrayList<>();\n\t\tlong ans=0;\n\t\tfor(int i=0;i=0){\n\t\t\t\tp.add(a);\n\t\t\t}else{\n\t\t\t\tm.add(-a);\n\t\t\t}\n\t\t}\n\t\tif(m.size()%2==0){\n\t\t\tSystem.out.println(ans);\n\t\t\treturn;\n\t\t}\n\t\tCollections.sort(p);\n\t\tCollections.sort(m);\n\t\tif(p.get(0) Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}\n", "language": "Java", "metadata": {"date": 1556467390, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03062.html", "problem_id": "p03062", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03062/input.txt", "sample_output_relpath": "derived/input_output/data/p03062/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03062/Java/s651867595.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s651867595", "user_id": "u367107084"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tFastScanner scanner = new FastScanner();\n\t\tint n=scanner.nextInt();\n\t\tListp=new ArrayList<>();\n\t\tListm=new ArrayList<>();\n\t\tlong ans=0;\n\t\tfor(int i=0;i=0){\n\t\t\t\tp.add(a);\n\t\t\t}else{\n\t\t\t\tm.add(-a);\n\t\t\t}\n\t\t}\n\t\tif(m.size()%2==0){\n\t\t\tSystem.out.println(ans);\n\t\t\treturn;\n\t\t}\n\t\tCollections.sort(p);\n\t\tCollections.sort(m);\n\t\tif(p.get(0) Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3\n-10 5 -4\n"}, "reference_outputs": ["19\n"], "source_document_id": "p03062", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2961, "cpu_time_ms": 205, "memory_kb": 29684}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s812928324", "group_id": "codeNet:p03062", "input_text": "import java.io.*;\nimport java.util.Map;\n\n/**\n * Copyright © 2018 Chris. All rights reserved.\n *\n * @author Chris\n * 2018/7/9 15:33\n * @see format\n */\npublic class Main {\n\n private static BufferedReader br;\n private static StreamTokenizer st;\n private static PrintWriter pw;\n\n static final int INF = 1000000007;\n static int MOD = 1000000007;\n\n static int[] getBit(long num) {\n int bit[] = new int[40];\n int cur = 0;\n while (num > 0) {\n bit[cur++] = (int) (num & 1);\n num >>= 1;\n }\n return bit;\n }\n\n private static long[][] multiMatrix(long a[][], long b[][]) {\n long c[][] = new long[2][2];\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 2; k++) {\n c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % MOD;\n }\n }\n }\n return c;\n }\n\n private static long[][] powMatrix(long a[][], int k) {\n if (k == 1) {\n return a;\n }\n int r = k % 2;\n long c[][] = powMatrix(a, k / 2);\n c = multiMatrix(c, c);\n if (r == 1) {\n c = multiMatrix(a, c);\n }\n return c;\n }\n\n\n private static void solve() throws IOException {\n int n = nextInt();\n int a[] = new int[n];\n int cnt = 0;\n long sum = 0;\n int min = Integer.MAX_VALUE;\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n sum += Math.abs(a[i]);\n min = Math.min(min, Math.abs(a[i]));\n if (a[i] < 0) {\n cnt++;\n }\n }\n if (cnt % 2 == 1) {\n sum -= min << 1;\n }\n pw.println(sum);\n }\n\n static void swap(long a[], int i, int j) {\n a[i] ^= a[j];\n a[j] ^= a[i];\n a[i] ^= a[j];\n }\n\n static void swap(int a[], int i, int j) {\n a[i] ^= a[j];\n a[j] ^= a[i];\n a[i] ^= a[j];\n }\n\n static void getDiv(Map map, int n) {\n int sqrt = (int) Math.sqrt(n);\n for (int i = sqrt; i >= 2; i--) {\n if (n % i == 0) {\n getDiv(map, i);\n getDiv(map, n / i);\n return;\n }\n }\n map.put(n, map.getOrDefault(n, 0) + 1);\n }\n\n public static boolean[] generatePrime(int n) {\n boolean p[] = new boolean[n + 1];\n p[2] = true;\n\n for (int i = 3; i <= n; i += 2) {\n p[i] = true;\n }\n\n for (int i = 3; i <= Math.sqrt(n); i += 2) {\n if (!p[i]) {\n continue;\n }\n for (int j = i * i; j <= n; j += i << 1) {\n p[j] = false;\n }\n }\n return p;\n }\n\n static long llMod(long a, long b, long mod) {\n return (a * b - (long) ((double) a / mod * b + 0.5) * mod + mod) % mod;\n }\n\n static int pow(long a, long n) {\n long ans = 1;\n while (n > 0) {\n if ((n & 1) == 1) {\n ans = (ans * a) % MOD;\n }\n a = (a * a) % MOD;\n n >>= 1;\n }\n return (int) ans;\n }\n\n static int pow(long a, long n, long mod) {\n long ans = 1;\n while (n > 0) {\n if ((n & 1) == 1) {\n ans = llMod(ans, a, mod);\n }\n a = llMod(a, a, mod);\n n >>= 1;\n }\n return (int) ans;\n }\n\n private static long[][] initC(int n) {\n long c[][] = new long[n][n];\n\n for (int i = 0; i < n; i++) {\n c[i][0] = 1;\n }\n\n for (int i = 1; i < n; i++) {\n for (int j = 1; j <= i; j++) {\n c[i][j] = c[i - 1][j - 1] + c[i - 1][j];\n }\n }\n return c;\n }\n\n /**\n * ps: n >= m, choose m from n;\n */\n private static int c(long n, long m) {\n if (m > n) {\n n ^= m;\n m ^= n;\n n ^= m;\n }\n m = Math.min(m, n - m);\n\n long top = 1;\n long bot = 1;\n for (long i = n - m + 1; i <= n; i++) {\n top = (top * i) % MOD;\n }\n for (int i = 1; i <= m; i++) {\n bot = (bot * i) % MOD;\n }\n\n return (int) ((top * pow(bot, MOD - 2)) % MOD);\n }\n\n static int gcd(int a, int b) {\n if (a < b) {\n a ^= b;\n b ^= a;\n a ^= b;\n }\n while (b != 0) {\n int tmp = a % b;\n a = b;\n b = tmp;\n }\n return a;\n }\n\n static boolean even(long n) {\n return (n & 1) == 0;\n }\n\n public static void main(String args[]) throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n st = new StreamTokenizer(br);\n pw = new PrintWriter(new OutputStreamWriter(System.out));\n st.ordinaryChar('\\''); //指定单引号、双引号和注释符号是普通字符\n st.ordinaryChar('\\\"');\n st.ordinaryChar('/');\n\n solve();\n pw.flush();\n }\n\n static String next(int len) throws IOException {\n int b = br.read();\n while (b == '\\n' || b == ' ' || b == '\\r' || b == '\\t') {\n b = br.read();\n }\n char ch[] = new char[len];\n ch[0] = (char) b;\n int idx = 1;\n while (idx < len && (b = br.read()) != ' ' && b != '\\n' && b != '\\r' && b != '\\t') {\n ch[idx++] = (char) b;\n }\n return String.valueOf(ch).trim();\n }\n\n private static int nextInt() throws IOException {\n st.nextToken();\n return (int) st.nval;\n }\n\n private static double nextDouble() throws IOException {\n st.nextToken();\n return st.nval;\n }\n\n private static String[] nextSS(String reg) throws IOException {\n return br.readLine().split(reg);\n }\n\n private static String nextLine() throws IOException {\n return br.readLine();\n }\n}\n", "language": "Java", "metadata": {"date": 1556414919, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03062.html", "problem_id": "p03062", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03062/input.txt", "sample_output_relpath": "derived/input_output/data/p03062/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03062/Java/s812928324.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s812928324", "user_id": "u476021391"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "import java.io.*;\nimport java.util.Map;\n\n/**\n * Copyright © 2018 Chris. All rights reserved.\n *\n * @author Chris\n * 2018/7/9 15:33\n * @see format\n */\npublic class Main {\n\n private static BufferedReader br;\n private static StreamTokenizer st;\n private static PrintWriter pw;\n\n static final int INF = 1000000007;\n static int MOD = 1000000007;\n\n static int[] getBit(long num) {\n int bit[] = new int[40];\n int cur = 0;\n while (num > 0) {\n bit[cur++] = (int) (num & 1);\n num >>= 1;\n }\n return bit;\n }\n\n private static long[][] multiMatrix(long a[][], long b[][]) {\n long c[][] = new long[2][2];\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 2; k++) {\n c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % MOD;\n }\n }\n }\n return c;\n }\n\n private static long[][] powMatrix(long a[][], int k) {\n if (k == 1) {\n return a;\n }\n int r = k % 2;\n long c[][] = powMatrix(a, k / 2);\n c = multiMatrix(c, c);\n if (r == 1) {\n c = multiMatrix(a, c);\n }\n return c;\n }\n\n\n private static void solve() throws IOException {\n int n = nextInt();\n int a[] = new int[n];\n int cnt = 0;\n long sum = 0;\n int min = Integer.MAX_VALUE;\n for (int i = 0; i < n; i++) {\n a[i] = nextInt();\n sum += Math.abs(a[i]);\n min = Math.min(min, Math.abs(a[i]));\n if (a[i] < 0) {\n cnt++;\n }\n }\n if (cnt % 2 == 1) {\n sum -= min << 1;\n }\n pw.println(sum);\n }\n\n static void swap(long a[], int i, int j) {\n a[i] ^= a[j];\n a[j] ^= a[i];\n a[i] ^= a[j];\n }\n\n static void swap(int a[], int i, int j) {\n a[i] ^= a[j];\n a[j] ^= a[i];\n a[i] ^= a[j];\n }\n\n static void getDiv(Map map, int n) {\n int sqrt = (int) Math.sqrt(n);\n for (int i = sqrt; i >= 2; i--) {\n if (n % i == 0) {\n getDiv(map, i);\n getDiv(map, n / i);\n return;\n }\n }\n map.put(n, map.getOrDefault(n, 0) + 1);\n }\n\n public static boolean[] generatePrime(int n) {\n boolean p[] = new boolean[n + 1];\n p[2] = true;\n\n for (int i = 3; i <= n; i += 2) {\n p[i] = true;\n }\n\n for (int i = 3; i <= Math.sqrt(n); i += 2) {\n if (!p[i]) {\n continue;\n }\n for (int j = i * i; j <= n; j += i << 1) {\n p[j] = false;\n }\n }\n return p;\n }\n\n static long llMod(long a, long b, long mod) {\n return (a * b - (long) ((double) a / mod * b + 0.5) * mod + mod) % mod;\n }\n\n static int pow(long a, long n) {\n long ans = 1;\n while (n > 0) {\n if ((n & 1) == 1) {\n ans = (ans * a) % MOD;\n }\n a = (a * a) % MOD;\n n >>= 1;\n }\n return (int) ans;\n }\n\n static int pow(long a, long n, long mod) {\n long ans = 1;\n while (n > 0) {\n if ((n & 1) == 1) {\n ans = llMod(ans, a, mod);\n }\n a = llMod(a, a, mod);\n n >>= 1;\n }\n return (int) ans;\n }\n\n private static long[][] initC(int n) {\n long c[][] = new long[n][n];\n\n for (int i = 0; i < n; i++) {\n c[i][0] = 1;\n }\n\n for (int i = 1; i < n; i++) {\n for (int j = 1; j <= i; j++) {\n c[i][j] = c[i - 1][j - 1] + c[i - 1][j];\n }\n }\n return c;\n }\n\n /**\n * ps: n >= m, choose m from n;\n */\n private static int c(long n, long m) {\n if (m > n) {\n n ^= m;\n m ^= n;\n n ^= m;\n }\n m = Math.min(m, n - m);\n\n long top = 1;\n long bot = 1;\n for (long i = n - m + 1; i <= n; i++) {\n top = (top * i) % MOD;\n }\n for (int i = 1; i <= m; i++) {\n bot = (bot * i) % MOD;\n }\n\n return (int) ((top * pow(bot, MOD - 2)) % MOD);\n }\n\n static int gcd(int a, int b) {\n if (a < b) {\n a ^= b;\n b ^= a;\n a ^= b;\n }\n while (b != 0) {\n int tmp = a % b;\n a = b;\n b = tmp;\n }\n return a;\n }\n\n static boolean even(long n) {\n return (n & 1) == 0;\n }\n\n public static void main(String args[]) throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n st = new StreamTokenizer(br);\n pw = new PrintWriter(new OutputStreamWriter(System.out));\n st.ordinaryChar('\\''); //指定单引号、双引号和注释符号是普通字符\n st.ordinaryChar('\\\"');\n st.ordinaryChar('/');\n\n solve();\n pw.flush();\n }\n\n static String next(int len) throws IOException {\n int b = br.read();\n while (b == '\\n' || b == ' ' || b == '\\r' || b == '\\t') {\n b = br.read();\n }\n char ch[] = new char[len];\n ch[0] = (char) b;\n int idx = 1;\n while (idx < len && (b = br.read()) != ' ' && b != '\\n' && b != '\\r' && b != '\\t') {\n ch[idx++] = (char) b;\n }\n return String.valueOf(ch).trim();\n }\n\n private static int nextInt() throws IOException {\n st.nextToken();\n return (int) st.nval;\n }\n\n private static double nextDouble() throws IOException {\n st.nextToken();\n return st.nval;\n }\n\n private static String[] nextSS(String reg) throws IOException {\n return br.readLine().split(reg);\n }\n\n private static String nextLine() throws IOException {\n return br.readLine();\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3\n-10 5 -4\n"}, "reference_outputs": ["19\n"], "source_document_id": "p03062", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5957, "cpu_time_ms": 146, "memory_kb": 24972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s522899738", "group_id": "codeNet:p03062", "input_text": "import java.util.*;\nimport static java.lang.System.*;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tint n = sc.nextInt();\n long[] a = new long[n];\n long sum=0;\n int cnt=0;\n int zero=0;\n for(int i=0;i0) ans=sum;\n out.println(ans);\n\t}\n}\n\n// int n = sc.nextInt();\n// int[] array = new int[n];\n// String s = sc.next();\n// s.charAt(i)\n// out.println();\n// Math.min()\n", "language": "Java", "metadata": {"date": 1556414574, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03062.html", "problem_id": "p03062", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03062/input.txt", "sample_output_relpath": "derived/input_output/data/p03062/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03062/Java/s522899738.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s522899738", "user_id": "u918753189"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "import java.util.*;\nimport static java.lang.System.*;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args) {\n\t\tint n = sc.nextInt();\n long[] a = new long[n];\n long sum=0;\n int cnt=0;\n int zero=0;\n for(int i=0;i0) ans=sum;\n out.println(ans);\n\t}\n}\n\n// int n = sc.nextInt();\n// int[] array = new int[n];\n// String s = sc.next();\n// s.charAt(i)\n// out.println();\n// Math.min()\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3\n-10 5 -4\n"}, "reference_outputs": ["19\n"], "source_document_id": "p03062", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 816, "cpu_time_ms": 506, "memory_kb": 52144}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s921617150", "group_id": "codeNet:p03064", "input_text": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint[] a = new int[N];\n\t\tint sum = 0;\n\t\tfor(int i=0; i= B) {\n\t\t\t\tX = A;\n\t\t\t\tif (A-1 >= B) {\n\t\t\t\t\tY = A-1;\n\t\t\t\t}else {\n\t\t\t\t\tY = B;\n\t\t\t\t}\n\t\t\t} else if (A < B) {\n\t\t\t\tX = B;\n\t\t\t\tif (B-1 >= A) {\n\t\t\t\t\tY = B-1;\n\t\t\t\t}else {\n\t\t\t\t\tY = A;\n\t\t\t\t}\n\t\t\t}\n\t\tSystem.out.println(X+Y);\n\t}\n}", "language": "Java", "metadata": {"date": 1566392383, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03071.html", "problem_id": "p03071", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03071/input.txt", "sample_output_relpath": "derived/input_output/data/p03071/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03071/Java/s042090086.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s042090086", "user_id": "u202101624"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tint A = scan.nextInt();\n\t\tint B = scan.nextInt();\n\t\tint X = 0;\n\t\tint Y = 0;\n\n\t\t\tif (A >= B) {\n\t\t\t\tX = A;\n\t\t\t\tif (A-1 >= B) {\n\t\t\t\t\tY = A-1;\n\t\t\t\t}else {\n\t\t\t\t\tY = B;\n\t\t\t\t}\n\t\t\t} else if (A < B) {\n\t\t\t\tX = B;\n\t\t\t\tif (B-1 >= A) {\n\t\t\t\t\tY = B-1;\n\t\t\t\t}else {\n\t\t\t\t\tY = A;\n\t\t\t\t}\n\t\t\t}\n\t\tSystem.out.println(X+Y);\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "sample_input": "5 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03071", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 437, "cpu_time_ms": 104, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s092935699", "group_id": "codeNet:p03071", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tString InStr = scan.nextLine();\n\t\tString[] AryStr = InStr.split(\" \");\n\n\t\tint A;\n\t\tint B;\n\n\t\tA = Integer.parseInt(AryStr[0]);\n\t\tB = Integer.parseInt(AryStr[1]);\n\n\t\tif (A < B) {\n\t\t\tA = B;\n\t\t} else {\n B = A;\n }\n\t\tB--;\n\n System.out.println(A + B);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1555185945, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03071.html", "problem_id": "p03071", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03071/input.txt", "sample_output_relpath": "derived/input_output/data/p03071/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03071/Java/s092935699.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s092935699", "user_id": "u512859091"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner scan = new Scanner(System.in);\n\n\t\tString InStr = scan.nextLine();\n\t\tString[] AryStr = InStr.split(\" \");\n\n\t\tint A;\n\t\tint B;\n\n\t\tA = Integer.parseInt(AryStr[0]);\n\t\tB = Integer.parseInt(AryStr[1]);\n\n\t\tif (A < B) {\n\t\t\tA = B;\n\t\t} else {\n B = A;\n }\n\t\tB--;\n\n System.out.println(A + B);\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "sample_input": "5 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03071", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 464, "cpu_time_ms": 91, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s854455231", "group_id": "codeNet:p03072", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n static class FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n }\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n int n = sc.nextInt();\n int[] h = sc.nextIntArray(n);\n int count = 1;\n int max = h[0];\n for (int i = 1; i < n; i++) {\n if (h[i] >= max) {\n count++;\n max = h[i];\n }\n }\n System.out.println(count);\n }\n}\n", "language": "Java", "metadata": {"date": 1576404885, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03072.html", "problem_id": "p03072", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03072/input.txt", "sample_output_relpath": "derived/input_output/data/p03072/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03072/Java/s854455231.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s854455231", "user_id": "u562002567"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n static class FastScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n public String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n return tokenizer.nextToken(\"\\n\");\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n public long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n }\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n int n = sc.nextInt();\n int[] h = sc.nextIntArray(n);\n int count = 1;\n int max = h[0];\n for (int i = 1; i < n; i++) {\n if (h[i] >= max) {\n count++;\n max = h[i];\n }\n }\n System.out.println(count);\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N mountains ranging from east to west, and an ocean to the west.\n\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\n\nThe height of the i-th mountain from the west is H_i.\n\nYou can certainly see the ocean from the inn at the top of the westmost mountain.\n\nFor the inn at the top of the i-th mountain from the west (i = 2, 3, ..., N), you can see the ocean if and only if H_1 \\leq H_i, H_2 \\leq H_i, ..., and H_{i-1} \\leq H_i.\n\nFrom how many of these N inns can you see the ocean?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq H_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the number of inns from which you can see the ocean.\n\nSample Input 1\n\n4\n6 5 6 8\n\nSample Output 1\n\n3\n\nYou can see the ocean from the first, third and fourth inns from the west.\n\nSample Input 2\n\n5\n4 5 3 5 4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5\n9 5 6 8 4\n\nSample Output 3\n\n1", "sample_input": "4\n6 5 6 8\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03072", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N mountains ranging from east to west, and an ocean to the west.\n\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\n\nThe height of the i-th mountain from the west is H_i.\n\nYou can certainly see the ocean from the inn at the top of the westmost mountain.\n\nFor the inn at the top of the i-th mountain from the west (i = 2, 3, ..., N), you can see the ocean if and only if H_1 \\leq H_i, H_2 \\leq H_i, ..., and H_{i-1} \\leq H_i.\n\nFrom how many of these N inns can you see the ocean?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq H_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the number of inns from which you can see the ocean.\n\nSample Input 1\n\n4\n6 5 6 8\n\nSample Output 1\n\n3\n\nYou can see the ocean from the first, third and fourth inns from the west.\n\nSample Input 2\n\n5\n4 5 3 5 4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5\n9 5 6 8 4\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1885, "cpu_time_ms": 70, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s231965681", "group_id": "codeNet:p03075", "input_text": "import java.util.Scanner;\n\nclass Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\t\t\t//文字の入力\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\tint D = sc.nextInt();\n\t\tint E = sc.nextInt();\n\t\tint K = sc.nextInt();\n\n\t\tif(E-A <= K){\n\t\t\tSystem.out.println(\"Yay!\");\n\t\t}else{\n\t\t\tSystem.out.println(\":(\");\n\n\t\t}\n\n\t\t\n\n\t}\n\n\n}\n\n\nclass Pair implements Comparable{\n\tint from;\n\tint end;\n\t@Override\n\tpublic int compareTo(Object other) {\n\t\tPair otherpair = (Pair)other;\n\n\t\treturn from - otherpair.from;\n\t}\n}\n\n\n", "language": "Java", "metadata": {"date": 1567429438, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03075.html", "problem_id": "p03075", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03075/input.txt", "sample_output_relpath": "derived/input_output/data/p03075/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03075/Java/s231965681.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s231965681", "user_id": "u632953742"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main{\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\t\t\t//文字の入力\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\tint D = sc.nextInt();\n\t\tint E = sc.nextInt();\n\t\tint K = sc.nextInt();\n\n\t\tif(E-A <= K){\n\t\t\tSystem.out.println(\"Yay!\");\n\t\t}else{\n\t\t\tSystem.out.println(\":(\");\n\n\t\t}\n\n\t\t\n\n\t}\n\n\n}\n\n\nclass Pair implements Comparable{\n\tint from;\n\tint end;\n\t@Override\n\tpublic int compareTo(Object other) {\n\t\tPair otherpair = (Pair)other;\n\n\t\treturn from - otherpair.from;\n\t}\n}\n\n\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "sample_input": "1\n2\n4\n8\n9\n15\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03075", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 566, "cpu_time_ms": 95, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s470389823", "group_id": "codeNet:p03076", "input_text": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint count=0;\n\t\tint max=0;\n\t\tint a=0;\n\t\tint[] A = new int[5];\n\t\tint c=0;\n\t\t\n\t\tfor(int i=0;i<5;i++) {\n\t\t\tA[i]=sc.nextInt();\n\t\t\tif(A[i]%10!=0) {\n\t\t\t\tmax=Math.max((10-A[i]%10), max);\n\t\t\t\tc=i;\n\t\t\t\t}\t\n\t\t}\n\t\t\n\t\tfor(int i=0;i<5;i++) {\n\t\t\tcount+=A[i];\n\t\t\tfor(int j=0;j<9;j++) {\n\t\t\t\tif(count%10!=0) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(count-max);\n\t\t\n\t\tsc.close();\n\t}\n}\n", "language": "Java", "metadata": {"date": 1590087127, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03076.html", "problem_id": "p03076", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03076/input.txt", "sample_output_relpath": "derived/input_output/data/p03076/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03076/Java/s470389823.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s470389823", "user_id": "u869728296"}, "prompt_components": {"gold_output": "215\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint count=0;\n\t\tint max=0;\n\t\tint a=0;\n\t\tint[] A = new int[5];\n\t\tint c=0;\n\t\t\n\t\tfor(int i=0;i<5;i++) {\n\t\t\tA[i]=sc.nextInt();\n\t\t\tif(A[i]%10!=0) {\n\t\t\t\tmax=Math.max((10-A[i]%10), max);\n\t\t\t\tc=i;\n\t\t\t\t}\t\n\t\t}\n\t\t\n\t\tfor(int i=0;i<5;i++) {\n\t\t\tcount+=A[i];\n\t\t\tfor(int j=0;j<9;j++) {\n\t\t\t\tif(count%10!=0) {\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(count-max);\n\t\t\n\t\tsc.close();\n\t}\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThe restaurant AtCoder serves the following five dishes:\n\nABC Don (rice bowl): takes A minutes to serve.\n\nARC Curry: takes B minutes to serve.\n\nAGC Pasta: takes C minutes to serve.\n\nAPC Ramen: takes D minutes to serve.\n\nATC Hanbagu (hamburger patty): takes E minutes to serve.\n\nHere, the time to serve a dish is the time between when an order is placed and when the dish is delivered.\n\nThis restaurant has the following rules on orders:\n\nAn order can only be placed at a time that is a multiple of 10 (time 0, 10, 20, ...).\n\nOnly one dish can be ordered at a time.\n\nNo new order can be placed when an order is already placed and the dish is still not delivered, but a new order can be placed at the exact time when the dish is delivered.\n\nE869120 arrives at this restaurant at time 0. He will order all five dishes. Find the earliest possible time for the last dish to be delivered.\n\nHere, he can order the dishes in any order he likes, and he can place an order already at time 0.\n\nConstraints\n\nA, B, C, D and E are integers between 1 and 123 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the earliest possible time for the last dish to be delivered, as an integer.\n\nSample Input 1\n\n29\n20\n7\n35\n120\n\nSample Output 1\n\n215\n\nIf we decide to order the dishes in the order ABC Don, ARC Curry, AGC Pasta, ATC Hanbagu, APC Ramen, the earliest possible time for each order is as follows:\n\nOrder ABC Don at time 0, which will be delivered at time 29.\n\nOrder ARC Curry at time 30, which will be delivered at time 50.\n\nOrder AGC Pasta at time 50, which will be delivered at time 57.\n\nOrder ATC Hanbagu at time 60, which will be delivered at time 180.\n\nOrder APC Ramen at time 180, which will be delivered at time 215.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 2\n\n101\n86\n119\n108\n57\n\nSample Output 2\n\n481\n\nIf we decide to order the dishes in the order AGC Pasta, ARC Curry, ATC Hanbagu, APC Ramen, ABC Don, the earliest possible time for each order is as follows:\n\nOrder AGC Pasta at time 0, which will be delivered at time 119.\n\nOrder ARC Curry at time 120, which will be delivered at time 206.\n\nOrder ATC Hanbagu at time 210, which will be delivered at time 267.\n\nOrder APC Ramen at time 270, which will be delivered at time 378.\n\nOrder ABC Don at time 380, which will be delivered at time 481.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 3\n\n123\n123\n123\n123\n123\n\nSample Output 3\n\n643\n\nThis is the largest valid case.", "sample_input": "29\n20\n7\n35\n120\n"}, "reference_outputs": ["215\n"], "source_document_id": "p03076", "source_text": "Score: 200 points\n\nProblem Statement\n\nThe restaurant AtCoder serves the following five dishes:\n\nABC Don (rice bowl): takes A minutes to serve.\n\nARC Curry: takes B minutes to serve.\n\nAGC Pasta: takes C minutes to serve.\n\nAPC Ramen: takes D minutes to serve.\n\nATC Hanbagu (hamburger patty): takes E minutes to serve.\n\nHere, the time to serve a dish is the time between when an order is placed and when the dish is delivered.\n\nThis restaurant has the following rules on orders:\n\nAn order can only be placed at a time that is a multiple of 10 (time 0, 10, 20, ...).\n\nOnly one dish can be ordered at a time.\n\nNo new order can be placed when an order is already placed and the dish is still not delivered, but a new order can be placed at the exact time when the dish is delivered.\n\nE869120 arrives at this restaurant at time 0. He will order all five dishes. Find the earliest possible time for the last dish to be delivered.\n\nHere, he can order the dishes in any order he likes, and he can place an order already at time 0.\n\nConstraints\n\nA, B, C, D and E are integers between 1 and 123 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the earliest possible time for the last dish to be delivered, as an integer.\n\nSample Input 1\n\n29\n20\n7\n35\n120\n\nSample Output 1\n\n215\n\nIf we decide to order the dishes in the order ABC Don, ARC Curry, AGC Pasta, ATC Hanbagu, APC Ramen, the earliest possible time for each order is as follows:\n\nOrder ABC Don at time 0, which will be delivered at time 29.\n\nOrder ARC Curry at time 30, which will be delivered at time 50.\n\nOrder AGC Pasta at time 50, which will be delivered at time 57.\n\nOrder ATC Hanbagu at time 60, which will be delivered at time 180.\n\nOrder APC Ramen at time 180, which will be delivered at time 215.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 2\n\n101\n86\n119\n108\n57\n\nSample Output 2\n\n481\n\nIf we decide to order the dishes in the order AGC Pasta, ARC Curry, ATC Hanbagu, APC Ramen, ABC Don, the earliest possible time for each order is as follows:\n\nOrder AGC Pasta at time 0, which will be delivered at time 119.\n\nOrder ARC Curry at time 120, which will be delivered at time 206.\n\nOrder ATC Hanbagu at time 210, which will be delivered at time 267.\n\nOrder APC Ramen at time 270, which will be delivered at time 378.\n\nOrder ABC Don at time 380, which will be delivered at time 481.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 3\n\n123\n123\n123\n123\n123\n\nSample Output 3\n\n643\n\nThis is the largest valid case.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 502, "cpu_time_ms": 96, "memory_kb": 21588}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s233488884", "group_id": "codeNet:p03077", "input_text": "import java.util.Scanner;\n\npublic class Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n\n long n = sc.nextLong();\n long a = sc.nextLong();\n long b = sc.nextLong();\n long c = sc.nextLong();\n long d = sc.nextLong();\n long e = sc.nextLong();\n\n\n long min = Math.min(a,b);\n min = Math.min(min, c);\n min = Math.min(min, d);\n min = Math.min(min, e);\n\n// long minute = n/min+1;\n long minute=0;\n \n if (n%min==0){\n minute = n/min;\n }else{\n minute = n/min+1;\n }\n\n System.out.println(minute+4);\n\n }\n\n}", "language": "Java", "metadata": {"date": 1563478103, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03077.html", "problem_id": "p03077", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03077/input.txt", "sample_output_relpath": "derived/input_output/data/p03077/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03077/Java/s233488884.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s233488884", "user_id": "u127030911"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n\n long n = sc.nextLong();\n long a = sc.nextLong();\n long b = sc.nextLong();\n long c = sc.nextLong();\n long d = sc.nextLong();\n long e = sc.nextLong();\n\n\n long min = Math.min(a,b);\n min = Math.min(min, c);\n min = Math.min(min, d);\n min = Math.min(min, e);\n\n// long minute = n/min+1;\n long minute=0;\n \n if (n%min==0){\n minute = n/min;\n }else{\n minute = n/min+1;\n }\n\n System.out.println(minute+4);\n\n }\n\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "5\n3\n2\n4\n3\n5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03077", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 680, "cpu_time_ms": 99, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s437931835", "group_id": "codeNet:p03077", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tstatic long[]m = new long[5];\n\tstatic long Mod = 1000_000_007;\n\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t}\n\n\tvoid solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tlong min = Mod;\n\t\tfor(int i=0;i<5;i++) {\n\t\t\tm[i]=Long.parseLong(sc.next());\n\t\t\tif(m[i] Mod) {\n\t\t\twhile(res>Mod*100)res-=Mod*100;\n\t\t\twhile(res>Mod)res-=Mod;\n\t\t}\n\t\tSystem.out.println(res);\n\t}\n\n}", "language": "Java", "metadata": {"date": 1554580696, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03077.html", "problem_id": "p03077", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03077/input.txt", "sample_output_relpath": "derived/input_output/data/p03077/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03077/Java/s437931835.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s437931835", "user_id": "u908039151"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tstatic long[]m = new long[5];\n\tstatic long Mod = 1000_000_007;\n\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t}\n\n\tvoid solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tlong min = Mod;\n\t\tfor(int i=0;i<5;i++) {\n\t\t\tm[i]=Long.parseLong(sc.next());\n\t\t\tif(m[i] Mod) {\n\t\t\twhile(res>Mod*100)res-=Mod*100;\n\t\t\twhile(res>Mod)res-=Mod;\n\t\t}\n\t\tSystem.out.println(res);\n\t}\n\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "5\n3\n2\n4\n3\n5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03077", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 592, "cpu_time_ms": 93, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s888360332", "group_id": "codeNet:p03079", "input_text": "import java.io.*;\nimport java.util.*;\nimport java.util.Map.Entry;\n\npublic class Main {\n\t\n\tfinal boolean isDebug = false;\n\tString fileName = \"input.txt\";\n\tFastScanner sc;\n\tPrintWriter out;\n\tfinal int MOD = (int)1e9+7;\n\tfinal int INF = Integer.MAX_VALUE / 2;\n\t\n\tvoid solve() throws Exception{\n\t\tint a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt();\n\t\tif(a == b && b == c) System.out.println(\"Yes\");\n\t\telse System.out.println(\"No\");\n\t\t\n\t}\n\t\n\t\n\t/* end solve */\n\t\n\t/* main */\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().m();\n\t}\n\t\n\tvoid m() throws Exception {\n\t\tlong S = System.currentTimeMillis();\n\t\tsc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\tif(isDebug){\n\t\t\tSystem.out.println(\"---Debug---\");\n\t\t\tSystem.out.printf(\"%8d ms\", (G-S));\n\t\t}\n\t}\n\t/* end main */\n}\n/* end Main */\n\nclass FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() {\n \tif (hasNextByte()) return buffer[ptr++];\n \telse return -1;\n }\n private static boolean isPrintableChar(int c){\n \treturn 33 <= c && c <= 126;\n }\n public boolean hasNext() {\n \twhile(hasNextByte() && !isPrintableChar(buffer[ptr]))\n \t\tptr++; return hasNextByte();\n }\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n}", "language": "Java", "metadata": {"date": 1553977945, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03079.html", "problem_id": "p03079", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03079/input.txt", "sample_output_relpath": "derived/input_output/data/p03079/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03079/Java/s888360332.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s888360332", "user_id": "u234826697"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nimport java.util.Map.Entry;\n\npublic class Main {\n\t\n\tfinal boolean isDebug = false;\n\tString fileName = \"input.txt\";\n\tFastScanner sc;\n\tPrintWriter out;\n\tfinal int MOD = (int)1e9+7;\n\tfinal int INF = Integer.MAX_VALUE / 2;\n\t\n\tvoid solve() throws Exception{\n\t\tint a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt();\n\t\tif(a == b && b == c) System.out.println(\"Yes\");\n\t\telse System.out.println(\"No\");\n\t\t\n\t}\n\t\n\t\n\t/* end solve */\n\t\n\t/* main */\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().m();\n\t}\n\t\n\tvoid m() throws Exception {\n\t\tlong S = System.currentTimeMillis();\n\t\tsc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\tif(isDebug){\n\t\t\tSystem.out.println(\"---Debug---\");\n\t\t\tSystem.out.printf(\"%8d ms\", (G-S));\n\t\t}\n\t}\n\t/* end main */\n}\n/* end Main */\n\nclass FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() {\n \tif (hasNextByte()) return buffer[ptr++];\n \telse return -1;\n }\n private static boolean isPrintableChar(int c){\n \treturn 33 <= c && c <= 126;\n }\n public boolean hasNext() {\n \twhile(hasNextByte() && !isPrintableChar(buffer[ptr]))\n \t\tptr++; return hasNextByte();\n }\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\n\nDetermine if there exists an equilateral triangle whose sides have lengths A, B and C.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A,B,C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf there exists an equilateral triangle whose sides have lengths A, B and C, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nThere exists an equilateral triangle whose sides have lengths 2, 2 and 2.\n\nSample Input 2\n\n3 4 5\n\nSample Output 2\n\nNo\n\nThere is no equilateral triangle whose sides have lengths 3, 4 and 5.", "sample_input": "2 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03079", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\n\nDetermine if there exists an equilateral triangle whose sides have lengths A, B and C.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A,B,C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf there exists an equilateral triangle whose sides have lengths A, B and C, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nThere exists an equilateral triangle whose sides have lengths 2, 2 and 2.\n\nSample Input 2\n\n3 4 5\n\nSample Output 2\n\nNo\n\nThere is no equilateral triangle whose sides have lengths 3, 4 and 5.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3133, "cpu_time_ms": 70, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s387861709", "group_id": "codeNet:p03080", "input_text": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.StringJoiner;\nimport java.util.StringTokenizer;\nimport java.util.function.Function;\n\npublic class Main {\n\n static int N;\n static String S;\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n N = sc.nextInt();\n S = sc.next();\n\n System.out.println(solve() ? \"Yes\" : \"No\");\n }\n\n static boolean solve() {\n int r = 0;\n int b = 0;\n for (int i = 0; i < N; i++) {\n if( S.charAt(i) == 'R' ) {\n r++;\n } else {\n b++;\n }\n }\n return r > b;\n }\n\n @SuppressWarnings(\"unused\")\n static class FastScanner {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n int[] nextIntArray(int n, int delta) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt() + delta;\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n }\n\n static void writeLines(A[] as, Function f) {\n PrintWriter pw = new PrintWriter(System.out);\n for (A a : as) {\n pw.println(f.apply(a));\n }\n pw.flush();\n }\n\n static void writeLines(int[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (int a : as) pw.println(a);\n pw.flush();\n }\n\n static void writeLines(long[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (long a : as) pw.println(a);\n pw.flush();\n }\n\n static int max(int... as) {\n int max = Integer.MIN_VALUE;\n for (int a : as) max = Math.max(a, max);\n return max;\n }\n\n static int min(int... as) {\n int min = Integer.MAX_VALUE;\n for (int a : as) min = Math.min(a, min);\n return min;\n }\n\n static void debug(Object... args) {\n StringJoiner j = new StringJoiner(\" \");\n for (Object arg : args) {\n if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));\n else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));\n else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));\n else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));\n else j.add(arg.toString());\n }\n System.err.println(j.toString());\n }\n}\n", "language": "Java", "metadata": {"date": 1553976153, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03080.html", "problem_id": "p03080", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03080/input.txt", "sample_output_relpath": "derived/input_output/data/p03080/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03080/Java/s387861709.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s387861709", "user_id": "u762187782"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.StringJoiner;\nimport java.util.StringTokenizer;\nimport java.util.function.Function;\n\npublic class Main {\n\n static int N;\n static String S;\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner(System.in);\n N = sc.nextInt();\n S = sc.next();\n\n System.out.println(solve() ? \"Yes\" : \"No\");\n }\n\n static boolean solve() {\n int r = 0;\n int b = 0;\n for (int i = 0; i < N; i++) {\n if( S.charAt(i) == 'R' ) {\n r++;\n } else {\n b++;\n }\n }\n return r > b;\n }\n\n @SuppressWarnings(\"unused\")\n static class FastScanner {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n FastScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n tokenizer = null;\n }\n\n String next() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n String nextLine() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n return reader.readLine();\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken(\"\\n\");\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt();\n return a;\n }\n\n int[] nextIntArray(int n, int delta) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = nextInt() + delta;\n return a;\n }\n\n long[] nextLongArray(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nextLong();\n return a;\n }\n }\n\n static void writeLines(A[] as, Function f) {\n PrintWriter pw = new PrintWriter(System.out);\n for (A a : as) {\n pw.println(f.apply(a));\n }\n pw.flush();\n }\n\n static void writeLines(int[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (int a : as) pw.println(a);\n pw.flush();\n }\n\n static void writeLines(long[] as) {\n PrintWriter pw = new PrintWriter(System.out);\n for (long a : as) pw.println(a);\n pw.flush();\n }\n\n static int max(int... as) {\n int max = Integer.MIN_VALUE;\n for (int a : as) max = Math.max(a, max);\n return max;\n }\n\n static int min(int... as) {\n int min = Integer.MAX_VALUE;\n for (int a : as) min = Math.min(a, min);\n return min;\n }\n\n static void debug(Object... args) {\n StringJoiner j = new StringJoiner(\" \");\n for (Object arg : args) {\n if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));\n else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));\n else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));\n else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));\n else j.add(arg.toString());\n }\n System.err.println(j.toString());\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a string s representing the colors of the people. Person i wears a red hat if s_i is R, and a blue hat if s_i is B.\n\nDetermine if there are more people wearing a red hat than people wearing a blue hat.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|s| = N\n\ns_i is R or B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there are more people wearing a red hat than there are people wearing a blue hat, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nRRBR\n\nSample Output 1\n\nYes\n\nThere are three people wearing a red hat, and one person wearing a blue hat.\n\nSince there are more people wearing a red hat than people wearing a blue hat, the answer is Yes.\n\nSample Input 2\n\n4\nBRBR\n\nSample Output 2\n\nNo\n\nThere are two people wearing a red hat, and two people wearing a blue hat.\n\nSince there are as many people wearing a red hat as people wearing a blue hat, the answer is No.", "sample_input": "4\nRRBR\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03080", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a string s representing the colors of the people. Person i wears a red hat if s_i is R, and a blue hat if s_i is B.\n\nDetermine if there are more people wearing a red hat than people wearing a blue hat.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|s| = N\n\ns_i is R or B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there are more people wearing a red hat than there are people wearing a blue hat, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nRRBR\n\nSample Output 1\n\nYes\n\nThere are three people wearing a red hat, and one person wearing a blue hat.\n\nSince there are more people wearing a red hat than people wearing a blue hat, the answer is Yes.\n\nSample Input 2\n\n4\nBRBR\n\nSample Output 2\n\nNo\n\nThere are two people wearing a red hat, and two people wearing a blue hat.\n\nSince there are as many people wearing a red hat as people wearing a blue hat, the answer is No.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3774, "cpu_time_ms": 72, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s728643165", "group_id": "codeNet:p03086", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n // int n = Integer.parseInt(sc.next());\n String s = sc.next();\n\n int ans = 0;\n int tmp = 0;\n for (int i = 0; i < s.length(); i++) {\n if (s.substring(i, i + 1).equals(\"A\") || s.substring(i, i + 1).equals(\"T\")\n || s.substring(i, i + 1).equals(\"G\") || s.substring(i, i + 1).equals(\"C\")) {\n tmp++;\n } else {\n ans = Math.max(tmp, ans);\n tmp=0;\n }\n }\n System.out.println(ans);\n sc.close();\n }\n}", "language": "Java", "metadata": {"date": 1586470815, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03086.html", "problem_id": "p03086", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03086/input.txt", "sample_output_relpath": "derived/input_output/data/p03086/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03086/Java/s728643165.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s728643165", "user_id": "u516260187"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n // int n = Integer.parseInt(sc.next());\n String s = sc.next();\n\n int ans = 0;\n int tmp = 0;\n for (int i = 0; i < s.length(); i++) {\n if (s.substring(i, i + 1).equals(\"A\") || s.substring(i, i + 1).equals(\"T\")\n || s.substring(i, i + 1).equals(\"G\") || s.substring(i, i + 1).equals(\"C\")) {\n tmp++;\n } else {\n ans = Math.max(tmp, ans);\n tmp=0;\n }\n }\n System.out.println(ans);\n sc.close();\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 682, "cpu_time_ms": 92, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s570138817", "group_id": "codeNet:p03086", "input_text": "\n\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n // TODO code application logic here\n Scanner sc = new Scanner(System.in);\n String AtCoder = sc.next();\n String[] text = AtCoder.split(\"\");\n int count = 0;\n int answer = 0;\n for (int i = 0; i < AtCoder.length(); i++) {\n if (text[i].equals(\"A\") || text[i].equals(\"C\") || text[i].equals(\"G\") || text[i].equals(\"T\")) {\n count++;\n } else {\n if (answer < count) {\n answer = count;\n }\n count = 0;\n }\n }\n\n System.out.print(answer);\n }\n\n}\n", "language": "Java", "metadata": {"date": 1553637546, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03086.html", "problem_id": "p03086", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03086/input.txt", "sample_output_relpath": "derived/input_output/data/p03086/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03086/Java/s570138817.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s570138817", "user_id": "u794927332"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\n\nimport java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n // TODO code application logic here\n Scanner sc = new Scanner(System.in);\n String AtCoder = sc.next();\n String[] text = AtCoder.split(\"\");\n int count = 0;\n int answer = 0;\n for (int i = 0; i < AtCoder.length(); i++) {\n if (text[i].equals(\"A\") || text[i].equals(\"C\") || text[i].equals(\"G\") || text[i].equals(\"T\")) {\n count++;\n } else {\n if (answer < count) {\n answer = count;\n }\n count = 0;\n }\n }\n\n System.out.print(answer);\n }\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 794, "cpu_time_ms": 92, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s862824781", "group_id": "codeNet:p03087", "input_text": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tprivate static final String KEYWORD = \"AC\";\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint n = scanner.nextInt();\n\t\t\tint q = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\t\t\tString s = scanner.nextLine();\n\t\t\tList result = new ArrayList<>();\n\t\t\tfor (int i = 0; i < q; i++) {\n\t\t\t\tint l = scanner.nextInt();\n\t\t\t\tint r = scanner.nextInt();\n\t\t\t\tint count = 0;\n\t\t\t\tscanner.nextLine();\n\t\t\t\tString substring = s.substring(l - 1, r);\n\t\t\t\tchar previous = ' ';\n\t\t\t\tfor (char current : substring.toCharArray()) {\n\t\t\t\t\tif (('A' == previous) && ('C' == current)) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t\tprevious = current;\n\t\t\t\t}\n\t\t\t\tresult.add(count);\n\t\t\t}\n\t\t\tresult.stream().forEach(System.out::println);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1553460397, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03087.html", "problem_id": "p03087", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03087/input.txt", "sample_output_relpath": "derived/input_output/data/p03087/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03087/Java/s862824781.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s862824781", "user_id": "u729186675"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tprivate static final String KEYWORD = \"AC\";\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint n = scanner.nextInt();\n\t\t\tint q = scanner.nextInt();\n\t\t\tscanner.nextLine();\n\t\t\tString s = scanner.nextLine();\n\t\t\tList result = new ArrayList<>();\n\t\t\tfor (int i = 0; i < q; i++) {\n\t\t\t\tint l = scanner.nextInt();\n\t\t\t\tint r = scanner.nextInt();\n\t\t\t\tint count = 0;\n\t\t\t\tscanner.nextLine();\n\t\t\t\tString substring = s.substring(l - 1, r);\n\t\t\t\tchar previous = ' ';\n\t\t\t\tfor (char current : substring.toCharArray()) {\n\t\t\t\t\tif (('A' == previous) && ('C' == current)) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t\tprevious = current;\n\t\t\t\t}\n\t\t\t\tresult.add(count);\n\t\t\t}\n\t\t\tresult.stream().forEach(System.out::println);\n\t\t}\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, C, G and T. Answer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): You will be given integers l_i and r_i (1 \\leq l_i < r_i \\leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does AC occurs as a substring?\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\nS is a string of length N.\n\nEach character in S is A, C, G or T.\n\n1 \\leq l_i < r_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n8 3\nACACTACG\n3 7\n2 3\n1 8\n\nSample Output 1\n\n2\n0\n3\n\nQuery 1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.\n\nQuery 2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.\n\nQuery 3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.", "sample_input": "8 3\nACACTACG\n3 7\n2 3\n1 8\n"}, "reference_outputs": ["2\n0\n3\n"], "source_document_id": "p03087", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, C, G and T. Answer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): You will be given integers l_i and r_i (1 \\leq l_i < r_i \\leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does AC occurs as a substring?\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\nS is a string of length N.\n\nEach character in S is A, C, G or T.\n\n1 \\leq l_i < r_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n8 3\nACACTACG\n3 7\n2 3\n1 8\n\nSample Output 1\n\n2\n0\n3\n\nQuery 1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.\n\nQuery 2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.\n\nQuery 3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 848, "cpu_time_ms": 2110, "memory_kb": 349676}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s737991487", "group_id": "codeNet:p03095", "input_text": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String[] chars={\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"h\",\"u\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"};\n long output=1;\n long mod=1000000007;\n int n=sc.nextInt();\n String s=sc.next();\n for(int i=0;i<26;i++){\n output*=(long)(s.length()-s.replaceAll(chars[i],\"\").length()+1);\n output%=mod;\n }\n System.out.println(output==0?mod-1:output-1);\n }\n}", "language": "Java", "metadata": {"date": 1555861622, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03095.html", "problem_id": "p03095", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03095/input.txt", "sample_output_relpath": "derived/input_output/data/p03095/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03095/Java/s737991487.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s737991487", "user_id": "u136427605"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n String[] chars={\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"h\",\"u\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"};\n long output=1;\n long mod=1000000007;\n int n=sc.nextInt();\n String s=sc.next();\n for(int i=0;i<26;i++){\n output*=(long)(s.length()-s.replaceAll(chars[i],\"\").length()+1);\n output%=mod;\n }\n System.out.println(output==0?mod-1:output-1);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "sample_input": "4\nabcd\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03095", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 586, "cpu_time_ms": 301, "memory_kb": 39880}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s312130897", "group_id": "codeNet:p03096", "input_text": "\n\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.nio.charset.Charset;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n boolean local = false;\n boolean async = false;\n\n Charset charset = Charset.forName(\"ascii\");\n\n FastIO io = local ? new FastIO(new FileInputStream(\"D:\\\\DATABASE\\\\TESTCASE\\\\Code.in\"), System.out, charset) : new FastIO(System.in, System.out, charset);\n Task task = new Task(io, new Debug(local));\n\n if (async) {\n Thread t = new Thread(null, task, \"dalt\", 1 << 27);\n t.setPriority(Thread.MAX_PRIORITY);\n t.start();\n t.join();\n } else {\n task.run();\n }\n\n if (local) {\n io.cache.append(\"\\n\\n--memory -- \\n\" + ((Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20) + \"M\");\n }\n\n io.flush();\n }\n\n public static class Task implements Runnable {\n final FastIO io;\n final Debug debug;\n int inf = (int) 1e8;\n int mod = (int) 1e9 + 7;\n\n public int mod(int val) {\n val %= mod;\n if (val < 0) {\n val += mod;\n }\n return val;\n }\n\n public int mod(long val) {\n val %= mod;\n if (val < 0) {\n val += mod;\n }\n return (int) val;\n }\n\n int bitAt(int x, int i) {\n return (x >> i) & 1;\n }\n\n int bitAt(long x, int i) {\n return (int) ((x >> i) & 1);\n }\n\n public Task(FastIO io, Debug debug) {\n this.io = io;\n this.debug = debug;\n }\n\n @Override\n public void run() {\n solve();\n }\n\n public void solve() {\n int n = io.readInt();\n int[] colors = new int[n + 1];\n int[] dp = new int[n + 1];\n Map registries = new HashMap<>();\n for (int i = 1; i <= n; i++) {\n colors[i] = io.readInt();\n if (i == 1) {\n dp[i] = 1;\n } else {\n int last = registries.getOrDefault(colors[i], 0);\n dp[i] = dp[i - 1];\n if (last != i - 1) {\n dp[i] = mod(dp[i] + dp[last]);\n }\n }\n registries.put(colors[i], i);\n }\n\n io.cache.append(dp[n]);\n }\n }\n\n public static class FastIO {\n public final StringBuilder cache = new StringBuilder();\n private final InputStream is;\n private final OutputStream os;\n private final Charset charset;\n private StringBuilder defaultStringBuf = new StringBuilder(1 << 8);\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastIO(InputStream is, OutputStream os, Charset charset) {\n this.is = is;\n this.os = os;\n this.charset = charset;\n }\n\n public FastIO(InputStream is, OutputStream os) {\n this(is, os, Charset.forName(\"ascii\"));\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public double readDouble() {\n boolean sign = true;\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+';\n next = read();\n }\n\n long val = 0;\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n if (next != '.') {\n return sign ? val : -val;\n }\n next = read();\n long radix = 1;\n long point = 0;\n while (next >= '0' && next <= '9') {\n point = point * 10 + next - '0';\n radix = radix * 10;\n next = read();\n }\n double result = val + (double) point / radix;\n return sign ? result : -result;\n }\n\n public String readString(StringBuilder builder) {\n skipBlank();\n\n while (next > 32) {\n builder.append((char) next);\n next = read();\n }\n\n return builder.toString();\n }\n\n public String readString() {\n defaultStringBuf.setLength(0);\n return readString(defaultStringBuf);\n }\n\n public int readLine(char[] data, int offset) {\n int originalOffset = offset;\n while (next != -1 && next != '\\n') {\n data[offset++] = (char) next;\n next = read();\n }\n return offset - originalOffset;\n }\n\n public int readString(char[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (char) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public int readString(byte[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (byte) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public char readChar() {\n skipBlank();\n char c = (char) next;\n next = read();\n return c;\n }\n\n public void flush() {\n try {\n os.write(cache.toString().getBytes(charset));\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public boolean hasMore() {\n skipBlank();\n return next != -1;\n }\n }\n\n public static class Debug {\n private boolean allowDebug;\n\n public Debug(boolean allowDebug) {\n this.allowDebug = allowDebug;\n }\n\n public void assertTrue(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (!flag) {\n fail();\n }\n }\n\n public void fail() {\n throw new RuntimeException();\n }\n\n public void assertFalse(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (flag) {\n fail();\n }\n }\n\n private void outputName(String name) {\n System.out.print(name + \" = \");\n }\n\n public void debug(String name, int x) {\n if (!allowDebug) {\n return;\n }\n\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, long x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, double x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, int[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, long[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, double[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, Object x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, Object... x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.deepToString(x));\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1557580645, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03096.html", "problem_id": "p03096", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03096/input.txt", "sample_output_relpath": "derived/input_output/data/p03096/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03096/Java/s312130897.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s312130897", "user_id": "u511225853"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\n\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.nio.charset.Charset;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n boolean local = false;\n boolean async = false;\n\n Charset charset = Charset.forName(\"ascii\");\n\n FastIO io = local ? new FastIO(new FileInputStream(\"D:\\\\DATABASE\\\\TESTCASE\\\\Code.in\"), System.out, charset) : new FastIO(System.in, System.out, charset);\n Task task = new Task(io, new Debug(local));\n\n if (async) {\n Thread t = new Thread(null, task, \"dalt\", 1 << 27);\n t.setPriority(Thread.MAX_PRIORITY);\n t.start();\n t.join();\n } else {\n task.run();\n }\n\n if (local) {\n io.cache.append(\"\\n\\n--memory -- \\n\" + ((Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) >> 20) + \"M\");\n }\n\n io.flush();\n }\n\n public static class Task implements Runnable {\n final FastIO io;\n final Debug debug;\n int inf = (int) 1e8;\n int mod = (int) 1e9 + 7;\n\n public int mod(int val) {\n val %= mod;\n if (val < 0) {\n val += mod;\n }\n return val;\n }\n\n public int mod(long val) {\n val %= mod;\n if (val < 0) {\n val += mod;\n }\n return (int) val;\n }\n\n int bitAt(int x, int i) {\n return (x >> i) & 1;\n }\n\n int bitAt(long x, int i) {\n return (int) ((x >> i) & 1);\n }\n\n public Task(FastIO io, Debug debug) {\n this.io = io;\n this.debug = debug;\n }\n\n @Override\n public void run() {\n solve();\n }\n\n public void solve() {\n int n = io.readInt();\n int[] colors = new int[n + 1];\n int[] dp = new int[n + 1];\n Map registries = new HashMap<>();\n for (int i = 1; i <= n; i++) {\n colors[i] = io.readInt();\n if (i == 1) {\n dp[i] = 1;\n } else {\n int last = registries.getOrDefault(colors[i], 0);\n dp[i] = dp[i - 1];\n if (last != i - 1) {\n dp[i] = mod(dp[i] + dp[last]);\n }\n }\n registries.put(colors[i], i);\n }\n\n io.cache.append(dp[n]);\n }\n }\n\n public static class FastIO {\n public final StringBuilder cache = new StringBuilder();\n private final InputStream is;\n private final OutputStream os;\n private final Charset charset;\n private StringBuilder defaultStringBuf = new StringBuilder(1 << 8);\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastIO(InputStream is, OutputStream os, Charset charset) {\n this.is = is;\n this.os = os;\n this.charset = charset;\n }\n\n public FastIO(InputStream is, OutputStream os) {\n this(is, os, Charset.forName(\"ascii\"));\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public long readLong() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n long val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n public double readDouble() {\n boolean sign = true;\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+';\n next = read();\n }\n\n long val = 0;\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n if (next != '.') {\n return sign ? val : -val;\n }\n next = read();\n long radix = 1;\n long point = 0;\n while (next >= '0' && next <= '9') {\n point = point * 10 + next - '0';\n radix = radix * 10;\n next = read();\n }\n double result = val + (double) point / radix;\n return sign ? result : -result;\n }\n\n public String readString(StringBuilder builder) {\n skipBlank();\n\n while (next > 32) {\n builder.append((char) next);\n next = read();\n }\n\n return builder.toString();\n }\n\n public String readString() {\n defaultStringBuf.setLength(0);\n return readString(defaultStringBuf);\n }\n\n public int readLine(char[] data, int offset) {\n int originalOffset = offset;\n while (next != -1 && next != '\\n') {\n data[offset++] = (char) next;\n next = read();\n }\n return offset - originalOffset;\n }\n\n public int readString(char[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (char) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public int readString(byte[] data, int offset) {\n skipBlank();\n\n int originalOffset = offset;\n while (next > 32) {\n data[offset++] = (byte) next;\n next = read();\n }\n\n return offset - originalOffset;\n }\n\n public char readChar() {\n skipBlank();\n char c = (char) next;\n next = read();\n return c;\n }\n\n public void flush() {\n try {\n os.write(cache.toString().getBytes(charset));\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public boolean hasMore() {\n skipBlank();\n return next != -1;\n }\n }\n\n public static class Debug {\n private boolean allowDebug;\n\n public Debug(boolean allowDebug) {\n this.allowDebug = allowDebug;\n }\n\n public void assertTrue(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (!flag) {\n fail();\n }\n }\n\n public void fail() {\n throw new RuntimeException();\n }\n\n public void assertFalse(boolean flag) {\n if (!allowDebug) {\n return;\n }\n if (flag) {\n fail();\n }\n }\n\n private void outputName(String name) {\n System.out.print(name + \" = \");\n }\n\n public void debug(String name, int x) {\n if (!allowDebug) {\n return;\n }\n\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, long x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, double x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, int[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, long[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, double[] x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.toString(x));\n }\n\n public void debug(String name, Object x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(\"\" + x);\n }\n\n public void debug(String name, Object... x) {\n if (!allowDebug) {\n return;\n }\n outputName(name);\n System.out.println(Arrays.deepToString(x));\n }\n }\n}\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N stones arranged in a row. The i-th stone from the left is painted in the color C_i.\n\nSnuke will perform the following operation zero or more times:\n\nChoose two stones painted in the same color. Repaint all the stones between them, with the color of the chosen stones.\n\nFind the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq C_i \\leq 2\\times 10^5(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1\n:\nC_N\n\nOutput\n\nPrint the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nSample Input 1\n\n5\n1\n2\n1\n2\n2\n\nSample Output 1\n\n3\n\nWe can make three sequences of colors of stones, as follows:\n\n(1,2,1,2,2), by doing nothing.\n\n(1,1,1,2,2), by choosing the first and third stones to perform the operation.\n\n(1,2,2,2,2), by choosing the second and fourth stones to perform the operation.\n\nSample Input 2\n\n6\n4\n2\n5\n4\n2\n4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1\n3\n1\n2\n3\n3\n2\n\nSample Output 3\n\n5", "sample_input": "5\n1\n2\n1\n2\n2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03096", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere are N stones arranged in a row. The i-th stone from the left is painted in the color C_i.\n\nSnuke will perform the following operation zero or more times:\n\nChoose two stones painted in the same color. Repaint all the stones between them, with the color of the chosen stones.\n\nFind the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq C_i \\leq 2\\times 10^5(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1\n:\nC_N\n\nOutput\n\nPrint the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nSample Input 1\n\n5\n1\n2\n1\n2\n2\n\nSample Output 1\n\n3\n\nWe can make three sequences of colors of stones, as follows:\n\n(1,2,1,2,2), by doing nothing.\n\n(1,1,1,2,2), by choosing the first and third stones to perform the operation.\n\n(1,2,2,2,2), by choosing the second and fourth stones to perform the operation.\n\nSample Input 2\n\n6\n4\n2\n5\n4\n2\n4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1\n3\n1\n2\n3\n3\n2\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 10337, "cpu_time_ms": 205, "memory_kb": 51132}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s973551440", "group_id": "codeNet:p03101", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.lang.reflect.Array;\nimport java.util.*;\n\npublic class Main {\n long MOD = 1000000007;\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n int H = sc.nextInt();\n int W = sc.nextInt();\n int h = sc.nextInt();\n int w = sc.nextInt();\n System.out.println((H-h)*(W-w));\n }\n\n public static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n }\n public static class BasicMath {\n private final int MAX = 510000;\n private final int MOD = 1000000007;\n private final long[] fac = new long[MAX];\n private final long[] finv= new long[MAX];\n private final long[] inv = new long[MAX];\n public long factorial(long num){\n if (num<2)return 1;\n else return num*factorial(num-1);\n }\n public int arraySum(int[] array){\n int ans = 0;\n for (int value : array) ans += value;\n return ans;\n }\n public double log(double base,double antilogarithm){\n return Math.log(antilogarithm)/Math.log(base);\n }\n public int gcd(int x,int y){\n if (y==0)return x;\n else return gcd(y,x%y);\n }\n public int lcm(int x,int y){\n return x/gcd(x,y)*y;\n }\n public HashMap factorization(long num){\n HashMap hash = new HashMap<>();\n long n = num;\n long count = 2;\n while (n>1){\n while (n%count==0){\n n/=count;\n if (hash.containsKey(count))hash.put(count,hash.get(count)+1);\n else hash.put(count,1L);\n }\n count++;\n }\n return hash;\n }\n public int sum(int[] num){\n int ans = 0;\n for (int i = 0; i < num.length;i++){\n ans += num[i];\n }\n return ans;\n }\n public int[] reduce(int small, int big){\n int ins = 2;\n while (ins<=small){\n if (small%ins==0&&big%ins==0){\n small/=ins;\n big/=ins;\n ins = 2;\n }else {\n ins++;\n }\n }\n return new int[]{small, big};\n }\n public int reduceCount(int small, int big){\n int ins = 2;\n int ans = 0;\n while (ins<=small){\n if (small%ins==0&&big%ins==0){\n small/=ins;\n big/=ins;\n ins = 2;\n ans++;\n }else {\n ins++;\n }\n }\n return ans;\n }\n public int binarySearch(int[] array, int target){\n int pos = -1;\n int left = 0;\n int right = array.length-1;\n int middle;\n while (pos==-1&&left<=right){\n middle = (left+right)/2;\n if (array[middle]==target)pos=middle;\n else if (array[middle]>target)right=middle-1;\n else left=middle+1;\n }\n return pos;\n }\n public long modPow(long a, long n, long mod){\n long res = 1;\n while (n>0){\n if ((n&1)!=0)res = res*a%mod;\n a=a*a%mod;\n n >>= 1;\n }\n return res;\n }\n public long modinv(long a, long mod){return modPow(a,mod-2,mod);}\n public void COMinit(){\n fac[0]=1;\n fac[1]=1;\n finv[0]=1;\n finv[1]=1;\n inv[1]=1;\n for (int i=2;i{\n private final int max = 1000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){return (head == (tail+1)%max);}\n public void enqueue(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T dequeue(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n }\n public static class Stack{\n private final int max = 100000;\n private final T[] stack =(T[]) new Object[max];\n private int top = 0;\n public boolean isEmpty(){return (top==0);}\n public boolean isFull(){return (top==max);}\n public void init(){top=0;}\n public void push(T v){\n if (isFull()){\n System.out.println(\"error: stack is full.\");\n return;\n }\n stack[top++] = v;\n }\n public T pop(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[--top];\n }\n }\n public static class Pair{\n private T A;\n private T B;\n Pair(T a,T b){\n A=a;\n B=b;\n }\n public void changeA(T a){A=a;}\n public void changeB(T b){B=b;}\n public void changeAB(T a,T b){A=a;B=b;}\n public static Comparator numberSortWithA = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A)return 0;\n else return 1;\n }\n };\n public static Comparator numberSortWithB = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B)return 0;\n else return 1;\n }\n };\n }\n public static class Graph{\n private final HashMap> graph = new HashMap<>();\n private final int Size;\n private int[] Depth;\n Graph(int size){\n for (int i=0;i());\n Size = size;\n }\n\n public void addEdge(int node1,int node2){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).add(node2);\n graph.get(node2).add(node1);\n }\n }\n public void addDirectEdge(int from,int to){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).add(to);\n }\n }\n public int[] Depth(int root){\n Queue q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n int[] depth = new int[Size];\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v)){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+1;\n }\n }\n }\n Depth = depth.clone();\n return depth;\n }\n }\n public static class UnionFindTree{\n int[] parent;\n int[] rank;\n int[] Size;\n public UnionFindTree(int size){\n this.parent = new int[size];\n this.rank = new int[size];\n this.Size = new int[size];\n for (int i=0;irank[yRoot]){\n parent[yRoot] = xRoot;\n Size[xRoot]+=Size[yRoot];\n }else if (rank[xRoot] Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n }\n public static class BasicMath {\n private final int MAX = 510000;\n private final int MOD = 1000000007;\n private final long[] fac = new long[MAX];\n private final long[] finv= new long[MAX];\n private final long[] inv = new long[MAX];\n public long factorial(long num){\n if (num<2)return 1;\n else return num*factorial(num-1);\n }\n public int arraySum(int[] array){\n int ans = 0;\n for (int value : array) ans += value;\n return ans;\n }\n public double log(double base,double antilogarithm){\n return Math.log(antilogarithm)/Math.log(base);\n }\n public int gcd(int x,int y){\n if (y==0)return x;\n else return gcd(y,x%y);\n }\n public int lcm(int x,int y){\n return x/gcd(x,y)*y;\n }\n public HashMap factorization(long num){\n HashMap hash = new HashMap<>();\n long n = num;\n long count = 2;\n while (n>1){\n while (n%count==0){\n n/=count;\n if (hash.containsKey(count))hash.put(count,hash.get(count)+1);\n else hash.put(count,1L);\n }\n count++;\n }\n return hash;\n }\n public int sum(int[] num){\n int ans = 0;\n for (int i = 0; i < num.length;i++){\n ans += num[i];\n }\n return ans;\n }\n public int[] reduce(int small, int big){\n int ins = 2;\n while (ins<=small){\n if (small%ins==0&&big%ins==0){\n small/=ins;\n big/=ins;\n ins = 2;\n }else {\n ins++;\n }\n }\n return new int[]{small, big};\n }\n public int reduceCount(int small, int big){\n int ins = 2;\n int ans = 0;\n while (ins<=small){\n if (small%ins==0&&big%ins==0){\n small/=ins;\n big/=ins;\n ins = 2;\n ans++;\n }else {\n ins++;\n }\n }\n return ans;\n }\n public int binarySearch(int[] array, int target){\n int pos = -1;\n int left = 0;\n int right = array.length-1;\n int middle;\n while (pos==-1&&left<=right){\n middle = (left+right)/2;\n if (array[middle]==target)pos=middle;\n else if (array[middle]>target)right=middle-1;\n else left=middle+1;\n }\n return pos;\n }\n public long modPow(long a, long n, long mod){\n long res = 1;\n while (n>0){\n if ((n&1)!=0)res = res*a%mod;\n a=a*a%mod;\n n >>= 1;\n }\n return res;\n }\n public long modinv(long a, long mod){return modPow(a,mod-2,mod);}\n public void COMinit(){\n fac[0]=1;\n fac[1]=1;\n finv[0]=1;\n finv[1]=1;\n inv[1]=1;\n for (int i=2;i{\n private final int max = 1000000;\n private final T[] queue = (T[]) new Object[max];\n private int tail = 0; private int head = 0;\n public void init(){this.head = 0; tail = 0;}\n public boolean isEmpty(){return (head==tail);}\n public boolean isFull(){return (head == (tail+1)%max);}\n public void enqueue(T v){\n if (isFull()){\n System.out.println(\"error: queue is full.\");\n return;\n }\n queue[tail++] = v;\n if (tail == max) tail = 0;\n }\n public T dequeue(){\n if (isEmpty()){\n System.out.println(\"error: queue is empty\");\n return null;\n }\n T res = queue[head];\n ++head;\n if (head == max) head = 0;\n return res;\n }\n }\n public static class Stack{\n private final int max = 100000;\n private final T[] stack =(T[]) new Object[max];\n private int top = 0;\n public boolean isEmpty(){return (top==0);}\n public boolean isFull(){return (top==max);}\n public void init(){top=0;}\n public void push(T v){\n if (isFull()){\n System.out.println(\"error: stack is full.\");\n return;\n }\n stack[top++] = v;\n }\n public T pop(){\n if (isEmpty()){\n System.out.println(\"error: stack is empty\");\n return null;\n }\n return stack[--top];\n }\n }\n public static class Pair{\n private T A;\n private T B;\n Pair(T a,T b){\n A=a;\n B=b;\n }\n public void changeA(T a){A=a;}\n public void changeB(T b){B=b;}\n public void changeAB(T a,T b){A=a;B=b;}\n public static Comparator numberSortWithA = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.A<(int)q.A)return -1;\n else if ((int)p.A==(int)q.A)return 0;\n else return 1;\n }\n };\n public static Comparator numberSortWithB = new Comparator() {\n @Override\n public int compare(Object o1, Object o2) {\n Pair p = (Pair)o1;\n Pair q = (Pair)o2;\n if ((int)p.B<(int)q.B)return -1;\n else if ((int)p.B==(int)q.B)return 0;\n else return 1;\n }\n };\n }\n public static class Graph{\n private final HashMap> graph = new HashMap<>();\n private final int Size;\n private int[] Depth;\n Graph(int size){\n for (int i=0;i());\n Size = size;\n }\n\n public void addEdge(int node1,int node2){\n if (graph.containsKey(node1)&&graph.containsKey(node2)){\n graph.get(node1).add(node2);\n graph.get(node2).add(node1);\n }\n }\n public void addDirectEdge(int from,int to){\n if (graph.containsKey(from)&&graph.containsKey(to)){\n graph.get(from).add(to);\n }\n }\n public int[] Depth(int root){\n Queue q = new Queue<>();\n q.enqueue(root);\n boolean[] seen = new boolean[Size];\n Arrays.fill(seen, false);\n seen[root]=true;\n int[] depth = new int[Size];\n depth[root]=0;\n while (!q.isEmpty()){\n int v = q.dequeue();\n for (int u : graph.get(v)){\n if (!seen[u]){\n seen[u]=true;\n q.enqueue(u);\n depth[u]=depth[v]+1;\n }\n }\n }\n Depth = depth.clone();\n return depth;\n }\n }\n public static class UnionFindTree{\n int[] parent;\n int[] rank;\n int[] Size;\n public UnionFindTree(int size){\n this.parent = new int[size];\n this.rank = new int[size];\n this.Size = new int[size];\n for (int i=0;irank[yRoot]){\n parent[yRoot] = xRoot;\n Size[xRoot]+=Size[yRoot];\n }else if (rank[xRoot] 0){\n \t\tcounter++;\n \t}\n }\n \tSystem.out.print(counter);\n \t\n }\n \n}", "language": "Java", "metadata": {"date": 1553004051, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03101.html", "problem_id": "p03101", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03101/input.txt", "sample_output_relpath": "derived/input_output/data/p03101/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03101/Java/s727560797.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s727560797", "user_id": "u347452770"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n \npublic class Main{\n\tpublic static void main(String[] args){\n \tScanner scan = new Scanner(System.in);\n \tint counter = 0;\n \tint N = scan.nextInt();\n \tint M = scan.nextInt();\n \tint C = scan.nextInt();\n \tint[] B = new int[M];\n \tfor(int i = 0; i < M; i++){\n \t\tB[i] = scan.nextInt();\n }\n \tfor(int k = 0; k < N; k++){\n \t\tint[] A = new int[M];\n \t\tfor(int i = 0; i < M; i++){\n \t\tA[i] = scan.nextInt();\n \t}\n \t\tint sahen = 0;\n \t\tfor(int j = 0; j < M; j++){\n \t\tsahen = sahen + A[j] * B[j];\n \t}\n \t\tif(sahen + C > 0){\n \t\tcounter++;\n \t}\n }\n \tSystem.out.print(counter);\n \t\n }\n \n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "sample_input": "3 2\n2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03101", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 724, "cpu_time_ms": 96, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s117751487", "group_id": "codeNet:p03103", "input_text": "import java.util.HashMap;\n\timport java.util.Map;\n\timport java.util.Map.Entry;\n\timport java.util.Scanner;\n\timport java.util.TreeMap;\n\n\tpublic class Main{\n\n\t\tpublic static void main(String[] args) {\n\n\t\t\tScanner scanner = new Scanner(System.in);\n\n\t\t\tMap list = new HashMap();\n\n\t\t\tString[] temp = scanner.nextLine().split(\" \");\n\t\t\tint n = Integer.parseInt(temp[0]);\n\t\t\tint m = Integer.parseInt(temp[1]);\n\t\t\tint t1 = 0;\n\t\t\tint t2 = 0;\n\t\t\tfor(int i = 0; i < n; i ++) {\n\t\t\t\ttemp = scanner.nextLine().split(\" \");\n\t\t\t\tt1 = Integer.parseInt(temp[0]);\n\t\t\t\tt2 = Integer.parseInt(temp[1]);\n\t\t\t\tif(list.containsKey(t1)) {\n\n\t\t\t\t\tt2 = list.get(t1);\n\t\t\t\t\tlist.put(t1, t2);\n\t\t\t\t}else {\n\t\t\t\t\tlist.put(t1, t2);\n\t\t\t\t}\n\t\t\t}\n\t\t\tTreeMap sorted = new TreeMap<>(list);\n\n\t\t\tlong ans = 0;\n\t\t\tint kakaku = 0;\n\t\t\tint kazu = 0;\n\t\t\tint flag = m;\n\t\t\tfor(Entry entry : sorted.entrySet()) {\n\t\t\t\tkakaku = entry.getKey();\n\t\t\t\tkazu = entry.getValue();\n\n\t\t\t\tfor(int i = 0; i < kazu ; i++) {\n\t\t\t\t\tflag--;\n\t\t\t\t\tans += kakaku;\n\t\t\t\t\tif(flag == 0) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(flag == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tSystem.out.println(ans);\n\n\n\t\t}\n\n\t}\n", "language": "Java", "metadata": {"date": 1589543286, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03103.html", "problem_id": "p03103", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03103/input.txt", "sample_output_relpath": "derived/input_output/data/p03103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03103/Java/s117751487.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s117751487", "user_id": "u960002659"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "import java.util.HashMap;\n\timport java.util.Map;\n\timport java.util.Map.Entry;\n\timport java.util.Scanner;\n\timport java.util.TreeMap;\n\n\tpublic class Main{\n\n\t\tpublic static void main(String[] args) {\n\n\t\t\tScanner scanner = new Scanner(System.in);\n\n\t\t\tMap list = new HashMap();\n\n\t\t\tString[] temp = scanner.nextLine().split(\" \");\n\t\t\tint n = Integer.parseInt(temp[0]);\n\t\t\tint m = Integer.parseInt(temp[1]);\n\t\t\tint t1 = 0;\n\t\t\tint t2 = 0;\n\t\t\tfor(int i = 0; i < n; i ++) {\n\t\t\t\ttemp = scanner.nextLine().split(\" \");\n\t\t\t\tt1 = Integer.parseInt(temp[0]);\n\t\t\t\tt2 = Integer.parseInt(temp[1]);\n\t\t\t\tif(list.containsKey(t1)) {\n\n\t\t\t\t\tt2 = list.get(t1);\n\t\t\t\t\tlist.put(t1, t2);\n\t\t\t\t}else {\n\t\t\t\t\tlist.put(t1, t2);\n\t\t\t\t}\n\t\t\t}\n\t\t\tTreeMap sorted = new TreeMap<>(list);\n\n\t\t\tlong ans = 0;\n\t\t\tint kakaku = 0;\n\t\t\tint kazu = 0;\n\t\t\tint flag = m;\n\t\t\tfor(Entry entry : sorted.entrySet()) {\n\t\t\t\tkakaku = entry.getKey();\n\t\t\t\tkazu = entry.getValue();\n\n\t\t\t\tfor(int i = 0; i < kazu ; i++) {\n\t\t\t\t\tflag--;\n\t\t\t\t\tans += kakaku;\n\t\t\t\t\tif(flag == 0) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(flag == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tSystem.out.println(ans);\n\n\n\t\t}\n\n\t}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "2 5\n4 9\n2 4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03103", "source_text": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1183, "cpu_time_ms": 720, "memory_kb": 130460}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s974260683", "group_id": "codeNet:p03109", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n String s;\n String k=\"2019/04/30\";\n Scanner input = new Scanner(System.in);\n s = input.nextLine();\n if(s.contains(\"2019\"))\n {\n if(s.equals(k))\n {\n System.out.println(\"Heisei\");\n }\n else\n {\n System.out.println(\"TBD\");\n }\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1565277808, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03109.html", "problem_id": "p03109", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03109/input.txt", "sample_output_relpath": "derived/input_output/data/p03109/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03109/Java/s974260683.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s974260683", "user_id": "u568382716"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n String s;\n String k=\"2019/04/30\";\n Scanner input = new Scanner(System.in);\n s = input.nextLine();\n if(s.contains(\"2019\"))\n {\n if(s.equals(k))\n {\n System.out.println(\"Heisei\");\n }\n else\n {\n System.out.println(\"TBD\");\n }\n }\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "sample_input": "2019/04/30\n"}, "reference_outputs": ["Heisei\n"], "source_document_id": "p03109", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 437, "cpu_time_ms": 93, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s185775930", "group_id": "codeNet:p03110", "input_text": "\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.AbstractMap;\nimport java.util.NoSuchElementException;\n\n\n\n/** テンプレート */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tint N = sc.nextInt();\n\n//\t\tint M = sc.nextInt();\n//\n\t\tdouble sum = 0;\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tdouble x = sc.nextDouble();\n\t\t\tString s = \tsc.next();\n\n\t\t\tif(s.equals(\"JPY\")) {\n\t\t\t\tsum += x ;\n\t\t\t}else {\n\t\t\t\tsum += x * 380000.0;\n\t\t\t}\n\t\t}\n\n\t\t//************************************/\n\t\t// ここから出力処理\n\t\t//************************************/\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tout.println(sum);\n\t\t// 最後に必ずFlush\n\t\tout.flush();\n\t}\n}\n\n\n\n\n///** テンプレート */\n//public class Main {\n//\tpublic static void main(String[] args) {\n//\t\tFastScanner sc = new FastScanner();\n//\t\tint N = sc.nextInt();\n//\t\tint M = sc.nextInt();\n//\n//\t\tint[] ary = new int[N];\n//\t\tfor(int i = 0; i < N; i++) {\n//\t\t\tary[i] = sc.nextInt();\n//\t\t}\n//\n//\t\t//************************************/\n//\t\t// ここから出力処理\n//\t\t//************************************/\n//\t\tPrintWriter out = new PrintWriter(System.out);\n//\n//\n//\t\tout.println(\"hoge\");\n//\n//\t\t// 最後に必ずFlush\n//\t\tout.flush();\n//\t}\n//}\n\n/** スキャン用 */\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\t/** クラス内部用だよ */\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\t/** クラス内部用だよ */\n\tprivate int readByte() {\n\t\tif (hasNextByte()) {\n\t\t\treturn buffer[ptr++];\n\t\t} else {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\t/**\n\t * クラス内部用だよ\n\t * ASCII の文字の内、表示用の文字を返す関数\n\t *\n\t * @return 改行とか制御文字じゃない、表示用文字ならtrue\n\t * */\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\t/**\n\t * @return 改行文字とか空白以外を除いた、次の文字があればtrue\n\t * */\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n\t\t\tptr++;\n\t\t}\n\t\treturn hasNextByte();\n\t}\n\n\t/**\n\t *\n\t * @return 次の文字列\n\t */\n\tpublic String next() {\n\t\tif (!hasNext()) {\n\t\t\tthrow new NoSuchElementException();\n\t\t}\n\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\t/**\n\t *\n\t * @return 次のLong\n\t */\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\t/**\n\t *\n\t * @return 次のInt\n\t */\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\t/**\n\t *\n\t * @return 次のDouble\n\t */\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n\nclass Pair extends AbstractMap.SimpleEntry {\n\t/** serialVersionUID. */\n\tprivate static final long serialVersionUID = 6411527075103472113L;\n\n\tpublic Pair(final K key, final V value) {\n\t\tsuper(key, value);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1551039265, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Java/s185775930.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s185775930", "user_id": "u635596076"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.AbstractMap;\nimport java.util.NoSuchElementException;\n\n\n\n/** テンプレート */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tint N = sc.nextInt();\n\n//\t\tint M = sc.nextInt();\n//\n\t\tdouble sum = 0;\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tdouble x = sc.nextDouble();\n\t\t\tString s = \tsc.next();\n\n\t\t\tif(s.equals(\"JPY\")) {\n\t\t\t\tsum += x ;\n\t\t\t}else {\n\t\t\t\tsum += x * 380000.0;\n\t\t\t}\n\t\t}\n\n\t\t//************************************/\n\t\t// ここから出力処理\n\t\t//************************************/\n\t\tPrintWriter out = new PrintWriter(System.out);\n\n\t\tout.println(sum);\n\t\t// 最後に必ずFlush\n\t\tout.flush();\n\t}\n}\n\n\n\n\n///** テンプレート */\n//public class Main {\n//\tpublic static void main(String[] args) {\n//\t\tFastScanner sc = new FastScanner();\n//\t\tint N = sc.nextInt();\n//\t\tint M = sc.nextInt();\n//\n//\t\tint[] ary = new int[N];\n//\t\tfor(int i = 0; i < N; i++) {\n//\t\t\tary[i] = sc.nextInt();\n//\t\t}\n//\n//\t\t//************************************/\n//\t\t// ここから出力処理\n//\t\t//************************************/\n//\t\tPrintWriter out = new PrintWriter(System.out);\n//\n//\n//\t\tout.println(\"hoge\");\n//\n//\t\t// 最後に必ずFlush\n//\t\tout.flush();\n//\t}\n//}\n\n/** スキャン用 */\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\t/** クラス内部用だよ */\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\t/** クラス内部用だよ */\n\tprivate int readByte() {\n\t\tif (hasNextByte()) {\n\t\t\treturn buffer[ptr++];\n\t\t} else {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\t/**\n\t * クラス内部用だよ\n\t * ASCII の文字の内、表示用の文字を返す関数\n\t *\n\t * @return 改行とか制御文字じゃない、表示用文字ならtrue\n\t * */\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\t/**\n\t * @return 改行文字とか空白以外を除いた、次の文字があればtrue\n\t * */\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n\t\t\tptr++;\n\t\t}\n\t\treturn hasNextByte();\n\t}\n\n\t/**\n\t *\n\t * @return 次の文字列\n\t */\n\tpublic String next() {\n\t\tif (!hasNext()) {\n\t\t\tthrow new NoSuchElementException();\n\t\t}\n\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\t/**\n\t *\n\t * @return 次のLong\n\t */\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\t/**\n\t *\n\t * @return 次のInt\n\t */\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\t/**\n\t *\n\t * @return 次のDouble\n\t */\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n\nclass Pair extends AbstractMap.SimpleEntry {\n\t/** serialVersionUID. */\n\tprivate static final long serialVersionUID = 6411527075103472113L;\n\n\tpublic Pair(final K key, final V value) {\n\t\tsuper(key, value);\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3806, "cpu_time_ms": 72, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s254206994", "group_id": "codeNet:p03111", "input_text": "\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String [] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n int a = scanner.nextInt();\n int b = scanner.nextInt();\n int c = scanner.nextInt();\n\n int[] length = new int[n];\n for (int i = 0; i < n; ++i) {\n length[i] = scanner.nextInt();\n }\n int res = dfs(length, 0, a, b, c, 0, 0, 0);\n System.out.println(res);\n\n }\n\n static int dfs(int [] length, int current, int a, int b, int c, int sumA, int sumB, int sumC) {\n if (current == length.length) {\n if (sumA != 0 && sumB != 0 && sumC != 0) {\n return Math.abs(a - sumA) + Math.abs(b - sumB) + Math.abs(c - sumC) - 30;\n }\n return Integer.MAX_VALUE;\n }\n int res1 = dfs(length, current + 1, a, b, c, sumA, sumB, sumC);\n int res2 = dfs(length, current + 1, a, b ,c,sumA + length[current], sumB, sumC) + 10;\n int res3 = dfs(length, current + 1, a, b, c, sumA,sumB + length[current], sumC) + 10;\n int res4 = dfs(length, current + 1, a, b, c, sumA, sumB, sumC + length[current]) + 10;\n return Math.min(Math.min(res1, res2), Math.min(res3, res4));\n }\n}\n", "language": "Java", "metadata": {"date": 1551046979, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03111.html", "problem_id": "p03111", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03111/input.txt", "sample_output_relpath": "derived/input_output/data/p03111/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03111/Java/s254206994.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s254206994", "user_id": "u381467237"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String [] args) {\n Scanner scanner = new Scanner(System.in);\n int n = scanner.nextInt();\n int a = scanner.nextInt();\n int b = scanner.nextInt();\n int c = scanner.nextInt();\n\n int[] length = new int[n];\n for (int i = 0; i < n; ++i) {\n length[i] = scanner.nextInt();\n }\n int res = dfs(length, 0, a, b, c, 0, 0, 0);\n System.out.println(res);\n\n }\n\n static int dfs(int [] length, int current, int a, int b, int c, int sumA, int sumB, int sumC) {\n if (current == length.length) {\n if (sumA != 0 && sumB != 0 && sumC != 0) {\n return Math.abs(a - sumA) + Math.abs(b - sumB) + Math.abs(c - sumC) - 30;\n }\n return Integer.MAX_VALUE;\n }\n int res1 = dfs(length, current + 1, a, b, c, sumA, sumB, sumC);\n int res2 = dfs(length, current + 1, a, b ,c,sumA + length[current], sumB, sumC) + 10;\n int res3 = dfs(length, current + 1, a, b, c, sumA,sumB + length[current], sumC) + 10;\n int res4 = dfs(length, current + 1, a, b, c, sumA, sumB, sumC + length[current]) + 10;\n return Math.min(Math.min(res1, res2), Math.min(res3, res4));\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.\n\nYour objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:\n\nExtension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.\n\nShortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.\n\nComposition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)\n\nAt least how much MP is needed to achieve the objective?\n\nConstraints\n\n3 \\leq N \\leq 8\n\n1 \\leq C < B < A \\leq 1000\n\n1 \\leq l_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\nl_1\nl_2\n:\nl_N\n\nOutput\n\nPrint the minimum amount of MP needed to achieve the objective.\n\nSample Input 1\n\n5 100 90 80\n98\n40\n30\n21\n80\n\nSample Output 1\n\n23\n\nWe are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.\n\nUse Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)\n\nUse Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)\n\nUse Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)\n\nUse Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)\n\nSample Input 2\n\n8 100 90 80\n100\n100\n90\n90\n90\n80\n80\n80\n\nSample Output 2\n\n0\n\nIf we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.\n\nSample Input 3\n\n8 1000 800 100\n300\n333\n400\n444\n500\n555\n600\n666\n\nSample Output 3\n\n243", "sample_input": "5 100 90 80\n98\n40\n30\n21\n80\n"}, "reference_outputs": ["23\n"], "source_document_id": "p03111", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.\n\nYour objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:\n\nExtension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.\n\nShortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.\n\nComposition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)\n\nAt least how much MP is needed to achieve the objective?\n\nConstraints\n\n3 \\leq N \\leq 8\n\n1 \\leq C < B < A \\leq 1000\n\n1 \\leq l_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\nl_1\nl_2\n:\nl_N\n\nOutput\n\nPrint the minimum amount of MP needed to achieve the objective.\n\nSample Input 1\n\n5 100 90 80\n98\n40\n30\n21\n80\n\nSample Output 1\n\n23\n\nWe are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.\n\nUse Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)\n\nUse Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)\n\nUse Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)\n\nUse Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)\n\nSample Input 2\n\n8 100 90 80\n100\n100\n90\n90\n90\n80\n80\n80\n\nSample Output 2\n\n0\n\nIf we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.\n\nSample Input 3\n\n8 1000 800 100\n300\n333\n400\n444\n500\n555\n600\n666\n\nSample Output 3\n\n243", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1283, "cpu_time_ms": 111, "memory_kb": 23252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s676457756", "group_id": "codeNet:p03125", "input_text": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n void run() {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt(), b = sc.nextInt();\n\n if (b % a == 0) {\n System.out.println(a + b);\n } else {\n System.out.println(b - a);\n }\n }\n\n void debug(Object...os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "language": "Java", "metadata": {"date": 1550369040, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03125.html", "problem_id": "p03125", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03125/input.txt", "sample_output_relpath": "derived/input_output/data/p03125/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03125/Java/s676457756.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s676457756", "user_id": "u726872801"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n void run() {\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt(), b = sc.nextInt();\n\n if (b % a == 0) {\n System.out.println(a + b);\n } else {\n System.out.println(b - a);\n }\n }\n\n void debug(Object...os) {\n System.err.println(Arrays.deepToString(os));\n }\n\n public static void main(String[] args) {\n new Main().run();\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nSample Input 1\n\n4 12\n\nSample Output 1\n\n16\n\nAs 4 is a divisor of 12, 4 + 12 = 16 should be printed.\n\nSample Input 2\n\n8 20\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n2\n\n1 is a divisor of 1.", "sample_input": "4 12\n"}, "reference_outputs": ["16\n"], "source_document_id": "p03125", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nSample Input 1\n\n4 12\n\nSample Output 1\n\n16\n\nAs 4 is a divisor of 12, 4 + 12 = 16 should be printed.\n\nSample Input 2\n\n8 20\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n2\n\n1 is a divisor of 1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 492, "cpu_time_ms": 109, "memory_kb": 22224}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s488864932", "group_id": "codeNet:p03127", "input_text": "\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t//\t\tnew Main().solveA();\n\t\t//\t\tnew Main().solveB();\n\t\tnew Main().solveC();\n\t\t// new Main().solveD();\n\t}\n\n\tprivate void solveA() {\n\t\tScanner scanner = null;\n\t\tint lineAB = 0;\n\t\tint lineBC = 0;\n\n\t\ttry {\n\t\t\tscanner = new Scanner(System.in);\n\t\t\tlineAB = scanner.nextInt();\n\t\t\tlineBC = scanner.nextInt();\n\n\t\t\tif (lineBC % lineAB == 0) {\n\t\t\t\tSystem.out.println(lineAB + lineBC);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(lineBC - lineAB);\n\t\t\t}\n\n\t\t\tSystem.out.println(\"\");\n\n\t\t} finally {\n\t\t\tif (scanner != null) {\n\t\t\t\tscanner.close();\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate void solveB() {\n\t\tScanner scanner = null;\n\t\tint nNin = 0;\n\t\tint mSyurui = 0;\n\n\t\ttry {\n\t\t\tscanner = new Scanner(System.in);\n\t\t\tString line1 = scanner.nextLine();\n\t\t\tString[] wkStr1 = line1.split(\" \");\n\t\t\tnNin = Integer.parseInt(wkStr1[0]);\n\t\t\tmSyurui = Integer.parseInt(wkStr1[1]);\n\n\t\t\tList> wkList = new ArrayList>();\n\n\t\t\tfor (int i = 0; i < nNin; i++) {\n\t\t\t\tString wk = scanner.nextLine();\n\t\t\t\tString[] wkStr = wk.split(\" \");\n\t\t\t\tList wkInnerList = new ArrayList();\n\t\t\t\tfor (int j = 1; j < wkStr.length; j++) {\n\t\t\t\t\twkInnerList.add(Integer.parseInt(wkStr[j]));\n\t\t\t\t}\n\t\t\t\twkList.add(wkInnerList);\n\t\t\t}\n\n\t\t\tint result = 0;\n\t\t\tList alreadyFinishList = new ArrayList();\n\t\t\tfor (int i = 0; i < wkList.size(); i++) {\n\t\t\t\tList wkInnerList = wkList.get(i);\n\t\t\t\tfor (int i2 = 0; i2 < wkInnerList.size(); i2++) {\n\t\t\t\t\tint syokuNum = wkInnerList.get(i2);\n\t\t\t\t\tif (alreadyFinishList.contains(syokuNum)) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (isContain(nNin, wkList, i, syokuNum)) {\n\t\t\t\t\t\tresult++;\n\t\t\t\t\t}\n\t\t\t\t\talreadyFinishList.add(syokuNum);\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tSystem.out.println(result);\n\n\t\t} finally {\n\t\t\tif (scanner != null) {\n\t\t\t\tscanner.close();\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate boolean isContain(int nNin, List> wkList, int i, int syokuNum) {\n\t\tint result = 0;\n\t\tfor (int j = 0; j < nNin; j++) {\n\t\t\tif (i == j || j >= wkList.size()) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tList wkSarchList = wkList.get(j);\n\t\t\tif (wkSarchList.contains(syokuNum)) {\n\t\t\t\tresult++;\n\t\t\t}\n\n\t\t}\n\t\treturn result == nNin - 1;\n\t}\n\n\tpublic long maximuKouyakuNArgs(long currentKouyaku, long[] nums, int start) {\n\t\tlong res = currentKouyaku;\n\t\tif (start < nums.length && start != nums.length) {\n\t\t\tres = maximumKouyaku2Args(nums[start], currentKouyaku);\n\t\t\treturn maximuKouyakuNArgs(res, nums, start + 1);\n\t\t} else {\n\t\t\treturn res;\n\t\t}\n\t}\n\n\tpublic long maximumKouyaku2Args(long num1, long num2) {\n\t\ttry {\n\t\t\tlong wkVal1;\n\t\t\tlong wkVal2;\n\t\t\tif (num1 < num2) {\n\t\t\t\twkVal1 = num2;\n\t\t\t\twkVal2 = num1;\n\t\t\t} else {\n\t\t\t\twkVal1 = num1;\n\t\t\t\twkVal2 = num2;\n\t\t\t}\n\t\t\tlong res = wkVal1 % wkVal2;\n\t\t\tif (res != 0) {\n\t\t\t\treturn maximumKouyaku2Args(wkVal2, res);\n\t\t\t} else {\n\t\t\t\treturn wkVal2;\n\t\t\t}\n\n\t\t} catch (Exception e) {\n\t\t\tSystem.out.println(\"num1 : \" + num1 + \" / num2:\" + num2);\n\t\t\te.printStackTrace();\n\t\t\treturn -1;\n\t\t}\n\n\t}\n\n\tprivate void solveC() {\n\t\tScanner scanner = null;\n\t\tint monsterNum = 0;\n\n\t\ttry {\n\t\t\tscanner = new Scanner(System.in);\n\t\t\tmonsterNum = scanner.nextInt();\n\t\t\tlong[] monsters = new long[monsterNum];\n\t\t\tfor (int i = 0; i < monsterNum; i++) {\n\t\t\t\tmonsters[i] = scanner.nextInt();\n\t\t\t}\n\t\t\t//\n\t\t\t//\t\t\tArrays.sort(monsters);\n\t\t\t//\t\t\tint minHP = Integer.MAX_VALUE;\n\t\t\t//\t\t\tif (monsters[0] == monsters[monsters.length - 1]) {\n\t\t\t//\t\t\t\tSystem.out.println(monsters[0]);\n\t\t\t//\t\t\t\treturn;\n\t\t\t//\t\t\t} else {\n\t\t\t//\t\t\t\tminHP = getMinHP(monsters, minHP);\n\t\t\t//\t\t\t}\n\t\t\tSystem.out.println(maximuKouyakuNArgs(monsters[0], monsters, 0));\n\n\t\t} finally {\n\t\t\tif (scanner != null) {\n\t\t\t\tscanner.close();\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate Map wkHP = new HashMap();\n\n\tprivate int getMinHP(int[] monsters, int minHP) {\n\t\tint resultHP = minHP;\n\t\ttry {\n\t\t\tif (wkHP.get(minHP) != null) {\n\t\t\t\treturn wkHP.get(minHP);\n\t\t\t}\n\t\t\tfor (int i = 0; i < monsters.length; i++) {\n\t\t\t\tif (i == 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (monsters[i] % monsters[0] == 0) {\n\t\t\t\t\tresultHP = Math.min(monsters[0], resultHP);\n\t\t\t\t} else {\n\t\t\t\t\tresultHP = Math.min(monsters[i] % monsters[0], resultHP);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (resultHP > 2) {\n\t\t\t\tresultHP = getMinHP(monsters, resultHP);\n\t\t\t}\n\t\t\twkHP.put(minHP, resultHP);\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn resultHP;\n\n\t}\n\n\tprivate void solveD() {\n\t\tScanner scanner = null;\n\t\tint lineAB = 0;\n\t\tint lineBC = 0;\n\t\tint lineCA = 0;\n\n\t\ttry {\n\t\t\tscanner = new Scanner(System.in);\n\t\t\tlineAB = scanner.nextInt();\n\n\t\t\tSystem.out.println(\"\");\n\n\t\t} finally {\n\t\t\tif (scanner != null) {\n\t\t\t\tscanner.close();\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1550405091, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03127.html", "problem_id": "p03127", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03127/input.txt", "sample_output_relpath": "derived/input_output/data/p03127/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03127/Java/s488864932.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488864932", "user_id": "u345932819"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t//\t\tnew Main().solveA();\n\t\t//\t\tnew Main().solveB();\n\t\tnew Main().solveC();\n\t\t// new Main().solveD();\n\t}\n\n\tprivate void solveA() {\n\t\tScanner scanner = null;\n\t\tint lineAB = 0;\n\t\tint lineBC = 0;\n\n\t\ttry {\n\t\t\tscanner = new Scanner(System.in);\n\t\t\tlineAB = scanner.nextInt();\n\t\t\tlineBC = scanner.nextInt();\n\n\t\t\tif (lineBC % lineAB == 0) {\n\t\t\t\tSystem.out.println(lineAB + lineBC);\n\t\t\t} else {\n\t\t\t\tSystem.out.println(lineBC - lineAB);\n\t\t\t}\n\n\t\t\tSystem.out.println(\"\");\n\n\t\t} finally {\n\t\t\tif (scanner != null) {\n\t\t\t\tscanner.close();\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate void solveB() {\n\t\tScanner scanner = null;\n\t\tint nNin = 0;\n\t\tint mSyurui = 0;\n\n\t\ttry {\n\t\t\tscanner = new Scanner(System.in);\n\t\t\tString line1 = scanner.nextLine();\n\t\t\tString[] wkStr1 = line1.split(\" \");\n\t\t\tnNin = Integer.parseInt(wkStr1[0]);\n\t\t\tmSyurui = Integer.parseInt(wkStr1[1]);\n\n\t\t\tList> wkList = new ArrayList>();\n\n\t\t\tfor (int i = 0; i < nNin; i++) {\n\t\t\t\tString wk = scanner.nextLine();\n\t\t\t\tString[] wkStr = wk.split(\" \");\n\t\t\t\tList wkInnerList = new ArrayList();\n\t\t\t\tfor (int j = 1; j < wkStr.length; j++) {\n\t\t\t\t\twkInnerList.add(Integer.parseInt(wkStr[j]));\n\t\t\t\t}\n\t\t\t\twkList.add(wkInnerList);\n\t\t\t}\n\n\t\t\tint result = 0;\n\t\t\tList alreadyFinishList = new ArrayList();\n\t\t\tfor (int i = 0; i < wkList.size(); i++) {\n\t\t\t\tList wkInnerList = wkList.get(i);\n\t\t\t\tfor (int i2 = 0; i2 < wkInnerList.size(); i2++) {\n\t\t\t\t\tint syokuNum = wkInnerList.get(i2);\n\t\t\t\t\tif (alreadyFinishList.contains(syokuNum)) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (isContain(nNin, wkList, i, syokuNum)) {\n\t\t\t\t\t\tresult++;\n\t\t\t\t\t}\n\t\t\t\t\talreadyFinishList.add(syokuNum);\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tSystem.out.println(result);\n\n\t\t} finally {\n\t\t\tif (scanner != null) {\n\t\t\t\tscanner.close();\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate boolean isContain(int nNin, List> wkList, int i, int syokuNum) {\n\t\tint result = 0;\n\t\tfor (int j = 0; j < nNin; j++) {\n\t\t\tif (i == j || j >= wkList.size()) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tList wkSarchList = wkList.get(j);\n\t\t\tif (wkSarchList.contains(syokuNum)) {\n\t\t\t\tresult++;\n\t\t\t}\n\n\t\t}\n\t\treturn result == nNin - 1;\n\t}\n\n\tpublic long maximuKouyakuNArgs(long currentKouyaku, long[] nums, int start) {\n\t\tlong res = currentKouyaku;\n\t\tif (start < nums.length && start != nums.length) {\n\t\t\tres = maximumKouyaku2Args(nums[start], currentKouyaku);\n\t\t\treturn maximuKouyakuNArgs(res, nums, start + 1);\n\t\t} else {\n\t\t\treturn res;\n\t\t}\n\t}\n\n\tpublic long maximumKouyaku2Args(long num1, long num2) {\n\t\ttry {\n\t\t\tlong wkVal1;\n\t\t\tlong wkVal2;\n\t\t\tif (num1 < num2) {\n\t\t\t\twkVal1 = num2;\n\t\t\t\twkVal2 = num1;\n\t\t\t} else {\n\t\t\t\twkVal1 = num1;\n\t\t\t\twkVal2 = num2;\n\t\t\t}\n\t\t\tlong res = wkVal1 % wkVal2;\n\t\t\tif (res != 0) {\n\t\t\t\treturn maximumKouyaku2Args(wkVal2, res);\n\t\t\t} else {\n\t\t\t\treturn wkVal2;\n\t\t\t}\n\n\t\t} catch (Exception e) {\n\t\t\tSystem.out.println(\"num1 : \" + num1 + \" / num2:\" + num2);\n\t\t\te.printStackTrace();\n\t\t\treturn -1;\n\t\t}\n\n\t}\n\n\tprivate void solveC() {\n\t\tScanner scanner = null;\n\t\tint monsterNum = 0;\n\n\t\ttry {\n\t\t\tscanner = new Scanner(System.in);\n\t\t\tmonsterNum = scanner.nextInt();\n\t\t\tlong[] monsters = new long[monsterNum];\n\t\t\tfor (int i = 0; i < monsterNum; i++) {\n\t\t\t\tmonsters[i] = scanner.nextInt();\n\t\t\t}\n\t\t\t//\n\t\t\t//\t\t\tArrays.sort(monsters);\n\t\t\t//\t\t\tint minHP = Integer.MAX_VALUE;\n\t\t\t//\t\t\tif (monsters[0] == monsters[monsters.length - 1]) {\n\t\t\t//\t\t\t\tSystem.out.println(monsters[0]);\n\t\t\t//\t\t\t\treturn;\n\t\t\t//\t\t\t} else {\n\t\t\t//\t\t\t\tminHP = getMinHP(monsters, minHP);\n\t\t\t//\t\t\t}\n\t\t\tSystem.out.println(maximuKouyakuNArgs(monsters[0], monsters, 0));\n\n\t\t} finally {\n\t\t\tif (scanner != null) {\n\t\t\t\tscanner.close();\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate Map wkHP = new HashMap();\n\n\tprivate int getMinHP(int[] monsters, int minHP) {\n\t\tint resultHP = minHP;\n\t\ttry {\n\t\t\tif (wkHP.get(minHP) != null) {\n\t\t\t\treturn wkHP.get(minHP);\n\t\t\t}\n\t\t\tfor (int i = 0; i < monsters.length; i++) {\n\t\t\t\tif (i == 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (monsters[i] % monsters[0] == 0) {\n\t\t\t\t\tresultHP = Math.min(monsters[0], resultHP);\n\t\t\t\t} else {\n\t\t\t\t\tresultHP = Math.min(monsters[i] % monsters[0], resultHP);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (resultHP > 2) {\n\t\t\t\tresultHP = getMinHP(monsters, resultHP);\n\t\t\t}\n\t\t\twkHP.put(minHP, resultHP);\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn resultHP;\n\n\t}\n\n\tprivate void solveD() {\n\t\tScanner scanner = null;\n\t\tint lineAB = 0;\n\t\tint lineBC = 0;\n\t\tint lineCA = 0;\n\n\t\ttry {\n\t\t\tscanner = new Scanner(System.in);\n\t\t\tlineAB = scanner.nextInt();\n\n\t\t\tSystem.out.println(\"\");\n\n\t\t} finally {\n\t\t\tif (scanner != null) {\n\t\t\t\tscanner.close();\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "sample_input": "4\n2 10 8 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03127", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4724, "cpu_time_ms": 487, "memory_kb": 72980}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s156888317", "group_id": "codeNet:p03128", "input_text": "import java.util.*;\nimport java.io.*;\n\npublic class Main{\n static int[] dp, a;\n static int amin=10;\n static final int num[]={0,2,5,5,4,5,6,3,7,6};\n static ArrayList ans=new ArrayList<>();\n\n static int dp(int i){\n int max=0;\n if(i0) return dp[i];\n for(int k:a) if(dp(i-num[k])+1>max) max=dp(i-num[k])+1;\n dp[i]=max;\n return dp[i];\n }\n public static void main(String[] args) throws Exception {\n FastScanner fsc=new FastScanner();\n final int n=fsc.nextInt(), m=fsc.nextInt();\n a=new int[m];\n dp=new int[Math.max(n+1, 8)];\n for(int i=0;i0){\n dp[4]=2; dp[6]=3;\n if(dp[3]>0){\n dp[5]=2; dp[7]=3;\n }\n else if(dp[5]>0) dp[7]=2;\n }\n else if(dp[3]>0){\n dp[6]=2;\n if(dp[4]>0) dp[7]=2;\n }\n int d=dp(n);\n //for(int i=0;i<=n;i++) System.out.println(\"dp[\"+i+\"]:\"+dp[i]);\n int now=n;\n Arrays.sort(a);\n for(int i=d;i>=1;i--){\n for(int j=a.length-1;j>=0;j--){\n if(now-num[a[j]]<0) continue;\n if(i==1){\n if(now-num[a[j]]==0){\n ans.add(a[j]);\n now=now-num[a[j]];\n break;\n }\n }\n else{\n if(dp[now-num[a[j]]]==i-1){\n ans.add(a[j]);\n now-=num[a[j]];\n break;\n }\n }\n }\n }\n if(now!=0) throw new Exception();\n if(ans.size()!=d) throw new Exception();\n StringBuilder sb=new StringBuilder(\"\");\n for(int k:ans) sb.append(k);\n System.out.println(sb);\n }\n static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte(){\n if(ptr Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n public void close(){\n try{in.close();}\n catch(IOException e){e.printStackTrace();}\n }\n }\n}", "language": "Java", "metadata": {"date": 1572153088, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03128.html", "problem_id": "p03128", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03128/input.txt", "sample_output_relpath": "derived/input_output/data/p03128/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03128/Java/s156888317.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s156888317", "user_id": "u541055501"}, "prompt_components": {"gold_output": "777773\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\n\npublic class Main{\n static int[] dp, a;\n static int amin=10;\n static final int num[]={0,2,5,5,4,5,6,3,7,6};\n static ArrayList ans=new ArrayList<>();\n\n static int dp(int i){\n int max=0;\n if(i0) return dp[i];\n for(int k:a) if(dp(i-num[k])+1>max) max=dp(i-num[k])+1;\n dp[i]=max;\n return dp[i];\n }\n public static void main(String[] args) throws Exception {\n FastScanner fsc=new FastScanner();\n final int n=fsc.nextInt(), m=fsc.nextInt();\n a=new int[m];\n dp=new int[Math.max(n+1, 8)];\n for(int i=0;i0){\n dp[4]=2; dp[6]=3;\n if(dp[3]>0){\n dp[5]=2; dp[7]=3;\n }\n else if(dp[5]>0) dp[7]=2;\n }\n else if(dp[3]>0){\n dp[6]=2;\n if(dp[4]>0) dp[7]=2;\n }\n int d=dp(n);\n //for(int i=0;i<=n;i++) System.out.println(\"dp[\"+i+\"]:\"+dp[i]);\n int now=n;\n Arrays.sort(a);\n for(int i=d;i>=1;i--){\n for(int j=a.length-1;j>=0;j--){\n if(now-num[a[j]]<0) continue;\n if(i==1){\n if(now-num[a[j]]==0){\n ans.add(a[j]);\n now=now-num[a[j]];\n break;\n }\n }\n else{\n if(dp[now-num[a[j]]]==i-1){\n ans.add(a[j]);\n now-=num[a[j]];\n break;\n }\n }\n }\n }\n if(now!=0) throw new Exception();\n if(ans.size()!=d) throw new Exception();\n StringBuilder sb=new StringBuilder(\"\");\n for(int k:ans) sb.append(k);\n System.out.println(sb);\n }\n static class FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte(){\n if(ptr Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n public void close(){\n try{in.close();}\n catch(IOException e){e.printStackTrace();}\n }\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "sample_input": "20 4\n3 7 8 4\n"}, "reference_outputs": ["777773\n"], "source_document_id": "p03128", "source_text": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4365, "cpu_time_ms": 88, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s630777809", "group_id": "codeNet:p03129", "input_text": "\nimport java.io.*;\nimport java.util.Scanner;\nimport java.util.TreeSet;\n\npublic class Main{\n /*public static void */\n public static void main(String []args) throws IOException\n {\n Scanner sc = new Scanner (System.in);\n\n int n = sc.nextInt();\n int k = sc.nextInt();\n\n if(n%k==1)\n System.out.println(\"YES\");\n else\n System.out.println(\"NO\");\n }\n}", "language": "Java", "metadata": {"date": 1552977636, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03129.html", "problem_id": "p03129", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03129/input.txt", "sample_output_relpath": "derived/input_output/data/p03129/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03129/Java/s630777809.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s630777809", "user_id": "u914330210"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "\nimport java.io.*;\nimport java.util.Scanner;\nimport java.util.TreeSet;\n\npublic class Main{\n /*public static void */\n public static void main(String []args) throws IOException\n {\n Scanner sc = new Scanner (System.in);\n\n int n = sc.nextInt();\n int k = sc.nextInt();\n\n if(n%k==1)\n System.out.println(\"YES\");\n else\n System.out.println(\"NO\");\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDetermine if we can choose K different integers between 1 and N (inclusive) so that no two of them differ by 1.\n\nConstraints\n\n1\\leq N,K\\leq 100\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf we can choose K integers as above, print YES; otherwise, print NO.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\nYES\n\nWe can choose 1 and 3.\n\nSample Input 2\n\n5 5\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n31 10\n\nSample Output 3\n\nYES\n\nSample Input 4\n\n10 90\n\nSample Output 4\n\nNO", "sample_input": "3 2\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03129", "source_text": "Score : 100 points\n\nProblem Statement\n\nDetermine if we can choose K different integers between 1 and N (inclusive) so that no two of them differ by 1.\n\nConstraints\n\n1\\leq N,K\\leq 100\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf we can choose K integers as above, print YES; otherwise, print NO.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\nYES\n\nWe can choose 1 and 3.\n\nSample Input 2\n\n5 5\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n31 10\n\nSample Output 3\n\nYES\n\nSample Input 4\n\n10 90\n\nSample Output 4\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 411, "cpu_time_ms": 94, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s053431816", "group_id": "codeNet:p03130", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.UncheckedIOException;\nimport java.util.StringTokenizer;\n\nclass Main{\n\tstatic boolean[][] mati=new boolean[4][4];\n\tstatic int[] ns = {0,1,2,3};\n\tpublic static void main(String[] args) {\n\t\tSC sc=new SC(System.in);\n\t\tfor(int i=0; i<3; i++) {\n\t\t\tint f=sc.nextInt()-1;\n\t\t\tint t=sc.nextInt()-1;\n\t\t\tmati[f][t]=true;\n\t\t\tmati[t][f]=true;\n\t\t}\n\t\tpermute(ns, ns.length);\n\t\tpl(\"NO\");\n\t}\n\tprivate static void swap(int[] v, int i, int j) {\n\t\tint t = v[i]; v[i] = v[j]; v[j] = t;\n\t}\n\n\tpublic static void permute(int[] v, int n) {\n\t\tif (n == 1) {\n\t\t\tif(mati[ns[0]][ns[1]] && mati[ns[1]][ns[2]] && mati[ns[2]][ns[3]]) {\n\t\t\t\tpl(\"YES\");\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t\telse {\n\t\t\t\t//\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tpermute(v, n-1);\n\t\t\t\tif (n % 2 == 1) {\n\t\t\t\t\tswap(v, 0, n-1);\n\t\t\t\t} else {\n\t\t\t\t\tswap(v, i, n-1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tpublic static void pl(Object o) {\n\t\tSystem.out.println(o);\n\t}\n\tpublic static void pl() {\n\t\tSystem.out.println();\n\t}\n\tpublic static void p(Object o) {\n\t\tSystem.out.print(o);\n\t}\n\tstatic class SC {\n\t\tprivate BufferedReader reader = null;\n\t\tprivate StringTokenizer tokenizer = null;\n\t\tpublic SC(InputStream in) {\n\t\t\treader = new BufferedReader(new InputStreamReader(in));\n\t\t}\n\t\tpublic String next() {\n\t\t\tif (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new UncheckedIOException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new UncheckedIOException(e);\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1549764539, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03130.html", "problem_id": "p03130", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03130/input.txt", "sample_output_relpath": "derived/input_output/data/p03130/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03130/Java/s053431816.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s053431816", "user_id": "u913110564"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.UncheckedIOException;\nimport java.util.StringTokenizer;\n\nclass Main{\n\tstatic boolean[][] mati=new boolean[4][4];\n\tstatic int[] ns = {0,1,2,3};\n\tpublic static void main(String[] args) {\n\t\tSC sc=new SC(System.in);\n\t\tfor(int i=0; i<3; i++) {\n\t\t\tint f=sc.nextInt()-1;\n\t\t\tint t=sc.nextInt()-1;\n\t\t\tmati[f][t]=true;\n\t\t\tmati[t][f]=true;\n\t\t}\n\t\tpermute(ns, ns.length);\n\t\tpl(\"NO\");\n\t}\n\tprivate static void swap(int[] v, int i, int j) {\n\t\tint t = v[i]; v[i] = v[j]; v[j] = t;\n\t}\n\n\tpublic static void permute(int[] v, int n) {\n\t\tif (n == 1) {\n\t\t\tif(mati[ns[0]][ns[1]] && mati[ns[1]][ns[2]] && mati[ns[2]][ns[3]]) {\n\t\t\t\tpl(\"YES\");\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t\telse {\n\t\t\t\t//\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tpermute(v, n-1);\n\t\t\t\tif (n % 2 == 1) {\n\t\t\t\t\tswap(v, 0, n-1);\n\t\t\t\t} else {\n\t\t\t\t\tswap(v, i, n-1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tpublic static void pl(Object o) {\n\t\tSystem.out.println(o);\n\t}\n\tpublic static void pl() {\n\t\tSystem.out.println();\n\t}\n\tpublic static void p(Object o) {\n\t\tSystem.out.print(o);\n\t}\n\tstatic class SC {\n\t\tprivate BufferedReader reader = null;\n\t\tprivate StringTokenizer tokenizer = null;\n\t\tpublic SC(InputStream in) {\n\t\t\treader = new BufferedReader(new InputStreamReader(in));\n\t\t}\n\t\tpublic String next() {\n\t\t\tif (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new UncheckedIOException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new UncheckedIOException(e);\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are four towns, numbered 1,2,3 and 4.\nAlso, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally.\nNo two roads connect the same pair of towns. Other than these roads, there is no way to travel between these towns, but any town can be reached from any other town using these roads.\n\nDetermine if we can visit all the towns by traversing each of the roads exactly once.\n\nConstraints\n\n1 \\leq a_i,b_i \\leq 4(1\\leq i\\leq 3)\n\na_i and b_i are different. (1\\leq i\\leq 3)\n\nNo two roads connect the same pair of towns.\n\nAny town can be reached from any other town using the roads.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na_1 b_1\na_2 b_2\na_3 b_3\n\nOutput\n\nIf we can visit all the towns by traversing each of the roads exactly once, print YES; otherwise, print NO.\n\nSample Input 1\n\n4 2\n1 3\n2 3\n\nSample Output 1\n\nYES\n\nWe can visit all the towns in the order 1,3,2,4.\n\nSample Input 2\n\n3 2\n2 4\n1 2\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n2 1\n3 2\n4 3\n\nSample Output 3\n\nYES", "sample_input": "4 2\n1 3\n2 3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03130", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are four towns, numbered 1,2,3 and 4.\nAlso, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally.\nNo two roads connect the same pair of towns. Other than these roads, there is no way to travel between these towns, but any town can be reached from any other town using these roads.\n\nDetermine if we can visit all the towns by traversing each of the roads exactly once.\n\nConstraints\n\n1 \\leq a_i,b_i \\leq 4(1\\leq i\\leq 3)\n\na_i and b_i are different. (1\\leq i\\leq 3)\n\nNo two roads connect the same pair of towns.\n\nAny town can be reached from any other town using the roads.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na_1 b_1\na_2 b_2\na_3 b_3\n\nOutput\n\nIf we can visit all the towns by traversing each of the roads exactly once, print YES; otherwise, print NO.\n\nSample Input 1\n\n4 2\n1 3\n2 3\n\nSample Output 1\n\nYES\n\nWe can visit all the towns in the order 1,3,2,4.\n\nSample Input 2\n\n3 2\n2 4\n1 2\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n2 1\n3 2\n4 3\n\nSample Output 3\n\nYES", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1957, "cpu_time_ms": 70, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s924412358", "group_id": "codeNet:p03135", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tdouble t = scn.nextDouble();\n\t\tint x = scn.nextInt();\n\t\tSystem.out.println(t/x);\n\t}\n}", "language": "Java", "metadata": {"date": 1558623949, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03135.html", "problem_id": "p03135", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03135/input.txt", "sample_output_relpath": "derived/input_output/data/p03135/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03135/Java/s924412358.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s924412358", "user_id": "u784210321"}, "prompt_components": {"gold_output": "2.6666666667\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scn = new Scanner(System.in);\n\t\tdouble t = scn.nextDouble();\n\t\tint x = scn.nextInt();\n\t\tSystem.out.println(t/x);\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "sample_input": "8 3\n"}, "reference_outputs": ["2.6666666667\n"], "source_document_id": "p03135", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 216, "cpu_time_ms": 133, "memory_kb": 24532}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s211418853", "group_id": "codeNet:p03140", "input_text": "\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tString A = sc.next();\n\t\tString B = sc.next();\n\t\tString C = sc.next();\n\t\tString[] strArraySubA = A.split(\"\");\n\t\tString[] strArrayA = new String[A.length()];\n\t\tint count = 0;\n\t\tfor (int i = 0; i < strArraySubA.length; i++) {\n\t\t strArrayA[i] = strArraySubA[i];\n\t\t}\n\t\tString[] strArraySubB = B.split(\"\");\n\t\tString[] strArrayB = new String[B.length()];\n\t\tfor (int i = 0; i < strArraySubB.length; i++) {\n\t\t strArrayB[i] = strArraySubB[i];\n\t\t}\n\t\tString[] strArraySubC = A.split(\"\");\n\t\tString[] strArrayC = new String[A.length()];\n\n\n\t\tfor (int i = 0; i < strArrayA.length; i++) {\n\t\t // \"strArray\"を1文字ずつ表示\n\t\t System.out.println(\"strArrayの要素番号\" + i + \"の時：\" + strArrayA[i]);\n\t\t}\n\t\tfor (int i = 0; i < strArrayB.length; i++) {\n\t\t // \"strArray\"を1文字ずつ表示\n\t\t System.out.println(\"strArrayの要素番号\" + i + \"の時：\" + strArrayB[i]);\n\t\t}\n\t\tfor (int i = 0; i < strArraySubC.length; i++) {\n\t\t strArrayC[i] = strArraySubC[i];\n\t\t}\n\t\tfor(int i = 0; i= 1 && N<=100) {\n////\t\tnがa+b以下\n//\t\t\tif(A+B<=N) {\n//\t\t\t\tif(A>B) {\n//\t\t\t\t\tmax = B;\n//\t\t\t\t\tmin = 0;\n//\t\t\t\t}else if (A<=B) {\n//\t\t\t\t\tmax = A;\n//\t\t\t\t\tmin = 0;\n//\t\t\t\t}\n//\t\t\t}\n////\n//\t\t\tif(A+B>N) {\n//\t\t\t\tif(A>=B) {\n//\t\t\t\t\tmax = B;\n//\t\t\t\t\tmin = (A+B)-N;\n//\t\t\t\t}else if(A= 1 && N<=100) {\n////\t\tnがa+b以下\n//\t\t\tif(A+B<=N) {\n//\t\t\t\tif(A>B) {\n//\t\t\t\t\tmax = B;\n//\t\t\t\t\tmin = 0;\n//\t\t\t\t}else if (A<=B) {\n//\t\t\t\t\tmax = A;\n//\t\t\t\t\tmin = 0;\n//\t\t\t\t}\n//\t\t\t}\n////\n//\t\t\tif(A+B>N) {\n//\t\t\t\tif(A>=B) {\n//\t\t\t\t\tmax = B;\n//\t\t\t\t\tmin = (A+B)-N;\n//\t\t\t\t}else if(A set = new HashSet<>();\n for (int i = 1; i <= n; i++) {\n// H\n set.add(i);\n }\n HashMap> map = new HashMap<>();\n\n for (int i = 0; i < n + m - 1; i++) {\n int first = s.nextInt() ;\n int secon = s.nextInt() ;\n arr[i] = new pair(first, secon);\n if(set.contains(secon)) {\n set.remove(secon);\n }\n ArrayList list = map.getOrDefault(first, new ArrayList<>());\n list.add(secon);\n map.put(first, list);\n }\n int[] val = new int[n + 1];\n Arrays.fill(val, -1);\n Iterator iter = set.iterator();\n int num = -1;\n// iter.forEachRemaining(integer -> val[integer] = 0);\n while(iter.hasNext()) {\n int nu = iter.next();\n if(nu != 0) {\n val[nu] = 0;\n }\n }\n for (int i = 1; i < val.length; i++) {\n if(val[i] == 0){\n\n num = i;\n break;\n }\n }\n parent[num] = 0;\n// System.out.println(num);\n dfs(num, visited, parent, map);\n// System.out.println(Arrays.toString(parent));\n StringBuilder ans = new StringBuilder();\n for (int i = 1; i < parent.length; i++) {\n ans.append(parent[i] + \"\\n\");\n }\n System.out.println(ans.toString());\n }\n\n private static void dfs(int num, boolean[] visited, int[] parent, HashMap> map) {\n if(visited[num]){\n return;\n }\n visited[num] = true;\n ArrayList list = map.getOrDefault(num, new ArrayList<>());\n for (int i = 0; i < list.size(); i++) {\n int curr = list.get(i);\n if(!visited[curr]){\n// visited[curr] = true;\n parent[curr] = num;\n dfs(curr, visited, parent, map);\n }\n }\n }\n\n private static class pair {\n int src;\n int dest;\n\n public pair(int src, int dest) {\n this.src = src;\n this.dest = dest;\n }\n\n @Override\n public boolean equals(Object obj) {\n pair p = (pair) obj;\n return this.dest == p.dest && this.src == p.src;\n }\n\n\n }\n}", "language": "Java", "metadata": {"date": 1548754631, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03142.html", "problem_id": "p03142", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03142/input.txt", "sample_output_relpath": "derived/input_output/data/p03142/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03142/Java/s550360234.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s550360234", "user_id": "u134426793"}, "prompt_components": {"gold_output": "0\n1\n2\n", "input_to_evaluate": "//package AtCoder.Nekkei;\n\nimport java.io.*;\nimport java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner s = new Scanner(System.in);\n int n = s.nextInt();\n int m = s.nextInt();\n boolean[] visited = new boolean[n + 1];\n int[] parent = new int[n + 1];\n Arrays.fill(parent, -1);\n pair[] arr = new pair[n + m - 1];\n HashSet set = new HashSet<>();\n for (int i = 1; i <= n; i++) {\n// H\n set.add(i);\n }\n HashMap> map = new HashMap<>();\n\n for (int i = 0; i < n + m - 1; i++) {\n int first = s.nextInt() ;\n int secon = s.nextInt() ;\n arr[i] = new pair(first, secon);\n if(set.contains(secon)) {\n set.remove(secon);\n }\n ArrayList list = map.getOrDefault(first, new ArrayList<>());\n list.add(secon);\n map.put(first, list);\n }\n int[] val = new int[n + 1];\n Arrays.fill(val, -1);\n Iterator iter = set.iterator();\n int num = -1;\n// iter.forEachRemaining(integer -> val[integer] = 0);\n while(iter.hasNext()) {\n int nu = iter.next();\n if(nu != 0) {\n val[nu] = 0;\n }\n }\n for (int i = 1; i < val.length; i++) {\n if(val[i] == 0){\n\n num = i;\n break;\n }\n }\n parent[num] = 0;\n// System.out.println(num);\n dfs(num, visited, parent, map);\n// System.out.println(Arrays.toString(parent));\n StringBuilder ans = new StringBuilder();\n for (int i = 1; i < parent.length; i++) {\n ans.append(parent[i] + \"\\n\");\n }\n System.out.println(ans.toString());\n }\n\n private static void dfs(int num, boolean[] visited, int[] parent, HashMap> map) {\n if(visited[num]){\n return;\n }\n visited[num] = true;\n ArrayList list = map.getOrDefault(num, new ArrayList<>());\n for (int i = 0; i < list.size(); i++) {\n int curr = list.get(i);\n if(!visited[curr]){\n// visited[curr] = true;\n parent[curr] = num;\n dfs(curr, visited, parent, map);\n }\n }\n }\n\n private static class pair {\n int src;\n int dest;\n\n public pair(int src, int dest) {\n this.src = src;\n this.dest = dest;\n }\n\n @Override\n public boolean equals(Object obj) {\n pair p = (pair) obj;\n return this.dest == p.dest && this.src == p.src;\n }\n\n\n }\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a rooted tree (see Notes) with N vertices numbered 1 to N.\nEach of the vertices, except the root, has a directed edge coming from its parent.\nNote that the root may not be Vertex 1.\n\nTakahashi has added M new directed edges to this graph.\nEach of these M edges, u \\rightarrow v, extends from some vertex u to its descendant v.\n\nYou are given the directed graph with N vertices and N-1+M edges after Takahashi added edges.\nMore specifically, you are given N-1+M pairs of integers, (A_1, B_1), ..., (A_{N-1+M}, B_{N-1+M}), which represent that the i-th edge extends from Vertex A_i to Vertex B_i.\n\nRestore the original rooted tree.\n\nNotes\n\nFor \"tree\" and other related terms in graph theory, see the article in Wikipedia, for example.\n\nConstraints\n\n3 \\leq N\n\n1 \\leq M\n\nN + M \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\nIf i \\neq j, (A_i, B_i) \\neq (A_j, B_j).\n\nThe graph in input can be obtained by adding M edges satisfying the condition in the problem statement to a rooted tree with N vertices.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_{N-1+M} B_{N-1+M}\n\nOutput\n\nPrint N lines.\nIn the i-th line, print 0 if Vertex i is the root of the original tree, and otherwise print the integer representing the parent of Vertex i in the original tree.\n\nNote that it can be shown that the original tree is uniquely determined.\n\nSample Input 1\n\n3 1\n1 2\n1 3\n2 3\n\nSample Output 1\n\n0\n1\n2\n\nThe graph in this input is shown below:\n\nIt can be seen that this graph is obtained by adding the edge 1 \\rightarrow 3 to the rooted tree 1 \\rightarrow 2 \\rightarrow 3.\n\nSample Input 2\n\n6 3\n2 1\n2 3\n4 1\n4 2\n6 1\n2 6\n4 6\n6 5\n\nSample Output 2\n\n6\n4\n2\n0\n6\n2", "sample_input": "3 1\n1 2\n1 3\n2 3\n"}, "reference_outputs": ["0\n1\n2\n"], "source_document_id": "p03142", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a rooted tree (see Notes) with N vertices numbered 1 to N.\nEach of the vertices, except the root, has a directed edge coming from its parent.\nNote that the root may not be Vertex 1.\n\nTakahashi has added M new directed edges to this graph.\nEach of these M edges, u \\rightarrow v, extends from some vertex u to its descendant v.\n\nYou are given the directed graph with N vertices and N-1+M edges after Takahashi added edges.\nMore specifically, you are given N-1+M pairs of integers, (A_1, B_1), ..., (A_{N-1+M}, B_{N-1+M}), which represent that the i-th edge extends from Vertex A_i to Vertex B_i.\n\nRestore the original rooted tree.\n\nNotes\n\nFor \"tree\" and other related terms in graph theory, see the article in Wikipedia, for example.\n\nConstraints\n\n3 \\leq N\n\n1 \\leq M\n\nN + M \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\nIf i \\neq j, (A_i, B_i) \\neq (A_j, B_j).\n\nThe graph in input can be obtained by adding M edges satisfying the condition in the problem statement to a rooted tree with N vertices.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_{N-1+M} B_{N-1+M}\n\nOutput\n\nPrint N lines.\nIn the i-th line, print 0 if Vertex i is the root of the original tree, and otherwise print the integer representing the parent of Vertex i in the original tree.\n\nNote that it can be shown that the original tree is uniquely determined.\n\nSample Input 1\n\n3 1\n1 2\n1 3\n2 3\n\nSample Output 1\n\n0\n1\n2\n\nThe graph in this input is shown below:\n\nIt can be seen that this graph is obtained by adding the edge 1 \\rightarrow 3 to the rooted tree 1 \\rightarrow 2 \\rightarrow 3.\n\nSample Input 2\n\n6 3\n2 1\n2 3\n4 1\n4 2\n6 1\n2 6\n4 6\n6 5\n\nSample Output 2\n\n6\n4\n2\n0\n6\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2753, "cpu_time_ms": 845, "memory_kb": 132220}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s961097217", "group_id": "codeNet:p03143", "input_text": "// package other2019.nikkei2019.qual;\n\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\nimport java.util.concurrent.ArrayBlockingQueue;\n\npublic class Main {\n static long __startTime = System.currentTimeMillis();\n\n public static void main(String[] args) {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int n = in.nextInt();\n int m = in.nextInt();\n long[] x = new long[n];\n for (int i = 0; i < n ; i++) {\n x[i] = in.nextLong();\n }\n int[][] edges = new int[m][3];\n for (int i = 0; i < m ; i++) {\n for (int j = 0; j < 2 ; j++) {\n edges[i][j] = in.nextInt()-1;\n }\n edges[i][2] = in.nextInt();\n }\n Arrays.sort(edges, Comparator.comparingInt(u -> u[2]));\n\n\n UnionFind uf = new UnionFind(n, x);\n\n int[] canUse = new int[m];\n for (int i = 0; i < m; i++) {\n int u = edges[i][0];\n int v = edges[i][1];\n uf.unite(u, v);\n int nid = uf.find(u);\n if (uf.groupCount(nid) >= edges[i][2]) {\n canUse[i] = 2;\n }\n }\n\n List[] graph = new List[n];\n for (int i = 0; i < n ; i++) {\n graph[i] = new ArrayList<>();\n }\n for (int i = 0; i < m ; i++) {\n graph[edges[i][0]].add(i);\n graph[edges[i][1]].add(i);\n }\n\n Queue q = new ArrayBlockingQueue<>(n + m + 10);\n boolean[] visited = new boolean[n];\n for (int i = m-1 ; i >= 0 ; i--) {\n if (canUse[i] == 2) {\n q.add(edges[i][0]);\n q.add(edges[i][1]);\n while (q.size() >= 1) {\n int now = q.poll();\n for (int eid : graph[now]) {\n int to = edges[eid][0] + edges[eid][1] - now;\n if (edges[eid][2] > edges[i][2]) {\n continue;\n }\n canUse[eid] = Math.max(canUse[eid], 1);\n if (!visited[to]) {\n visited[to] = true;\n q.add(to);\n }\n }\n }\n }\n }\n\n int ecount = 0;\n for (int i = 0; i < m ; i++) {\n ecount += canUse[i] >= 1 ? 1 : 0;\n }\n out.println(m-ecount);\n out.flush();\n }\n\n static class UnionFind {\n int[] rank;\n int[] parent;\n long[] cnt;\n\n public UnionFind(int n, long[] x) {\n rank = new int[n];\n parent = new int[n];\n cnt = new long[n];\n for (int i = 0; i < n; i++) {\n parent[i] = i;\n cnt[i] = x[i];\n }\n }\n\n public int find(int a) {\n if (parent[a] == a) {\n return a;\n }\n parent[a] = find(parent[a]);\n cnt[a] = cnt[parent[a]];\n return parent[a];\n }\n\n public void unite(int a, int b) {\n a = find(a);\n b = find(b);\n if (a == b) {\n return;\n }\n if (rank[a] < rank[b]) {\n parent[a] = b;\n cnt[b] += cnt[a];\n } else {\n parent[b] = a;\n cnt[a] += cnt[b];\n if (rank[a] == rank[b]) {\n rank[a]++;\n }\n }\n }\n\n public long groupCount(int a) {\n return cnt[find(a)];\n }\n\n private boolean issame(int a, int b) {\n return find(a) == find(b);\n }\n }\n\n\n private static void printTime(String label) {\n debug(label, System.currentTimeMillis() - __startTime);\n }\n\n private static void debug(Object... o) {\n System.err.println(Arrays.deepToString(o));\n }\n\n public static class InputReader {\n private static final int BUFFER_LENGTH = 1 << 12;\n private InputStream stream;\n private byte[] buf = new byte[BUFFER_LENGTH];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n private int next() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public char nextChar() {\n return (char) skipWhileSpace();\n }\n\n public String nextToken() {\n int c = skipWhileSpace();\n StringBuilder res = new StringBuilder();\n do {\n res.append((char) c);\n c = next();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public long nextLong() {\n int c = skipWhileSpace();\n long sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = next();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = next();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n return Double.valueOf(nextToken());\n }\n\n int skipWhileSpace() {\n int c = next();\n while (isSpaceChar(c)) {\n c = next();\n }\n return c;\n }\n\n boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n }\n}", "language": "Java", "metadata": {"date": 1550643229, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03143.html", "problem_id": "p03143", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03143/input.txt", "sample_output_relpath": "derived/input_output/data/p03143/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03143/Java/s961097217.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s961097217", "user_id": "u180407835"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "// package other2019.nikkei2019.qual;\n\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\nimport java.util.concurrent.ArrayBlockingQueue;\n\npublic class Main {\n static long __startTime = System.currentTimeMillis();\n\n public static void main(String[] args) {\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n\n int n = in.nextInt();\n int m = in.nextInt();\n long[] x = new long[n];\n for (int i = 0; i < n ; i++) {\n x[i] = in.nextLong();\n }\n int[][] edges = new int[m][3];\n for (int i = 0; i < m ; i++) {\n for (int j = 0; j < 2 ; j++) {\n edges[i][j] = in.nextInt()-1;\n }\n edges[i][2] = in.nextInt();\n }\n Arrays.sort(edges, Comparator.comparingInt(u -> u[2]));\n\n\n UnionFind uf = new UnionFind(n, x);\n\n int[] canUse = new int[m];\n for (int i = 0; i < m; i++) {\n int u = edges[i][0];\n int v = edges[i][1];\n uf.unite(u, v);\n int nid = uf.find(u);\n if (uf.groupCount(nid) >= edges[i][2]) {\n canUse[i] = 2;\n }\n }\n\n List[] graph = new List[n];\n for (int i = 0; i < n ; i++) {\n graph[i] = new ArrayList<>();\n }\n for (int i = 0; i < m ; i++) {\n graph[edges[i][0]].add(i);\n graph[edges[i][1]].add(i);\n }\n\n Queue q = new ArrayBlockingQueue<>(n + m + 10);\n boolean[] visited = new boolean[n];\n for (int i = m-1 ; i >= 0 ; i--) {\n if (canUse[i] == 2) {\n q.add(edges[i][0]);\n q.add(edges[i][1]);\n while (q.size() >= 1) {\n int now = q.poll();\n for (int eid : graph[now]) {\n int to = edges[eid][0] + edges[eid][1] - now;\n if (edges[eid][2] > edges[i][2]) {\n continue;\n }\n canUse[eid] = Math.max(canUse[eid], 1);\n if (!visited[to]) {\n visited[to] = true;\n q.add(to);\n }\n }\n }\n }\n }\n\n int ecount = 0;\n for (int i = 0; i < m ; i++) {\n ecount += canUse[i] >= 1 ? 1 : 0;\n }\n out.println(m-ecount);\n out.flush();\n }\n\n static class UnionFind {\n int[] rank;\n int[] parent;\n long[] cnt;\n\n public UnionFind(int n, long[] x) {\n rank = new int[n];\n parent = new int[n];\n cnt = new long[n];\n for (int i = 0; i < n; i++) {\n parent[i] = i;\n cnt[i] = x[i];\n }\n }\n\n public int find(int a) {\n if (parent[a] == a) {\n return a;\n }\n parent[a] = find(parent[a]);\n cnt[a] = cnt[parent[a]];\n return parent[a];\n }\n\n public void unite(int a, int b) {\n a = find(a);\n b = find(b);\n if (a == b) {\n return;\n }\n if (rank[a] < rank[b]) {\n parent[a] = b;\n cnt[b] += cnt[a];\n } else {\n parent[b] = a;\n cnt[a] += cnt[b];\n if (rank[a] == rank[b]) {\n rank[a]++;\n }\n }\n }\n\n public long groupCount(int a) {\n return cnt[find(a)];\n }\n\n private boolean issame(int a, int b) {\n return find(a) == find(b);\n }\n }\n\n\n private static void printTime(String label) {\n debug(label, System.currentTimeMillis() - __startTime);\n }\n\n private static void debug(Object... o) {\n System.err.println(Arrays.deepToString(o));\n }\n\n public static class InputReader {\n private static final int BUFFER_LENGTH = 1 << 12;\n private InputStream stream;\n private byte[] buf = new byte[BUFFER_LENGTH];\n private int curChar;\n private int numChars;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n private int next() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public char nextChar() {\n return (char) skipWhileSpace();\n }\n\n public String nextToken() {\n int c = skipWhileSpace();\n StringBuilder res = new StringBuilder();\n do {\n res.append((char) c);\n c = next();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public int nextInt() {\n return (int) nextLong();\n }\n\n public long nextLong() {\n int c = skipWhileSpace();\n long sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = next();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = next();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public double nextDouble() {\n return Double.valueOf(nextToken());\n }\n\n int skipWhileSpace() {\n int c = next();\n while (isSpaceChar(c)) {\n c = next();\n }\n return c;\n }\n\n boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n }\n}", "problem_context": "Score : 800 points\n\nProblem Statement\n\nThere is a connected undirected graph with N vertices and M edges.\nThe vertices are numbered 1 to N, and the edges are numbered 1 to M.\nAlso, each of these vertices and edges has a specified weight.\nVertex i has a weight of X_i; Edge i has a weight of Y_i and connects Vertex A_i and B_i.\n\nWe would like to remove zero or more edges so that the following condition is satisfied:\n\nFor each edge that is not removed, the sum of the weights of the vertices in the connected component containing that edge, is greater than or equal to the weight of that edge.\n\nFind the minimum number of edges that need to be removed.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nN-1 \\leq M \\leq 10^5\n\n1 \\leq X_i \\leq 10^9\n\n1 \\leq A_i < B_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\n(A_i,B_i) \\neq (A_j,B_j) (i \\neq j)\n\nThe given graph is connected.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_N\nA_1 B_1 Y_1\nA_2 B_2 Y_2\n:\nA_M B_M Y_M\n\nOutput\n\nFind the minimum number of edges that need to be removed.\n\nSample Input 1\n\n4 4\n2 3 5 7\n1 2 7\n1 3 9\n2 3 12\n3 4 18\n\nSample Output 1\n\n2\n\nAssume that we removed Edge 3 and 4.\nIn this case, the connected component containing Edge 1 contains Vertex 1, 2 and 3, and the sum of the weights of these vertices is 2+3+5=10.\nThe weight of Edge 1 is 7, so the condition is satisfied for Edge 1.\nSimilarly, it can be seen that the condition is also satisfied for Edge 2.\nThus, a graph satisfying the condition can be obtained by removing two edges.\n\nThe condition cannot be satisfied by removing one or less edges, so the answer is 2.\n\nSample Input 2\n\n6 10\n4 4 1 1 1 7\n3 5 19\n2 5 20\n4 5 8\n1 6 16\n2 3 9\n3 6 16\n3 4 1\n2 6 20\n2 4 19\n1 2 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n10 9\n81 16 73 7 2 61 86 38 90 28\n6 8 725\n3 10 12\n1 4 558\n4 9 615\n5 6 942\n8 9 918\n2 7 720\n4 7 292\n7 10 414\n\nSample Output 3\n\n8", "sample_input": "4 4\n2 3 5 7\n1 2 7\n1 3 9\n2 3 12\n3 4 18\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03143", "source_text": "Score : 800 points\n\nProblem Statement\n\nThere is a connected undirected graph with N vertices and M edges.\nThe vertices are numbered 1 to N, and the edges are numbered 1 to M.\nAlso, each of these vertices and edges has a specified weight.\nVertex i has a weight of X_i; Edge i has a weight of Y_i and connects Vertex A_i and B_i.\n\nWe would like to remove zero or more edges so that the following condition is satisfied:\n\nFor each edge that is not removed, the sum of the weights of the vertices in the connected component containing that edge, is greater than or equal to the weight of that edge.\n\nFind the minimum number of edges that need to be removed.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nN-1 \\leq M \\leq 10^5\n\n1 \\leq X_i \\leq 10^9\n\n1 \\leq A_i < B_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\n(A_i,B_i) \\neq (A_j,B_j) (i \\neq j)\n\nThe given graph is connected.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_N\nA_1 B_1 Y_1\nA_2 B_2 Y_2\n:\nA_M B_M Y_M\n\nOutput\n\nFind the minimum number of edges that need to be removed.\n\nSample Input 1\n\n4 4\n2 3 5 7\n1 2 7\n1 3 9\n2 3 12\n3 4 18\n\nSample Output 1\n\n2\n\nAssume that we removed Edge 3 and 4.\nIn this case, the connected component containing Edge 1 contains Vertex 1, 2 and 3, and the sum of the weights of these vertices is 2+3+5=10.\nThe weight of Edge 1 is 7, so the condition is satisfied for Edge 1.\nSimilarly, it can be seen that the condition is also satisfied for Edge 2.\nThus, a graph satisfying the condition can be obtained by removing two edges.\n\nThe condition cannot be satisfied by removing one or less edges, so the answer is 2.\n\nSample Input 2\n\n6 10\n4 4 1 1 1 7\n3 5 19\n2 5 20\n4 5 8\n1 6 16\n2 3 9\n3 6 16\n3 4 1\n2 6 20\n2 4 19\n1 2 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n10 9\n81 16 73 7 2 61 86 38 90 28\n6 8 725\n3 10 12\n1 4 558\n4 9 615\n5 6 942\n8 9 918\n2 7 720\n4 7 292\n7 10 414\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6250, "cpu_time_ms": 689, "memory_kb": 61696}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s167163875", "group_id": "codeNet:p03146", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.Arrays;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tint s = sc.nextInt();\n\t\tif (s == 2 || s == 1) {\n\t\t\tSystem.out.println(4);\n\t\t\treturn;\n\t\t}\n\t\tfor (int i = 1;;i++) {\n\t\t\tif (s == 4) {\n\t\t\t\tSystem.out.println(i+3);\n\t\t\t\treturn;\n\t\t\t} else if (s % 2 == 0) {\n\t\t\t\ts /= 2;\n\t\t\t} else {\n\t\t\t\ts = s * 3 + 1;\n\t\t\t}\n\t\t}\n\t}\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}", "language": "Java", "metadata": {"date": 1562206069, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03146.html", "problem_id": "p03146", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03146/input.txt", "sample_output_relpath": "derived/input_output/data/p03146/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03146/Java/s167163875.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s167163875", "user_id": "u893188242"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.Arrays;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tFastScanner sc = new FastScanner();\n\t\tint s = sc.nextInt();\n\t\tif (s == 2 || s == 1) {\n\t\t\tSystem.out.println(4);\n\t\t\treturn;\n\t\t}\n\t\tfor (int i = 1;;i++) {\n\t\t\tif (s == 4) {\n\t\t\t\tSystem.out.println(i+3);\n\t\t\t\treturn;\n\t\t\t} else if (s % 2 == 0) {\n\t\t\t\ts /= 2;\n\t\t\t} else {\n\t\t\t\ts = s * 3 + 1;\n\t\t\t}\n\t\t}\n\t}\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2727, "cpu_time_ms": 69, "memory_kb": 20564}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s242089890", "group_id": "codeNet:p03146", "input_text": "import java.util.*;\npublic class Main {\n\tpublic static void main(String[]args) {\n\t\tScanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n int count=1;\n while(true){\n count++;\n \tif(n%2==0){\n n/=2;\n }\n else{\n n=3*n+1;\n }\n if(n==4||n==1||n==2)break;\n }\n System.out.println(count+3);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1551112560, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03146.html", "problem_id": "p03146", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03146/input.txt", "sample_output_relpath": "derived/input_output/data/p03146/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03146/Java/s242089890.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s242089890", "user_id": "u803314854"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n\tpublic static void main(String[]args) {\n\t\tScanner sc=new Scanner(System.in);\n int n=sc.nextInt();\n int count=1;\n while(true){\n count++;\n \tif(n%2==0){\n n/=2;\n }\n else{\n n=3*n+1;\n }\n if(n==4||n==1||n==2)break;\n }\n System.out.println(count+3);\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 370, "cpu_time_ms": 95, "memory_kb": 22740}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s094965843", "group_id": "codeNet:p03146", "input_text": "import java.util.*;\n\nclass Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n String inputString = sc.nextLine();\n int s = Integer.valueOf(inputString);\n if(s==4 || s==2 || s==1 ) {\n System.out.println(\"4\");\n return;\n }\n int lastNumber = s;\n int i = 2;\n while(true) {\n int thisNumber = function(lastNumber);\n if(thisNumber==4) {\n System.out.println(i+3);\n break;\n }\n lastNumber = thisNumber;\n i++;\n }\n }\n\n private static int function(int n) {\n if(n%2==0){\n return n/2;\n }else{\n return 3*n+1;\n }\n\n }\n\n}", "language": "Java", "metadata": {"date": 1550568180, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03146.html", "problem_id": "p03146", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03146/input.txt", "sample_output_relpath": "derived/input_output/data/p03146/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03146/Java/s094965843.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s094965843", "user_id": "u833743935"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n String inputString = sc.nextLine();\n int s = Integer.valueOf(inputString);\n if(s==4 || s==2 || s==1 ) {\n System.out.println(\"4\");\n return;\n }\n int lastNumber = s;\n int i = 2;\n while(true) {\n int thisNumber = function(lastNumber);\n if(thisNumber==4) {\n System.out.println(i+3);\n break;\n }\n lastNumber = thisNumber;\n i++;\n }\n }\n\n private static int function(int n) {\n if(n%2==0){\n return n/2;\n }else{\n return 3*n+1;\n }\n\n }\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 763, "cpu_time_ms": 94, "memory_kb": 22868}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s403507012", "group_id": "codeNet:p03147", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n CGrandGarden solver = new CGrandGarden();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CGrandGarden {\n int ans = 0;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n\n int n = in.nextInt();\n\n int[] h = new int[n + 1];\n\n for (int i = 1; i <= n; i++) h[i] = in.nextInt();\n\n int[] a = new int[n + 1];\n\n Arrays.fill(a, 0);\n\n recurse(a, h, 1, n);\n\n out.println(ans);\n }\n\n private void recurse(int[] a, int[] h, int start, int n) {\n int s = start;\n\n // System.out.println(ans);\n if (start > n) {\n return;\n }\n\n boolean flag = false;\n for (int i = start; i <= n; i++) {\n if (h[i] == 0) {\n flag = true;\n recurse(a, h, s, i - 1);\n s = i + 1;\n }\n }\n\n if (flag == true) {\n recurse(a, h, s, n);\n return;\n }\n for (int i = start; i <= n; i++) {\n a[i]++;\n }\n\n ans++;\n\n for (int i = start; i <= n; i++) {\n if (a[i] == h[i]) {\n recurse(a, h, s, i - 1);\n s = i + 1;\n // continue;\n }\n }\n\n recurse(a, h, s, n);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(int i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1567818015, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03147.html", "problem_id": "p03147", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03147/input.txt", "sample_output_relpath": "derived/input_output/data/p03147/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03147/Java/s403507012.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s403507012", "user_id": "u095029955"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n CGrandGarden solver = new CGrandGarden();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CGrandGarden {\n int ans = 0;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n\n int n = in.nextInt();\n\n int[] h = new int[n + 1];\n\n for (int i = 1; i <= n; i++) h[i] = in.nextInt();\n\n int[] a = new int[n + 1];\n\n Arrays.fill(a, 0);\n\n recurse(a, h, 1, n);\n\n out.println(ans);\n }\n\n private void recurse(int[] a, int[] h, int start, int n) {\n int s = start;\n\n // System.out.println(ans);\n if (start > n) {\n return;\n }\n\n boolean flag = false;\n for (int i = start; i <= n; i++) {\n if (h[i] == 0) {\n flag = true;\n recurse(a, h, s, i - 1);\n s = i + 1;\n }\n }\n\n if (flag == true) {\n recurse(a, h, s, n);\n return;\n }\n for (int i = start; i <= n; i++) {\n a[i]++;\n }\n\n ans++;\n\n for (int i = start; i <= n; i++) {\n if (a[i] == h[i]) {\n recurse(a, h, s, i - 1);\n s = i + 1;\n // continue;\n }\n }\n\n recurse(a, h, s, n);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(int i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.\nYou are given a sequence h=\\{h_1,h_2,h_3,......\\} as input. You would like to change the height of Flower k to h_k for all k (1 \\leq k \\leq N), by repeating the following \"watering\" operation:\n\nSpecify integers l and r. Increase the height of Flower x by 1 for all x such that l \\leq x \\leq r.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq h_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 h_3 ...... h_N\n\nOutput\n\nPrint the minimum number of watering operations required to satisfy the condition.\n\nSample Input 1\n\n4\n1 2 2 1\n\nSample Output 1\n\n2\n\nThe minimum number of watering operations required is 2.\nOne way to achieve it is:\n\nPerform the operation with (l,r)=(1,3).\n\nPerform the operation with (l,r)=(2,4).\n\nSample Input 2\n\n5\n3 1 2 3 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n8\n4 23 75 0 23 96 50 100\n\nSample Output 3\n\n221", "sample_input": "4\n1 2 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03147", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.\nYou are given a sequence h=\\{h_1,h_2,h_3,......\\} as input. You would like to change the height of Flower k to h_k for all k (1 \\leq k \\leq N), by repeating the following \"watering\" operation:\n\nSpecify integers l and r. Increase the height of Flower x by 1 for all x such that l \\leq x \\leq r.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq h_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 h_3 ...... h_N\n\nOutput\n\nPrint the minimum number of watering operations required to satisfy the condition.\n\nSample Input 1\n\n4\n1 2 2 1\n\nSample Output 1\n\n2\n\nThe minimum number of watering operations required is 2.\nOne way to achieve it is:\n\nPerform the operation with (l,r)=(1,3).\n\nPerform the operation with (l,r)=(2,4).\n\nSample Input 2\n\n5\n3 1 2 3 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n8\n4 23 75 0 23 96 50 100\n\nSample Output 3\n\n221", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4547, "cpu_time_ms": 86, "memory_kb": 21332}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s860592141", "group_id": "codeNet:p03147", "input_text": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\tint []h = new int [n+1];\n\t\t\n\t\tfor(int i = 0; i < n ; i++) {\n\t\t\th[i] = sc.nextInt();\n\t\t}\n\t\tint r , l;\n\t\tint count = 0;\n\t\tdo {\n\t\t\tr = 0; l = 0;\n\t\t\tint flag = 0;\n\t\t\tfor(int i = 0; i <= n ; i++) {\n\t\t\t\tif(h[i] > 0 && flag == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tcount++;\t\t\t\t\t\n\t\t\t\t\tr = i;\n\t\t\t\t}\n\t\t\t\tif(h[i] == 0 && flag == 1) {\n\t\t\t\t\tflag = 0; \n\t\t\t\t\tl = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor(int i = r; i < l ; i++) {\n\t\t\t\th[i] = h[i] - 1;\n\t\t\t}\n\t\t\t\n\t\t}while(r != 0 || l != 0);\n\t\t\n\t\tSystem.out.println(count);\n\t} \t\t\n}\n\n\n", "language": "Java", "metadata": {"date": 1566041409, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03147.html", "problem_id": "p03147", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03147/input.txt", "sample_output_relpath": "derived/input_output/data/p03147/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03147/Java/s860592141.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s860592141", "user_id": "u920212194"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\tint []h = new int [n+1];\n\t\t\n\t\tfor(int i = 0; i < n ; i++) {\n\t\t\th[i] = sc.nextInt();\n\t\t}\n\t\tint r , l;\n\t\tint count = 0;\n\t\tdo {\n\t\t\tr = 0; l = 0;\n\t\t\tint flag = 0;\n\t\t\tfor(int i = 0; i <= n ; i++) {\n\t\t\t\tif(h[i] > 0 && flag == 0) {\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tcount++;\t\t\t\t\t\n\t\t\t\t\tr = i;\n\t\t\t\t}\n\t\t\t\tif(h[i] == 0 && flag == 1) {\n\t\t\t\t\tflag = 0; \n\t\t\t\t\tl = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor(int i = r; i < l ; i++) {\n\t\t\t\th[i] = h[i] - 1;\n\t\t\t}\n\t\t\t\n\t\t}while(r != 0 || l != 0);\n\t\t\n\t\tSystem.out.println(count);\n\t} \t\t\n}\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.\nYou are given a sequence h=\\{h_1,h_2,h_3,......\\} as input. You would like to change the height of Flower k to h_k for all k (1 \\leq k \\leq N), by repeating the following \"watering\" operation:\n\nSpecify integers l and r. Increase the height of Flower x by 1 for all x such that l \\leq x \\leq r.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq h_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 h_3 ...... h_N\n\nOutput\n\nPrint the minimum number of watering operations required to satisfy the condition.\n\nSample Input 1\n\n4\n1 2 2 1\n\nSample Output 1\n\n2\n\nThe minimum number of watering operations required is 2.\nOne way to achieve it is:\n\nPerform the operation with (l,r)=(1,3).\n\nPerform the operation with (l,r)=(2,4).\n\nSample Input 2\n\n5\n3 1 2 3 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n8\n4 23 75 0 23 96 50 100\n\nSample Output 3\n\n221", "sample_input": "4\n1 2 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03147", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.\nYou are given a sequence h=\\{h_1,h_2,h_3,......\\} as input. You would like to change the height of Flower k to h_k for all k (1 \\leq k \\leq N), by repeating the following \"watering\" operation:\n\nSpecify integers l and r. Increase the height of Flower x by 1 for all x such that l \\leq x \\leq r.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq h_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 h_3 ...... h_N\n\nOutput\n\nPrint the minimum number of watering operations required to satisfy the condition.\n\nSample Input 1\n\n4\n1 2 2 1\n\nSample Output 1\n\n2\n\nThe minimum number of watering operations required is 2.\nOne way to achieve it is:\n\nPerform the operation with (l,r)=(1,3).\n\nPerform the operation with (l,r)=(2,4).\n\nSample Input 2\n\n5\n3 1 2 3 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n8\n4 23 75 0 23 96 50 100\n\nSample Output 3\n\n221", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 655, "cpu_time_ms": 113, "memory_kb": 21588}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s931907475", "group_id": "codeNet:p03147", "input_text": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint len = sc.nextInt();\n\t\tint[] Garden = new int[len];\n\t\t\n\t\tfor(int i = 0;i < len;i++) {\n\t\t\tGarden[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tWaterCount(Garden);\n\t\tsc.close();\n\t}\n\tpublic static void WaterCount(int[] Garden){\n\t\tint water = 0;\n\t\tint cnt = 0;\n\t\tint tmp = 0;\n\t\tint min;\n\t\t\n\t\twhile(cnt != Garden.length) {\n\t\t\tfor(int i = cnt;i < Garden.length-1;i++) {\n\t\t\t\t//途中に０がないか探す\n\t\t\t\tif(Garden[i+1] == 0) {\n\t\t\t\t\ttmp =i+1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\tmin = Garden[cnt];\n\t\t\t\t//0が途中にあったら\n\t\t\t\tif(tmp != 0) {\n\t\t\t\t\tfor(int j = cnt + 1;j < tmp;j++) {\n\t\t\t\t\t\tif(Garden[j] < min) {\n\t\t\t\t\t\t\tmin = Garden[j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfor(int w = 1;w <= min;w++) {\n\t\t\t\t\t\tfor(int j = cnt;j < tmp;j++) {\n\t\t\t\t\t\t\tGarden[j]--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\twater++;\n\t\t\t\t\t}\n\t\t\t\t\ttmp = 0;\n\t\t\t\t}else {\n\t\t\t\t\tfor(int j = cnt + 1;j < tmp;j++) {\n\t\t\t\t\t\tif(Garden[j] < min) {\n\t\t\t\t\t\t\tmin = Garden[j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfor(int w = 1;w <= min;w++) {\n\t\t\t\t\t\tfor(int j = cnt;j < Garden.length;j++) {\n\t\t\t\t\t\t\tGarden[j]--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\twater++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\twhile(Garden[cnt] == 0) {\n\t\t\t\t\tcnt++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\tSystem.out.println(water);\n\t\t}\n}\n", "language": "Java", "metadata": {"date": 1556023008, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03147.html", "problem_id": "p03147", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03147/input.txt", "sample_output_relpath": "derived/input_output/data/p03147/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03147/Java/s931907475.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s931907475", "user_id": "u621674426"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint len = sc.nextInt();\n\t\tint[] Garden = new int[len];\n\t\t\n\t\tfor(int i = 0;i < len;i++) {\n\t\t\tGarden[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tWaterCount(Garden);\n\t\tsc.close();\n\t}\n\tpublic static void WaterCount(int[] Garden){\n\t\tint water = 0;\n\t\tint cnt = 0;\n\t\tint tmp = 0;\n\t\tint min;\n\t\t\n\t\twhile(cnt != Garden.length) {\n\t\t\tfor(int i = cnt;i < Garden.length-1;i++) {\n\t\t\t\t//途中に０がないか探す\n\t\t\t\tif(Garden[i+1] == 0) {\n\t\t\t\t\ttmp =i+1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\tmin = Garden[cnt];\n\t\t\t\t//0が途中にあったら\n\t\t\t\tif(tmp != 0) {\n\t\t\t\t\tfor(int j = cnt + 1;j < tmp;j++) {\n\t\t\t\t\t\tif(Garden[j] < min) {\n\t\t\t\t\t\t\tmin = Garden[j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfor(int w = 1;w <= min;w++) {\n\t\t\t\t\t\tfor(int j = cnt;j < tmp;j++) {\n\t\t\t\t\t\t\tGarden[j]--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\twater++;\n\t\t\t\t\t}\n\t\t\t\t\ttmp = 0;\n\t\t\t\t}else {\n\t\t\t\t\tfor(int j = cnt + 1;j < tmp;j++) {\n\t\t\t\t\t\tif(Garden[j] < min) {\n\t\t\t\t\t\t\tmin = Garden[j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfor(int w = 1;w <= min;w++) {\n\t\t\t\t\t\tfor(int j = cnt;j < Garden.length;j++) {\n\t\t\t\t\t\t\tGarden[j]--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\twater++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\twhile(Garden[cnt] == 0) {\n\t\t\t\t\tcnt++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\tSystem.out.println(water);\n\t\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.\nYou are given a sequence h=\\{h_1,h_2,h_3,......\\} as input. You would like to change the height of Flower k to h_k for all k (1 \\leq k \\leq N), by repeating the following \"watering\" operation:\n\nSpecify integers l and r. Increase the height of Flower x by 1 for all x such that l \\leq x \\leq r.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq h_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 h_3 ...... h_N\n\nOutput\n\nPrint the minimum number of watering operations required to satisfy the condition.\n\nSample Input 1\n\n4\n1 2 2 1\n\nSample Output 1\n\n2\n\nThe minimum number of watering operations required is 2.\nOne way to achieve it is:\n\nPerform the operation with (l,r)=(1,3).\n\nPerform the operation with (l,r)=(2,4).\n\nSample Input 2\n\n5\n3 1 2 3 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n8\n4 23 75 0 23 96 50 100\n\nSample Output 3\n\n221", "sample_input": "4\n1 2 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03147", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.\nYou are given a sequence h=\\{h_1,h_2,h_3,......\\} as input. You would like to change the height of Flower k to h_k for all k (1 \\leq k \\leq N), by repeating the following \"watering\" operation:\n\nSpecify integers l and r. Increase the height of Flower x by 1 for all x such that l \\leq x \\leq r.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq h_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 h_3 ...... h_N\n\nOutput\n\nPrint the minimum number of watering operations required to satisfy the condition.\n\nSample Input 1\n\n4\n1 2 2 1\n\nSample Output 1\n\n2\n\nThe minimum number of watering operations required is 2.\nOne way to achieve it is:\n\nPerform the operation with (l,r)=(1,3).\n\nPerform the operation with (l,r)=(2,4).\n\nSample Input 2\n\n5\n3 1 2 3 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n8\n4 23 75 0 23 96 50 100\n\nSample Output 3\n\n221", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1252, "cpu_time_ms": 2109, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s682630684", "group_id": "codeNet:p03148", "input_text": "\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n public static void main(final String[] args) {\n final Scanner scanner = new Scanner(System.in);\n final int counter = scanner.nextInt();\n final int k = scanner.nextInt();\n final Sushi[] sushiArray = new Sushi[counter];\n\n for (int i = 0; i < counter; i++) {\n final Sushi sushi = new Sushi(scanner.nextInt(), scanner.nextLong());\n sushiArray[i] = sushi;\n }\n\n Arrays.sort(sushiArray, (o1, o2) -> (int) o2.getDeliciousness() - (int) o1.getDeliciousness());\n final Map> sushiMap = new HashMap<>();\n final Set alreadyIncludedTopping = new HashSet<>();\n long partialAnswer = 0;\n final PriorityQueue allSushi = new PriorityQueue<>(Comparator.comparingInt(a -> (int) a.getDeliciousness()));\n for (int i = 0; i < k; i++) {\n final Sushi sushi = sushiArray[i];\n allSushi.add(sushi);\n partialAnswer += sushi.getDeliciousness();\n alreadyIncludedTopping.add(sushi.getTopping());\n sushiMap.computeIfAbsent(sushi.getTopping(), e -> new ArrayList<>())\n .add(sushi.getDeliciousness());\n }\n\n long answer = partialAnswer + sushiMap.size() * sushiMap.size();\n\n for (int i = k; i < counter; i++) {\n final Sushi sushi = sushiArray[i];\n if (alreadyIncludedTopping.contains(sushi.getTopping())) {\n continue;\n }\n\n boolean endFlag = false;\n while (true) {\n if (allSushi.isEmpty()) {\n endFlag = true;\n break;\n }\n\n final Sushi poll = allSushi.poll();\n if (sushiMap.get(poll.getTopping()).size() > 1) {\n alreadyIncludedTopping.add(sushi.getTopping());\n final long deliciousness = poll.getDeliciousness();\n final List list = sushiMap.get(poll.getTopping());\n list.remove(list.size() - 1);\n partialAnswer -= deliciousness;\n partialAnswer += sushi.getDeliciousness();\n if (partialAnswer + alreadyIncludedTopping.size() * alreadyIncludedTopping.size() > answer) {\n answer = partialAnswer + alreadyIncludedTopping.size() * alreadyIncludedTopping.size();\n }\n break;\n }\n }\n\n if (endFlag) {\n break;\n }\n }\n\n System.out.println(answer);\n }\n\n private static class Sushi {\n private final int topping;\n private final long deliciousness;\n\n Sushi(final int topping, final long deliciousness) {\n this.topping = topping;\n this.deliciousness = deliciousness;\n }\n\n int getTopping() {\n return topping;\n }\n\n long getDeliciousness() {\n return deliciousness;\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1567454128, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03148.html", "problem_id": "p03148", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03148/input.txt", "sample_output_relpath": "derived/input_output/data/p03148/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03148/Java/s682630684.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s682630684", "user_id": "u476482490"}, "prompt_components": {"gold_output": "26\n", "input_to_evaluate": "\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n public static void main(final String[] args) {\n final Scanner scanner = new Scanner(System.in);\n final int counter = scanner.nextInt();\n final int k = scanner.nextInt();\n final Sushi[] sushiArray = new Sushi[counter];\n\n for (int i = 0; i < counter; i++) {\n final Sushi sushi = new Sushi(scanner.nextInt(), scanner.nextLong());\n sushiArray[i] = sushi;\n }\n\n Arrays.sort(sushiArray, (o1, o2) -> (int) o2.getDeliciousness() - (int) o1.getDeliciousness());\n final Map> sushiMap = new HashMap<>();\n final Set alreadyIncludedTopping = new HashSet<>();\n long partialAnswer = 0;\n final PriorityQueue allSushi = new PriorityQueue<>(Comparator.comparingInt(a -> (int) a.getDeliciousness()));\n for (int i = 0; i < k; i++) {\n final Sushi sushi = sushiArray[i];\n allSushi.add(sushi);\n partialAnswer += sushi.getDeliciousness();\n alreadyIncludedTopping.add(sushi.getTopping());\n sushiMap.computeIfAbsent(sushi.getTopping(), e -> new ArrayList<>())\n .add(sushi.getDeliciousness());\n }\n\n long answer = partialAnswer + sushiMap.size() * sushiMap.size();\n\n for (int i = k; i < counter; i++) {\n final Sushi sushi = sushiArray[i];\n if (alreadyIncludedTopping.contains(sushi.getTopping())) {\n continue;\n }\n\n boolean endFlag = false;\n while (true) {\n if (allSushi.isEmpty()) {\n endFlag = true;\n break;\n }\n\n final Sushi poll = allSushi.poll();\n if (sushiMap.get(poll.getTopping()).size() > 1) {\n alreadyIncludedTopping.add(sushi.getTopping());\n final long deliciousness = poll.getDeliciousness();\n final List list = sushiMap.get(poll.getTopping());\n list.remove(list.size() - 1);\n partialAnswer -= deliciousness;\n partialAnswer += sushi.getDeliciousness();\n if (partialAnswer + alreadyIncludedTopping.size() * alreadyIncludedTopping.size() > answer) {\n answer = partialAnswer + alreadyIncludedTopping.size() * alreadyIncludedTopping.size();\n }\n break;\n }\n }\n\n if (endFlag) {\n break;\n }\n }\n\n System.out.println(answer);\n }\n\n private static class Sushi {\n private final int topping;\n private final long deliciousness;\n\n Sushi(final int topping, final long deliciousness) {\n this.topping = topping;\n this.deliciousness = deliciousness;\n }\n\n int getTopping() {\n return topping;\n }\n\n long getDeliciousness() {\n return deliciousness;\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "sample_input": "5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n"}, "reference_outputs": ["26\n"], "source_document_id": "p03148", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3288, "cpu_time_ms": 956, "memory_kb": 103140}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s590068737", "group_id": "codeNet:p03148", "input_text": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\t\n\tstatic long[] sumLengthOfDigitNumber = new long[19];\n\tstatic long[] digit10 = new long[19];\n\t\t\t\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\t\n\t\tint N = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tPair[] list = new Pair[N];\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tlist[i] = new Pair(sc.nextInt(), sc.nextInt());\n\t\t}\n\t\t\n\t\tArrays.sort(list, (p1, p2)->p2.d-p1.d);\n\t\t\n\t\tfor(Pair p : list) System.out.println(p.t + \" \" + p.d);\n\t\t\n\t\tlong ansSum = 0;\n\t\tint ansType = 0;\n\t\tHashMap map = new HashMap();\n\t\tfor(int i = 0; i < K; i++){\n\t\t\tansSum += list[i].d;\n\t\t\tLong count = map.get(list[i].t);\n\t\t\tif(count == null) map.put(list[i].t, 1L);\n\t\t\telse map.put(list[i].t, count+1);\n\t\t}\n\t\tansType = map.size();\n\t\tint index = K-1;\n\t\t\n\t\tlong ans = (ansType*ansType + ansSum);\n\t\t\n\t\tif(K == N){\n\t\t\tSystem.out.println(ans);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t//System.out.println(\"\\n\" + ansSum + \" \" + ansType + \" \" + (ansType*ansType + ansSum));\n\t\t\n\t\tPair[] nokori = new Pair[N-K];\n\t\tfor(int i = K; i < N; i++) nokori[i-K] = list[i];\n\t\tArrays.sort(nokori, (p1, p2)->p1.compTD(p2));\n\t\t//for(Pair p : nokori) System.out.println(p.t + \" \" + p.d);\n\t\tfor(Pair p : nokori){\n\t\t\t\n\t\t\tLong count = map.get(p.t);\n\t\t\tif(count != null) continue;\n\t\t\t//System.out.println(\"type\" + \" \" + p.t);\n\t\t\twhile(index >= 0){\n\t\t\t\tif(list[index].t != p.t){\n\t\t\t\t\tlong sum = ansSum - list[index].d + p.d;\n\t\t\t\t\tint type = ansType + 1;\n\t\t\t\t\tlong res = (type*type + sum);\n\t\t\t\t\t//System.out.println(sum + \" \" + type + \" \" + res);\n\t\t\t\t\tansSum = sum;\n\t\t\t\t\tansType = type;\n\t\t\t\t\tans = Math.max(ans, res);\n\t\t\t\t\tindex--;\n\t\t\t\t\t\n\t\t\t\t\tmap.put(p.t, 1L);\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(map.size() == K) break;\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t}//end main\n\t\n}//end Main\n\nclass Pair{\n\tint t, d;\n\tpublic Pair(int t, int d){\n\t\tthis.t = t; this.d = d;\n\t}\n\t\n\tpublic int compTD(Pair p){\n\t\tif(this.d != p.d){\n\t\t\treturn p.d - this.d;\n\t\t}else{\n\t\t\treturn p.t - this.t;\n\t\t}\n\t}\n}\n\nclass FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() {\n \tif (hasNextByte()) return buffer[ptr++];\n \telse return -1;\n }\n private static boolean isPrintableChar(int c){\n \treturn 33 <= c && c <= 126;\n }\n public boolean hasNext() {\n \twhile(hasNextByte() && !isPrintableChar(buffer[ptr]))\n \t\tptr++; return hasNextByte();\n }\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n}\n", "language": "Java", "metadata": {"date": 1548020364, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03148.html", "problem_id": "p03148", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03148/input.txt", "sample_output_relpath": "derived/input_output/data/p03148/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03148/Java/s590068737.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s590068737", "user_id": "u234826697"}, "prompt_components": {"gold_output": "26\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\t\n\tstatic long[] sumLengthOfDigitNumber = new long[19];\n\tstatic long[] digit10 = new long[19];\n\t\t\t\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\t\n\t\tint N = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tPair[] list = new Pair[N];\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tlist[i] = new Pair(sc.nextInt(), sc.nextInt());\n\t\t}\n\t\t\n\t\tArrays.sort(list, (p1, p2)->p2.d-p1.d);\n\t\t\n\t\tfor(Pair p : list) System.out.println(p.t + \" \" + p.d);\n\t\t\n\t\tlong ansSum = 0;\n\t\tint ansType = 0;\n\t\tHashMap map = new HashMap();\n\t\tfor(int i = 0; i < K; i++){\n\t\t\tansSum += list[i].d;\n\t\t\tLong count = map.get(list[i].t);\n\t\t\tif(count == null) map.put(list[i].t, 1L);\n\t\t\telse map.put(list[i].t, count+1);\n\t\t}\n\t\tansType = map.size();\n\t\tint index = K-1;\n\t\t\n\t\tlong ans = (ansType*ansType + ansSum);\n\t\t\n\t\tif(K == N){\n\t\t\tSystem.out.println(ans);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t//System.out.println(\"\\n\" + ansSum + \" \" + ansType + \" \" + (ansType*ansType + ansSum));\n\t\t\n\t\tPair[] nokori = new Pair[N-K];\n\t\tfor(int i = K; i < N; i++) nokori[i-K] = list[i];\n\t\tArrays.sort(nokori, (p1, p2)->p1.compTD(p2));\n\t\t//for(Pair p : nokori) System.out.println(p.t + \" \" + p.d);\n\t\tfor(Pair p : nokori){\n\t\t\t\n\t\t\tLong count = map.get(p.t);\n\t\t\tif(count != null) continue;\n\t\t\t//System.out.println(\"type\" + \" \" + p.t);\n\t\t\twhile(index >= 0){\n\t\t\t\tif(list[index].t != p.t){\n\t\t\t\t\tlong sum = ansSum - list[index].d + p.d;\n\t\t\t\t\tint type = ansType + 1;\n\t\t\t\t\tlong res = (type*type + sum);\n\t\t\t\t\t//System.out.println(sum + \" \" + type + \" \" + res);\n\t\t\t\t\tansSum = sum;\n\t\t\t\t\tansType = type;\n\t\t\t\t\tans = Math.max(ans, res);\n\t\t\t\t\tindex--;\n\t\t\t\t\t\n\t\t\t\t\tmap.put(p.t, 1L);\n\t\t\t\t\tbreak;\n\t\t\t\t}else{\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(map.size() == K) break;\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t}//end main\n\t\n}//end Main\n\nclass Pair{\n\tint t, d;\n\tpublic Pair(int t, int d){\n\t\tthis.t = t; this.d = d;\n\t}\n\t\n\tpublic int compTD(Pair p){\n\t\tif(this.d != p.d){\n\t\t\treturn p.d - this.d;\n\t\t}else{\n\t\t\treturn p.t - this.t;\n\t\t}\n\t}\n}\n\nclass FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() {\n \tif (hasNextByte()) return buffer[ptr++];\n \telse return -1;\n }\n private static boolean isPrintableChar(int c){\n \treturn 33 <= c && c <= 126;\n }\n public boolean hasNext() {\n \twhile(hasNextByte() && !isPrintableChar(buffer[ptr]))\n \t\tptr++; return hasNextByte();\n }\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "sample_input": "5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n"}, "reference_outputs": ["26\n"], "source_document_id": "p03148", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4232, "cpu_time_ms": 931, "memory_kb": 53596}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s449507006", "group_id": "codeNet:p03149", "input_text": "\nimport java.text.DecimalFormat;\nimport java.util.stream.LongStream;\nimport java.util.stream.IntStream;\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n\n AtCoder problem = new AtCoder(sc);\n problem.solve(out);\n\n out.flush();\n }\n\n}\n\nclass AtCoder {\n\n int a, b, c, d;\n\n AtCoder(FastScanner sc) {\n a = sc.nextInt();\n b = sc.nextInt();\n c = sc.nextInt();\n d = sc.nextInt();\n }\n\n void solve(PrintWriter out) {\n Set set = new HashSet<>();\n set.add(a);\n set.add(b);\n set.add(c);\n set.add(d);\n if (set.contains(1) && set.contains(9) && set.contains(7) && set.contains(4))\n out.println(\"YES\");\n else out.println(\"NO\");\n }\n\n}\n\nclass FastScanner {\n\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] arrayInt(int N) {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n\n public long[] arrayLong(int N) {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n\n public double[] arrayDouble(int N) {\n double[] array = new double[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n public String[] arrayString(int N) {\n String[] array = new String[N];\n for (int i = 0; i < N; i++) {\n array[i] = next();\n }\n return array;\n }\n}\n\nclass My {\n\n static String sort(String s) {\n char[] ch = s.toCharArray();\n Arrays.sort(ch);\n return String.valueOf(ch);\n }\n\n static String reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n static int[] reverse(int[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long[] reverse(long[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static double[] reverse(double[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static String[] reverse(String[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static char[] reverse(char[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long min(long... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static int min(int... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static double min(double... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static long max(long... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int max(int... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static double max(double... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int sum(long number) {\n int sum = 0;\n while (number > 0) {\n sum += number % 10;\n number /= 10;\n }\n return sum;\n }\n\n static Map tally(int[] array) {\n Map map = new TreeMap<>();\n for (int k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(long[] array) {\n Map map = new TreeMap<>();\n for (long k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(double[] array) {\n Map map = new TreeMap<>();\n for (double k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(String[] array) {\n Map map = new TreeMap<>();\n for (String k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(char[] array) {\n Map map = new TreeMap<>();\n for (char k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n}\n", "language": "Java", "metadata": {"date": 1592035354, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03149.html", "problem_id": "p03149", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03149/input.txt", "sample_output_relpath": "derived/input_output/data/p03149/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03149/Java/s449507006.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s449507006", "user_id": "u871244227"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "\nimport java.text.DecimalFormat;\nimport java.util.stream.LongStream;\nimport java.util.stream.IntStream;\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n PrintWriter out = new PrintWriter(System.out);\n\n AtCoder problem = new AtCoder(sc);\n problem.solve(out);\n\n out.flush();\n }\n\n}\n\nclass AtCoder {\n\n int a, b, c, d;\n\n AtCoder(FastScanner sc) {\n a = sc.nextInt();\n b = sc.nextInt();\n c = sc.nextInt();\n d = sc.nextInt();\n }\n\n void solve(PrintWriter out) {\n Set set = new HashSet<>();\n set.add(a);\n set.add(b);\n set.add(c);\n set.add(d);\n if (set.contains(1) && set.contains(9) && set.contains(7) && set.contains(4))\n out.println(\"YES\");\n else out.println(\"NO\");\n }\n\n}\n\nclass FastScanner {\n\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n public int[] arrayInt(int N) {\n int[] array = new int[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n\n public long[] arrayLong(int N) {\n long[] array = new long[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n\n public double[] arrayDouble(int N) {\n double[] array = new double[N];\n for (int i = 0; i < N; i++) {\n array[i] = nextDouble();\n }\n return array;\n }\n\n public String[] arrayString(int N) {\n String[] array = new String[N];\n for (int i = 0; i < N; i++) {\n array[i] = next();\n }\n return array;\n }\n}\n\nclass My {\n\n static String sort(String s) {\n char[] ch = s.toCharArray();\n Arrays.sort(ch);\n return String.valueOf(ch);\n }\n\n static String reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n static int[] reverse(int[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n int temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long[] reverse(long[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n long temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static double[] reverse(double[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n double temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static String[] reverse(String[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n String temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static char[] reverse(char[] array) {\n for (int i = 0; i < array.length / 2; i++) {\n char temp = array[i];\n array[i] = array[array.length - 1 - i];\n array[array.length - 1 - i] = temp;\n }\n return array;\n }\n\n static long min(long... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static int min(int... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static double min(double... numbers) {\n Arrays.sort(numbers);\n return numbers[0];\n }\n\n static long max(long... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int max(int... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static double max(double... numbers) {\n Arrays.sort(numbers);\n return numbers[numbers.length - 1];\n }\n\n static int sum(long number) {\n int sum = 0;\n while (number > 0) {\n sum += number % 10;\n number /= 10;\n }\n return sum;\n }\n\n static Map tally(int[] array) {\n Map map = new TreeMap<>();\n for (int k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(long[] array) {\n Map map = new TreeMap<>();\n for (long k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(double[] array) {\n Map map = new TreeMap<>();\n for (double k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(String[] array) {\n Map map = new TreeMap<>();\n for (String k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n static Map tally(char[] array) {\n Map map = new TreeMap<>();\n for (char k : array) {\n int v = map.getOrDefault(k, 0);\n map.put(k, ++v);\n }\n return map;\n }\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits \"1974\".\n\nConstraints\n\n0 \\leq N_1, N_2, N_3, N_4 \\leq 9\n\nN_1, N_2, N_3 and N_4 are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN_1 N_2 N_3 N_4\n\nOutput\n\nIf N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits \"1974\", print YES; if they cannot, print NO.\n\nSample Input 1\n\n1 7 9 4\n\nSample Output 1\n\nYES\n\nWe can get 1974 by swapping N_2 and N_3.\n\nSample Input 2\n\n1 9 7 4\n\nSample Output 2\n\nYES\n\nWe already have 1974 before doing anything.\n\nSample Input 3\n\n1 2 9 1\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n4 9 0 8\n\nSample Output 4\n\nNO", "sample_input": "1 7 9 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03149", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits \"1974\".\n\nConstraints\n\n0 \\leq N_1, N_2, N_3, N_4 \\leq 9\n\nN_1, N_2, N_3 and N_4 are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN_1 N_2 N_3 N_4\n\nOutput\n\nIf N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits \"1974\", print YES; if they cannot, print NO.\n\nSample Input 1\n\n1 7 9 4\n\nSample Output 1\n\nYES\n\nWe can get 1974 by swapping N_2 and N_3.\n\nSample Input 2\n\n1 9 7 4\n\nSample Output 2\n\nYES\n\nWe already have 1974 before doing anything.\n\nSample Input 3\n\n1 2 9 1\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n4 9 0 8\n\nSample Output 4\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7671, "cpu_time_ms": 71, "memory_kb": 21332}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s436621590", "group_id": "codeNet:p03149", "input_text": "import java.util.*;\n \npublic class Main {\n\tpublic static void main(String[] args){\n \tScanner sc = new Scanner(System.in);\n\t\tString K = \"keyence\";\n\t\tString S = sc.next();\n boolean fl = false;\n int l = S.length();\n \t\n \tfor(int i=6;0<=i;i--){\n \tif(S.substring(0,i)== K.substring(0,i)){\n \t\tif(S.substring(l-(6-i))==K.substring(i)){\n \tSystem.out.println(\"YES\");\n fl = true;\n \tbreak;\n }\n }\n \n }\n \tif(!fl){\n System.out.println(\"NO\");\n }\n } \n} \n", "language": "Java", "metadata": {"date": 1548171088, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03149.html", "problem_id": "p03149", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03149/input.txt", "sample_output_relpath": "derived/input_output/data/p03149/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03149/Java/s436621590.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s436621590", "user_id": "u809407598"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.util.*;\n \npublic class Main {\n\tpublic static void main(String[] args){\n \tScanner sc = new Scanner(System.in);\n\t\tString K = \"keyence\";\n\t\tString S = sc.next();\n boolean fl = false;\n int l = S.length();\n \t\n \tfor(int i=6;0<=i;i--){\n \tif(S.substring(0,i)== K.substring(0,i)){\n \t\tif(S.substring(l-(6-i))==K.substring(i)){\n \tSystem.out.println(\"YES\");\n fl = true;\n \tbreak;\n }\n }\n \n }\n \tif(!fl){\n System.out.println(\"NO\");\n }\n } \n} \n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits \"1974\".\n\nConstraints\n\n0 \\leq N_1, N_2, N_3, N_4 \\leq 9\n\nN_1, N_2, N_3 and N_4 are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN_1 N_2 N_3 N_4\n\nOutput\n\nIf N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits \"1974\", print YES; if they cannot, print NO.\n\nSample Input 1\n\n1 7 9 4\n\nSample Output 1\n\nYES\n\nWe can get 1974 by swapping N_2 and N_3.\n\nSample Input 2\n\n1 9 7 4\n\nSample Output 2\n\nYES\n\nWe already have 1974 before doing anything.\n\nSample Input 3\n\n1 2 9 1\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n4 9 0 8\n\nSample Output 4\n\nNO", "sample_input": "1 7 9 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03149", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits \"1974\".\n\nConstraints\n\n0 \\leq N_1, N_2, N_3, N_4 \\leq 9\n\nN_1, N_2, N_3 and N_4 are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN_1 N_2 N_3 N_4\n\nOutput\n\nIf N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits \"1974\", print YES; if they cannot, print NO.\n\nSample Input 1\n\n1 7 9 4\n\nSample Output 1\n\nYES\n\nWe can get 1974 by swapping N_2 and N_3.\n\nSample Input 2\n\n1 9 7 4\n\nSample Output 2\n\nYES\n\nWe already have 1974 before doing anything.\n\nSample Input 3\n\n1 2 9 1\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n4 9 0 8\n\nSample Output 4\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 595, "cpu_time_ms": 103, "memory_kb": 23252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s425639852", "group_id": "codeNet:p03155", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic int findWay(int[][] mat,int N,int C,int R,int count,int rI,int cI) {\n \t\tif(rI > N-R ) {\n\t\t\tif(cI < N-C) {\n\t\t\t\tcI++;\n\t\t\t\treturn findWay(mat, N, C, R, count,0, cI);\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn count;\n\t\t\t}\n\t\t}\n\t\tif(rI <= N-C) {\n\t\t\trI++;\n\t\t}else {\n\t\t\trI = 0;\n\t\t}\n\t\tcount++;\n\t\treturn findWay(mat, N, C, R, count, rI, cI);\n\t}\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\t\n\t\tMain ac = new Main();\n\t\tint count = 0;\n\t\tint N,R=4,C;\n\t\tint cI,rI;\n\t\tcI = 0;\n\t\trI = 0;\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tN = Integer.parseInt(br.readLine());\n\t\tR = Integer.parseInt(br.readLine());\n \tC = Integer.parseInt(br.readLine());\n\t\tint mat[][] = new int[N][N];\n\t\tSystem.out.println(ac.findWay(mat, N, C, R, count, rI, cI));\n\t}\n}\n", "language": "Java", "metadata": {"date": 1550076619, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03155.html", "problem_id": "p03155", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03155/input.txt", "sample_output_relpath": "derived/input_output/data/p03155/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03155/Java/s425639852.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s425639852", "user_id": "u892958915"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\tpublic int findWay(int[][] mat,int N,int C,int R,int count,int rI,int cI) {\n \t\tif(rI > N-R ) {\n\t\t\tif(cI < N-C) {\n\t\t\t\tcI++;\n\t\t\t\treturn findWay(mat, N, C, R, count,0, cI);\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn count;\n\t\t\t}\n\t\t}\n\t\tif(rI <= N-C) {\n\t\t\trI++;\n\t\t}else {\n\t\t\trI = 0;\n\t\t}\n\t\tcount++;\n\t\treturn findWay(mat, N, C, R, count, rI, cI);\n\t}\n\tpublic static void main(String[] args) throws NumberFormatException, IOException {\t\n\t\tMain ac = new Main();\n\t\tint count = 0;\n\t\tint N,R=4,C;\n\t\tint cI,rI;\n\t\tcI = 0;\n\t\trI = 0;\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tN = Integer.parseInt(br.readLine());\n\t\tR = Integer.parseInt(br.readLine());\n \tC = Integer.parseInt(br.readLine());\n\t\tint mat[][] = new int[N][N];\n\t\tSystem.out.println(ac.findWay(mat, N, C, R, count, rI, cI));\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIt has been decided that a programming contest sponsored by company A will be held, so we will post the notice on a bulletin board.\n\nThe bulletin board is in the form of a grid with N rows and N columns, and the notice will occupy a rectangular region with H rows and W columns.\n\nHow many ways are there to choose where to put the notice so that it completely covers exactly HW squares?\n\nConstraints\n\n1 \\leq H, W \\leq N \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH\nW\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n2\n3\n\nSample Output 1\n\n2\n\nThere are two ways to put the notice, as follows:\n\n### ...\n### ###\n... ###\n\nHere, # represents a square covered by the notice, and . represents a square not covered.\n\nSample Input 2\n\n100\n1\n1\n\nSample Output 2\n\n10000\n\nSample Input 3\n\n5\n4\n2\n\nSample Output 3\n\n8", "sample_input": "3\n2\n3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03155", "source_text": "Score : 100 points\n\nProblem Statement\n\nIt has been decided that a programming contest sponsored by company A will be held, so we will post the notice on a bulletin board.\n\nThe bulletin board is in the form of a grid with N rows and N columns, and the notice will occupy a rectangular region with H rows and W columns.\n\nHow many ways are there to choose where to put the notice so that it completely covers exactly HW squares?\n\nConstraints\n\n1 \\leq H, W \\leq N \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH\nW\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n2\n3\n\nSample Output 1\n\n2\n\nThere are two ways to put the notice, as follows:\n\n### ...\n### ###\n... ###\n\nHere, # represents a square covered by the notice, and . represents a square not covered.\n\nSample Input 2\n\n100\n1\n1\n\nSample Output 2\n\n10000\n\nSample Input 3\n\n5\n4\n2\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 912, "cpu_time_ms": 494, "memory_kb": 283092}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s557090869", "group_id": "codeNet:p03157", "input_text": "import java.util.*; import java.io.*; import java.math.*;\npublic class Main{\n\t//Don't have to see. start------------------------------------------\n\tstatic class InputIterator{\n\t\tArrayList inputLine = new ArrayList(1024);\n\t\tint index = 0; int max; String read;\n\t\tInputIterator(){\n\t\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t\ttry{\n\t\t\t\twhile((read = br.readLine()) != null){\n\t\t\t\t\tinputLine.add(read);\n\t\t\t\t}\n\t\t\t}catch(IOException e){}\n\t\t\tmax = inputLine.size();\n\t\t}\n\t\tboolean hasNext(){return (index < max);}\n\t\tString next(){\n\t\t\tif(hasNext()){\n\t\t\t\treturn inputLine.get(index++);\n\t\t\t}else{\n\t\t\t\tthrow new IndexOutOfBoundsException(\"There is no more input\");\n\t\t\t}\n\t\t}\n\t}\n\tstatic HashMap CONVSTR = new HashMap();\n\tstatic InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\tstatic void flush(){out.flush();}\n\tstatic void myout(Object t){out.println(t);}\n\tstatic void myerr(Object t){System.err.print(\"debug:\");System.err.println(t);}\n\tstatic String next(){return ii.next();}\n\tstatic boolean hasNext(){return ii.hasNext();}\n\tstatic int nextInt(){return Integer.parseInt(next());}\n\tstatic long nextLong(){return Long.parseLong(next());}\n\tstatic double nextDouble(){return Double.parseDouble(next());}\n\tstatic ArrayList nextStrArray(){return myconv(next(), 8);}\n\tstatic ArrayList nextCharArray(){return myconv(next(), 0);}\n\tstatic ArrayList nextIntArray(){\n\t\tArrayList input = nextStrArray(); ArrayList ret = new ArrayList(input.size());\n\t\tfor(int i = 0; i < input.size(); i++){\n\t\t\tret.add(Integer.parseInt(input.get(i)));\n\t\t}\n\t\treturn ret;\n\t}\n\tstatic ArrayList nextLongArray(){\n\t\tArrayList input = nextStrArray(); ArrayList ret = new ArrayList(input.size());\n\t\tfor(int i = 0; i < input.size(); i++){\n\t\t\tret.add(Long.parseLong(input.get(i)));\n\t\t}\n\t\treturn ret;\n\t}\n\tstatic String myconv(Object list, int no){//only join\n\t\tString joinString = CONVSTR.get(no);\n\t\tif(list instanceof String[]){\n\t\t\treturn String.join(joinString, (String[])list);\n\t\t}else if(list instanceof ArrayList){\n\t\t\treturn String.join(joinString, (ArrayList)list);\n\t\t}else{\n\t\t\tthrow new ClassCastException(\"Don't join\");\n\t\t}\n\t}\n\tstatic ArrayList myconv(String str, int no){//only split\n\t\tString splitString = CONVSTR.get(no);\n\t\treturn new ArrayList(Arrays.asList(str.split(splitString)));\n\t}\n\tpublic static void main(String[] args){\n\t\tCONVSTR.put(8, \" \"); CONVSTR.put(9, \"\\n\"); CONVSTR.put(0, \"\");\n\t\tsolve();flush();\n\t}\n\t//Don't have to see. end------------------------------------------\n static Node[][] list;\n static ArrayList group = new ArrayList();\n\tstatic void solve(){//Here is the main function\n ArrayList one = nextIntArray();\n int H = one.get(0);\n int W = one.get(1);\n list = new Node[H][W];\n for(int i = 0; i < H; i++){\n ArrayList tmp = nextCharArray();\n for(int j = 0; j < W; j++){\n list[i][j] = new Node(tmp.get(j));\n }\n }\n for(int i = 0; i < H; i++){\n for(int j = 0; j < W; j++){\n if(!list[i][j].access && list[i][j].s.equals(\"#\")){\n group.add(new Group());\n bfs(i, j);\n }\n }\n }\n long output = 0;\n for(int i = 0; i < group.size(); i++){\n output += (long)group.get(i).white * group.get(i).black;\n }\n myout(output);\n\t}\n\t//Method addition frame start\n\nstatic class Node{\n String s;\n boolean access = false;\n int count = 0;\n Node(String s){\n this.s = s;\n }\n}\n \nstatic class Group{\n int white = 0;\n int black = 1;\n Group(){}\n}\n \nstatic class QueueObject{\n int y;\n int x;\n QueueObject(int y, int x){\n this.y = y;\n this.x = x;\n }\n}\n \nstatic void bfs(int y, int x){\n int[] dy = {-1,0,1,0};\n int[] dx = {0,-1,0,1};\n ArrayDeque queue = new ArrayDeque();\n queue.add(new QueueObject(y, x));\n list[y][x].access = true;\n list[y][x].count = 0;\n while(queue.size() > 0){\n QueueObject now = queue.pollFirst();\n int nowY = now.y;\n int nowX = now.x;\n for(int i = 0; i < 4; i++){\n int nextY = nowY + dy[i];\n int nextX = nowX + dx[i];\n try{\n if(!list[nextY][nextX].access){\n if(list[nowY][nowX].count % 2 == 0 && list[nextY][nextX].s.equals(\".\")){\n list[nextY][nextX].count = list[nowY][nowX].count + 1;\n list[nextY][nextX].access = true;\n queue.add(new QueueObject(nextY, nextX));\n Group g = group.get(group.size() - 1);\n g.white++;\n group.set(group.size() - 1, g);\n }else if(list[nowY][nowX].count % 2 == 1 && list[nextY][nextX].s.equals(\"#\")){\n list[nextY][nextX].count = list[nowY][nowX].count + 1;\n list[nextY][nextX].access = true;\n queue.add(new QueueObject(nextY, nextX));\n Group g = group.get(group.size() - 1);\n g.black++;\n group.set(group.size() - 1, g);\n }\n }\n }catch(Exception e){}\n }\n }\n}\n \n\t//Method addition frame end\n}\n", "language": "Java", "metadata": {"date": 1599236468, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03157.html", "problem_id": "p03157", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03157/input.txt", "sample_output_relpath": "derived/input_output/data/p03157/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03157/Java/s557090869.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s557090869", "user_id": "u222822036"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.util.*; import java.io.*; import java.math.*;\npublic class Main{\n\t//Don't have to see. start------------------------------------------\n\tstatic class InputIterator{\n\t\tArrayList inputLine = new ArrayList(1024);\n\t\tint index = 0; int max; String read;\n\t\tInputIterator(){\n\t\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t\ttry{\n\t\t\t\twhile((read = br.readLine()) != null){\n\t\t\t\t\tinputLine.add(read);\n\t\t\t\t}\n\t\t\t}catch(IOException e){}\n\t\t\tmax = inputLine.size();\n\t\t}\n\t\tboolean hasNext(){return (index < max);}\n\t\tString next(){\n\t\t\tif(hasNext()){\n\t\t\t\treturn inputLine.get(index++);\n\t\t\t}else{\n\t\t\t\tthrow new IndexOutOfBoundsException(\"There is no more input\");\n\t\t\t}\n\t\t}\n\t}\n\tstatic HashMap CONVSTR = new HashMap();\n\tstatic InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\tstatic void flush(){out.flush();}\n\tstatic void myout(Object t){out.println(t);}\n\tstatic void myerr(Object t){System.err.print(\"debug:\");System.err.println(t);}\n\tstatic String next(){return ii.next();}\n\tstatic boolean hasNext(){return ii.hasNext();}\n\tstatic int nextInt(){return Integer.parseInt(next());}\n\tstatic long nextLong(){return Long.parseLong(next());}\n\tstatic double nextDouble(){return Double.parseDouble(next());}\n\tstatic ArrayList nextStrArray(){return myconv(next(), 8);}\n\tstatic ArrayList nextCharArray(){return myconv(next(), 0);}\n\tstatic ArrayList nextIntArray(){\n\t\tArrayList input = nextStrArray(); ArrayList ret = new ArrayList(input.size());\n\t\tfor(int i = 0; i < input.size(); i++){\n\t\t\tret.add(Integer.parseInt(input.get(i)));\n\t\t}\n\t\treturn ret;\n\t}\n\tstatic ArrayList nextLongArray(){\n\t\tArrayList input = nextStrArray(); ArrayList ret = new ArrayList(input.size());\n\t\tfor(int i = 0; i < input.size(); i++){\n\t\t\tret.add(Long.parseLong(input.get(i)));\n\t\t}\n\t\treturn ret;\n\t}\n\tstatic String myconv(Object list, int no){//only join\n\t\tString joinString = CONVSTR.get(no);\n\t\tif(list instanceof String[]){\n\t\t\treturn String.join(joinString, (String[])list);\n\t\t}else if(list instanceof ArrayList){\n\t\t\treturn String.join(joinString, (ArrayList)list);\n\t\t}else{\n\t\t\tthrow new ClassCastException(\"Don't join\");\n\t\t}\n\t}\n\tstatic ArrayList myconv(String str, int no){//only split\n\t\tString splitString = CONVSTR.get(no);\n\t\treturn new ArrayList(Arrays.asList(str.split(splitString)));\n\t}\n\tpublic static void main(String[] args){\n\t\tCONVSTR.put(8, \" \"); CONVSTR.put(9, \"\\n\"); CONVSTR.put(0, \"\");\n\t\tsolve();flush();\n\t}\n\t//Don't have to see. end------------------------------------------\n static Node[][] list;\n static ArrayList group = new ArrayList();\n\tstatic void solve(){//Here is the main function\n ArrayList one = nextIntArray();\n int H = one.get(0);\n int W = one.get(1);\n list = new Node[H][W];\n for(int i = 0; i < H; i++){\n ArrayList tmp = nextCharArray();\n for(int j = 0; j < W; j++){\n list[i][j] = new Node(tmp.get(j));\n }\n }\n for(int i = 0; i < H; i++){\n for(int j = 0; j < W; j++){\n if(!list[i][j].access && list[i][j].s.equals(\"#\")){\n group.add(new Group());\n bfs(i, j);\n }\n }\n }\n long output = 0;\n for(int i = 0; i < group.size(); i++){\n output += (long)group.get(i).white * group.get(i).black;\n }\n myout(output);\n\t}\n\t//Method addition frame start\n\nstatic class Node{\n String s;\n boolean access = false;\n int count = 0;\n Node(String s){\n this.s = s;\n }\n}\n \nstatic class Group{\n int white = 0;\n int black = 1;\n Group(){}\n}\n \nstatic class QueueObject{\n int y;\n int x;\n QueueObject(int y, int x){\n this.y = y;\n this.x = x;\n }\n}\n \nstatic void bfs(int y, int x){\n int[] dy = {-1,0,1,0};\n int[] dx = {0,-1,0,1};\n ArrayDeque queue = new ArrayDeque();\n queue.add(new QueueObject(y, x));\n list[y][x].access = true;\n list[y][x].count = 0;\n while(queue.size() > 0){\n QueueObject now = queue.pollFirst();\n int nowY = now.y;\n int nowX = now.x;\n for(int i = 0; i < 4; i++){\n int nextY = nowY + dy[i];\n int nextX = nowX + dx[i];\n try{\n if(!list[nextY][nextX].access){\n if(list[nowY][nowX].count % 2 == 0 && list[nextY][nextX].s.equals(\".\")){\n list[nextY][nextX].count = list[nowY][nowX].count + 1;\n list[nextY][nextX].access = true;\n queue.add(new QueueObject(nextY, nextX));\n Group g = group.get(group.size() - 1);\n g.white++;\n group.set(group.size() - 1, g);\n }else if(list[nowY][nowX].count % 2 == 1 && list[nextY][nextX].s.equals(\"#\")){\n list[nextY][nextX].count = list[nowY][nowX].count + 1;\n list[nextY][nextX].access = true;\n queue.add(new QueueObject(nextY, nextX));\n Group g = group.get(group.size() - 1);\n g.black++;\n group.set(group.size() - 1, g);\n }\n }\n }catch(Exception e){}\n }\n }\n}\n \n\t//Method addition frame end\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns, where each square is painted black or white.\n\nYou are given H strings S_1, S_2, ..., S_H, each of length W.\nIf the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is #; if that square is painted white, the j-th character in the string S_i is ..\n\nFind the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:\n\nThere is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...\n\nConstraints\n\n1 \\leq H, W \\leq 400\n\n|S_i| = W (1 \\leq i \\leq H)\n\nFor each i (1 \\leq i \\leq H), the string S_i consists of characters # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\nS_2\n:\nS_H\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n.#.\n..#\n#..\n\nSample Output 1\n\n10\n\nSome of the pairs satisfying the condition are ((1, 2), (3, 3)) and ((3, 1), (3, 2)), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nSample Input 2\n\n2 4\n....\n....\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4 3\n###\n###\n...\n###\n\nSample Output 3\n\n6", "sample_input": "3 3\n.#.\n..#\n#..\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03157", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns, where each square is painted black or white.\n\nYou are given H strings S_1, S_2, ..., S_H, each of length W.\nIf the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is #; if that square is painted white, the j-th character in the string S_i is ..\n\nFind the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:\n\nThere is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...\n\nConstraints\n\n1 \\leq H, W \\leq 400\n\n|S_i| = W (1 \\leq i \\leq H)\n\nFor each i (1 \\leq i \\leq H), the string S_i consists of characters # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\nS_2\n:\nS_H\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n.#.\n..#\n#..\n\nSample Output 1\n\n10\n\nSome of the pairs satisfying the condition are ((1, 2), (3, 3)) and ((3, 1), (3, 2)), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nSample Input 2\n\n2 4\n....\n....\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4 3\n###\n###\n...\n###\n\nSample Output 3\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5204, "cpu_time_ms": 364, "memory_kb": 71228}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s717384651", "group_id": "codeNet:p03157", "input_text": "import java.util.*;\n\nclass UnionFind {\n static class RootInfo {\n int i;\n int j;\n int depth;\n\n public RootInfo(int i, int j, int depth) {\n this.i = i;\n this.j = j;\n this.depth = depth;\n }\n }\n\n int[] body; // This keeps parent number. If it has the index itself, it's a root.\n int h;\n int w;\n\n public UnionFind(int h, int w) {\n this.body = new int[h * w];\n this.h = h;\n this.w = w;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n this.body[indexOf(i, j)] = indexOf(i, j);\n }\n }\n }\n\n public void union(int i1, int j1, int i2, int j2) {\n RootInfo root1 = findRoot(i1, j1);\n RootInfo root2 = findRoot(i2, j2);\n if (root1.depth >= root2.depth) { // optimize\n this.body[indexOf(root2.i, root2.j)] = indexOf(root1.i, root1.j);\n } else {\n this.body[indexOf(root1.i, root1.j)] = indexOf(root2.i, root2.j);\n }\n }\n\n public int findGroup(int i, int j) {\n RootInfo info = findRoot(i, j);\n return indexOf(info.i, info.j);\n }\n\n private RootInfo findRoot(int i, int j) {\n RootInfo info = findRootInternal(i, j);\n if (info.depth >= 2) { // optimize\n this.body[indexOf(i, j)] = indexOf(info.i, info.j);\n }\n return info;\n }\n\n private RootInfo findRootInternal(int i, int j) {\n int index = this.body[indexOf(i, j)];\n int nextI = index % h;\n int nextJ = index / h;\n if (i == nextI && j == nextJ) {\n return new RootInfo(i, j, 0);\n } else {\n RootInfo info = findRootInternal(nextI, nextJ);\n info.depth += 1;\n return info;\n }\n }\n\n private int indexOf(int i, int j) {\n return i + h * j;\n }\n}\n\nclass Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String[] hw = scanner.nextLine().split(\" \", 2);\n int h = Integer.parseInt(hw[0]);\n int w = Integer.parseInt(hw[1]);\n\n boolean[][] black = new boolean[h][w];\n for (int i = 0; i < h; i++) {\n String line = scanner.nextLine();\n for (int j = 0; j < w; j++) {\n black[i][j] = (line.charAt(j) == '#');\n }\n }\n\n UnionFind groups = new UnionFind(h, w);\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n // left\n if (i - 1 >= 0 && black[i][j] != black[i-1][j]) {\n groups.union(i, j, i-1, j);\n }\n\n // right\n if (i + 1 < h && black[i][j] != black[i+1][j]) {\n groups.union(i, j, i+1, j);\n }\n\n // up\n if (j - 1 >= 0 && black[i][j] != black[i][j-1]) {\n groups.union(i, j, i, j-1);\n }\n\n // down\n if (j + 1 < w && black[i][j] != black[i][j+1]) {\n groups.union(i, j, i, j+1);\n }\n }\n }\n\n Map groupBlacks = new HashMap<>();\n Map groupWhites = new HashMap<>();\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n int group = groups.findGroup(i, j);\n if (black[i][j]) {\n int count = groupBlacks.getOrDefault(group, 0);\n groupBlacks.put(group, count + 1);\n } else {\n int count = groupWhites.getOrDefault(group, 0);\n groupWhites.put(group, count + 1);\n }\n }\n }\n\n int answer = 0;\n for (Integer group : groupBlacks.keySet()) {\n int blacks = groupBlacks.get(group);\n int whites = groupWhites.getOrDefault(group, 0);\n answer += blacks * whites;\n }\n System.out.println(answer);\n }\n}\n", "language": "Java", "metadata": {"date": 1550441953, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03157.html", "problem_id": "p03157", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03157/input.txt", "sample_output_relpath": "derived/input_output/data/p03157/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03157/Java/s717384651.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s717384651", "user_id": "u327244943"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.util.*;\n\nclass UnionFind {\n static class RootInfo {\n int i;\n int j;\n int depth;\n\n public RootInfo(int i, int j, int depth) {\n this.i = i;\n this.j = j;\n this.depth = depth;\n }\n }\n\n int[] body; // This keeps parent number. If it has the index itself, it's a root.\n int h;\n int w;\n\n public UnionFind(int h, int w) {\n this.body = new int[h * w];\n this.h = h;\n this.w = w;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n this.body[indexOf(i, j)] = indexOf(i, j);\n }\n }\n }\n\n public void union(int i1, int j1, int i2, int j2) {\n RootInfo root1 = findRoot(i1, j1);\n RootInfo root2 = findRoot(i2, j2);\n if (root1.depth >= root2.depth) { // optimize\n this.body[indexOf(root2.i, root2.j)] = indexOf(root1.i, root1.j);\n } else {\n this.body[indexOf(root1.i, root1.j)] = indexOf(root2.i, root2.j);\n }\n }\n\n public int findGroup(int i, int j) {\n RootInfo info = findRoot(i, j);\n return indexOf(info.i, info.j);\n }\n\n private RootInfo findRoot(int i, int j) {\n RootInfo info = findRootInternal(i, j);\n if (info.depth >= 2) { // optimize\n this.body[indexOf(i, j)] = indexOf(info.i, info.j);\n }\n return info;\n }\n\n private RootInfo findRootInternal(int i, int j) {\n int index = this.body[indexOf(i, j)];\n int nextI = index % h;\n int nextJ = index / h;\n if (i == nextI && j == nextJ) {\n return new RootInfo(i, j, 0);\n } else {\n RootInfo info = findRootInternal(nextI, nextJ);\n info.depth += 1;\n return info;\n }\n }\n\n private int indexOf(int i, int j) {\n return i + h * j;\n }\n}\n\nclass Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n String[] hw = scanner.nextLine().split(\" \", 2);\n int h = Integer.parseInt(hw[0]);\n int w = Integer.parseInt(hw[1]);\n\n boolean[][] black = new boolean[h][w];\n for (int i = 0; i < h; i++) {\n String line = scanner.nextLine();\n for (int j = 0; j < w; j++) {\n black[i][j] = (line.charAt(j) == '#');\n }\n }\n\n UnionFind groups = new UnionFind(h, w);\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n // left\n if (i - 1 >= 0 && black[i][j] != black[i-1][j]) {\n groups.union(i, j, i-1, j);\n }\n\n // right\n if (i + 1 < h && black[i][j] != black[i+1][j]) {\n groups.union(i, j, i+1, j);\n }\n\n // up\n if (j - 1 >= 0 && black[i][j] != black[i][j-1]) {\n groups.union(i, j, i, j-1);\n }\n\n // down\n if (j + 1 < w && black[i][j] != black[i][j+1]) {\n groups.union(i, j, i, j+1);\n }\n }\n }\n\n Map groupBlacks = new HashMap<>();\n Map groupWhites = new HashMap<>();\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n int group = groups.findGroup(i, j);\n if (black[i][j]) {\n int count = groupBlacks.getOrDefault(group, 0);\n groupBlacks.put(group, count + 1);\n } else {\n int count = groupWhites.getOrDefault(group, 0);\n groupWhites.put(group, count + 1);\n }\n }\n }\n\n int answer = 0;\n for (Integer group : groupBlacks.keySet()) {\n int blacks = groupBlacks.get(group);\n int whites = groupWhites.getOrDefault(group, 0);\n answer += blacks * whites;\n }\n System.out.println(answer);\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns, where each square is painted black or white.\n\nYou are given H strings S_1, S_2, ..., S_H, each of length W.\nIf the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is #; if that square is painted white, the j-th character in the string S_i is ..\n\nFind the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:\n\nThere is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...\n\nConstraints\n\n1 \\leq H, W \\leq 400\n\n|S_i| = W (1 \\leq i \\leq H)\n\nFor each i (1 \\leq i \\leq H), the string S_i consists of characters # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\nS_2\n:\nS_H\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n.#.\n..#\n#..\n\nSample Output 1\n\n10\n\nSome of the pairs satisfying the condition are ((1, 2), (3, 3)) and ((3, 1), (3, 2)), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nSample Input 2\n\n2 4\n....\n....\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4 3\n###\n###\n...\n###\n\nSample Output 3\n\n6", "sample_input": "3 3\n.#.\n..#\n#..\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03157", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns, where each square is painted black or white.\n\nYou are given H strings S_1, S_2, ..., S_H, each of length W.\nIf the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is #; if that square is painted white, the j-th character in the string S_i is ..\n\nFind the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:\n\nThere is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...\n\nConstraints\n\n1 \\leq H, W \\leq 400\n\n|S_i| = W (1 \\leq i \\leq H)\n\nFor each i (1 \\leq i \\leq H), the string S_i consists of characters # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\nS_2\n:\nS_H\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n.#.\n..#\n#..\n\nSample Output 1\n\n10\n\nSome of the pairs satisfying the condition are ((1, 2), (3, 3)) and ((3, 1), (3, 2)), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nSample Input 2\n\n2 4\n....\n....\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4 3\n###\n###\n...\n###\n\nSample Output 3\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4036, "cpu_time_ms": 340, "memory_kb": 48852}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s786990284", "group_id": "codeNet:p03157", "input_text": "import java.util.*;\nimport java.lang.*;\n\n\npublic class Main {\n\tstatic int h;\n\tstatic int w;\n\tstatic char[][] masu;\n\tstatic long count;\n\tstatic int[][] used;\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\th = sc.nextInt();\n\t\tw = sc.nextInt();\n\t\tmasu = new char[h + 2][w + 2];\n\t\tfor (int i = 0; i < w + 2; i++) {\n\t\t\tmasu[0][i] = 'n';\n\t\t\tmasu[h + 1][i] = 'n';\n\t\t}\n\t\tfor (int i = 0; i < h + 2; i++) {\n\t\t\tmasu[i][0] = 'n';\n\t\t\tmasu[i][w + 1] = 'n';\n\t\t}\n\t\tfor (int i = 1; i <= h; i++) {\n\t\t\tString tmp = sc.next();\n\t\t\tfor (int j = 1; j <= w; j++) {\n\t\t\t\tmasu[i][j] = tmp.charAt(j - 1);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= h; i++) {\n\t\t\tfor (int j = 1; j <= w; j++) {\n\t\t\t\tif (masu[i][j] == '#') {\n\t\t\t\t\tused = new int[h + 2][w + 2];\n\t\t\t\t\tdfs(i, j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\tstatic void dfs(int i, int j) {\n\t\tif (masu[i - 1][j] == '.' && used[i - 1][j] != 1) {\n\t\t\tcount++;\n\t\t\tused[i][j] = 1;\n\t\t\tused[i - 1][j] = 1;\n\t\t\tif (masu[i - 2][j] == '#' && used[i - 2][j] != 1) {\n\t\t\t\tdfs(i - 2, j);\n\t\t\t}\n\t\t\tif (masu[i - 1][j - 1] == '#' && used[i - 1][j - 1] != 1) {\n\t\t\t\tdfs(i - 1, j - 1);\n\t\t\t}\n\t\t\tif (masu[i - 1][j + 1] =='#' && used[i - 1][j + 1] != 1) {\n\t\t\t\tdfs(i - 1, j + 1);\n\t\t\t}\n\t\t}\n\t\tif (masu[i + 1][j] == '.' && used[i + 1][j] != 1) {\n\t\t\tcount++;\n\t\t\tused[i][j] = 1;\n\t\t\tused[i + 1][j] = 1;\n\t\t\tif (masu[i + 2][j] == '#' && used[i + 2][j] != 1) {\n\t\t\t\tdfs(i + 2, j);\n\t\t\t}\n\t\t\tif (masu[i + 1][j - 1] == '#' && used[i + 1][j - 1] != 1) {\n\t\t\t\tdfs(i + 1, j - 1);\n\t\t\t}\n\t\t\tif (masu[i + 1][j + 1] =='#' && used[i + 1][j + 1] != 1) {\n\t\t\t\tdfs(i + 1, j + 1);\n\t\t\t}\n\t\t}\n\t\tif (masu[i][j + 1] == '.' && used[i][j + 1] != 1) {\n\t\t\tcount++;\n\t\t\tused[i][j] = 1;\n\t\t\tused[i][j + 1] = 1;\n\t\t\tif (masu[i][j + 2] == '#' && used[i][j + 2] != 1) {\n\t\t\t\tdfs(i, j + 2);\n\t\t\t}\n\t\t\tif (masu[i - 1][j + 1] == '#' && used[i - 1][j + 1] != 1) {\n\t\t\t\tdfs(i - 1, j + 1);\n\t\t\t}\n\t\t\tif (masu[i + 1][j + 1] =='#' && used[i + 1][j + 1] != 1) {\n\t\t\t\tdfs(i + 1, j + 1);\n\t\t\t}\n\t\t}\n\t\tif (masu[i][j - 1] == '.' && used[i][j - 1] != 1) {\n\t\t\tcount++;\n\t\t\tused[i][j] = 1;\n\t\t\tused[i][j - 1] = 1;\n\t\t\tif (masu[i][j - 2] == '#' && used[i][j - 2] != 1) {\n\t\t\t\tdfs(i, j - 2);\n\t\t\t}\n\t\t\tif (masu[i - 1][j - 1] == '#' && used[i - 1][j - 1] != 1) {\n\t\t\t\tdfs(i - 1, j - 1);\n\t\t\t}\n\t\t\tif (masu[i + 1][j - 1] =='#' && used[i + 1][j - 1] != 1) {\n\t\t\t\tdfs(i + 1, j - 1);\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1547326148, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03157.html", "problem_id": "p03157", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03157/input.txt", "sample_output_relpath": "derived/input_output/data/p03157/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03157/Java/s786990284.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s786990284", "user_id": "u602865659"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.util.*;\nimport java.lang.*;\n\n\npublic class Main {\n\tstatic int h;\n\tstatic int w;\n\tstatic char[][] masu;\n\tstatic long count;\n\tstatic int[][] used;\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\th = sc.nextInt();\n\t\tw = sc.nextInt();\n\t\tmasu = new char[h + 2][w + 2];\n\t\tfor (int i = 0; i < w + 2; i++) {\n\t\t\tmasu[0][i] = 'n';\n\t\t\tmasu[h + 1][i] = 'n';\n\t\t}\n\t\tfor (int i = 0; i < h + 2; i++) {\n\t\t\tmasu[i][0] = 'n';\n\t\t\tmasu[i][w + 1] = 'n';\n\t\t}\n\t\tfor (int i = 1; i <= h; i++) {\n\t\t\tString tmp = sc.next();\n\t\t\tfor (int j = 1; j <= w; j++) {\n\t\t\t\tmasu[i][j] = tmp.charAt(j - 1);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= h; i++) {\n\t\t\tfor (int j = 1; j <= w; j++) {\n\t\t\t\tif (masu[i][j] == '#') {\n\t\t\t\t\tused = new int[h + 2][w + 2];\n\t\t\t\t\tdfs(i, j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\tstatic void dfs(int i, int j) {\n\t\tif (masu[i - 1][j] == '.' && used[i - 1][j] != 1) {\n\t\t\tcount++;\n\t\t\tused[i][j] = 1;\n\t\t\tused[i - 1][j] = 1;\n\t\t\tif (masu[i - 2][j] == '#' && used[i - 2][j] != 1) {\n\t\t\t\tdfs(i - 2, j);\n\t\t\t}\n\t\t\tif (masu[i - 1][j - 1] == '#' && used[i - 1][j - 1] != 1) {\n\t\t\t\tdfs(i - 1, j - 1);\n\t\t\t}\n\t\t\tif (masu[i - 1][j + 1] =='#' && used[i - 1][j + 1] != 1) {\n\t\t\t\tdfs(i - 1, j + 1);\n\t\t\t}\n\t\t}\n\t\tif (masu[i + 1][j] == '.' && used[i + 1][j] != 1) {\n\t\t\tcount++;\n\t\t\tused[i][j] = 1;\n\t\t\tused[i + 1][j] = 1;\n\t\t\tif (masu[i + 2][j] == '#' && used[i + 2][j] != 1) {\n\t\t\t\tdfs(i + 2, j);\n\t\t\t}\n\t\t\tif (masu[i + 1][j - 1] == '#' && used[i + 1][j - 1] != 1) {\n\t\t\t\tdfs(i + 1, j - 1);\n\t\t\t}\n\t\t\tif (masu[i + 1][j + 1] =='#' && used[i + 1][j + 1] != 1) {\n\t\t\t\tdfs(i + 1, j + 1);\n\t\t\t}\n\t\t}\n\t\tif (masu[i][j + 1] == '.' && used[i][j + 1] != 1) {\n\t\t\tcount++;\n\t\t\tused[i][j] = 1;\n\t\t\tused[i][j + 1] = 1;\n\t\t\tif (masu[i][j + 2] == '#' && used[i][j + 2] != 1) {\n\t\t\t\tdfs(i, j + 2);\n\t\t\t}\n\t\t\tif (masu[i - 1][j + 1] == '#' && used[i - 1][j + 1] != 1) {\n\t\t\t\tdfs(i - 1, j + 1);\n\t\t\t}\n\t\t\tif (masu[i + 1][j + 1] =='#' && used[i + 1][j + 1] != 1) {\n\t\t\t\tdfs(i + 1, j + 1);\n\t\t\t}\n\t\t}\n\t\tif (masu[i][j - 1] == '.' && used[i][j - 1] != 1) {\n\t\t\tcount++;\n\t\t\tused[i][j] = 1;\n\t\t\tused[i][j - 1] = 1;\n\t\t\tif (masu[i][j - 2] == '#' && used[i][j - 2] != 1) {\n\t\t\t\tdfs(i, j - 2);\n\t\t\t}\n\t\t\tif (masu[i - 1][j - 1] == '#' && used[i - 1][j - 1] != 1) {\n\t\t\t\tdfs(i - 1, j - 1);\n\t\t\t}\n\t\t\tif (masu[i + 1][j - 1] =='#' && used[i + 1][j - 1] != 1) {\n\t\t\t\tdfs(i + 1, j - 1);\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns, where each square is painted black or white.\n\nYou are given H strings S_1, S_2, ..., S_H, each of length W.\nIf the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is #; if that square is painted white, the j-th character in the string S_i is ..\n\nFind the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:\n\nThere is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...\n\nConstraints\n\n1 \\leq H, W \\leq 400\n\n|S_i| = W (1 \\leq i \\leq H)\n\nFor each i (1 \\leq i \\leq H), the string S_i consists of characters # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\nS_2\n:\nS_H\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n.#.\n..#\n#..\n\nSample Output 1\n\n10\n\nSome of the pairs satisfying the condition are ((1, 2), (3, 3)) and ((3, 1), (3, 2)), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nSample Input 2\n\n2 4\n....\n....\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4 3\n###\n###\n...\n###\n\nSample Output 3\n\n6", "sample_input": "3 3\n.#.\n..#\n#..\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03157", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns, where each square is painted black or white.\n\nYou are given H strings S_1, S_2, ..., S_H, each of length W.\nIf the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is #; if that square is painted white, the j-th character in the string S_i is ..\n\nFind the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:\n\nThere is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...\n\nConstraints\n\n1 \\leq H, W \\leq 400\n\n|S_i| = W (1 \\leq i \\leq H)\n\nFor each i (1 \\leq i \\leq H), the string S_i consists of characters # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\nS_2\n:\nS_H\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n.#.\n..#\n#..\n\nSample Output 1\n\n10\n\nSome of the pairs satisfying the condition are ((1, 2), (3, 3)) and ((3, 1), (3, 2)), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nSample Input 2\n\n2 4\n....\n....\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4 3\n###\n###\n...\n###\n\nSample Output 3\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2341, "cpu_time_ms": 2111, "memory_kb": 348212}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s482362052", "group_id": "codeNet:p03162", "input_text": "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tint input[][] = new int[n][3];\n\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tfor(int j = 0; j < 3; j++){\n\t\t\t\tinput[i][j] = sc.nextInt();\n\t\t\t}\n\t\t}\n\n\t\tint dp[][] = new int[n][3];\n\n\t\tfor(int i = 0; i < 3; i++){\n\t\t\tdp[0][i] = input[0][i];\n\t\t}\n\n\t\tfor(int i = 1; i < n; i++){\n\t\t\tfor(int j = 0; j < 3; j++){\n\t\t\t\tdp[i][j] = Math.max(dp[i - 1][(j + 1)%3], dp[i - 1][(j + 2)%3]) + input[i][j];\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(Math.max(dp[n - 1][0], Math.max(dp[n - 1][1], dp[n - 1][2])));\n\t}\n}\n", "language": "Java", "metadata": {"date": 1595514391, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Java/s482362052.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s482362052", "user_id": "u918391323"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "\n\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tint input[][] = new int[n][3];\n\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tfor(int j = 0; j < 3; j++){\n\t\t\t\tinput[i][j] = sc.nextInt();\n\t\t\t}\n\t\t}\n\n\t\tint dp[][] = new int[n][3];\n\n\t\tfor(int i = 0; i < 3; i++){\n\t\t\tdp[0][i] = input[0][i];\n\t\t}\n\n\t\tfor(int i = 1; i < n; i++){\n\t\t\tfor(int j = 0; j < 3; j++){\n\t\t\t\tdp[i][j] = Math.max(dp[i - 1][(j + 1)%3], dp[i - 1][(j + 2)%3]) + input[i][j];\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(Math.max(dp[n - 1][0], Math.max(dp[n - 1][1], dp[n - 1][2])));\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 685, "cpu_time_ms": 560, "memory_kb": 53748}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s340729515", "group_id": "codeNet:p03162", "input_text": "\nimport java.util.*;\nimport java.io.*;\npublic class Main {\n// \n// public static int frog(int arr[], int i, int prev){\n// if(i >= arr.length)\n// return 0;\n// if(i == arr.length-1)\n// return Math.abs(arr[prev]- arr[i]);\n// int a = 0; int b = 0;\n// if(prev == -1){\n// return Math.min(0+frog(arr,i+1,0),0+frog(arr,i+2,0));\n// }\n// \n// else{\n// // System.out.println(arr[prev]+ \" - \" + arr[i] );\n// a = Math.abs(arr[prev] - arr[i]) + frog(arr,i+1,i);\n// b = Math.abs(arr[prev] - arr[i]) + frog(arr,i+2,i);\n// \n// }\n// \n// return Math.min(a,b);\n// \n// }\n \n public static int vecation(int n, int prev, List> l,int[][] dp){\n \n if(n == -1)\n return 0;\n if( dp[prev+1][n+1] > -1){\n return dp[prev+1][n+1];\n }\n int ans = 0;\n if(prev != 0){\n // System.out.println(\"used\");\n ans = Math.max(ans,l.get(n).get(0) + vecation(n-1,0,l,dp));\n }\n \n if(prev != 1){\n ans = Math.max(ans,l.get(n).get(1) + vecation(n-1,1,l,dp));\n }\n \n if(prev != 2){\n ans = Math.max(ans,l.get(n).get(2) + vecation(n-1,2,l,dp));\n }\n \n return dp[prev+1][n+1] = ans;\n \n \n \n }\n \n \n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); \n// int n = Integer.parseInt(br.readLine());\n// int[] arr = new int[n+1];\n// StringTokenizer str = new StringTokenizer(br.readLine(),\" \");\n// int i = 0;\n// while(str.hasMoreTokens()){\n// arr[i] = Integer.parseInt(str.nextToken());\n// i++;\n// }\n// \n// int[] dp = new int[arr.length];\n// Arrays.fill(dp,-1);\n// \n \n \n int n = Integer.parseInt(br.readLine());\n int[][] dp = new int[n+1][n+1];\n for(int i = 0; i < dp.length; i++){\n Arrays.fill(dp[i],-1);\n \n }\n List> l = new ArrayList<>();\n \n for(int i = 0; i< n; i++){\n String str[] = br.readLine().split(\" \");\n List ll = new ArrayList<>();\n for(String k : str){\n \n ll.add(Integer.parseInt(k));\n \n }\n l.add(new ArrayList<>(ll));\n ll.clear();\n }\n // System.out.println(l);\n System.out.println(vecation(n-1,-1,l,dp));\n \n // System.out.println(Arrays.toString(dp));\n }\n \n}\n", "language": "Java", "metadata": {"date": 1583196958, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Java/s340729515.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s340729515", "user_id": "u238904265"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "\nimport java.util.*;\nimport java.io.*;\npublic class Main {\n// \n// public static int frog(int arr[], int i, int prev){\n// if(i >= arr.length)\n// return 0;\n// if(i == arr.length-1)\n// return Math.abs(arr[prev]- arr[i]);\n// int a = 0; int b = 0;\n// if(prev == -1){\n// return Math.min(0+frog(arr,i+1,0),0+frog(arr,i+2,0));\n// }\n// \n// else{\n// // System.out.println(arr[prev]+ \" - \" + arr[i] );\n// a = Math.abs(arr[prev] - arr[i]) + frog(arr,i+1,i);\n// b = Math.abs(arr[prev] - arr[i]) + frog(arr,i+2,i);\n// \n// }\n// \n// return Math.min(a,b);\n// \n// }\n \n public static int vecation(int n, int prev, List> l,int[][] dp){\n \n if(n == -1)\n return 0;\n if( dp[prev+1][n+1] > -1){\n return dp[prev+1][n+1];\n }\n int ans = 0;\n if(prev != 0){\n // System.out.println(\"used\");\n ans = Math.max(ans,l.get(n).get(0) + vecation(n-1,0,l,dp));\n }\n \n if(prev != 1){\n ans = Math.max(ans,l.get(n).get(1) + vecation(n-1,1,l,dp));\n }\n \n if(prev != 2){\n ans = Math.max(ans,l.get(n).get(2) + vecation(n-1,2,l,dp));\n }\n \n return dp[prev+1][n+1] = ans;\n \n \n \n }\n \n \n public static void main(String[] args) throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); \n// int n = Integer.parseInt(br.readLine());\n// int[] arr = new int[n+1];\n// StringTokenizer str = new StringTokenizer(br.readLine(),\" \");\n// int i = 0;\n// while(str.hasMoreTokens()){\n// arr[i] = Integer.parseInt(str.nextToken());\n// i++;\n// }\n// \n// int[] dp = new int[arr.length];\n// Arrays.fill(dp,-1);\n// \n \n \n int n = Integer.parseInt(br.readLine());\n int[][] dp = new int[n+1][n+1];\n for(int i = 0; i < dp.length; i++){\n Arrays.fill(dp[i],-1);\n \n }\n List> l = new ArrayList<>();\n \n for(int i = 0; i< n; i++){\n String str[] = br.readLine().split(\" \");\n List ll = new ArrayList<>();\n for(String k : str){\n \n ll.add(Integer.parseInt(k));\n \n }\n l.add(new ArrayList<>(ll));\n ll.clear();\n }\n // System.out.println(l);\n System.out.println(vecation(n-1,-1,l,dp));\n \n // System.out.println(Arrays.toString(dp));\n }\n \n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2570, "cpu_time_ms": 621, "memory_kb": 903632}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s342739928", "group_id": "codeNet:p03162", "input_text": "import java.util.*;\n\nclass Main {\n public static int maxx(int a, int b, int c)\n{\n return Math.max(Math.max(a,b),c);\n}\n public static void main(String args[] ) throws Exception {\n Scanner ob=new Scanner(System.in);\n int n=ob.nextInt();\n int INF = (int)1e9+7;\n int a[]=new int[n];\n int dp[][]=new int[n][3];\n int a1,b,c;\n for(int i=0;i m = new TreeMap<>();\n\n public Monotonic(long kMax) {\n this.kMax = kMax;\n }\n\n public long get(long k) {\n if (m.containsKey(k)) {\n return m.get(k);\n }\n SortedMap head = m.headMap(k);\n if (head.isEmpty()) {\n return vMin;\n }\n return head.lastKey();\n }\n\n public void update(long k, long v) {\n if (k < kMin || k > kMax) {\n return;\n }\n long oldV = get(k);\n if (v > oldV) {\n m.put(k, v);\n }\n for (long tailK : m.tailMap(k).keySet()) {\n if (v > m.get(tailK)) {\n m.put(tailK, v);\n }\n }\n }\n\n public Set keys() {\n return m.keySet();\n }\n\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1585738216, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03164.html", "problem_id": "p03164", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03164/input.txt", "sample_output_relpath": "derived/input_output/data/p03164/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03164/Java/s852793315.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s852793315", "user_id": "u923009309"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.TreeMap;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Set;\nimport java.util.SortedMap;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author vdewansa\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n EKnapsack2 solver = new EKnapsack2();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class EKnapsack2 {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int N = in.nextInt();\n int W = in.nextInt();\n int[] w = new int[N + 1];\n int[] v = new int[N + 1];\n for (int i = 1; i <= N; i++) {\n w[i] = in.nextInt();\n v[i] = in.nextInt();\n }\n\n EKnapsack2.Monotonic prev = new EKnapsack2.Monotonic(W);\n EKnapsack2.Monotonic next = new EKnapsack2.Monotonic(W);\n for (int i = 1; i <= N; i++) {\n for (long wPrev : prev.keys()) {\n long vPrev = prev.get(wPrev);\n next.update(wPrev, vPrev);\n next.update(wPrev + w[i], vPrev + v[i]);\n }\n next.update(w[i], v[i]);\n prev = next;\n next = new EKnapsack2.Monotonic(W);\n }\n out.println(prev.get(W));\n }\n\n static class Monotonic {\n private final long kMin = 0;\n private final long kMax;\n private final long vMin = 0;\n private SortedMap m = new TreeMap<>();\n\n public Monotonic(long kMax) {\n this.kMax = kMax;\n }\n\n public long get(long k) {\n if (m.containsKey(k)) {\n return m.get(k);\n }\n SortedMap head = m.headMap(k);\n if (head.isEmpty()) {\n return vMin;\n }\n return head.lastKey();\n }\n\n public void update(long k, long v) {\n if (k < kMin || k > kMax) {\n return;\n }\n long oldV = get(k);\n if (v > oldV) {\n m.put(k, v);\n }\n for (long tailK : m.tailMap(k).keySet()) {\n if (v > m.get(tailK)) {\n m.put(tailK, v);\n }\n }\n }\n\n public Set keys() {\n return m.keySet();\n }\n\n }\n\n }\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03164", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2880, "cpu_time_ms": 128, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s094959863", "group_id": "codeNet:p03166", "input_text": "import java.util.*;\nimport java.io.*;\nimport java.lang.*;\n\n class Main{\n\n static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n static StringBuilder sb = new StringBuilder(\"\");\n static StringTokenizer stk = new StringTokenizer(\"\");\n // static long[][] dp ;\n static Map> adjList = new HashMap<>();\n static int N = 0;\n static int M = 0;\n static long maxValue = 0;\n\n public static void main(String args[]){\n try{\n stk = new StringTokenizer(bf.readLine());\n N = Integer.parseInt(stk.nextToken());\n M = Integer.parseInt(stk.nextToken());\n // dp = new long[N+1][N+1];\n\n for(int i=0;i al = new ArrayList<>();\n al.add(to);\n adjList.put(from,al);\n }\n }\n\n solver();\n\n }catch(Exception e){\n e.printStackTrace();\n }\n }\n\n public static void solver(){\n for(int i=1;i<=N;i++){\n dfs(i,i,1);\n // System.out.println(\"doing dfs from \"+i+\" value \"+maxValue);\n // printMatrix()\n }\n System.out.println(maxValue);\n }\n\n \n\n public static void dfs(int src, int origin ,long length){\n if(adjList.get(src) == null || adjList.get(src).size() == 0){\n return ;\n }\n\n //check where things are starting \n for(int i=0;i < adjList.get(src).size();i++){\n // dp[src][adjList.get(src).get(i)] = Math.max(dp[src][adjList.get(src).get(i)],1);\n // dp[origin][adjList.get(src).get(i)] = Math.max(dp[origin][adjList.get(src).get(i)] , length );\n maxValue = Math.max(maxValue , length);\n dfs(adjList.get(src).get(i),origin,length+1);\n } \n }\n\n}", "language": "Java", "metadata": {"date": 1586467346, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03166.html", "problem_id": "p03166", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03166/input.txt", "sample_output_relpath": "derived/input_output/data/p03166/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03166/Java/s094959863.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s094959863", "user_id": "u670194794"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\nimport java.lang.*;\n\n class Main{\n\n static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));\n static StringBuilder sb = new StringBuilder(\"\");\n static StringTokenizer stk = new StringTokenizer(\"\");\n // static long[][] dp ;\n static Map> adjList = new HashMap<>();\n static int N = 0;\n static int M = 0;\n static long maxValue = 0;\n\n public static void main(String args[]){\n try{\n stk = new StringTokenizer(bf.readLine());\n N = Integer.parseInt(stk.nextToken());\n M = Integer.parseInt(stk.nextToken());\n // dp = new long[N+1][N+1];\n\n for(int i=0;i al = new ArrayList<>();\n al.add(to);\n adjList.put(from,al);\n }\n }\n\n solver();\n\n }catch(Exception e){\n e.printStackTrace();\n }\n }\n\n public static void solver(){\n for(int i=1;i<=N;i++){\n dfs(i,i,1);\n // System.out.println(\"doing dfs from \"+i+\" value \"+maxValue);\n // printMatrix()\n }\n System.out.println(maxValue);\n }\n\n \n\n public static void dfs(int src, int origin ,long length){\n if(adjList.get(src) == null || adjList.get(src).size() == 0){\n return ;\n }\n\n //check where things are starting \n for(int i=0;i < adjList.get(src).size();i++){\n // dp[src][adjList.get(src).get(i)] = Math.max(dp[src][adjList.get(src).get(i)],1);\n // dp[origin][adjList.get(src).get(i)] = Math.max(dp[origin][adjList.get(src).get(i)] , length );\n maxValue = Math.max(maxValue , length);\n dfs(adjList.get(src).get(i),origin,length+1);\n } \n }\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a directed graph G with N vertices and M edges.\nThe vertices are numbered 1, 2, \\ldots, N, and for each i (1 \\leq i \\leq M), the i-th directed edge goes from Vertex x_i to y_i.\nG does not contain directed cycles.\n\nFind the length of the longest directed path in G.\nHere, the length of a directed path is the number of edges in it.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq x_i, y_i \\leq N\n\nAll pairs (x_i, y_i) are distinct.\n\nG does not contain directed cycles.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the length of the longest directed path in G.\n\nSample Input 1\n\n4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n\nSample Output 1\n\n3\n\nThe red directed path in the following figure is the longest:\n\nSample Input 2\n\n6 3\n2 3\n4 5\n5 6\n\nSample Output 2\n\n2\n\nThe red directed path in the following figure is the longest:\n\nSample Input 3\n\n5 8\n5 3\n2 3\n2 4\n5 2\n5 1\n1 4\n4 3\n1 3\n\nSample Output 3\n\n3\n\nThe red directed path in the following figure is one of the longest:", "sample_input": "4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03166", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a directed graph G with N vertices and M edges.\nThe vertices are numbered 1, 2, \\ldots, N, and for each i (1 \\leq i \\leq M), the i-th directed edge goes from Vertex x_i to y_i.\nG does not contain directed cycles.\n\nFind the length of the longest directed path in G.\nHere, the length of a directed path is the number of edges in it.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq x_i, y_i \\leq N\n\nAll pairs (x_i, y_i) are distinct.\n\nG does not contain directed cycles.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the length of the longest directed path in G.\n\nSample Input 1\n\n4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n\nSample Output 1\n\n3\n\nThe red directed path in the following figure is the longest:\n\nSample Input 2\n\n6 3\n2 3\n4 5\n5 6\n\nSample Output 2\n\n2\n\nThe red directed path in the following figure is the longest:\n\nSample Input 3\n\n5 8\n5 3\n2 3\n2 4\n5 2\n5 1\n1 4\n4 3\n1 3\n\nSample Output 3\n\n3\n\nThe red directed path in the following figure is one of the longest:", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2154, "cpu_time_ms": 2110, "memory_kb": 346220}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s040679577", "group_id": "codeNet:p03166", "input_text": "import java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.Scanner;\n\nclass Main{\n\tstatic int[] dp;\n\tstatic LinkedList[] graph;\n\tstatic int rec(int v) {\n\t\tif(dp[v] != -1) return dp[v];\n\n\t\tint ret = 0;\n\t\tfor(int u : graph[v]) {\n\t\t\tret = Math.max(ret, rec(u) + 1);\n\t\t}\n\t\treturn dp[v] = ret;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile(sc.hasNext()) {\n\t\t\tint N = sc.nextInt(), M = sc.nextInt();\n\t\t\tgraph = new LinkedList[N];\n\t\t\tfor(int i = 0; i < N; i++) graph[i] = new LinkedList();\n\t\t\tfor(int i = 0; i < M; i++) {\n\t\t\t\tint x = sc.nextInt(), y = sc.nextInt();\n\t\t\t\tgraph[x - 1].add(y - 1);\n\t\t\t}\n\t\t\tdp = new int[N];\n\t\t\tArrays.fill(dp, -1);\n\t\t\tint ans = 0;\n\t\t\tfor(int i = 0; i < N; i++) ans = Math.max(ans, rec(i));\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1560856497, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03166.html", "problem_id": "p03166", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03166/input.txt", "sample_output_relpath": "derived/input_output/data/p03166/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03166/Java/s040679577.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s040679577", "user_id": "u198062737"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.Scanner;\n\nclass Main{\n\tstatic int[] dp;\n\tstatic LinkedList[] graph;\n\tstatic int rec(int v) {\n\t\tif(dp[v] != -1) return dp[v];\n\n\t\tint ret = 0;\n\t\tfor(int u : graph[v]) {\n\t\t\tret = Math.max(ret, rec(u) + 1);\n\t\t}\n\t\treturn dp[v] = ret;\n\t}\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile(sc.hasNext()) {\n\t\t\tint N = sc.nextInt(), M = sc.nextInt();\n\t\t\tgraph = new LinkedList[N];\n\t\t\tfor(int i = 0; i < N; i++) graph[i] = new LinkedList();\n\t\t\tfor(int i = 0; i < M; i++) {\n\t\t\t\tint x = sc.nextInt(), y = sc.nextInt();\n\t\t\t\tgraph[x - 1].add(y - 1);\n\t\t\t}\n\t\t\tdp = new int[N];\n\t\t\tArrays.fill(dp, -1);\n\t\t\tint ans = 0;\n\t\t\tfor(int i = 0; i < N; i++) ans = Math.max(ans, rec(i));\n\t\t\tSystem.out.println(ans);\n\t\t}\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a directed graph G with N vertices and M edges.\nThe vertices are numbered 1, 2, \\ldots, N, and for each i (1 \\leq i \\leq M), the i-th directed edge goes from Vertex x_i to y_i.\nG does not contain directed cycles.\n\nFind the length of the longest directed path in G.\nHere, the length of a directed path is the number of edges in it.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq x_i, y_i \\leq N\n\nAll pairs (x_i, y_i) are distinct.\n\nG does not contain directed cycles.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the length of the longest directed path in G.\n\nSample Input 1\n\n4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n\nSample Output 1\n\n3\n\nThe red directed path in the following figure is the longest:\n\nSample Input 2\n\n6 3\n2 3\n4 5\n5 6\n\nSample Output 2\n\n2\n\nThe red directed path in the following figure is the longest:\n\nSample Input 3\n\n5 8\n5 3\n2 3\n2 4\n5 2\n5 1\n1 4\n4 3\n1 3\n\nSample Output 3\n\n3\n\nThe red directed path in the following figure is one of the longest:", "sample_input": "4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03166", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a directed graph G with N vertices and M edges.\nThe vertices are numbered 1, 2, \\ldots, N, and for each i (1 \\leq i \\leq M), the i-th directed edge goes from Vertex x_i to y_i.\nG does not contain directed cycles.\n\nFind the length of the longest directed path in G.\nHere, the length of a directed path is the number of edges in it.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq x_i, y_i \\leq N\n\nAll pairs (x_i, y_i) are distinct.\n\nG does not contain directed cycles.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the length of the longest directed path in G.\n\nSample Input 1\n\n4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n\nSample Output 1\n\n3\n\nThe red directed path in the following figure is the longest:\n\nSample Input 2\n\n6 3\n2 3\n4 5\n5 6\n\nSample Output 2\n\n2\n\nThe red directed path in the following figure is the longest:\n\nSample Input 3\n\n5 8\n5 3\n2 3\n2 4\n5 2\n5 1\n1 4\n4 3\n1 3\n\nSample Output 3\n\n3\n\nThe red directed path in the following figure is one of the longest:", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 823, "cpu_time_ms": 622, "memory_kb": 98292}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s911127292", "group_id": "codeNet:p03167", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String args[]) {\n \t\tScanner scan = new Scanner(System.in); \t\n \tint rows = scan.nextInt();\n \tint cols = scan.nextInt();\n scan.nextLine();\n \tboolean[][] grid = new boolean[rows][cols];\n \tfor(int r = 0; r < rows; r++){\n \tchar[] line = scan.nextLine().toCharArray();\n \tfor(int c = 0; c < cols; c++){\n \tchar cell = line[c];\n \tgrid[r][c] = cell == '.';\n }\n }\n \tscan.close();\n \tSolver solver = new Solver(grid); \t \t\n \tSystem.out.println(solver.solve());\n\t}\n \n public static class Solver{\n private int mod = 1_000_000_007;\n \tprivate boolean[][] grid;\n \n public Solver(boolean[][] grid){\n \tthis.grid = grid;\n }\n \n public int solve() \n { \n int rows = grid.length;\n int cols = grid[0].length;\n \n int[][] dp = new int[rows][cols];\n\t fillFirstRow(dp, cols); \n fillFirstCol(dp, rows);\n \n for(int r = 1; r < rows; r++){\n \tfor(int c = 1; c < cols; c++){\n if(!grid[r][c]) dp[r][c] = 0;\n else{\n dp[r][c] = (dp[r-1][c] + dp[r][c-1])%mod;\n }\n }\n }\n return dp[rows-1][cols-1];\n } \n private void fillFirstRow(int[][] dp, int cols){\n int c = 0;\n for(; c < cols; c++){\n if(grid[0][c]){\n dp[0][c] = 1;\n }else break;\n }\n for(; c < cols; c++) dp[0][c] = 0;\n }\n private void fillFirstCol(int[][] dp, int rows){\n int r = 0;\n for(; r < rows; r++){\n if(grid[r][0]){\n dp[r][0] = 1;\n }else break;\n }\n for(; r < rows; r++) dp[r][0] = 0;\n }\n }\n}", "language": "Java", "metadata": {"date": 1578508052, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03167.html", "problem_id": "p03167", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03167/input.txt", "sample_output_relpath": "derived/input_output/data/p03167/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03167/Java/s911127292.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s911127292", "user_id": "u764643327"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String args[]) {\n \t\tScanner scan = new Scanner(System.in); \t\n \tint rows = scan.nextInt();\n \tint cols = scan.nextInt();\n scan.nextLine();\n \tboolean[][] grid = new boolean[rows][cols];\n \tfor(int r = 0; r < rows; r++){\n \tchar[] line = scan.nextLine().toCharArray();\n \tfor(int c = 0; c < cols; c++){\n \tchar cell = line[c];\n \tgrid[r][c] = cell == '.';\n }\n }\n \tscan.close();\n \tSolver solver = new Solver(grid); \t \t\n \tSystem.out.println(solver.solve());\n\t}\n \n public static class Solver{\n private int mod = 1_000_000_007;\n \tprivate boolean[][] grid;\n \n public Solver(boolean[][] grid){\n \tthis.grid = grid;\n }\n \n public int solve() \n { \n int rows = grid.length;\n int cols = grid[0].length;\n \n int[][] dp = new int[rows][cols];\n\t fillFirstRow(dp, cols); \n fillFirstCol(dp, rows);\n \n for(int r = 1; r < rows; r++){\n \tfor(int c = 1; c < cols; c++){\n if(!grid[r][c]) dp[r][c] = 0;\n else{\n dp[r][c] = (dp[r-1][c] + dp[r][c-1])%mod;\n }\n }\n }\n return dp[rows-1][cols-1];\n } \n private void fillFirstRow(int[][] dp, int cols){\n int c = 0;\n for(; c < cols; c++){\n if(grid[0][c]){\n dp[0][c] = 1;\n }else break;\n }\n for(; c < cols; c++) dp[0][c] = 0;\n }\n private void fillFirstCol(int[][] dp, int rows){\n int r = 0;\n for(; r < rows; r++){\n if(grid[r][0]){\n dp[r][0] = 1;\n }else break;\n }\n for(; r < rows; r++) dp[r][0] = 0;\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a grid with H horizontal rows and W vertical columns.\nLet (i, j) denote the square at the i-th row from the top and the j-th column from the left.\n\nFor each i and j (1 \\leq i \\leq H, 1 \\leq j \\leq W), Square (i, j) is described by a character a_{i, j}.\nIf a_{i, j} is ., Square (i, j) is an empty square; if a_{i, j} is #, Square (i, j) is a wall square.\nIt is guaranteed that Squares (1, 1) and (H, W) are empty squares.\n\nTaro will start from Square (1, 1) and reach (H, W) by repeatedly moving right or down to an adjacent empty square.\n\nFind the number of Taro's paths from Square (1, 1) to (H, W).\nAs the answer can be extremely large, find the count modulo 10^9 + 7.\n\nConstraints\n\nH and W are integers.\n\n2 \\leq H, W \\leq 1000\n\na_{i, j} is . or #.\n\nSquares (1, 1) and (H, W) are empty squares.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{1, 1}\\ldotsa_{1, W}\n:\na_{H, 1}\\ldotsa_{H, W}\n\nOutput\n\nPrint the number of Taro's paths from Square (1, 1) to (H, W), modulo 10^9 + 7.\n\nSample Input 1\n\n3 4\n...#\n.#..\n....\n\nSample Output 1\n\n3\n\nThere are three paths as follows:\n\nSample Input 2\n\n5 2\n..\n#.\n..\n.#\n..\n\nSample Output 2\n\n0\n\nThere may be no paths.\n\nSample Input 3\n\n5 5\n..#..\n.....\n#...#\n.....\n..#..\n\nSample Output 3\n\n24\n\nSample Input 4\n\n20 20\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n\nSample Output 4\n\n345263555\n\nBe sure to print the count modulo 10^9 + 7.", "sample_input": "3 4\n...#\n.#..\n....\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03167", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a grid with H horizontal rows and W vertical columns.\nLet (i, j) denote the square at the i-th row from the top and the j-th column from the left.\n\nFor each i and j (1 \\leq i \\leq H, 1 \\leq j \\leq W), Square (i, j) is described by a character a_{i, j}.\nIf a_{i, j} is ., Square (i, j) is an empty square; if a_{i, j} is #, Square (i, j) is a wall square.\nIt is guaranteed that Squares (1, 1) and (H, W) are empty squares.\n\nTaro will start from Square (1, 1) and reach (H, W) by repeatedly moving right or down to an adjacent empty square.\n\nFind the number of Taro's paths from Square (1, 1) to (H, W).\nAs the answer can be extremely large, find the count modulo 10^9 + 7.\n\nConstraints\n\nH and W are integers.\n\n2 \\leq H, W \\leq 1000\n\na_{i, j} is . or #.\n\nSquares (1, 1) and (H, W) are empty squares.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{1, 1}\\ldotsa_{1, W}\n:\na_{H, 1}\\ldotsa_{H, W}\n\nOutput\n\nPrint the number of Taro's paths from Square (1, 1) to (H, W), modulo 10^9 + 7.\n\nSample Input 1\n\n3 4\n...#\n.#..\n....\n\nSample Output 1\n\n3\n\nThere are three paths as follows:\n\nSample Input 2\n\n5 2\n..\n#.\n..\n.#\n..\n\nSample Output 2\n\n0\n\nThere may be no paths.\n\nSample Input 3\n\n5 5\n..#..\n.....\n#...#\n.....\n..#..\n\nSample Output 3\n\n24\n\nSample Input 4\n\n20 20\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n\nSample Output 4\n\n345263555\n\nBe sure to print the count modulo 10^9 + 7.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1722, "cpu_time_ms": 221, "memory_kb": 45440}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s393118355", "group_id": "codeNet:p03168", "input_text": "/*input\n5\n0.42 0.01 0.42 0.99 0.42\n*/\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.PriorityQueue;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author masterbios\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CLinovaAndKingdom solver = new CLinovaAndKingdom();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CLinovaAndKingdom {\n\n final int MAXN = (int) (1e3) + 10;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n double p[] = new double[n];\n double dp[][] = new double[n + 3][n + 3];\n for (int i = 0; i < n; i++) p[i] = in.nextDouble();\n dp[0][0] = 1;\n for (int i = 1; i <= n; i++) {\n for (int j = 0; j <= i; j++) {\n if (j == 0) {\n dp[i][j] = (1 - p[i - 1]) * dp[i - 1][j];\n } else {\n dp[i][j] = p[i - 1] * dp[i - 1][j - 1];\n dp[i][j] += (1 - p[i - 1]) * dp[i - 1][j];\n }\n }\n }\n double res = 0.0d;\n for (int i = (n + 1) / 2; i <= n; i++) {\n res += dp[n][i];\n }\n out.printf(\"%.14f\\n\", res);\n\n }\n\n // public double solve(int coins, int heads) {\n // if (coins == 0) {\n // // return 1.0d;\n // if (heads == 0) return 1.0d;\n // else return 0.0d;\n // }\n // if (heads < 0) { System.err.println(\"reach\"); return 0.0d; }\n // if (dp[coins][heads] != 0.0d) return dp[coins][heads];\n // double ans = p[coins - 1] * solve(coins - 1, heads - 1);\n // ans += (1.0d - p[coins - 1]) * solve(coins - 1, heads);\n // return dp[coins][heads] = ans;\n // }\n\n\n public int max(int ...a) {\n int max = Integer.MIN_VALUE;\n for (int i : a) max = Math.max(max, i);\n return max;\n }\n\n public int min(int ...a) {\n int min = Integer.MAX_VALUE;\n for (int i : a) min = Math.min(min, i);\n return min;\n }\n\n public long max(long ...a) {\n long max = Long.MIN_VALUE;\n for (long i : a) max = Math.max(max, i);\n return max;\n }\n\n public long min(long ...a) {\n long min = Long.MAX_VALUE;\n for (long i : a) min = Math.min(min, i);\n return min;\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreElements()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1587541705, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03168.html", "problem_id": "p03168", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03168/input.txt", "sample_output_relpath": "derived/input_output/data/p03168/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03168/Java/s393118355.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s393118355", "user_id": "u101753135"}, "prompt_components": {"gold_output": "0.612\n", "input_to_evaluate": "/*input\n5\n0.42 0.01 0.42 0.99 0.42\n*/\nimport java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.PriorityQueue;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author masterbios\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n CLinovaAndKingdom solver = new CLinovaAndKingdom();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CLinovaAndKingdom {\n\n final int MAXN = (int) (1e3) + 10;\n\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n double p[] = new double[n];\n double dp[][] = new double[n + 3][n + 3];\n for (int i = 0; i < n; i++) p[i] = in.nextDouble();\n dp[0][0] = 1;\n for (int i = 1; i <= n; i++) {\n for (int j = 0; j <= i; j++) {\n if (j == 0) {\n dp[i][j] = (1 - p[i - 1]) * dp[i - 1][j];\n } else {\n dp[i][j] = p[i - 1] * dp[i - 1][j - 1];\n dp[i][j] += (1 - p[i - 1]) * dp[i - 1][j];\n }\n }\n }\n double res = 0.0d;\n for (int i = (n + 1) / 2; i <= n; i++) {\n res += dp[n][i];\n }\n out.printf(\"%.14f\\n\", res);\n\n }\n\n // public double solve(int coins, int heads) {\n // if (coins == 0) {\n // // return 1.0d;\n // if (heads == 0) return 1.0d;\n // else return 0.0d;\n // }\n // if (heads < 0) { System.err.println(\"reach\"); return 0.0d; }\n // if (dp[coins][heads] != 0.0d) return dp[coins][heads];\n // double ans = p[coins - 1] * solve(coins - 1, heads - 1);\n // ans += (1.0d - p[coins - 1]) * solve(coins - 1, heads);\n // return dp[coins][heads] = ans;\n // }\n\n\n public int max(int ...a) {\n int max = Integer.MIN_VALUE;\n for (int i : a) max = Math.max(max, i);\n return max;\n }\n\n public int min(int ...a) {\n int min = Integer.MAX_VALUE;\n for (int i : a) min = Math.min(min, i);\n return min;\n }\n\n public long max(long ...a) {\n long max = Long.MIN_VALUE;\n for (long i : a) max = Math.max(max, i);\n return max;\n }\n\n public long min(long ...a) {\n long min = Long.MAX_VALUE;\n for (long i : a) min = Math.min(min, i);\n return min;\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreElements()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n }\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nLet N be a positive odd number.\n\nThere are N coins, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), when Coin i is tossed, it comes up heads with probability p_i and tails with probability 1 - p_i.\n\nTaro has tossed all the N coins.\nFind the probability of having more heads than tails.\n\nConstraints\n\nN is an odd number.\n\n1 \\leq N \\leq 2999\n\np_i is a real number and has two decimal places.\n\n0 < p_i < 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint the probability of having more heads than tails.\nThe output is considered correct when the absolute error is not greater than 10^{-9}.\n\nSample Input 1\n\n3\n0.30 0.60 0.80\n\nSample Output 1\n\n0.612\n\nThe probability of each case where we have more heads than tails is as follows:\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Head, Head) is 0.3 × 0.6 × 0.8 = 0.144;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Tail, Head, Head) is 0.7 × 0.6 × 0.8 = 0.336;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Tail, Head) is 0.3 × 0.4 × 0.8 = 0.096;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Head, Tail) is 0.3 × 0.6 × 0.2 = 0.036.\n\nThus, the probability of having more heads than tails is 0.144 + 0.336 + 0.096 + 0.036 = 0.612.\n\nSample Input 2\n\n1\n0.50\n\nSample Output 2\n\n0.5\n\nOutputs such as 0.500, 0.500000001 and 0.499999999 are also considered correct.\n\nSample Input 3\n\n5\n0.42 0.01 0.42 0.99 0.42\n\nSample Output 3\n\n0.3821815872", "sample_input": "3\n0.30 0.60 0.80\n"}, "reference_outputs": ["0.612\n"], "source_document_id": "p03168", "source_text": "Score : 100 points\n\nProblem Statement\n\nLet N be a positive odd number.\n\nThere are N coins, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), when Coin i is tossed, it comes up heads with probability p_i and tails with probability 1 - p_i.\n\nTaro has tossed all the N coins.\nFind the probability of having more heads than tails.\n\nConstraints\n\nN is an odd number.\n\n1 \\leq N \\leq 2999\n\np_i is a real number and has two decimal places.\n\n0 < p_i < 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint the probability of having more heads than tails.\nThe output is considered correct when the absolute error is not greater than 10^{-9}.\n\nSample Input 1\n\n3\n0.30 0.60 0.80\n\nSample Output 1\n\n0.612\n\nThe probability of each case where we have more heads than tails is as follows:\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Head, Head) is 0.3 × 0.6 × 0.8 = 0.144;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Tail, Head, Head) is 0.7 × 0.6 × 0.8 = 0.336;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Tail, Head) is 0.3 × 0.4 × 0.8 = 0.096;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Head, Tail) is 0.3 × 0.6 × 0.2 = 0.036.\n\nThus, the probability of having more heads than tails is 0.144 + 0.336 + 0.096 + 0.036 = 0.612.\n\nSample Input 2\n\n1\n0.50\n\nSample Output 2\n\n0.5\n\nOutputs such as 0.500, 0.500000001 and 0.499999999 are also considered correct.\n\nSample Input 3\n\n5\n0.42 0.01 0.42 0.99 0.42\n\nSample Output 3\n\n0.3821815872", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3951, "cpu_time_ms": 183, "memory_kb": 129108}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s305250706", "group_id": "codeNet:p03168", "input_text": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String in[] = br.readLine().split(\" \");\n int n = Integer.parseInt(in[0]);\n in = br.readLine().split(\" \");\n double arr[]=new double[n];\n double dp[] = new double[n+1];\n for(int i=0;i=0;coin--){\n dp[coin]= ((coin==0)?0:dp[coin-1]*arr[i])+dp[coin]*(1-arr[i]);\n }\n }\n double ans = 0;\n for(int i=0;i<=n;i++){\n int tail = n-i;\n if(tail=0;coin--){\n dp[coin]= ((coin==0)?0:dp[coin-1]*arr[i])+dp[coin]*(1-arr[i]);\n }\n }\n double ans = 0;\n for(int i=0;i<=n;i++){\n int tail = n-i;\n if(tail= H && b[i] >=W) {\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1545530945, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03193.html", "problem_id": "p03193", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03193/input.txt", "sample_output_relpath": "derived/input_output/data/p03193/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03193/Java/s604495508.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s604495508", "user_id": "u752146501"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\tstatic int N = sc.nextInt();\n\tstatic int H = sc.nextInt();\n\tstatic int W = sc.nextInt();\n\tstatic int[] a = new int[N];\n\tstatic int[] b = new int[N];\n\tpublic static void main(String[] args) {\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t\tb[i] = sc.nextInt();\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tif (a[i] >= H && b[i] >=W) {\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N rectangular plate materials made of special metal called AtCoder Alloy.\nThe dimensions of the i-th material are A_i \\times B_i (A_i vertically and B_i horizontally).\n\nTakahashi wants a rectangular plate made of AtCoder Alloy whose dimensions are exactly H \\times W.\nHe is trying to obtain such a plate by choosing one of the N materials and cutting it if necessary.\nWhen cutting a material, the cuts must be parallel to one of the sides of the material.\nAlso, the materials have fixed directions and cannot be rotated.\nFor example, a 5 \\times 3 material cannot be used as a 3 \\times 5 plate.\n\nOut of the N materials, how many can produce an H \\times W plate if properly cut?\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n1 \\leq H \\leq 10^9\n\n1 \\leq W \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H W\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 5 2\n10 3\n5 2\n2 5\n\nSample Output 1\n\n2\n\nTakahashi wants a 5 \\times 2 plate.\n\nThe dimensions of the first material are 10 \\times 3. We can obtain a 5 \\times 2 plate by properly cutting it.\n\nThe dimensions of the second material are 5 \\times 2. We can obtain a 5 \\times 2 plate without cutting it.\n\nThe dimensions of the third material are 2 \\times 5. We cannot obtain a 5 \\times 2 plate, whatever cuts are made. Note that the material cannot be rotated and used as a 5 \\times 2 plate.\n\nSample Input 2\n\n10 587586158 185430194\n894597290 708587790\n680395892 306946994\n590262034 785368612\n922328576 106880540\n847058850 326169610\n936315062 193149191\n702035777 223363392\n11672949 146832978\n779291680 334178158\n615808191 701464268\n\nSample Output 2\n\n8", "sample_input": "3 5 2\n10 3\n5 2\n2 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03193", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N rectangular plate materials made of special metal called AtCoder Alloy.\nThe dimensions of the i-th material are A_i \\times B_i (A_i vertically and B_i horizontally).\n\nTakahashi wants a rectangular plate made of AtCoder Alloy whose dimensions are exactly H \\times W.\nHe is trying to obtain such a plate by choosing one of the N materials and cutting it if necessary.\nWhen cutting a material, the cuts must be parallel to one of the sides of the material.\nAlso, the materials have fixed directions and cannot be rotated.\nFor example, a 5 \\times 3 material cannot be used as a 3 \\times 5 plate.\n\nOut of the N materials, how many can produce an H \\times W plate if properly cut?\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n1 \\leq H \\leq 10^9\n\n1 \\leq W \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H W\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 5 2\n10 3\n5 2\n2 5\n\nSample Output 1\n\n2\n\nTakahashi wants a 5 \\times 2 plate.\n\nThe dimensions of the first material are 10 \\times 3. We can obtain a 5 \\times 2 plate by properly cutting it.\n\nThe dimensions of the second material are 5 \\times 2. We can obtain a 5 \\times 2 plate without cutting it.\n\nThe dimensions of the third material are 2 \\times 5. We cannot obtain a 5 \\times 2 plate, whatever cuts are made. Note that the material cannot be rotated and used as a 5 \\times 2 plate.\n\nSample Input 2\n\n10 587586158 185430194\n894597290 708587790\n680395892 306946994\n590262034 785368612\n922328576 106880540\n847058850 326169610\n936315062 193149191\n702035777 223363392\n11672949 146832978\n779291680 334178158\n615808191 701464268\n\nSample Output 2\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 499, "cpu_time_ms": 148, "memory_kb": 25776}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s007833248", "group_id": "codeNet:p03196", "input_text": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner keyboard = new Scanner(System.in);\n\n\t\tlong N = keyboard.nextLong();\n\t\tlong P = keyboard.nextLong();\n\t\t\n\t\tHashMap prime = new HashMap();\n\t\tfor (int i=2;1L*i*i<=P;i++) {\n\t\t\twhile (P % i == 0) {\n\t\t\t\tint count = prime.containsKey((long)i) ? prime.get((long)i) : 0;\n\t\t\t\tprime.put((long)i, count + 1);\n\t\t\t\tP /= i;\n\t\t\t}\n\t\t}\n\t\tif (P != 1) prime.put(P, 1);\n\t\t\n\t\tlong ans = 1;\n for (Map.Entry entry : prime.entrySet()) {\n for (int i=0; i < entry.getValue() / N; i++) {\n \t\tans *= entry.getKey();\n \t} \n }\n\t\t\n\t\tSystem.out.println(ans);\n\t\tkeyboard.close();\n\t}\n\t\n}\n", "language": "Java", "metadata": {"date": 1596905390, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03196.html", "problem_id": "p03196", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03196/input.txt", "sample_output_relpath": "derived/input_output/data/p03196/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03196/Java/s007833248.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s007833248", "user_id": "u532573979"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner keyboard = new Scanner(System.in);\n\n\t\tlong N = keyboard.nextLong();\n\t\tlong P = keyboard.nextLong();\n\t\t\n\t\tHashMap prime = new HashMap();\n\t\tfor (int i=2;1L*i*i<=P;i++) {\n\t\t\twhile (P % i == 0) {\n\t\t\t\tint count = prime.containsKey((long)i) ? prime.get((long)i) : 0;\n\t\t\t\tprime.put((long)i, count + 1);\n\t\t\t\tP /= i;\n\t\t\t}\n\t\t}\n\t\tif (P != 1) prime.put(P, 1);\n\t\t\n\t\tlong ans = 1;\n for (Map.Entry entry : prime.entrySet()) {\n for (int i=0; i < entry.getValue() / N; i++) {\n \t\tans *= entry.getKey();\n \t} \n }\n\t\t\n\t\tSystem.out.println(ans);\n\t\tkeyboard.close();\n\t}\n\t\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "sample_input": "3 24\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03196", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 729, "cpu_time_ms": 123, "memory_kb": 35948}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s225633977", "group_id": "codeNet:p03197", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n boolean allEven = true;\n for (int i = 0; i < N; i++) {\n int a = sc.nextInt();\n if (a%2 != 0) {\n allEven = false;\n }\n }\n System.out.println(allEven ? \"second\" : \"first\");\n }\n}", "language": "Java", "metadata": {"date": 1576038498, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03197.html", "problem_id": "p03197", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03197/input.txt", "sample_output_relpath": "derived/input_output/data/p03197/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03197/Java/s225633977.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s225633977", "user_id": "u507706381"}, "prompt_components": {"gold_output": "first\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n boolean allEven = true;\n for (int i = 0; i < N; i++) {\n int a = sc.nextInt();\n if (a%2 != 0) {\n allEven = false;\n }\n }\n System.out.println(allEven ? \"second\" : \"first\");\n }\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "sample_input": "2\n1\n2\n"}, "reference_outputs": ["first\n"], "source_document_id": "p03197", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 361, "cpu_time_ms": 466, "memory_kb": 48564}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s116810353", "group_id": "codeNet:p03201", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\nimport java.util.Comparator;\nimport java.util.ArrayList;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author silviase\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n BPowersOfTwo solver = new BPowersOfTwo();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class BPowersOfTwo {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n // input\n int n = in.nextInt();\n ArrayList a = new ArrayList<>();\n int ans = 0;\n for (int i = 0; i < n; i++) {\n a.add(in.nextInt());\n }\n a.sort(Comparator.naturalOrder());\n while (a.size() > 1) {\n // 二分探索で一つ上のを探す\n // 一回当たりlogNだから全体で N*logN が上界\n int target = 1;\n while (target <= a.get(a.size() - 1)) {\n target *= 2;\n }\n target -= a.get(a.size() - 1);\n\n a.remove(a.size() - 1);\n\n // System.out.println(\"size: \" + a.size() + \", target: \" + target);\n // targetを二分探索で探す\n int low = 0;\n int high = a.size() - 1;\n int mid = (low + high) / 2;\n while (high >= low) {\n boolean f = false;\n if (a.get(mid) < target) {\n //System.out.println(\"low\");\n low = mid + 1;\n } else if (a.get(mid) > target) {\n //System.out.println(\"high\");\n high = mid - 1;\n } else {\n f = true;\n // System.out.println(\"got it\");\n ans++;\n a.remove(mid);\n }\n mid = (low + high) / 2;\n if (f) break;\n }\n }\n\n out.println(ans);\n\n\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1582563023, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03201.html", "problem_id": "p03201", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03201/input.txt", "sample_output_relpath": "derived/input_output/data/p03201/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03201/Java/s116810353.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s116810353", "user_id": "u902576227"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\nimport java.util.Comparator;\nimport java.util.ArrayList;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author silviase\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n BPowersOfTwo solver = new BPowersOfTwo();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class BPowersOfTwo {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n // input\n int n = in.nextInt();\n ArrayList a = new ArrayList<>();\n int ans = 0;\n for (int i = 0; i < n; i++) {\n a.add(in.nextInt());\n }\n a.sort(Comparator.naturalOrder());\n while (a.size() > 1) {\n // 二分探索で一つ上のを探す\n // 一回当たりlogNだから全体で N*logN が上界\n int target = 1;\n while (target <= a.get(a.size() - 1)) {\n target *= 2;\n }\n target -= a.get(a.size() - 1);\n\n a.remove(a.size() - 1);\n\n // System.out.println(\"size: \" + a.size() + \", target: \" + target);\n // targetを二分探索で探す\n int low = 0;\n int high = a.size() - 1;\n int mid = (low + high) / 2;\n while (high >= low) {\n boolean f = false;\n if (a.get(mid) < target) {\n //System.out.println(\"low\");\n low = mid + 1;\n } else if (a.get(mid) > target) {\n //System.out.println(\"high\");\n high = mid - 1;\n } else {\n f = true;\n // System.out.println(\"got it\");\n ans++;\n a.remove(mid);\n }\n mid = (low + high) / 2;\n if (f) break;\n }\n }\n\n out.println(ans);\n\n\n }\n\n }\n}\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N balls with positive integers written on them. The integer written on the i-th ball is A_i.\nHe would like to form some number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\nNote that a ball cannot belong to multiple pairs.\nFind the maximum possible number of pairs that can be formed.\n\nHere, a positive integer is said to be a power of 2 when it can be written as 2^t using some non-negative integer t.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n1\n\nWe can form one pair whose sum of the written numbers is 4 by pairing the first and third balls.\nNote that we cannot pair the second ball with itself.\n\nSample Input 2\n\n5\n3 11 14 5 13\n\nSample Output 2\n\n2", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03201", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N balls with positive integers written on them. The integer written on the i-th ball is A_i.\nHe would like to form some number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\nNote that a ball cannot belong to multiple pairs.\nFind the maximum possible number of pairs that can be formed.\n\nHere, a positive integer is said to be a power of 2 when it can be written as 2^t using some non-negative integer t.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n1\n\nWe can form one pair whose sum of the written numbers is 4 by pairing the first and third balls.\nNote that we cannot pair the second ball with itself.\n\nSample Input 2\n\n5\n3 11 14 5 13\n\nSample Output 2\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2425, "cpu_time_ms": 2105, "memory_kb": 88204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s797456936", "group_id": "codeNet:p03202", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n try (Scanner sc = new Scanner(System.in);) {\n solve(sc);\n }\n }\n\n public static void solve(Scanner sc) {\n int n = sc.nextInt();\n sc.nextLine();\n String[] aStrings = sc.nextLine().split(\" \");\n int[] as = new int[n];\n for (int i = 0; i < n; i++) {\n as[i] = Integer.parseInt(aStrings[i]);\n }\n\n int count = 0;\n for (int i = 0; i < n; i++) {\n if (as[i] == 1) {\n count++;\n }\n }\n if (as[0] != 1) {\n count++;\n }\n System.out.println(count);\n }\n}", "language": "Java", "metadata": {"date": 1544928625, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03202.html", "problem_id": "p03202", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03202/input.txt", "sample_output_relpath": "derived/input_output/data/p03202/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03202/Java/s797456936.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s797456936", "user_id": "u784448849"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n try (Scanner sc = new Scanner(System.in);) {\n solve(sc);\n }\n }\n\n public static void solve(Scanner sc) {\n int n = sc.nextInt();\n sc.nextLine();\n String[] aStrings = sc.nextLine().split(\" \");\n int[] as = new int[n];\n for (int i = 0; i < n; i++) {\n as[i] = Integer.parseInt(aStrings[i]);\n }\n\n int count = 0;\n for (int i = 0; i < n; i++) {\n if (as[i] == 1) {\n count++;\n }\n }\n if (as[0] != 1) {\n count++;\n }\n System.out.println(count);\n }\n}", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N strings arranged in a row.\nIt is known that, for any two adjacent strings, the string to the left is lexicographically smaller than the string to the right.\nThat is, S_1 String.format(\"%3d\", e)).collect(Collectors.joining(\",\", \"素数 = [\", \"] (2 ≦ P ≦ N)\")));\n\t\tList primeFactors = getPrimeFactors(n, primes);\n\t\t//System.out.println(primeFactors.stream().map(Result::toString).collect(Collectors.joining(\" * \", String.format(\"%3d! = \", n), \"\")));\n\t\tList result = dp(primeFactors).stream().distinct().sorted(Comparator.comparingDouble(Results::getValue)).collect(Collectors.toList());\n\t\t//System.out.println(result.stream().mapToDouble(Results::getValue).mapToObj(e -> String.format(\"%.0f\", e)).collect(Collectors.joining(\", \", \"75数 = [\", \"]\")));\n\t\t//System.out.println(result.stream().map(Results::toString).collect(Collectors.joining(\", \", \"素因数 = [\", \"]\")));\n\t\t//System.out.println(String.format(\"答え = %d個\", result.stream().mapToDouble(Results::getValue).count()));\n\t\tSystem.out.println(result.stream().mapToDouble(Results::getValue).count());\n\t}\n\n\tprivate static final List dp(List factors) {\n\t\tList result = new ArrayList<>();\n\n\t\tfor (int[] nums : FN) {\n\t\t\tList> entries = new ArrayList<>();\n\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\tfinal int min = nums[i];\n\t\t\t\tif (min > 1) {\n\t\t\t\t\tentries.add(factors.stream()\n\t\t\t\t\t\t\t.filter(r -> r.getE() >= min)\n\t\t\t\t\t\t\t.collect(Collectors.toList()));\n\t\t\t\t} else {\n\t\t\t\t\tentries.add(Arrays.asList(Result.NULL));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (Result x : entries.get(0)) {\n\t\t\t\tfor (Result y : entries.get(1)) {\n\t\t\t\t\tif (y.equals(x)) continue;\n\t\t\t\t\tfor (Result z : entries.get(2)) {\n\t\t\t\t\t\tif (z.equals(y) || z.equals(x)) continue;\n\t\t\t\t\t\tresult.add(new Results(\tnew Result(x, nums[0]),\n\t\t\t\t\t\t\t\t\t\t\t\tnew Result(y, nums[1]),\n\t\t\t\t\t\t\t\t\t\t\t\tnew Result(z, nums[2]) ));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t// 2 ~ max までの素数の一覧を求める\n\tprivate static final int[] getPrime(int max) {\n\t\tList primes = new ArrayList<>();\n\n\t\touter : for (int i = 2; i <= max; i++) {\n\t\t\tfor (int n : primes) {\n\t\t\t\tif (i % n == 0) {\n\t\t\t\t\tcontinue outer;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprimes.add(i);\n\t\t}\n\n\t\treturn primes.stream().mapToInt(Integer::intValue).toArray();\n\t}\n\n\t// nを素因数分解し、素因数j:指数kのマッピングを返す\n\tprivate static final Map countPrimeFactor(int n, int[] primes) {\n\t\tint i = 0;\n\t\tMap primeFactors = new HashMap<>();\n\n\t\twhile (n > 0 && n >= primes[i]) {\n\t\t\tif (n % primes[i] == 0) {\n\t\t\t\tn /= primes[i];\n\n\t\t\t\tInteger v = primeFactors.get(primes[i]);\n\t\t\t\tprimeFactors.put(primes[i], (v == null) ? 1 : v + 1);\n\t\t\t} else {\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\n\t\treturn primeFactors;\n\t}\n\n\t// n!を素因数分解し、素因数j:指数kのマッピングを返す\n\tprivate static final List getPrimeFactors (int n, int[] primes) {\n\n\t\tMap primeFactors = new HashMap<>();\n\t\tfor (int i = 2; i <= n; i++) {\n\t\t\tMap m = countPrimeFactor(i, primes);\n\n\t\t\tfor(Entry e : m.entrySet()) {\n\t\t\t\tInteger v = primeFactors.get(e.getKey());\n\t\t\t\tprimeFactors.put(e.getKey(), e.getValue() + ((v == null) ? 0 : v));\n\t\t\t}\n\t\t\tSystem.out.println(m.entrySet().stream().map(e -> String.format(\"(%2d^%2d)\", e.getKey(), e.getValue())).collect(Collectors.joining(\" * \", String.format(\"%3d = \", i), \"\")));\n\t\t}\n\n\t\treturn primeFactors.entrySet().stream()\n\t\t\t\t.map(e -> new Result(e.getKey(), e.getValue()))\n\t\t\t\t.sorted(Comparator.comparingInt(Result::getB))\n\t\t\t\t.collect(Collectors.toList());\n\t}\n}\n\nclass Result {\n\tstatic Result NULL;\n\tstatic { NULL = new Result(1, 1); }\n\n\tprivate final int B;\n\tprivate final int E;\n\tpublic Result(int base, int exponent) {\n\t\tB = base;\n\t\tE = exponent;\n\t}\n\n\tpublic Result(Result r, int exponent) {\n\t\tB = r.B;\n\t\tE = exponent;\n\t}\n\n\tprivate final double pow(int b, int e) {\n\t\tdouble r = 1;\n\t\tfor (int i = 0; i < e; i++) {\n\t\t\tr *= b;\n\t\t}\n\t\treturn r;\n\t}\n\n\tprotected final double getR() {\n\t\treturn pow(B, E);\n\t}\n\n\tprotected final int getB() {\n\t\treturn B;\n\t}\n\n\tprotected final int getE() {\n\t\treturn E;\n\t}\n\n\tprotected final boolean isNotNull() {\n\t\treturn getR() != 1;\n\t}\n\n\t@Override\n\tpublic String toString() {\n\t\treturn String.format(\"(%2d^%2d)\", B, E);\n\t}\n\n\t@Override\n\tpublic boolean equals(Object obj) {\n\t\tif (obj == null) return false;\n\t\tif (!(obj instanceof Result)) return false;\n\n\t\tResult r = (Result)obj;\n\t\treturn (r.isNotNull() && this.isNotNull() && (r.getR() == this.getR()));\n\t}\n}\n\nclass Results {\n\tprivate final List RS;\n\tprivate double V;\n\n\tpublic Results() {\n\t\tRS = new ArrayList<>();\n\t\tcalc();\n\t}\n\n\tpublic Results(Result... r) {\n\t\tthis();\n\t\tArrays.stream(r).filter(Result::isNotNull).forEach(RS::add);\n\t\tcalc();\n\t}\n\n\tprivate void calc() {\n\t\tV = RS.stream().mapToDouble(Result::getR).reduce(1, (e1, e2) -> e1 * e2);\n\t}\n\n\tpublic double getValue() {\n\t\treturn V;\n\t}\n\n\t@Override\n\tpublic String toString() {\n\t\treturn RS.stream().filter(Result::isNotNull).map(Result::toString).collect(Collectors.joining(\" * \", \"[\", \"]\"));\n\t}\n\n\t@Override\n\tpublic boolean equals(Object e) {\n\t\treturn (e instanceof Results) &&\n\t\t\t\t((Results)e).getValue() == this.getValue();\n\t}\n\n\t@Override\n\tpublic int hashCode() {\n\t\treturn 0;\n\t}\n}\n\nclass NullEntry implements Entry {\n\tpublic NullEntry() {\n\t}\n\n\t@Override\n\tpublic Integer getKey() {\n\t\treturn 1;\n\t}\n\n\t@Override\n\tpublic Integer getValue() {\n\t\treturn 1;\n\t}\n\n\t@Override\n\tpublic Integer setValue(Integer value) {\n\t\treturn 1;\n\t}\n\n\t@Override\n\tpublic boolean equals(Object e) {\n\t\treturn false;\n\t}\n}", "language": "Java", "metadata": {"date": 1562010978, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03213.html", "problem_id": "p03213", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03213/input.txt", "sample_output_relpath": "derived/input_output/data/p03213/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03213/Java/s244895000.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s244895000", "user_id": "u196085706"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.Scanner;\nimport java.util.stream.Collectors;\n\npublic class Main {\n\n\tstatic final int[][] FN = new int[][]{ {74, 1, 1}, {24, 2, 1}, {14, 4, 1}, {4, 4, 2}};\n\n\tpublic static void main(String[] args) {\n\t\tScanner sysin = new Scanner(System.in);\n\t\tfinal int n = sysin.nextInt();\n\t\tsysin.close();\n\n\t\t//System.out.println(String.format(\" N = %3d\", n));\n\t\tint[] primes = getPrime(n);\n\t\t//System.out.println(Arrays.stream(primes).boxed().map(e -> String.format(\"%3d\", e)).collect(Collectors.joining(\",\", \"素数 = [\", \"] (2 ≦ P ≦ N)\")));\n\t\tList primeFactors = getPrimeFactors(n, primes);\n\t\t//System.out.println(primeFactors.stream().map(Result::toString).collect(Collectors.joining(\" * \", String.format(\"%3d! = \", n), \"\")));\n\t\tList result = dp(primeFactors).stream().distinct().sorted(Comparator.comparingDouble(Results::getValue)).collect(Collectors.toList());\n\t\t//System.out.println(result.stream().mapToDouble(Results::getValue).mapToObj(e -> String.format(\"%.0f\", e)).collect(Collectors.joining(\", \", \"75数 = [\", \"]\")));\n\t\t//System.out.println(result.stream().map(Results::toString).collect(Collectors.joining(\", \", \"素因数 = [\", \"]\")));\n\t\t//System.out.println(String.format(\"答え = %d個\", result.stream().mapToDouble(Results::getValue).count()));\n\t\tSystem.out.println(result.stream().mapToDouble(Results::getValue).count());\n\t}\n\n\tprivate static final List dp(List factors) {\n\t\tList result = new ArrayList<>();\n\n\t\tfor (int[] nums : FN) {\n\t\t\tList> entries = new ArrayList<>();\n\t\t\tfor (int i = 0; i < 3; i++) {\n\t\t\t\tfinal int min = nums[i];\n\t\t\t\tif (min > 1) {\n\t\t\t\t\tentries.add(factors.stream()\n\t\t\t\t\t\t\t.filter(r -> r.getE() >= min)\n\t\t\t\t\t\t\t.collect(Collectors.toList()));\n\t\t\t\t} else {\n\t\t\t\t\tentries.add(Arrays.asList(Result.NULL));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (Result x : entries.get(0)) {\n\t\t\t\tfor (Result y : entries.get(1)) {\n\t\t\t\t\tif (y.equals(x)) continue;\n\t\t\t\t\tfor (Result z : entries.get(2)) {\n\t\t\t\t\t\tif (z.equals(y) || z.equals(x)) continue;\n\t\t\t\t\t\tresult.add(new Results(\tnew Result(x, nums[0]),\n\t\t\t\t\t\t\t\t\t\t\t\tnew Result(y, nums[1]),\n\t\t\t\t\t\t\t\t\t\t\t\tnew Result(z, nums[2]) ));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t// 2 ~ max までの素数の一覧を求める\n\tprivate static final int[] getPrime(int max) {\n\t\tList primes = new ArrayList<>();\n\n\t\touter : for (int i = 2; i <= max; i++) {\n\t\t\tfor (int n : primes) {\n\t\t\t\tif (i % n == 0) {\n\t\t\t\t\tcontinue outer;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprimes.add(i);\n\t\t}\n\n\t\treturn primes.stream().mapToInt(Integer::intValue).toArray();\n\t}\n\n\t// nを素因数分解し、素因数j:指数kのマッピングを返す\n\tprivate static final Map countPrimeFactor(int n, int[] primes) {\n\t\tint i = 0;\n\t\tMap primeFactors = new HashMap<>();\n\n\t\twhile (n > 0 && n >= primes[i]) {\n\t\t\tif (n % primes[i] == 0) {\n\t\t\t\tn /= primes[i];\n\n\t\t\t\tInteger v = primeFactors.get(primes[i]);\n\t\t\t\tprimeFactors.put(primes[i], (v == null) ? 1 : v + 1);\n\t\t\t} else {\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\n\t\treturn primeFactors;\n\t}\n\n\t// n!を素因数分解し、素因数j:指数kのマッピングを返す\n\tprivate static final List getPrimeFactors (int n, int[] primes) {\n\n\t\tMap primeFactors = new HashMap<>();\n\t\tfor (int i = 2; i <= n; i++) {\n\t\t\tMap m = countPrimeFactor(i, primes);\n\n\t\t\tfor(Entry e : m.entrySet()) {\n\t\t\t\tInteger v = primeFactors.get(e.getKey());\n\t\t\t\tprimeFactors.put(e.getKey(), e.getValue() + ((v == null) ? 0 : v));\n\t\t\t}\n\t\t\tSystem.out.println(m.entrySet().stream().map(e -> String.format(\"(%2d^%2d)\", e.getKey(), e.getValue())).collect(Collectors.joining(\" * \", String.format(\"%3d = \", i), \"\")));\n\t\t}\n\n\t\treturn primeFactors.entrySet().stream()\n\t\t\t\t.map(e -> new Result(e.getKey(), e.getValue()))\n\t\t\t\t.sorted(Comparator.comparingInt(Result::getB))\n\t\t\t\t.collect(Collectors.toList());\n\t}\n}\n\nclass Result {\n\tstatic Result NULL;\n\tstatic { NULL = new Result(1, 1); }\n\n\tprivate final int B;\n\tprivate final int E;\n\tpublic Result(int base, int exponent) {\n\t\tB = base;\n\t\tE = exponent;\n\t}\n\n\tpublic Result(Result r, int exponent) {\n\t\tB = r.B;\n\t\tE = exponent;\n\t}\n\n\tprivate final double pow(int b, int e) {\n\t\tdouble r = 1;\n\t\tfor (int i = 0; i < e; i++) {\n\t\t\tr *= b;\n\t\t}\n\t\treturn r;\n\t}\n\n\tprotected final double getR() {\n\t\treturn pow(B, E);\n\t}\n\n\tprotected final int getB() {\n\t\treturn B;\n\t}\n\n\tprotected final int getE() {\n\t\treturn E;\n\t}\n\n\tprotected final boolean isNotNull() {\n\t\treturn getR() != 1;\n\t}\n\n\t@Override\n\tpublic String toString() {\n\t\treturn String.format(\"(%2d^%2d)\", B, E);\n\t}\n\n\t@Override\n\tpublic boolean equals(Object obj) {\n\t\tif (obj == null) return false;\n\t\tif (!(obj instanceof Result)) return false;\n\n\t\tResult r = (Result)obj;\n\t\treturn (r.isNotNull() && this.isNotNull() && (r.getR() == this.getR()));\n\t}\n}\n\nclass Results {\n\tprivate final List RS;\n\tprivate double V;\n\n\tpublic Results() {\n\t\tRS = new ArrayList<>();\n\t\tcalc();\n\t}\n\n\tpublic Results(Result... r) {\n\t\tthis();\n\t\tArrays.stream(r).filter(Result::isNotNull).forEach(RS::add);\n\t\tcalc();\n\t}\n\n\tprivate void calc() {\n\t\tV = RS.stream().mapToDouble(Result::getR).reduce(1, (e1, e2) -> e1 * e2);\n\t}\n\n\tpublic double getValue() {\n\t\treturn V;\n\t}\n\n\t@Override\n\tpublic String toString() {\n\t\treturn RS.stream().filter(Result::isNotNull).map(Result::toString).collect(Collectors.joining(\" * \", \"[\", \"]\"));\n\t}\n\n\t@Override\n\tpublic boolean equals(Object e) {\n\t\treturn (e instanceof Results) &&\n\t\t\t\t((Results)e).getValue() == this.getValue();\n\t}\n\n\t@Override\n\tpublic int hashCode() {\n\t\treturn 0;\n\t}\n}\n\nclass NullEntry implements Entry {\n\tpublic NullEntry() {\n\t}\n\n\t@Override\n\tpublic Integer getKey() {\n\t\treturn 1;\n\t}\n\n\t@Override\n\tpublic Integer getValue() {\n\t\treturn 1;\n\t}\n\n\t@Override\n\tpublic Integer setValue(Integer value) {\n\t\treturn 1;\n\t}\n\n\t@Override\n\tpublic boolean equals(Object e) {\n\t\treturn false;\n\t}\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an integer N. Among the divisors of N! (= 1 \\times 2 \\times ... \\times N), how many Shichi-Go numbers (literally \"Seven-Five numbers\") are there?\n\nHere, a Shichi-Go number is a positive integer that has exactly 75 divisors.\n\nNote\n\nWhen a positive integer A divides a positive integer B, A is said to a divisor of B.\nFor example, 6 has four divisors: 1, 2, 3 and 6.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go numbers that are divisors of N!.\n\nSample Input 1\n\n9\n\nSample Output 1\n\n0\n\nThere are no Shichi-Go numbers among the divisors of 9! = 1 \\times 2 \\times ... \\times 9 = 362880.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1\n\nThere is one Shichi-Go number among the divisors of 10! = 3628800: 32400.\n\nSample Input 3\n\n100\n\nSample Output 3\n\n543", "sample_input": "9\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03213", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given an integer N. Among the divisors of N! (= 1 \\times 2 \\times ... \\times N), how many Shichi-Go numbers (literally \"Seven-Five numbers\") are there?\n\nHere, a Shichi-Go number is a positive integer that has exactly 75 divisors.\n\nNote\n\nWhen a positive integer A divides a positive integer B, A is said to a divisor of B.\nFor example, 6 has four divisors: 1, 2, 3 and 6.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go numbers that are divisors of N!.\n\nSample Input 1\n\n9\n\nSample Output 1\n\n0\n\nThere are no Shichi-Go numbers among the divisors of 9! = 1 \\times 2 \\times ... \\times 9 = 362880.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1\n\nThere is one Shichi-Go number among the divisors of 10! = 3628800: 32400.\n\nSample Input 3\n\n100\n\nSample Output 3\n\n543", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6033, "cpu_time_ms": 314, "memory_kb": 29780}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s385549394", "group_id": "codeNet:p03213", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n\npublic class Main {\n\n int N;\n\n private void solve() {\n // 36400 = 2 * 2 * 2 * 2 * 3 * 3 * 3 * 3 * 5 * 5\n // 75 = 3 * 5 * 5, 5 * 15, 25 * 3, 75\n N = nextInt();\n int[] primeFactor = new int[101];\n\n int sum = 1;\n for(int i = 1;i <= N;i++) {\n sum *= i;\n\n for(int j = 2;j * j <= sum;j++) {\n while(sum % j == 0) {\n primeFactor[j]++;\n sum /= j;\n }\n }\n\n if (sum > 1) {\n primeFactor[sum]++;\n sum = 1;\n }\n }\n\n int ans = 0;\n for(int i = 1;i <= 98;i++) {\n for(int j = i + 1; j <= 99;j++) {\n for(int k = j + 1;k <= 100;k++) {\n if (primeFactor[i] >= 2 && primeFactor[j] >= 4 && primeFactor[k] >= 4) {\n ans++;\n }\n\n if (primeFactor[j] >= 2 && primeFactor[i] >= 4 && primeFactor[k] >= 4) {\n ans++;\n }\n\n if (primeFactor[k] >= 2 && primeFactor[i] >= 4 && primeFactor[j] >= 4) {\n ans++;\n }\n }\n }\n }\n\n for(int i = 1;i <= 99;i++) {\n for(int j = i + 1;j <= 100;j++) {\n if (primeFactor[i] >= 14 && primeFactor[j] >= 4) {\n ans++;\n }\n\n if (primeFactor[j] >= 15 && primeFactor[i] >= 4) {\n ans++;\n }\n\n if (primeFactor[i] >= 24 && primeFactor[j] >= 2) {\n ans++;\n }\n\n if (primeFactor[j] >= 24 && primeFactor[i] >= 2) {\n ans++;\n }\n }\n }\n\n for(int i = 1;i <= 100;i++) {\n if (primeFactor[i] >= 74) {\n ans++;\n }\n }\n\n out.println(ans);\n }\n\n public static void main(String[] args) {\n out.flush();\n new Main().solve();\n out.close();\n }\n\n /* Input */\n private static final InputStream in = System.in;\n private static final PrintWriter out = new PrintWriter(System.out);\n private final byte[] buffer = new byte[4096];\n private int p = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (p < buflen)\n return true;\n p = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0)\n return false;\n return true;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrint(buffer[p])) {\n p++;\n }\n return hasNextByte();\n }\n\n private boolean isPrint(int ch) {\n if (ch >= '!' && ch <= '~')\n return true;\n return false;\n }\n\n private int nextByte() {\n if (!hasNextByte())\n return -1;\n return buffer[p++];\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = -1;\n while (isPrint((b = nextByte()))) {\n sb.appendCodePoint(b);\n }\n return sb.toString();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "language": "Java", "metadata": {"date": 1544589406, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03213.html", "problem_id": "p03213", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03213/input.txt", "sample_output_relpath": "derived/input_output/data/p03213/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03213/Java/s385549394.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s385549394", "user_id": "u516438812"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\n\npublic class Main {\n\n int N;\n\n private void solve() {\n // 36400 = 2 * 2 * 2 * 2 * 3 * 3 * 3 * 3 * 5 * 5\n // 75 = 3 * 5 * 5, 5 * 15, 25 * 3, 75\n N = nextInt();\n int[] primeFactor = new int[101];\n\n int sum = 1;\n for(int i = 1;i <= N;i++) {\n sum *= i;\n\n for(int j = 2;j * j <= sum;j++) {\n while(sum % j == 0) {\n primeFactor[j]++;\n sum /= j;\n }\n }\n\n if (sum > 1) {\n primeFactor[sum]++;\n sum = 1;\n }\n }\n\n int ans = 0;\n for(int i = 1;i <= 98;i++) {\n for(int j = i + 1; j <= 99;j++) {\n for(int k = j + 1;k <= 100;k++) {\n if (primeFactor[i] >= 2 && primeFactor[j] >= 4 && primeFactor[k] >= 4) {\n ans++;\n }\n\n if (primeFactor[j] >= 2 && primeFactor[i] >= 4 && primeFactor[k] >= 4) {\n ans++;\n }\n\n if (primeFactor[k] >= 2 && primeFactor[i] >= 4 && primeFactor[j] >= 4) {\n ans++;\n }\n }\n }\n }\n\n for(int i = 1;i <= 99;i++) {\n for(int j = i + 1;j <= 100;j++) {\n if (primeFactor[i] >= 14 && primeFactor[j] >= 4) {\n ans++;\n }\n\n if (primeFactor[j] >= 15 && primeFactor[i] >= 4) {\n ans++;\n }\n\n if (primeFactor[i] >= 24 && primeFactor[j] >= 2) {\n ans++;\n }\n\n if (primeFactor[j] >= 24 && primeFactor[i] >= 2) {\n ans++;\n }\n }\n }\n\n for(int i = 1;i <= 100;i++) {\n if (primeFactor[i] >= 74) {\n ans++;\n }\n }\n\n out.println(ans);\n }\n\n public static void main(String[] args) {\n out.flush();\n new Main().solve();\n out.close();\n }\n\n /* Input */\n private static final InputStream in = System.in;\n private static final PrintWriter out = new PrintWriter(System.out);\n private final byte[] buffer = new byte[4096];\n private int p = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (p < buflen)\n return true;\n p = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0)\n return false;\n return true;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrint(buffer[p])) {\n p++;\n }\n return hasNextByte();\n }\n\n private boolean isPrint(int ch) {\n if (ch >= '!' && ch <= '~')\n return true;\n return false;\n }\n\n private int nextByte() {\n if (!hasNextByte())\n return -1;\n return buffer[p++];\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = -1;\n while (isPrint((b = nextByte()))) {\n sb.appendCodePoint(b);\n }\n return sb.toString();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an integer N. Among the divisors of N! (= 1 \\times 2 \\times ... \\times N), how many Shichi-Go numbers (literally \"Seven-Five numbers\") are there?\n\nHere, a Shichi-Go number is a positive integer that has exactly 75 divisors.\n\nNote\n\nWhen a positive integer A divides a positive integer B, A is said to a divisor of B.\nFor example, 6 has four divisors: 1, 2, 3 and 6.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go numbers that are divisors of N!.\n\nSample Input 1\n\n9\n\nSample Output 1\n\n0\n\nThere are no Shichi-Go numbers among the divisors of 9! = 1 \\times 2 \\times ... \\times 9 = 362880.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1\n\nThere is one Shichi-Go number among the divisors of 10! = 3628800: 32400.\n\nSample Input 3\n\n100\n\nSample Output 3\n\n543", "sample_input": "9\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03213", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given an integer N. Among the divisors of N! (= 1 \\times 2 \\times ... \\times N), how many Shichi-Go numbers (literally \"Seven-Five numbers\") are there?\n\nHere, a Shichi-Go number is a positive integer that has exactly 75 divisors.\n\nNote\n\nWhen a positive integer A divides a positive integer B, A is said to a divisor of B.\nFor example, 6 has four divisors: 1, 2, 3 and 6.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go numbers that are divisors of N!.\n\nSample Input 1\n\n9\n\nSample Output 1\n\n0\n\nThere are no Shichi-Go numbers among the divisors of 9! = 1 \\times 2 \\times ... \\times 9 = 362880.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1\n\nThere is one Shichi-Go number among the divisors of 10! = 3628800: 32400.\n\nSample Input 3\n\n100\n\nSample Output 3\n\n543", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3661, "cpu_time_ms": 88, "memory_kb": 22356}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s822931456", "group_id": "codeNet:p03219", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc=new Scanner(System.in);\n int train=sc.nextInt();\n int bus=sc.nextInt();\n int sum=train+bus/2;\n System.out.println(sum);\n }\n}\n", "language": "Java", "metadata": {"date": 1541801224, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03219.html", "problem_id": "p03219", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03219/input.txt", "sample_output_relpath": "derived/input_output/data/p03219/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03219/Java/s822931456.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s822931456", "user_id": "u526294784"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc=new Scanner(System.in);\n int train=sc.nextInt();\n int bus=sc.nextInt();\n int sum=train+bus/2;\n System.out.println(sum);\n }\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a train going from Station A to Station B that costs X yen (the currency of Japan).\n\nAlso, there is a bus going from Station B to Station C that costs Y yen.\n\nJoisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.\n\nHow much does it cost to travel from Station A to Station C if she uses this ticket?\n\nConstraints\n\n1 \\leq X,Y \\leq 100\n\nY is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf it costs x yen to travel from Station A to Station C, print x.\n\nSample Input 1\n\n81 58\n\nSample Output 1\n\n110\n\nThe train fare is 81 yen.\n\nThe train fare is 58 ⁄ 2=29 yen with the 50% discount.\n\nThus, it costs 110 yen to travel from Station A to Station C.\n\nSample Input 2\n\n4 54\n\nSample Output 2\n\n31", "sample_input": "81 58\n"}, "reference_outputs": ["110\n"], "source_document_id": "p03219", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a train going from Station A to Station B that costs X yen (the currency of Japan).\n\nAlso, there is a bus going from Station B to Station C that costs Y yen.\n\nJoisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.\n\nHow much does it cost to travel from Station A to Station C if she uses this ticket?\n\nConstraints\n\n1 \\leq X,Y \\leq 100\n\nY is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf it costs x yen to travel from Station A to Station C, print x.\n\nSample Input 1\n\n81 58\n\nSample Output 1\n\n110\n\nThe train fare is 81 yen.\n\nThe train fare is 58 ⁄ 2=29 yen with the 50% discount.\n\nThus, it costs 110 yen to travel from Station A to Station C.\n\nSample Input 2\n\n4 54\n\nSample Output 2\n\n31", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 305, "cpu_time_ms": 100, "memory_kb": 22868}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s593704619", "group_id": "codeNet:p03220", "input_text": "\nimport java.util.ArrayList;\nimport java.util.Collection;\nimport java.util.Collections;\nimport java.util.Scanner;\n\nclass Main {\n\n static final int MOD = 1000000007;\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int T = sc.nextInt();\n int A = sc.nextInt();\n double[] hei = new double[N];\n int sum = 0;\n for (int i = 0; i < N; i++) {\n hei[i] = Math.abs(A-(T-sc.nextInt()*0.006));\n }\n double min = Double.MAX_VALUE;\n int c = -1;\n for (int i = 0; i < N; i++) {\n if(min>hei[i]){\n min=hei[i];\n c=i;\n }\n }\n System.out.println(c+1);\n \n }\n}", "language": "Java", "metadata": {"date": 1567199875, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03220.html", "problem_id": "p03220", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03220/input.txt", "sample_output_relpath": "derived/input_output/data/p03220/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03220/Java/s593704619.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s593704619", "user_id": "u572483595"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "\nimport java.util.ArrayList;\nimport java.util.Collection;\nimport java.util.Collections;\nimport java.util.Scanner;\n\nclass Main {\n\n static final int MOD = 1000000007;\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int T = sc.nextInt();\n int A = sc.nextInt();\n double[] hei = new double[N];\n int sum = 0;\n for (int i = 0; i < N; i++) {\n hei[i] = Math.abs(A-(T-sc.nextInt()*0.006));\n }\n double min = Double.MAX_VALUE;\n int c = -1;\n for (int i = 0; i < N; i++) {\n if(min>hei[i]){\n min=hei[i];\n c=i;\n }\n }\n System.out.println(c+1);\n \n }\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nA country decides to build a palace.\n\nIn this country, the average temperature of a point at an elevation of x meters is T-x \\times 0.006 degrees Celsius.\n\nThere are N places proposed for the place. The elevation of Place i is H_i meters.\n\nAmong them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.\n\nPrint the index of the place where the palace should be built.\n\nIt is guaranteed that the solution is unique.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq T \\leq 50\n\n-60 \\leq A \\leq T\n\n0 \\leq H_i \\leq 10^5\n\nAll values in input are integers.\n\nThe solution is unique.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT A\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the index of the place where the palace should be built.\n\nSample Input 1\n\n2\n12 5\n1000 2000\n\nSample Output 1\n\n1\n\nThe average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n\nThe average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\nSample Input 2\n\n3\n21 -11\n81234 94124 52141\n\nSample Output 2\n\n3", "sample_input": "2\n12 5\n1000 2000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03220", "source_text": "Score: 200 points\n\nProblem Statement\n\nA country decides to build a palace.\n\nIn this country, the average temperature of a point at an elevation of x meters is T-x \\times 0.006 degrees Celsius.\n\nThere are N places proposed for the place. The elevation of Place i is H_i meters.\n\nAmong them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.\n\nPrint the index of the place where the palace should be built.\n\nIt is guaranteed that the solution is unique.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq T \\leq 50\n\n-60 \\leq A \\leq T\n\n0 \\leq H_i \\leq 10^5\n\nAll values in input are integers.\n\nThe solution is unique.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT A\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the index of the place where the palace should be built.\n\nSample Input 1\n\n2\n12 5\n1000 2000\n\nSample Output 1\n\n1\n\nThe average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n\nThe average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\nSample Input 2\n\n3\n21 -11\n81234 94124 52141\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 760, "cpu_time_ms": 135, "memory_kb": 22356}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s843916921", "group_id": "codeNet:p03220", "input_text": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint t = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tint min = 0;\n\t\tint min_value = Integer.MAX_VALUE;\n\t\tfor (int i = 0 ; i < n; i++) {\n\t\t\tint tmp = sc.nextInt();\n\t\t\tif (tmp < min_value) {\n\t\t\t\tmin_value = tmp;\n\t\t\t\tmin = i + 1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n\t\n}", "language": "Java", "metadata": {"date": 1545574872, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03220.html", "problem_id": "p03220", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03220/input.txt", "sample_output_relpath": "derived/input_output/data/p03220/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03220/Java/s843916921.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s843916921", "user_id": "u575909439"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint t = sc.nextInt();\n\t\tint a = sc.nextInt();\n\t\tint min = 0;\n\t\tint min_value = Integer.MAX_VALUE;\n\t\tfor (int i = 0 ; i < n; i++) {\n\t\t\tint tmp = sc.nextInt();\n\t\t\tif (tmp < min_value) {\n\t\t\t\tmin_value = tmp;\n\t\t\t\tmin = i + 1;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n\t\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nA country decides to build a palace.\n\nIn this country, the average temperature of a point at an elevation of x meters is T-x \\times 0.006 degrees Celsius.\n\nThere are N places proposed for the place. The elevation of Place i is H_i meters.\n\nAmong them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.\n\nPrint the index of the place where the palace should be built.\n\nIt is guaranteed that the solution is unique.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq T \\leq 50\n\n-60 \\leq A \\leq T\n\n0 \\leq H_i \\leq 10^5\n\nAll values in input are integers.\n\nThe solution is unique.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT A\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the index of the place where the palace should be built.\n\nSample Input 1\n\n2\n12 5\n1000 2000\n\nSample Output 1\n\n1\n\nThe average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n\nThe average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\nSample Input 2\n\n3\n21 -11\n81234 94124 52141\n\nSample Output 2\n\n3", "sample_input": "2\n12 5\n1000 2000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03220", "source_text": "Score: 200 points\n\nProblem Statement\n\nA country decides to build a palace.\n\nIn this country, the average temperature of a point at an elevation of x meters is T-x \\times 0.006 degrees Celsius.\n\nThere are N places proposed for the place. The elevation of Place i is H_i meters.\n\nAmong them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.\n\nPrint the index of the place where the palace should be built.\n\nIt is guaranteed that the solution is unique.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq T \\leq 50\n\n-60 \\leq A \\leq T\n\n0 \\leq H_i \\leq 10^5\n\nAll values in input are integers.\n\nThe solution is unique.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT A\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the index of the place where the palace should be built.\n\nSample Input 1\n\n2\n12 5\n1000 2000\n\nSample Output 1\n\n1\n\nThe average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n\nThe average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\nSample Input 2\n\n3\n21 -11\n81234 94124 52141\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 412, "cpu_time_ms": 139, "memory_kb": 24276}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s360329944", "group_id": "codeNet:p03220", "input_text": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] argv){\n\t\tScanner scan = new Scanner(System.in);\n\t\tpalace(scan);\n\t}\n\tpublic static void palace(Scanner scan){\n\t\t//入力値の中で，最もAに近いもののインデックスを出力\n\t\tint N = scan.nextInt(); \n\t\tint T = scan.nextInt(); int A = scan.nextInt();\n\t\tint in = scan.nextInt();\n\t\tint index = 1;\n\t\tdouble min = Math.abs(A-T+0.006*in);\n\t\tfor(int i=2;i<=N;i++){\n\t\t\tin = scan.nextInt();\n\t\t\tdouble dif = Math.abs(A-T+0.006*in);\n\t\t\tif(min>dif){\n\t\t\t\tmin = dif;\n\t\t\t\tindex = i;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(index);\n\t}\n}", "language": "Java", "metadata": {"date": 1541716292, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03220.html", "problem_id": "p03220", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03220/input.txt", "sample_output_relpath": "derived/input_output/data/p03220/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03220/Java/s360329944.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s360329944", "user_id": "u526194743"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] argv){\n\t\tScanner scan = new Scanner(System.in);\n\t\tpalace(scan);\n\t}\n\tpublic static void palace(Scanner scan){\n\t\t//入力値の中で，最もAに近いもののインデックスを出力\n\t\tint N = scan.nextInt(); \n\t\tint T = scan.nextInt(); int A = scan.nextInt();\n\t\tint in = scan.nextInt();\n\t\tint index = 1;\n\t\tdouble min = Math.abs(A-T+0.006*in);\n\t\tfor(int i=2;i<=N;i++){\n\t\t\tin = scan.nextInt();\n\t\t\tdouble dif = Math.abs(A-T+0.006*in);\n\t\t\tif(min>dif){\n\t\t\t\tmin = dif;\n\t\t\t\tindex = i;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(index);\n\t}\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nA country decides to build a palace.\n\nIn this country, the average temperature of a point at an elevation of x meters is T-x \\times 0.006 degrees Celsius.\n\nThere are N places proposed for the place. The elevation of Place i is H_i meters.\n\nAmong them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.\n\nPrint the index of the place where the palace should be built.\n\nIt is guaranteed that the solution is unique.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq T \\leq 50\n\n-60 \\leq A \\leq T\n\n0 \\leq H_i \\leq 10^5\n\nAll values in input are integers.\n\nThe solution is unique.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT A\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the index of the place where the palace should be built.\n\nSample Input 1\n\n2\n12 5\n1000 2000\n\nSample Output 1\n\n1\n\nThe average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n\nThe average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\nSample Input 2\n\n3\n21 -11\n81234 94124 52141\n\nSample Output 2\n\n3", "sample_input": "2\n12 5\n1000 2000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03220", "source_text": "Score: 200 points\n\nProblem Statement\n\nA country decides to build a palace.\n\nIn this country, the average temperature of a point at an elevation of x meters is T-x \\times 0.006 degrees Celsius.\n\nThere are N places proposed for the place. The elevation of Place i is H_i meters.\n\nAmong them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.\n\nPrint the index of the place where the palace should be built.\n\nIt is guaranteed that the solution is unique.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq T \\leq 50\n\n-60 \\leq A \\leq T\n\n0 \\leq H_i \\leq 10^5\n\nAll values in input are integers.\n\nThe solution is unique.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT A\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the index of the place where the palace should be built.\n\nSample Input 1\n\n2\n12 5\n1000 2000\n\nSample Output 1\n\n1\n\nThe average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n\nThe average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\nSample Input 2\n\n3\n21 -11\n81234 94124 52141\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 603, "cpu_time_ms": 136, "memory_kb": 22228}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s464952990", "group_id": "codeNet:p03221", "input_text": "\n\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.TreeMap;\n\npublic class Main {\n\t\n\tpublic static void main(String args[])throws Exception{\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint M = sc.nextInt();\n\t\tint [] City1=new int[M];\n\t\tint [] City2=new int[M];\n\t\tint []tag = new int[N];\n\t\n\t\t\n\t\tMap map = new TreeMap<>();\n\t\n\t\tfor(int i=0;i map = new TreeMap<>();\n\t\n\t\tfor(int i=0;i {\n int index;\n int prefecture;\n int year;\n String id;\n\n public ID(int index, int prefecture, int year) {\n this.index = index;\n this.prefecture = prefecture;\n this.year = year;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n ID id1 = (ID) o;\n return index == id1.index &&\n prefecture == id1.prefecture &&\n year == id1.year &&\n Objects.equals(id, id1.id);\n }\n\n @Override\n public int hashCode() {\n return Objects.hash(index, prefecture, year, id);\n }\n\n @Override\n public int compareTo(ID o) {\n return this.year - o.year;\n }\n }\n\n private void solve(InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n ArrayList list = new ArrayList<>();\n int arr[] = new int[n + 1];\n for (int i = 0; i < m; i++) {\n int index = in.nextInt();\n list.add(new ID(i, index, in.nextInt()));\n arr[index]++;\n }\n int[] tmp = new int[n + 1];\n if (n + 1 >= 0) System.arraycopy(arr, 0, tmp, 0, n + 1);\n Collections.sort(list);\n for (int i = 0; i < m; i++) {\n list.get(i).id = String.valueOf(arr[list.get(i).prefecture] + 1 - tmp[list.get(i).prefecture]--);\n }\n list.sort(Comparator.comparingInt(a -> a.index));\n for (int i = 0; i < m; i++) {\n StringBuilder val = new StringBuilder(String.valueOf(list.get(i).prefecture));\n StringBuilder val2 = new StringBuilder(String.valueOf(list.get(i).id));\n int len = val.length();\n int len2 = val2.length();\n if (val.length() < 6) {\n for (int j = 0; j < 6 - len; j++) {\n val.insert(0, \"0\");\n }\n }\n if (val2.length() < 6) {\n for (int j = 0; j < 6 - len2; j++) {\n val2.insert(0, \"0\");\n }\n }\n out.println(val.toString() + val2.toString());\n }\n\n\n }\n\n\n public static void main(String[] args) throws FileNotFoundException {\n new Main().run();\n }\n\n private void run() throws FileNotFoundException {\n\n //new FileInputStream(new File(\"input.txt\"))\n //\n try (InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out)) {\n solve(in, out);\n }\n }\n\n\n static class InputReader implements AutoCloseable {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n @Override\n public void close() {\n }\n }\n\n}\n", "language": "Java", "metadata": {"date": 1541388646, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03221.html", "problem_id": "p03221", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03221/input.txt", "sample_output_relpath": "derived/input_output/data/p03221/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03221/Java/s314934973.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314934973", "user_id": "u992675902"}, "prompt_components": {"gold_output": "000001000002\n000002000001\n000001000001\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\n\npublic class Main {\n\n\n class ID implements Comparable {\n int index;\n int prefecture;\n int year;\n String id;\n\n public ID(int index, int prefecture, int year) {\n this.index = index;\n this.prefecture = prefecture;\n this.year = year;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n ID id1 = (ID) o;\n return index == id1.index &&\n prefecture == id1.prefecture &&\n year == id1.year &&\n Objects.equals(id, id1.id);\n }\n\n @Override\n public int hashCode() {\n return Objects.hash(index, prefecture, year, id);\n }\n\n @Override\n public int compareTo(ID o) {\n return this.year - o.year;\n }\n }\n\n private void solve(InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n ArrayList list = new ArrayList<>();\n int arr[] = new int[n + 1];\n for (int i = 0; i < m; i++) {\n int index = in.nextInt();\n list.add(new ID(i, index, in.nextInt()));\n arr[index]++;\n }\n int[] tmp = new int[n + 1];\n if (n + 1 >= 0) System.arraycopy(arr, 0, tmp, 0, n + 1);\n Collections.sort(list);\n for (int i = 0; i < m; i++) {\n list.get(i).id = String.valueOf(arr[list.get(i).prefecture] + 1 - tmp[list.get(i).prefecture]--);\n }\n list.sort(Comparator.comparingInt(a -> a.index));\n for (int i = 0; i < m; i++) {\n StringBuilder val = new StringBuilder(String.valueOf(list.get(i).prefecture));\n StringBuilder val2 = new StringBuilder(String.valueOf(list.get(i).id));\n int len = val.length();\n int len2 = val2.length();\n if (val.length() < 6) {\n for (int j = 0; j < 6 - len; j++) {\n val.insert(0, \"0\");\n }\n }\n if (val2.length() < 6) {\n for (int j = 0; j < 6 - len2; j++) {\n val2.insert(0, \"0\");\n }\n }\n out.println(val.toString() + val2.toString());\n }\n\n\n }\n\n\n public static void main(String[] args) throws FileNotFoundException {\n new Main().run();\n }\n\n private void run() throws FileNotFoundException {\n\n //new FileInputStream(new File(\"input.txt\"))\n //\n try (InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out)) {\n solve(in, out);\n }\n }\n\n\n static class InputReader implements AutoCloseable {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n @Override\n public void close() {\n }\n }\n\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.\n\nCity i is established in year Y_i and belongs to Prefecture P_i.\n\nYou can assume that there are no multiple cities that are established in the same year.\n\nIt is decided to allocate a 12-digit ID number to each city.\n\nIf City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.\n\nHere, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.\n\nFind the ID numbers for all the cities.\n\nNote that there can be a prefecture with no cities.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq P_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\nY_i are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nP_1 Y_1\n:\nP_M Y_M\n\nOutput\n\nPrint the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).\n\nSample Input 1\n\n2 3\n1 32\n2 63\n1 12\n\nSample Output 1\n\n000001000002\n000002000001\n000001000001\n\nAs City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.\n\nAs City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.\n\nAs City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.\n\nSample Input 2\n\n2 3\n2 55\n2 77\n2 99\n\nSample Output 2\n\n000002000001\n000002000002\n000002000003", "sample_input": "2 3\n1 32\n2 63\n1 12\n"}, "reference_outputs": ["000001000002\n000002000001\n000001000001\n"], "source_document_id": "p03221", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.\n\nCity i is established in year Y_i and belongs to Prefecture P_i.\n\nYou can assume that there are no multiple cities that are established in the same year.\n\nIt is decided to allocate a 12-digit ID number to each city.\n\nIf City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.\n\nHere, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.\n\nFind the ID numbers for all the cities.\n\nNote that there can be a prefecture with no cities.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq P_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\nY_i are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nP_1 Y_1\n:\nP_M Y_M\n\nOutput\n\nPrint the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).\n\nSample Input 1\n\n2 3\n1 32\n2 63\n1 12\n\nSample Output 1\n\n000001000002\n000002000001\n000001000001\n\nAs City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.\n\nAs City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.\n\nAs City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.\n\nSample Input 2\n\n2 3\n2 55\n2 77\n2 99\n\nSample Output 2\n\n000002000001\n000002000002\n000002000003", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3263, "cpu_time_ms": 768, "memory_kb": 73548}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s186892463", "group_id": "codeNet:p03231", "input_text": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tlong N = sc.nextInt();\n\t\tlong M = sc.nextInt();\n\t\tchar[] S = sc.next().toCharArray();\n\t\tchar[] T = sc.next().toCharArray();\n\t\tlong g = gcd(N,M);\n\t\tlong L = (N * M) / g;\n\t\tboolean flag = true;\n\n\t\tfor(long i = 0;i= seki)break;\n if(tt >= seki)break;\n\n }\n if(flag){\n System.out.println(seki); \n }else{\n System.out.println(-1);\n }\n \n\n }\n\n private static long lcm(long m, long n) {\n return m * n / gcd(m, n);\n }\n\n private static long gcd(long m, long n) {\n if (m < n)\n return gcd(n, m);\n if (n == 0)\n return m;\n return gcd(n, m % n);\n }\n}", "language": "Java", "metadata": {"date": 1539485949, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03231.html", "problem_id": "p03231", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03231/input.txt", "sample_output_relpath": "derived/input_output/data/p03231/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03231/Java/s984838272.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s984838272", "user_id": "u045712871"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n long n = sc.nextLong();\n long m = sc.nextLong();\n String s = sc.next();\n String t = sc.next();\n long seki = lcm(n, m);\n long NL = seki / n;\n long ML = seki / m;\n \n int sCount = 0;\n int tCount = 0;\n long ss = 0;\n long tt = 0;\n boolean flag = true;\n for(long i = 0;i < seki;i += Math.min(NL,ML)){\n if(ss == tt){\n if(s.charAt(sCount) != t.charAt(tCount)){\n flag = false;\n }\n sCount++;\n tCount++;\n ss += NL;\n tt += ML;\n }else if(ss < tt){\n sCount++;\n ss += NL;\n }else{\n tCount ++;\n tt += ML;\n }\n if(ss >= seki)break;\n if(tt >= seki)break;\n\n }\n if(flag){\n System.out.println(seki); \n }else{\n System.out.println(-1);\n }\n \n\n }\n\n private static long lcm(long m, long n) {\n return m * n / gcd(m, n);\n }\n\n private static long gcd(long m, long n) {\n if (m < n)\n return gcd(n, m);\n if (n == 0)\n return m;\n return gcd(n, m % n);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N and another string T of length M.\nThese strings consist of lowercase English letters.\n\nA string X is called a good string when the following conditions are all met:\n\nLet L be the length of X. L is divisible by both N and M.\n\nConcatenating the 1-st, (\\frac{L}{N}+1)-th, (2 \\times \\frac{L}{N}+1)-th, ..., ((N-1)\\times\\frac{L}{N}+1)-th characters of X, without changing the order, results in S.\n\nConcatenating the 1-st, (\\frac{L}{M}+1)-th, (2 \\times \\frac{L}{M}+1)-th, ..., ((M-1)\\times\\frac{L}{M}+1)-th characters of X, without changing the order, results in T.\n\nDetermine if there exists a good string. If it exists, find the length of the shortest such string.\n\nConstraints\n\n1 \\leq N,M \\leq 10^5\n\nS and T consist of lowercase English letters.\n\n|S|=N\n\n|T|=M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS\nT\n\nOutput\n\nIf a good string does not exist, print -1; if it exists, print the length of the shortest such string.\n\nSample Input 1\n\n3 2\nacp\nae\n\nSample Output 1\n\n6\n\nFor example, the string accept is a good string.\nThere is no good string shorter than this, so the answer is 6.\n\nSample Input 2\n\n6 3\nabcdef\nabc\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n15 9\ndnsusrayukuaiia\ndujrunuma\n\nSample Output 3\n\n45", "sample_input": "3 2\nacp\nae\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03231", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N and another string T of length M.\nThese strings consist of lowercase English letters.\n\nA string X is called a good string when the following conditions are all met:\n\nLet L be the length of X. L is divisible by both N and M.\n\nConcatenating the 1-st, (\\frac{L}{N}+1)-th, (2 \\times \\frac{L}{N}+1)-th, ..., ((N-1)\\times\\frac{L}{N}+1)-th characters of X, without changing the order, results in S.\n\nConcatenating the 1-st, (\\frac{L}{M}+1)-th, (2 \\times \\frac{L}{M}+1)-th, ..., ((M-1)\\times\\frac{L}{M}+1)-th characters of X, without changing the order, results in T.\n\nDetermine if there exists a good string. If it exists, find the length of the shortest such string.\n\nConstraints\n\n1 \\leq N,M \\leq 10^5\n\nS and T consist of lowercase English letters.\n\n|S|=N\n\n|T|=M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS\nT\n\nOutput\n\nIf a good string does not exist, print -1; if it exists, print the length of the shortest such string.\n\nSample Input 1\n\n3 2\nacp\nae\n\nSample Output 1\n\n6\n\nFor example, the string accept is a good string.\nThere is no good string shorter than this, so the answer is 6.\n\nSample Input 2\n\n6 3\nabcdef\nabc\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n15 9\ndnsusrayukuaiia\ndujrunuma\n\nSample Output 3\n\n45", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1416, "cpu_time_ms": 175, "memory_kb": 26488}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s258781498", "group_id": "codeNet:p03238", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n if (sc.nextInt() == 1) {\n System.out.println(\"Hello World\");\n } else {\n System.out.println(sc.nextInt() + sc.nextInt());\n }\n sc.close();\n }\n}", "language": "Java", "metadata": {"date": 1538874410, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03238.html", "problem_id": "p03238", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03238/input.txt", "sample_output_relpath": "derived/input_output/data/p03238/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03238/Java/s258781498.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s258781498", "user_id": "u684839413"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n if (sc.nextInt() == 1) {\n System.out.println(\"Hello World\");\n } else {\n System.out.println(sc.nextInt() + sc.nextInt());\n }\n sc.close();\n }\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "sample_input": "1\n"}, "reference_outputs": ["Hello World\n"], "source_document_id": "p03238", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 333, "cpu_time_ms": 110, "memory_kb": 22868}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s893196831", "group_id": "codeNet:p03239", "input_text": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int t = sc.nextInt();\n int cost = sc.nextInt();\n int time = sc.nextInt();\n for(int i=0; i t)\n System.out.println(\"TLE\");\n else\n System.out.println(cost);\n }\n}", "language": "Java", "metadata": {"date": 1538874878, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03239.html", "problem_id": "p03239", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03239/input.txt", "sample_output_relpath": "derived/input_output/data/p03239/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03239/Java/s893196831.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s893196831", "user_id": "u980960666"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int t = sc.nextInt();\n int cost = sc.nextInt();\n int time = sc.nextInt();\n for(int i=0; i t)\n System.out.println(\"TLE\");\n else\n System.out.println(cost);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "sample_input": "3 70\n7 60\n1 80\n4 50\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03239", "source_text": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 492, "cpu_time_ms": 107, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s813190647", "group_id": "codeNet:p03242", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.nextLine();\n\t\tString t = \"\";\n\t\tfor (int i = 0; i < s.length(); i++) {\n\t\t\tchar c = s.charAt(i);\n\t\t\tif (c == '1') {\n\t\t\t\tt += \"9\";\n\t\t\t}\n\t\t\tif (c == '9') {\n\t\t\t\tt += \"1\";\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(t);\n\t}\n}", "language": "Java", "metadata": {"date": 1538269422, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03242.html", "problem_id": "p03242", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03242/input.txt", "sample_output_relpath": "derived/input_output/data/p03242/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03242/Java/s813190647.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s813190647", "user_id": "u752146501"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.nextLine();\n\t\tString t = \"\";\n\t\tfor (int i = 0; i < s.length(); i++) {\n\t\t\tchar c = s.charAt(i);\n\t\t\tif (c == '1') {\n\t\t\t\tt += \"9\";\n\t\t\t}\n\t\t\tif (c == '9') {\n\t\t\t\tt += \"1\";\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(t);\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "sample_input": "119\n"}, "reference_outputs": ["991\n"], "source_document_id": "p03242", "source_text": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 349, "cpu_time_ms": 126, "memory_kb": 22608}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s382307495", "group_id": "codeNet:p03243", "input_text": "import java.util.Scanner;\n\npublic class Main implements Runnable {\n\n private static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n new Thread(null, new Main(), \"\", 128 * 1024 * 1024).start();\n }\n\n public void run() {\n int n = sc.nextInt();\n while (true) {\n String s = String.valueOf(n);\n char c = s.charAt(0);\n boolean f = true;\n for (int i = 1; i < s.length(); i++) {\n if (c != s.charAt(i)) {\n f = false;\n break;\n }\n }\n if(f){\n break;\n }\n n++;\n }\n System.out.println(n);\n }\n}", "language": "Java", "metadata": {"date": 1538269637, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03243.html", "problem_id": "p03243", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03243/input.txt", "sample_output_relpath": "derived/input_output/data/p03243/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03243/Java/s382307495.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s382307495", "user_id": "u389831705"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main implements Runnable {\n\n private static Scanner sc = new Scanner(System.in);\n\n public static void main(String[] args) {\n new Thread(null, new Main(), \"\", 128 * 1024 * 1024).start();\n }\n\n public void run() {\n int n = sc.nextInt();\n while (true) {\n String s = String.valueOf(n);\n char c = s.charAt(0);\n boolean f = true;\n for (int i = 1; i < s.length(); i++) {\n if (c != s.charAt(i)) {\n f = false;\n break;\n }\n }\n if(f){\n break;\n }\n n++;\n }\n System.out.println(n);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "sample_input": "111\n"}, "reference_outputs": ["111\n"], "source_document_id": "p03243", "source_text": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 731, "cpu_time_ms": 96, "memory_kb": 23892}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s448454624", "group_id": "codeNet:p03244", "input_text": "import java.util.*;\n \npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = Integer.parseInt(sc.next());\n int[] v = new int[n];\n Map ki = new HashMap<>();\n Map gu = new HashMap<>();\n for(int i=0; i ki = new HashMap<>();\n Map gu = new HashMap<>();\n for(int i=0; i count1[i]))\n .orElse(0);\n int max2 = IntStream.range(0, 100001)\n .boxed()\n .max(Comparator.comparingInt(i -> count2[i]))\n .orElse(0);\n if (max1 == max2) {\n int next1 = IntStream.range(0, 100001)\n .filter(i -> i != max1)\n .boxed()\n .max(Comparator.comparingInt(i -> count1[i]))\n .orElse(0);\n int next2 = IntStream.range(0, 100001)\n .filter(i -> i != max2)\n .boxed()\n .max(Comparator.comparingInt(i -> count2[i]))\n .orElse(0);\n System.out.println(n - Math.max(count1[next1] + count2[max2], count1[max1] + count2[next2]));\n } else {\n System.out.println(n - count1[max1] - count2[max2]);\n }\n }\n}", "language": "Java", "metadata": {"date": 1552888357, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03244.html", "problem_id": "p03244", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03244/input.txt", "sample_output_relpath": "derived/input_output/data/p03244/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03244/Java/s852007121.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s852007121", "user_id": "u981808900"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Comparator;\nimport java.util.stream.IntStream;\n\npublic class Main {\n private static java.util.Scanner scanner = new java.util.Scanner(System.in);\n\n public static void main(String[] args) {\n int n = scanner.nextInt();\n int[] u1 = new int[n / 2], u2 = new int[n / 2], count1 = new int[100001], count2 = new int[100001];\n for (int i = 0; i < n / 2; i++) {\n count1[u1[i] = scanner.nextInt()]++;\n count2[u2[i] = scanner.nextInt()]++;\n }\n\n int max1 = IntStream.range(0, 100001)\n .boxed()\n .max(Comparator.comparingInt(i -> count1[i]))\n .orElse(0);\n int max2 = IntStream.range(0, 100001)\n .boxed()\n .max(Comparator.comparingInt(i -> count2[i]))\n .orElse(0);\n if (max1 == max2) {\n int next1 = IntStream.range(0, 100001)\n .filter(i -> i != max1)\n .boxed()\n .max(Comparator.comparingInt(i -> count1[i]))\n .orElse(0);\n int next2 = IntStream.range(0, 100001)\n .filter(i -> i != max2)\n .boxed()\n .max(Comparator.comparingInt(i -> count2[i]))\n .orElse(0);\n System.out.println(n - Math.max(count1[next1] + count2[max2], count1[max1] + count2[next2]));\n } else {\n System.out.println(n - count1[max1] - count2[max2]);\n }\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "sample_input": "4\n3 1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03244", "source_text": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1505, "cpu_time_ms": 629, "memory_kb": 62568}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s171798363", "group_id": "codeNet:p03254", "input_text": "import java.util.*;\nimport java.lang.*;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int x = sc.nextInt();\n int a[] = new int[n];\n for(int i = 0; i < n; i++){\n a[i] = sc.nextInt();\n }\n Arrays.sort(a);\n int sum = 0;\n int count = 0;\n for(int i = 0; i < n; i++){\n sum += a[i];\n if (sum > x) {\n break;\n }else{\n count++;\n }\n }\n if (count == n && sum != x) {\n System.out.println(count - 1);\n }else{\n System.out.println(count);\n }\n }\n}", "language": "Java", "metadata": {"date": 1537060911, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03254.html", "problem_id": "p03254", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03254/input.txt", "sample_output_relpath": "derived/input_output/data/p03254/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03254/Java/s171798363.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s171798363", "user_id": "u602865659"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\nimport java.lang.*;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int x = sc.nextInt();\n int a[] = new int[n];\n for(int i = 0; i < n; i++){\n a[i] = sc.nextInt();\n }\n Arrays.sort(a);\n int sum = 0;\n int count = 0;\n for(int i = 0; i < n; i++){\n sum += a[i];\n if (sum > x) {\n break;\n }else{\n count++;\n }\n }\n if (count == n && sum != x) {\n System.out.println(count - 1);\n }else{\n System.out.println(count);\n }\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "sample_input": "3 70\n20 30 10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03254", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 718, "cpu_time_ms": 114, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s357288073", "group_id": "codeNet:p03265", "input_text": "import java.io.*;\nimport java.util.*;\n\n\npublic class Main {\n\n class A {\n int a;\n int b;\n\n public A(int a, int b) {\n this.a = a;\n this.b = b;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n A a1 = (A) o;\n return a == a1.a &&\n b == a1.b;\n }\n\n @Override\n public int hashCode() {\n return Objects.hash(a, b);\n }\n }\n\n\n private void solve(InputReader in, PrintWriter out) {\n int x1 = in.nextInt();\n int y1 = in.nextInt();\n int x2 = in.nextInt();\n int y2 = in.nextInt();\n int x3 = x1 - (y2 - y1);\n int y3 = y1+(x2-x1);\n int x4 = x2 - (y2 - y1);\n int y4 = y2+(x2-x1);\n out.println(x4 + \" \" + y4 + \" \" + x3 + \" \" + y3);\n }\n\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n private void run() {\n try (\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out)) {\n solve(in, out);\n }\n }\n\n\n static class InputReader implements AutoCloseable {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n @Override\n public void close() {\n\n }\n }\n\n}\n", "language": "Java", "metadata": {"date": 1535853042, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03265.html", "problem_id": "p03265", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03265/input.txt", "sample_output_relpath": "derived/input_output/data/p03265/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03265/Java/s357288073.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357288073", "user_id": "u992675902"}, "prompt_components": {"gold_output": "-1 1 -1 0\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\n\npublic class Main {\n\n class A {\n int a;\n int b;\n\n public A(int a, int b) {\n this.a = a;\n this.b = b;\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n A a1 = (A) o;\n return a == a1.a &&\n b == a1.b;\n }\n\n @Override\n public int hashCode() {\n return Objects.hash(a, b);\n }\n }\n\n\n private void solve(InputReader in, PrintWriter out) {\n int x1 = in.nextInt();\n int y1 = in.nextInt();\n int x2 = in.nextInt();\n int y2 = in.nextInt();\n int x3 = x1 - (y2 - y1);\n int y3 = y1+(x2-x1);\n int x4 = x2 - (y2 - y1);\n int y4 = y2+(x2-x1);\n out.println(x4 + \" \" + y4 + \" \" + x3 + \" \" + y3);\n }\n\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n private void run() {\n try (\n InputReader in = new InputReader(System.in);\n PrintWriter out = new PrintWriter(System.out)) {\n solve(in, out);\n }\n }\n\n\n static class InputReader implements AutoCloseable {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n @Override\n public void close() {\n\n }\n }\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.\n(Assume that the positive x-axis points right, and the positive y-axis points up.)\n\nTakahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).\n\nGiven x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.\n\nConstraints\n\n|x_1|,|y_1|,|x_2|,|y_2| \\leq 100\n\n(x_1,y_1) ≠ (x_2,y_2)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\n\nOutput\n\nPrint x_3,y_3,x_4 and y_4 as integers, in this order.\n\nSample Input 1\n\n0 0 0 1\n\nSample Output 1\n\n-1 1 -1 0\n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.\nNote that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.\n\nSample Input 2\n\n2 3 6 6\n\nSample Output 2\n\n3 10 -1 7\n\nSample Input 3\n\n31 -41 -59 26\n\nSample Output 3\n\n-126 -64 -36 -131", "sample_input": "0 0 0 1\n"}, "reference_outputs": ["-1 1 -1 0\n"], "source_document_id": "p03265", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.\n(Assume that the positive x-axis points right, and the positive y-axis points up.)\n\nTakahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).\n\nGiven x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.\n\nConstraints\n\n|x_1|,|y_1|,|x_2|,|y_2| \\leq 100\n\n(x_1,y_1) ≠ (x_2,y_2)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\n\nOutput\n\nPrint x_3,y_3,x_4 and y_4 as integers, in this order.\n\nSample Input 1\n\n0 0 0 1\n\nSample Output 1\n\n-1 1 -1 0\n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.\nNote that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.\n\nSample Input 2\n\n2 3 6 6\n\nSample Output 2\n\n3 10 -1 7\n\nSample Input 3\n\n31 -41 -59 26\n\nSample Output 3\n\n-126 -64 -36 -131", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2256, "cpu_time_ms": 76, "memory_kb": 22868}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s933062266", "group_id": "codeNet:p03265", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint x1 = scan.nextInt();\n\t\tint y1 = scan.nextInt();\n\t\tint x2 = scan.nextInt();\n\t\tint y2 = scan.nextInt();\n\t\t\n\t\tint X = x2 - x1;\n\t\tint Y = y2 - y1;\n\t\t\n\t\tint x3 = x2 - Y;\n\t\tint y3 = y2 + X;\n\t\tint x4 = x3 - X;\n\t\tint y4 = y3 - Y;\n\t\t\n\t\tSystem.out.println(x3 + \" \" + y3 + \" \" + x4 + \" \" + y4);\n\t\t\n\t}\n}\n", "language": "Java", "metadata": {"date": 1535852966, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03265.html", "problem_id": "p03265", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03265/input.txt", "sample_output_relpath": "derived/input_output/data/p03265/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03265/Java/s933062266.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s933062266", "user_id": "u579298129"}, "prompt_components": {"gold_output": "-1 1 -1 0\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\t\n\t\tint x1 = scan.nextInt();\n\t\tint y1 = scan.nextInt();\n\t\tint x2 = scan.nextInt();\n\t\tint y2 = scan.nextInt();\n\t\t\n\t\tint X = x2 - x1;\n\t\tint Y = y2 - y1;\n\t\t\n\t\tint x3 = x2 - Y;\n\t\tint y3 = y2 + X;\n\t\tint x4 = x3 - X;\n\t\tint y4 = y3 - Y;\n\t\t\n\t\tSystem.out.println(x3 + \" \" + y3 + \" \" + x4 + \" \" + y4);\n\t\t\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.\n(Assume that the positive x-axis points right, and the positive y-axis points up.)\n\nTakahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).\n\nGiven x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.\n\nConstraints\n\n|x_1|,|y_1|,|x_2|,|y_2| \\leq 100\n\n(x_1,y_1) ≠ (x_2,y_2)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\n\nOutput\n\nPrint x_3,y_3,x_4 and y_4 as integers, in this order.\n\nSample Input 1\n\n0 0 0 1\n\nSample Output 1\n\n-1 1 -1 0\n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.\nNote that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.\n\nSample Input 2\n\n2 3 6 6\n\nSample Output 2\n\n3 10 -1 7\n\nSample Input 3\n\n31 -41 -59 26\n\nSample Output 3\n\n-126 -64 -36 -131", "sample_input": "0 0 0 1\n"}, "reference_outputs": ["-1 1 -1 0\n"], "source_document_id": "p03265", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.\n(Assume that the positive x-axis points right, and the positive y-axis points up.)\n\nTakahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).\n\nGiven x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.\n\nConstraints\n\n|x_1|,|y_1|,|x_2|,|y_2| \\leq 100\n\n(x_1,y_1) ≠ (x_2,y_2)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\n\nOutput\n\nPrint x_3,y_3,x_4 and y_4 as integers, in this order.\n\nSample Input 1\n\n0 0 0 1\n\nSample Output 1\n\n-1 1 -1 0\n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.\nNote that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.\n\nSample Input 2\n\n2 3 6 6\n\nSample Output 2\n\n3 10 -1 7\n\nSample Input 3\n\n31 -41 -59 26\n\nSample Output 3\n\n-126 -64 -36 -131", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 431, "cpu_time_ms": 94, "memory_kb": 23892}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s277276272", "group_id": "codeNet:p03266", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner((System.in));\n\t\tint n = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint ans = 0;\n\n\t\tfor (int x = 1; x <= n; x++) {\n\t\t\tfor (int y = 1; y <= n; y++) {\n\t\t\t\tfor (int z = 1; z <= n; z++) {\n\t\t\t\t\tif ((x + y) % k == 0 && (y + z) % k == 0 && (z + x) % k == 0) {\n\t\t\t\t\t\tans++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n}\n", "language": "Java", "metadata": {"date": 1561587795, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03266.html", "problem_id": "p03266", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03266/input.txt", "sample_output_relpath": "derived/input_output/data/p03266/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03266/Java/s277276272.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s277276272", "user_id": "u650591877"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner((System.in));\n\t\tint n = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint ans = 0;\n\n\t\tfor (int x = 1; x <= n; x++) {\n\t\t\tfor (int y = 1; y <= n; y++) {\n\t\t\t\tfor (int z = 1; z <= n; z++) {\n\t\t\t\t\tif ((x + y) % k == 0 && (y + z) % k == 0 && (z + x) % k == 0) {\n\t\t\t\t\t\tans++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\n\t\tsc.close();\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03266", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 448, "cpu_time_ms": 2108, "memory_kb": 22740}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s359016470", "group_id": "codeNet:p03266", "input_text": "import java.util.*;\nclass Main\n{\n public static void main (String[] args)\n {\n Scanner sc = new Scanner(System.in);\n\n int N = sc.nextInt();\n int K = sc.nextInt();\n\n int ans = 0;\n\n\n if( K > 2 * N){\n ans = 0;\n }\n else if (K > N){\n ans = 1;\n }\n /* if(K > N){\n if(K % 2 == 1){\n ans = 0;\n }\n else{\n K /= 2;\n if(K > N){\n ans = 0;\n }\n else{\n ans = (3 * N - 3 * K + 1) * (3 * N - 3 * K + 2) / 2;\n }\n }\n }*/\n else if(K % 2 == 0){\n K /= 2;\n int KK = N/K;\n ans += (int) Math.pow((KK/2), 3) + (int) Math.pow( ( ( KK + 1 ) / 2 ), 3);\n }\n else if(K % 2 == 1){\n ans += (int) Math.pow( (N/K) , 3);\n }\n System.out.println(ans);\n }\n}", "language": "Java", "metadata": {"date": 1535855423, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03266.html", "problem_id": "p03266", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03266/input.txt", "sample_output_relpath": "derived/input_output/data/p03266/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03266/Java/s359016470.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s359016470", "user_id": "u434662823"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*;\nclass Main\n{\n public static void main (String[] args)\n {\n Scanner sc = new Scanner(System.in);\n\n int N = sc.nextInt();\n int K = sc.nextInt();\n\n int ans = 0;\n\n\n if( K > 2 * N){\n ans = 0;\n }\n else if (K > N){\n ans = 1;\n }\n /* if(K > N){\n if(K % 2 == 1){\n ans = 0;\n }\n else{\n K /= 2;\n if(K > N){\n ans = 0;\n }\n else{\n ans = (3 * N - 3 * K + 1) * (3 * N - 3 * K + 2) / 2;\n }\n }\n }*/\n else if(K % 2 == 0){\n K /= 2;\n int KK = N/K;\n ans += (int) Math.pow((KK/2), 3) + (int) Math.pow( ( ( KK + 1 ) / 2 ), 3);\n }\n else if(K % 2 == 1){\n ans += (int) Math.pow( (N/K) , 3);\n }\n System.out.println(ans);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03266", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 965, "cpu_time_ms": 101, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s809447948", "group_id": "codeNet:p03268", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\t \n\tpublic static void main(String args[]) {\n\t\t Scanner scanner = new Scanner(System.in);\n\t\t \n\t\t //a+b,b+c,c+aがkの倍数ということはmodK=0となるということ。\n\t\t //とりあえずNとKを読み込む\n\t\t int N = scanner.nextInt();\n\t\t int K = scanner.nextInt();\n\t\t int n = N / K;\n\t\t int kotae = n*(n-1)*(n-2)\n\t\t\t\t\t+n*(n-1)*3\n\t\t\t\t\t+n;\n\t\t \n\t\t if( K % 2 != 0) \n\t\t {\n\t\t \tSystem.out.println(kotae);\n\t\t }\n\t\t else \n\t\t {\n\t\t \tif(N % K == 0) \n\t\t \t{\n\t\t \t\tSystem.out.println(kotae*2);\n\t\t \t}\n\t\t \telse {\n\t\t \t\tif( K / 2 <= N % K ) \n\t\t \t\t{\n\t\t \t\t\tint kotae2 = (n+1)*n*(n-1)+3*(n+1)*n+n+1;\n\t\t \t\t\tSystem.out.println(kotae+kotae2);\n\t\t \t\t}\n\t\t \t\telse \n\t\t \t\t{\n\t\t \t\tSystem.out.println(2*kotae);\n\t\t \t\t}\n\t\t \t}\n\t\t }\n\t\t \n\t\t scanner.close(); }\n\t\t }", "language": "Java", "metadata": {"date": 1535854453, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03268.html", "problem_id": "p03268", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03268/input.txt", "sample_output_relpath": "derived/input_output/data/p03268/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03268/Java/s809447948.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s809447948", "user_id": "u902576227"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\t \n\tpublic static void main(String args[]) {\n\t\t Scanner scanner = new Scanner(System.in);\n\t\t \n\t\t //a+b,b+c,c+aがkの倍数ということはmodK=0となるということ。\n\t\t //とりあえずNとKを読み込む\n\t\t int N = scanner.nextInt();\n\t\t int K = scanner.nextInt();\n\t\t int n = N / K;\n\t\t int kotae = n*(n-1)*(n-2)\n\t\t\t\t\t+n*(n-1)*3\n\t\t\t\t\t+n;\n\t\t \n\t\t if( K % 2 != 0) \n\t\t {\n\t\t \tSystem.out.println(kotae);\n\t\t }\n\t\t else \n\t\t {\n\t\t \tif(N % K == 0) \n\t\t \t{\n\t\t \t\tSystem.out.println(kotae*2);\n\t\t \t}\n\t\t \telse {\n\t\t \t\tif( K / 2 <= N % K ) \n\t\t \t\t{\n\t\t \t\t\tint kotae2 = (n+1)*n*(n-1)+3*(n+1)*n+n+1;\n\t\t \t\t\tSystem.out.println(kotae+kotae2);\n\t\t \t\t}\n\t\t \t\telse \n\t\t \t\t{\n\t\t \t\tSystem.out.println(2*kotae);\n\t\t \t\t}\n\t\t \t}\n\t\t }\n\t\t \n\t\t scanner.close(); }\n\t\t }", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03268", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 882, "cpu_time_ms": 113, "memory_kb": 22740}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s014492245", "group_id": "codeNet:p03272", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner scanner;\n\n\tpublic static void main(String[] args) {\n\t scanner = new Scanner(System.in);\n\n\t int n=gi();\n\t int k=gi();\n\t \n System.out.println(n-k+1);\n// if (n%k==0) {\n// \tSystem.out.print(0);\n// }else {\n// \tSystem.out.print(1);\n// }\n\n\n\t}\n\n\t// 文字列として入力を取得\n\tpublic static String gs() {\n\t\treturn scanner.next();\n\t}\n\n\t// intとして入力を取得\n\tpublic static int gi() {\n\t\treturn Integer.parseInt(scanner.next());\n\t}\n\n\t// longとして入力を取得\n\tpublic static long gl() {\n\t\treturn Long.parseLong(scanner.next());\n\t}\n\n\t// doubleとして入力を取得\n\tpublic static double gd() {\n\t\treturn Double.parseDouble(scanner.next());\n\t}\n}", "language": "Java", "metadata": {"date": 1593651203, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03272.html", "problem_id": "p03272", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03272/input.txt", "sample_output_relpath": "derived/input_output/data/p03272/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03272/Java/s014492245.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s014492245", "user_id": "u553314348"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tstatic Scanner scanner;\n\n\tpublic static void main(String[] args) {\n\t scanner = new Scanner(System.in);\n\n\t int n=gi();\n\t int k=gi();\n\t \n System.out.println(n-k+1);\n// if (n%k==0) {\n// \tSystem.out.print(0);\n// }else {\n// \tSystem.out.print(1);\n// }\n\n\n\t}\n\n\t// 文字列として入力を取得\n\tpublic static String gs() {\n\t\treturn scanner.next();\n\t}\n\n\t// intとして入力を取得\n\tpublic static int gi() {\n\t\treturn Integer.parseInt(scanner.next());\n\t}\n\n\t// longとして入力を取得\n\tpublic static long gl() {\n\t\treturn Long.parseLong(scanner.next());\n\t}\n\n\t// doubleとして入力を取得\n\tpublic static double gd() {\n\t\treturn Double.parseDouble(scanner.next());\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is an N-car train.\n\nYou are given an integer i. Find the value of j such that the following statement is true: \"the i-th car from the front of the train is the j-th car from the back.\"\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN i\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 2\n\nSample Output 1\n\n3\n\nThe second car from the front of a 4-car train is the third car from the back.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n15 11\n\nSample Output 3\n\n5", "sample_input": "4 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03272", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is an N-car train.\n\nYou are given an integer i. Find the value of j such that the following statement is true: \"the i-th car from the front of the train is the j-th car from the back.\"\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN i\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 2\n\nSample Output 1\n\n3\n\nThe second car from the front of a 4-car train is the third car from the back.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n15 11\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 774, "cpu_time_ms": 112, "memory_kb": 35604}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s209837393", "group_id": "codeNet:p03274", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tstatic int N, K, Z = 0, F = 0;\n\tstatic int ANSWER = Integer.MAX_VALUE;\n\tstatic int[] DATA;\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] lineArr = br.readLine().split(\" \");\n\t\tN = Integer.parseInt(lineArr[0]);\n\t\tK = Integer.parseInt(lineArr[1]);\n\n\t\tDATA = new int[N];\n\n\t\tlineArr = br.readLine().split(\" \");\n\n\t\tint tmp;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tDATA[i] = Integer.parseInt(lineArr[i]);\n\t\t\ttmp = Integer.parseInt(lineArr[i]);\n\n\t\t\tif (tmp < 0) {\n\t\t\t\tF++;\n\t\t\t} else if (tmp == 0) {\n\t\t\t\tZ++;\n\t\t\t}\n\n\t\t\tDATA[i] = tmp;\n\t\t}\n\n\t\tint start = 0;\n\t\tif (F > K) {\n\t\t\tstart = F - K + Z;\n\t\t}\n\n\t\tint startValue;\n\t\tint endValue;\n\t\tfor (int i = start; i < N - K + 1; i++) {\n\t\t\tstartValue = DATA[i];\n\t\t\tendValue = DATA[i + K - 1];\n\n\t\t\ttmp = endValue - startValue;\n\t\t\ttmp += Math.min(Math.abs(startValue), Math.abs(endValue));\n\n\t\t\tif (ANSWER > tmp) {\n\t\t\t\tANSWER = tmp;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ANSWER);\n\n\t}\n}", "language": "Java", "metadata": {"date": 1543948727, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03274.html", "problem_id": "p03274", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03274/input.txt", "sample_output_relpath": "derived/input_output/data/p03274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03274/Java/s209837393.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s209837393", "user_id": "u816631826"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tstatic int N, K, Z = 0, F = 0;\n\tstatic int ANSWER = Integer.MAX_VALUE;\n\tstatic int[] DATA;\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] lineArr = br.readLine().split(\" \");\n\t\tN = Integer.parseInt(lineArr[0]);\n\t\tK = Integer.parseInt(lineArr[1]);\n\n\t\tDATA = new int[N];\n\n\t\tlineArr = br.readLine().split(\" \");\n\n\t\tint tmp;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tDATA[i] = Integer.parseInt(lineArr[i]);\n\t\t\ttmp = Integer.parseInt(lineArr[i]);\n\n\t\t\tif (tmp < 0) {\n\t\t\t\tF++;\n\t\t\t} else if (tmp == 0) {\n\t\t\t\tZ++;\n\t\t\t}\n\n\t\t\tDATA[i] = tmp;\n\t\t}\n\n\t\tint start = 0;\n\t\tif (F > K) {\n\t\t\tstart = F - K + Z;\n\t\t}\n\n\t\tint startValue;\n\t\tint endValue;\n\t\tfor (int i = start; i < N - K + 1; i++) {\n\t\t\tstartValue = DATA[i];\n\t\t\tendValue = DATA[i + K - 1];\n\n\t\t\ttmp = endValue - startValue;\n\t\t\ttmp += Math.min(Math.abs(startValue), Math.abs(endValue));\n\n\t\t\tif (ANSWER > tmp) {\n\t\t\t\tANSWER = tmp;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ANSWER);\n\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "sample_input": "5 3\n-30 -10 10 20 50\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03274", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1088, "cpu_time_ms": 232, "memory_kb": 38868}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s463851346", "group_id": "codeNet:p03280", "input_text": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int a=sc.nextInt();\n int b=sc.nextInt();\n System.out.println((a-1)*(b-1));\n }\n}\n", "language": "Java", "metadata": {"date": 1585978642, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03280.html", "problem_id": "p03280", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03280/input.txt", "sample_output_relpath": "derived/input_output/data/p03280/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03280/Java/s463851346.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s463851346", "user_id": "u457499508"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args) {\n Scanner sc=new Scanner(System.in);\n int a=sc.nextInt();\n int b=sc.nextInt();\n System.out.println((a-1)*(b-1));\n }\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "sample_input": "2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03280", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 93, "memory_kb": 21076}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s031852981", "group_id": "codeNet:p03281", "input_text": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n \n if(n%2==0){\n System.out.println(0);\n return;\n }\n\tint ans = 0;\n int count = 0;\n for(int i = 1 ; i <= n ; ++i){ \n if(n%i==0){\n count++;\n }\n if(i == n){\n if(count == 8){\n ans++;\n count = 0;\n }else{\n count = 0;\n }\n }\n \n }\n \n System.out.println(ans);\n \n }\n}\n", "language": "Java", "metadata": {"date": 1596121052, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03281.html", "problem_id": "p03281", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03281/input.txt", "sample_output_relpath": "derived/input_output/data/p03281/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03281/Java/s031852981.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s031852981", "user_id": "u563673753"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n \n if(n%2==0){\n System.out.println(0);\n return;\n }\n\tint ans = 0;\n int count = 0;\n for(int i = 1 ; i <= n ; ++i){ \n if(n%i==0){\n count++;\n }\n if(i == n){\n if(count == 8){\n ans++;\n count = 0;\n }else{\n count = 0;\n }\n }\n \n }\n \n System.out.println(ans);\n \n }\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "sample_input": "105\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03281", "source_text": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 523, "cpu_time_ms": 121, "memory_kb": 35676}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s197034487", "group_id": "codeNet:p03281", "input_text": "import java.util.*;\n \nclass Main {\n\tpublic static void main (String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint N = scanner.nextInt();\n\t\tint count = 0;\n\t\t\n\t\t//Nまでの奇数をとる\n\t\tfor (int i = 1; i <= N; i+=2) {\n\t\t\t//divを初期化\n\t\t\tint div = 0;\n\t\t\t//約数の計算\n\t\t\tfor (int j = 1; j <= i; j++) {\n\t\t\t\tif(i%j == 0) {\n\t\t\t\t\tdiv++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//System.out.println(i + \"の約数 : \" + div + \"個\");\n\t\t\t\n\t\t\t//div==8のときのみ、countに追加\n\t\t\tif (div == 8) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}", "language": "Java", "metadata": {"date": 1538880661, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03281.html", "problem_id": "p03281", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03281/input.txt", "sample_output_relpath": "derived/input_output/data/p03281/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03281/Java/s197034487.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s197034487", "user_id": "u764060069"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n \nclass Main {\n\tpublic static void main (String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint N = scanner.nextInt();\n\t\tint count = 0;\n\t\t\n\t\t//Nまでの奇数をとる\n\t\tfor (int i = 1; i <= N; i+=2) {\n\t\t\t//divを初期化\n\t\t\tint div = 0;\n\t\t\t//約数の計算\n\t\t\tfor (int j = 1; j <= i; j++) {\n\t\t\t\tif(i%j == 0) {\n\t\t\t\t\tdiv++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//System.out.println(i + \"の約数 : \" + div + \"個\");\n\t\t\t\n\t\t\t//div==8のときのみ、countに追加\n\t\t\tif (div == 8) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "sample_input": "105\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03281", "source_text": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 550, "cpu_time_ms": 109, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s050688733", "group_id": "codeNet:p03282", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tchar[] S = sc.next().toCharArray();\n\t\tlong K = sc.nextLong();\n\t\tfor (int i = 0; i < S.length; i++) {\n\t\t\tif (S[i] != '1') {\n\t\t\t\tSystem.out.println(S[i]);\n\t\t\t\tbreak;\n\t\t\t}else {\n\t\t\t\tif (i == K) {\n\t\t\t\t\tSystem.out.println(S[i]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}\n}\n", "language": "Java", "metadata": {"date": 1599017391, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03282.html", "problem_id": "p03282", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03282/input.txt", "sample_output_relpath": "derived/input_output/data/p03282/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03282/Java/s050688733.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s050688733", "user_id": "u240515443"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tchar[] S = sc.next().toCharArray();\n\t\tlong K = sc.nextLong();\n\t\tfor (int i = 0; i < S.length; i++) {\n\t\t\tif (S[i] != '1') {\n\t\t\t\tSystem.out.println(S[i]);\n\t\t\t\tbreak;\n\t\t\t}else {\n\t\t\t\tif (i == K) {\n\t\t\t\t\tSystem.out.println(S[i]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "sample_input": "1214\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03282", "source_text": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 388, "cpu_time_ms": 121, "memory_kb": 35828}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s613615401", "group_id": "codeNet:p03282", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tMain mainObj = new Main();\n\t\tmainObj.solve();\n\t}\n\n\tpublic void solve() throws IOException {\n\t\tFastScanner fs = new FastScanner();\n\t\tString s = fs.next();\n\t\tlong k = fs.nextLong();\n\t\t\n\t\tfor(int i = 0; i < s.length(); i++) {\n\t\t\tif(s.charAt(i) != '1') {\n\t\t\t\tSystem.out.println(s.charAt(i));\n\t\t\t\treturn;\n\t\t\t}else {\n\t\t\t\tif(i == k-1) {\n\t\t\t\t\tSystem.out.println(1);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\n\n\tpublic class FastScanner {\n\n\t\tBufferedReader reader;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextIntArr(int n) throws NumberFormatException, IOException {\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic long[] nextLongArr(int n) throws NumberFormatException, IOException {\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\treader.close();\n\t\t}\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1587519205, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03282.html", "problem_id": "p03282", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03282/input.txt", "sample_output_relpath": "derived/input_output/data/p03282/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03282/Java/s613615401.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s613615401", "user_id": "u903557324"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\tMain mainObj = new Main();\n\t\tmainObj.solve();\n\t}\n\n\tpublic void solve() throws IOException {\n\t\tFastScanner fs = new FastScanner();\n\t\tString s = fs.next();\n\t\tlong k = fs.nextLong();\n\t\t\n\t\tfor(int i = 0; i < s.length(); i++) {\n\t\t\tif(s.charAt(i) != '1') {\n\t\t\t\tSystem.out.println(s.charAt(i));\n\t\t\t\treturn;\n\t\t\t}else {\n\t\t\t\tif(i == k-1) {\n\t\t\t\t\tSystem.out.println(1);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\n\n\tpublic class FastScanner {\n\n\t\tBufferedReader reader;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextIntArr(int n) throws NumberFormatException, IOException {\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic long[] nextLongArr(int n) throws NumberFormatException, IOException {\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\treader.close();\n\t\t}\n\t}\n\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "sample_input": "1214\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03282", "source_text": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1805, "cpu_time_ms": 70, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s770656474", "group_id": "codeNet:p03282", "input_text": "//https://atcoder.jp/contests/abc106/tasks/abc106_c\n\nimport java.io.*;\n\nclass Main{\n public static void main(String[] args) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n String S = br.readLine();\n String str = br.readLine();\n long K = Long.parseLong(str);\n String ans = \"0\";\n for (int i=0;i map = new HashMap<>();\n\t\tfor(int i= 0;i map = new HashMap<>();\n\t\tfor(int i= 0;i= 0; i--){\n for(int k = i; k >= 0; k--){\n if(k != i)\n table[k][i] = (Array[k] + table[k+1][i])%M;\n if(table[k][i] == 0)count++;\n }\n }\n System.out.println(count);\n }\n}\n", "language": "Java", "metadata": {"date": 1534041249, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03287.html", "problem_id": "p03287", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03287/input.txt", "sample_output_relpath": "derived/input_output/data/p03287/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03287/Java/s166245016.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s166245016", "user_id": "u353464699"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\nclass Main{\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n\n int N = scan.nextInt();\n int M = scan.nextInt();\n int[] Array = new int[N];\n int[][] table = new int[N][N];\n int count = 0;\n for(int i = 0; i < N; i++){\n Array[i] = scan.nextInt() % M;\n table[i][i] = Array[i];\n }\n for(int i = N-1; i >= 0; i--){\n for(int k = i; k >= 0; k--){\n if(k != i)\n table[k][i] = (Array[k] + table[k+1][i])%M;\n if(table[k][i] == 0)count++;\n }\n }\n System.out.println(count);\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N boxes arranged in a row from left to right. The i-th box from the left contains A_i candies.\n\nYou will take out the candies from some consecutive boxes and distribute them evenly to M children.\n\nSuch being the case, find the number of the pairs (l, r) that satisfy the following:\n\nl and r are both integers and satisfy 1 \\leq l \\leq r \\leq N.\n\nA_l + A_{l+1} + ... + A_r is a multiple of M.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n2 \\leq M \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the pairs (l, r) that satisfy the conditions.\n\nNote that the number may not fit into a 32-bit integer type.\n\nSample Input 1\n\n3 2\n4 1 5\n\nSample Output 1\n\n3\n\nThe sum A_l + A_{l+1} + ... + A_r for each pair (l, r) is as follows:\n\nSum for (1, 1): 4\n\nSum for (1, 2): 5\n\nSum for (1, 3): 10\n\nSum for (2, 2): 1\n\nSum for (2, 3): 6\n\nSum for (3, 3): 5\n\nAmong these, three are multiples of 2.\n\nSample Input 2\n\n13 17\n29 7 5 7 9 51 7 13 8 55 42 9 81\n\nSample Output 2\n\n6\n\nSample Input 3\n\n10 400000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n25", "sample_input": "3 2\n4 1 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03287", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N boxes arranged in a row from left to right. The i-th box from the left contains A_i candies.\n\nYou will take out the candies from some consecutive boxes and distribute them evenly to M children.\n\nSuch being the case, find the number of the pairs (l, r) that satisfy the following:\n\nl and r are both integers and satisfy 1 \\leq l \\leq r \\leq N.\n\nA_l + A_{l+1} + ... + A_r is a multiple of M.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n2 \\leq M \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the pairs (l, r) that satisfy the conditions.\n\nNote that the number may not fit into a 32-bit integer type.\n\nSample Input 1\n\n3 2\n4 1 5\n\nSample Output 1\n\n3\n\nThe sum A_l + A_{l+1} + ... + A_r for each pair (l, r) is as follows:\n\nSum for (1, 1): 4\n\nSum for (1, 2): 5\n\nSum for (1, 3): 10\n\nSum for (2, 2): 1\n\nSum for (2, 3): 6\n\nSum for (3, 3): 5\n\nAmong these, three are multiples of 2.\n\nSample Input 2\n\n13 17\n29 7 5 7 9 51 7 13 8 55 42 9 81\n\nSample Output 2\n\n6\n\nSample Input 3\n\n10 400000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n25", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 692, "cpu_time_ms": 912, "memory_kb": 971728}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s725226230", "group_id": "codeNet:p03288", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author newcomer\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n CAllGreen solver = new CAllGreen();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CAllGreen {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n\n int difficulty = in.ni();\n long totalpts = in.nl();\n totalpts /= 100;\n int[] questions = new int[difficulty + 1];\n long[] bonuspts = new long[difficulty + 1];\n for (int i = 1; i <= difficulty; i++) {\n\n questions[i] = in.ni();\n bonuspts[i] = in.nl();\n bonuspts[i] /= 100;\n\n\n }\n /*\n out.println(difficulty+\" \"+totalpts);\n out.println(questions);\n out.println(bonuspts);\n */\n long min = Long.MAX_VALUE;\n for (int i = difficulty; i >= 1; i--) {\n long sum = totalpts;\n long questionsolved = 0;\n\n for (int j = i; j >= 1; j--) {\n if (sum <= 0)\n break;\n long ptsonquestion = bonuspts[j];\n int ques = questions[j];\n long quesreq = (sum + j - 1) / j;\n if (quesreq >= ques) {\n questionsolved += ques;\n sum -= (ques * j + ptsonquestion);\n } else {\n questionsolved += (quesreq);\n sum -= (quesreq * j);\n }\n\n }\n if (sum <= 0) {\n if (questionsolved < min)\n min = questionsolved;\n }\n }\n\n out.println(min);\n\n\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int ni() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long nl() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(long i) {\n writer.println(i);\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1533535878, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03288.html", "problem_id": "p03288", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03288/input.txt", "sample_output_relpath": "derived/input_output/data/p03288/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03288/Java/s725226230.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s725226230", "user_id": "u346770976"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author newcomer\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n CAllGreen solver = new CAllGreen();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CAllGreen {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n\n int difficulty = in.ni();\n long totalpts = in.nl();\n totalpts /= 100;\n int[] questions = new int[difficulty + 1];\n long[] bonuspts = new long[difficulty + 1];\n for (int i = 1; i <= difficulty; i++) {\n\n questions[i] = in.ni();\n bonuspts[i] = in.nl();\n bonuspts[i] /= 100;\n\n\n }\n /*\n out.println(difficulty+\" \"+totalpts);\n out.println(questions);\n out.println(bonuspts);\n */\n long min = Long.MAX_VALUE;\n for (int i = difficulty; i >= 1; i--) {\n long sum = totalpts;\n long questionsolved = 0;\n\n for (int j = i; j >= 1; j--) {\n if (sum <= 0)\n break;\n long ptsonquestion = bonuspts[j];\n int ques = questions[j];\n long quesreq = (sum + j - 1) / j;\n if (quesreq >= ques) {\n questionsolved += ques;\n sum -= (ques * j + ptsonquestion);\n } else {\n questionsolved += (quesreq);\n sum -= (quesreq * j);\n }\n\n }\n if (sum <= 0) {\n if (questionsolved < min)\n min = questionsolved;\n }\n }\n\n out.println(min);\n\n\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int ni() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public long nl() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n long res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void println(long i) {\n writer.println(i);\n }\n\n }\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "sample_input": "1199\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03288", "source_text": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5350, "cpu_time_ms": 73, "memory_kb": 21460}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s013149774", "group_id": "codeNet:p03289", "input_text": "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n String head = s.substring(0,1);\n String last = s.substring(2,s.length()-1);\n int ch = 0;\n if(head.equals(\"A\"))ch++;\n if(last.length() - last.replace(\"C\",\"\").length() == 1)ch++;\n if(ch != 2){\n System.out.println(\"WA\");\n return;\n }\n last = last.replace(\"C\",\"\");\n String ALP[] = {\"A\",\"B\",\"C\",\"D\",\"E\",\"F\",\"G\",\"H\",\"I\",\"J\",\"K\",\"L\",\"M\",\"N\",\"O\",\"P\",\"Q\",\"R\",\"S\",\"T\",\"U\",\"V\",\"W\",\"X\",\"Y\",\"Z\"};\n for(String al:ALP){\n if(last.contains(al) || s.substring(1,2).equals(al)){\n System.out.println(\"WA\");\n return;\n }\n }\n System.out.println(\"AC\");\n }\n}\n", "language": "Java", "metadata": {"date": 1593084012, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03289.html", "problem_id": "p03289", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03289/input.txt", "sample_output_relpath": "derived/input_output/data/p03289/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03289/Java/s013149774.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s013149774", "user_id": "u806768852"}, "prompt_components": {"gold_output": "AC\n", "input_to_evaluate": "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n String head = s.substring(0,1);\n String last = s.substring(2,s.length()-1);\n int ch = 0;\n if(head.equals(\"A\"))ch++;\n if(last.length() - last.replace(\"C\",\"\").length() == 1)ch++;\n if(ch != 2){\n System.out.println(\"WA\");\n return;\n }\n last = last.replace(\"C\",\"\");\n String ALP[] = {\"A\",\"B\",\"C\",\"D\",\"E\",\"F\",\"G\",\"H\",\"I\",\"J\",\"K\",\"L\",\"M\",\"N\",\"O\",\"P\",\"Q\",\"R\",\"S\",\"T\",\"U\",\"V\",\"W\",\"X\",\"Y\",\"Z\"};\n for(String al:ALP){\n if(last.contains(al) || s.substring(1,2).equals(al)){\n System.out.println(\"WA\");\n return;\n }\n }\n System.out.println(\"AC\");\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S. Each character of S is uppercase or lowercase English letter.\nDetermine if S satisfies all of the following conditions:\n\nThe initial character of S is an uppercase A.\n\nThere is exactly one occurrence of C between the third character from the beginning and the second to last character (inclusive).\n\nAll letters except the A and C mentioned above are lowercase.\n\nConstraints\n\n4 ≤ |S| ≤ 10 (|S| is the length of the string S.)\n\nEach character of S is uppercase or lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S satisfies all of the conditions in the problem statement, print AC; otherwise, print WA.\n\nSample Input 1\n\nAtCoder\n\nSample Output 1\n\nAC\n\nThe first letter is A, the third letter is C and the remaining letters are all lowercase, so all the conditions are satisfied.\n\nSample Input 2\n\nACoder\n\nSample Output 2\n\nWA\n\nThe second letter should not be C.\n\nSample Input 3\n\nAcycliC\n\nSample Output 3\n\nWA\n\nThe last letter should not be C, either.\n\nSample Input 4\n\nAtCoCo\n\nSample Output 4\n\nWA\n\nThere should not be two or more occurrences of C.\n\nSample Input 5\n\nAtcoder\n\nSample Output 5\n\nWA\n\nThe number of C should not be zero, either.", "sample_input": "AtCoder\n"}, "reference_outputs": ["AC\n"], "source_document_id": "p03289", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S. Each character of S is uppercase or lowercase English letter.\nDetermine if S satisfies all of the following conditions:\n\nThe initial character of S is an uppercase A.\n\nThere is exactly one occurrence of C between the third character from the beginning and the second to last character (inclusive).\n\nAll letters except the A and C mentioned above are lowercase.\n\nConstraints\n\n4 ≤ |S| ≤ 10 (|S| is the length of the string S.)\n\nEach character of S is uppercase or lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S satisfies all of the conditions in the problem statement, print AC; otherwise, print WA.\n\nSample Input 1\n\nAtCoder\n\nSample Output 1\n\nAC\n\nThe first letter is A, the third letter is C and the remaining letters are all lowercase, so all the conditions are satisfied.\n\nSample Input 2\n\nACoder\n\nSample Output 2\n\nWA\n\nThe second letter should not be C.\n\nSample Input 3\n\nAcycliC\n\nSample Output 3\n\nWA\n\nThe last letter should not be C, either.\n\nSample Input 4\n\nAtCoCo\n\nSample Output 4\n\nWA\n\nThere should not be two or more occurrences of C.\n\nSample Input 5\n\nAtcoder\n\nSample Output 5\n\nWA\n\nThe number of C should not be zero, either.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 753, "cpu_time_ms": 114, "memory_kb": 35644}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s473041702", "group_id": "codeNet:p03291", "input_text": "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n long N = 1_000_000_007L;\n Scanner scanner = new Scanner(System.in);\n String str = scanner.next();\n\n long[][] d = new long[str.length() + 1][4];\n d[0][0] = 1;\n for (int i = 1; i <= str.length(); i++) {\n char ch = str.charAt(i - 1);\n\n int n = ch == '?' ? 3 : 1;\n int a = 0, b = 0, c = 0;\n if (ch == 'A' || ch == '?') a = 1;\n if (ch == 'B' || ch == '?') b = 1;\n if (ch == 'C' || ch == '?') c = 1;\n d[i][0] = d[i - 1][0] * n % N;\n d[i][1] = d[i - 1][1] * n % N + a * d[i - 1][0];\n d[i][2] = d[i - 1][2] * n % N + b * d[i - 1][1];\n d[i][3] = d[i - 1][3] * n % N + c * d[i - 1][2];\n\n for (int j = 0; j < 4; j++) d[i][j] %= N;\n }\n\n System.out.println(d[str.length()][3]);\n }\n}\n", "language": "Java", "metadata": {"date": 1534219373, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03291.html", "problem_id": "p03291", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03291/input.txt", "sample_output_relpath": "derived/input_output/data/p03291/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03291/Java/s473041702.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s473041702", "user_id": "u189832798"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n long N = 1_000_000_007L;\n Scanner scanner = new Scanner(System.in);\n String str = scanner.next();\n\n long[][] d = new long[str.length() + 1][4];\n d[0][0] = 1;\n for (int i = 1; i <= str.length(); i++) {\n char ch = str.charAt(i - 1);\n\n int n = ch == '?' ? 3 : 1;\n int a = 0, b = 0, c = 0;\n if (ch == 'A' || ch == '?') a = 1;\n if (ch == 'B' || ch == '?') b = 1;\n if (ch == 'C' || ch == '?') c = 1;\n d[i][0] = d[i - 1][0] * n % N;\n d[i][1] = d[i - 1][1] * n % N + a * d[i - 1][0];\n d[i][2] = d[i - 1][2] * n % N + b * d[i - 1][1];\n d[i][3] = d[i - 1][3] * n % N + c * d[i - 1][2];\n\n for (int j = 0; j < 4; j++) d[i][j] %= N;\n }\n\n System.out.println(d[str.length()][3]);\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThe ABC number of a string T is the number of triples of integers (i, j, k) that satisfy all of the following conditions:\n\n1 ≤ i < j < k ≤ |T| (|T| is the length of T.)\n\nT_i = A (T_i is the i-th character of T from the beginning.)\n\nT_j = B\n\nT_k = C\n\nFor example, when T = ABCBC, there are three triples of integers (i, j, k) that satisfy the conditions: (1, 2, 3), (1, 2, 5), (1, 4, 5). Thus, the ABC number of T is 3.\n\nYou are given a string S. Each character of S is A, B, C or ?.\n\nLet Q be the number of occurrences of ? in S. We can make 3^Q strings by replacing each occurrence of ? in S with A, B or C. Find the sum of the ABC numbers of all these strings.\n\nThis sum can be extremely large, so print the sum modulo 10^9 + 7.\n\nConstraints\n\n3 ≤ |S| ≤ 10^5\n\nEach character of S is A, B, C or ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the sum of the ABC numbers of all the 3^Q strings, modulo 10^9 + 7.\n\nSample Input 1\n\nA??C\n\nSample Output 1\n\n8\n\nIn this case, Q = 2, and we can make 3^Q = 9 strings by by replacing each occurrence of ? with A, B or C. The ABC number of each of these strings is as follows:\n\nAAAC: 0\n\nAABC: 2\n\nAACC: 0\n\nABAC: 1\n\nABBC: 2\n\nABCC: 2\n\nACAC: 0\n\nACBC: 1\n\nACCC: 0\n\nThe sum of these is 0 + 2 + 0 + 1 + 2 + 2 + 0 + 1 + 0 = 8, so we print 8 modulo 10^9 + 7, that is, 8.\n\nSample Input 2\n\nABCBC\n\nSample Output 2\n\n3\n\nWhen Q = 0, we print the ABC number of S itself, modulo 10^9 + 7. This string is the same as the one given as an example in the problem statement, and its ABC number is 3.\n\nSample Input 3\n\n????C?????B??????A???????\n\nSample Output 3\n\n979596887\n\nIn this case, the sum of the ABC numbers of all the 3^Q strings is 2291979612924, and we should print this number modulo 10^9 + 7, that is, 979596887.", "sample_input": "A??C\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03291", "source_text": "Score : 400 points\n\nProblem Statement\n\nThe ABC number of a string T is the number of triples of integers (i, j, k) that satisfy all of the following conditions:\n\n1 ≤ i < j < k ≤ |T| (|T| is the length of T.)\n\nT_i = A (T_i is the i-th character of T from the beginning.)\n\nT_j = B\n\nT_k = C\n\nFor example, when T = ABCBC, there are three triples of integers (i, j, k) that satisfy the conditions: (1, 2, 3), (1, 2, 5), (1, 4, 5). Thus, the ABC number of T is 3.\n\nYou are given a string S. Each character of S is A, B, C or ?.\n\nLet Q be the number of occurrences of ? in S. We can make 3^Q strings by replacing each occurrence of ? in S with A, B or C. Find the sum of the ABC numbers of all these strings.\n\nThis sum can be extremely large, so print the sum modulo 10^9 + 7.\n\nConstraints\n\n3 ≤ |S| ≤ 10^5\n\nEach character of S is A, B, C or ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the sum of the ABC numbers of all the 3^Q strings, modulo 10^9 + 7.\n\nSample Input 1\n\nA??C\n\nSample Output 1\n\n8\n\nIn this case, Q = 2, and we can make 3^Q = 9 strings by by replacing each occurrence of ? with A, B or C. The ABC number of each of these strings is as follows:\n\nAAAC: 0\n\nAABC: 2\n\nAACC: 0\n\nABAC: 1\n\nABBC: 2\n\nABCC: 2\n\nACAC: 0\n\nACBC: 1\n\nACCC: 0\n\nThe sum of these is 0 + 2 + 0 + 1 + 2 + 2 + 0 + 1 + 0 = 8, so we print 8 modulo 10^9 + 7, that is, 8.\n\nSample Input 2\n\nABCBC\n\nSample Output 2\n\n3\n\nWhen Q = 0, we print the ABC number of S itself, modulo 10^9 + 7. This string is the same as the one given as an example in the problem statement, and its ABC number is 3.\n\nSample Input 3\n\n????C?????B??????A???????\n\nSample Output 3\n\n979596887\n\nIn this case, the sum of the ABC numbers of all the 3^Q strings is 2291979612924, and we should print this number modulo 10^9 + 7, that is, 979596887.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 834, "cpu_time_ms": 178, "memory_kb": 30308}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s679616754", "group_id": "codeNet:p03297", "input_text": "import java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\ttry(Scanner sc = new Scanner(System.in)){\n\t\t\tint T=sc.nextInt();\n\t\t\tlong a, b, c, d, e=0;\n\t\t\tSet set=new HashSet<>();\n\t\t\t\n\t\t\tfor(int i=0; ia) {\n\t\t\t\t\ttf=true;\n\t\t\t\t}\n\t\t\t\telse if(b>d) {\n\t\t\t\t\ttf=false;\n\t\t\t\t}\n\t\t\t\telse if(c>=b) {\n\t\t\t\t\ttf=true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\twhile(true) {\n\t\t\t\t\tif(a0 && set.contains(a)) {\n\t\t\t\t\t\ttf=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tset.add(a);\n\t\t\t\t\te=a%b;\n\t\t\t\t\tif(e<=c) {\n\t\t\t\t\t\ta=e+d;\n\t\t\t\t\t}\n\t\t\t\t\telse if(e>c) {\n\t\t\t\t\t\ta=e;\n\t\t\t\t\t}\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println(tf? \"Yes\":\"No\");\n\t\t\t\tset.clear();\n\t\t\t\n\t\t\t}\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1531961407, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03297.html", "problem_id": "p03297", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03297/input.txt", "sample_output_relpath": "derived/input_output/data/p03297/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03297/Java/s679616754.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s679616754", "user_id": "u790865625"}, "prompt_components": {"gold_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n", "input_to_evaluate": "import java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\ttry(Scanner sc = new Scanner(System.in)){\n\t\t\tint T=sc.nextInt();\n\t\t\tlong a, b, c, d, e=0;\n\t\t\tSet set=new HashSet<>();\n\t\t\t\n\t\t\tfor(int i=0; ia) {\n\t\t\t\t\ttf=true;\n\t\t\t\t}\n\t\t\t\telse if(b>d) {\n\t\t\t\t\ttf=false;\n\t\t\t\t}\n\t\t\t\telse if(c>=b) {\n\t\t\t\t\ttf=true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\twhile(true) {\n\t\t\t\t\tif(a0 && set.contains(a)) {\n\t\t\t\t\t\ttf=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tset.add(a);\n\t\t\t\t\te=a%b;\n\t\t\t\t\tif(e<=c) {\n\t\t\t\t\t\ta=e+d;\n\t\t\t\t\t}\n\t\t\t\t\telse if(e>c) {\n\t\t\t\t\t\ta=e;\n\t\t\t\t\t}\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tSystem.out.println(tf? \"Yes\":\"No\");\n\t\t\t\tset.clear();\n\t\t\t\n\t\t\t}\n\t\t}\n\t}\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nRingo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were A cans of juice in stock in the morning.\nSnuke buys B cans of juice here every day in the daytime.\nThen, the manager checks the number of cans of juice remaining in stock every night.\nIf there are C or less cans, D new cans will be added to the stock by the next morning.\n\nDetermine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.\nNobody besides Snuke buy juice at this store.\n\nNote that each test case in this problem consists of T queries.\n\nConstraints\n\n1 \\leq T \\leq 300\n\n1 \\leq A, B, C, D \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_T B_T C_T D_T\n\nIn the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.\n\nOutput\n\nPrint T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.\n\nSample Input 1\n\n14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n\nSample Output 1\n\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 6\n→D x\n\nIn the second query, the number of cans of juice in stock changes as follows:\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 15\n→D 8\n→N 8\n→D 1\n→N 10\n→D 3\n→N 12\n→D 5\n→N 14\n→D 7\n→N 7\n→D 0\n→N 9\n→D 2\n→N 11\n→D …\n\nand so on, thus Snuke can buy juice indefinitely.\n\nSample Input 2\n\n24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1\n\nSample Output 2\n\nNo\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo", "sample_input": "14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n"}, "reference_outputs": ["No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n"], "source_document_id": "p03297", "source_text": "Score : 600 points\n\nProblem Statement\n\nRingo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were A cans of juice in stock in the morning.\nSnuke buys B cans of juice here every day in the daytime.\nThen, the manager checks the number of cans of juice remaining in stock every night.\nIf there are C or less cans, D new cans will be added to the stock by the next morning.\n\nDetermine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.\nNobody besides Snuke buy juice at this store.\n\nNote that each test case in this problem consists of T queries.\n\nConstraints\n\n1 \\leq T \\leq 300\n\n1 \\leq A, B, C, D \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_T B_T C_T D_T\n\nIn the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.\n\nOutput\n\nPrint T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.\n\nSample Input 1\n\n14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n\nSample Output 1\n\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 6\n→D x\n\nIn the second query, the number of cans of juice in stock changes as follows:\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 15\n→D 8\n→N 8\n→D 1\n→N 10\n→D 3\n→N 12\n→D 5\n→N 14\n→D 7\n→N 7\n→D 0\n→N 9\n→D 2\n→N 11\n→D …\n\nand so on, thus Snuke can buy juice indefinitely.\n\nSample Input 2\n\n24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1\n\nSample Output 2\n\nNo\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 895, "cpu_time_ms": 2111, "memory_kb": 319412}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s439226976", "group_id": "codeNet:p03297", "input_text": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int T = scanner.nextInt();\n\n FOR:\n for (int t = 0; t < T; t++) {\n long As = scanner.nextLong();\n long Bs = scanner.nextLong();\n long Cs = scanner.nextLong();\n long Ds = scanner.nextLong();\n List remains = new ArrayList<>();\n// int count = 0;\n if (Bs > Ds) {\n System.out.println(\"No\");\n continue;\n }\n if (Cs >= Bs) {\n System.out.println(\"Yes\");\n continue;\n }\n while (As >= Bs) {\n// System.out.println(As);\n long temp = (Bs * (As / Bs + Cs / Bs));\n int i = 0;\n while (temp > As) {\n i++;\n temp = (Bs * (As / Bs + Cs / Bs - i));\n }\n As -= (temp <= As ? temp : Bs);\n// System.out.println(As);\n if (As <= Cs) {\n As += Ds;\n }\n\n if (remains.contains(As)) {\n System.out.println(\"Yes\");\n continue FOR;\n } else {\n remains.add(As);\n }\n\n }\n System.out.println(\"No\");\n }\n }\n}", "language": "Java", "metadata": {"date": 1531630112, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03297.html", "problem_id": "p03297", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03297/input.txt", "sample_output_relpath": "derived/input_output/data/p03297/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03297/Java/s439226976.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s439226976", "user_id": "u136378781"}, "prompt_components": {"gold_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int T = scanner.nextInt();\n\n FOR:\n for (int t = 0; t < T; t++) {\n long As = scanner.nextLong();\n long Bs = scanner.nextLong();\n long Cs = scanner.nextLong();\n long Ds = scanner.nextLong();\n List remains = new ArrayList<>();\n// int count = 0;\n if (Bs > Ds) {\n System.out.println(\"No\");\n continue;\n }\n if (Cs >= Bs) {\n System.out.println(\"Yes\");\n continue;\n }\n while (As >= Bs) {\n// System.out.println(As);\n long temp = (Bs * (As / Bs + Cs / Bs));\n int i = 0;\n while (temp > As) {\n i++;\n temp = (Bs * (As / Bs + Cs / Bs - i));\n }\n As -= (temp <= As ? temp : Bs);\n// System.out.println(As);\n if (As <= Cs) {\n As += Ds;\n }\n\n if (remains.contains(As)) {\n System.out.println(\"Yes\");\n continue FOR;\n } else {\n remains.add(As);\n }\n\n }\n System.out.println(\"No\");\n }\n }\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nRingo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were A cans of juice in stock in the morning.\nSnuke buys B cans of juice here every day in the daytime.\nThen, the manager checks the number of cans of juice remaining in stock every night.\nIf there are C or less cans, D new cans will be added to the stock by the next morning.\n\nDetermine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.\nNobody besides Snuke buy juice at this store.\n\nNote that each test case in this problem consists of T queries.\n\nConstraints\n\n1 \\leq T \\leq 300\n\n1 \\leq A, B, C, D \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_T B_T C_T D_T\n\nIn the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.\n\nOutput\n\nPrint T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.\n\nSample Input 1\n\n14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n\nSample Output 1\n\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 6\n→D x\n\nIn the second query, the number of cans of juice in stock changes as follows:\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 15\n→D 8\n→N 8\n→D 1\n→N 10\n→D 3\n→N 12\n→D 5\n→N 14\n→D 7\n→N 7\n→D 0\n→N 9\n→D 2\n→N 11\n→D …\n\nand so on, thus Snuke can buy juice indefinitely.\n\nSample Input 2\n\n24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1\n\nSample Output 2\n\nNo\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo", "sample_input": "14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n"}, "reference_outputs": ["No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n"], "source_document_id": "p03297", "source_text": "Score : 600 points\n\nProblem Statement\n\nRingo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were A cans of juice in stock in the morning.\nSnuke buys B cans of juice here every day in the daytime.\nThen, the manager checks the number of cans of juice remaining in stock every night.\nIf there are C or less cans, D new cans will be added to the stock by the next morning.\n\nDetermine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.\nNobody besides Snuke buy juice at this store.\n\nNote that each test case in this problem consists of T queries.\n\nConstraints\n\n1 \\leq T \\leq 300\n\n1 \\leq A, B, C, D \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_T B_T C_T D_T\n\nIn the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.\n\nOutput\n\nPrint T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.\n\nSample Input 1\n\n14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n\nSample Output 1\n\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 6\n→D x\n\nIn the second query, the number of cans of juice in stock changes as follows:\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 15\n→D 8\n→N 8\n→D 1\n→N 10\n→D 3\n→N 12\n→D 5\n→N 14\n→D 7\n→N 7\n→D 0\n→N 9\n→D 2\n→N 11\n→D …\n\nand so on, thus Snuke can buy juice indefinitely.\n\nSample Input 2\n\n24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1\n\nSample Output 2\n\nNo\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1482, "cpu_time_ms": 2108, "memory_kb": 22100}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s089587391", "group_id": "codeNet:p03297", "input_text": "\npublic class Main {\n\n\n private static void solve() {\n int t = ni();\n for (int i = 0; i < t; i ++) {\n long a = nl();\n long b = nl();\n long c = nl();\n long d = nl();\n \n if (a < b || d < b) {\n System.out.println(\"No\");\n continue;\n }\n //c本以下ならd本追加 d > b b本消費\n //\n a %= b;\n if (a > c) {\n System.out.println(\"No\");\n continue;\n }\n long gcd = gcd(b, d);\n if (b - gcd > c) {\n System.out.println(\"No\");\n continue;\n }\n long x = c - a;\n a += x / c;\n System.out.println(\"Yes\");\n }\n }\n\n public static long gcd(long a, long b) {\n if (a > b) {\n long tmp = a;\n a = b;\n b = tmp;\n }\n while (a != 0) {\n long c = a;\n a = b % c;\n b = c;\n }\n return b;\n}\n\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n @Override\n public void run() {\n long start = System.currentTimeMillis();\n String debug = args.length > 0 ? args[0] : null;\n if (debug != null) {\n try {\n is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);\n solve();\n out.flush();\n tr((System.currentTimeMillis() - start) + \"ms\");\n }\n }, \"\", 64000000).start();\n }\n\n private static java.io.InputStream is = System.in;\n private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);\n private static java.util.StringTokenizer tokenizer = null;\n private static java.io.BufferedReader reader;\n\n public static String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private static double nd() {\n return Double.parseDouble(next());\n }\n\n private static long nl() {\n return Long.parseLong(next());\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = ni();\n return a;\n }\n\n private static char[] ns() {\n return next().toCharArray();\n }\n\n private static long[] nal(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nl();\n return a;\n }\n\n private static int[][] ntable(int n, int m) {\n int[][] table = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[i][j] = ni();\n }\n }\n return table;\n }\n\n private static int[][] nlist(int n, int m) {\n int[][] table = new int[m][n];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[j][i] = ni();\n }\n }\n return table;\n }\n\n private static int ni() {\n return Integer.parseInt(next());\n }\n\n private static void tr(Object... o) {\n if (is != System.in)\n System.out.println(java.util.Arrays.deepToString(o));\n }\n}\n", "language": "Java", "metadata": {"date": 1531617712, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03297.html", "problem_id": "p03297", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03297/input.txt", "sample_output_relpath": "derived/input_output/data/p03297/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03297/Java/s089587391.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s089587391", "user_id": "u769201746"}, "prompt_components": {"gold_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n", "input_to_evaluate": "\npublic class Main {\n\n\n private static void solve() {\n int t = ni();\n for (int i = 0; i < t; i ++) {\n long a = nl();\n long b = nl();\n long c = nl();\n long d = nl();\n \n if (a < b || d < b) {\n System.out.println(\"No\");\n continue;\n }\n //c本以下ならd本追加 d > b b本消費\n //\n a %= b;\n if (a > c) {\n System.out.println(\"No\");\n continue;\n }\n long gcd = gcd(b, d);\n if (b - gcd > c) {\n System.out.println(\"No\");\n continue;\n }\n long x = c - a;\n a += x / c;\n System.out.println(\"Yes\");\n }\n }\n\n public static long gcd(long a, long b) {\n if (a > b) {\n long tmp = a;\n a = b;\n b = tmp;\n }\n while (a != 0) {\n long c = a;\n a = b % c;\n b = c;\n }\n return b;\n}\n\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n @Override\n public void run() {\n long start = System.currentTimeMillis();\n String debug = args.length > 0 ? args[0] : null;\n if (debug != null) {\n try {\n is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);\n solve();\n out.flush();\n tr((System.currentTimeMillis() - start) + \"ms\");\n }\n }, \"\", 64000000).start();\n }\n\n private static java.io.InputStream is = System.in;\n private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);\n private static java.util.StringTokenizer tokenizer = null;\n private static java.io.BufferedReader reader;\n\n public static String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private static double nd() {\n return Double.parseDouble(next());\n }\n\n private static long nl() {\n return Long.parseLong(next());\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = ni();\n return a;\n }\n\n private static char[] ns() {\n return next().toCharArray();\n }\n\n private static long[] nal(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nl();\n return a;\n }\n\n private static int[][] ntable(int n, int m) {\n int[][] table = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[i][j] = ni();\n }\n }\n return table;\n }\n\n private static int[][] nlist(int n, int m) {\n int[][] table = new int[m][n];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[j][i] = ni();\n }\n }\n return table;\n }\n\n private static int ni() {\n return Integer.parseInt(next());\n }\n\n private static void tr(Object... o) {\n if (is != System.in)\n System.out.println(java.util.Arrays.deepToString(o));\n }\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nRingo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were A cans of juice in stock in the morning.\nSnuke buys B cans of juice here every day in the daytime.\nThen, the manager checks the number of cans of juice remaining in stock every night.\nIf there are C or less cans, D new cans will be added to the stock by the next morning.\n\nDetermine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.\nNobody besides Snuke buy juice at this store.\n\nNote that each test case in this problem consists of T queries.\n\nConstraints\n\n1 \\leq T \\leq 300\n\n1 \\leq A, B, C, D \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_T B_T C_T D_T\n\nIn the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.\n\nOutput\n\nPrint T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.\n\nSample Input 1\n\n14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n\nSample Output 1\n\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 6\n→D x\n\nIn the second query, the number of cans of juice in stock changes as follows:\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 15\n→D 8\n→N 8\n→D 1\n→N 10\n→D 3\n→N 12\n→D 5\n→N 14\n→D 7\n→N 7\n→D 0\n→N 9\n→D 2\n→N 11\n→D …\n\nand so on, thus Snuke can buy juice indefinitely.\n\nSample Input 2\n\n24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1\n\nSample Output 2\n\nNo\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo", "sample_input": "14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n"}, "reference_outputs": ["No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n"], "source_document_id": "p03297", "source_text": "Score : 600 points\n\nProblem Statement\n\nRingo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were A cans of juice in stock in the morning.\nSnuke buys B cans of juice here every day in the daytime.\nThen, the manager checks the number of cans of juice remaining in stock every night.\nIf there are C or less cans, D new cans will be added to the stock by the next morning.\n\nDetermine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.\nNobody besides Snuke buy juice at this store.\n\nNote that each test case in this problem consists of T queries.\n\nConstraints\n\n1 \\leq T \\leq 300\n\n1 \\leq A, B, C, D \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_T B_T C_T D_T\n\nIn the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.\n\nOutput\n\nPrint T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.\n\nSample Input 1\n\n14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n\nSample Output 1\n\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 6\n→D x\n\nIn the second query, the number of cans of juice in stock changes as follows:\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 15\n→D 8\n→N 8\n→D 1\n→N 10\n→D 3\n→N 12\n→D 5\n→N 14\n→D 7\n→N 7\n→D 0\n→N 9\n→D 2\n→N 11\n→D …\n\nand so on, thus Snuke can buy juice indefinitely.\n\nSample Input 2\n\n24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1\n\nSample Output 2\n\nNo\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3196, "cpu_time_ms": 130, "memory_kb": 21460}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s409658197", "group_id": "codeNet:p03304", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigDecimal;\nimport java.io.IOException;\nimport java.util.NoSuchElementException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FasterScanner in = new FasterScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, FasterScanner in, PrintWriter out) {\n BigDecimal n = new BigDecimal(in.nextInt());\n BigDecimal m = new BigDecimal(in.nextInt() - 1);\n\n out.println(m.divide(n));\n }\n\n }\n\n static class FasterScanner {\n private InputStream in;\n private byte[] buffer;\n private int bufPointer;\n private int bufLength;\n\n public FasterScanner(InputStream in) {\n this.in = in;\n buffer = new byte[1024];\n }\n\n private boolean hasNextByte() {\n if (bufPointer < bufLength) return true;\n bufPointer = 0;\n try {\n bufLength = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n return (bufLength > 0);\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[bufPointer++];\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return (c >= 33 && c <= 126);\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[bufPointer])) bufPointer++;\n return hasNextByte();\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || b > '9') throw new NumberFormatException();\n\n while (true) {\n if (b >= '0' && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1531017550, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03304.html", "problem_id": "p03304", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03304/input.txt", "sample_output_relpath": "derived/input_output/data/p03304/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03304/Java/s409658197.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s409658197", "user_id": "u510349606"}, "prompt_components": {"gold_output": "1.0000000000\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.math.BigDecimal;\nimport java.io.IOException;\nimport java.util.NoSuchElementException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FasterScanner in = new FasterScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n public void solve(int testNumber, FasterScanner in, PrintWriter out) {\n BigDecimal n = new BigDecimal(in.nextInt());\n BigDecimal m = new BigDecimal(in.nextInt() - 1);\n\n out.println(m.divide(n));\n }\n\n }\n\n static class FasterScanner {\n private InputStream in;\n private byte[] buffer;\n private int bufPointer;\n private int bufLength;\n\n public FasterScanner(InputStream in) {\n this.in = in;\n buffer = new byte[1024];\n }\n\n private boolean hasNextByte() {\n if (bufPointer < bufLength) return true;\n bufPointer = 0;\n try {\n bufLength = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n return (bufLength > 0);\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[bufPointer++];\n return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return (c >= 33 && c <= 126);\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[bufPointer])) bufPointer++;\n return hasNextByte();\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || b > '9') throw new NumberFormatException();\n\n while (true) {\n if (b >= '0' && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet us define the beauty of a sequence (a_1,... ,a_n) as the number of pairs of two adjacent elements in it whose absolute differences are d.\nFor example, when d=1, the beauty of the sequence (3, 2, 3, 10, 9) is 3.\n\nThere are a total of n^m sequences of length m where each element is an integer between 1 and n (inclusive).\nFind the beauty of each of these n^m sequences, and print the average of those values.\n\nConstraints\n\n0 \\leq d < n \\leq 10^9\n\n2 \\leq m \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m d\n\nOutput\n\nPrint the average of the beauties of the sequences of length m where each element is an integer between 1 and n.\nThe output will be judged correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3 1\n\nSample Output 1\n\n1.0000000000\n\nThe beauty of (1,1,1) is 0.\n\nThe beauty of (1,1,2) is 1.\n\nThe beauty of (1,2,1) is 2.\n\nThe beauty of (1,2,2) is 1.\n\nThe beauty of (2,1,1) is 1.\n\nThe beauty of (2,1,2) is 2.\n\nThe beauty of (2,2,1) is 1.\n\nThe beauty of (2,2,2) is 0.\n\nThe answer is the average of these values: (0+1+2+1+1+2+1+0)/8=1.\n\nSample Input 2\n\n1000000000 180707 0\n\nSample Output 2\n\n0.0001807060", "sample_input": "2 3 1\n"}, "reference_outputs": ["1.0000000000\n"], "source_document_id": "p03304", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet us define the beauty of a sequence (a_1,... ,a_n) as the number of pairs of two adjacent elements in it whose absolute differences are d.\nFor example, when d=1, the beauty of the sequence (3, 2, 3, 10, 9) is 3.\n\nThere are a total of n^m sequences of length m where each element is an integer between 1 and n (inclusive).\nFind the beauty of each of these n^m sequences, and print the average of those values.\n\nConstraints\n\n0 \\leq d < n \\leq 10^9\n\n2 \\leq m \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m d\n\nOutput\n\nPrint the average of the beauties of the sequences of length m where each element is an integer between 1 and n.\nThe output will be judged correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3 1\n\nSample Output 1\n\n1.0000000000\n\nThe beauty of (1,1,1) is 0.\n\nThe beauty of (1,1,2) is 1.\n\nThe beauty of (1,2,1) is 2.\n\nThe beauty of (1,2,2) is 1.\n\nThe beauty of (2,1,1) is 1.\n\nThe beauty of (2,1,2) is 2.\n\nThe beauty of (2,2,1) is 1.\n\nThe beauty of (2,2,2) is 0.\n\nThe answer is the average of these values: (0+1+2+1+1+2+1+0)/8=1.\n\nSample Input 2\n\n1000000000 180707 0\n\nSample Output 2\n\n0.0001807060", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2940, "cpu_time_ms": 80, "memory_kb": 21460}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s014785494", "group_id": "codeNet:p03308", "input_text": "import java.io.*;\nimport java.util.*;\nimport java.math.BigInteger;\npublic class Main {\n\nstatic long[] list=new long[87];\n\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\n String nyuA=sc.nextLine();\n \nint N=Integer.parseInt(nyuA);\n\nString[] data=sc.nextLine().split(\" \");\n\nint[] num=new int[data.length];\n\nfor(int i=0;i= minSum) {\n stop = true;\n break;\n }\n }\n \n if (!stop) {\n minSum = minSumA;\n } else {\n break;\n }\n }\n \n for (int i = 1; i < Integer.MAX_VALUE; i++) {\n boolean stop = false;\n int minSumA = 0;\n for (int num : nums) {\n minSumA += Math.abs(num - i);\n if (minSumA >= minSum) {\n stop = true;\n break;\n }\n }\n \n if (!stop) {\n minSum = minSumA;\n } else {\n break;\n }\n }\n \n System.out.println(minSum);\n }\n}\n", "language": "Java", "metadata": {"date": 1559923081, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03309.html", "problem_id": "p03309", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03309/input.txt", "sample_output_relpath": "derived/input_output/data/p03309/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03309/Java/s679432411.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s679432411", "user_id": "u273816974"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] nums = new int[n];\n long minSum = 0;\n for (int i = 0; i < n; i++) {\n int num = sc.nextInt();\n nums[i] = num - (i + 1);\n minSum += Math.abs(nums[i]);\n }\n \n for (int i = 1; i < Integer.MAX_VALUE; i++) {\n boolean stop = false;\n int minSumA = 0;\n for (int num : nums) {\n minSumA += Math.abs(num - i);\n if (minSumA >= minSum) {\n stop = true;\n break;\n }\n }\n \n if (!stop) {\n minSum = minSumA;\n } else {\n break;\n }\n }\n \n for (int i = 1; i < Integer.MAX_VALUE; i++) {\n boolean stop = false;\n int minSumA = 0;\n for (int num : nums) {\n minSumA += Math.abs(num - i);\n if (minSumA >= minSum) {\n stop = true;\n break;\n }\n }\n \n if (!stop) {\n minSum = minSumA;\n } else {\n break;\n }\n }\n \n System.out.println(minSum);\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1438, "cpu_time_ms": 2095, "memory_kb": 64760}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s650157392", "group_id": "codeNet:p03309", "input_text": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int[] nums = new int[sc.nextInt()];\n for (int i = 0; i < nums.length; i++) {\n nums[i] = sc.nextInt();\n }\n int b = -200000;\n int tmp = 0;\n int tmp2 = Integer.MAX_VALUE;\n int output = 0;\n for(int i=0;i=0){\n output+=nums[i]-c;\n }else{\n output-=nums[i]-c; \n }\n }\n System.out.println(output);\n\n }\n\n}", "language": "Java", "metadata": {"date": 1550081970, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03309.html", "problem_id": "p03309", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03309/input.txt", "sample_output_relpath": "derived/input_output/data/p03309/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03309/Java/s650157392.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s650157392", "user_id": "u136427605"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int[] nums = new int[sc.nextInt()];\n for (int i = 0; i < nums.length; i++) {\n nums[i] = sc.nextInt();\n }\n int b = -200000;\n int tmp = 0;\n int tmp2 = Integer.MAX_VALUE;\n int output = 0;\n for(int i=0;i=0){\n output+=nums[i]-c;\n }else{\n output-=nums[i]-c; \n }\n }\n System.out.println(output);\n\n }\n\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 764, "cpu_time_ms": 633, "memory_kb": 86600}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s704855754", "group_id": "codeNet:p03309", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n\n int[] b = new int[n];\n for (int i = 0; i < n; i++) {\n b[i] = a[i] - (i+1);\n }\n\n Arrays.sort(b);\n int med = b[n/2];\n\n int ans = 0;\n for (int i = 0; i < n; i++) {\n ans += Math.abs(b[i] - med);\n }\n\n System.out.println(ans);\n }\n}", "language": "Java", "metadata": {"date": 1530503622, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03309.html", "problem_id": "p03309", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03309/input.txt", "sample_output_relpath": "derived/input_output/data/p03309/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03309/Java/s704855754.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s704855754", "user_id": "u054397616"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n\n for (int i = 0; i < n; i++) {\n a[i] = sc.nextInt();\n }\n\n int[] b = new int[n];\n for (int i = 0; i < n; i++) {\n b[i] = a[i] - (i+1);\n }\n\n Arrays.sort(b);\n int med = b[n/2];\n\n int ans = 0;\n for (int i = 0; i < n; i++) {\n ans += Math.abs(b[i] - med);\n }\n\n System.out.println(ans);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 619, "cpu_time_ms": 656, "memory_kb": 64464}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s389406234", "group_id": "codeNet:p03310", "input_text": "import java.io.File;\nimport java.io.FileInputStream;\nimport java.util.Scanner;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.HashMap;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\t\n\t\tint N = sc.nextInt();\n\t\tlong[] sum = new long[N+1];\n\t\tlong[] A = new long[N+1];\n\t\tfor(int i = 1; i <= N; i++){\n\t\t\tA[i] = sc.nextLong();\n\t\t\tsum[i] = sum[i-1] + A[i];\n\t\t}\n\t\t\n\t\tlong ans = Long.MAX_VALUE;\n\t\tfor(int i = 2; i <= N - 1; i++){\n\t\t\tlong P = 0, Q = 0;\n\t\t\tlong min = Long.MAX_VALUE;\n\t\t\tfor(int j = 1; j < i; j++){\n\t\t\t\tlong p = sum[j];\n\t\t\t\tlong q = sum[i] - sum[j];\n\t\t\t\tif(Math.abs(p-q) < min){\n\t\t\t\t\tmin = Math.abs(p-q);\n\t\t\t\t\tP = p; Q = q;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tlong R = 0, S = 0;\n\t\t\tmin = Long.MAX_VALUE;\n\t\t\tfor(int j = i + 1; j < N; j++){\n\t\t\t\tlong r = sum[j] - sum[i];\n\t\t\t\tlong s = sum[N] - sum[j];\n\t\t\t\tif(Math.abs(r-s) < min){\n\t\t\t\t\tmin = Math.abs(r-s);\n\t\t\t\t\tR = r; S = s;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tans = Math.min(ans, Math.abs(Math.max(Math.max(P, Q), Math.max(R, S)) - Math.min(Math.min(P, Q), Math.min(R, S))));\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n}\n\nclass FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() {\n \tif (hasNextByte()) return buffer[ptr++];\n \telse return -1;\n }\n private static boolean isPrintableChar(int c){\n \treturn 33 <= c && c <= 126;\n }\n public boolean hasNext() {\n \twhile(hasNextByte() && !isPrintableChar(buffer[ptr]))\n \t\tptr++; return hasNextByte();\n }\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n}", "language": "Java", "metadata": {"date": 1542910263, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03310.html", "problem_id": "p03310", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03310/input.txt", "sample_output_relpath": "derived/input_output/data/p03310/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03310/Java/s389406234.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s389406234", "user_id": "u234826697"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.File;\nimport java.io.FileInputStream;\nimport java.util.Scanner;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.HashMap;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tFastScanner sc = new FastScanner(System.in);\n\t\t\n\t\tint N = sc.nextInt();\n\t\tlong[] sum = new long[N+1];\n\t\tlong[] A = new long[N+1];\n\t\tfor(int i = 1; i <= N; i++){\n\t\t\tA[i] = sc.nextLong();\n\t\t\tsum[i] = sum[i-1] + A[i];\n\t\t}\n\t\t\n\t\tlong ans = Long.MAX_VALUE;\n\t\tfor(int i = 2; i <= N - 1; i++){\n\t\t\tlong P = 0, Q = 0;\n\t\t\tlong min = Long.MAX_VALUE;\n\t\t\tfor(int j = 1; j < i; j++){\n\t\t\t\tlong p = sum[j];\n\t\t\t\tlong q = sum[i] - sum[j];\n\t\t\t\tif(Math.abs(p-q) < min){\n\t\t\t\t\tmin = Math.abs(p-q);\n\t\t\t\t\tP = p; Q = q;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tlong R = 0, S = 0;\n\t\t\tmin = Long.MAX_VALUE;\n\t\t\tfor(int j = i + 1; j < N; j++){\n\t\t\t\tlong r = sum[j] - sum[i];\n\t\t\t\tlong s = sum[N] - sum[j];\n\t\t\t\tif(Math.abs(r-s) < min){\n\t\t\t\t\tmin = Math.abs(r-s);\n\t\t\t\t\tR = r; S = s;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tans = Math.min(ans, Math.abs(Math.max(Math.max(P, Q), Math.max(R, S)) - Math.min(Math.min(P, Q), Math.min(R, S))));\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n}\n\nclass FastScanner {\n private InputStream in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n public FastScanner(InputStream in) {\n\t\tthis.in = in;\n\t}\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() {\n \tif (hasNextByte()) return buffer[ptr++];\n \telse return -1;\n }\n private static boolean isPrintableChar(int c){\n \treturn 33 <= c && c <= 126;\n }\n public boolean hasNext() {\n \twhile(hasNextByte() && !isPrintableChar(buffer[ptr]))\n \t\tptr++; return hasNextByte();\n }\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() {\n \treturn Double.parseDouble(next());\n }\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will make three cuts in A and divide it into four (non-empty) contiguous subsequences B, C, D and E.\nThe positions of the cuts can be freely chosen.\n\nLet P,Q,R,S be the sums of the elements in B,C,D,E, respectively.\nSnuke is happier when the absolute difference of the maximum and the minimum among P,Q,R,S is smaller.\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nConstraints\n\n4 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nSample Input 1\n\n5\n3 2 4 1 2\n\nSample Output 1\n\n2\n\nIf we divide A as B,C,D,E=(3),(2),(4),(1,2), then P=3,Q=2,R=4,S=1+2=3.\nHere, the maximum and the minimum among P,Q,R,S are 4 and 2, with the absolute difference of 2.\nWe cannot make the absolute difference of the maximum and the minimum less than 2, so the answer is 2.\n\nSample Input 2\n\n10\n10 71 84 33 6 47 23 25 52 64\n\nSample Output 2\n\n36\n\nSample Input 3\n\n7\n1 2 3 1000000000 4 5 6\n\nSample Output 3\n\n999999994", "sample_input": "5\n3 2 4 1 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03310", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will make three cuts in A and divide it into four (non-empty) contiguous subsequences B, C, D and E.\nThe positions of the cuts can be freely chosen.\n\nLet P,Q,R,S be the sums of the elements in B,C,D,E, respectively.\nSnuke is happier when the absolute difference of the maximum and the minimum among P,Q,R,S is smaller.\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nConstraints\n\n4 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nSample Input 1\n\n5\n3 2 4 1 2\n\nSample Output 1\n\n2\n\nIf we divide A as B,C,D,E=(3),(2),(4),(1,2), then P=3,Q=2,R=4,S=1+2=3.\nHere, the maximum and the minimum among P,Q,R,S are 4 and 2, with the absolute difference of 2.\nWe cannot make the absolute difference of the maximum and the minimum less than 2, so the answer is 2.\n\nSample Input 2\n\n10\n10 71 84 33 6 47 23 25 52 64\n\nSample Output 2\n\n36\n\nSample Input 3\n\n7\n1 2 3 1000000000 4 5 6\n\nSample Output 3\n\n999999994", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3392, "cpu_time_ms": 2108, "memory_kb": 26816}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s291822647", "group_id": "codeNet:p03315", "input_text": "import java.util.*;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tint t = 0;\n\t\t\n\t\tString S = new java.util.Scanner(System.in).nextLine();\n\t\tString[] ar = S.split(\"\");\n\t\tfor(int i=0;i<4;i++) {\n\t\t\tif(ar[i] == \"+\") {\n\t\t\t\tt++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tt--;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(t);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1529805350, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03315.html", "problem_id": "p03315", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03315/input.txt", "sample_output_relpath": "derived/input_output/data/p03315/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03315/Java/s291822647.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s291822647", "user_id": "u990653216"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tint t = 0;\n\t\t\n\t\tString S = new java.util.Scanner(System.in).nextLine();\n\t\tString[] ar = S.split(\"\");\n\t\tfor(int i=0;i<4;i++) {\n\t\t\tif(ar[i] == \"+\") {\n\t\t\t\tt++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tt--;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(t);\n\t}\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "sample_input": "+-++\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03315", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 92, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s381973231", "group_id": "codeNet:p03316", "input_text": "import java.util.*;\n public class Main{\n\tpublic static void main(String[] args){\n\t Scanner scan = new Scanner(System.in);\n\t String numM = scan.next();\n\t int origin = Integer.parseInt(numM);\n\t int startNum = 0;\n\t\t\n\t for(int i =0;i 50000){\n break;\n }\n boolean sunukeCheckFlag = true;\n for (int m =n+1; m <=54000; m++){\n if (nPerSn(n) <= nPerSn(m)){\n continue;\n }else{\n sunukeCheckFlag = false;\n break;\n }\n }\n if (sunukeCheckFlag){\n System.out.println(n);\n count++;\n n++;\n }else {\n n++;\n }\n }\n }\n public static double nPerSn(int num){\n\n double Sn = 0;\n int cNum = num;\n while (cNum != 0){\n Sn += (cNum % 10);\n cNum /= 10;\n }\n return num / Sn;\n }\n}", "language": "Java", "metadata": {"date": 1529891747, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03318.html", "problem_id": "p03318", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03318/input.txt", "sample_output_relpath": "derived/input_output/data/p03318/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03318/Java/s519241076.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s519241076", "user_id": "u427344224"}, "prompt_components": {"gold_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n", "input_to_evaluate": "\n\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sr = new Scanner(System.in);\n String inputLine = sr.nextLine();\n Integer K = Integer.valueOf(inputLine);\n int count = 0;\n int n = 1;\n while (count != K) {\n if (n > 50000){\n break;\n }\n boolean sunukeCheckFlag = true;\n for (int m =n+1; m <=54000; m++){\n if (nPerSn(n) <= nPerSn(m)){\n continue;\n }else{\n sunukeCheckFlag = false;\n break;\n }\n }\n if (sunukeCheckFlag){\n System.out.println(n);\n count++;\n n++;\n }else {\n n++;\n }\n }\n }\n public static double nPerSn(int num){\n\n double Sn = 0;\n int cNum = num;\n while (cNum != 0){\n Sn += (cNum % 10);\n cNum /= 10;\n }\n return num / Sn;\n }\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "sample_input": "10\n"}, "reference_outputs": ["1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n"], "source_document_id": "p03318", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1208, "cpu_time_ms": 184, "memory_kb": 19540}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s788864102", "group_id": "codeNet:p03319", "input_text": "import java.util.*;\nimport java.io.*;\nimport java.math.*;\npublic class Main\n{\n static class Reader \n { \n private InputStream mIs;private byte[] buf = new byte[1024];private int curChar,numChars;public Reader() { this(System.in); }public Reader(InputStream is) { mIs = is;} \n public int read() {if (numChars == -1) throw new InputMismatchException();if (curChar >= numChars) {curChar = 0;try { numChars = mIs.read(buf);} catch (IOException e) { throw new InputMismatchException();}if (numChars <= 0) return -1; }return buf[curChar++];} \n public String nextLine(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isEndOfLine(c));return res.toString() ;} \n public String s(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isSpaceChar(c));return res.toString();} \n public long l(){int c = read();while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }long res = 0; do{ if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read();}while(!isSpaceChar(c));return res * sgn;} \n public int i(){int c = read() ;while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }int res = 0;do{if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read() ;}while(!isSpaceChar(c));return res * sgn;} \n public double d() throws IOException {return Double.parseDouble(s()) ;}\n public boolean isSpaceChar(int c) { return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1; } \n public boolean isEndOfLine(int c) { return c == '\\n' || c == '\\r' || c == -1; } \n public int[] arr(int n){int[] ret = new int[n];for (int i = 0; i < n; i++) {ret[i] = i();}return ret;}\n }\n \n \n ///////////////////////////////////////////////////////////////////////////////////////////\n // RRRRRRRRR AAA HHH HHH IIIIIIIIIIIII LLL //\n // RR RRR AAAAA HHH HHH IIIIIIIIIII LLL //\n // RR RRR AAAAAAA HHH HHH III LLL //\n // RR RRR AAA AAA HHHHHHHHHHH III LLL //\n // RRRRRR AAA AAA HHHHHHHHHHH III LLL //\n // RR RRR AAAAAAAAAAAAA HHH HHH III LLL //\n // RR RRR AAA AAA HHH HHH IIIIIIIIIII LLLLLLLLLLLL //\n // RR RRR AAA AAA HHH HHH IIIIIIIIIIIII LLLLLLLLLLLL //\n ///////////////////////////////////////////////////////////////////////////////////////////\n static int n;\n static int k;\n public static int counter1(int val)\n {\n if(val<=0)\n return 0;\n return 1+counter1(val-k+1);\n }\n public static int counter2(int val)\n {\n if(val>=n+1)\n return 0;\n return 1+counter2(val+k-1);\n }\n public static void main(String[] args)throws IOException\n {\n PrintWriter out= new PrintWriter(System.out);\n Reader sc=new Reader();\n n=sc.i();\n k=sc.i();\n int arr[]=sc.arr(n);\n int pos=0;\n for(int i=0;i= numChars) {curChar = 0;try { numChars = mIs.read(buf);} catch (IOException e) { throw new InputMismatchException();}if (numChars <= 0) return -1; }return buf[curChar++];} \n public String nextLine(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isEndOfLine(c));return res.toString() ;} \n public String s(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isSpaceChar(c));return res.toString();} \n public long l(){int c = read();while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }long res = 0; do{ if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read();}while(!isSpaceChar(c));return res * sgn;} \n public int i(){int c = read() ;while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }int res = 0;do{if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read() ;}while(!isSpaceChar(c));return res * sgn;} \n public double d() throws IOException {return Double.parseDouble(s()) ;}\n public boolean isSpaceChar(int c) { return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1; } \n public boolean isEndOfLine(int c) { return c == '\\n' || c == '\\r' || c == -1; } \n public int[] arr(int n){int[] ret = new int[n];for (int i = 0; i < n; i++) {ret[i] = i();}return ret;}\n }\n \n \n ///////////////////////////////////////////////////////////////////////////////////////////\n // RRRRRRRRR AAA HHH HHH IIIIIIIIIIIII LLL //\n // RR RRR AAAAA HHH HHH IIIIIIIIIII LLL //\n // RR RRR AAAAAAA HHH HHH III LLL //\n // RR RRR AAA AAA HHHHHHHHHHH III LLL //\n // RRRRRR AAA AAA HHHHHHHHHHH III LLL //\n // RR RRR AAAAAAAAAAAAA HHH HHH III LLL //\n // RR RRR AAA AAA HHH HHH IIIIIIIIIII LLLLLLLLLLLL //\n // RR RRR AAA AAA HHH HHH IIIIIIIIIIIII LLLLLLLLLLLL //\n ///////////////////////////////////////////////////////////////////////////////////////////\n static int n;\n static int k;\n public static int counter1(int val)\n {\n if(val<=0)\n return 0;\n return 1+counter1(val-k+1);\n }\n public static int counter2(int val)\n {\n if(val>=n+1)\n return 0;\n return 1+counter2(val+k-1);\n }\n public static void main(String[] args)throws IOException\n {\n PrintWriter out= new PrintWriter(System.out);\n Reader sc=new Reader();\n n=sc.i();\n k=sc.i();\n int arr[]=sc.arr(n);\n int pos=0;\n for(int i=0;i= n) {\n System.out.println(1);\n } else {\n int r = (int) Math.ceil(((n - k) / (double) (k - 1)) + 1);\n System.out.println(r);\n }\n }\n }\n\n public static void main(String[] args) {\n new Solver();\n }\n}", "language": "Java", "metadata": {"date": 1529802845, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03319.html", "problem_id": "p03319", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03319/input.txt", "sample_output_relpath": "derived/input_output/data/p03319/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03319/Java/s616829988.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s616829988", "user_id": "u556718820"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static class Solver {\n int n;\n int k;\n public Solver() {\n Scanner sc = new Scanner(System.in);\n\n n = sc.nextInt();\n k = sc.nextInt();\n\n for (int i = 0 ; i < n ; i ++) {\n sc.nextInt();\n }\n\n if (k >= n) {\n System.out.println(1);\n } else {\n int r = (int) Math.ceil(((n - k) / (double) (k - 1)) + 1);\n System.out.println(r);\n }\n }\n }\n\n public static void main(String[] args) {\n new Solver();\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "sample_input": "4 3\n2 3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03319", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 642, "cpu_time_ms": 431, "memory_kb": 48604}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s181841125", "group_id": "codeNet:p03320", "input_text": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main\n{\n\n public static void main(String[] args) throws IOException\n {\n BufferedReader r = new BufferedReader(new InputStreamReader(System.in), 1);\n String s = r.readLine();\n int k = Integer.parseInt(s);\n\n int l[] = new int[200];\n int d[] = new int[200];\n int z[] = new int[200];\n\n l[0] = l[1] = 1;\n d[0] = d[1] = 9;\n z[0] = 9;\n z[1] = 18;\n for(int i = 2; i < 200; i++)\n {\n l[i] = i - 1;\n d[i] = (i - 1) * 10 + 9;\n z[i] = z[i - 1] + d[i] - l[i] + 1;\n }\n\n int v = 0;\n int a = 0;\n for(int i = 0; i < k; i++)\n {\n if(z[v] <= i)\n {\n v++;\n a = 0;\n }\n\n System.out.print(l[v] + a);\n for(int j = 0; j < v; j++)\n {\n System.out.print(9);\n }\n System.out.println();\n a++;\n }\n }\n\n}", "language": "Java", "metadata": {"date": 1529807743, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03320.html", "problem_id": "p03320", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03320/input.txt", "sample_output_relpath": "derived/input_output/data/p03320/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03320/Java/s181841125.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s181841125", "user_id": "u974426361"}, "prompt_components": {"gold_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n", "input_to_evaluate": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main\n{\n\n public static void main(String[] args) throws IOException\n {\n BufferedReader r = new BufferedReader(new InputStreamReader(System.in), 1);\n String s = r.readLine();\n int k = Integer.parseInt(s);\n\n int l[] = new int[200];\n int d[] = new int[200];\n int z[] = new int[200];\n\n l[0] = l[1] = 1;\n d[0] = d[1] = 9;\n z[0] = 9;\n z[1] = 18;\n for(int i = 2; i < 200; i++)\n {\n l[i] = i - 1;\n d[i] = (i - 1) * 10 + 9;\n z[i] = z[i - 1] + d[i] - l[i] + 1;\n }\n\n int v = 0;\n int a = 0;\n for(int i = 0; i < k; i++)\n {\n if(z[v] <= i)\n {\n v++;\n a = 0;\n }\n\n System.out.print(l[v] + a);\n for(int j = 0; j < v; j++)\n {\n System.out.print(9);\n }\n System.out.println();\n a++;\n }\n }\n\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "sample_input": "10\n"}, "reference_outputs": ["1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n"], "source_document_id": "p03320", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 912, "cpu_time_ms": 132, "memory_kb": 20692}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s321945820", "group_id": "codeNet:p03325", "input_text": "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n int N=sc.nextInt();\n int ANS=0;\n \n for(int i=0;i> i) & 1) == 1){\n flag[i] = true;\n }\n }\n\n long sum = 0;\n long[] select = new long[N];\n for(int i = 0; i < N; i++){\n if(flag[0]){\n select[i] += x[i];\n } else {\n select[i] -= x[i];\n }\n if(flag[1]){\n select[i] += y[i];\n } else {\n select[i] -= y[i];\n }\n if(flag[2]){\n select[i] += z[i];\n } else {\n select[i] -= z[i];\n }\n }\n sort(select);\n for(int i = N - 1; i >= N - M; i--){\n sum += select[i];\n }\n\n ans = max(ans, sum);\n\n }\n\n out.println(ans);\n\n\n out.flush();\n } \n\n\n public static void main(String[] args){\n Main m = new Main();\n m.solve();\n }\n\n Main(){\n this.scan = new FastScanner();\n this.out = new PrintWriter(System.out);\n }\n\n private FastScanner scan;\n private PrintWriter out;\n private final int MOD = 1_000_000_007;\n private final int INF = 2_147_483_647;\n private final long LINF = 9223372036854775807L;\n private long[] fac;\n private long[] finv;\n private long[] inv;\n\n // Scanner\n int ni(){ return scan.nextInt();}\n int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}\n int[][] ni(int y, int x){int[][] a = new int[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}\n long nl(){return scan.nextLong();}\n long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}\n long[][] nl(int y, int x){long[][] a = new long[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}\n String ns(){return scan.next();}\n String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}\n String[][] ns(int y, int x){String[][] a = new String[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}\n\n // Mathematics\n int max(int a, int b){return Math.max(a, b);}\n long max(long a, long b){return Math.max(a, b);}\n double max(double a, double b){return Math.max(a, b);}\n int max(int[] a){int max = a[0]; for(int value:a){max = max(max,value);} return max;}\n long max(long[] a){long max = a[0]; for(long value:a){max = max(max,value);} return max;}\n double max(double[] a){double max = a[0]; for(double value:a){max = max(max,value);} return max;}\n int min(int a, int b){return Math.min(a, b);}\n long min(long a, long b){return Math.min(a, b);}\n double min(double a, double b){return Math.min(a, b);}\n int min(int[] a){int min = a[0]; for(int value:a){min = min(min,value);} return min;}\n long min(long[] a){long min = a[0]; for(long value:a){min = min(min,value);} return min;}\n double min(double[] a){double min = a[0]; for(double value:a){min = min(min,value);} return min;}\n long sum(int[] a){long sum = 0; for(int value:a){sum += value;} return sum;}\n long sum(long[] a){long sum = 0; for(long value:a){sum += value;} return sum;}\n double sum(double[] a){double sum = 0; for(double value:a){sum += value;} return sum;}\n long mod(long n) { n %= MOD; return n + (n < 0 ? MOD : 0); }\n int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}\n long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}\n int lcm(int a, int b){return a / gcd(a, b) * b;}\n long lcm(long a, long b){return a / gcd(a, b) * b;}\n long fact(int n){ if(n == 0){ return 1; } long a = n; for(long i = n - 1; i >= 2; i--){ a = a % MOD * i; } return a; }\n long fact(long n){ if(n == 0){ return 1; } long a = n; for(long i = n - 1; i >= 2; i--){ a = a % MOD * i; } return a; }\n // nPr(int)\n long npr(int n, int r){\n long a = 1;\n for(int i = n; i > n - r; i--){\n a *= i;\n }\n return a;\n }\n // nPr(long)\n long npr(long n, long r){\n long a = 1;\n for(long i = n; i > n - r; i--){\n a *= i;\n }\n return a;\n }\n // 素数判定(int)\n boolean checkPrime(int n){\n for(int i = 2; i * i <= n; i++){\n if(n % i == 0){\n return false;\n }\n }\n return true;\n }\n // 素数判定(long)\n boolean checkPrime(long n){\n for(long i = 2; i * i <= n; i++){\n if(n % i == 0){\n return false;\n }\n }\n return true;\n }\n // エラトステネスの篩\n long[] erathos(int n){\n boolean[] flag = new boolean[n + 1];\n TreeSet nums = new TreeSet<>();\n for(int i = 2; i <= n; i++){\n if(flag[i]) continue;\n nums.add(i);\n for(int j = i * 2; j <= n; j += i){\n flag[j] = true;\n }\n }\n long[] primes = new long[nums.size()];\n int index = 0;\n for(int num : nums){\n primes[index] = num;\n index++;\n }\n\n return primes;\n }\n\n // mod pにおける累乗 a^n\n long modpow(long a, long n, long p){\n long res = 1;\n while(n > 0){\n if((n & 1) == 1){\n res = res * a % p;\n }\n a = a * a % p;\n n = n >> 1;\n }\n return res;\n }\n // mod pにおけるaの逆元a^-1\n long modinv(long a, long p){\n return modpow(a, p - 2, p);\n }\n // fac,finv,invの初期化\n void comInit(int max){\n fac = new long[max];\n finv = new long[max];\n inv = new long[max];\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(int i = 2; i < max; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n // 二項係数nCr\n long com(int n, int r){\n if(n < r || (n < 0 || r < 0)){\n return 0;\n }\n return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;\n }\n // 二項係数nCr（nが10^9など巨大なとき用）\n long ncr(long n, long k){\n long a = 1;\n long b = 1;\n for(int i = 1; i <= k; i++){\n a = a * (n + 1 - i) % MOD;\n b = b * i % MOD;\n }\n \n return modinv(b, MOD) * a % MOD;\n }\n // 二次元上の二点間の距離\n double distance(double x1, double y1, double x2, double y2){\n double dist = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n return dist;\n }\n // 三次元上の二点間の距離\n double distance(double x1, double y1, double z1, double x2, double y2, double z2){\n double dist = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + (z1 - z2) * (z1 - z2));\n return dist;\n }\n\n\n // Array\n void sort(int[] a){ Arrays.sort(a);}\n void sort(long[] a){ Arrays.sort(a);}\n void sort(double[] a){ Arrays.sort(a);}\n void sort(String[] a){ Arrays.sort(a);}\n int[] reverse(int[] a){\n int[] reversed = new int[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n long[] reverse(long[] a){\n long[] reversed = new long[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n double[] reverse(double[] a){\n double[] reversed = new double[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n char[] reverse(char[] a){\n char[] reversed = new char[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n String[] reverse(String[] a){\n String[] reversed = new String[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n boolean[] reverse(boolean[] a){\n boolean[] reversed = new boolean[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n void fill(int[] array, int x) { Arrays.fill(array, x); }\n void fill(long[] array, long x) { Arrays.fill(array, x); }\n void fill(double[] array, double x) { Arrays.fill(array, x); }\n void fill(boolean[] array, boolean x) { Arrays.fill(array, x); }\n void fill(int[][] array, int x) { for(int a[] : array) { fill(a, x); } }\n void fill(long[][] array, long x) { for(long a[] : array) { fill(a, x); } }\n void fill(double[][] array, double x) { for(double a[] : array) { fill(a, x); } }\n void fill(boolean[][] array, boolean x) { for(boolean a[] : array) { fill(a, x); } }\n void fill(int[][][] array, int x) { for(int[][] ary : array) { for(int[] a : ary){ fill(a, x); } } }\n void fill(long[][][] array, long x) { for(long[][] ary : array) { for(long[] a : ary){ fill(a, x); } } }\n\n // Algorithm\n // 深さ優先探索\n /* void dfs(Node[] nodes, int v, boolean[] seen){\n seen[v] = true;\n \n for(Edge edge : nodes[v].edges){\n if(seen[edge.to]) continue;\n dfs(nodes, edge.to, seen);\n }\n\n } */\n // 幅優先探索\n long[] bfs(Node[] nodes, int start){\n Queue queue = new ArrayDeque<>();\n queue.add(start);\n long[] dist = new long[nodes.length];\n fill(dist, -1);\n dist[start] = 0;\n\n while(!queue.isEmpty()){\n int now = queue.poll();\n for(Edge edge : nodes[now].edges){\n if(dist[edge.to] != -1) continue;\n dist[edge.to] = dist[now] + 1;\n queue.add(edge.to);\n }\n }\n\n return dist;\n }\n \n // ダイクストラ法\n long[] dijkstra(Node[] nodes, int start){\n Queue queue = new PriorityQueue<>();\n long[] dist = new long[nodes.length];\n fill(dist, LINF / 2);\n dist[start] = 0;\n queue.add(new Edge(start, start, dist[start]));\n\n while(!queue.isEmpty()){\n Edge now = queue.poll(); \n if(dist[now.to] < now.cost) continue;\n for(Edge edge : nodes[now.to].edges){\n if(dist[edge.to] > dist[edge.from] + edge.cost){\n dist[edge.to] = dist[edge.from] + edge.cost;\n queue.add(new Edge(edge.from, edge.to, dist[edge.to]));\n nodes[edge.to].past = edge.from;\n }\n }\n }\n\n return dist;\n }\n \n // ソート済みint型配列でkey以上の値の最小indexを返す\n int lowerBound(int[] a, int key){\n int ng = -1;\n int ok = a.length;\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2; \n if(a[mid] >= key){\n ok = mid;\n } else {\n ng = mid;\n }\n }\n return ok;\n }\n // ソート済みlong型配列でkey以上の値の最小indexを返す\n int lowerBound(long[] a, long key){\n int ng = -1;\n int ok = a.length;\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2; \n if(a[mid] >= key){\n ok = mid;\n } else {\n ng = mid;\n }\n }\n return ok;\n }\n // 文字列sとtの最長共通部分列の長さを返す\n int lcs(String s , String t){\n int[][] dp = new int[s.length() + 1][t.length() + 1];\n\n for(int i = 0; i < s.length(); i++){\n for(int j = 0; j < t.length(); j++){\n if(s.charAt(i) == t.charAt(j)){\n dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i + 1][j + 1]);\n }\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i + 1][j]);\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j + 1]);\n }\n }\n\n return dp[s.length()][t.length()];\n }\n\n}\n\n// ノード\nclass Node{\n int id; // ノード番号\n int past; // 直前の頂点\n List edges; // 辺のリスト\n\n Node(int id, int past){\n this.id = id;\n this.past = past;\n this.edges = new ArrayList<>();\n }\n void addEdge(Edge edge){\n edges.add(edge);\n }\n\n public boolean equals(Object obj){\n if(obj instanceof Node){\n Node node = (Node)obj;\n return this.id == node.id;\n } \n return false;\n }\n public int hashCode(){\n return id;\n }\n public String toString(){\n return \"[id:\" + id + \" past: \" + past + \"]\";\n }\n}\n\n// 辺の情報を持つクラス\nclass Edge implements Comparable{\n int from; // どの頂点から\n int to; // どの頂点へ\n long cost; // 辺の重み\n\n Edge(int from, int to, long cost){\n this.from = from;\n this.to = to;\n this.cost = cost;\n }\n public int compareTo(Edge edge){\n return Long.compare(this.cost, edge.cost);\n }\n\n public String toString(){\n return \"[\" + from + \" to \" + to + \" cost:\" + cost + \"]\";\n }\n}\n// 辺の重み比較のComparator\nclass EdgeComparator implements Comparator{\n @Override\n public int compare(Edge e1, Edge e2){\n long cost1 = e1.cost;\n long cost2 = e2.cost;\n if(cost1 < cost2){\n return -1;\n } else if(cost1 > cost2){\n return 1;\n } else {\n return 0;\n }\n }\n}\n// Union-Find\nclass UnionFind{\n int[] par;\n int[] size;\n UnionFind(int N){\n par = new int[N];\n size = new int[N];\n for(int i = 0; i < N; i++){\n par[i] = i;\n size[i] = 1;\n }\n }\n\n void init(int N){\n for(int i = 0; i < N; i++){\n par[i] = i;\n size[i] = 1;\n }\n }\n\n int root(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = root(par[x]);\n }\n }\n\n boolean same(int x, int y){\n return root(x) == root(y);\n }\n\n void unite(int x, int y){\n x = root(x);\n y = root(y);\n if(x == y) return;\n if(size[x] < size[y]){\n int tmp = x;\n x = y;\n y = tmp;\n }\n size[x] += size[y];\n par[y] = x;\n }\n\n int size(int x){\n return size[root(x)];\n }\n\n}\n\n// 順列を管理する\nclass Permutation {\n private int number;\n private int listSize;\n private int searched;\n private int nextIndex;\n private int[][] permList;\n\n Permutation(int num) {\n this.number = num;\n this.listSize = this.fact(this.number);\n this.searched = 0;\n this.nextIndex = 0;\n this.permList = new int[this.listSize][this.number];\n\n this.create(0, new int[this.number], new boolean[this.number]);\n }\n\n int[] nextPerm() {\n return permList[this.nextIndex++];\n }\n\n boolean isNext() {\n if(this.nextIndex < this.listSize) {\n return true;\n } else {\n this.nextIndex = 0;\n return false;\n }\n }\n\n int fact(int n){\n return n == 0 ? 1 : n * fact(n-1);\n }\n\n void create(int num, int[] list, boolean[] flag) {\n if(num == this.number) {\n copyArray(list, permList[this.searched]);\n this.searched++;\n }\n for(int i = 0; i < this.number; i++){\n if(flag[i]) continue;\n list[num] = i;\n flag[i] = true;\n this.create(num+1, list, flag);\n flag[i] = false;\n\n }\n }\n\n void copyArray(int[] from, int[] to) {\n for(int i=0; i 0){\n i = i >> 1; // 1ビットぶん右シフト\n dat[i] = Math.min(dat[i << 1], dat[(i << 1) + 1]);\n }\n }\n\n public String toString(){\n StringBuilder sb = new StringBuilder(\"[\");\n for(int i = size; i < 2 * size; i++){\n sb.append(dat[i]).append(\",\");\n }\n sb.delete(sb.length() - 1, sb.length());\n String output = sb.append(\"]\").toString();\n return output;\n }\n} */\n\n// Range Sum Queryを実現するBinary Indexed Tree\nclass BIT{\n int[] tree;\n\n BIT(int N){\n this.tree = new int[N + 1];\n }\n\n int sum(int i){\n int sum = 0;\n while(i > 0){\n sum += this.tree[i];\n i -= i & -i;\n }\n return sum;\n }\n\n void add(int i, int x){\n while(i <= tree.length){\n this.tree[i] += x;\n i += i & -i;\n }\n }\n\n public String toString(){\n StringBuilder sb = new StringBuilder(\"[\");\n for(int i = 0; i < tree.length; i++){\n sb.append(tree[i] + \",\");\n }\n sb.append(\"]\");\n String output = sb.toString();\n return output;\n }\n \n}\n\n// 標準のScannerより高速に標準入力する\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}", "language": "Java", "metadata": {"date": 1583977963, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03326.html", "problem_id": "p03326", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03326/input.txt", "sample_output_relpath": "derived/input_output/data/p03326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03326/Java/s759054525.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s759054525", "user_id": "u581625805"}, "prompt_components": {"gold_output": "56\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\nclass Main{\n\n void solve(){\n int N = ni();\n int M = ni();\n long[] x = new long[N];\n long[] y = new long[N];\n long[] z = new long[N];\n for(int i = 0; i < N; i++){ \n x[i] = nl();\n y[i] = nl();\n z[i] = nl();\n }\n\n long ans = 0;\n for(int bit = 0; bit < (1 << 3); bit++){\n boolean[] flag = new boolean[3];\n for(int i = 0; i < 3; i++){\n if(((bit >> i) & 1) == 1){\n flag[i] = true;\n }\n }\n\n long sum = 0;\n long[] select = new long[N];\n for(int i = 0; i < N; i++){\n if(flag[0]){\n select[i] += x[i];\n } else {\n select[i] -= x[i];\n }\n if(flag[1]){\n select[i] += y[i];\n } else {\n select[i] -= y[i];\n }\n if(flag[2]){\n select[i] += z[i];\n } else {\n select[i] -= z[i];\n }\n }\n sort(select);\n for(int i = N - 1; i >= N - M; i--){\n sum += select[i];\n }\n\n ans = max(ans, sum);\n\n }\n\n out.println(ans);\n\n\n out.flush();\n } \n\n\n public static void main(String[] args){\n Main m = new Main();\n m.solve();\n }\n\n Main(){\n this.scan = new FastScanner();\n this.out = new PrintWriter(System.out);\n }\n\n private FastScanner scan;\n private PrintWriter out;\n private final int MOD = 1_000_000_007;\n private final int INF = 2_147_483_647;\n private final long LINF = 9223372036854775807L;\n private long[] fac;\n private long[] finv;\n private long[] inv;\n\n // Scanner\n int ni(){ return scan.nextInt();}\n int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}\n int[][] ni(int y, int x){int[][] a = new int[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}\n long nl(){return scan.nextLong();}\n long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}\n long[][] nl(int y, int x){long[][] a = new long[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}\n String ns(){return scan.next();}\n String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}\n String[][] ns(int y, int x){String[][] a = new String[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}\n\n // Mathematics\n int max(int a, int b){return Math.max(a, b);}\n long max(long a, long b){return Math.max(a, b);}\n double max(double a, double b){return Math.max(a, b);}\n int max(int[] a){int max = a[0]; for(int value:a){max = max(max,value);} return max;}\n long max(long[] a){long max = a[0]; for(long value:a){max = max(max,value);} return max;}\n double max(double[] a){double max = a[0]; for(double value:a){max = max(max,value);} return max;}\n int min(int a, int b){return Math.min(a, b);}\n long min(long a, long b){return Math.min(a, b);}\n double min(double a, double b){return Math.min(a, b);}\n int min(int[] a){int min = a[0]; for(int value:a){min = min(min,value);} return min;}\n long min(long[] a){long min = a[0]; for(long value:a){min = min(min,value);} return min;}\n double min(double[] a){double min = a[0]; for(double value:a){min = min(min,value);} return min;}\n long sum(int[] a){long sum = 0; for(int value:a){sum += value;} return sum;}\n long sum(long[] a){long sum = 0; for(long value:a){sum += value;} return sum;}\n double sum(double[] a){double sum = 0; for(double value:a){sum += value;} return sum;}\n long mod(long n) { n %= MOD; return n + (n < 0 ? MOD : 0); }\n int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}\n long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}\n int lcm(int a, int b){return a / gcd(a, b) * b;}\n long lcm(long a, long b){return a / gcd(a, b) * b;}\n long fact(int n){ if(n == 0){ return 1; } long a = n; for(long i = n - 1; i >= 2; i--){ a = a % MOD * i; } return a; }\n long fact(long n){ if(n == 0){ return 1; } long a = n; for(long i = n - 1; i >= 2; i--){ a = a % MOD * i; } return a; }\n // nPr(int)\n long npr(int n, int r){\n long a = 1;\n for(int i = n; i > n - r; i--){\n a *= i;\n }\n return a;\n }\n // nPr(long)\n long npr(long n, long r){\n long a = 1;\n for(long i = n; i > n - r; i--){\n a *= i;\n }\n return a;\n }\n // 素数判定(int)\n boolean checkPrime(int n){\n for(int i = 2; i * i <= n; i++){\n if(n % i == 0){\n return false;\n }\n }\n return true;\n }\n // 素数判定(long)\n boolean checkPrime(long n){\n for(long i = 2; i * i <= n; i++){\n if(n % i == 0){\n return false;\n }\n }\n return true;\n }\n // エラトステネスの篩\n long[] erathos(int n){\n boolean[] flag = new boolean[n + 1];\n TreeSet nums = new TreeSet<>();\n for(int i = 2; i <= n; i++){\n if(flag[i]) continue;\n nums.add(i);\n for(int j = i * 2; j <= n; j += i){\n flag[j] = true;\n }\n }\n long[] primes = new long[nums.size()];\n int index = 0;\n for(int num : nums){\n primes[index] = num;\n index++;\n }\n\n return primes;\n }\n\n // mod pにおける累乗 a^n\n long modpow(long a, long n, long p){\n long res = 1;\n while(n > 0){\n if((n & 1) == 1){\n res = res * a % p;\n }\n a = a * a % p;\n n = n >> 1;\n }\n return res;\n }\n // mod pにおけるaの逆元a^-1\n long modinv(long a, long p){\n return modpow(a, p - 2, p);\n }\n // fac,finv,invの初期化\n void comInit(int max){\n fac = new long[max];\n finv = new long[max];\n inv = new long[max];\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(int i = 2; i < max; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n // 二項係数nCr\n long com(int n, int r){\n if(n < r || (n < 0 || r < 0)){\n return 0;\n }\n return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;\n }\n // 二項係数nCr（nが10^9など巨大なとき用）\n long ncr(long n, long k){\n long a = 1;\n long b = 1;\n for(int i = 1; i <= k; i++){\n a = a * (n + 1 - i) % MOD;\n b = b * i % MOD;\n }\n \n return modinv(b, MOD) * a % MOD;\n }\n // 二次元上の二点間の距離\n double distance(double x1, double y1, double x2, double y2){\n double dist = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n return dist;\n }\n // 三次元上の二点間の距離\n double distance(double x1, double y1, double z1, double x2, double y2, double z2){\n double dist = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + (z1 - z2) * (z1 - z2));\n return dist;\n }\n\n\n // Array\n void sort(int[] a){ Arrays.sort(a);}\n void sort(long[] a){ Arrays.sort(a);}\n void sort(double[] a){ Arrays.sort(a);}\n void sort(String[] a){ Arrays.sort(a);}\n int[] reverse(int[] a){\n int[] reversed = new int[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n long[] reverse(long[] a){\n long[] reversed = new long[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n double[] reverse(double[] a){\n double[] reversed = new double[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n char[] reverse(char[] a){\n char[] reversed = new char[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n String[] reverse(String[] a){\n String[] reversed = new String[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n boolean[] reverse(boolean[] a){\n boolean[] reversed = new boolean[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n void fill(int[] array, int x) { Arrays.fill(array, x); }\n void fill(long[] array, long x) { Arrays.fill(array, x); }\n void fill(double[] array, double x) { Arrays.fill(array, x); }\n void fill(boolean[] array, boolean x) { Arrays.fill(array, x); }\n void fill(int[][] array, int x) { for(int a[] : array) { fill(a, x); } }\n void fill(long[][] array, long x) { for(long a[] : array) { fill(a, x); } }\n void fill(double[][] array, double x) { for(double a[] : array) { fill(a, x); } }\n void fill(boolean[][] array, boolean x) { for(boolean a[] : array) { fill(a, x); } }\n void fill(int[][][] array, int x) { for(int[][] ary : array) { for(int[] a : ary){ fill(a, x); } } }\n void fill(long[][][] array, long x) { for(long[][] ary : array) { for(long[] a : ary){ fill(a, x); } } }\n\n // Algorithm\n // 深さ優先探索\n /* void dfs(Node[] nodes, int v, boolean[] seen){\n seen[v] = true;\n \n for(Edge edge : nodes[v].edges){\n if(seen[edge.to]) continue;\n dfs(nodes, edge.to, seen);\n }\n\n } */\n // 幅優先探索\n long[] bfs(Node[] nodes, int start){\n Queue queue = new ArrayDeque<>();\n queue.add(start);\n long[] dist = new long[nodes.length];\n fill(dist, -1);\n dist[start] = 0;\n\n while(!queue.isEmpty()){\n int now = queue.poll();\n for(Edge edge : nodes[now].edges){\n if(dist[edge.to] != -1) continue;\n dist[edge.to] = dist[now] + 1;\n queue.add(edge.to);\n }\n }\n\n return dist;\n }\n \n // ダイクストラ法\n long[] dijkstra(Node[] nodes, int start){\n Queue queue = new PriorityQueue<>();\n long[] dist = new long[nodes.length];\n fill(dist, LINF / 2);\n dist[start] = 0;\n queue.add(new Edge(start, start, dist[start]));\n\n while(!queue.isEmpty()){\n Edge now = queue.poll(); \n if(dist[now.to] < now.cost) continue;\n for(Edge edge : nodes[now.to].edges){\n if(dist[edge.to] > dist[edge.from] + edge.cost){\n dist[edge.to] = dist[edge.from] + edge.cost;\n queue.add(new Edge(edge.from, edge.to, dist[edge.to]));\n nodes[edge.to].past = edge.from;\n }\n }\n }\n\n return dist;\n }\n \n // ソート済みint型配列でkey以上の値の最小indexを返す\n int lowerBound(int[] a, int key){\n int ng = -1;\n int ok = a.length;\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2; \n if(a[mid] >= key){\n ok = mid;\n } else {\n ng = mid;\n }\n }\n return ok;\n }\n // ソート済みlong型配列でkey以上の値の最小indexを返す\n int lowerBound(long[] a, long key){\n int ng = -1;\n int ok = a.length;\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2; \n if(a[mid] >= key){\n ok = mid;\n } else {\n ng = mid;\n }\n }\n return ok;\n }\n // 文字列sとtの最長共通部分列の長さを返す\n int lcs(String s , String t){\n int[][] dp = new int[s.length() + 1][t.length() + 1];\n\n for(int i = 0; i < s.length(); i++){\n for(int j = 0; j < t.length(); j++){\n if(s.charAt(i) == t.charAt(j)){\n dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i + 1][j + 1]);\n }\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i + 1][j]);\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j + 1]);\n }\n }\n\n return dp[s.length()][t.length()];\n }\n\n}\n\n// ノード\nclass Node{\n int id; // ノード番号\n int past; // 直前の頂点\n List edges; // 辺のリスト\n\n Node(int id, int past){\n this.id = id;\n this.past = past;\n this.edges = new ArrayList<>();\n }\n void addEdge(Edge edge){\n edges.add(edge);\n }\n\n public boolean equals(Object obj){\n if(obj instanceof Node){\n Node node = (Node)obj;\n return this.id == node.id;\n } \n return false;\n }\n public int hashCode(){\n return id;\n }\n public String toString(){\n return \"[id:\" + id + \" past: \" + past + \"]\";\n }\n}\n\n// 辺の情報を持つクラス\nclass Edge implements Comparable{\n int from; // どの頂点から\n int to; // どの頂点へ\n long cost; // 辺の重み\n\n Edge(int from, int to, long cost){\n this.from = from;\n this.to = to;\n this.cost = cost;\n }\n public int compareTo(Edge edge){\n return Long.compare(this.cost, edge.cost);\n }\n\n public String toString(){\n return \"[\" + from + \" to \" + to + \" cost:\" + cost + \"]\";\n }\n}\n// 辺の重み比較のComparator\nclass EdgeComparator implements Comparator{\n @Override\n public int compare(Edge e1, Edge e2){\n long cost1 = e1.cost;\n long cost2 = e2.cost;\n if(cost1 < cost2){\n return -1;\n } else if(cost1 > cost2){\n return 1;\n } else {\n return 0;\n }\n }\n}\n// Union-Find\nclass UnionFind{\n int[] par;\n int[] size;\n UnionFind(int N){\n par = new int[N];\n size = new int[N];\n for(int i = 0; i < N; i++){\n par[i] = i;\n size[i] = 1;\n }\n }\n\n void init(int N){\n for(int i = 0; i < N; i++){\n par[i] = i;\n size[i] = 1;\n }\n }\n\n int root(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = root(par[x]);\n }\n }\n\n boolean same(int x, int y){\n return root(x) == root(y);\n }\n\n void unite(int x, int y){\n x = root(x);\n y = root(y);\n if(x == y) return;\n if(size[x] < size[y]){\n int tmp = x;\n x = y;\n y = tmp;\n }\n size[x] += size[y];\n par[y] = x;\n }\n\n int size(int x){\n return size[root(x)];\n }\n\n}\n\n// 順列を管理する\nclass Permutation {\n private int number;\n private int listSize;\n private int searched;\n private int nextIndex;\n private int[][] permList;\n\n Permutation(int num) {\n this.number = num;\n this.listSize = this.fact(this.number);\n this.searched = 0;\n this.nextIndex = 0;\n this.permList = new int[this.listSize][this.number];\n\n this.create(0, new int[this.number], new boolean[this.number]);\n }\n\n int[] nextPerm() {\n return permList[this.nextIndex++];\n }\n\n boolean isNext() {\n if(this.nextIndex < this.listSize) {\n return true;\n } else {\n this.nextIndex = 0;\n return false;\n }\n }\n\n int fact(int n){\n return n == 0 ? 1 : n * fact(n-1);\n }\n\n void create(int num, int[] list, boolean[] flag) {\n if(num == this.number) {\n copyArray(list, permList[this.searched]);\n this.searched++;\n }\n for(int i = 0; i < this.number; i++){\n if(flag[i]) continue;\n list[num] = i;\n flag[i] = true;\n this.create(num+1, list, flag);\n flag[i] = false;\n\n }\n }\n\n void copyArray(int[] from, int[] to) {\n for(int i=0; i 0){\n i = i >> 1; // 1ビットぶん右シフト\n dat[i] = Math.min(dat[i << 1], dat[(i << 1) + 1]);\n }\n }\n\n public String toString(){\n StringBuilder sb = new StringBuilder(\"[\");\n for(int i = size; i < 2 * size; i++){\n sb.append(dat[i]).append(\",\");\n }\n sb.delete(sb.length() - 1, sb.length());\n String output = sb.append(\"]\").toString();\n return output;\n }\n} */\n\n// Range Sum Queryを実現するBinary Indexed Tree\nclass BIT{\n int[] tree;\n\n BIT(int N){\n this.tree = new int[N + 1];\n }\n\n int sum(int i){\n int sum = 0;\n while(i > 0){\n sum += this.tree[i];\n i -= i & -i;\n }\n return sum;\n }\n\n void add(int i, int x){\n while(i <= tree.length){\n this.tree[i] += x;\n i += i & -i;\n }\n }\n\n public String toString(){\n StringBuilder sb = new StringBuilder(\"[\");\n for(int i = 0; i < tree.length; i++){\n sb.append(tree[i] + \",\");\n }\n sb.append(\"]\");\n String output = sb.toString();\n return output;\n }\n \n}\n\n// 標準のScannerより高速に標準入力する\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nTakahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.\n\nThe shop sells N kinds of cakes.\n\nEach kind of cake has three parameters \"beauty\", \"tastiness\" and \"popularity\". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.\n\nThese values may be zero or negative.\n\nRingo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:\n\nDo not have two or more pieces of the same kind of cake.\n\nUnder the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).\n\nFind the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nConstraints\n\nN is an integer between 1 and 1 \\ 000 (inclusive).\n\nM is an integer between 0 and N (inclusive).\n\nx_i, y_i, z_i \\ (1 \\leq i \\leq N) are integers between -10 \\ 000 \\ 000 \\ 000 and 10 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1 z_1\nx_2 y_2 z_2\n: :\nx_N y_N z_N\n\nOutput\n\nPrint the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nSample Input 1\n\n5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n\nSample Output 1\n\n56\n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 3 + 9 = 13\n\nTastiness: 5 + 5 + 7 = 17\n\nPopularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 13 + 17 + 26 = 56. This is the maximum value.\n\nSample Input 2\n\n5 3\n1 -2 3\n-4 5 -6\n7 -8 -9\n-10 11 -12\n13 -14 15\n\nSample Output 2\n\n54\n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 7 + 13 = 21\n\nTastiness: (-2) + (-8) + (-14) = -24\n\nPopularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 21 + 24 + 9 = 54. This is the maximum value.\n\nSample Input 3\n\n10 5\n10 -80 21\n23 8 38\n-94 28 11\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-72 -50 59\n21 65 -32\n40 -94 87\n-62 18 82\n\nSample Output 3\n\n638\n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total beauty, tastiness and popularity will be -323, 66 and 249, respectively.\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 323 + 66 + 249 = 638. This is the maximum value.\n\nSample Input 4\n\n3 2\n2000000000 -9000000000 4000000000\n7000000000 -5000000000 3000000000\n6000000000 -1000000000 8000000000\n\nSample Output 4\n\n30000000000\n\nThe values of the beauty, tastiness and popularity of the cakes and the value to be printed may not fit into 32-bit integers.", "sample_input": "5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n"}, "reference_outputs": ["56\n"], "source_document_id": "p03326", "source_text": "Score: 400 points\n\nProblem Statement\n\nTakahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.\n\nThe shop sells N kinds of cakes.\n\nEach kind of cake has three parameters \"beauty\", \"tastiness\" and \"popularity\". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.\n\nThese values may be zero or negative.\n\nRingo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:\n\nDo not have two or more pieces of the same kind of cake.\n\nUnder the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).\n\nFind the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nConstraints\n\nN is an integer between 1 and 1 \\ 000 (inclusive).\n\nM is an integer between 0 and N (inclusive).\n\nx_i, y_i, z_i \\ (1 \\leq i \\leq N) are integers between -10 \\ 000 \\ 000 \\ 000 and 10 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1 z_1\nx_2 y_2 z_2\n: :\nx_N y_N z_N\n\nOutput\n\nPrint the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nSample Input 1\n\n5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n\nSample Output 1\n\n56\n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 3 + 9 = 13\n\nTastiness: 5 + 5 + 7 = 17\n\nPopularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 13 + 17 + 26 = 56. This is the maximum value.\n\nSample Input 2\n\n5 3\n1 -2 3\n-4 5 -6\n7 -8 -9\n-10 11 -12\n13 -14 15\n\nSample Output 2\n\n54\n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 7 + 13 = 21\n\nTastiness: (-2) + (-8) + (-14) = -24\n\nPopularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 21 + 24 + 9 = 54. This is the maximum value.\n\nSample Input 3\n\n10 5\n10 -80 21\n23 8 38\n-94 28 11\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-72 -50 59\n21 65 -32\n40 -94 87\n-62 18 82\n\nSample Output 3\n\n638\n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total beauty, tastiness and popularity will be -323, 66 and 249, respectively.\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 323 + 66 + 249 = 638. This is the maximum value.\n\nSample Input 4\n\n3 2\n2000000000 -9000000000 4000000000\n7000000000 -5000000000 3000000000\n6000000000 -1000000000 8000000000\n\nSample Output 4\n\n30000000000\n\nThe values of the beauty, tastiness and popularity of the cakes and the value to be printed may not fit into 32-bit integers.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 20735, "cpu_time_ms": 99, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s949612693", "group_id": "codeNet:p03327", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tif (n<=999) {\n\t\t\tSystem.out.println(\"ABC\");\n\t\t}\n\t\telse {\n\t\t\tSystem.out.println(\"ABD\");\n\t\t\n\t\t// your code goes here\n\t\t}\n }\n}\n", "language": "Java", "metadata": {"date": 1570958010, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03327.html", "problem_id": "p03327", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03327/input.txt", "sample_output_relpath": "derived/input_output/data/p03327/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03327/Java/s949612693.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s949612693", "user_id": "u060569392"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tif (n<=999) {\n\t\t\tSystem.out.println(\"ABC\");\n\t\t}\n\t\telse {\n\t\t\tSystem.out.println(\"ABD\");\n\t\t\n\t\t// your code goes here\n\t\t}\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "sample_input": "999\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03327", "source_text": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 328, "cpu_time_ms": 99, "memory_kb": 21588}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s048190947", "group_id": "codeNet:p03330", "input_text": "import java.util.*;\n\npublic class Main {\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint[][] matrix = new int[c + 1][c + 1];\n\t\tfor (int i = 1; i <= c; i++) {\n\t\t for (int j = 1; j <= c; j++) {\n\t\t matrix[i][j] = sc.nextInt();\n\t\t }\n\t\t}\n\t\tint[][] costs = new int[3][c + 1];\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t for (int j = 1; j <= n; j++) {\n\t\t int type = (i + j) % 3;\n\t\t int color = sc.nextInt();\n\t\t for (int k = 1; k <= c; k++) {\n\t\t costs[type][k] += matrix[color][k];\n\t\t }\n\t\t }\n\t\t}\n\t\tint min = Integer.MAX_VALUE;\n\t\tfor (int i = 1; i <= c; i++) {\n\t\t for (int j = 1; j <= c; j++) {\n\t\t if (i == j) {\n\t\t continue;\n\t\t }\n\t\t for (int k = 1; k <= c; k++) {\n\t\t if (i == k || j == k) {\n\t\t continue;\n\t\t }\n\t\t min = Math.min(min, costs[0][i] + costs[1][j] + costs[2][k]);\n\t\t }\n\t\t }\n\t\t}\n\t\tSystem.out.println(min);\n }\n}\n\n", "language": "Java", "metadata": {"date": 1587162050, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03330.html", "problem_id": "p03330", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03330/input.txt", "sample_output_relpath": "derived/input_output/data/p03330/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03330/Java/s048190947.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s048190947", "user_id": "u575909439"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint c = sc.nextInt();\n\t\tint[][] matrix = new int[c + 1][c + 1];\n\t\tfor (int i = 1; i <= c; i++) {\n\t\t for (int j = 1; j <= c; j++) {\n\t\t matrix[i][j] = sc.nextInt();\n\t\t }\n\t\t}\n\t\tint[][] costs = new int[3][c + 1];\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t for (int j = 1; j <= n; j++) {\n\t\t int type = (i + j) % 3;\n\t\t int color = sc.nextInt();\n\t\t for (int k = 1; k <= c; k++) {\n\t\t costs[type][k] += matrix[color][k];\n\t\t }\n\t\t }\n\t\t}\n\t\tint min = Integer.MAX_VALUE;\n\t\tfor (int i = 1; i <= c; i++) {\n\t\t for (int j = 1; j <= c; j++) {\n\t\t if (i == j) {\n\t\t continue;\n\t\t }\n\t\t for (int k = 1; k <= c; k++) {\n\t\t if (i == k || j == k) {\n\t\t continue;\n\t\t }\n\t\t min = Math.min(min, costs[0][i] + costs[1][j] + costs[2][k]);\n\t\t }\n\t\t }\n\t\t}\n\t\tSystem.out.println(min);\n }\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a grid with N rows and N columns of squares. Let (i,j) be the square at the i-th row from the top and the j-th column from the left.\n\nThese squares have to be painted in one of the C colors from Color 1 to Color C. Initially, (i,j) is painted in Color c_{i,j}.\n\nWe say the grid is a good grid when the following condition is met for all i,j,x,y satisfying 1 \\leq i,j,x,y \\leq N:\n\nIf (i+j) \\% 3=(x+y) \\% 3, the color of (i,j) and the color of (x,y) are the same.\n\nIf (i+j) \\% 3 \\neq (x+y) \\% 3, the color of (i,j) and the color of (x,y) are different.\n\nHere, X \\% Y represents X modulo Y.\n\nWe will repaint zero or more squares so that the grid will be a good grid.\n\nFor a square, the wrongness when the color of the square is X before repainting and Y after repainting, is D_{X,Y}.\n\nFind the minimum possible sum of the wrongness of all the squares.\n\nConstraints\n\n1 \\leq N \\leq 500\n\n3 \\leq C \\leq 30\n\n1 \\leq D_{i,j} \\leq 1000 (i \\neq j),D_{i,j}=0 (i=j)\n\n1 \\leq c_{i,j} \\leq C\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\nD_{1,1} ... D_{1,C}\n:\nD_{C,1} ... D_{C,C}\nc_{1,1} ... c_{1,N}\n:\nc_{N,1} ... c_{N,N}\n\nOutput\n\nIf the minimum possible sum of the wrongness of all the squares is x, print x.\n\nSample Input 1\n\n2 3\n0 1 1\n1 0 1\n1 4 0\n1 2\n3 3\n\nSample Output 1\n\n3\n\nRepaint (1,1) to Color 2. The wrongness of (1,1) becomes D_{1,2}=1.\n\nRepaint (1,2) to Color 3. The wrongness of (1,2) becomes D_{2,3}=1.\n\nRepaint (2,2) to Color 1. The wrongness of (2,2) becomes D_{3,1}=1.\n\nIn this case, the sum of the wrongness of all the squares is 3.\n\nNote that D_{i,j} \\neq D_{j,i} is possible.\n\nSample Input 2\n\n4 3\n0 12 71\n81 0 53\n14 92 0\n1 1 2 1\n2 1 1 2\n2 2 1 3\n1 1 2 2\n\nSample Output 2\n\n428", "sample_input": "2 3\n0 1 1\n1 0 1\n1 4 0\n1 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03330", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a grid with N rows and N columns of squares. Let (i,j) be the square at the i-th row from the top and the j-th column from the left.\n\nThese squares have to be painted in one of the C colors from Color 1 to Color C. Initially, (i,j) is painted in Color c_{i,j}.\n\nWe say the grid is a good grid when the following condition is met for all i,j,x,y satisfying 1 \\leq i,j,x,y \\leq N:\n\nIf (i+j) \\% 3=(x+y) \\% 3, the color of (i,j) and the color of (x,y) are the same.\n\nIf (i+j) \\% 3 \\neq (x+y) \\% 3, the color of (i,j) and the color of (x,y) are different.\n\nHere, X \\% Y represents X modulo Y.\n\nWe will repaint zero or more squares so that the grid will be a good grid.\n\nFor a square, the wrongness when the color of the square is X before repainting and Y after repainting, is D_{X,Y}.\n\nFind the minimum possible sum of the wrongness of all the squares.\n\nConstraints\n\n1 \\leq N \\leq 500\n\n3 \\leq C \\leq 30\n\n1 \\leq D_{i,j} \\leq 1000 (i \\neq j),D_{i,j}=0 (i=j)\n\n1 \\leq c_{i,j} \\leq C\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\nD_{1,1} ... D_{1,C}\n:\nD_{C,1} ... D_{C,C}\nc_{1,1} ... c_{1,N}\n:\nc_{N,1} ... c_{N,N}\n\nOutput\n\nIf the minimum possible sum of the wrongness of all the squares is x, print x.\n\nSample Input 1\n\n2 3\n0 1 1\n1 0 1\n1 4 0\n1 2\n3 3\n\nSample Output 1\n\n3\n\nRepaint (1,1) to Color 2. The wrongness of (1,1) becomes D_{1,2}=1.\n\nRepaint (1,2) to Color 3. The wrongness of (1,2) becomes D_{2,3}=1.\n\nRepaint (2,2) to Color 1. The wrongness of (2,2) becomes D_{3,1}=1.\n\nIn this case, the sum of the wrongness of all the squares is 3.\n\nNote that D_{i,j} \\neq D_{j,i} is possible.\n\nSample Input 2\n\n4 3\n0 12 71\n81 0 53\n14 92 0\n1 1 2 1\n2 1 1 2\n2 2 1 3\n1 1 2 2\n\nSample Output 2\n\n428", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1046, "cpu_time_ms": 598, "memory_kb": 78180}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s550368916", "group_id": "codeNet:p03334", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DChoosingPoints solver = new DChoosingPoints();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DChoosingPoints {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int d1 = in.nextInt();\n int d2 = in.nextInt();\n\n int cnt = 0;\n for (int i = 0; i < 2 * n; i++) {\n for (int j = 0; j < 2 * n; j++) {\n int tmpI = i;\n int tmpJ = j;\n int tmpD1 = d1;\n while (tmpD1 % 4 == 0) {\n tmpI /= 2;\n tmpJ /= 2;\n tmpD1 /= 4;\n }\n\n boolean flg1;\n if (tmpD1 % 2 == 1) {\n flg1 = (tmpI + tmpJ) % 2 == 0;\n } else {\n flg1 = tmpI % 2 == 0;\n }\n\n tmpI = i;\n tmpJ = j;\n int tmpD2 = d2;\n while (tmpD2 % 4 == 0) {\n tmpI /= 2;\n tmpJ /= 2;\n tmpD2 /= 4;\n }\n\n boolean flg2;\n if (tmpD1 % 2 == 1) {\n flg2 = (tmpI + tmpJ) % 2 == 0;\n } else {\n flg2 = tmpI % 2 == 0;\n }\n\n if (flg1 && flg2) {\n out.println(i + \" \" + j);\n cnt++;\n if (cnt == n * n) return;\n }\n }\n }\n }\n\n }\n\n static class InputReader {\n private BufferedReader br;\n private StringTokenizer st;\n\n public InputReader(InputStream inputStream) {\n br = new BufferedReader(new InputStreamReader(inputStream));\n st = new StringTokenizer(\"\");\n }\n\n public String nextString() {\n while (!st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine(), \" \");\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1532207060, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03334.html", "problem_id": "p03334", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03334/input.txt", "sample_output_relpath": "derived/input_output/data/p03334/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03334/Java/s550368916.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s550368916", "user_id": "u038084150"}, "prompt_components": {"gold_output": "0 0\n0 2\n2 0\n2 2\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DChoosingPoints solver = new DChoosingPoints();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DChoosingPoints {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int d1 = in.nextInt();\n int d2 = in.nextInt();\n\n int cnt = 0;\n for (int i = 0; i < 2 * n; i++) {\n for (int j = 0; j < 2 * n; j++) {\n int tmpI = i;\n int tmpJ = j;\n int tmpD1 = d1;\n while (tmpD1 % 4 == 0) {\n tmpI /= 2;\n tmpJ /= 2;\n tmpD1 /= 4;\n }\n\n boolean flg1;\n if (tmpD1 % 2 == 1) {\n flg1 = (tmpI + tmpJ) % 2 == 0;\n } else {\n flg1 = tmpI % 2 == 0;\n }\n\n tmpI = i;\n tmpJ = j;\n int tmpD2 = d2;\n while (tmpD2 % 4 == 0) {\n tmpI /= 2;\n tmpJ /= 2;\n tmpD2 /= 4;\n }\n\n boolean flg2;\n if (tmpD1 % 2 == 1) {\n flg2 = (tmpI + tmpJ) % 2 == 0;\n } else {\n flg2 = tmpI % 2 == 0;\n }\n\n if (flg1 && flg2) {\n out.println(i + \" \" + j);\n cnt++;\n if (cnt == n * n) return;\n }\n }\n }\n }\n\n }\n\n static class InputReader {\n private BufferedReader br;\n private StringTokenizer st;\n\n public InputReader(InputStream inputStream) {\n br = new BufferedReader(new InputStreamReader(inputStream));\n st = new StringTokenizer(\"\");\n }\n\n public String nextString() {\n while (!st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine(), \" \");\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextString());\n }\n\n }\n}\n\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nTakahashi is doing a research on sets of points in a plane.\nTakahashi thinks a set S of points in a coordinate plane is a good set when S satisfies both of the following conditions:\n\nThe distance between any two points in S is not \\sqrt{D_1}.\n\nThe distance between any two points in S is not \\sqrt{D_2}.\n\nHere, D_1 and D_2 are positive integer constants that Takahashi specified.\n\nLet X be a set of points (i,j) on a coordinate plane where i and j are integers and satisfy 0 ≤ i,j < 2N.\n\nTakahashi has proved that, for any choice of D_1 and D_2, there exists a way to choose N^2 points from X so that the chosen points form a good set.\nHowever, he does not know the specific way to choose such points to form a good set.\nFind a subset of X whose size is N^2 that forms a good set.\n\nConstraints\n\n1 ≤ N ≤ 300\n\n1 ≤ D_1 ≤ 2×10^5\n\n1 ≤ D_2 ≤ 2×10^5\n\nAll values in the input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D_1 D_2\n\nOutput\n\nPrint N^2 distinct points that satisfy the condition in the following format:\n\nx_1 y_1\nx_2 y_2\n:\nx_{N^2} y_{N^2}\n\nHere, (x_i,y_i) represents the i-th chosen point.\n0 ≤ x_i,y_i < 2N must hold, and they must be integers.\nThe chosen points may be printed in any order.\nIn case there are multiple possible solutions, you can output any.\n\nSample Input 1\n\n2 1 2\n\nSample Output 1\n\n0 0\n0 2\n2 0\n2 2\n\nAmong these points, the distance between 2 points is either 2 or 2\\sqrt{2}, thus it satisfies the condition.\n\nSample Input 2\n\n3 1 5\n\nSample Output 2\n\n0 0\n0 2\n0 4\n1 1\n1 3\n1 5\n2 0\n2 2\n2 4", "sample_input": "2 1 2\n"}, "reference_outputs": ["0 0\n0 2\n2 0\n2 2\n"], "source_document_id": "p03334", "source_text": "Score : 800 points\n\nProblem Statement\n\nTakahashi is doing a research on sets of points in a plane.\nTakahashi thinks a set S of points in a coordinate plane is a good set when S satisfies both of the following conditions:\n\nThe distance between any two points in S is not \\sqrt{D_1}.\n\nThe distance between any two points in S is not \\sqrt{D_2}.\n\nHere, D_1 and D_2 are positive integer constants that Takahashi specified.\n\nLet X be a set of points (i,j) on a coordinate plane where i and j are integers and satisfy 0 ≤ i,j < 2N.\n\nTakahashi has proved that, for any choice of D_1 and D_2, there exists a way to choose N^2 points from X so that the chosen points form a good set.\nHowever, he does not know the specific way to choose such points to form a good set.\nFind a subset of X whose size is N^2 that forms a good set.\n\nConstraints\n\n1 ≤ N ≤ 300\n\n1 ≤ D_1 ≤ 2×10^5\n\n1 ≤ D_2 ≤ 2×10^5\n\nAll values in the input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D_1 D_2\n\nOutput\n\nPrint N^2 distinct points that satisfy the condition in the following format:\n\nx_1 y_1\nx_2 y_2\n:\nx_{N^2} y_{N^2}\n\nHere, (x_i,y_i) represents the i-th chosen point.\n0 ≤ x_i,y_i < 2N must hold, and they must be integers.\nThe chosen points may be printed in any order.\nIn case there are multiple possible solutions, you can output any.\n\nSample Input 1\n\n2 1 2\n\nSample Output 1\n\n0 0\n0 2\n2 0\n2 2\n\nAmong these points, the distance between 2 points is either 2 or 2\\sqrt{2}, thus it satisfies the condition.\n\nSample Input 2\n\n3 1 5\n\nSample Output 2\n\n0 0\n0 2\n0 4\n1 1\n1 3\n1 5\n2 0\n2 2\n2 4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3085, "cpu_time_ms": 257, "memory_kb": 38428}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s784306966", "group_id": "codeNet:p03334", "input_text": "\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n private final int n;\n private final long d1;\n private final long d2;\n\n public Main(final int n, final long d1, final long d2) {\n this.n = n;\n this.d1 = d1;\n this.d2 = d2;\n }\n\n static class Pos {\n final long x;\n final long y;\n\n public Pos(final long x, final long y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public String toString() {\n return x + \" \" + y;\n }\n\n public long getX() {return this.x;}\n\n public long getY() {return this.y;}\n\n @Override\n public boolean equals(final Object o) {\n if (o == this) { return true; }\n if (!(o instanceof Pos)) { return false; }\n final Pos other = (Pos) o;\n if (!other.canEqual((Object) this)) { return false; }\n if (this.getX() != other.getX()) { return false; }\n if (this.getY() != other.getY()) { return false; }\n return true;\n }\n\n @Override\n public int hashCode() {\n final int PRIME = 59;\n int result = 1;\n final long $x = this.getX();\n result = result * PRIME + (int) ($x >>> 32 ^ $x);\n final long $y = this.getY();\n result = result * PRIME + (int) ($y >>> 32 ^ $y);\n return result;\n }\n\n protected boolean canEqual(final Object other) {return other instanceof Pos;}\n }\n\n public static void main(final String[] args) {\n final Scanner scanner = new Scanner(System.in);\n final int n = scanner.nextInt();\n final long d1 = scanner.nextLong();\n final long d2 = scanner.nextLong();\n\n final Main main = new Main(n, d1, d2);\n final List positions = main.main();\n positions.forEach(item -> System.out.println(item));\n }\n\n public List main() {\n final long d1arr[] = new long[n * 4 + 1];\n final long d2arr[] = new long[n * 4 + 1];\n\n final int[][] ints = new int[n * 2][n * 2];\n for (int i = 0; i < ints.length; ++i) {\n ints[i] = new int[n * 2];\n }\n\n for (int i = -n * 2; i < n * 2; ++i) {\n final long intsqrt1 = intsqrt(d1 - i * i);\n d1arr[i + n * 2] = intsqrt1;\n\n final long intsqrt2 = intsqrt(d2 - i * i);\n d2arr[i + n * 2] = intsqrt2;\n }\n\n final List positions = new ArrayList<>();\n for (int x = 0; x < n * 2; ++x) {\n for (int y = 0; y < n * 2; ++y) {\n if (ints[x][y] < 0) {\n continue;\n }\n positions.add(new Pos(x, y));\n\n for (int yd = -y; yd < n * 2 - y - 1; yd++) {\n final int y_ = n * 2 + yd;\n if (d1arr[y_] >= 0 && x + (int) d1arr[y_] < 2 * n) {\n ints[x + (int) d1arr[y_]][y + yd] = -1;\n }\n if (d2arr[y_] >= 0 && x + (int) d2arr[y_] < 2 * n) {\n ints[x + (int) d2arr[y_]][y + yd] = -1;\n }\n }\n if (positions.size() == n * n) {\n break;\n }\n }\n if (positions.size() == n * n) {\n break;\n }\n }\n return positions;\n\n }\n\n static long intsqrt(final long i) {\n for (long k = 0; k < i + 1; ++k) {\n if (i == k * k) {\n return k;\n }\n if (i < k * k) {\n return -1;\n }\n }\n return -1;\n }\n}\n", "language": "Java", "metadata": {"date": 1528085224, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03334.html", "problem_id": "p03334", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03334/input.txt", "sample_output_relpath": "derived/input_output/data/p03334/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03334/Java/s784306966.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s784306966", "user_id": "u561455725"}, "prompt_components": {"gold_output": "0 0\n0 2\n2 0\n2 2\n", "input_to_evaluate": "\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n private final int n;\n private final long d1;\n private final long d2;\n\n public Main(final int n, final long d1, final long d2) {\n this.n = n;\n this.d1 = d1;\n this.d2 = d2;\n }\n\n static class Pos {\n final long x;\n final long y;\n\n public Pos(final long x, final long y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public String toString() {\n return x + \" \" + y;\n }\n\n public long getX() {return this.x;}\n\n public long getY() {return this.y;}\n\n @Override\n public boolean equals(final Object o) {\n if (o == this) { return true; }\n if (!(o instanceof Pos)) { return false; }\n final Pos other = (Pos) o;\n if (!other.canEqual((Object) this)) { return false; }\n if (this.getX() != other.getX()) { return false; }\n if (this.getY() != other.getY()) { return false; }\n return true;\n }\n\n @Override\n public int hashCode() {\n final int PRIME = 59;\n int result = 1;\n final long $x = this.getX();\n result = result * PRIME + (int) ($x >>> 32 ^ $x);\n final long $y = this.getY();\n result = result * PRIME + (int) ($y >>> 32 ^ $y);\n return result;\n }\n\n protected boolean canEqual(final Object other) {return other instanceof Pos;}\n }\n\n public static void main(final String[] args) {\n final Scanner scanner = new Scanner(System.in);\n final int n = scanner.nextInt();\n final long d1 = scanner.nextLong();\n final long d2 = scanner.nextLong();\n\n final Main main = new Main(n, d1, d2);\n final List positions = main.main();\n positions.forEach(item -> System.out.println(item));\n }\n\n public List main() {\n final long d1arr[] = new long[n * 4 + 1];\n final long d2arr[] = new long[n * 4 + 1];\n\n final int[][] ints = new int[n * 2][n * 2];\n for (int i = 0; i < ints.length; ++i) {\n ints[i] = new int[n * 2];\n }\n\n for (int i = -n * 2; i < n * 2; ++i) {\n final long intsqrt1 = intsqrt(d1 - i * i);\n d1arr[i + n * 2] = intsqrt1;\n\n final long intsqrt2 = intsqrt(d2 - i * i);\n d2arr[i + n * 2] = intsqrt2;\n }\n\n final List positions = new ArrayList<>();\n for (int x = 0; x < n * 2; ++x) {\n for (int y = 0; y < n * 2; ++y) {\n if (ints[x][y] < 0) {\n continue;\n }\n positions.add(new Pos(x, y));\n\n for (int yd = -y; yd < n * 2 - y - 1; yd++) {\n final int y_ = n * 2 + yd;\n if (d1arr[y_] >= 0 && x + (int) d1arr[y_] < 2 * n) {\n ints[x + (int) d1arr[y_]][y + yd] = -1;\n }\n if (d2arr[y_] >= 0 && x + (int) d2arr[y_] < 2 * n) {\n ints[x + (int) d2arr[y_]][y + yd] = -1;\n }\n }\n if (positions.size() == n * n) {\n break;\n }\n }\n if (positions.size() == n * n) {\n break;\n }\n }\n return positions;\n\n }\n\n static long intsqrt(final long i) {\n for (long k = 0; k < i + 1; ++k) {\n if (i == k * k) {\n return k;\n }\n if (i < k * k) {\n return -1;\n }\n }\n return -1;\n }\n}\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nTakahashi is doing a research on sets of points in a plane.\nTakahashi thinks a set S of points in a coordinate plane is a good set when S satisfies both of the following conditions:\n\nThe distance between any two points in S is not \\sqrt{D_1}.\n\nThe distance between any two points in S is not \\sqrt{D_2}.\n\nHere, D_1 and D_2 are positive integer constants that Takahashi specified.\n\nLet X be a set of points (i,j) on a coordinate plane where i and j are integers and satisfy 0 ≤ i,j < 2N.\n\nTakahashi has proved that, for any choice of D_1 and D_2, there exists a way to choose N^2 points from X so that the chosen points form a good set.\nHowever, he does not know the specific way to choose such points to form a good set.\nFind a subset of X whose size is N^2 that forms a good set.\n\nConstraints\n\n1 ≤ N ≤ 300\n\n1 ≤ D_1 ≤ 2×10^5\n\n1 ≤ D_2 ≤ 2×10^5\n\nAll values in the input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D_1 D_2\n\nOutput\n\nPrint N^2 distinct points that satisfy the condition in the following format:\n\nx_1 y_1\nx_2 y_2\n:\nx_{N^2} y_{N^2}\n\nHere, (x_i,y_i) represents the i-th chosen point.\n0 ≤ x_i,y_i < 2N must hold, and they must be integers.\nThe chosen points may be printed in any order.\nIn case there are multiple possible solutions, you can output any.\n\nSample Input 1\n\n2 1 2\n\nSample Output 1\n\n0 0\n0 2\n2 0\n2 2\n\nAmong these points, the distance between 2 points is either 2 or 2\\sqrt{2}, thus it satisfies the condition.\n\nSample Input 2\n\n3 1 5\n\nSample Output 2\n\n0 0\n0 2\n0 4\n1 1\n1 3\n1 5\n2 0\n2 2\n2 4", "sample_input": "2 1 2\n"}, "reference_outputs": ["0 0\n0 2\n2 0\n2 2\n"], "source_document_id": "p03334", "source_text": "Score : 800 points\n\nProblem Statement\n\nTakahashi is doing a research on sets of points in a plane.\nTakahashi thinks a set S of points in a coordinate plane is a good set when S satisfies both of the following conditions:\n\nThe distance between any two points in S is not \\sqrt{D_1}.\n\nThe distance between any two points in S is not \\sqrt{D_2}.\n\nHere, D_1 and D_2 are positive integer constants that Takahashi specified.\n\nLet X be a set of points (i,j) on a coordinate plane where i and j are integers and satisfy 0 ≤ i,j < 2N.\n\nTakahashi has proved that, for any choice of D_1 and D_2, there exists a way to choose N^2 points from X so that the chosen points form a good set.\nHowever, he does not know the specific way to choose such points to form a good set.\nFind a subset of X whose size is N^2 that forms a good set.\n\nConstraints\n\n1 ≤ N ≤ 300\n\n1 ≤ D_1 ≤ 2×10^5\n\n1 ≤ D_2 ≤ 2×10^5\n\nAll values in the input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D_1 D_2\n\nOutput\n\nPrint N^2 distinct points that satisfy the condition in the following format:\n\nx_1 y_1\nx_2 y_2\n:\nx_{N^2} y_{N^2}\n\nHere, (x_i,y_i) represents the i-th chosen point.\n0 ≤ x_i,y_i < 2N must hold, and they must be integers.\nThe chosen points may be printed in any order.\nIn case there are multiple possible solutions, you can output any.\n\nSample Input 1\n\n2 1 2\n\nSample Output 1\n\n0 0\n0 2\n2 0\n2 2\n\nAmong these points, the distance between 2 points is either 2 or 2\\sqrt{2}, thus it satisfies the condition.\n\nSample Input 2\n\n3 1 5\n\nSample Output 2\n\n0 0\n0 2\n0 4\n1 1\n1 3\n1 5\n2 0\n2 2\n2 4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3701, "cpu_time_ms": 956, "memory_kb": 49612}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s280811614", "group_id": "codeNet:p03338", "input_text": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tString S = sc.next();\n\t\tint ans = 0;\n\t\tfor(int n=2; n westChangeRate = new ArrayList();\n\t\t//ArrayList eastChangeRate = new ArrayList();\n\n\t\tfor(int i=0; i westChangeRate = new ArrayList();\n\t\t//ArrayList eastChangeRate = new ArrayList();\n\n\t\tfor(int i=0; i= 0; i--) {\n if (ar[i] == ans) {\n ans--;\n }\n }\n out.println(ans);\n }\n\n }\n\n static class ScanReader {\n private byte[] buf = new byte[4 * 1024];\n private int index;\n private BufferedInputStream in;\n private int total;\n\n public ScanReader(InputStream inputStream) {\n in = new BufferedInputStream(inputStream);\n }\n\n private int scan() {\n if (index >= total) {\n index = 0;\n try {\n total = in.read(buf);\n } catch (Exception e) {\n e.printStackTrace();\n }\n if (total <= 0) return -1;\n }\n return buf[index++];\n }\n\n public int scanInt() {\n int integer = 0;\n int n = scan();\n while (isWhiteSpace(n)) n = scan();\n int neg = 1;\n if (n == '-') {\n neg = -1;\n n = scan();\n }\n while (!isWhiteSpace(n)) {\n if (n >= '0' && n <= '9') {\n integer *= 10;\n integer += n - '0';\n n = scan();\n }\n }\n return neg * integer;\n }\n\n private boolean isWhiteSpace(int n) {\n if (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t' || n == -1) return true;\n else return false;\n }\n\n public void scanInt(int[] A, int size) {\n for (int i = 0; i < size; i++) A[i] = scanInt();\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1526866187, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03346.html", "problem_id": "p03346", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03346/input.txt", "sample_output_relpath": "derived/input_output/data/p03346/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03346/Java/s493966881.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s493966881", "user_id": "u634334065"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.FilterInputStream;\nimport java.io.BufferedInputStream;\nimport java.io.InputStream;\n\n/**\n * @author khokharnikunj8\n */\n\npublic class Main {\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n public void run() {\n new Main().solve();\n }\n }, \"1\", 1 << 26).start();\n }\n\n void solve() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n ScanReader in = new ScanReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n BBackfront solver = new BBackfront();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class BBackfront {\n public void solve(int testNumber, ScanReader in, PrintWriter out) {\n int n = in.scanInt();\n int ar[] = new int[n];\n in.scanInt(ar, n);\n int ans = n;\n for (int i = n - 1; i >= 0; i--) {\n if (ar[i] == ans) {\n ans--;\n }\n }\n out.println(ans);\n }\n\n }\n\n static class ScanReader {\n private byte[] buf = new byte[4 * 1024];\n private int index;\n private BufferedInputStream in;\n private int total;\n\n public ScanReader(InputStream inputStream) {\n in = new BufferedInputStream(inputStream);\n }\n\n private int scan() {\n if (index >= total) {\n index = 0;\n try {\n total = in.read(buf);\n } catch (Exception e) {\n e.printStackTrace();\n }\n if (total <= 0) return -1;\n }\n return buf[index++];\n }\n\n public int scanInt() {\n int integer = 0;\n int n = scan();\n while (isWhiteSpace(n)) n = scan();\n int neg = 1;\n if (n == '-') {\n neg = -1;\n n = scan();\n }\n while (!isWhiteSpace(n)) {\n if (n >= '0' && n <= '9') {\n integer *= 10;\n integer += n - '0';\n n = scan();\n }\n }\n return neg * integer;\n }\n\n private boolean isWhiteSpace(int n) {\n if (n == ' ' || n == '\\n' || n == '\\r' || n == '\\t' || n == -1) return true;\n else return false;\n }\n\n public void scanInt(int[] A, int size) {\n for (int i = 0; i < size; i++) A[i] = scanInt();\n }\n\n }\n}\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence (P_1,P_2,...,P_N) which is a permutation of the integers from 1 through N.\nYou would like to sort this sequence in ascending order by repeating the following operation:\n\nChoose an element in the sequence and move it to the beginning or the end of the sequence.\n\nFind the minimum number of operations required.\nIt can be proved that it is actually possible to sort the sequence using this operation.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n(P_1,P_2,...,P_N) is a permutation of (1,2,...,N).\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1\n:\nP_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\n1\n3\n2\n4\n\nSample Output 1\n\n2\n\nFor example, the sequence can be sorted in ascending order as follows:\n\nMove 2 to the beginning. The sequence is now (2,1,3,4).\n\nMove 1 to the beginning. The sequence is now (1,2,3,4).\n\nSample Input 2\n\n6\n3\n2\n5\n1\n4\n6\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\n6\n3\n1\n2\n7\n4\n8\n5\n\nSample Output 3\n\n5", "sample_input": "4\n1\n3\n2\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03346", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence (P_1,P_2,...,P_N) which is a permutation of the integers from 1 through N.\nYou would like to sort this sequence in ascending order by repeating the following operation:\n\nChoose an element in the sequence and move it to the beginning or the end of the sequence.\n\nFind the minimum number of operations required.\nIt can be proved that it is actually possible to sort the sequence using this operation.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n(P_1,P_2,...,P_N) is a permutation of (1,2,...,N).\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1\n:\nP_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\n1\n3\n2\n4\n\nSample Output 1\n\n2\n\nFor example, the sequence can be sorted in ascending order as follows:\n\nMove 2 to the beginning. The sequence is now (2,1,3,4).\n\nMove 1 to the beginning. The sequence is now (1,2,3,4).\n\nSample Input 2\n\n6\n3\n2\n5\n1\n4\n6\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\n6\n3\n1\n2\n7\n4\n8\n5\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2706, "cpu_time_ms": 117, "memory_kb": 27732}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s595692895", "group_id": "codeNet:p03347", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n for(int i=0; i a[i]){\n System.out.println(-1);\n return;\n }\n }\n\n long ans = 0;\n\n for(int i=1; i= a[i+1]){\n ans += a[i];\n }\n }\n ans += a[n-1];\n\n System.out.println(ans);\n }\n}", "language": "Java", "metadata": {"date": 1526867682, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03347.html", "problem_id": "p03347", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03347/input.txt", "sample_output_relpath": "derived/input_output/data/p03347/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03347/Java/s595692895.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s595692895", "user_id": "u097204018"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n for(int i=0; i a[i]){\n System.out.println(-1);\n return;\n }\n }\n\n long ans = 0;\n\n for(int i=1; i= a[i+1]){\n ans += a[i];\n }\n }\n ans += a[n-1];\n\n System.out.println(ans);\n }\n}", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere is a sequence X of length N, where every element is initially 0. Let X_i denote the i-th element of X.\n\nYou are given a sequence A of length N. The i-th element of A is A_i. Determine if we can make X equal to A by repeating the operation below. If we can, find the minimum number of operations required.\n\nChoose an integer i such that 1\\leq i\\leq N-1. Replace the value of X_{i+1} with the value of X_i plus 1.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nIf we can make X equal to A by repeating the operation, print the minimum number of operations required. If we cannot, print -1.\n\nSample Input 1\n\n4\n0\n1\n1\n2\n\nSample Output 1\n\n3\n\nWe can make X equal to A as follows:\n\nChoose i=2. X becomes (0,0,1,0).\n\nChoose i=1. X becomes (0,1,1,0).\n\nChoose i=3. X becomes (0,1,1,2).\n\nSample Input 2\n\n3\n1\n2\n1\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n9\n0\n1\n1\n0\n1\n2\n2\n1\n2\n\nSample Output 3\n\n8", "sample_input": "4\n0\n1\n1\n2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03347", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere is a sequence X of length N, where every element is initially 0. Let X_i denote the i-th element of X.\n\nYou are given a sequence A of length N. The i-th element of A is A_i. Determine if we can make X equal to A by repeating the operation below. If we can, find the minimum number of operations required.\n\nChoose an integer i such that 1\\leq i\\leq N-1. Replace the value of X_{i+1} with the value of X_i plus 1.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nIf we can make X equal to A by repeating the operation, print the minimum number of operations required. If we cannot, print -1.\n\nSample Input 1\n\n4\n0\n1\n1\n2\n\nSample Output 1\n\n3\n\nWe can make X equal to A as follows:\n\nChoose i=2. X becomes (0,0,1,0).\n\nChoose i=1. X becomes (0,1,1,0).\n\nChoose i=3. X becomes (0,1,1,2).\n\nSample Input 2\n\n3\n1\n2\n1\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n9\n0\n1\n1\n0\n1\n2\n2\n1\n2\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 738, "cpu_time_ms": 624, "memory_kb": 86588}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s147724012", "group_id": "codeNet:p03347", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Egor Kulikov (egor@egork.net)\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n CSequenceGrowingEasy solver = new CSequenceGrowingEasy();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CSequenceGrowingEasy {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int[] a = in.readIntArray(n);\n if (a[0] != 0) {\n out.printLine(-1);\n return;\n }\n for (int i = 1; i < n; i++) {\n if (a[i] > a[i - 1] + 1) {\n out.printLine(-1);\n return;\n }\n }\n long answer = 0;\n for (int i = 1; i < n; i++) {\n if (a[i] == a[i - 1] + 1) {\n answer++;\n } else {\n answer += a[i];\n }\n }\n out.printLine(answer);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int[] readIntArray(int size) {\n int[] array = new int[size];\n for (int i = 0; i < size; i++) {\n array[i] = readInt();\n }\n return array;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1526865064, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03347.html", "problem_id": "p03347", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03347/input.txt", "sample_output_relpath": "derived/input_output/data/p03347/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03347/Java/s147724012.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s147724012", "user_id": "u018357824"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.io.BufferedWriter;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Egor Kulikov (egor@egork.net)\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n CSequenceGrowingEasy solver = new CSequenceGrowingEasy();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CSequenceGrowingEasy {\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n int n = in.readInt();\n int[] a = in.readIntArray(n);\n if (a[0] != 0) {\n out.printLine(-1);\n return;\n }\n for (int i = 1; i < n; i++) {\n if (a[i] > a[i - 1] + 1) {\n out.printLine(-1);\n return;\n }\n }\n long answer = 0;\n for (int i = 1; i < n; i++) {\n if (a[i] == a[i - 1] + 1) {\n answer++;\n } else {\n answer += a[i];\n }\n }\n out.printLine(answer);\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(long i) {\n writer.println(i);\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int[] readIntArray(int size) {\n int[] array = new int[size];\n for (int i = 0; i < size; i++) {\n array[i] = readInt();\n }\n return array;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere is a sequence X of length N, where every element is initially 0. Let X_i denote the i-th element of X.\n\nYou are given a sequence A of length N. The i-th element of A is A_i. Determine if we can make X equal to A by repeating the operation below. If we can, find the minimum number of operations required.\n\nChoose an integer i such that 1\\leq i\\leq N-1. Replace the value of X_{i+1} with the value of X_i plus 1.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nIf we can make X equal to A by repeating the operation, print the minimum number of operations required. If we cannot, print -1.\n\nSample Input 1\n\n4\n0\n1\n1\n2\n\nSample Output 1\n\n3\n\nWe can make X equal to A as follows:\n\nChoose i=2. X becomes (0,0,1,0).\n\nChoose i=1. X becomes (0,1,1,0).\n\nChoose i=3. X becomes (0,1,1,2).\n\nSample Input 2\n\n3\n1\n2\n1\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n9\n0\n1\n1\n0\n1\n2\n2\n1\n2\n\nSample Output 3\n\n8", "sample_input": "4\n0\n1\n1\n2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03347", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere is a sequence X of length N, where every element is initially 0. Let X_i denote the i-th element of X.\n\nYou are given a sequence A of length N. The i-th element of A is A_i. Determine if we can make X equal to A by repeating the operation below. If we can, find the minimum number of operations required.\n\nChoose an integer i such that 1\\leq i\\leq N-1. Replace the value of X_{i+1} with the value of X_i plus 1.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nIf we can make X equal to A by repeating the operation, print the minimum number of operations required. If we cannot, print -1.\n\nSample Input 1\n\n4\n0\n1\n1\n2\n\nSample Output 1\n\n3\n\nWe can make X equal to A as follows:\n\nChoose i=2. X becomes (0,0,1,0).\n\nChoose i=1. X becomes (0,1,1,0).\n\nChoose i=3. X becomes (0,1,1,2).\n\nSample Input 2\n\n3\n1\n2\n1\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n9\n0\n1\n1\n0\n1\n2\n2\n1\n2\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4292, "cpu_time_ms": 226, "memory_kb": 24784}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s158878853", "group_id": "codeNet:p03352", "input_text": "\n\nimport java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint x = sc.nextInt();\n\n\t\tint result = 1;\n\t\tfor(int i = 2; i <= x - 1; i++){\n\t\t\tint p = 2;\n\n\t\t\twhile(Math.pow(i, p) <= x){\n\t\t\t\tresult = (int)Math.max(result, Math.pow(i, p));\n\t\t\t\tp++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(result);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1589083383, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03352/input.txt", "sample_output_relpath": "derived/input_output/data/p03352/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03352/Java/s158878853.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s158878853", "user_id": "u918391323"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "\n\nimport java.io.IOException;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint x = sc.nextInt();\n\n\t\tint result = 1;\n\t\tfor(int i = 2; i <= x - 1; i++){\n\t\t\tint p = 2;\n\n\t\t\twhile(Math.pow(i, p) <= x){\n\t\t\t\tresult = (int)Math.max(result, Math.pow(i, p));\n\t\t\t\tp++;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(result);\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03352", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 446, "cpu_time_ms": 96, "memory_kb": 21972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s112208675", "group_id": "codeNet:p03352", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = Integer.parseInt(sc.next());\n\t\tint ans = 1;\n\t\tfor (int i=1; i x) break;\n if(max < e){\n max = e;\n }\n }\n }\n int emax = (int)max;\n System.out.println(emax);\n }\n}", "language": "Java", "metadata": {"date": 1526489964, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03352/input.txt", "sample_output_relpath": "derived/input_output/data/p03352/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03352/Java/s370600590.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s370600590", "user_id": "u861857310"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*;\nimport java.lang.*;\n\nclass Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int MAX_ROOT = (int)Math.sqrt(x);\n double e = 0;\n double max = e;\n for(int i = 2;i <= MAX_ROOT;i++){\n for(int j = 1;j <= 9;j++){\n e = Math.pow(i,j);\n if(e > x) break;\n if(max < e){\n max = e;\n }\n }\n }\n int emax = (int)max;\n System.out.println(emax);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03352", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 485, "cpu_time_ms": 112, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s388434568", "group_id": "codeNet:p03353", "input_text": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tint K = sc.nextInt();\n\t\tString temp = \"\";\n\t\tList list = new ArrayList<>();\n\t\tfor (int i = 0; i <= s.length(); i++) {\n\t\t\tfor (int j = 0; j < i; j++) {\n\t\t\t\ttemp = s.substring(j, i);\n\t\t\t\tif (!list.contains(temp)) {\n\t\t\t\t\tlist.add(temp);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlist.sort(null);\n\t\tSystem.out.println(list.get(K - 1));\n\t}\n}", "language": "Java", "metadata": {"date": 1526177250, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03353.html", "problem_id": "p03353", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03353/input.txt", "sample_output_relpath": "derived/input_output/data/p03353/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03353/Java/s388434568.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s388434568", "user_id": "u862282448"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tint K = sc.nextInt();\n\t\tString temp = \"\";\n\t\tList list = new ArrayList<>();\n\t\tfor (int i = 0; i <= s.length(); i++) {\n\t\t\tfor (int j = 0; j < i; j++) {\n\t\t\t\ttemp = s.substring(j, i);\n\t\t\t\tif (!list.contains(temp)) {\n\t\t\t\t\tlist.add(temp);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlist.sort(null);\n\t\tSystem.out.println(list.get(K - 1));\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "sample_input": "aba\n4\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03353", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 523, "cpu_time_ms": 2110, "memory_kb": 228252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s898330588", "group_id": "codeNet:p03355", "input_text": "import java.util.*;\n\n\npublic class Main {\n\tString s;\n\t\n\tclass C implements Comparable {\n\t\tint ind, step;\n\n\t\tpublic C(int ind, int step) {\n\t\t\tsuper();\n\t\t\tthis.ind = ind;\n\t\t\tthis.step = step;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(C o) {\n\t\t\tString now = s.substring(this.ind, this.ind + this.step);\n\t\t\tString other = s.substring(o.ind, o.ind + o.step);\n\t\t\treturn now.compareTo(other);\n\t\t}\n\t\t\n\t}\n\t\n\tprivate void doit(){\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile(sc.hasNext()){\n\t\t\ts = sc.next();\n\t\t\tint k = sc.nextInt();\n\t\t\tPriorityQueue q = new PriorityQueue<>();\n\t\t\t\n\t\t\tHashSet set = new HashSet<>();\n\t\t\tfor(int i = 0; i < s.length(); i++){\n\t\t\t\tString now = s.substring(i, i+1);\n\t\t\t\tq.add(new C(i, 1));\n\t\t\t}\n\t\t\tint count = 1;\n\t\t\twhile(!q.isEmpty()){\n\t\t\t\tC now = q.poll();\n\t\t\t\tString nows = s.substring(now.ind, now.ind + now.step);\n\t\t\t\tif(!set.contains(nows) && count == k){\n\t\t\t\t\tSystem.out.println(s.substring(now.ind, now.ind + now.step));\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(!set.contains(nows)){\n\t\t\t\t\tset.add(nows);\n\t\t\t\t\tcount++;\n\t\t\t\t};\n\t\t\t\tif(now.ind + now.step + 1 > s.length()) continue;\n\t\t\t\tq.add(new C(now.ind, now.step+1));\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate void debug(Object... o) {\n\t\tSystem.out.println(\"debug = \" + Arrays.deepToString(o));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().doit();\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1526175443, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03355.html", "problem_id": "p03355", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03355/input.txt", "sample_output_relpath": "derived/input_output/data/p03355/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03355/Java/s898330588.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s898330588", "user_id": "u148142472"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "import java.util.*;\n\n\npublic class Main {\n\tString s;\n\t\n\tclass C implements Comparable {\n\t\tint ind, step;\n\n\t\tpublic C(int ind, int step) {\n\t\t\tsuper();\n\t\t\tthis.ind = ind;\n\t\t\tthis.step = step;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(C o) {\n\t\t\tString now = s.substring(this.ind, this.ind + this.step);\n\t\t\tString other = s.substring(o.ind, o.ind + o.step);\n\t\t\treturn now.compareTo(other);\n\t\t}\n\t\t\n\t}\n\t\n\tprivate void doit(){\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile(sc.hasNext()){\n\t\t\ts = sc.next();\n\t\t\tint k = sc.nextInt();\n\t\t\tPriorityQueue q = new PriorityQueue<>();\n\t\t\t\n\t\t\tHashSet set = new HashSet<>();\n\t\t\tfor(int i = 0; i < s.length(); i++){\n\t\t\t\tString now = s.substring(i, i+1);\n\t\t\t\tq.add(new C(i, 1));\n\t\t\t}\n\t\t\tint count = 1;\n\t\t\twhile(!q.isEmpty()){\n\t\t\t\tC now = q.poll();\n\t\t\t\tString nows = s.substring(now.ind, now.ind + now.step);\n\t\t\t\tif(!set.contains(nows) && count == k){\n\t\t\t\t\tSystem.out.println(s.substring(now.ind, now.ind + now.step));\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(!set.contains(nows)){\n\t\t\t\t\tset.add(nows);\n\t\t\t\t\tcount++;\n\t\t\t\t};\n\t\t\t\tif(now.ind + now.step + 1 > s.length()) continue;\n\t\t\t\tq.add(new C(now.ind, now.step+1));\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate void debug(Object... o) {\n\t\tSystem.out.println(\"debug = \" + Arrays.deepToString(o));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().doit();\n\t}\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "sample_input": "aba\n4\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03355", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1321, "cpu_time_ms": 230, "memory_kb": 43020}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s145734481", "group_id": "codeNet:p03359", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner scan = new Scanner(System.in);\n\t\tint a = scan.nextInt();\n\t\tint b = scan.nextInt();\n\t\tint takahasi=0;\n\t\ttakahasi = a-1;\n\t\tif(b>=a) {\n\t\t\ttakahasi++;\n\t\t}\n\t\tSystem.out.println(takahasi);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1561150316, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03359.html", "problem_id": "p03359", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03359/input.txt", "sample_output_relpath": "derived/input_output/data/p03359/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03359/Java/s145734481.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s145734481", "user_id": "u506410017"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner scan = new Scanner(System.in);\n\t\tint a = scan.nextInt();\n\t\tint b = scan.nextInt();\n\t\tint takahasi=0;\n\t\ttakahasi = a-1;\n\t\tif(b>=a) {\n\t\t\ttakahasi++;\n\t\t}\n\t\tSystem.out.println(takahasi);\n\t}\n\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "sample_input": "5 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03359", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 345, "cpu_time_ms": 96, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s276612110", "group_id": "codeNet:p03359", "input_text": "import java.util.*;\npublic class Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n if(a <= b){\n System.out.println(a);\n }else{\n System.out.println(a-1);\n }\n\n }\n}", "language": "Java", "metadata": {"date": 1527018939, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03359.html", "problem_id": "p03359", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03359/input.txt", "sample_output_relpath": "derived/input_output/data/p03359/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03359/Java/s276612110.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s276612110", "user_id": "u633463117"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.*;\npublic class Main{\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n if(a <= b){\n System.out.println(a);\n }else{\n System.out.println(a-1);\n }\n\n }\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "sample_input": "5 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03359", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 94, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s493434474", "group_id": "codeNet:p03359", "input_text": "import java.io.UnsupportedEncodingException;\nimport java.util.*;\n\npublic class Main {\n\n\tstatic int max_X;\n\tstatic int max_Y;\n\n\tpublic static void main(String[] args) throws UnsupportedEncodingException {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tString ans = \"Yes\";\n\n\t\tint i = sc.nextInt();\n\t\tint j = sc.nextInt();\n\t\tmax_X = i;\n\t\tmax_Y = j;\n\n\t\t// 適当に格納\n\t\tArrayList map = new ArrayList();\n\t\tint h, w;\n\t\tfor (h = 0; h < j; h++) {\n\t\t\tString st = sc.next();\n\t\t\tmap.add(st.getBytes());\n\t\t}\n\n\t\tfor (h = 0; h < j; h++) {\n\t\t\tbyte[] now_x = map.get(h);\n\t\t\tfor (w = 0; w < i; w++) {\n\t\t\t\tif (!check(w,h, now_x, map)) {\n\t\t\t\t\tans = \"No\";\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t\tsc.close();\n\t}\n\n\tprivate static boolean check(int w, int h, byte[] now_x, ArrayList map) {\n\t\tboolean ischeck = false;\n\n\t\tif (now_x[w] == '.') {\n\t\t\treturn true;\n\t\t}\n\n\t\t// 左\n\t\tif (w - 1 >= 0) {\n\t\t\tif (now_x[w] == now_x[w - 1]) {\n\t\t\t\tischeck = true;\n\t\t\t\treturn ischeck;\n\t\t\t}\n\t\t}\n\n\t\t// 右\n\t\tif (w + 1 < max_X) {\n\t\t\tif (now_x[w] == now_x[w + 1]) {\n\t\t\t\tischeck = true;\n\t\t\t\treturn ischeck;\n\t\t\t}\n\t\t}\n\n\t\t// 上\n\t\tif (h - 1 >= 0) {\n\t\t\tbyte[] up_x = map.get(h - 1);\n\t\t\tif (now_x[w] == up_x[w]) {\n\t\t\t\tischeck = true;\n\t\t\t\treturn ischeck;\n\t\t\t}\n\t\t}\n\n\t\t// 下\n\t\tif (h + 1 < max_Y) {\n\t\t\tbyte[] down_x = map.get(h + 1);\n\t\t\tif (now_x[w] == down_x[w]) {\n\t\t\t\tischeck = true;\n\t\t\t\treturn ischeck;\n\t\t\t}\n\t\t}\n\t\treturn ischeck;\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1525576409, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03359.html", "problem_id": "p03359", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03359/input.txt", "sample_output_relpath": "derived/input_output/data/p03359/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03359/Java/s493434474.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s493434474", "user_id": "u087386056"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.io.UnsupportedEncodingException;\nimport java.util.*;\n\npublic class Main {\n\n\tstatic int max_X;\n\tstatic int max_Y;\n\n\tpublic static void main(String[] args) throws UnsupportedEncodingException {\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tString ans = \"Yes\";\n\n\t\tint i = sc.nextInt();\n\t\tint j = sc.nextInt();\n\t\tmax_X = i;\n\t\tmax_Y = j;\n\n\t\t// 適当に格納\n\t\tArrayList map = new ArrayList();\n\t\tint h, w;\n\t\tfor (h = 0; h < j; h++) {\n\t\t\tString st = sc.next();\n\t\t\tmap.add(st.getBytes());\n\t\t}\n\n\t\tfor (h = 0; h < j; h++) {\n\t\t\tbyte[] now_x = map.get(h);\n\t\t\tfor (w = 0; w < i; w++) {\n\t\t\t\tif (!check(w,h, now_x, map)) {\n\t\t\t\t\tans = \"No\";\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t\tsc.close();\n\t}\n\n\tprivate static boolean check(int w, int h, byte[] now_x, ArrayList map) {\n\t\tboolean ischeck = false;\n\n\t\tif (now_x[w] == '.') {\n\t\t\treturn true;\n\t\t}\n\n\t\t// 左\n\t\tif (w - 1 >= 0) {\n\t\t\tif (now_x[w] == now_x[w - 1]) {\n\t\t\t\tischeck = true;\n\t\t\t\treturn ischeck;\n\t\t\t}\n\t\t}\n\n\t\t// 右\n\t\tif (w + 1 < max_X) {\n\t\t\tif (now_x[w] == now_x[w + 1]) {\n\t\t\t\tischeck = true;\n\t\t\t\treturn ischeck;\n\t\t\t}\n\t\t}\n\n\t\t// 上\n\t\tif (h - 1 >= 0) {\n\t\t\tbyte[] up_x = map.get(h - 1);\n\t\t\tif (now_x[w] == up_x[w]) {\n\t\t\t\tischeck = true;\n\t\t\t\treturn ischeck;\n\t\t\t}\n\t\t}\n\n\t\t// 下\n\t\tif (h + 1 < max_Y) {\n\t\t\tbyte[] down_x = map.get(h + 1);\n\t\t\tif (now_x[w] == down_x[w]) {\n\t\t\t\tischeck = true;\n\t\t\t\treturn ischeck;\n\t\t\t}\n\t\t}\n\t\treturn ischeck;\n\t}\n\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "sample_input": "5 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03359", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1427, "cpu_time_ms": 114, "memory_kb": 22868}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s146200495", "group_id": "codeNet:p03360", "input_text": "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n ArrayList ar = new ArrayList();\n int A = sc.nextInt();\n ar.add(A);\n int B = sc.nextInt();\n ar.add(B);\n int C = sc.nextInt();\n ar.add(C);\n int K = sc.nextInt();\n Collections.sort(ar);\n for(int i=0;i ar = new ArrayList();\n int A = sc.nextInt();\n ar.add(A);\n int B = sc.nextInt();\n ar.add(B);\n int C = sc.nextInt();\n ar.add(C);\n int K = sc.nextInt();\n Collections.sort(ar);\n for(int i=0;i list = new ArrayList();\n\t\tfor(int i = 0; i < prime.length; i++) {\n\t\t\tif(prime[i] % 5 == 1) {\n\t\t\t\tlist.add(prime[i]);\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tSystem.out.print(list.get(i) + \" \");\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1543088673, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03362.html", "problem_id": "p03362", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03362/input.txt", "sample_output_relpath": "derived/input_output/data/p03362/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03362/Java/s284982728.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s284982728", "user_id": "u861755736"}, "prompt_components": {"gold_output": "3 5 7 11 31\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint prime[] = {2 ,3 ,5 ,7 ,11 ,13 ,17 ,19 ,23 ,29 ,31 ,37 ,41 ,43 ,47 ,53 ,59 ,61 ,67 ,71 ,73 ,79 ,83 ,89 ,97 ,101 ,103 ,107 ,109 ,113 ,127 ,131 ,137 ,139 ,149 ,151 ,157 ,163 ,167 ,173 ,179 ,181 ,191 ,193 ,197 ,199 ,211 ,223 ,227 ,229 ,233 ,239 ,241 ,251 ,257 ,263 ,269 ,271 ,277 ,281 ,283 ,293 ,307 ,311 ,313 ,317 ,331 ,337 ,347 ,349 ,353 ,359 ,367 ,373 ,379 ,383 ,389 ,397 ,401 ,409 ,419 ,421 ,431 ,433 ,439 ,443 ,449 ,457 ,461 ,463 ,467 ,479 ,487 ,491 ,499 ,503 ,509 ,521 ,523 ,541 ,547 ,557 ,563 ,569 ,571 ,577 ,587 ,593 ,599 ,601 ,607 ,613 ,617 ,619 ,631 ,641 ,643 ,647 ,653 ,659 ,661 ,673 ,677 ,683 ,691 ,701 ,709 ,719 ,727 ,733 ,739 ,743 ,751 ,757 ,761 ,769 ,773 ,787 ,797 ,809 ,811 ,821 ,823 ,827 ,829 ,839 ,853 ,857 ,859 ,863 ,877 ,881 ,883 ,887 ,907 ,911 ,919 ,929 ,937 ,941 ,947 ,953 ,967 ,971 ,977 ,983 ,991 ,997 ,1009 ,1013 ,1019 ,1021 ,1031 ,1033 ,1039 ,1049 ,1051 ,1061 ,1063 ,1069 ,1087 ,1091 ,1093 ,1097 ,1103 ,1109 ,1117 ,1123 ,1129 ,1151 ,1153 ,1163 ,1171 ,1181 ,1187 ,1193 ,1201 ,1213 ,1217 ,1223 ,1229 ,1231 ,1237 ,1249 ,1259 ,1277 ,1279 ,1283 ,1289 ,1291 ,1297 ,1301 ,1303 ,1307 ,1319 ,1321 ,1327 ,1361 ,1367 ,1373 ,1381 ,1399 ,1409 ,1423 ,1427 ,1429 ,1433 ,1439 ,1447 ,1451 ,1453 ,1459 ,1471 ,1481 ,1483 ,1487 ,1489 ,1493 ,1499 ,1511 ,1523 ,1531 ,1543 ,1549 ,1553 ,1559 ,1567 ,1571 ,1579 ,1583 ,1597 ,1601 ,1607 ,1609 ,1613 ,1619 ,1621 ,1627 ,1637 ,1657 ,1663 ,1667 ,1669 ,1693 ,1697 ,1699 ,1709 ,1721 ,1723 ,1733 ,1741 ,1747 ,1753 ,1759 ,1777 ,1783 ,1787 ,1789 ,1801 ,1811 ,1823 ,1831 ,1847 ,1861 ,1867 ,1871 ,1873 ,1877 ,1879 ,1889 ,1901 ,1907 ,1913 ,1931 ,1933 ,1949 ,1951 ,1973 ,1979 ,1987 ,1993 ,1997 ,1999 ,2003 ,2011 ,2017 ,2027 ,2029 ,2039 ,2053 ,2063 ,2069 ,2081 ,2083 ,2087 ,2089 ,2099 ,2111 ,2113 ,2129 ,2131 ,2137 ,2141 ,2143 ,2153 ,2161 ,2179 ,2203 ,2207 ,2213 ,2221 ,2237 ,2239 ,2243 ,2251 ,2267 ,2269 ,2273 ,2281 ,2287 ,2293 ,2297 ,2309 ,2311 ,2333 ,2339 ,2341 ,2347 ,2351 ,2357 ,2371 ,2377 ,2381 ,2383 ,2389 ,2393 ,2399 ,2411 ,2417 ,2423 ,2437 ,2441 ,2447 ,2459 ,2467 ,2473 ,2477 ,2503 ,2521 ,2531 ,2539 ,2543 ,2549 ,2551 ,2557 ,2579 ,2591 ,2593 ,2609 ,2617 ,2621 ,2633 ,2647 ,2657 ,2659 ,2663 ,2671 ,2677 ,2683 ,2687 ,2689 ,2693 ,2699 ,2707 ,2711 ,2713 ,2719 ,2729 ,2731 ,2741 ,2749 ,2753 ,2767 ,2777 ,2789 ,2791 ,2797 ,2801 ,2803 ,2819 ,2833 ,2837 ,2843 ,2851 ,2857 ,2861 ,2879 ,2887 ,2897 ,2903 ,2909 ,2917 ,2927 ,2939 ,2953 ,2957 ,2963 ,2969 ,2971 ,2999 ,3001 ,3011 ,3019 ,3023 ,3037 ,3041 ,3049 ,3061 ,3067 ,3079 ,3083 ,3089 ,3109 ,3119 ,3121 ,3137 ,3163 ,3167 ,3169 ,3181 ,3187 ,3191 ,3203 ,3209 ,3217 ,3221 ,3229 ,3251 ,3253 ,3257 ,3259 ,3271 ,3299 ,3301 ,3307 ,3313 ,3319 ,3323 ,3329 ,3331 ,3343 ,3347 ,3359 ,3361 ,3371 ,3373 ,3389 ,3391 ,3407 ,3413 ,3433 ,3449 ,3457 ,3461 ,3463 ,3467 ,3469 ,3491 ,3499 ,3511 ,3517 ,3527 ,3529 ,3533 ,3539 ,3541 ,3547 ,3557 ,3559 ,3571 ,3581 ,3583 ,3593 ,3607 ,3613 ,3617 ,3623 ,3631 ,3637 ,3643 ,3659 ,3671 ,3673 ,3677 ,3691 ,3697 ,3701 ,3709 ,3719 ,3727 ,3733 ,3739 ,3761 ,3767 ,3769 ,3779 ,3793 ,3797 ,3803 ,3821 ,3823 ,3833 ,3847 ,3851 ,3853 ,3863 ,3877 ,3881 ,3889 ,3907 ,3911 ,3917 ,3919 ,3923 ,3929 ,3931 ,3943 ,3947 ,3967 ,3989 ,4001 ,4003 ,4007 ,4013 ,4019 ,4021 ,4027 ,4049 ,4051 ,4057 ,4073 ,4079 ,4091 ,4093 ,4099 ,4111 ,4127 ,4129 ,4133 ,4139 ,4153 ,4157 ,4159 ,4177 ,4201 ,4211 ,4217 ,4219 ,4229 ,4231 ,4241 ,4243 ,4253 ,4259 ,4261 ,4271 ,4273 ,4283 ,4289 ,4297 ,4327 ,4337 ,4339 ,4349 ,4357 ,4363 ,4373 ,4391 ,4397 ,4409 ,4421 ,4423 ,4441 ,4447 ,4451 ,4457 ,4463 ,4481 ,4483 ,4493 ,4507 ,4513 ,4517 ,4519 ,4523 ,4547 ,4549 ,4561 ,4567 ,4583 ,4591 ,4597 ,4603 ,4621 ,4637 ,4639 ,4643 ,4649 ,4651 ,4657 ,4663 ,4673 ,4679 ,4691 ,4703 ,4721 ,4723 ,4729 ,4733 ,4751 ,4759 ,4783 ,4787 ,4789 ,4793 ,4799 ,4801 ,4813 ,4817 ,4831 ,4861 ,4871 ,4877 ,4889 ,4903 ,4909 ,4919 ,4931 ,4933 ,4937 ,4943 ,4951 ,4957 ,4967 ,4969 ,4973 ,4987 ,4993 ,4999 ,5003 ,5009 ,5011 ,5021 ,5023 ,5039 ,5051 ,5059 ,5077 ,5081 ,5087 ,5099 ,5101 ,5107 ,5113 ,5119 ,5147 ,5153 ,5167 ,5171 ,5179 ,5189 ,5197 ,5209 ,5227 ,5231 ,5233 ,5237 ,5261 ,5273 ,5279 ,5281 ,5297 ,5303 ,5309 ,5323 ,5333 ,5347 ,5351 ,5381 ,5387 ,5393 ,5399 ,5407 ,5413 ,5417 ,5419 ,5431 ,5437 ,5441 ,5443 ,5449 ,5471 ,5477 ,5479 ,5483 ,5501 ,5503 ,5507 ,5519 ,5521 ,5527 ,5531 ,5557 ,5563 ,5569 ,5573 ,5581 ,5591 ,5623 ,5639 ,5641 ,5647 ,5651 ,5653 ,5657 ,5659 ,5669 ,5683 ,5689 ,5693 ,5701 ,5711 ,5717 ,5737 ,5741 ,5743 ,5749 ,5779 ,5783 ,5791 ,5801 ,5807 ,5813 ,5821 ,5827 ,5839 ,5843 ,5849 ,5851 ,5857 ,5861 ,5867 ,5869 ,5879 ,5881 ,5897 ,5903 ,5923 ,5927 ,5939 ,5953 ,5981 ,5987 ,6007 ,6011 ,6029 ,6037 ,6043 ,6047 ,6053 ,6067 ,6073 ,6079 ,6089 ,6091 ,6101 ,6113 ,6121 ,6131 ,6133 ,6143 ,6151 ,6163 ,6173 ,6197 ,6199 ,6203 ,6211 ,6217 ,6221 ,6229 ,6247 ,6257 ,6263 ,6269 ,6271 ,6277 ,6287 ,6299 ,6301 ,6311 ,6317 ,6323 ,6329 ,6337 ,6343 ,6353 ,6359 ,6361 ,6367 ,6373 ,6379 ,6389 ,6397 ,6421 ,6427 ,6449 ,6451 ,6469 ,6473 ,6481 ,6491 ,6521 ,6529 ,6547 ,6551 ,6553 ,6563 ,6569 ,6571 ,6577 ,6581 ,6599 ,6607 ,6619 ,6637 ,6653 ,6659 ,6661 ,6673 ,6679 ,6689 ,6691 ,6701 ,6703 ,6709 ,6719 ,6733 ,6737 ,6761 ,6763 ,6779 ,6781 ,6791 ,6793 ,6803 ,6823 ,6827 ,6829 ,6833 ,6841 ,6857 ,6863 ,6869 ,6871 ,6883 ,6899 ,6907 ,6911 ,6917 ,6947 ,6949 ,6959 ,6961 ,6967 ,6971 ,6977 ,6983 ,6991 ,6997 ,7001 ,7013 ,7019 ,7027 ,7039 ,7043 ,7057 ,7069 ,7079 ,7103 ,7109 ,7121 ,7127 ,7129 ,7151 ,7159 ,7177 ,7187 ,7193 ,7207 ,7211 ,7213 ,7219 ,7229 ,7237 ,7243 ,7247 ,7253 ,7283 ,7297 ,7307 ,7309 ,7321 ,7331 ,7333 ,7349 ,7351 ,7369 ,7393 ,7411 ,7417 ,7433 ,7451 ,7457 ,7459 ,7477 ,7481 ,7487 ,7489 ,7499 ,7507 ,7517 ,7523 ,7529 ,7537 ,7541 ,7547 ,7549 ,7559 ,7561 ,7573 ,7577 ,7583 ,7589 ,7591 ,7603 ,7607 ,7621 ,7639 ,7643 ,7649 ,7669 ,7673 ,7681 ,7687 ,7691 ,7699 ,7703 ,7717 ,7723 ,7727 ,7741 ,7753 ,7757 ,7759 ,7789 ,7793 ,7817 ,7823 ,7829 ,7841 ,7853 ,7867 ,7873 ,7877 ,7879 ,7883 ,7901 ,7907 ,7919 ,7927 ,7933 ,7937 ,7949 ,7951 ,7963 ,7993 ,8009 ,8011 ,8017 ,8039 ,8053 ,8059 ,8069 ,8081 ,8087 ,8089 ,8093 ,8101 ,8111 ,8117 ,8123 ,8147 ,8161 ,8167 ,8171 ,8179 ,8191 ,8209 ,8219 ,8221 ,8231 ,8233 ,8237 ,8243 ,8263 ,8269 ,8273 ,8287 ,8291 ,8293 ,8297 ,8311 ,8317 ,8329 ,8353 ,8363 ,8369 ,8377 ,8387 ,8389 ,8419 ,8423 ,8429 ,8431 ,8443 ,8447 ,8461 ,8467 ,8501 ,8513 ,8521 ,8527 ,8537 ,8539 ,8543 ,8563 ,8573 ,8581 ,8597 ,8599 ,8609 ,8623 ,8627 ,8629 ,8641 ,8647 ,8663 ,8669 ,8677 ,8681 ,8689 ,8693 ,8699 ,8707 ,8713 ,8719 ,8731 ,8737 ,8741 ,8747 ,8753 ,8761 ,8779 ,8783 ,8803 ,8807 ,8819 ,8821 ,8831 ,8837 ,8839 ,8849 ,8861 ,8863 ,8867 ,8887 ,8893 ,8923 ,8929 ,8933 ,8941 ,8951 ,8963 ,8969 ,8971 ,8999 ,9001 ,9007 ,9011 ,9013 ,9029 ,9041 ,9043 ,9049 ,9059 ,9067 ,9091 ,9103 ,9109 ,9127 ,9133 ,9137 ,9151 ,9157 ,9161 ,9173 ,9181 ,9187 ,9199 ,9203 ,9209 ,9221 ,9227 ,9239 ,9241 ,9257 ,9277 ,9281 ,9283 ,9293 ,9311 ,9319 ,9323 ,9337 ,9341 ,9343 ,9349 ,9371 ,9377 ,9391 ,9397 ,9403 ,9413 ,9419 ,9421 ,9431 ,9433 ,9437 ,9439 ,9461 ,9463 ,9467 ,9473 ,9479 ,9491 ,9497 ,9511 ,9521 ,9533 ,9539 ,9547 ,9551 ,9587 ,9601 ,9613 ,9619 ,9623 ,9629 ,9631 ,9643 ,9649 ,9661 ,9677 ,9679 ,9689 ,9697 ,9719 ,9721 ,9733 ,9739 ,9743 ,9749 ,9767 ,9769 ,9781 ,9787 ,9791 ,9803 ,9811 ,9817 ,9829 ,9833 ,9839 ,9851 ,9857 ,9859 ,9871 ,9883 ,9887 ,9901 ,9907 ,9923 ,9929 ,9931 ,9941 ,9949 ,9967 ,9973};\n\t\tArrayList list = new ArrayList();\n\t\tfor(int i = 0; i < prime.length; i++) {\n\t\t\tif(prime[i] % 5 == 1) {\n\t\t\t\tlist.add(prime[i]);\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tSystem.out.print(list.get(i) + \" \");\n\t\t}\n\t}\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "sample_input": "5\n"}, "reference_outputs": ["3 5 7 11 31\n"], "source_document_id": "p03362", "source_text": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7576, "cpu_time_ms": 104, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s616495240", "group_id": "codeNet:p03362", "input_text": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n boolean[] isNotPrime = new boolean[55555];\n int c = 2;\n isNotPrime[0] = true;\n isNotPrime[1] = true;\n while (c < isNotPrime.length){\n for (int k = c;k < isNotPrime.length;k += c){\n isNotPrime[k] = true;\n }\n isNotPrime[c] = false;\n ++c;\n if(c >= isNotPrime.length){\n break;\n }\n //System.out.println(c);\n while (isNotPrime[c]){\n ++c;\n if(c >= isNotPrime.length){\n break;\n }\n }\n }\n int now[] = new int[n];\n now[0] = 2;\n int k = 1;\n for (int i = 1;i < n;++i){\n while (true){\n k += 2;\n if(!isNotPrime[k]){\n now[i] = k;\n break;\n }\n }\n }\n while (true){\n k += 2;\n if(!isNotPrime[k]){\n break;\n }\n }\n search(n,isNotPrime);\n //sout\n }\n\n\n public static void search(int n,boolean[] isNotPrime){\n int[] ret = new int[n];\n ret[0] = 2;\n ret[1] = 11;\n int last = 11;\n for (int i = 2;i < n;++i){\n while (true){\n last += 5;\n if(!isNotPrime[last]){\n ret[i] = last;\n break;\n }\n }\n }\n StringBuilder sb = new StringBuilder();\n for (int i = 0;i < ret.length;++i){\n sb.append(ret[i]);\n if(i + 1 != ret.length){\n sb.append(' ');\n }\n }\n System.out.println(sb.toString());\n }\n\n\n\n\n\n\n\n}", "language": "Java", "metadata": {"date": 1525573189, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03362.html", "problem_id": "p03362", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03362/input.txt", "sample_output_relpath": "derived/input_output/data/p03362/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03362/Java/s616495240.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s616495240", "user_id": "u530935768"}, "prompt_components": {"gold_output": "3 5 7 11 31\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String args[]){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n boolean[] isNotPrime = new boolean[55555];\n int c = 2;\n isNotPrime[0] = true;\n isNotPrime[1] = true;\n while (c < isNotPrime.length){\n for (int k = c;k < isNotPrime.length;k += c){\n isNotPrime[k] = true;\n }\n isNotPrime[c] = false;\n ++c;\n if(c >= isNotPrime.length){\n break;\n }\n //System.out.println(c);\n while (isNotPrime[c]){\n ++c;\n if(c >= isNotPrime.length){\n break;\n }\n }\n }\n int now[] = new int[n];\n now[0] = 2;\n int k = 1;\n for (int i = 1;i < n;++i){\n while (true){\n k += 2;\n if(!isNotPrime[k]){\n now[i] = k;\n break;\n }\n }\n }\n while (true){\n k += 2;\n if(!isNotPrime[k]){\n break;\n }\n }\n search(n,isNotPrime);\n //sout\n }\n\n\n public static void search(int n,boolean[] isNotPrime){\n int[] ret = new int[n];\n ret[0] = 2;\n ret[1] = 11;\n int last = 11;\n for (int i = 2;i < n;++i){\n while (true){\n last += 5;\n if(!isNotPrime[last]){\n ret[i] = last;\n break;\n }\n }\n }\n StringBuilder sb = new StringBuilder();\n for (int i = 0;i < ret.length;++i){\n sb.append(ret[i]);\n if(i + 1 != ret.length){\n sb.append(' ');\n }\n }\n System.out.println(sb.toString());\n }\n\n\n\n\n\n\n\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "sample_input": "5\n"}, "reference_outputs": ["3 5 7 11 31\n"], "source_document_id": "p03362", "source_text": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1934, "cpu_time_ms": 108, "memory_kb": 20692}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s821747159", "group_id": "codeNet:p03363", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tno1();\n\t}\n\n\tstatic void no1() {\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\t\tint n = sc.nextInt();\n\n\t\t\tlong[] a = new long[n];\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = sc.nextLong();\n\t\t\t}\n\n\t\t\tint count = 0;\n\t\t\tlong sum;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tsum = 0;\n\t\t\t\tfor (int j = i; j < n; j++) {\n\t\t\t\t\tsum = sum + a[j];\n\t\t\t\t\tif (sum == 0) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(count);\n\t\t}\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1524964937, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03363.html", "problem_id": "p03363", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03363/input.txt", "sample_output_relpath": "derived/input_output/data/p03363/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03363/Java/s821747159.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s821747159", "user_id": "u849943974"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tno1();\n\t}\n\n\tstatic void no1() {\n\t\ttry (Scanner sc = new Scanner(System.in)) {\n\t\t\tint n = sc.nextInt();\n\n\t\t\tlong[] a = new long[n];\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = sc.nextLong();\n\t\t\t}\n\n\t\t\tint count = 0;\n\t\t\tlong sum;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tsum = 0;\n\t\t\t\tfor (int j = i; j < n; j++) {\n\t\t\t\t\tsum = sum + a[j];\n\t\t\t\t\tif (sum == 0) {\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(count);\n\t\t}\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "sample_input": "6\n1 3 -4 2 2 -2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03363", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 517, "cpu_time_ms": 2109, "memory_kb": 83660}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s135698195", "group_id": "codeNet:p03371", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint a = scanner.nextInt(), b = scanner.nextInt(), c = scanner.nextInt();\n\t\t\tint x = scanner.nextInt(), y = scanner.nextInt();\n\t\t\tint min = Math.min(x, y) & (~1);\n\t\t\tint max = Math.max(x, y);\n\t\t\tmax = (1 == (max & 1)) ? max + 1 : max;\n\t\t\tSystem.out.println(Math.min(min * Math.min(a + b, 2 * c) + (x - min) * a + (y - min) * b, max * 2 * c));\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1585783153, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03371.html", "problem_id": "p03371", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03371/input.txt", "sample_output_relpath": "derived/input_output/data/p03371/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03371/Java/s135698195.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s135698195", "user_id": "u729186675"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\ttry (Scanner scanner = new Scanner(System.in)) {\n\t\t\tint a = scanner.nextInt(), b = scanner.nextInt(), c = scanner.nextInt();\n\t\t\tint x = scanner.nextInt(), y = scanner.nextInt();\n\t\t\tint min = Math.min(x, y) & (~1);\n\t\t\tint max = Math.max(x, y);\n\t\t\tmax = (1 == (max & 1)) ? max + 1 : max;\n\t\t\tSystem.out.println(Math.min(min * Math.min(a + b, 2 * c) + (x - min) * a + (y - min) * b, max * 2 * c));\n\t\t}\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03371", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 495, "cpu_time_ms": 95, "memory_kb": 23252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s755516649", "group_id": "codeNet:p03377", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String... args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong a = sc.nextLong();\n\t\tlong b = sc.nextLong();\n\t\tlong x = sc.nextLong();\n\n\t\tif (a > x) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t} else if (a + b < x) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t} else {\n\t\t\tSystem.out.println(\"YES\");\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1555113262, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03377.html", "problem_id": "p03377", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03377/input.txt", "sample_output_relpath": "derived/input_output/data/p03377/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03377/Java/s755516649.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s755516649", "user_id": "u533017901"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String... args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong a = sc.nextLong();\n\t\tlong b = sc.nextLong();\n\t\tlong x = sc.nextLong();\n\n\t\tif (a > x) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t} else if (a + b < x) {\n\t\t\tSystem.out.println(\"NO\");\n\t\t} else {\n\t\t\tSystem.out.println(\"YES\");\n\t\t}\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "sample_input": "3 5 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03377", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 356, "cpu_time_ms": 95, "memory_kb": 23508}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s308317526", "group_id": "codeNet:p03377", "input_text": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt(), b = sc.nextInt(), x = sc.nextInt();\n\t\tsc.close();\n\t\tString ans[] = {\"YES\", \"NO\"};\n\t\tint an = 0;\n\t\tif(a > x)an = 1;\n\t\tif(a + b < x)an = 1;\n\t\tSystem.out.println(ans[an]);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1553743790, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03377.html", "problem_id": "p03377", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03377/input.txt", "sample_output_relpath": "derived/input_output/data/p03377/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03377/Java/s308317526.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s308317526", "user_id": "u949927271"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt(), b = sc.nextInt(), x = sc.nextInt();\n\t\tsc.close();\n\t\tString ans[] = {\"YES\", \"NO\"};\n\t\tint an = 0;\n\t\tif(a > x)an = 1;\n\t\tif(a + b < x)an = 1;\n\t\tSystem.out.println(ans[an]);\n\t}\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "sample_input": "3 5 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03377", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 322, "cpu_time_ms": 103, "memory_kb": 20948}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s538396352", "group_id": "codeNet:p03377", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint x = sc.nextInt();\n\t\tsc.close();\n\n\t\tif(a <= x && x <= a+b) System.out.println(\"YES\");\n\t\telse System.out.println(\"NO\");\n\t}\n}", "language": "Java", "metadata": {"date": 1529275790, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03377.html", "problem_id": "p03377", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03377/input.txt", "sample_output_relpath": "derived/input_output/data/p03377/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03377/Java/s538396352.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s538396352", "user_id": "u850456066"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\t\tint x = sc.nextInt();\n\t\tsc.close();\n\n\t\tif(a <= x && x <= a+b) System.out.println(\"YES\");\n\t\telse System.out.println(\"NO\");\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "sample_input": "3 5 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03377", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 343, "cpu_time_ms": 95, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s007776929", "group_id": "codeNet:p03377", "input_text": "import java.util.*;\n\nclass Main{\n\t\n\tpublic static void main(String args[]){\n\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint N = sc.nextInt();\n\n\t\tif(N-A>=0 && N-A<=B) System.out.println(\"YES\");\n\t\telse System.out.println(\"NO\");\n\n\t}\n}", "language": "Java", "metadata": {"date": 1523755060, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03377.html", "problem_id": "p03377", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03377/input.txt", "sample_output_relpath": "derived/input_output/data/p03377/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03377/Java/s007776929.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s007776929", "user_id": "u325124437"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.util.*;\n\nclass Main{\n\t\n\tpublic static void main(String args[]){\n\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint N = sc.nextInt();\n\n\t\tif(N-A>=0 && N-A<=B) System.out.println(\"YES\");\n\t\telse System.out.println(\"NO\");\n\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "sample_input": "3 5 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03377", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 280, "cpu_time_ms": 160, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s307516499", "group_id": "codeNet:p03378", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int m = sc.nextInt();\n int x = sc.nextInt();\n int[] nums = new int[m];\n\n for (int i = 0; i < m; i++) {\n nums[i] = sc.nextInt();\n }\n sc.close();\n\n int num = 0;\n\n for (int i = 0; i < m; i++) {\n if (nums[i] >= x) {\n num++;\n }\n }\n int ans = Math.min(m - num, num);\n System.out.println(ans);\n }\n}", "language": "Java", "metadata": {"date": 1531524749, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03378.html", "problem_id": "p03378", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03378/input.txt", "sample_output_relpath": "derived/input_output/data/p03378/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03378/Java/s307516499.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s307516499", "user_id": "u291178324"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int m = sc.nextInt();\n int x = sc.nextInt();\n int[] nums = new int[m];\n\n for (int i = 0; i < m; i++) {\n nums[i] = sc.nextInt();\n }\n sc.close();\n\n int num = 0;\n\n for (int i = 0; i < m; i++) {\n if (nums[i] >= x) {\n num++;\n }\n }\n int ans = Math.min(m - num, num);\n System.out.println(ans);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.\n\nInitially, you are in Square X.\nYou can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N.\nHowever, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1.\nIt is guaranteed that there is no toll gate in Square 0, Square X and Square N.\n\nFind the minimum cost incurred before reaching the goal.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\n1 \\leq X \\leq N - 1\n\n1 \\leq A_1 < A_2 < ... < A_M \\leq N\n\nA_i \\neq X\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the minimum cost incurred before reaching the goal.\n\nSample Input 1\n\n5 3 3\n1 2 4\n\nSample Output 1\n\n1\n\nThe optimal solution is as follows:\n\nFirst, travel from Square 3 to Square 4. Here, there is a toll gate in Square 4, so the cost of 1 is incurred.\n\nThen, travel from Square 4 to Square 5. This time, no cost is incurred.\n\nNow, we are in Square 5 and we have reached the goal.\n\nIn this case, the total cost incurred is 1.\n\nSample Input 2\n\n7 3 2\n4 5 6\n\nSample Output 2\n\n0\n\nWe may be able to reach the goal at no cost.\n\nSample Input 3\n\n10 7 5\n1 2 3 4 6 8 9\n\nSample Output 3\n\n3", "sample_input": "5 3 3\n1 2 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03378", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.\n\nInitially, you are in Square X.\nYou can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N.\nHowever, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1.\nIt is guaranteed that there is no toll gate in Square 0, Square X and Square N.\n\nFind the minimum cost incurred before reaching the goal.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\n1 \\leq X \\leq N - 1\n\n1 \\leq A_1 < A_2 < ... < A_M \\leq N\n\nA_i \\neq X\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the minimum cost incurred before reaching the goal.\n\nSample Input 1\n\n5 3 3\n1 2 4\n\nSample Output 1\n\n1\n\nThe optimal solution is as follows:\n\nFirst, travel from Square 3 to Square 4. Here, there is a toll gate in Square 4, so the cost of 1 is incurred.\n\nThen, travel from Square 4 to Square 5. This time, no cost is incurred.\n\nNow, we are in Square 5 and we have reached the goal.\n\nIn this case, the total cost incurred is 1.\n\nSample Input 2\n\n7 3 2\n4 5 6\n\nSample Output 2\n\n0\n\nWe may be able to reach the goal at no cost.\n\nSample Input 3\n\n10 7 5\n1 2 3 4 6 8 9\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 587, "cpu_time_ms": 103, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s439810238", "group_id": "codeNet:p03385", "input_text": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n Solver solver = new Solver();\n solver.solve(in,out);\n out.close();\n\n }\n\n static class Solver{\n boolean[] visited;\n ArrayList[] adjList;\n\n public void solve(InputReader in, OutputWriter out){\n char[] s = in.next().toCharArray();\n int a =0;\n int b=0;\n int c=0;\n for(char i:s){\n switch (i){\n case 'a':a++; break;\n case 'b':b++; break;\n case 'c': c++; break;\n }\n }\n if(a==b && a==c && a==1){\n out.printf(\"Yes\");\n }\n else{\n out.printf(\"No\");\n }\n\n }\n\n\n private void dfs(int u){\n visited[u] = true;\n for(int v: adjList[u]){\n if(!visited[v]){\n dfs(v);\n }\n }\n }\n\n private void bfs(int s) {\n Queue q = new LinkedList();\n q.add(s);\n visited[s] = true;\n while(!q.isEmpty()) {\n int u = q.remove();\n for(int v: adjList[u])\n if(!visited[v]) {\n visited[v] = true;\n q.add(v);\n }\n }\n }\n\n private int[] nextAInt(int n, InputReader in){\n int arr[] = new int[n];\n for(int i=0;i= this.numChars) {\n this.curChar = 0;\n\n try {\n this.numChars = this.stream.read(this.buf);\n } catch (IOException var2) {\n throw new InputMismatchException();\n }\n\n if (this.numChars <= 0) {\n return -1;\n }\n }\n\n return this.buf[this.curChar++];\n }\n }\n\n public int nextInt() {\n int c;\n for (c = this.read(); isSpaceChar(c); c = this.read()) {\n ;\n }\n\n byte sgn = 1;\n if (c == 45) {\n sgn = -1;\n c = this.read();\n }\n\n int res = 0;\n\n while (c >= 48 && c <= 57) {\n res *= 10;\n res += c - 48;\n c = this.read();\n if (isSpaceChar(c)) {\n return res * sgn;\n }\n }\n\n throw new InputMismatchException();\n }\n\n public String next() {\n int c;\n while (isSpaceChar(c = this.read())) {\n ;\n }\n\n StringBuilder result = new StringBuilder();\n result.appendCodePoint(c);\n\n while (!isSpaceChar(c = this.read())) {\n result.appendCodePoint(c);\n }\n\n return result.toString();\n }\n\n public static boolean isSpaceChar(int c) {\n return c == 32 || c == 10 || c == 13 || c == 9 || c == -1;\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void printf(String format, Object... objects) {\n writer.printf(format, objects);\n }\n\n public void close() {\n writer.close();\n }\n\n }\n\n\n}", "language": "Java", "metadata": {"date": 1597039989, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03385.html", "problem_id": "p03385", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03385/input.txt", "sample_output_relpath": "derived/input_output/data/p03385/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03385/Java/s439810238.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s439810238", "user_id": "u729546917"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n Solver solver = new Solver();\n solver.solve(in,out);\n out.close();\n\n }\n\n static class Solver{\n boolean[] visited;\n ArrayList[] adjList;\n\n public void solve(InputReader in, OutputWriter out){\n char[] s = in.next().toCharArray();\n int a =0;\n int b=0;\n int c=0;\n for(char i:s){\n switch (i){\n case 'a':a++; break;\n case 'b':b++; break;\n case 'c': c++; break;\n }\n }\n if(a==b && a==c && a==1){\n out.printf(\"Yes\");\n }\n else{\n out.printf(\"No\");\n }\n\n }\n\n\n private void dfs(int u){\n visited[u] = true;\n for(int v: adjList[u]){\n if(!visited[v]){\n dfs(v);\n }\n }\n }\n\n private void bfs(int s) {\n Queue q = new LinkedList();\n q.add(s);\n visited[s] = true;\n while(!q.isEmpty()) {\n int u = q.remove();\n for(int v: adjList[u])\n if(!visited[v]) {\n visited[v] = true;\n q.add(v);\n }\n }\n }\n\n private int[] nextAInt(int n, InputReader in){\n int arr[] = new int[n];\n for(int i=0;i= this.numChars) {\n this.curChar = 0;\n\n try {\n this.numChars = this.stream.read(this.buf);\n } catch (IOException var2) {\n throw new InputMismatchException();\n }\n\n if (this.numChars <= 0) {\n return -1;\n }\n }\n\n return this.buf[this.curChar++];\n }\n }\n\n public int nextInt() {\n int c;\n for (c = this.read(); isSpaceChar(c); c = this.read()) {\n ;\n }\n\n byte sgn = 1;\n if (c == 45) {\n sgn = -1;\n c = this.read();\n }\n\n int res = 0;\n\n while (c >= 48 && c <= 57) {\n res *= 10;\n res += c - 48;\n c = this.read();\n if (isSpaceChar(c)) {\n return res * sgn;\n }\n }\n\n throw new InputMismatchException();\n }\n\n public String next() {\n int c;\n while (isSpaceChar(c = this.read())) {\n ;\n }\n\n StringBuilder result = new StringBuilder();\n result.appendCodePoint(c);\n\n while (!isSpaceChar(c = this.read())) {\n result.appendCodePoint(c);\n }\n\n return result.toString();\n }\n\n public static boolean isSpaceChar(int c) {\n return c == 32 || c == 10 || c == 13 || c == 9 || c == -1;\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void printf(String format, Object... objects) {\n writer.printf(format, objects);\n }\n\n public void close() {\n writer.close();\n }\n\n }\n\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.\n\nConstraints\n\n|S|=3\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S can be obtained by permuting abc, print Yes; otherwise, print No.\n\nSample Input 1\n\nbac\n\nSample Output 1\n\nYes\n\nSwapping the first and second characters in bac results in abc.\n\nSample Input 2\n\nbab\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nabc\n\nSample Output 3\n\nYes\n\nSample Input 4\n\naaa\n\nSample Output 4\n\nNo", "sample_input": "bac\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03385", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.\n\nConstraints\n\n|S|=3\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S can be obtained by permuting abc, print Yes; otherwise, print No.\n\nSample Input 1\n\nbac\n\nSample Output 1\n\nYes\n\nSwapping the first and second characters in bac results in abc.\n\nSample Input 2\n\nbab\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nabc\n\nSample Output 3\n\nYes\n\nSample Input 4\n\naaa\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4509, "cpu_time_ms": 95, "memory_kb": 34060}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s945505416", "group_id": "codeNet:p03385", "input_text": "import java.util.*;\npublic class Main {\n public static void main (String[] args) {\n Scanner sc = new Scanner(System.in);\n String str = sc.next();\n char[] array = str.toCharArray();\n Arrays.sort(array);\n String sortedStr = new String(array);\n String ans = (sortedStr.equals(\"abc\"))? \"Yes\" : \"No\";\n \n System.out.println(ans);\n }\n}", "language": "Java", "metadata": {"date": 1594248005, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03385.html", "problem_id": "p03385", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03385/input.txt", "sample_output_relpath": "derived/input_output/data/p03385/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03385/Java/s945505416.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s945505416", "user_id": "u442877951"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n public static void main (String[] args) {\n Scanner sc = new Scanner(System.in);\n String str = sc.next();\n char[] array = str.toCharArray();\n Arrays.sort(array);\n String sortedStr = new String(array);\n String ans = (sortedStr.equals(\"abc\"))? \"Yes\" : \"No\";\n \n System.out.println(ans);\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.\n\nConstraints\n\n|S|=3\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S can be obtained by permuting abc, print Yes; otherwise, print No.\n\nSample Input 1\n\nbac\n\nSample Output 1\n\nYes\n\nSwapping the first and second characters in bac results in abc.\n\nSample Input 2\n\nbab\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nabc\n\nSample Output 3\n\nYes\n\nSample Input 4\n\naaa\n\nSample Output 4\n\nNo", "sample_input": "bac\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03385", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.\n\nConstraints\n\n|S|=3\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S can be obtained by permuting abc, print Yes; otherwise, print No.\n\nSample Input 1\n\nbac\n\nSample Output 1\n\nYes\n\nSwapping the first and second characters in bac results in abc.\n\nSample Input 2\n\nbab\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nabc\n\nSample Output 3\n\nYes\n\nSample Input 4\n\naaa\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 374, "cpu_time_ms": 114, "memory_kb": 35620}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s046542868", "group_id": "codeNet:p03385", "input_text": "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tif(s.matches(\"^(?=.*a)(?=.*b)(?=.*c).*\")) {\n\t\t\tSystem.out.println(\"Yes\");\n\t\t} else {\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1562721563, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03385.html", "problem_id": "p03385", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03385/input.txt", "sample_output_relpath": "derived/input_output/data/p03385/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03385/Java/s046542868.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s046542868", "user_id": "u153556810"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tif(s.matches(\"^(?=.*a)(?=.*b)(?=.*c).*\")) {\n\t\t\tSystem.out.println(\"Yes\");\n\t\t} else {\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\n\t}\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.\n\nConstraints\n\n|S|=3\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S can be obtained by permuting abc, print Yes; otherwise, print No.\n\nSample Input 1\n\nbac\n\nSample Output 1\n\nYes\n\nSwapping the first and second characters in bac results in abc.\n\nSample Input 2\n\nbab\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nabc\n\nSample Output 3\n\nYes\n\nSample Input 4\n\naaa\n\nSample Output 4\n\nNo", "sample_input": "bac\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03385", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.\n\nConstraints\n\n|S|=3\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S can be obtained by permuting abc, print Yes; otherwise, print No.\n\nSample Input 1\n\nbac\n\nSample Output 1\n\nYes\n\nSwapping the first and second characters in bac results in abc.\n\nSample Input 2\n\nbab\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nabc\n\nSample Output 3\n\nYes\n\nSample Input 4\n\naaa\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 281, "cpu_time_ms": 90, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s860966114", "group_id": "codeNet:p03386", "input_text": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));\n\t\tint[] input = Arrays.stream(stdin.readLine().split(\" \")).mapToInt(Integer::parseInt).toArray();\n\t\tint[] nums = IntStream.rangeClosed(input[0], input[1]).toArray();\n\t\tIntStream.range(0, nums.length).filter( i -> (i < input[2] || nums.length - 1 -input[2] < i) ).sorted().forEach(i -> System.out.println(nums[i]));\n\t}\n}", "language": "Java", "metadata": {"date": 1553698182, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03386.html", "problem_id": "p03386", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03386/input.txt", "sample_output_relpath": "derived/input_output/data/p03386/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03386/Java/s860966114.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s860966114", "user_id": "u363338355"}, "prompt_components": {"gold_output": "3\n4\n7\n8\n", "input_to_evaluate": "import java.io.*;\nimport java.util.Arrays;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tBufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));\n\t\tint[] input = Arrays.stream(stdin.readLine().split(\" \")).mapToInt(Integer::parseInt).toArray();\n\t\tint[] nums = IntStream.rangeClosed(input[0], input[1]).toArray();\n\t\tIntStream.range(0, nums.length).filter( i -> (i < input[2] || nums.length - 1 -input[2] < i) ).sorted().forEach(i -> System.out.println(nums[i]));\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "sample_input": "3 8 2\n"}, "reference_outputs": ["3\n4\n7\n8\n"], "source_document_id": "p03386", "source_text": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 558, "cpu_time_ms": 298, "memory_kb": 47316}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s162781899", "group_id": "codeNet:p03389", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int[] a = new int[3];\n a[0] = sc.nextInt();\n a[1] = sc.nextInt();\n a[2] = sc.nextInt();\n Arrays.sort(a);\n\n if (a[0] == a[1] && a[1] == a[2]) {\n System.out.println(0);\n return;\n }\n\n int ans = 0;\n int d1 = a[2] - a[0];\n int d2 = a[2] - a[1];\n ans += d1 / 2 + d2 / 2;\n\n if (d1 % 2 == 0) {\n if (d2 % 2 == 0) {\n\n } else {\n ans += 2;\n }\n } else {\n if (d2 % 2 == 0) {\n ans += 2;\n } else {\n ans += 1;\n }\n }\n\n System.out.println(ans);\n }\n}", "language": "Java", "metadata": {"date": 1523149640, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03389.html", "problem_id": "p03389", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03389/input.txt", "sample_output_relpath": "derived/input_output/data/p03389/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03389/Java/s162781899.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s162781899", "user_id": "u097204018"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int[] a = new int[3];\n a[0] = sc.nextInt();\n a[1] = sc.nextInt();\n a[2] = sc.nextInt();\n Arrays.sort(a);\n\n if (a[0] == a[1] && a[1] == a[2]) {\n System.out.println(0);\n return;\n }\n\n int ans = 0;\n int d1 = a[2] - a[0];\n int d2 = a[2] - a[1];\n ans += d1 / 2 + d2 / 2;\n\n if (d1 % 2 == 0) {\n if (d2 % 2 == 0) {\n\n } else {\n ans += 2;\n }\n } else {\n if (d2 % 2 == 0) {\n ans += 2;\n } else {\n ans += 1;\n }\n }\n\n System.out.println(ans);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:\n\nChoose two among A, B and C, then increase both by 1.\n\nChoose one among A, B and C, then increase it by 2.\n\nIt can be proved that we can always make A, B and C all equal by repeatedly performing these operations.\n\nConstraints\n\n0 \\leq A,B,C \\leq 50\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum number of operations required to make A, B and C all equal.\n\nSample Input 1\n\n2 5 4\n\nSample Output 1\n\n2\n\nWe can make A, B and C all equal by the following operations:\n\nIncrease A and C by 1. Now, A, B, C are 3, 5, 5, respectively.\n\nIncrease A by 2. Now, A, B, C are 5, 5, 5, respectively.\n\nSample Input 2\n\n2 6 3\n\nSample Output 2\n\n5\n\nSample Input 3\n\n31 41 5\n\nSample Output 3\n\n23", "sample_input": "2 5 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03389", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:\n\nChoose two among A, B and C, then increase both by 1.\n\nChoose one among A, B and C, then increase it by 2.\n\nIt can be proved that we can always make A, B and C all equal by repeatedly performing these operations.\n\nConstraints\n\n0 \\leq A,B,C \\leq 50\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum number of operations required to make A, B and C all equal.\n\nSample Input 1\n\n2 5 4\n\nSample Output 1\n\n2\n\nWe can make A, B and C all equal by the following operations:\n\nIncrease A and C by 1. Now, A, B, C are 3, 5, 5, respectively.\n\nIncrease A by 2. Now, A, B, C are 5, 5, 5, respectively.\n\nSample Input 2\n\n2 6 3\n\nSample Output 2\n\n5\n\nSample Input 3\n\n31 41 5\n\nSample Output 3\n\n23", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 803, "cpu_time_ms": 137, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s932455815", "group_id": "codeNet:p03394", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.PrintStream;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author ankur\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int three = 2;\n int two = -1;\n if (n == 3) {\n out.print(2 + \" \" + 5 + \" \" + 63);\n return;\n }\n while (true) {\n //int y=1;\n int val = n - three;\n if (val > 0 && val <= 15000 && (val % 3 == 0 || val % 3 == 2)) {\n two = val;\n break;\n }\n three += 2;\n }\n System.out.println(two + \" \" + three);\n int ct = 2;\n if (two != -1) {\n while (two > 0) {\n\n out.print(ct + \" \");\n ct += 2;\n two--;\n }\n ct = 3;\n while (three > 0) {\n out.print(ct + \" \");\n ct += 6;\n three--;\n }\n }\n\n }\n\n }\n\n static class InputReader {\n private final InputStream stream;\n private final byte[] buf = new byte[8192];\n private int curChar;\n private int snumChars;\n\n public InputReader(InputStream st) {\n this.stream = st;\n }\n\n public int read() {\n //*-*------clare------\n//remeber while comparing 2 non primitive data type not to use ==\n//remember Arrays.sort for primitive data has worst time case complexity of 0(n^2) bcoz it uses quick sort\n//again silly mistakes ,yr kb tk krta rhega ye mistakes\n//try to write simple codes ,break it into simple things\n//knowledge>rating\n /*\n public class Main\n implements Runnable{\n public static void main(String[] args) {\n new Thread(null,new Main(),\"Main\",1<<26).start();\n\n }\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();//chenge the name of task\n solver.solve(1, in, out);\n out.close();\n }\n */\n\n if (snumChars == -1)\n throw new InputMismatchException();\n if (curChar >= snumChars) {\n curChar = 0;\n try {\n snumChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (snumChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1522559287, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03394.html", "problem_id": "p03394", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03394/input.txt", "sample_output_relpath": "derived/input_output/data/p03394/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03394/Java/s932455815.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s932455815", "user_id": "u112403532"}, "prompt_components": {"gold_output": "2 5 63\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.PrintStream;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author ankur\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n = in.nextInt();\n int three = 2;\n int two = -1;\n if (n == 3) {\n out.print(2 + \" \" + 5 + \" \" + 63);\n return;\n }\n while (true) {\n //int y=1;\n int val = n - three;\n if (val > 0 && val <= 15000 && (val % 3 == 0 || val % 3 == 2)) {\n two = val;\n break;\n }\n three += 2;\n }\n System.out.println(two + \" \" + three);\n int ct = 2;\n if (two != -1) {\n while (two > 0) {\n\n out.print(ct + \" \");\n ct += 2;\n two--;\n }\n ct = 3;\n while (three > 0) {\n out.print(ct + \" \");\n ct += 6;\n three--;\n }\n }\n\n }\n\n }\n\n static class InputReader {\n private final InputStream stream;\n private final byte[] buf = new byte[8192];\n private int curChar;\n private int snumChars;\n\n public InputReader(InputStream st) {\n this.stream = st;\n }\n\n public int read() {\n //*-*------clare------\n//remeber while comparing 2 non primitive data type not to use ==\n//remember Arrays.sort for primitive data has worst time case complexity of 0(n^2) bcoz it uses quick sort\n//again silly mistakes ,yr kb tk krta rhega ye mistakes\n//try to write simple codes ,break it into simple things\n//knowledge>rating\n /*\n public class Main\n implements Runnable{\n public static void main(String[] args) {\n new Thread(null,new Main(),\"Main\",1<<26).start();\n\n }\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();//chenge the name of task\n solver.solve(1, in, out);\n out.close();\n }\n */\n\n if (snumChars == -1)\n throw new InputMismatchException();\n if (curChar >= snumChars) {\n curChar = 0;\n try {\n snumChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (snumChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n public int nextInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n }\n}\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nNagase is a top student in high school. One day, she's analyzing some properties of special sets of positive integers.\n\nShe thinks that a set S = \\{a_{1}, a_{2}, ..., a_{N}\\} of distinct positive integers is called special if for all 1 \\leq i \\leq N, the gcd (greatest common divisor) of a_{i} and the sum of the remaining elements of S is not 1.\n\nNagase wants to find a special set of size N. However, this task is too easy, so she decided to ramp up the difficulty. Nagase challenges you to find a special set of size N such that the gcd of all elements are 1 and the elements of the set does not exceed 30000.\n\nConstraints\n\n3 \\leq N \\leq 20000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nOutput N space-separated integers, denoting the elements of the set S. S must satisfy the following conditions :\n\nThe elements must be distinct positive integers not exceeding 30000.\n\nThe gcd of all elements of S is 1, i.e. there does not exist an integer d > 1 that divides all elements of S.\n\nS is a special set.\n\nIf there are multiple solutions, you may output any of them. The elements of S may be printed in any order. It is guaranteed that at least one solution exist under the given contraints.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2 5 63\n\n\\{2, 5, 63\\} is special because gcd(2, 5 + 63) = 2, gcd(5, 2 + 63) = 5, gcd(63, 2 + 5) = 7. Also, gcd(2, 5, 63) = 1. Thus, this set satisfies all the criteria.\n\nNote that \\{2, 4, 6\\} is not a valid solution because gcd(2, 4, 6) = 2 > 1.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n2 5 20 63\n\n\\{2, 5, 20, 63\\} is special because gcd(2, 5 + 20 + 63) = 2, gcd(5, 2 + 20 + 63) = 5, gcd(20, 2 + 5 + 63) = 10, gcd(63, 2 + 5 + 20) = 9. Also, gcd(2, 5, 20, 63) = 1. Thus, this set satisfies all the criteria.", "sample_input": "3\n"}, "reference_outputs": ["2 5 63\n"], "source_document_id": "p03394", "source_text": "Score : 600 points\n\nProblem Statement\n\nNagase is a top student in high school. One day, she's analyzing some properties of special sets of positive integers.\n\nShe thinks that a set S = \\{a_{1}, a_{2}, ..., a_{N}\\} of distinct positive integers is called special if for all 1 \\leq i \\leq N, the gcd (greatest common divisor) of a_{i} and the sum of the remaining elements of S is not 1.\n\nNagase wants to find a special set of size N. However, this task is too easy, so she decided to ramp up the difficulty. Nagase challenges you to find a special set of size N such that the gcd of all elements are 1 and the elements of the set does not exceed 30000.\n\nConstraints\n\n3 \\leq N \\leq 20000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nOutput N space-separated integers, denoting the elements of the set S. S must satisfy the following conditions :\n\nThe elements must be distinct positive integers not exceeding 30000.\n\nThe gcd of all elements of S is 1, i.e. there does not exist an integer d > 1 that divides all elements of S.\n\nS is a special set.\n\nIf there are multiple solutions, you may output any of them. The elements of S may be printed in any order. It is guaranteed that at least one solution exist under the given contraints.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2 5 63\n\n\\{2, 5, 63\\} is special because gcd(2, 5 + 63) = 2, gcd(5, 2 + 63) = 5, gcd(63, 2 + 5) = 7. Also, gcd(2, 5, 63) = 1. Thus, this set satisfies all the criteria.\n\nNote that \\{2, 4, 6\\} is not a valid solution because gcd(2, 4, 6) = 2 > 1.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n2 5 20 63\n\n\\{2, 5, 20, 63\\} is special because gcd(2, 5 + 20 + 63) = 2, gcd(5, 2 + 20 + 63) = 5, gcd(20, 2 + 5 + 63) = 10, gcd(63, 2 + 5 + 20) = 9. Also, gcd(2, 5, 20, 63) = 1. Thus, this set satisfies all the criteria.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4016, "cpu_time_ms": 107, "memory_kb": 25812}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s359587829", "group_id": "codeNet:p03399", "input_text": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n static int[] w = new int[100010];\n static int[] v = new int[100010];\n static int[][] dp = new int[110][100010];\n static int k;\n\n static int chmin(int a, int b) {\n if (a > b) {\n a = b;\n return a;\n }\n return a;\n }\n\n static int chmax(int a, int b) {\n if (a < b) {\n a = b;\n return a;\n }\n return a;\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int train = sc.nextInt();\n int fTrain = sc.nextInt();\n int bus = sc.nextInt();\n int fBus = sc.nextInt();\n System.out.println(Math.min(train, fTrain) + Math.min(bus, fBus));\n\n }\n}\n", "language": "Java", "metadata": {"date": 1570130999, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/Java/s359587829.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359587829", "user_id": "u369190981"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n static int[] w = new int[100010];\n static int[] v = new int[100010];\n static int[][] dp = new int[110][100010];\n static int k;\n\n static int chmin(int a, int b) {\n if (a > b) {\n a = b;\n return a;\n }\n return a;\n }\n\n static int chmax(int a, int b) {\n if (a < b) {\n a = b;\n return a;\n }\n return a;\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int train = sc.nextInt();\n int fTrain = sc.nextInt();\n int bus = sc.nextInt();\n int fBus = sc.nextInt();\n System.out.println(Math.min(train, fTrain) + Math.min(bus, fBus));\n\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 815, "cpu_time_ms": 121, "memory_kb": 79956}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s262850940", "group_id": "codeNet:p03399", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Optional;\nimport java.util.Set;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t}\n\n\tprivate void solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\tint D = sc.nextInt();\n\t\tSystem.out.println(Math.min(A, B) + Math.min(C, D));\n\t}\n\n\tclass Scanner {\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int index;\n\t\tprivate int length;\n\n\t\tpublic Scanner(InputStream in) {\n\t\t\tthis.in = in;\n\t\t}\n\n\t\tprivate boolean isPrintableChar(int c) {\n\t\t\treturn '!' <= c && c <= '~';\n\t\t}\n\n\t\tprivate boolean isDigit(int c) {\n\t\t\treturn '0' <= c && c <= '9';\n\t\t}\n\n\t\tprivate boolean hasNextByte() {\n\t\t\tif (index < length) {\n\t\t\t\treturn true;\n\t\t\t} else {\n\t\t\t\ttry {\n\t\t\t\t\tlength = in.read(buffer);\n\t\t\t\t\tindex = 0;\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\treturn length > 0;\n\t\t\t}\n\t\t}\n\n\t\tprivate boolean hasNext() {\n\t\t\twhile (hasNextByte() && !isPrintableChar(buffer[index])) {\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\treturn hasNextByte() ? buffer[index++] : -1;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext()) {\n\t\t\t\tthrow new RuntimeException(\"no input\");\n\t\t\t}\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (isPrintableChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext()) {\n\t\t\t\tthrow new RuntimeException(\"no input\");\n\t\t\t}\n\t\t\tlong value = 0L;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\twhile (isPrintableChar(b)) {\n\t\t\t\tif (isDigit(b)) {\n\t\t\t\t\tvalue = value * 10 + (b - '0');\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn minus ? -value : value;\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn (int)nextLong();\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n\n\tclass DfsResolver {\n\t\tGraph g;\n\t\tSet used;\n\n\t\tpublic DfsResolver(Graph g) {\n\t\t\tthis.g = g;\n\t\t\tused = new HashSet<>();\n\t\t}\n\n\t\tvoid search(int start) {\n\t\t\tused.add(start);\n\t\t\t//for (;false;) {}\n\t\t}\n\t}\n\n\tclass MapSetGraph implements Graph {\n\t\tMap> map = new HashMap<>();\n\t\tint vertexNum = 0;\n\n\t\t@Override\n\t\tpublic void link(int from, int to, long cost) {\n\t\t\tif (!map.containsKey(from)) {\n\t\t\t\tmap.put(from, new HashSet<>());\n\t\t\t}\n\t\t\tmap.get(from).add(new Edge(to, cost));\n\t\t\tif (vertexNum < from + 1) {\n\t\t\t\tvertexNum = from + 1;\n\t\t\t}\n\t\t\tif (vertexNum < to + 1) {\n\t\t\t\tvertexNum = to + 1;\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic Optional getCost(int from, int to) {\n\t\t\tif (map.containsKey(from)) {\n\t\t\t\tfor (Edge e : map.get(from)) {\n\t\t\t\t\tif (e.to == to) {\n\t\t\t\t\t\treturn Optional.of(e.cost);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn Optional.ofNullable(null);\n\t\t}\n\n\t\t@Override\n\t\tpublic int getVertexNum() {\n\t\t\t// linkメソッドで渡される頂点IDが0-indexの前提に立った実装\n\t\t\treturn vertexNum;\n\t\t}\n\n\t\t@Override\n\t\tpublic Set getAdjs(int from) {\n\t\t\tif (!map.containsKey(from)) {\n\t\t\t\treturn new HashSet<>();\n\t\t\t}\n\t\t\treturn map.get(from);\n\t\t}\n\t}\n\n\tinterface CombCalculator {\n\t\tlong comb(int n, int m);\n\t}\n\n\tinterface MobiusFunction {\n\t\tint get(int n);\n\t}\n\n\t/**\n\t * メビウス関数をエラトステネスの篩っぽく前計算するクラスです。\n\t * 計算量はO(1)で、前計算でO(N logN)です。\n\t */\n\tclass SieveMobiusFunction implements MobiusFunction {\n\t\tint size;\n\t\tint[] mobiusFunctionValues;\n\n\t\tpublic SieveMobiusFunction(int size) {\n\t\t\tthis.size = size;\n\t\t\tmobiusFunctionValues = new int[size];\n\n\t\t\tmobiusFunctionValues[0] = 0;\n\t\t\tmobiusFunctionValues[1] = 1;\n\t\t\tfor (int i = 2; i < size; i++) {\n\t\t\t\tmobiusFunctionValues[i] = 1;\n\t\t\t}\n\t\t\tfor (int i = 2; i * i < size; i++) {\n\t\t\t\tfor (int k = 1; i * i * k < size; k++) {\n\t\t\t\t\tmobiusFunctionValues[i * i * k] *= 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (int i = 2; i < size; i++) {\n\t\t\t\tif (mobiusFunctionValues[i] == 1) {\n\t\t\t\t\tfor (int k = 1; i * k < size; k++) {\n\t\t\t\t\t\tmobiusFunctionValues[i * k] *= -2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (mobiusFunctionValues[i] > 1) {\n\t\t\t\t\tmobiusFunctionValues[i] = 1;\n\t\t\t\t}\n\t\t\t\tif (mobiusFunctionValues[i] < -1) {\n\t\t\t\t\tmobiusFunctionValues[i] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic int get(int n) {\n\t\t\tif (n > size) {\n\t\t\t\tthrow new RuntimeException(\"n is greater than size.\");\n\t\t\t}\n\t\t\tif (n < 0) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\treturn mobiusFunctionValues[n];\n\t\t}\n\t}\n\n\t/**\n\t * メビウス関数を定義通り計算するクラスです。\n\t * 計算量はO(logN)です。\n\t */\n\tclass PrimeFactorizationMobiusFunction implements MobiusFunction {\n\t\t@Override\n\t\tpublic int get(int n) {\n\t\t\tif (n <= 0) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (n == 1) {\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tint num = 0;\n\t\t\tfor (int i = 2; i < n; i++) {\n\t\t\t\tif (n % i == 0) {\n\t\t\t\t\tn /= i;\n\t\t\t\t\tnum++;\n\t\t\t\t\tif (n % i == 0) {\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn num % 2 == 0 ? -1 : 1;\n\t\t}\n\t}\n\n\t/**\n\t * 組み合わせ計算を階乗の値で行うクラスです(MOD対応)\n\t * 階乗とその逆元は前計算してテーブルに格納します。\n\t * C(N, N) % M の計算量は O(1)、 前計算でO(max(N, logM))です。\n\t * sizeを1e8より大きい値で実行するとMLEの危険性があります。\n\t * また素数以外のMODには対応していません(逆元の計算に素数の剰余環の性質を利用しているため)。\n\t */\n\tclass FactorialTableCombCalculator implements CombCalculator {\n\t\tint size;\n\t\tlong[] factorialTable;\n\t\tlong[] inverseFactorialTable;\n\t\tlong mod;\n\n\t\tpublic FactorialTableCombCalculator(int size, long mod) {\n\t\t\tthis.size = size;\n\t\t\tfactorialTable = new long[size + 1];\n\t\t\tinverseFactorialTable = new long[size + 1];\n\t\t\tthis.mod = mod;\n\n\t\t\tfactorialTable[0] = 1L;\n\t\t\tfor (int i = 1; i <= size; i++) {\n\t\t\t\tfactorialTable[i] = (factorialTable[i - 1] * i) % mod;\n\t\t\t}\n\t\t\tinverseFactorialTable[size] = inverse(factorialTable[size], mod);\n\t\t\tfor (int i = size - 1; i >= 0; i--) {\n\t\t\t\tinverseFactorialTable[i] = (inverseFactorialTable[i + 1] * (i + 1)) % mod;\n\t\t\t}\n\t\t}\n\n\t\tprivate long inverse(long n, long mod) {\n\t\t\treturn pow(n, mod - 2, mod);\n\t\t}\n\n\t\tprivate long pow(long n, long p, long mod) {\n\t\t\tif (p == 0) {\n\t\t\t\treturn 1L;\n\t\t\t}\n\t\t\tlong half = pow(n, p / 2, mod);\n\t\t\tlong ret = (half * half) % mod;\n\t\t\tif (p % 2 == 1) {\n\t\t\t\tret = (ret * n) % mod;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic long comb(int n, int m) {\n\t\t\tif (n > size) {\n\t\t\t\tthrow new RuntimeException(\"n is greater than size.\");\n\t\t\t}\n\t\t\tif (n < 0 || m < 0 || n < m) {\n\t\t\t\treturn 0L;\n\t\t\t}\n\t\t\treturn (((factorialTable[n] * inverseFactorialTable[m]) % mod) * inverseFactorialTable[n - m]) % mod;\n\t\t}\n\t}\n\n\t/**\n\t * 組み合わせ計算をテーブルで実装したクラスです(MOD対応)\n\t * 前計算でO(N^2), combはO(1)で実行できます\n\t * sizeを2 * 1e4より大きい値で実行するとMLEの危険性があります\n\t */\n\tclass TableCombCalculator implements CombCalculator {\n\t\tlong[][] table;\n\t\tint size;\n\n\t\tpublic TableCombCalculator(int size, long mod) {\n\t\t\tthis.size = size;\n\t\t\ttable = new long[size + 1][];\n\n\t\t\ttable[0] = new long[1];\n\t\t\ttable[0][0] = 1L;\n\t\t\tfor (int n = 1; n <= size; n++) {\n\t\t\t\ttable[n] = new long[n + 1];\n\t\t\t\ttable[n][0] = 1L;\n\t\t\t\tfor (int m = 1; m < n; m++) {\n\t\t\t\t\ttable[n][m] = (table[n - 1][m - 1] + table[n - 1][m]) % mod;\n\t\t\t\t}\n\t\t\t\ttable[n][n] = 1L;\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic long comb(int n, int m) {\n\t\t\tif (n > size) {\n\t\t\t\tthrow new RuntimeException(\"n is greater than size.\");\n\t\t\t}\n\t\t\tif (n < 0 || m < 0 || n < m) {\n\t\t\t\treturn 0L;\n\t\t\t}\n\t\t\treturn table[n][m];\n\t\t}\n\t}\n\n\tinterface Graph {\n\t\tvoid link(int from, int to, long cost);\n\t\tOptional getCost(int from, int to);\n\t\tint getVertexNum();\n\t\tSet getAdjs(int from);\n\t\tclass Edge {\n\t\t\tint to;\n\t\t\tlong cost;\n\t\t\tpublic Edge(int to, long cost) {\n\t\t\t\tthis.to = to;\n\t\t\t\tthis.cost = cost;\n\t\t\t}\n\n\t\t\tpublic int getTo() {return to;}\n\t\t\tpublic long getCost() {return cost;}\n\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif (obj == null || !(obj instanceof Edge)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tEdge e = (Edge)obj;\n\t\t\t\treturn this.to == e.to && this.cost == e.cost;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic int hashCode() {\n\t\t\t\treturn this.to;\n\t\t\t}\n\t\t}\n\t}\n\n\tinterface FlowResolver {\n\t\tlong maxFlow(int from, int to);\n\t}\n\n\t/**\n\t * グラフの行列による実装\n\t * 接点数の大きいグラフで使うとMLEで死にそう\n\t */\n\tclass ArrayGraph implements Graph {\n\t\tprivate Long[][] costArray;\n\t\tprivate int vertexNum;\n\n\t\tpublic ArrayGraph(int n) {\n\t\t\tcostArray = new Long[n][];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tcostArray[i] = new Long[n];\n\t\t\t}\n\t\t\tvertexNum = n;\n\t\t}\n\n\t\t@Override\n\t\tpublic void link(int from, int to, long cost) {\n\t\t\tcostArray[from][to] = new Long(cost);\n\t\t}\n\n\t\t@Override\n\t\tpublic Optional getCost(int from, int to) {\n\t\t\treturn Optional.ofNullable(costArray[from][to]);\n\t\t}\n\n\t\t@Override\n\t\tpublic int getVertexNum() {\n\t\t\treturn vertexNum;\n\t\t}\n\n\t\t@Override\n\t\tpublic Set getAdjs(int from) {\n\t\t\tSet set = new HashSet<>();\n\t\t\tfor (int to = 0; to < vertexNum; to++) {\n\t\t\t\tif (costArray[from][to] != null) {\n\t\t\t\t\tset.add(new Edge(to, costArray[from][to]));\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn set;\n\t\t}\n\t}\n\n\t/**\n\t * DFS(深さ優先探索)による実装\n\t * 計算量はO(E*MaxFlow)のはず (E:辺の数, MaxFlow:最大フロー)\n\t */\n\tclass DfsFlowResolver implements FlowResolver {\n\t\tprivate Graph graph;\n\t\tpublic DfsFlowResolver(Graph graph) {\n\t\t\tthis.graph = graph;\n\t\t}\n\n\t\t/**\n\t\t * 最大フロー(最小カット)を求める\n\t\t * @param from 始点(source)のID\n\t\t * @param to 終点(target)のID\n\t\t * @return 最大フロー(最小カット)\n\t\t */\n\t\tpublic long maxFlow(int from, int to) {\n\t\t\tlong sum = 0L;\n\t\t\tlong currentFlow;\n\t\t\tdo {\n\t\t\t\tcurrentFlow = flow(from, to, Long.MAX_VALUE / 3, new boolean[graph.getVertexNum()]);\n\t\t\t\tsum += currentFlow;\n\t\t\t} while (currentFlow > 0);\n\t\t\treturn sum;\n\t\t}\n\n\t\t/**\n\t\t * フローの実行 グラフの更新も行う\n\t\t * @param from 現在いる節点のID\n\t\t * @param to 終点(target)のID\n\t\t * @param current_flow ここまでの流量\n\t\t * @param passed 既に通った節点か否かを格納した配列\n\t\t * @return 終点(target)に流した流量/戻りのグラフの流量\n\t\t */\n\t\tprivate long flow(int from, int to, long current_flow, boolean[] passed) {\n\t\t\tpassed[from] = true;\n\t\t\tif (from == to) {\n\t\t\t\treturn current_flow;\n\t\t\t}\n\t\t\tfor (int id = 0; id < graph.getVertexNum(); id++) {\n\t\t\t\tif (passed[id]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tOptional cost = graph.getCost(from, id);\n\t\t\t\tif (cost.orElse(0L) > 0) {\n\t\t\t\t\tlong nextFlow = current_flow < cost.get() ? current_flow : cost.get();\n\t\t\t\t\tlong returnFlow = flow(id, to, nextFlow, passed);\n\t\t\t\t\tif (returnFlow > 0) {\n\t\t\t\t\t\tgraph.link(from, id, cost.get() - returnFlow);\n\t\t\t\t\t\tgraph.link(id, from, graph.getCost(id, from).orElse(0L) + returnFlow);\n\t\t\t\t\t\treturn returnFlow;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn 0L;\n\t\t}\n\t}\n\n\t/**\n\t * 1-indexedのBIT配列\n\t */\n\tclass BinaryIndexedTree {\n\t\tprivate long[] array;\n\n\t\tpublic BinaryIndexedTree(int size) {\n\t\t\tthis.array = new long[size + 1];\n\t\t}\n\n\t\t/**\n\t\t * 指定した要素に値を加算する\n\t\t * 計算量はO(logN)\n\t\t * @param index 加算する要素の添字\n\t\t * @param value 加算する量\n\t\t */\n\t\tpublic void add(int index, long value) {\n\t\t\tfor (int i = index; i < array.length; i += (i & -i)) {\n\t\t\t\tarray[i] += value;\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * 1〜指定した要素までの和を取得する\n\t\t * 計算量はO(logN)\n\t\t * @param index 和の終端となる要素の添字\n\t\t * @return 1〜indexまでの和\n\t\t */\n\t\tpublic long getSum(int index) {\n\t\t\tlong sum = 0L;\n\t\t\tfor (int i = index; i > 0; i -= (i & -i)) {\n\t\t\t\tsum += array[i];\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t}\n\n\t/**\n\t * 1-indexedの2次元BIT配列\n\t */\n\tclass BinaryIndexedTree2D {\n\t\tprivate long[][] array;\n\n\t\tpublic BinaryIndexedTree2D(int size1, int size2) {\n\t\t\tthis.array = new long[size1 + 1][];\n\t\t\tfor (int i = 1; i <= size1; i++) {\n\t\t\t\tthis.array[i] = new long[size2 + 1];\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * 指定した要素に値を加算する\n\t\t * 計算量はO(logN * logN)\n\t\t * @param index1 加算する要素の1次元目の添字\n\t\t * @param index2 加算する要素の2次元目の添字\n\t\t * @param value 加算する量\n\t\t */\n\t\tpublic void add(int index1, int index2, long value) {\n\t\t\tfor (int i1 = index1; i1 < array.length; i1 += (i1 & -i1)) {\n\t\t\t\tfor (int i2 = index2; i2 < array.length; i2 += (i2 & -i2)) {\n\t\t\t\t\tarray[i1][i2] += value;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * (1,1)〜指定した要素までの矩形和を取得する\n\t\t * 計算量はO(logN * logN)\n\t\t * @param index1 和の終端となる要素の1次元目の添字\n\t\t * @param index2 和の終端となる要素の2次元目の添字\n\t\t * @return (1,1)〜(index1,index2)までの矩形和\n\t\t */\n\t\tpublic long getSum(int index1, int index2) {\n\t\t\tlong sum = 0L;\n\t\t\tfor (int i1 = index1; i1 > 0; i1 -= (i1 & -i1)) {\n\t\t\t\tfor (int i2 = index2; i2 > 0; i2 -= (i2 & -i2)) {\n\t\t\t\t\tsum += array[i1][i2];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t}\n\n\tinterface UnionFind {\n\t\tvoid union(int A, int B);\n\t\tboolean judge(int A, int B);\n\t\tSet getSet(int id);\n\t}\n\n\t/**\n\t * ArrayUnionFindの拡張\n\t * MapSetで根の添字から根にぶら下がる頂点の集合が取得できるようにした\n\t * getSetメソッドをO(logN * logN)に落とせているはず\n\t * ただしunionメソッドは2倍の計算量になっているので注意(オーダーは変わらないはず)\n\t */\n\tclass SetUnionFind extends ArrayUnionFind {\n\t\tMap> map;\n\t\tpublic SetUnionFind(int size) {\n\t\t\tsuper(size);\n\t\t\tmap = new HashMap<>();\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tmap.put(i, new HashSet<>());\n\t\t\t\tmap.get(i).add(i);\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tprotected void unionTo(int source, int dest) {\n\t\t\tsuper.unionTo(source, dest);\n\t\t\tmap.get(dest).addAll(map.get(source));\n\t\t}\n\n\t\t@Override\n\t\tpublic Set getSet(int id) {\n\t\t\treturn map.get(root(id));\n\t\t}\n\t}\n\n\t/**\n\t * 配列によるUnionFindの実装\n\t * getSetメソッドはO(NlogN)なのでTLEに注意\n\t */\n\tclass ArrayUnionFind implements UnionFind {\n\t\tint[] parent;\n\t\tint[] rank;\n\t\tint size;\n\t\tpublic ArrayUnionFind(int size) {\n\t\t\tparent = new int[size];\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tparent[i] = i;\n\t\t\t}\n\t\t\trank = new int[size];\n\t\t\tthis.size = size;\n\t\t}\n\n\t\t@Override\n\t\tpublic void union(int A, int B) {\n\t\t\tint rootA = root(A);\n\t\t\tint rootB = root(B);\n\t\t\tif (rootA != rootB) {\n\t\t\t\tif (rank[rootA] < rank[rootB]) {\n\t\t\t\t\tunionTo(rootA, rootB);\n\t\t\t\t} else {\n\t\t\t\t\tunionTo(rootB, rootA);\n\t\t\t\t\tif (rank[rootA] == rank[rootB]) {\n\t\t\t\t\t\trank[rootA]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprotected void unionTo(int source, int dest) {\n\t\t\tparent[source] = dest;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean judge(int A, int B) {\n\t\t\treturn root(A) == root(B);\n\t\t}\n\n\t\t@Override\n\t\tpublic Set getSet(int id) {\n\t\t\tSet set = new HashSet<>();\n\t\t\tIntStream.range(0, size).filter(i -> judge(i, id)).forEach(set::add);\n\t\t\treturn set;\n\t\t}\n\n\t\tprotected int root(int id) {\n\t\t\tif (parent[id] == id) {\n\t\t\t\treturn id;\n\t\t\t}\n\t\t\tparent[id] = root(parent[id]);\n\t\t\treturn parent[id];\n\t\t}\n\t}\n\n\t/**\n\t * 素数のユーティリティ\n\t */\n\tclass PrimeNumberUtils {\n\t\tboolean[] isPrimeArray;\n\t\tList primes;\n\n\t\t/**\n\t\t * 素数判定の上限となる値を指定してユーティリティを初期化\n\t\t * @param limit 素数判定の上限(この値以上が素数���あるか判定しない)\n\t\t */\n\t\tpublic PrimeNumberUtils(int limit) {\n\t\t\tif (limit > 10000000) {\n\t\t\t\tSystem.err.println(\"上限の値が高すぎるため素数ユーティリティの初期化でTLEする可能性が大変高いです\");\n\t\t\t}\n\t\t\tprimes = new ArrayList<>();\n\t\t\tisPrimeArray = new boolean[limit];\n\t\t\tif (limit > 2) {\n\t\t\t\tprimes.add(2);\n\t\t\t\tisPrimeArray[2] = true;\n\t\t\t}\n\n\t\t\tfor (int i = 3; i < limit; i += 2) {\n\t\t\t\tif (isPrime(i, primes)) {\n\t\t\t\t\tprimes.add(i);\n\t\t\t\t\tisPrimeArray[i] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic List getPrimeNumberList() {\n\t\t\treturn primes;\n\t\t}\n\n\t\tpublic boolean isPrime(int n) {\n\t\t\treturn isPrimeArray[n];\n\t\t}\n\n\t\tprivate boolean isPrime(int n, List primes) {\n\t\t\tfor (int prime : primes) {\n\t\t\t\tif (n % prime == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tif (prime > Math.sqrt(n)) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tinterface BitSet {\n\t\tvoid set(int index, boolean bit);\n\t\tboolean get(int index);\n\t\tvoid shiftRight(int num);\n\t\tvoid shiftLeft(int num);\n\t\tvoid or(BitSet bitset);\n\t\tvoid and(BitSet bitset);\n\t}\n\n\t/**\n\t * Longの配列によるBitSetの実装\n\t * get/setはO(1)\n\t * shift/or/andはO(size / 64)\n\t */\n\tclass LongBit implements BitSet {\n\t\tlong[] bitArray;\n\n\t\tpublic LongBit(int size) {\n\t\t\tbitArray = new long[((size + 63) / 64)];\n\t\t}\n\n\t\t@Override\n\t\tpublic void set(int index, boolean bit) {\n\t\t\tint segment = index / 64;\n\t\t\tint inIndex = index % 64;\n\t\t\tif (bit) {\n\t\t\t\tbitArray[segment] |= 1L << inIndex;\n\t\t\t} else {\n\t\t\t\tbitArray[segment] &= ~(1L << inIndex);\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean get(int index) {\n\t\t\tint segment = index / 64;\n\t\t\tint inIndex = index % 64;\n\t\t\treturn (bitArray[segment] & (1L << inIndex)) != 0L;\n\t\t}\n\n\t\t@Override\n\t\tpublic void shiftRight(int num) {\n\t\t\tint shiftSeg = num / 64;\n\t\t\tint shiftInI = num % 64;\n\t\t\tfor (int segment = 0; segment < bitArray.length; segment++) {\n\t\t\t\tint sourceSeg = segment + shiftSeg;\n\t\t\t\tif (sourceSeg < bitArray.length) {\n\t\t\t\t\tbitArray[segment] = bitArray[sourceSeg] >>> shiftInI;\n\t\t\t\t\tif (shiftInI > 0 && sourceSeg + 1 < bitArray.length) {\n\t\t\t\t\t\tbitArray[segment] |= bitArray[sourceSeg + 1] << (64 - shiftInI);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tbitArray[segment] = 0L;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic void shiftLeft(int num) {\n\t\t\tint shiftSeg = num / 64;\n\t\t\tint shiftInI = num % 64;\n\t\t\tfor (int segment = bitArray.length - 1; segment >= 0; segment--) {\n\t\t\t\tint sourceSeg = segment - shiftSeg;\n\t\t\t\tif (sourceSeg >= 0) {\n\t\t\t\t\tbitArray[segment] = bitArray[sourceSeg] << shiftInI;\n\t\t\t\t\tif (shiftInI > 0 && sourceSeg > 0) {\n\t\t\t\t\t\tbitArray[segment] |= bitArray[sourceSeg - 1] >>> (64 - shiftInI);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tbitArray[segment] = 0L;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic long getLong(int segment) {\n\t\t\treturn bitArray[segment];\n\t\t}\n\n\t\t@Override\n\t\tpublic void or(BitSet bitset) {\n\t\t\tif (!(bitset instanceof LongBit)) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (int segment = 0; segment < bitArray.length; segment++) {\n\t\t\t\tbitArray[segment] |= ((LongBit)bitset).getLong(segment);\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic void and(BitSet bitset) {\n\t\t\tif (!(bitset instanceof LongBit)) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (int segment = 0; segment < bitArray.length; segment++) {\n\t\t\t\tbitArray[segment] &= ((LongBit)bitset).getLong(segment);\n\t\t\t}\n\t\t}\n\t}\n\n}", "language": "Java", "metadata": {"date": 1563579080, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/Java/s262850940.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s262850940", "user_id": "u564054133"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Optional;\nimport java.util.Set;\nimport java.util.stream.IntStream;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t}\n\n\tprivate void solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\tint D = sc.nextInt();\n\t\tSystem.out.println(Math.min(A, B) + Math.min(C, D));\n\t}\n\n\tclass Scanner {\n\t\tprivate InputStream in;\n\t\tprivate byte[] buffer = new byte[1024];\n\t\tprivate int index;\n\t\tprivate int length;\n\n\t\tpublic Scanner(InputStream in) {\n\t\t\tthis.in = in;\n\t\t}\n\n\t\tprivate boolean isPrintableChar(int c) {\n\t\t\treturn '!' <= c && c <= '~';\n\t\t}\n\n\t\tprivate boolean isDigit(int c) {\n\t\t\treturn '0' <= c && c <= '9';\n\t\t}\n\n\t\tprivate boolean hasNextByte() {\n\t\t\tif (index < length) {\n\t\t\t\treturn true;\n\t\t\t} else {\n\t\t\t\ttry {\n\t\t\t\t\tlength = in.read(buffer);\n\t\t\t\t\tindex = 0;\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t\treturn length > 0;\n\t\t\t}\n\t\t}\n\n\t\tprivate boolean hasNext() {\n\t\t\twhile (hasNextByte() && !isPrintableChar(buffer[index])) {\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\treturn hasNextByte();\n\t\t}\n\n\t\tprivate int readByte() {\n\t\t\treturn hasNextByte() ? buffer[index++] : -1;\n\t\t}\n\n\t\tpublic String next() {\n\t\t\tif (!hasNext()) {\n\t\t\t\tthrow new RuntimeException(\"no input\");\n\t\t\t}\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tint b = readByte();\n\t\t\twhile (isPrintableChar(b)) {\n\t\t\t\tsb.appendCodePoint(b);\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn sb.toString();\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tif (!hasNext()) {\n\t\t\t\tthrow new RuntimeException(\"no input\");\n\t\t\t}\n\t\t\tlong value = 0L;\n\t\t\tboolean minus = false;\n\t\t\tint b = readByte();\n\t\t\tif (b == '-') {\n\t\t\t\tminus = true;\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\twhile (isPrintableChar(b)) {\n\t\t\t\tif (isDigit(b)) {\n\t\t\t\t\tvalue = value * 10 + (b - '0');\n\t\t\t\t}\n\t\t\t\tb = readByte();\n\t\t\t}\n\t\t\treturn minus ? -value : value;\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn (int)nextLong();\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n\n\tclass DfsResolver {\n\t\tGraph g;\n\t\tSet used;\n\n\t\tpublic DfsResolver(Graph g) {\n\t\t\tthis.g = g;\n\t\t\tused = new HashSet<>();\n\t\t}\n\n\t\tvoid search(int start) {\n\t\t\tused.add(start);\n\t\t\t//for (;false;) {}\n\t\t}\n\t}\n\n\tclass MapSetGraph implements Graph {\n\t\tMap> map = new HashMap<>();\n\t\tint vertexNum = 0;\n\n\t\t@Override\n\t\tpublic void link(int from, int to, long cost) {\n\t\t\tif (!map.containsKey(from)) {\n\t\t\t\tmap.put(from, new HashSet<>());\n\t\t\t}\n\t\t\tmap.get(from).add(new Edge(to, cost));\n\t\t\tif (vertexNum < from + 1) {\n\t\t\t\tvertexNum = from + 1;\n\t\t\t}\n\t\t\tif (vertexNum < to + 1) {\n\t\t\t\tvertexNum = to + 1;\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic Optional getCost(int from, int to) {\n\t\t\tif (map.containsKey(from)) {\n\t\t\t\tfor (Edge e : map.get(from)) {\n\t\t\t\t\tif (e.to == to) {\n\t\t\t\t\t\treturn Optional.of(e.cost);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn Optional.ofNullable(null);\n\t\t}\n\n\t\t@Override\n\t\tpublic int getVertexNum() {\n\t\t\t// linkメソッドで渡される頂点IDが0-indexの前提に立った実装\n\t\t\treturn vertexNum;\n\t\t}\n\n\t\t@Override\n\t\tpublic Set getAdjs(int from) {\n\t\t\tif (!map.containsKey(from)) {\n\t\t\t\treturn new HashSet<>();\n\t\t\t}\n\t\t\treturn map.get(from);\n\t\t}\n\t}\n\n\tinterface CombCalculator {\n\t\tlong comb(int n, int m);\n\t}\n\n\tinterface MobiusFunction {\n\t\tint get(int n);\n\t}\n\n\t/**\n\t * メビウス関数をエラトステネスの篩っぽく前計算するクラスです。\n\t * 計算量はO(1)で、前計算でO(N logN)です。\n\t */\n\tclass SieveMobiusFunction implements MobiusFunction {\n\t\tint size;\n\t\tint[] mobiusFunctionValues;\n\n\t\tpublic SieveMobiusFunction(int size) {\n\t\t\tthis.size = size;\n\t\t\tmobiusFunctionValues = new int[size];\n\n\t\t\tmobiusFunctionValues[0] = 0;\n\t\t\tmobiusFunctionValues[1] = 1;\n\t\t\tfor (int i = 2; i < size; i++) {\n\t\t\t\tmobiusFunctionValues[i] = 1;\n\t\t\t}\n\t\t\tfor (int i = 2; i * i < size; i++) {\n\t\t\t\tfor (int k = 1; i * i * k < size; k++) {\n\t\t\t\t\tmobiusFunctionValues[i * i * k] *= 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (int i = 2; i < size; i++) {\n\t\t\t\tif (mobiusFunctionValues[i] == 1) {\n\t\t\t\t\tfor (int k = 1; i * k < size; k++) {\n\t\t\t\t\t\tmobiusFunctionValues[i * k] *= -2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (mobiusFunctionValues[i] > 1) {\n\t\t\t\t\tmobiusFunctionValues[i] = 1;\n\t\t\t\t}\n\t\t\t\tif (mobiusFunctionValues[i] < -1) {\n\t\t\t\t\tmobiusFunctionValues[i] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic int get(int n) {\n\t\t\tif (n > size) {\n\t\t\t\tthrow new RuntimeException(\"n is greater than size.\");\n\t\t\t}\n\t\t\tif (n < 0) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\treturn mobiusFunctionValues[n];\n\t\t}\n\t}\n\n\t/**\n\t * メビウス関数を定義通り計算するクラスです。\n\t * 計算量はO(logN)です。\n\t */\n\tclass PrimeFactorizationMobiusFunction implements MobiusFunction {\n\t\t@Override\n\t\tpublic int get(int n) {\n\t\t\tif (n <= 0) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (n == 1) {\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tint num = 0;\n\t\t\tfor (int i = 2; i < n; i++) {\n\t\t\t\tif (n % i == 0) {\n\t\t\t\t\tn /= i;\n\t\t\t\t\tnum++;\n\t\t\t\t\tif (n % i == 0) {\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn num % 2 == 0 ? -1 : 1;\n\t\t}\n\t}\n\n\t/**\n\t * 組み合わせ計算を階乗の値で行うクラスです(MOD対応)\n\t * 階乗とその逆元は前計算してテーブルに格納します。\n\t * C(N, N) % M の計算量は O(1)、 前計算でO(max(N, logM))です。\n\t * sizeを1e8より大きい値で実行するとMLEの危険性があります。\n\t * また素数以外のMODには対応していません(逆元の計算に素数の剰余環の性質を利用しているため)。\n\t */\n\tclass FactorialTableCombCalculator implements CombCalculator {\n\t\tint size;\n\t\tlong[] factorialTable;\n\t\tlong[] inverseFactorialTable;\n\t\tlong mod;\n\n\t\tpublic FactorialTableCombCalculator(int size, long mod) {\n\t\t\tthis.size = size;\n\t\t\tfactorialTable = new long[size + 1];\n\t\t\tinverseFactorialTable = new long[size + 1];\n\t\t\tthis.mod = mod;\n\n\t\t\tfactorialTable[0] = 1L;\n\t\t\tfor (int i = 1; i <= size; i++) {\n\t\t\t\tfactorialTable[i] = (factorialTable[i - 1] * i) % mod;\n\t\t\t}\n\t\t\tinverseFactorialTable[size] = inverse(factorialTable[size], mod);\n\t\t\tfor (int i = size - 1; i >= 0; i--) {\n\t\t\t\tinverseFactorialTable[i] = (inverseFactorialTable[i + 1] * (i + 1)) % mod;\n\t\t\t}\n\t\t}\n\n\t\tprivate long inverse(long n, long mod) {\n\t\t\treturn pow(n, mod - 2, mod);\n\t\t}\n\n\t\tprivate long pow(long n, long p, long mod) {\n\t\t\tif (p == 0) {\n\t\t\t\treturn 1L;\n\t\t\t}\n\t\t\tlong half = pow(n, p / 2, mod);\n\t\t\tlong ret = (half * half) % mod;\n\t\t\tif (p % 2 == 1) {\n\t\t\t\tret = (ret * n) % mod;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\t@Override\n\t\tpublic long comb(int n, int m) {\n\t\t\tif (n > size) {\n\t\t\t\tthrow new RuntimeException(\"n is greater than size.\");\n\t\t\t}\n\t\t\tif (n < 0 || m < 0 || n < m) {\n\t\t\t\treturn 0L;\n\t\t\t}\n\t\t\treturn (((factorialTable[n] * inverseFactorialTable[m]) % mod) * inverseFactorialTable[n - m]) % mod;\n\t\t}\n\t}\n\n\t/**\n\t * 組み合わせ計算をテーブルで実装したクラスです(MOD対応)\n\t * 前計算でO(N^2), combはO(1)で実行できます\n\t * sizeを2 * 1e4より大きい値で実行するとMLEの危険性があります\n\t */\n\tclass TableCombCalculator implements CombCalculator {\n\t\tlong[][] table;\n\t\tint size;\n\n\t\tpublic TableCombCalculator(int size, long mod) {\n\t\t\tthis.size = size;\n\t\t\ttable = new long[size + 1][];\n\n\t\t\ttable[0] = new long[1];\n\t\t\ttable[0][0] = 1L;\n\t\t\tfor (int n = 1; n <= size; n++) {\n\t\t\t\ttable[n] = new long[n + 1];\n\t\t\t\ttable[n][0] = 1L;\n\t\t\t\tfor (int m = 1; m < n; m++) {\n\t\t\t\t\ttable[n][m] = (table[n - 1][m - 1] + table[n - 1][m]) % mod;\n\t\t\t\t}\n\t\t\t\ttable[n][n] = 1L;\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic long comb(int n, int m) {\n\t\t\tif (n > size) {\n\t\t\t\tthrow new RuntimeException(\"n is greater than size.\");\n\t\t\t}\n\t\t\tif (n < 0 || m < 0 || n < m) {\n\t\t\t\treturn 0L;\n\t\t\t}\n\t\t\treturn table[n][m];\n\t\t}\n\t}\n\n\tinterface Graph {\n\t\tvoid link(int from, int to, long cost);\n\t\tOptional getCost(int from, int to);\n\t\tint getVertexNum();\n\t\tSet getAdjs(int from);\n\t\tclass Edge {\n\t\t\tint to;\n\t\t\tlong cost;\n\t\t\tpublic Edge(int to, long cost) {\n\t\t\t\tthis.to = to;\n\t\t\t\tthis.cost = cost;\n\t\t\t}\n\n\t\t\tpublic int getTo() {return to;}\n\t\t\tpublic long getCost() {return cost;}\n\n\t\t\t@Override\n\t\t\tpublic boolean equals(Object obj) {\n\t\t\t\tif (obj == null || !(obj instanceof Edge)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tEdge e = (Edge)obj;\n\t\t\t\treturn this.to == e.to && this.cost == e.cost;\n\t\t\t}\n\n\t\t\t@Override\n\t\t\tpublic int hashCode() {\n\t\t\t\treturn this.to;\n\t\t\t}\n\t\t}\n\t}\n\n\tinterface FlowResolver {\n\t\tlong maxFlow(int from, int to);\n\t}\n\n\t/**\n\t * グラフの行列による実装\n\t * 接点数の大きいグラフで使うとMLEで死にそう\n\t */\n\tclass ArrayGraph implements Graph {\n\t\tprivate Long[][] costArray;\n\t\tprivate int vertexNum;\n\n\t\tpublic ArrayGraph(int n) {\n\t\t\tcostArray = new Long[n][];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tcostArray[i] = new Long[n];\n\t\t\t}\n\t\t\tvertexNum = n;\n\t\t}\n\n\t\t@Override\n\t\tpublic void link(int from, int to, long cost) {\n\t\t\tcostArray[from][to] = new Long(cost);\n\t\t}\n\n\t\t@Override\n\t\tpublic Optional getCost(int from, int to) {\n\t\t\treturn Optional.ofNullable(costArray[from][to]);\n\t\t}\n\n\t\t@Override\n\t\tpublic int getVertexNum() {\n\t\t\treturn vertexNum;\n\t\t}\n\n\t\t@Override\n\t\tpublic Set getAdjs(int from) {\n\t\t\tSet set = new HashSet<>();\n\t\t\tfor (int to = 0; to < vertexNum; to++) {\n\t\t\t\tif (costArray[from][to] != null) {\n\t\t\t\t\tset.add(new Edge(to, costArray[from][to]));\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn set;\n\t\t}\n\t}\n\n\t/**\n\t * DFS(深さ優先探索)による実装\n\t * 計算量はO(E*MaxFlow)のはず (E:辺の数, MaxFlow:最大フロー)\n\t */\n\tclass DfsFlowResolver implements FlowResolver {\n\t\tprivate Graph graph;\n\t\tpublic DfsFlowResolver(Graph graph) {\n\t\t\tthis.graph = graph;\n\t\t}\n\n\t\t/**\n\t\t * 最大フロー(最小カット)を求める\n\t\t * @param from 始点(source)のID\n\t\t * @param to 終点(target)のID\n\t\t * @return 最大フロー(最小カット)\n\t\t */\n\t\tpublic long maxFlow(int from, int to) {\n\t\t\tlong sum = 0L;\n\t\t\tlong currentFlow;\n\t\t\tdo {\n\t\t\t\tcurrentFlow = flow(from, to, Long.MAX_VALUE / 3, new boolean[graph.getVertexNum()]);\n\t\t\t\tsum += currentFlow;\n\t\t\t} while (currentFlow > 0);\n\t\t\treturn sum;\n\t\t}\n\n\t\t/**\n\t\t * フローの実行 グラフの更新も行う\n\t\t * @param from 現在いる節点のID\n\t\t * @param to 終点(target)のID\n\t\t * @param current_flow ここまでの流量\n\t\t * @param passed 既に通った節点か否かを格納した配列\n\t\t * @return 終点(target)に流した流量/戻りのグラフの流量\n\t\t */\n\t\tprivate long flow(int from, int to, long current_flow, boolean[] passed) {\n\t\t\tpassed[from] = true;\n\t\t\tif (from == to) {\n\t\t\t\treturn current_flow;\n\t\t\t}\n\t\t\tfor (int id = 0; id < graph.getVertexNum(); id++) {\n\t\t\t\tif (passed[id]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tOptional cost = graph.getCost(from, id);\n\t\t\t\tif (cost.orElse(0L) > 0) {\n\t\t\t\t\tlong nextFlow = current_flow < cost.get() ? current_flow : cost.get();\n\t\t\t\t\tlong returnFlow = flow(id, to, nextFlow, passed);\n\t\t\t\t\tif (returnFlow > 0) {\n\t\t\t\t\t\tgraph.link(from, id, cost.get() - returnFlow);\n\t\t\t\t\t\tgraph.link(id, from, graph.getCost(id, from).orElse(0L) + returnFlow);\n\t\t\t\t\t\treturn returnFlow;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn 0L;\n\t\t}\n\t}\n\n\t/**\n\t * 1-indexedのBIT配列\n\t */\n\tclass BinaryIndexedTree {\n\t\tprivate long[] array;\n\n\t\tpublic BinaryIndexedTree(int size) {\n\t\t\tthis.array = new long[size + 1];\n\t\t}\n\n\t\t/**\n\t\t * 指定した要素に値を加算する\n\t\t * 計算量はO(logN)\n\t\t * @param index 加算する要素の添字\n\t\t * @param value 加算する量\n\t\t */\n\t\tpublic void add(int index, long value) {\n\t\t\tfor (int i = index; i < array.length; i += (i & -i)) {\n\t\t\t\tarray[i] += value;\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * 1〜指定した要素までの和を取得する\n\t\t * 計算量はO(logN)\n\t\t * @param index 和の終端となる要素の添字\n\t\t * @return 1〜indexまでの和\n\t\t */\n\t\tpublic long getSum(int index) {\n\t\t\tlong sum = 0L;\n\t\t\tfor (int i = index; i > 0; i -= (i & -i)) {\n\t\t\t\tsum += array[i];\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t}\n\n\t/**\n\t * 1-indexedの2次元BIT配列\n\t */\n\tclass BinaryIndexedTree2D {\n\t\tprivate long[][] array;\n\n\t\tpublic BinaryIndexedTree2D(int size1, int size2) {\n\t\t\tthis.array = new long[size1 + 1][];\n\t\t\tfor (int i = 1; i <= size1; i++) {\n\t\t\t\tthis.array[i] = new long[size2 + 1];\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * 指定した要素に値を加算する\n\t\t * 計算量はO(logN * logN)\n\t\t * @param index1 加算する要素の1次元目の添字\n\t\t * @param index2 加算する要素の2次元目の添字\n\t\t * @param value 加算する量\n\t\t */\n\t\tpublic void add(int index1, int index2, long value) {\n\t\t\tfor (int i1 = index1; i1 < array.length; i1 += (i1 & -i1)) {\n\t\t\t\tfor (int i2 = index2; i2 < array.length; i2 += (i2 & -i2)) {\n\t\t\t\t\tarray[i1][i2] += value;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t * (1,1)〜指定した要素までの矩形和を取得する\n\t\t * 計算量はO(logN * logN)\n\t\t * @param index1 和の終端となる要素の1次元目の添字\n\t\t * @param index2 和の終端となる要素の2次元目の添字\n\t\t * @return (1,1)〜(index1,index2)までの矩形和\n\t\t */\n\t\tpublic long getSum(int index1, int index2) {\n\t\t\tlong sum = 0L;\n\t\t\tfor (int i1 = index1; i1 > 0; i1 -= (i1 & -i1)) {\n\t\t\t\tfor (int i2 = index2; i2 > 0; i2 -= (i2 & -i2)) {\n\t\t\t\t\tsum += array[i1][i2];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn sum;\n\t\t}\n\t}\n\n\tinterface UnionFind {\n\t\tvoid union(int A, int B);\n\t\tboolean judge(int A, int B);\n\t\tSet getSet(int id);\n\t}\n\n\t/**\n\t * ArrayUnionFindの拡張\n\t * MapSetで根の添字から根にぶら下がる頂点の集合が取得できるようにした\n\t * getSetメソッドをO(logN * logN)に落とせているはず\n\t * ただしunionメソッドは2倍の計算量になっているので注意(オーダーは変わらないはず)\n\t */\n\tclass SetUnionFind extends ArrayUnionFind {\n\t\tMap> map;\n\t\tpublic SetUnionFind(int size) {\n\t\t\tsuper(size);\n\t\t\tmap = new HashMap<>();\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tmap.put(i, new HashSet<>());\n\t\t\t\tmap.get(i).add(i);\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tprotected void unionTo(int source, int dest) {\n\t\t\tsuper.unionTo(source, dest);\n\t\t\tmap.get(dest).addAll(map.get(source));\n\t\t}\n\n\t\t@Override\n\t\tpublic Set getSet(int id) {\n\t\t\treturn map.get(root(id));\n\t\t}\n\t}\n\n\t/**\n\t * 配列によるUnionFindの実装\n\t * getSetメソッドはO(NlogN)なのでTLEに注意\n\t */\n\tclass ArrayUnionFind implements UnionFind {\n\t\tint[] parent;\n\t\tint[] rank;\n\t\tint size;\n\t\tpublic ArrayUnionFind(int size) {\n\t\t\tparent = new int[size];\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tparent[i] = i;\n\t\t\t}\n\t\t\trank = new int[size];\n\t\t\tthis.size = size;\n\t\t}\n\n\t\t@Override\n\t\tpublic void union(int A, int B) {\n\t\t\tint rootA = root(A);\n\t\t\tint rootB = root(B);\n\t\t\tif (rootA != rootB) {\n\t\t\t\tif (rank[rootA] < rank[rootB]) {\n\t\t\t\t\tunionTo(rootA, rootB);\n\t\t\t\t} else {\n\t\t\t\t\tunionTo(rootB, rootA);\n\t\t\t\t\tif (rank[rootA] == rank[rootB]) {\n\t\t\t\t\t\trank[rootA]++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprotected void unionTo(int source, int dest) {\n\t\t\tparent[source] = dest;\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean judge(int A, int B) {\n\t\t\treturn root(A) == root(B);\n\t\t}\n\n\t\t@Override\n\t\tpublic Set getSet(int id) {\n\t\t\tSet set = new HashSet<>();\n\t\t\tIntStream.range(0, size).filter(i -> judge(i, id)).forEach(set::add);\n\t\t\treturn set;\n\t\t}\n\n\t\tprotected int root(int id) {\n\t\t\tif (parent[id] == id) {\n\t\t\t\treturn id;\n\t\t\t}\n\t\t\tparent[id] = root(parent[id]);\n\t\t\treturn parent[id];\n\t\t}\n\t}\n\n\t/**\n\t * 素数のユーティリティ\n\t */\n\tclass PrimeNumberUtils {\n\t\tboolean[] isPrimeArray;\n\t\tList primes;\n\n\t\t/**\n\t\t * 素数判定の上限となる値を指定してユーティリティを初期化\n\t\t * @param limit 素数判定の上限(この値以上が素数であるか判定しない)\n\t\t */\n\t\tpublic PrimeNumberUtils(int limit) {\n\t\t\tif (limit > 10000000) {\n\t\t\t\tSystem.err.println(\"上限の値が高すぎるため素数ユーティリティの初期化でTLEする可能性が大変高いです\");\n\t\t\t}\n\t\t\tprimes = new ArrayList<>();\n\t\t\tisPrimeArray = new boolean[limit];\n\t\t\tif (limit > 2) {\n\t\t\t\tprimes.add(2);\n\t\t\t\tisPrimeArray[2] = true;\n\t\t\t}\n\n\t\t\tfor (int i = 3; i < limit; i += 2) {\n\t\t\t\tif (isPrime(i, primes)) {\n\t\t\t\t\tprimes.add(i);\n\t\t\t\t\tisPrimeArray[i] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic List getPrimeNumberList() {\n\t\t\treturn primes;\n\t\t}\n\n\t\tpublic boolean isPrime(int n) {\n\t\t\treturn isPrimeArray[n];\n\t\t}\n\n\t\tprivate boolean isPrime(int n, List primes) {\n\t\t\tfor (int prime : primes) {\n\t\t\t\tif (n % prime == 0) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tif (prime > Math.sqrt(n)) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tinterface BitSet {\n\t\tvoid set(int index, boolean bit);\n\t\tboolean get(int index);\n\t\tvoid shiftRight(int num);\n\t\tvoid shiftLeft(int num);\n\t\tvoid or(BitSet bitset);\n\t\tvoid and(BitSet bitset);\n\t}\n\n\t/**\n\t * Longの配列によるBitSetの実装\n\t * get/setはO(1)\n\t * shift/or/andはO(size / 64)\n\t */\n\tclass LongBit implements BitSet {\n\t\tlong[] bitArray;\n\n\t\tpublic LongBit(int size) {\n\t\t\tbitArray = new long[((size + 63) / 64)];\n\t\t}\n\n\t\t@Override\n\t\tpublic void set(int index, boolean bit) {\n\t\t\tint segment = index / 64;\n\t\t\tint inIndex = index % 64;\n\t\t\tif (bit) {\n\t\t\t\tbitArray[segment] |= 1L << inIndex;\n\t\t\t} else {\n\t\t\t\tbitArray[segment] &= ~(1L << inIndex);\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic boolean get(int index) {\n\t\t\tint segment = index / 64;\n\t\t\tint inIndex = index % 64;\n\t\t\treturn (bitArray[segment] & (1L << inIndex)) != 0L;\n\t\t}\n\n\t\t@Override\n\t\tpublic void shiftRight(int num) {\n\t\t\tint shiftSeg = num / 64;\n\t\t\tint shiftInI = num % 64;\n\t\t\tfor (int segment = 0; segment < bitArray.length; segment++) {\n\t\t\t\tint sourceSeg = segment + shiftSeg;\n\t\t\t\tif (sourceSeg < bitArray.length) {\n\t\t\t\t\tbitArray[segment] = bitArray[sourceSeg] >>> shiftInI;\n\t\t\t\t\tif (shiftInI > 0 && sourceSeg + 1 < bitArray.length) {\n\t\t\t\t\t\tbitArray[segment] |= bitArray[sourceSeg + 1] << (64 - shiftInI);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tbitArray[segment] = 0L;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic void shiftLeft(int num) {\n\t\t\tint shiftSeg = num / 64;\n\t\t\tint shiftInI = num % 64;\n\t\t\tfor (int segment = bitArray.length - 1; segment >= 0; segment--) {\n\t\t\t\tint sourceSeg = segment - shiftSeg;\n\t\t\t\tif (sourceSeg >= 0) {\n\t\t\t\t\tbitArray[segment] = bitArray[sourceSeg] << shiftInI;\n\t\t\t\t\tif (shiftInI > 0 && sourceSeg > 0) {\n\t\t\t\t\t\tbitArray[segment] |= bitArray[sourceSeg - 1] >>> (64 - shiftInI);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tbitArray[segment] = 0L;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic long getLong(int segment) {\n\t\t\treturn bitArray[segment];\n\t\t}\n\n\t\t@Override\n\t\tpublic void or(BitSet bitset) {\n\t\t\tif (!(bitset instanceof LongBit)) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (int segment = 0; segment < bitArray.length; segment++) {\n\t\t\t\tbitArray[segment] |= ((LongBit)bitset).getLong(segment);\n\t\t\t}\n\t\t}\n\n\t\t@Override\n\t\tpublic void and(BitSet bitset) {\n\t\t\tif (!(bitset instanceof LongBit)) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (int segment = 0; segment < bitArray.length; segment++) {\n\t\t\t\tbitArray[segment] &= ((LongBit)bitset).getLong(segment);\n\t\t\t}\n\t\t}\n\t}\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 18791, "cpu_time_ms": 70, "memory_kb": 20948}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s970297385", "group_id": "codeNet:p03407", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a =sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n if (a+b >= c) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n\n}\n", "language": "Java", "metadata": {"date": 1521335102, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03407.html", "problem_id": "p03407", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03407/input.txt", "sample_output_relpath": "derived/input_output/data/p03407/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03407/Java/s970297385.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970297385", "user_id": "u449215132"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a =sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n if (a+b >= c) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "sample_input": "50 100 120\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03407", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 365, "cpu_time_ms": 123, "memory_kb": 23636}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s117177190", "group_id": "codeNet:p03408", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n \n int N = sc.nextInt();\n \n Map cp = new HashMap<>();\n for(int i = 0; i < N; i++) {\n String str = sc.next();\n if( cp.containsKey( str ) ) {\n int x = cp.get(str);\n cp.put(str, ++x);\n } else {\n cp.put(str, 1);\n }\n }\n int M = sc.nextInt();\n for(int i = 0; i < M; i++) {\n String str = sc.next();\n if( cp.containsKey( str ) ) {\n int x = cp.get(str);\n cp.put( str, --x );\n }\n }\n \n int max = 0;\n for( Map.Entry entry : cp.entrySet() ) {\n max = Math.max( max, entry.getValue() );\n }\n System.out.println( max );\n }\n}\n", "language": "Java", "metadata": {"date": 1593454851, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03408.html", "problem_id": "p03408", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03408/input.txt", "sample_output_relpath": "derived/input_output/data/p03408/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03408/Java/s117177190.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s117177190", "user_id": "u428922728"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n Scanner sc = new Scanner(System.in);\n \n int N = sc.nextInt();\n \n Map cp = new HashMap<>();\n for(int i = 0; i < N; i++) {\n String str = sc.next();\n if( cp.containsKey( str ) ) {\n int x = cp.get(str);\n cp.put(str, ++x);\n } else {\n cp.put(str, 1);\n }\n }\n int M = sc.nextInt();\n for(int i = 0; i < M; i++) {\n String str = sc.next();\n if( cp.containsKey( str ) ) {\n int x = cp.get(str);\n cp.put( str, --x );\n }\n }\n \n int max = 0;\n for( Map.Entry entry : cp.entrySet() ) {\n max = Math.max( max, entry.getValue() );\n }\n System.out.println( max );\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N blue cards and M red cards.\nA string is written on each card. The string written on the i-th blue card is s_i, and the string written on the i-th red card is t_i.\n\nTakahashi will now announce a string, and then check every card. Each time he finds a blue card with the string announced by him, he will earn 1 yen (the currency of Japan); each time he finds a red card with that string, he will lose 1 yen.\n\nHere, we only consider the case where the string announced by Takahashi and the string on the card are exactly the same. For example, if he announces atcoder, he will not earn money even if there are blue cards with atcoderr, atcode, btcoder, and so on. (On the other hand, he will not lose money even if there are red cards with such strings, either.)\n\nAt most how much can he earn on balance?\n\nNote that the same string may be written on multiple cards.\n\nConstraints\n\nN and M are integers.\n\n1 \\leq N, M \\leq 100\n\ns_1, s_2, ..., s_N, t_1, t_2, ..., t_M are all strings of lengths between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\nM\nt_1\nt_2\n:\nt_M\n\nOutput\n\nIf Takahashi can earn at most X yen on balance, print X.\n\nSample Input 1\n\n3\napple\norange\napple\n1\ngrape\n\nSample Output 1\n\n2\n\nHe can earn 2 yen by announcing apple.\n\nSample Input 2\n\n3\napple\norange\napple\n5\napple\napple\napple\napple\napple\n\nSample Output 2\n\n1\n\nIf he announces apple, he will lose 3 yen. If he announces orange, he can earn 1 yen.\n\nSample Input 3\n\n1\nvoldemort\n10\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\n\nSample Output 3\n\n0\n\nIf he announces voldemort, he will lose 9 yen. If he announces orange, for example, he can avoid losing a yen.\n\nSample Input 4\n\n6\nred\nred\nblue\nyellow\nyellow\nred\n5\nred\nred\nyellow\ngreen\nblue\n\nSample Output 4\n\n1", "sample_input": "3\napple\norange\napple\n1\ngrape\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03408", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N blue cards and M red cards.\nA string is written on each card. The string written on the i-th blue card is s_i, and the string written on the i-th red card is t_i.\n\nTakahashi will now announce a string, and then check every card. Each time he finds a blue card with the string announced by him, he will earn 1 yen (the currency of Japan); each time he finds a red card with that string, he will lose 1 yen.\n\nHere, we only consider the case where the string announced by Takahashi and the string on the card are exactly the same. For example, if he announces atcoder, he will not earn money even if there are blue cards with atcoderr, atcode, btcoder, and so on. (On the other hand, he will not lose money even if there are red cards with such strings, either.)\n\nAt most how much can he earn on balance?\n\nNote that the same string may be written on multiple cards.\n\nConstraints\n\nN and M are integers.\n\n1 \\leq N, M \\leq 100\n\ns_1, s_2, ..., s_N, t_1, t_2, ..., t_M are all strings of lengths between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\nM\nt_1\nt_2\n:\nt_M\n\nOutput\n\nIf Takahashi can earn at most X yen on balance, print X.\n\nSample Input 1\n\n3\napple\norange\napple\n1\ngrape\n\nSample Output 1\n\n2\n\nHe can earn 2 yen by announcing apple.\n\nSample Input 2\n\n3\napple\norange\napple\n5\napple\napple\napple\napple\napple\n\nSample Output 2\n\n1\n\nIf he announces apple, he will lose 3 yen. If he announces orange, he can earn 1 yen.\n\nSample Input 3\n\n1\nvoldemort\n10\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\nvoldemort\n\nSample Output 3\n\n0\n\nIf he announces voldemort, he will lose 9 yen. If he announces orange, for example, he can avoid losing a yen.\n\nSample Input 4\n\n6\nred\nred\nblue\nyellow\nyellow\nred\n5\nred\nred\nyellow\ngreen\nblue\n\nSample Output 4\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 954, "cpu_time_ms": 120, "memory_kb": 35728}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s628239305", "group_id": "codeNet:p03409", "input_text": "import java.awt.Point;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tPoint[] red = new Point[N];\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tred[i] = new Point(sc.nextInt(), sc.nextInt());\n\t\tPoint[] blue = new Point[N];\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tblue[i] = new Point(sc.nextInt(), sc.nextInt());\n\t\tsc.close();\n\n\t\tArrays.sort(red, (pt1, pt2) -> (pt2.y - pt1.y));\n\t\tArrays.sort(blue, (pt1, pt2) -> (pt1.x - pt2.x));\n\n\t\tint ans = 0;\n\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (red[j] == null)\n\t\t\t\t\tcontinue;\n\t\t\t\tif (red[j].x < blue[i].x && red[j].y < blue[i].y) {\n\t\t\t\t\tred[j] = null;\n\t\t\t\t\tans++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n}", "language": "Java", "metadata": {"date": 1523817071, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03409.html", "problem_id": "p03409", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03409/input.txt", "sample_output_relpath": "derived/input_output/data/p03409/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03409/Java/s628239305.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s628239305", "user_id": "u992855537"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.awt.Point;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tPoint[] red = new Point[N];\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tred[i] = new Point(sc.nextInt(), sc.nextInt());\n\t\tPoint[] blue = new Point[N];\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tblue[i] = new Point(sc.nextInt(), sc.nextInt());\n\t\tsc.close();\n\n\t\tArrays.sort(red, (pt1, pt2) -> (pt2.y - pt1.y));\n\t\tArrays.sort(blue, (pt1, pt2) -> (pt1.x - pt2.x));\n\n\t\tint ans = 0;\n\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (red[j] == null)\n\t\t\t\t\tcontinue;\n\t\t\t\tif (red[j].x < blue[i].x && red[j].y < blue[i].y) {\n\t\t\t\t\tred[j] = null;\n\t\t\t\t\tans++;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nOn a two-dimensional plane, there are N red points and N blue points.\nThe coordinates of the i-th red point are (a_i, b_i), and the coordinates of the i-th blue point are (c_i, d_i).\n\nA red point and a blue point can form a friendly pair when, the x-coordinate of the red point is smaller than that of the blue point, and the y-coordinate of the red point is also smaller than that of the blue point.\n\nAt most how many friendly pairs can you form? Note that a point cannot belong to multiple pairs.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq a_i, b_i, c_i, d_i < 2N\n\na_1, a_2, ..., a_N, c_1, c_2, ..., c_N are all different.\n\nb_1, b_2, ..., b_N, d_1, d_2, ..., d_N are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n:\na_N b_N\nc_1 d_1\nc_2 d_2\n:\nc_N d_N\n\nOutput\n\nPrint the maximum number of friendly pairs.\n\nSample Input 1\n\n3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n\nSample Output 1\n\n2\n\nFor example, you can pair (2, 0) and (4, 2), then (3, 1) and (5, 5).\n\nSample Input 2\n\n3\n0 0\n1 1\n5 2\n2 3\n3 4\n4 5\n\nSample Output 2\n\n2\n\nFor example, you can pair (0, 0) and (2, 3), then (1, 1) and (3, 4).\n\nSample Input 3\n\n2\n2 2\n3 3\n0 0\n1 1\n\nSample Output 3\n\n0\n\nIt is possible that no pair can be formed.\n\nSample Input 4\n\n5\n0 0\n7 3\n2 2\n4 8\n1 6\n8 5\n6 9\n5 4\n9 1\n3 7\n\nSample Output 4\n\n5\n\nSample Input 5\n\n5\n0 0\n1 1\n5 5\n6 6\n7 7\n2 2\n3 3\n4 4\n8 8\n9 9\n\nSample Output 5\n\n4", "sample_input": "3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03409", "source_text": "Score : 400 points\n\nProblem Statement\n\nOn a two-dimensional plane, there are N red points and N blue points.\nThe coordinates of the i-th red point are (a_i, b_i), and the coordinates of the i-th blue point are (c_i, d_i).\n\nA red point and a blue point can form a friendly pair when, the x-coordinate of the red point is smaller than that of the blue point, and the y-coordinate of the red point is also smaller than that of the blue point.\n\nAt most how many friendly pairs can you form? Note that a point cannot belong to multiple pairs.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq a_i, b_i, c_i, d_i < 2N\n\na_1, a_2, ..., a_N, c_1, c_2, ..., c_N are all different.\n\nb_1, b_2, ..., b_N, d_1, d_2, ..., d_N are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n:\na_N b_N\nc_1 d_1\nc_2 d_2\n:\nc_N d_N\n\nOutput\n\nPrint the maximum number of friendly pairs.\n\nSample Input 1\n\n3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n\nSample Output 1\n\n2\n\nFor example, you can pair (2, 0) and (4, 2), then (3, 1) and (5, 5).\n\nSample Input 2\n\n3\n0 0\n1 1\n5 2\n2 3\n3 4\n4 5\n\nSample Output 2\n\n2\n\nFor example, you can pair (0, 0) and (2, 3), then (1, 1) and (3, 4).\n\nSample Input 3\n\n2\n2 2\n3 3\n0 0\n1 1\n\nSample Output 3\n\n0\n\nIt is possible that no pair can be formed.\n\nSample Input 4\n\n5\n0 0\n7 3\n2 2\n4 8\n1 6\n8 5\n6 9\n5 4\n9 1\n3 7\n\nSample Output 4\n\n5\n\nSample Input 5\n\n5\n0 0\n1 1\n5 5\n6 6\n7 7\n2 2\n3 3\n4 4\n8 8\n9 9\n\nSample Output 5\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 811, "cpu_time_ms": 206, "memory_kb": 26964}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s034731352", "group_id": "codeNet:p03417", "input_text": "import java.util.*;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int M = sc.nextInt();\n int answer = (Math.abs(N-2))*(Math.abs(M-2));\n System.out.println(answer);\n }\n \n //最大公約数・最小公倍数（セットで使う）\nstatic int gcd (int a, int b) {return b>0?gcd(b,a%b):a;}\nstatic int lcm (int a, int b) {return a*b/gcd(a,b);}\n\n\n//素数判定\nstatic boolean isPrime (int n) {\n\tif (n==2) return true;\n\tif (n<2 || n%2==0) return false;\n\tdouble d = Math.sqrt(n);\n\tfor (int i=3; i<=d; i+=2) if(n%i==0){return false;}\n\treturn true;\n}\n\n\n//倍数判定（10進数以外のときに有用）\nstatic boolean isMultiple (String s, int base, int m) {\n\tint temp = 0;\n\tfor (int i=0; i0?gcd(b,a%b):a;}\nstatic int lcm (int a, int b) {return a*b/gcd(a,b);}\n\n\n//素数判定\nstatic boolean isPrime (int n) {\n\tif (n==2) return true;\n\tif (n<2 || n%2==0) return false;\n\tdouble d = Math.sqrt(n);\n\tfor (int i=3; i<=d; i+=2) if(n%i==0){return false;}\n\treturn true;\n}\n\n\n//倍数判定（10進数以外のときに有用）\nstatic boolean isMultiple (String s, int base, int m) {\n\tint temp = 0;\n\tfor (int i=0; i n) return val;\n if(k == 0) return n*n;\n \n while(cur <= n){\n int volume = cur - k;\n int cycle = n/cur;\n val += cycle * volume;\n \n int rest = n % cur;\n val += rest - k >= 0 ? rest - k + 1 : 0;\n \n cur++;\n }\n \n return val;\n }\n}\n", "language": "Java", "metadata": {"date": 1541690873, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03418.html", "problem_id": "p03418", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03418/input.txt", "sample_output_relpath": "derived/input_output/data/p03418/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03418/Java/s619142610.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s619142610", "user_id": "u790553153"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\npublic class Main {\n public static void main(String args[]) {\n Scanner scan = new Scanner(System.in);\n \n int n = scan.nextInt();\n int k = scan.nextInt();\n \n System.out.println(reminder(n,0,k,k+1));\n }\n \n private static long reminder(int n, long val, int k, int cur){\n if(cur > n) return val;\n if(k == 0) return n*n;\n \n while(cur <= n){\n int volume = cur - k;\n int cycle = n/cur;\n val += cycle * volume;\n \n int rest = n % cur;\n val += rest - k >= 0 ? rest - k + 1 : 0;\n \n cur++;\n }\n \n return val;\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "sample_input": "5 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03418", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 750, "cpu_time_ms": 107, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s068423533", "group_id": "codeNet:p03418", "input_text": "import java.util.*;\nimport java.*;\nclass Main {\n public static void main(String[] args)\n {\n Scanner scan = new Scanner(System.in);\n int N = scan.nextInt();\n int K = scan.nextInt();\n long coun = 0;\n\n if(K == 0){\n coun = N * N;\n System.out.println(coun);\n return;\n }\n for(int i = 1; i <= N; i++){\n if(i > K){\n coun += (N / i) * (i - K) >= 0 ? (N / i) * (i - K) : 0;\n\n coun += (N % i) - K + 1 >= 0 ? (N % i) - K + 1 : 0;\n }\n }\n System.out.println(coun);\n }\n}\n", "language": "Java", "metadata": {"date": 1520833791, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03418.html", "problem_id": "p03418", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03418/input.txt", "sample_output_relpath": "derived/input_output/data/p03418/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03418/Java/s068423533.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s068423533", "user_id": "u406060664"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.util.*;\nimport java.*;\nclass Main {\n public static void main(String[] args)\n {\n Scanner scan = new Scanner(System.in);\n int N = scan.nextInt();\n int K = scan.nextInt();\n long coun = 0;\n\n if(K == 0){\n coun = N * N;\n System.out.println(coun);\n return;\n }\n for(int i = 1; i <= N; i++){\n if(i > K){\n coun += (N / i) * (i - K) >= 0 ? (N / i) * (i - K) : 0;\n\n coun += (N % i) - K + 1 >= 0 ? (N % i) - K + 1 : 0;\n }\n }\n System.out.println(coun);\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "sample_input": "5 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03418", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 600, "cpu_time_ms": 106, "memory_kb": 21972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s354024444", "group_id": "codeNet:p03419", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n int m = sc.nextInt();\n\n if (n > m) {\n int tmp = n;\n n = m;\n m = tmp;\n }\n\n long ans = 0;\n\n if (n == 1) {\n if (m == 1)\n ans = 1;\n else\n ans = m - 2;\n } else {\n ans = (n - 2) * (m - 2);\n }\n\n System.out.println(ans);\n }\n}", "language": "Java", "metadata": {"date": 1555462211, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03419.html", "problem_id": "p03419", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03419/input.txt", "sample_output_relpath": "derived/input_output/data/p03419/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03419/Java/s354024444.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s354024444", "user_id": "u387806792"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n int m = sc.nextInt();\n\n if (n > m) {\n int tmp = n;\n n = m;\n m = tmp;\n }\n\n long ans = 0;\n\n if (n == 1) {\n if (m == 1)\n ans = 1;\n else\n ans = m - 2;\n } else {\n ans = (n - 2) * (m - 2);\n }\n\n System.out.println(ans);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "sample_input": "2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03419", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 541, "cpu_time_ms": 95, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s123916650", "group_id": "codeNet:p03419", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint m=sc.nextInt();\n\t\tif(n==1&&m==1) System.out.println(1);\n\t\telse if(n==1||m==1) System.out.println(Math.max(n, m)-2);\n\t\telse System.out.println((n-2)*(m-2));\n\t}\n}\n", "language": "Java", "metadata": {"date": 1533928095, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03419.html", "problem_id": "p03419", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03419/input.txt", "sample_output_relpath": "derived/input_output/data/p03419/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03419/Java/s123916650.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s123916650", "user_id": "u203872764"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n=sc.nextInt();\n\t\tint m=sc.nextInt();\n\t\tif(n==1&&m==1) System.out.println(1);\n\t\telse if(n==1||m==1) System.out.println(Math.max(n, m)-2);\n\t\telse System.out.println((n-2)*(m-2));\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "sample_input": "2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03419", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 317, "cpu_time_ms": 93, "memory_kb": 22100}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s922721113", "group_id": "codeNet:p03424", "input_text": "import java.util.*;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n String S[] = new String [N];\n String Str = \"Two\";\n for(int i=0;i to) {\n return 0;\n }\n if (from == to) {\n return 1;\n }\n if (answer[from][to][k] != -1) {\n return answer[from][to][k];\n }\n if (s.charAt(from) == s.charAt(to)) {\n answer[from][to][k] = go(from + 1, to - 1, k) + 2;\n } else {\n answer[from][to][k] = Math.max(go(from, to - 1, k), go(from + 1, to, k));\n if (k != 0) {\n answer[from][to][k] = Math.max(answer[from][to][k], go(from + 1, to - 1, k - 1) + 2);\n }\n }\n return answer[from][to][k];\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n\n static class ArrayUtils {\n public static void fill(int[][] array, int value) {\n for (int[] row : array) {\n Arrays.fill(row, value);\n }\n }\n\n public static void fill(int[][][] array, int value) {\n for (int[][] subArray : array) {\n fill(subArray, value);\n }\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuilder res = new StringBuilder();\n do {\n if (Character.isValidCodePoint(c)) {\n res.appendCodePoint(c);\n }\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1519525235, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03430.html", "problem_id": "p03430", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03430/input.txt", "sample_output_relpath": "derived/input_output/data/p03430/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03430/Java/s494874944.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s494874944", "user_id": "u018357824"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.BufferedWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author Egor Kulikov (egor@egork.net)\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n OutputWriter out = new OutputWriter(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskD {\n int[][][] answer;\n String s;\n\n public void solve(int testNumber, InputReader in, OutputWriter out) {\n s = in.readString();\n int n = s.length();\n int k = in.readInt();\n answer = new int[n][n][k + 1];\n ArrayUtils.fill(answer, -1);\n out.printLine(go(0, n - 1, k));\n }\n\n private int go(int from, int to, int k) {\n if (from > to) {\n return 0;\n }\n if (from == to) {\n return 1;\n }\n if (answer[from][to][k] != -1) {\n return answer[from][to][k];\n }\n if (s.charAt(from) == s.charAt(to)) {\n answer[from][to][k] = go(from + 1, to - 1, k) + 2;\n } else {\n answer[from][to][k] = Math.max(go(from, to - 1, k), go(from + 1, to, k));\n if (k != 0) {\n answer[from][to][k] = Math.max(answer[from][to][k], go(from + 1, to - 1, k - 1) + 2);\n }\n }\n return answer[from][to][k];\n }\n\n }\n\n static class OutputWriter {\n private final PrintWriter writer;\n\n public OutputWriter(OutputStream outputStream) {\n writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));\n }\n\n public OutputWriter(Writer writer) {\n this.writer = new PrintWriter(writer);\n }\n\n public void close() {\n writer.close();\n }\n\n public void printLine(int i) {\n writer.println(i);\n }\n\n }\n\n static class ArrayUtils {\n public static void fill(int[][] array, int value) {\n for (int[] row : array) {\n Arrays.fill(row, value);\n }\n }\n\n public static void fill(int[][][] array, int value) {\n for (int[][] subArray : array) {\n fill(subArray, value);\n }\n }\n\n }\n\n static class InputReader {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n private InputReader.SpaceCharFilter filter;\n\n public InputReader(InputStream stream) {\n this.stream = stream;\n }\n\n public int read() {\n if (numChars == -1) {\n throw new InputMismatchException();\n }\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0) {\n return -1;\n }\n }\n return buf[curChar++];\n }\n\n public int readInt() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n int sgn = 1;\n if (c == '-') {\n sgn = -1;\n c = read();\n }\n int res = 0;\n do {\n if (c < '0' || c > '9') {\n throw new InputMismatchException();\n }\n res *= 10;\n res += c - '0';\n c = read();\n } while (!isSpaceChar(c));\n return res * sgn;\n }\n\n public String readString() {\n int c = read();\n while (isSpaceChar(c)) {\n c = read();\n }\n StringBuilder res = new StringBuilder();\n do {\n if (Character.isValidCodePoint(c)) {\n res.appendCodePoint(c);\n }\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n public boolean isSpaceChar(int c) {\n if (filter != null) {\n return filter.isSpaceChar(c);\n }\n return isWhitespace(c);\n }\n\n public static boolean isWhitespace(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public interface SpaceCharFilter {\n public boolean isSpaceChar(int ch);\n\n }\n\n }\n}\n\n", "problem_context": "Score : 900 points\n\nProblem Statement\n\nTakahashi has decided to give a string to his mother.\n\nThe value of a string T is the length of the longest common subsequence of T and T', where T' is the string obtained by reversing T.\nThat is, the value is the longest length of the following two strings that are equal: a subsequence of T (possibly non-contiguous), and a subsequence of T' (possibly non-contiguous).\n\nTakahashi has a string S. He wants to give her mother a string of the highest possible value, so he would like to change at most K characters in S to any other characters in order to obtain a string of the highest possible value.\nFind the highest possible value achievable.\n\nConstraints\n\n1 \\leq |S| \\leq 300\n\n0 \\leq K \\leq |S|\n\nS consists of lowercase English letters.\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the highest possible value achievable.\n\nSample Input 1\n\nabcabcabc\n1\n\nSample Output 1\n\n7\n\nChanging the first character to c results in cbcabcabc.\nLet this tring be T, then one longest common subsequence of T and T' is cbabcbc, whose length is 7.\n\nSample Input 2\n\natcodergrandcontest\n3\n\nSample Output 2\n\n15", "sample_input": "abcabcabc\n1\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03430", "source_text": "Score : 900 points\n\nProblem Statement\n\nTakahashi has decided to give a string to his mother.\n\nThe value of a string T is the length of the longest common subsequence of T and T', where T' is the string obtained by reversing T.\nThat is, the value is the longest length of the following two strings that are equal: a subsequence of T (possibly non-contiguous), and a subsequence of T' (possibly non-contiguous).\n\nTakahashi has a string S. He wants to give her mother a string of the highest possible value, so he would like to change at most K characters in S to any other characters in order to obtain a string of the highest possible value.\nFind the highest possible value achievable.\n\nConstraints\n\n1 \\leq |S| \\leq 300\n\n0 \\leq K \\leq |S|\n\nS consists of lowercase English letters.\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the highest possible value achievable.\n\nSample Input 1\n\nabcabcabc\n1\n\nSample Output 1\n\n7\n\nChanging the first character to c results in cbcabcabc.\nLet this tring be T, then one longest common subsequence of T and T' is cbabcbc, whose length is 7.\n\nSample Input 2\n\natcodergrandcontest\n3\n\nSample Output 2\n\n15", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5159, "cpu_time_ms": 299, "memory_kb": 170064}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s559742334", "group_id": "codeNet:p03433", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args){\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int a = sc.nextInt();\n System.out.println(n % 500 <= a ? \"YES\" : \"NO\");\n }\n\n\n}\n", "language": "Java", "metadata": {"date": 1519005733, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03433.html", "problem_id": "p03433", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03433/input.txt", "sample_output_relpath": "derived/input_output/data/p03433/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03433/Java/s559742334.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s559742334", "user_id": "u929611589"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args){\n\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int a = sc.nextInt();\n System.out.println(n % 500 <= a ? \"YES\" : \"NO\");\n }\n\n\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120 has A 1-yen coins and infinitely many 500-yen coins.\n\nDetermine if he can pay exactly N yen using only these coins.\n\nConstraints\n\nN is an integer between 1 and 10000 (inclusive).\n\nA is an integer between 0 and 1000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutput\n\nIf E869120 can pay exactly N yen using only his 1-yen and 500-yen coins, print Yes; otherwise, print No.\n\nSample Input 1\n\n2018\n218\n\nSample Output 1\n\nYes\n\nWe can pay 2018 yen with four 500-yen coins and 18 1-yen coins, so the answer is Yes.\n\nSample Input 2\n\n2763\n0\n\nSample Output 2\n\nNo\n\nWhen we have no 1-yen coins, we can only pay a multiple of 500 yen using only 500-yen coins. Since 2763 is not a multiple of 500, we cannot pay this amount.\n\nSample Input 3\n\n37\n514\n\nSample Output 3\n\nYes", "sample_input": "2018\n218\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03433", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120 has A 1-yen coins and infinitely many 500-yen coins.\n\nDetermine if he can pay exactly N yen using only these coins.\n\nConstraints\n\nN is an integer between 1 and 10000 (inclusive).\n\nA is an integer between 0 and 1000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutput\n\nIf E869120 can pay exactly N yen using only his 1-yen and 500-yen coins, print Yes; otherwise, print No.\n\nSample Input 1\n\n2018\n218\n\nSample Output 1\n\nYes\n\nWe can pay 2018 yen with four 500-yen coins and 18 1-yen coins, so the answer is Yes.\n\nSample Input 2\n\n2763\n0\n\nSample Output 2\n\nNo\n\nWhen we have no 1-yen coins, we can only pay a multiple of 500 yen using only 500-yen coins. Since 2763 is not a multiple of 500, we cannot pay this amount.\n\nSample Input 3\n\n37\n514\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 265, "cpu_time_ms": 107, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s319373592", "group_id": "codeNet:p03434", "input_text": "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint []a= new int[N];\n\t\tfor(int i=0;ia[i]){\n\t\t\t\tmin=a[i];\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max-min);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1553105352, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03434.html", "problem_id": "p03434", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03434/input.txt", "sample_output_relpath": "derived/input_output/data/p03434/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03434/Java/s319373592.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s319373592", "user_id": "u841066582"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint []a= new int[N];\n\t\tfor(int i=0;ia[i]){\n\t\t\t\tmin=a[i];\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max-min);\n\t}\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have N cards. A number a_i is written on the i-th card.\n\nAlice and Bob will play a game using these cards. In this game, Alice and Bob alternately take one card. Alice goes first.\n\nThe game ends when all the cards are taken by the two players, and the score of each player is the sum of the numbers written on the cards he/she has taken. When both players take the optimal strategy to maximize their scores, find Alice's score minus Bob's score.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\na_i \\ (1 \\leq i \\leq N) is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 a_3 ... a_N\n\nOutput\n\nPrint Alice's score minus Bob's score when both players take the optimal strategy to maximize their scores.\n\nSample Input 1\n\n2\n3 1\n\nSample Output 1\n\n2\n\nFirst, Alice will take the card with 3. Then, Bob will take the card with 1.\nThe difference of their scores will be 3 - 1 = 2.\n\nSample Input 2\n\n3\n2 7 4\n\nSample Output 2\n\n5\n\nFirst, Alice will take the card with 7. Then, Bob will take the card with 4. Lastly, Alice will take the card with 2. The difference of their scores will be 7 - 4 + 2 = 5. The difference of their scores will be 3 - 1 = 2.\n\nSample Input 3\n\n4\n20 18 2 18\n\nSample Output 3\n\n18", "sample_input": "2\n3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03434", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have N cards. A number a_i is written on the i-th card.\n\nAlice and Bob will play a game using these cards. In this game, Alice and Bob alternately take one card. Alice goes first.\n\nThe game ends when all the cards are taken by the two players, and the score of each player is the sum of the numbers written on the cards he/she has taken. When both players take the optimal strategy to maximize their scores, find Alice's score minus Bob's score.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\na_i \\ (1 \\leq i \\leq N) is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 a_3 ... a_N\n\nOutput\n\nPrint Alice's score minus Bob's score when both players take the optimal strategy to maximize their scores.\n\nSample Input 1\n\n2\n3 1\n\nSample Output 1\n\n2\n\nFirst, Alice will take the card with 3. Then, Bob will take the card with 1.\nThe difference of their scores will be 3 - 1 = 2.\n\nSample Input 2\n\n3\n2 7 4\n\nSample Output 2\n\n5\n\nFirst, Alice will take the card with 7. Then, Bob will take the card with 4. Lastly, Alice will take the card with 2. The difference of their scores will be 7 - 4 + 2 = 5. The difference of their scores will be 3 - 1 = 2.\n\nSample Input 3\n\n4\n20 18 2 18\n\nSample Output 3\n\n18", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 422, "cpu_time_ms": 111, "memory_kb": 21972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s538146453", "group_id": "codeNet:p03435", "input_text": "import java.util.*;\n\npublic class Main{\n public static void main(String[]args){\n Scanner sc = new Scanner(System.in);\n int[][] c = new int[3][3];\n c[0][0] = Integer.parseInt(sc.next());\n c[0][1] = Integer.parseInt(sc.next());\n c[0][2] = Integer.parseInt(sc.next());\n c[1][0] = Integer.parseInt(sc.next());\n c[1][1] = Integer.parseInt(sc.next());\n c[1][2] = Integer.parseInt(sc.next());\n c[2][0] = Integer.parseInt(sc.next());\n c[2][1] = Integer.parseInt(sc.next());\n c[2][2] = Integer.parseInt(sc.next());\n \n int[] a = new int[3];\n int[] b = new int[3];\n a[0] = 0;\n b[0] = c[0][0] - a[0];\n b[1] = c[0][1] - a[0];\n b[2] = c[0][2] - a[0];\n a[1] = c[1][1] - b[1];\n a[2] = c[2][1] - b[1];\n \n String ans = \"Yes\";\n for(int i = 0; i < 3; i++){\n for(int j = 0; j < 3; j++){\n if(c[i][j] != a[i] + b[j]){\n ans = \"No\";\n break;\n }\n }\n }\n System.out.println(ans);\n }\n}", "language": "Java", "metadata": {"date": 1568086670, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03435.html", "problem_id": "p03435", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03435/input.txt", "sample_output_relpath": "derived/input_output/data/p03435/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03435/Java/s538146453.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s538146453", "user_id": "u489316980"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String[]args){\n Scanner sc = new Scanner(System.in);\n int[][] c = new int[3][3];\n c[0][0] = Integer.parseInt(sc.next());\n c[0][1] = Integer.parseInt(sc.next());\n c[0][2] = Integer.parseInt(sc.next());\n c[1][0] = Integer.parseInt(sc.next());\n c[1][1] = Integer.parseInt(sc.next());\n c[1][2] = Integer.parseInt(sc.next());\n c[2][0] = Integer.parseInt(sc.next());\n c[2][1] = Integer.parseInt(sc.next());\n c[2][2] = Integer.parseInt(sc.next());\n \n int[] a = new int[3];\n int[] b = new int[3];\n a[0] = 0;\n b[0] = c[0][0] - a[0];\n b[1] = c[0][1] - a[0];\n b[2] = c[0][2] - a[0];\n a[1] = c[1][1] - b[1];\n a[2] = c[2][1] - b[1];\n \n String ans = \"Yes\";\n for(int i = 0; i < 3; i++){\n for(int j = 0; j < 3; j++){\n if(c[i][j] != a[i] + b[j]){\n ans = \"No\";\n break;\n }\n }\n }\n System.out.println(ans);\n }\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have a 3 \\times 3 grid. A number c_{i, j} is written in the square (i, j), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nAccording to Takahashi, there are six integers a_1, a_2, a_3, b_1, b_2, b_3 whose values are fixed, and the number written in the square (i, j) is equal to a_i + b_j.\n\nDetermine if he is correct.\n\nConstraints\n\nc_{i, j} \\ (1 \\leq i \\leq 3, 1 \\leq j \\leq 3) is an integer between 0 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{1,1} c_{1,2} c_{1,3}\nc_{2,1} c_{2,2} c_{2,3}\nc_{3,1} c_{3,2} c_{3,3}\n\nOutput\n\nIf Takahashi's statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 0 1\n2 1 2\n1 0 1\n\nSample Output 1\n\nYes\n\nTakahashi is correct, since there are possible sets of integers such as: a_1=0,a_2=1,a_3=0,b_1=1,b_2=0,b_3=1.\n\nSample Input 2\n\n2 2 2\n2 1 2\n2 2 2\n\nSample Output 2\n\nNo\n\nTakahashi is incorrect in this case.\n\nSample Input 3\n\n0 8 8\n0 8 8\n0 8 8\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1 8 6\n2 9 7\n0 7 7\n\nSample Output 4\n\nNo", "sample_input": "1 0 1\n2 1 2\n1 0 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03435", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have a 3 \\times 3 grid. A number c_{i, j} is written in the square (i, j), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nAccording to Takahashi, there are six integers a_1, a_2, a_3, b_1, b_2, b_3 whose values are fixed, and the number written in the square (i, j) is equal to a_i + b_j.\n\nDetermine if he is correct.\n\nConstraints\n\nc_{i, j} \\ (1 \\leq i \\leq 3, 1 \\leq j \\leq 3) is an integer between 0 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{1,1} c_{1,2} c_{1,3}\nc_{2,1} c_{2,2} c_{2,3}\nc_{3,1} c_{3,2} c_{3,3}\n\nOutput\n\nIf Takahashi's statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 0 1\n2 1 2\n1 0 1\n\nSample Output 1\n\nYes\n\nTakahashi is correct, since there are possible sets of integers such as: a_1=0,a_2=1,a_3=0,b_1=1,b_2=0,b_3=1.\n\nSample Input 2\n\n2 2 2\n2 1 2\n2 2 2\n\nSample Output 2\n\nNo\n\nTakahashi is incorrect in this case.\n\nSample Input 3\n\n0 8 8\n0 8 8\n0 8 8\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1 8 6\n2 9 7\n0 7 7\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 974, "cpu_time_ms": 96, "memory_kb": 21972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s524815185", "group_id": "codeNet:p03449", "input_text": "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int A[][] = new int[2][N];\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < N; j++) {\n A[i][j] = sc.nextInt();\n }\n }\n int max = 0;\n for (int i = 0; i < N; i++) {\n int c = A[0][0];\n for (int j = 1; j <= i; j++) {\n c += A[0][j];\n }\n for (int j = i; j < N; j++) {\n c += A[1][j];\n }\n if (c > max) max = c;\n }\n System.out.println(max);\n }\n}\n", "language": "Java", "metadata": {"date": 1578090775, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03449.html", "problem_id": "p03449", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03449/input.txt", "sample_output_relpath": "derived/input_output/data/p03449/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03449/Java/s524815185.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s524815185", "user_id": "u235818245"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int A[][] = new int[2][N];\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < N; j++) {\n A[i][j] = sc.nextInt();\n }\n }\n int max = 0;\n for (int i = 0; i < N; i++) {\n int c = A[0][0];\n for (int j = 1; j <= i; j++) {\n c += A[0][j];\n }\n for (int j = i; j < N; j++) {\n c += A[1][j];\n }\n if (c > max) max = c;\n }\n System.out.println(max);\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a 2 \\times N grid. We will denote the square at the i-th row and j-th column (1 \\leq i \\leq 2, 1 \\leq j \\leq N) as (i, j).\n\nYou are initially in the top-left square, (1, 1).\nYou will travel to the bottom-right square, (2, N), by repeatedly moving right or down.\n\nThe square (i, j) contains A_{i, j} candies.\nYou will collect all the candies you visit during the travel.\nThe top-left and bottom-right squares also contain candies, and you will also collect them.\n\nAt most how many candies can you collect when you choose the best way to travel?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_{i, j} \\leq 100 (1 \\leq i \\leq 2, 1 \\leq j \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n\nOutput\n\nPrint the maximum number of candies that can be collected.\n\nSample Input 1\n\n5\n3 2 2 4 1\n1 2 2 2 1\n\nSample Output 1\n\n14\n\nThe number of collected candies will be maximized when you:\n\nmove right three times, then move down once, then move right once.\n\nSample Input 2\n\n4\n1 1 1 1\n1 1 1 1\n\nSample Output 2\n\n5\n\nYou will always collect the same number of candies, regardless of how you travel.\n\nSample Input 3\n\n7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2\n\nSample Output 3\n\n29\n\nSample Input 4\n\n1\n2\n3\n\nSample Output 4\n\n5", "sample_input": "5\n3 2 2 4 1\n1 2 2 2 1\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03449", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a 2 \\times N grid. We will denote the square at the i-th row and j-th column (1 \\leq i \\leq 2, 1 \\leq j \\leq N) as (i, j).\n\nYou are initially in the top-left square, (1, 1).\nYou will travel to the bottom-right square, (2, N), by repeatedly moving right or down.\n\nThe square (i, j) contains A_{i, j} candies.\nYou will collect all the candies you visit during the travel.\nThe top-left and bottom-right squares also contain candies, and you will also collect them.\n\nAt most how many candies can you collect when you choose the best way to travel?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_{i, j} \\leq 100 (1 \\leq i \\leq 2, 1 \\leq j \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n\nOutput\n\nPrint the maximum number of candies that can be collected.\n\nSample Input 1\n\n5\n3 2 2 4 1\n1 2 2 2 1\n\nSample Output 1\n\n14\n\nThe number of collected candies will be maximized when you:\n\nmove right three times, then move down once, then move right once.\n\nSample Input 2\n\n4\n1 1 1 1\n1 1 1 1\n\nSample Output 2\n\n5\n\nYou will always collect the same number of candies, regardless of how you travel.\n\nSample Input 3\n\n7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2\n\nSample Output 3\n\n29\n\nSample Input 4\n\n1\n2\n3\n\nSample Output 4\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 567, "cpu_time_ms": 112, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s000162937", "group_id": "codeNet:p03450", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n PeopleLine solver = new PeopleLine();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class PeopleLine {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n WeightedUnionFind uf = new WeightedUnionFind(n + 1);\n for (int i = 0; i < m; i++) {\n int l = in.nextInt();\n int r = in.nextInt();\n int w = in.nextInt();\n if (uf.same(l, r)) {\n int d = uf.diff(l, r);\n if (d != w) {\n out.println(\"No\");\n return;\n }\n } else {\n uf.unite(l, r, w);\n }\n }\n out.println(\"Yes\");\n }\n\n public class WeightedUnionFind {\n private int[] rank;\n private int[] parents;\n private int[] weight;\n\n public WeightedUnionFind() {\n }\n\n public WeightedUnionFind(int size) {\n this.rank = new int[size];\n this.parents = new int[size];\n this.weight = new int[size];\n\n for (int i = 0; i < size; i++) {\n makeSet(i);\n }\n }\n\n public void makeSet(int x) {\n parents[x] = x;\n rank[x] = 0;\n }\n\n public int findSet(int x) {\n if (x != parents[x]) {\n int r = findSet(parents[x]);\n weight[x] += weight[parents[x]];\n parents[x] = r;\n }\n return parents[x];\n }\n\n public int weight(int x) {\n findSet(x);\n return weight[x];\n }\n\n public int diff(int x, int y) {\n return weight(x) - weight(y);\n }\n\n public boolean unite(int x, int y, int w) {\n if (same(x, y)) {\n return false;\n }\n int px = findSet(x);\n int py = findSet(y);\n\n if (rank[px] > rank[py]) {\n // xにくっつける\n parents[py] = px;\n weight[py] = -w - weight[y] + weight[x];\n } else {\n // yにくっつける\n parents[px] = py;\n weight[px] = w + weight[y] - weight[x];\n if (rank[px] == rank[py]) {\n // 接点の高さの上階.こちらによりくっつくように++\n rank[py]++;\n }\n }\n return true;\n }\n\n public boolean same(int x, int y) {\n return findSet(x) == findSet(y);\n }\n\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1601047242, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03450.html", "problem_id": "p03450", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03450/input.txt", "sample_output_relpath": "derived/input_output/data/p03450/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03450/Java/s000162937.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s000162937", "user_id": "u745688558"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n PeopleLine solver = new PeopleLine();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class PeopleLine {\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n int n = in.nextInt();\n int m = in.nextInt();\n WeightedUnionFind uf = new WeightedUnionFind(n + 1);\n for (int i = 0; i < m; i++) {\n int l = in.nextInt();\n int r = in.nextInt();\n int w = in.nextInt();\n if (uf.same(l, r)) {\n int d = uf.diff(l, r);\n if (d != w) {\n out.println(\"No\");\n return;\n }\n } else {\n uf.unite(l, r, w);\n }\n }\n out.println(\"Yes\");\n }\n\n public class WeightedUnionFind {\n private int[] rank;\n private int[] parents;\n private int[] weight;\n\n public WeightedUnionFind() {\n }\n\n public WeightedUnionFind(int size) {\n this.rank = new int[size];\n this.parents = new int[size];\n this.weight = new int[size];\n\n for (int i = 0; i < size; i++) {\n makeSet(i);\n }\n }\n\n public void makeSet(int x) {\n parents[x] = x;\n rank[x] = 0;\n }\n\n public int findSet(int x) {\n if (x != parents[x]) {\n int r = findSet(parents[x]);\n weight[x] += weight[parents[x]];\n parents[x] = r;\n }\n return parents[x];\n }\n\n public int weight(int x) {\n findSet(x);\n return weight[x];\n }\n\n public int diff(int x, int y) {\n return weight(x) - weight(y);\n }\n\n public boolean unite(int x, int y, int w) {\n if (same(x, y)) {\n return false;\n }\n int px = findSet(x);\n int py = findSet(y);\n\n if (rank[px] > rank[py]) {\n // xにくっつける\n parents[py] = px;\n weight[py] = -w - weight[y] + weight[x];\n } else {\n // yにくっつける\n parents[px] = py;\n weight[px] = w + weight[y] - weight[x];\n if (rank[px] == rank[py]) {\n // 接点の高さの上階.こちらによりくっつくように++\n rank[py]++;\n }\n }\n return true;\n }\n\n public boolean same(int x, int y) {\n return findSet(x) == findSet(y);\n }\n\n }\n\n }\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "sample_input": "3 3\n1 2 1\n2 3 1\n1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03450", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3406, "cpu_time_ms": 737, "memory_kb": 60964}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s465075577", "group_id": "codeNet:p03450", "input_text": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int m = sc.nextInt();\n DJSet dj = new DJSet(n);\n int[][] e = new int[m][3];\n for (int i = 0; i < m; i++) {\n int l = sc.nextInt()-1;\n int r = sc.nextInt()-1;\n int d = sc.nextInt();\n e[i][0] = l; e[i][1] = r; e[i][2] = d;\n dj.union(l, r);\n }\n int[][][] g = buildWeightedGraph(n, e);\n Set set = new HashSet<>();\n for (int i = 0; i < n; i++) {\n int r = dj.root(i);\n if(r < 0) r = i;\n set.add(r);\n }\n int[] p = new int[n];\n boolean[] used = new boolean[n];\n boolean ans = true;\n for(int r : set){\n ArrayDeque q = new ArrayDeque<>();\n q.add(r);\n used[r] = true;\n while(!q.isEmpty()){\n int v = q.poll();\n used[v] = true;\n for(int[] na : g[v]){\n int nv = na[0], nd = na[1];\n if(used[nv]){\n if(p[nv] != p[v] + nd){\n ans = false;\n break;\n }\n }else{\n p[nv] = p[v] + nd;\n q.add(nv);\n }\n }\n if(!ans)break;\n }\n if(!ans)break;\n }\n System.out.println(ans ? \"Yes\" : \"No\");\n sc.close();\n\n }\n\n public static int[][][] buildWeightedGraph(int n, int[][] edges){\n int m = edges.length;\n int[][][] graph = new int[n][][];\n int[] deg = new int[n];\n for (int i = 0; i < m; i++) {\n deg[ edges[i][0] ]++;\n deg[ edges[i][1] ]++;\n }\n for (int i = 0; i < n; i++) {\n graph[i] = new int[deg[i]][2];\n }\n for (int i = 0; i < m; i++) {\n int a = edges[i][0];\n int b = edges[i][1];\n int c = edges[i][2];\n graph[a][--deg[a]][0] = b;\n graph[a][deg[a]][1] = c;\n graph[b][--deg[b]][0] = a;\n graph[b][deg[b]][1] -= c;\n }\n\n return graph;\n }\n\n}\n\nclass DJSet {\n /**\n * 各要素の親を保持する配列。\n * 自信が根である要素は負の数を持つ。\n * （負の数の場合、絶対値がその集合の要素数）\n */\n public int[] upper;\n\n /**\n * コンストラクタ。\n * @param n 対象となる要素数\n */\n public DJSet(int n) {\n upper = new int[n];\n Arrays.fill(upper, -1);\n }\n\n /**\n * 要素xが含まれる集合のrootを求める。\n * rootを求める過程で経路圧縮しrootが親になるようにする。\n * @param x 要素x\n * @return 要素xが含まれる集合のroot\n */\n public int root(int x) {\n return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n }\n\n /**\n * 要素xと要素yが同じ集合か判定する。\n * @param x 要素x\n * @param y 要素y\n * @return 要素xと要素yが同じ集合であればtrue、そうでなければfalseを返す。\n */\n public boolean same(int x, int y) {\n return root(x) == root(y);\n }\n\n /**\n * 要素xと要素yを含むそれぞれの集合を合併する。\n * 要素数の多い集合のrootを残し、少ないほうのrootをその下に合併する。\n * @param x 要素x\n * @param y 要素y\n * @return 要素xと要素yを含むそれぞれの集合を合併できたらtrue、もともと同じ集合で合併しなかったらfalseを返す。\n */\n public boolean union(int x, int y) {\n x = root(x);\n y = root(y);\n if (x != y) {\n if (upper[y] < upper[x]) {\n int t = x;\n x = y;\n y = t;\n }\n upper[x] += upper[y];\n upper[y] = x;\n }\n return x != y;\n }\n\n /**\n * 集合の数を数える。\n * @return 集合の数\n */\n public int countSet() {\n int c = 0;\n for (int u : upper) {\n if (u < 0)\n c++;\n }\n return c;\n }\n\n /**\n * 要素ｘが含まれる集合の要素数を数える。\n * @param x 要素ｘ\n * @return 要素ｘが含まれる集合の要素数\n */\n public int countElement(int x) {\n return upper[root(x)] * -1;\n }\n}", "language": "Java", "metadata": {"date": 1588216644, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03450.html", "problem_id": "p03450", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03450/input.txt", "sample_output_relpath": "derived/input_output/data/p03450/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03450/Java/s465075577.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s465075577", "user_id": "u660444966"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int m = sc.nextInt();\n DJSet dj = new DJSet(n);\n int[][] e = new int[m][3];\n for (int i = 0; i < m; i++) {\n int l = sc.nextInt()-1;\n int r = sc.nextInt()-1;\n int d = sc.nextInt();\n e[i][0] = l; e[i][1] = r; e[i][2] = d;\n dj.union(l, r);\n }\n int[][][] g = buildWeightedGraph(n, e);\n Set set = new HashSet<>();\n for (int i = 0; i < n; i++) {\n int r = dj.root(i);\n if(r < 0) r = i;\n set.add(r);\n }\n int[] p = new int[n];\n boolean[] used = new boolean[n];\n boolean ans = true;\n for(int r : set){\n ArrayDeque q = new ArrayDeque<>();\n q.add(r);\n used[r] = true;\n while(!q.isEmpty()){\n int v = q.poll();\n used[v] = true;\n for(int[] na : g[v]){\n int nv = na[0], nd = na[1];\n if(used[nv]){\n if(p[nv] != p[v] + nd){\n ans = false;\n break;\n }\n }else{\n p[nv] = p[v] + nd;\n q.add(nv);\n }\n }\n if(!ans)break;\n }\n if(!ans)break;\n }\n System.out.println(ans ? \"Yes\" : \"No\");\n sc.close();\n\n }\n\n public static int[][][] buildWeightedGraph(int n, int[][] edges){\n int m = edges.length;\n int[][][] graph = new int[n][][];\n int[] deg = new int[n];\n for (int i = 0; i < m; i++) {\n deg[ edges[i][0] ]++;\n deg[ edges[i][1] ]++;\n }\n for (int i = 0; i < n; i++) {\n graph[i] = new int[deg[i]][2];\n }\n for (int i = 0; i < m; i++) {\n int a = edges[i][0];\n int b = edges[i][1];\n int c = edges[i][2];\n graph[a][--deg[a]][0] = b;\n graph[a][deg[a]][1] = c;\n graph[b][--deg[b]][0] = a;\n graph[b][deg[b]][1] -= c;\n }\n\n return graph;\n }\n\n}\n\nclass DJSet {\n /**\n * 各要素の親を保持する配列。\n * 自信が根である要素は負の数を持つ。\n * （負の数の場合、絶対値がその集合の要素数）\n */\n public int[] upper;\n\n /**\n * コンストラクタ。\n * @param n 対象となる要素数\n */\n public DJSet(int n) {\n upper = new int[n];\n Arrays.fill(upper, -1);\n }\n\n /**\n * 要素xが含まれる集合のrootを求める。\n * rootを求める過程で経路圧縮しrootが親になるようにする。\n * @param x 要素x\n * @return 要素xが含まれる集合のroot\n */\n public int root(int x) {\n return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n }\n\n /**\n * 要素xと要素yが同じ集合か判定する。\n * @param x 要素x\n * @param y 要素y\n * @return 要素xと要素yが同じ集合であればtrue、そうでなければfalseを返す。\n */\n public boolean same(int x, int y) {\n return root(x) == root(y);\n }\n\n /**\n * 要素xと要素yを含むそれぞれの集合を合併する。\n * 要素数の多い集合のrootを残し、少ないほうのrootをその下に合併する。\n * @param x 要素x\n * @param y 要素y\n * @return 要素xと要素yを含むそれぞれの集合を合併できたらtrue、もともと同じ集合で合併しなかったらfalseを返す。\n */\n public boolean union(int x, int y) {\n x = root(x);\n y = root(y);\n if (x != y) {\n if (upper[y] < upper[x]) {\n int t = x;\n x = y;\n y = t;\n }\n upper[x] += upper[y];\n upper[y] = x;\n }\n return x != y;\n }\n\n /**\n * 集合の数を数える。\n * @return 集合の数\n */\n public int countSet() {\n int c = 0;\n for (int u : upper) {\n if (u < 0)\n c++;\n }\n return c;\n }\n\n /**\n * 要素ｘが含まれる集合の要素数を数える。\n * @param x 要素ｘ\n * @return 要素ｘが含まれる集合の要素数\n */\n public int countElement(int x) {\n return upper[root(x)] * -1;\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "sample_input": "3 3\n1 2 1\n2 3 1\n1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03450", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4601, "cpu_time_ms": 2110, "memory_kb": 354216}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s632376878", "group_id": "codeNet:p03450", "input_text": "import java.io.*;\nimport java.util.*;\nclass pers\n{\n\tboolean isr=true;\n\tint par;\n\tint dist=0;\n}\npublic class Main\n{\n\tstatic void pars(int par, int chi, int dist)\n\t{\n\t\tif(pe[par].isr&&pe[chi].isr)\n\t\t{\n\t//\t\tSystem.out.println(\"hola\");\n\t\t\tpe[chi].isr=false;\n\t//\t\tSystem.out.println(chi+\" \"+pe[chi].isr);\n\t\t\tpe[chi].par=par;\n\t\t\tpe[chi].dist=dist;\n\t\t}\n\t\telse if(fp(par)==fp(chi))\n\t\t{\n\t\t\tif(dist!=pe[chi].dist-pe[par].dist)\n\t\t\t{\n\t//\t\t\tSystem.out.println(pe[chi].dist+\" \"+pe[par].dist);\n\t\t\t\tposs=false;\n\t\t\t}\n\t\t}\n\t\telse if(pe[par].isr)\n\t\t{\n\t\t\tpe[pe[chi].par].par=par;\n\t\t\tpe[pe[chi].par].isr=false;\n\t\t\tpe[pe[chi].par].dist=dist-pe[chi].dist;\n\t\t}\n\t\telse if(pe[chi].isr)\n\t\t{\n\t\t\tpe[chi].isr=false;\n\t\t\tpe[chi].par=par;\n\t\t\tpe[chi].dist=dist;\n\t\t}\n\t\t\n\t\telse\n\t\t{\n\t\t\tif(pe[chi].dist>dist+pe[par].dist)\n\t\t\t{\n\t\t\t\tpe[pe[par].par].dist=pe[chi].dist-dist-pe[chi].dist;\n\t\t\t\tpe[pe[par].par].par=pe[chi].par;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpe[pe[chi].par].dist=dist+pe[par].dist-pe[chi].dist;\n\t\t\t\tpe[pe[chi].par].par=pe[par].par;\n\t\t\t}\n\t\t}\n\t}\n\tstatic boolean poss;\n\tstatic int fp(int a)\n\t{\n\t\tif(pe[a].isr)\n\t\t\treturn a;\n\t\telse\n\t\t{\n\t\t\tint te=fp(pe[a].par);\n\t\t//\tpe[a].par=fp(pe[a].par);\n\t\t\tpe[a].dist=pe[a].dist+pe[pe[a].par].dist;\n\t\t\tpe[a].par=te;\n\t\t\treturn pe[a].par;\n\t\t}\n\t}\n\tstatic pers[] pe;\n\tpublic static void main(String[] args) throws IOException\n\t{\n\t\tReader in=new Reader();\n\t\tposs=true;\n\t\tint n=in.nextInt();\n\t\tint m=in.nextInt();\n\t\tint a[]=new int[n];\n\t\tpe=new pers[n+1];\n\t\tfor(int i=0; i<=n; i++)\n\t\t\tpe[i]=new pers();\n\t\tint l,r,d;\n\t\tfor(int i=0; i= '0' && c <= '9');\n \n if (neg)\n return -ret;\n return ret;\n }\n \n public long l() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n \n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n \n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n \n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n \n if (neg)\n return -ret;\n return ret;\n }\n \n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n \n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n \n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n}", "language": "Java", "metadata": {"date": 1517196194, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03450.html", "problem_id": "p03450", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03450/input.txt", "sample_output_relpath": "derived/input_output/data/p03450/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03450/Java/s632376878.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s632376878", "user_id": "u317879811"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nclass pers\n{\n\tboolean isr=true;\n\tint par;\n\tint dist=0;\n}\npublic class Main\n{\n\tstatic void pars(int par, int chi, int dist)\n\t{\n\t\tif(pe[par].isr&&pe[chi].isr)\n\t\t{\n\t//\t\tSystem.out.println(\"hola\");\n\t\t\tpe[chi].isr=false;\n\t//\t\tSystem.out.println(chi+\" \"+pe[chi].isr);\n\t\t\tpe[chi].par=par;\n\t\t\tpe[chi].dist=dist;\n\t\t}\n\t\telse if(fp(par)==fp(chi))\n\t\t{\n\t\t\tif(dist!=pe[chi].dist-pe[par].dist)\n\t\t\t{\n\t//\t\t\tSystem.out.println(pe[chi].dist+\" \"+pe[par].dist);\n\t\t\t\tposs=false;\n\t\t\t}\n\t\t}\n\t\telse if(pe[par].isr)\n\t\t{\n\t\t\tpe[pe[chi].par].par=par;\n\t\t\tpe[pe[chi].par].isr=false;\n\t\t\tpe[pe[chi].par].dist=dist-pe[chi].dist;\n\t\t}\n\t\telse if(pe[chi].isr)\n\t\t{\n\t\t\tpe[chi].isr=false;\n\t\t\tpe[chi].par=par;\n\t\t\tpe[chi].dist=dist;\n\t\t}\n\t\t\n\t\telse\n\t\t{\n\t\t\tif(pe[chi].dist>dist+pe[par].dist)\n\t\t\t{\n\t\t\t\tpe[pe[par].par].dist=pe[chi].dist-dist-pe[chi].dist;\n\t\t\t\tpe[pe[par].par].par=pe[chi].par;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpe[pe[chi].par].dist=dist+pe[par].dist-pe[chi].dist;\n\t\t\t\tpe[pe[chi].par].par=pe[par].par;\n\t\t\t}\n\t\t}\n\t}\n\tstatic boolean poss;\n\tstatic int fp(int a)\n\t{\n\t\tif(pe[a].isr)\n\t\t\treturn a;\n\t\telse\n\t\t{\n\t\t\tint te=fp(pe[a].par);\n\t\t//\tpe[a].par=fp(pe[a].par);\n\t\t\tpe[a].dist=pe[a].dist+pe[pe[a].par].dist;\n\t\t\tpe[a].par=te;\n\t\t\treturn pe[a].par;\n\t\t}\n\t}\n\tstatic pers[] pe;\n\tpublic static void main(String[] args) throws IOException\n\t{\n\t\tReader in=new Reader();\n\t\tposs=true;\n\t\tint n=in.nextInt();\n\t\tint m=in.nextInt();\n\t\tint a[]=new int[n];\n\t\tpe=new pers[n+1];\n\t\tfor(int i=0; i<=n; i++)\n\t\t\tpe[i]=new pers();\n\t\tint l,r,d;\n\t\tfor(int i=0; i= '0' && c <= '9');\n \n if (neg)\n return -ret;\n return ret;\n }\n \n public long l() throws IOException\n {\n long ret = 0;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n if (neg)\n return -ret;\n return ret;\n }\n \n public double nextDouble() throws IOException\n {\n double ret = 0, div = 1;\n byte c = read();\n while (c <= ' ')\n c = read();\n boolean neg = (c == '-');\n if (neg)\n c = read();\n \n do {\n ret = ret * 10 + c - '0';\n }\n while ((c = read()) >= '0' && c <= '9');\n \n if (c == '.')\n {\n while ((c = read()) >= '0' && c <= '9')\n {\n ret += (c - '0') / (div *= 10);\n }\n }\n \n if (neg)\n return -ret;\n return ret;\n }\n \n private void fillBuffer() throws IOException\n {\n bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);\n if (bytesRead == -1)\n buffer[0] = -1;\n }\n \n private byte read() throws IOException\n {\n if (bufferPointer == bytesRead)\n fillBuffer();\n return buffer[bufferPointer++];\n }\n \n public void close() throws IOException\n {\n if (din == null)\n return;\n din.close();\n }\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "sample_input": "3 3\n1 2 1\n2 3 1\n1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03450", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5396, "cpu_time_ms": 380, "memory_kb": 26792}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s465684730", "group_id": "codeNet:p03457", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner scan = new Scanner(System.in);\n\n int n = scan.nextInt();\n\n int[] t = new int[n + 1];\n int[] x = new int[n + 1];\n int[] y = new int[n + 1];\n\n t[0] = 0;\n x[0] = 0;\n y[0] = 0;\n\n for (int i = 1; i < n + 1; i++) {\n t[i] = scan.nextInt();\n x[i] = scan.nextInt();\n y[i] = scan.nextInt();\n\n if ((Math.abs(x[i] - x[i - 1]) + Math.abs(y[i] - y[i - 1]) > t[i] - t[i - 1])\n || (((Math.abs(x[i] - x[i - 1]) + Math.abs(y[i] - y[i - 1])) % 2) != ((t[i] - t[i - 1]) % 2))) {\n System.out.println(\"No\");\n return;\n }\n\n }\n\n System.out.println(\"Yes\");\n\n }\n\n}\n", "language": "Java", "metadata": {"date": 1595906588, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03457/input.txt", "sample_output_relpath": "derived/input_output/data/p03457/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03457/Java/s465684730.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s465684730", "user_id": "u357544143"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n\n Scanner scan = new Scanner(System.in);\n\n int n = scan.nextInt();\n\n int[] t = new int[n + 1];\n int[] x = new int[n + 1];\n int[] y = new int[n + 1];\n\n t[0] = 0;\n x[0] = 0;\n y[0] = 0;\n\n for (int i = 1; i < n + 1; i++) {\n t[i] = scan.nextInt();\n x[i] = scan.nextInt();\n y[i] = scan.nextInt();\n\n if ((Math.abs(x[i] - x[i - 1]) + Math.abs(y[i] - y[i - 1]) > t[i] - t[i - 1])\n || (((Math.abs(x[i] - x[i - 1]) + Math.abs(y[i] - y[i - 1])) % 2) != ((t[i] - t[i - 1]) % 2))) {\n System.out.println(\"No\");\n return;\n }\n\n }\n\n System.out.println(\"Yes\");\n\n }\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "sample_input": "2\n3 1 2\n6 1 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03457", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 721, "cpu_time_ms": 521, "memory_kb": 59620}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s309403468", "group_id": "codeNet:p03457", "input_text": "import java.util.Scanner;\nimport java.util.List;\nimport java.util.ArrayList;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n List t = new ArrayList<>();\n List x = new ArrayList<>();\n List y = new ArrayList<>();\n t.add(0);\n x.add(0);\n y.add(0);\n int[] xt = {-1,0,1,0};\n int[] yt = {0,1,0,-1};\n for(int i = 0;i < n;i++){\n t.add(sc.nextInt());\n x.add(sc.nextInt());\n y.add(sc.nextInt());\n }\n for(int i = 1;i < n;i++){\n int dt = t.get(i) - t.get(i-1);\n int dist = Math.abs(x.get(i)-x.get(i-1)) + Math.abs(y.get(i)-y.get(i-1));\n if(dist <= dt && (dist % 2) == (dt % 2)){\n System.out.println(\"Yes\");\n return;\n }\n }\n System.out.println(\"No\");\n }\n}\n", "language": "Java", "metadata": {"date": 1532464624, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03457/input.txt", "sample_output_relpath": "derived/input_output/data/p03457/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03457/Java/s309403468.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s309403468", "user_id": "u076522215"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\nimport java.util.List;\nimport java.util.ArrayList;\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n List t = new ArrayList<>();\n List x = new ArrayList<>();\n List y = new ArrayList<>();\n t.add(0);\n x.add(0);\n y.add(0);\n int[] xt = {-1,0,1,0};\n int[] yt = {0,1,0,-1};\n for(int i = 0;i < n;i++){\n t.add(sc.nextInt());\n x.add(sc.nextInt());\n y.add(sc.nextInt());\n }\n for(int i = 1;i < n;i++){\n int dt = t.get(i) - t.get(i-1);\n int dist = Math.abs(x.get(i)-x.get(i-1)) + Math.abs(y.get(i)-y.get(i-1));\n if(dist <= dt && (dist % 2) == (dt % 2)){\n System.out.println(\"Yes\");\n return;\n }\n }\n System.out.println(\"No\");\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "sample_input": "2\n3 1 2\n6 1 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03457", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 960, "cpu_time_ms": 588, "memory_kb": 93736}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s540501964", "group_id": "codeNet:p03466", "input_text": "import java.io.*;\nimport java.util.*;\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.flush();out.close();\n }\n static class TaskE {\n boolean chk(int a,int b,int p){\n if(a<0||b<0)return false;\n if(cal(a,b)<=p)return true;return false;\n }\n int cal(int a,int b){\n return (int)Math.ceil((double)Math.max(a,b)/(double)(Math.min(a,b)+1));\n }\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n=in.nextInt();\n while(n-->0){\n int a=in.nextInt(),b=in.nextInt(),c=in.nextInt(),d=in.nextInt();\n int k=cal(a,b);//System.out.println(k+\" k\");\n int l=Math.max(0,c-1-b),r=c-1;int ans=0;\n while(l<=r){\n int m=(l+r)>>1;\n if(chk(m,c-1-m,k)&&chk(a-m,b-(c-1-m),k)){\n ans=m;l=m+1;\n }else r=m-1;\n }//System.out.println(ans+\" ans\");\n int la=a-ans,lb=b-(c-1-ans);int nb=0,na=0;\n if(chk(la,lb+1,k)&&chk(ans,c-1-ans-1,k)){\n int L=1,R=Math.min(c-1,b);\n while(L<=R){\n int m=(L+R)>>1;\n if(chk(la,lb+m,k)&&chk(ans,c-1-ans-m,k)){\n nb=m;L=m+1;\n }else R=m-1;\n }\n }else if(chk(la+1,lb,k)&&chk(ans-1,c-1-ans,k)){\n int L=1,R=Math.min(c-1,a);\n while(L<=R){\n int m=(L+R)>>1;\n if(chk(la+m,lb,k)&&chk(ans-m,c-1-ans,k)){\n na=m;R=m-1;\n }else L=m+1;\n }\n if(ans==c-1)na=ans;\n }//System.out.println(na+\" \"+nb);\n for(int i=0;i<=d-c;i++){\n if(chk(la-1,lb,k)&&na+1<=k){\n out.print(\"A\");++na;nb=0;--la;\n }else{\n out.print(\"B\");++nb;na=0;--lb;\n }\n }out.println();\n }\n }\n }\n static class InputReader {\n BufferedReader br;\n StringTokenizer st;\n public InputReader(InputStream stream) {\n br = new BufferedReader(new InputStreamReader(stream));\n st = null;\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}", "language": "Java", "metadata": {"date": 1516065709, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03466.html", "problem_id": "p03466", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03466/input.txt", "sample_output_relpath": "derived/input_output/data/p03466/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03466/Java/s540501964.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s540501964", "user_id": "u381680628"}, "prompt_components": {"gold_output": "BABAB\nAABAABAABB\nA\nBAABA\nABAB\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskE solver = new TaskE();\n solver.solve(1, in, out);\n out.flush();out.close();\n }\n static class TaskE {\n boolean chk(int a,int b,int p){\n if(a<0||b<0)return false;\n if(cal(a,b)<=p)return true;return false;\n }\n int cal(int a,int b){\n return (int)Math.ceil((double)Math.max(a,b)/(double)(Math.min(a,b)+1));\n }\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n int n=in.nextInt();\n while(n-->0){\n int a=in.nextInt(),b=in.nextInt(),c=in.nextInt(),d=in.nextInt();\n int k=cal(a,b);//System.out.println(k+\" k\");\n int l=Math.max(0,c-1-b),r=c-1;int ans=0;\n while(l<=r){\n int m=(l+r)>>1;\n if(chk(m,c-1-m,k)&&chk(a-m,b-(c-1-m),k)){\n ans=m;l=m+1;\n }else r=m-1;\n }//System.out.println(ans+\" ans\");\n int la=a-ans,lb=b-(c-1-ans);int nb=0,na=0;\n if(chk(la,lb+1,k)&&chk(ans,c-1-ans-1,k)){\n int L=1,R=Math.min(c-1,b);\n while(L<=R){\n int m=(L+R)>>1;\n if(chk(la,lb+m,k)&&chk(ans,c-1-ans-m,k)){\n nb=m;L=m+1;\n }else R=m-1;\n }\n }else if(chk(la+1,lb,k)&&chk(ans-1,c-1-ans,k)){\n int L=1,R=Math.min(c-1,a);\n while(L<=R){\n int m=(L+R)>>1;\n if(chk(la+m,lb,k)&&chk(ans-m,c-1-ans,k)){\n na=m;R=m-1;\n }else L=m+1;\n }\n if(ans==c-1)na=ans;\n }//System.out.println(na+\" \"+nb);\n for(int i=0;i<=d-c;i++){\n if(chk(la-1,lb,k)&&na+1<=k){\n out.print(\"A\");++na;nb=0;--la;\n }else{\n out.print(\"B\");++nb;na=0;--lb;\n }\n }out.println();\n }\n }\n }\n static class InputReader {\n BufferedReader br;\n StringTokenizer st;\n public InputReader(InputStream stream) {\n br = new BufferedReader(new InputStreamReader(stream));\n st = null;\n }\n\n String next() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return null;\n st = new StringTokenizer(s);\n }\n return st.nextToken();\n }\n\n boolean hasMoreTokens() {\n while (st == null || !st.hasMoreTokens()) {\n String s = null;\n try {\n s = br.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (s == null)\n return false;\n st = new StringTokenizer(s);\n }\n return true;\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n public long nextLong() {\n return Long.parseLong(next());\n }\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n }\n}", "problem_context": "Score : 1100 points\n\nProblem Statement\n\nLet f(A, B), where A and B are positive integers, be the string satisfying the following conditions:\n\nf(A, B) has length A + B;\n\nf(A, B) contains exactly A letters A and exactly B letters B;\n\nThe length of the longest substring of f(A, B) consisting of equal letters (ex., AAAAA or BBBB) is as small as possible under the conditions above;\n\nf(A, B) is the lexicographically smallest string satisfying the conditions above.\n\nFor example, f(2, 3) = BABAB, and f(6, 4) = AABAABAABB.\n\nAnswer Q queries: find the substring of f(A_i, B_i) from position C_i to position D_i (1-based).\n\nConstraints\n\n1 \\leq Q \\leq 10^3\n\n1 \\leq A_i, B_i \\leq 5 \\times 10^8\n\n1 \\leq C_i \\leq D_i \\leq A_i + B_i\n\nD_i - C_i + 1 \\leq 100\n\nAll input values are integers.\n\nPartial Score\n\n500 points will be awarded for passing the testset satisfying 1 \\leq A_i, B_i \\leq 10^3.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_Q B_Q C_Q D_Q\n\nOutput\n\nFor each query i in order of input, print a line containing the substring of f(A_i, B_i) from position C_i to position D_i (1-based).\n\nSample Input 1\n\n5\n2 3 1 5\n6 4 1 10\n2 3 4 4\n6 4 3 7\n8 10 5 8\n\nSample Output 1\n\nBABAB\nAABAABAABB\nA\nBAABA\nABAB", "sample_input": "5\n2 3 1 5\n6 4 1 10\n2 3 4 4\n6 4 3 7\n8 10 5 8\n"}, "reference_outputs": ["BABAB\nAABAABAABB\nA\nBAABA\nABAB\n"], "source_document_id": "p03466", "source_text": "Score : 1100 points\n\nProblem Statement\n\nLet f(A, B), where A and B are positive integers, be the string satisfying the following conditions:\n\nf(A, B) has length A + B;\n\nf(A, B) contains exactly A letters A and exactly B letters B;\n\nThe length of the longest substring of f(A, B) consisting of equal letters (ex., AAAAA or BBBB) is as small as possible under the conditions above;\n\nf(A, B) is the lexicographically smallest string satisfying the conditions above.\n\nFor example, f(2, 3) = BABAB, and f(6, 4) = AABAABAABB.\n\nAnswer Q queries: find the substring of f(A_i, B_i) from position C_i to position D_i (1-based).\n\nConstraints\n\n1 \\leq Q \\leq 10^3\n\n1 \\leq A_i, B_i \\leq 5 \\times 10^8\n\n1 \\leq C_i \\leq D_i \\leq A_i + B_i\n\nD_i - C_i + 1 \\leq 100\n\nAll input values are integers.\n\nPartial Score\n\n500 points will be awarded for passing the testset satisfying 1 \\leq A_i, B_i \\leq 10^3.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_Q B_Q C_Q D_Q\n\nOutput\n\nFor each query i in order of input, print a line containing the substring of f(A_i, B_i) from position C_i to position D_i (1-based).\n\nSample Input 1\n\n5\n2 3 1 5\n6 4 1 10\n2 3 4 4\n6 4 3 7\n8 10 5 8\n\nSample Output 1\n\nBABAB\nAABAABAABB\nA\nBAABA\nABAB", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3687, "cpu_time_ms": 144, "memory_kb": 26292}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s735687104", "group_id": "codeNet:p03469", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tsc.close();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tsb.append(\"2018\");\n\t\tsb.append(S.substring(4));\n\t\tSystem.out.println(sb.toString());\n\t}\n}", "language": "Java", "metadata": {"date": 1566497265, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03469.html", "problem_id": "p03469", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03469/input.txt", "sample_output_relpath": "derived/input_output/data/p03469/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03469/Java/s735687104.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s735687104", "user_id": "u137938820"}, "prompt_components": {"gold_output": "2018/01/07\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString S = sc.next();\n\t\tsc.close();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tsb.append(\"2018\");\n\t\tsb.append(S.substring(4));\n\t\tSystem.out.println(sb.toString());\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in yyyy/mm/dd format. For example, January 23, 2018 should be written as 2018/01/23.\n\nAfter finishing the document, she noticed that she had mistakenly wrote 2017 at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to 2018 and prints it.\n\nConstraints\n\nS is a string of length 10.\n\nThe first eight characters in S are 2017/01/.\n\nThe last two characters in S are digits and represent an integer between 1 and 31 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace the first four characters in S with 2018 and print it.\n\nSample Input 1\n\n2017/01/07\n\nSample Output 1\n\n2018/01/07\n\nSample Input 2\n\n2017/01/31\n\nSample Output 2\n\n2018/01/31", "sample_input": "2017/01/07\n"}, "reference_outputs": ["2018/01/07\n"], "source_document_id": "p03469", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in yyyy/mm/dd format. For example, January 23, 2018 should be written as 2018/01/23.\n\nAfter finishing the document, she noticed that she had mistakenly wrote 2017 at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to 2018 and prints it.\n\nConstraints\n\nS is a string of length 10.\n\nThe first eight characters in S are 2017/01/.\n\nThe last two characters in S are digits and represent an integer between 1 and 31 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace the first four characters in S with 2018 and print it.\n\nSample Input 1\n\n2017/01/07\n\nSample Output 1\n\n2018/01/07\n\nSample Input 2\n\n2017/01/31\n\nSample Output 2\n\n2018/01/31", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 300, "cpu_time_ms": 101, "memory_kb": 25812}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s269129026", "group_id": "codeNet:p03473", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n\n public static void main(String[] args) throws IOException {\n MyReader reader = new MyReader();\n int[] ab = reader.readInts(\" \");\n int a = ab[0];\n int b = ab[1];\n String s = reader.readString();\n System.out.println(problem084b(a, b, s));\n }\n\n private static String problem084b(int a, int b, String s) {\n String regex = \"[0-9]{\" + a + \"}-[0-9]{\" + b + \"}\";\n Pattern pattern = Pattern.compile(regex);\n Matcher matcher = pattern.matcher(s);\n return (matcher.matches()) ? \"Yes\" : \"No\";\n }\n\n private static class MyReader {\n private final BufferedReader br;\n private MyReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n private String readString() throws IOException {\n return br.readLine();\n }\n\n private int readInt() throws IOException {\n return Integer.parseInt(readString());\n }\n\n private String[] readStrings(String regex) throws IOException {\n return readString().split(regex);\n }\n\n private int[] readInts(String regex) throws IOException {\n String[] strings = readStrings(regex);\n int[] ints = new int[strings.length];\n for (int i = 0; i < ints.length; i++) {\n ints[i] = Integer.parseInt(strings[i]);\n }\n return ints;\n }\n }\n}", "language": "Java", "metadata": {"date": 1600797292, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03473.html", "problem_id": "p03473", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03473/input.txt", "sample_output_relpath": "derived/input_output/data/p03473/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03473/Java/s269129026.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s269129026", "user_id": "u252791538"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class Main {\n\n public static void main(String[] args) throws IOException {\n MyReader reader = new MyReader();\n int[] ab = reader.readInts(\" \");\n int a = ab[0];\n int b = ab[1];\n String s = reader.readString();\n System.out.println(problem084b(a, b, s));\n }\n\n private static String problem084b(int a, int b, String s) {\n String regex = \"[0-9]{\" + a + \"}-[0-9]{\" + b + \"}\";\n Pattern pattern = Pattern.compile(regex);\n Matcher matcher = pattern.matcher(s);\n return (matcher.matches()) ? \"Yes\" : \"No\";\n }\n\n private static class MyReader {\n private final BufferedReader br;\n private MyReader() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n private String readString() throws IOException {\n return br.readLine();\n }\n\n private int readInt() throws IOException {\n return Integer.parseInt(readString());\n }\n\n private String[] readStrings(String regex) throws IOException {\n return readString().split(regex);\n }\n\n private int[] readInts(String regex) throws IOException {\n String[] strings = readStrings(regex);\n int[] ints = new int[strings.length];\n for (int i = 0; i < ints.length; i++) {\n ints[i] = Integer.parseInt(strings[i]);\n }\n return ints;\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "sample_input": "21\n"}, "reference_outputs": ["27\n"], "source_document_id": "p03473", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1610, "cpu_time_ms": 76, "memory_kb": 25396}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s651788984", "group_id": "codeNet:p03473", "input_text": "import java.util.*;\n\nclass Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int m = sc.nextInt();\n int ans = 48-m;\n System.out.println(ans);\n }\n}", "language": "Java", "metadata": {"date": 1565823380, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03473.html", "problem_id": "p03473", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03473/input.txt", "sample_output_relpath": "derived/input_output/data/p03473/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03473/Java/s651788984.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s651788984", "user_id": "u626353997"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "import java.util.*;\n\nclass Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int m = sc.nextInt();\n int ans = 48-m;\n System.out.println(ans);\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "sample_input": "21\n"}, "reference_outputs": ["27\n"], "source_document_id": "p03473", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 217, "cpu_time_ms": 94, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s576781747", "group_id": "codeNet:p03474", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int A = Integer.parseInt(scanner.next());\n int B = Integer.parseInt(scanner.next());\n String S = scanner.next();\n scanner.close();\n\n if (S.matches(String.format(\"^[0-9]{%d}-[0-9]{%d}\", A, B))) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1574136728, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03474.html", "problem_id": "p03474", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03474/input.txt", "sample_output_relpath": "derived/input_output/data/p03474/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03474/Java/s576781747.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s576781747", "user_id": "u124992755"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int A = Integer.parseInt(scanner.next());\n int B = Integer.parseInt(scanner.next());\n String S = scanner.next();\n scanner.close();\n\n if (S.matches(String.format(\"^[0-9]{%d}-[0-9]{%d}\", A, B))) {\n System.out.println(\"Yes\");\n } else {\n System.out.println(\"No\");\n }\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen -, and the other characters are digits from 0 through 9.\n\nYou are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.\n\nConstraints\n\n1≤A,B≤5\n\n|S|=A+B+1\n\nS consists of - and digits from 0 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\nS\n\nOutput\n\nPrint Yes if S follows the postal code format in AtCoder Kingdom; print No otherwise.\n\nSample Input 1\n\n3 4\n269-6650\n\nSample Output 1\n\nYes\n\nThe (A+1)-th character of S is -, and the other characters are digits from 0 through 9, so it follows the format.\n\nSample Input 2\n\n1 1\n---\n\nSample Output 2\n\nNo\n\nS contains unnecessary -s other than the (A+1)-th character, so it does not follow the format.\n\nSample Input 3\n\n1 2\n7444\n\nSample Output 3\n\nNo", "sample_input": "3 4\n269-6650\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03474", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen -, and the other characters are digits from 0 through 9.\n\nYou are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.\n\nConstraints\n\n1≤A,B≤5\n\n|S|=A+B+1\n\nS consists of - and digits from 0 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\nS\n\nOutput\n\nPrint Yes if S follows the postal code format in AtCoder Kingdom; print No otherwise.\n\nSample Input 1\n\n3 4\n269-6650\n\nSample Output 1\n\nYes\n\nThe (A+1)-th character of S is -, and the other characters are digits from 0 through 9, so it follows the format.\n\nSample Input 2\n\n1 1\n---\n\nSample Output 2\n\nNo\n\nS contains unnecessary -s other than the (A+1)-th character, so it does not follow the format.\n\nSample Input 3\n\n1 2\n7444\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 486, "cpu_time_ms": 96, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s799405635", "group_id": "codeNet:p03474", "input_text": "import java.util.*;\npublic class Main{\npublic static void main(String[] args){\nScanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n String s = sc.next();\n String[] t = s.split(\"-\");\n if(t.length != 2)System.out.println(\"No\");\n else if(t.length == 2 && s.charAt(a) == '-')System.out.println(\"Yes\");\n else System.out.println(\"No\");\n}}\n", "language": "Java", "metadata": {"date": 1521678394, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03474.html", "problem_id": "p03474", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03474/input.txt", "sample_output_relpath": "derived/input_output/data/p03474/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03474/Java/s799405635.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s799405635", "user_id": "u891161439"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\npublic class Main{\npublic static void main(String[] args){\nScanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n String s = sc.next();\n String[] t = s.split(\"-\");\n if(t.length != 2)System.out.println(\"No\");\n else if(t.length == 2 && s.charAt(a) == '-')System.out.println(\"Yes\");\n else System.out.println(\"No\");\n}}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen -, and the other characters are digits from 0 through 9.\n\nYou are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.\n\nConstraints\n\n1≤A,B≤5\n\n|S|=A+B+1\n\nS consists of - and digits from 0 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\nS\n\nOutput\n\nPrint Yes if S follows the postal code format in AtCoder Kingdom; print No otherwise.\n\nSample Input 1\n\n3 4\n269-6650\n\nSample Output 1\n\nYes\n\nThe (A+1)-th character of S is -, and the other characters are digits from 0 through 9, so it follows the format.\n\nSample Input 2\n\n1 1\n---\n\nSample Output 2\n\nNo\n\nS contains unnecessary -s other than the (A+1)-th character, so it does not follow the format.\n\nSample Input 3\n\n1 2\n7444\n\nSample Output 3\n\nNo", "sample_input": "3 4\n269-6650\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03474", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen -, and the other characters are digits from 0 through 9.\n\nYou are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.\n\nConstraints\n\n1≤A,B≤5\n\n|S|=A+B+1\n\nS consists of - and digits from 0 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\nS\n\nOutput\n\nPrint Yes if S follows the postal code format in AtCoder Kingdom; print No otherwise.\n\nSample Input 1\n\n3 4\n269-6650\n\nSample Output 1\n\nYes\n\nThe (A+1)-th character of S is -, and the other characters are digits from 0 through 9, so it follows the format.\n\nSample Input 2\n\n1 1\n---\n\nSample Output 2\n\nNo\n\nS contains unnecessary -s other than the (A+1)-th character, so it does not follow the format.\n\nSample Input 3\n\n1 2\n7444\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 371, "cpu_time_ms": 94, "memory_kb": 23892}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s254578869", "group_id": "codeNet:p03482", "input_text": "import java.util.*;\n\npublic class Main {\n static Scanner scanner = new Scanner(System.in);\n\n public static void main(String[]$) {\n String s = scanner.next();\n int t = Integer.MAX_VALUE;\n for (int i = 1; i < s.length(); i++) {\n if (s.charAt(i - 1) != s.charAt(i)) {\n t = Math.min(t, Math.max(i, s.length() - i));\n }\n }\n System.out.println(t == Integer.MAX_VALUE ? s.length() : t);\n }\n}", "language": "Java", "metadata": {"date": 1562305652, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03482.html", "problem_id": "p03482", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03482/input.txt", "sample_output_relpath": "derived/input_output/data/p03482/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03482/Java/s254578869.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s254578869", "user_id": "u981808900"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n static Scanner scanner = new Scanner(System.in);\n\n public static void main(String[]$) {\n String s = scanner.next();\n int t = Integer.MAX_VALUE;\n for (int i = 1; i < s.length(); i++) {\n if (s.charAt(i - 1) != s.charAt(i)) {\n t = Math.min(t, Math.max(i, s.length() - i));\n }\n }\n System.out.println(t == Integer.MAX_VALUE ? s.length() : t);\n }\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "sample_input": "010\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03482", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 465, "cpu_time_ms": 154, "memory_kb": 23508}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s822207892", "group_id": "codeNet:p03482", "input_text": "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n int n = s.length();\n int left = n/2-(n%2 ^ 1);\n int right = n/2;\n int width = -n%2;\n char mod = s.charAt(left);\n while(left >= 0 & right < n){\n if (s.charAt(right)!=mod | s.charAt(left)!=mod) {\n break;\n } else {\n width+=2;\n }\n left--;\n right++;\n }\n int k = n/2 + width/2 + n%2;\n System.out.println(k);\n }\n}", "language": "Java", "metadata": {"date": 1542072653, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03482.html", "problem_id": "p03482", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03482/input.txt", "sample_output_relpath": "derived/input_output/data/p03482/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03482/Java/s822207892.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s822207892", "user_id": "u390694622"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n String s = sc.next();\n int n = s.length();\n int left = n/2-(n%2 ^ 1);\n int right = n/2;\n int width = -n%2;\n char mod = s.charAt(left);\n while(left >= 0 & right < n){\n if (s.charAt(right)!=mod | s.charAt(left)!=mod) {\n break;\n } else {\n width+=2;\n }\n left--;\n right++;\n }\n int k = n/2 + width/2 + n%2;\n System.out.println(k);\n }\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "sample_input": "010\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03482", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 611, "cpu_time_ms": 145, "memory_kb": 25044}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s460740657", "group_id": "codeNet:p03486", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tString s = sc.next();\n\t\tchar[] s_chars = s.toCharArray();\n\t\tString s_asc = new String(s_chars);\n\n\t\tString t = sc.next();\n\t\tchar[] t_chars = t.toCharArray();\n\t\tString t_asc = new String(t_chars);\n\t\tString t_desc = new StringBuilder(t_asc).reverse().toString();\n\n\t\tif (s_asc.compareTo(t_desc) < 0){\n\t\t\tSystem.out.println(\"Yes\");\n\t\t} else {\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1541387302, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03486.html", "problem_id": "p03486", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03486/input.txt", "sample_output_relpath": "derived/input_output/data/p03486/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03486/Java/s460740657.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s460740657", "user_id": "u820451342"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args){\n\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tString s = sc.next();\n\t\tchar[] s_chars = s.toCharArray();\n\t\tString s_asc = new String(s_chars);\n\n\t\tString t = sc.next();\n\t\tchar[] t_chars = t.toCharArray();\n\t\tString t_asc = new String(t_chars);\n\t\tString t_desc = new StringBuilder(t_asc).reverse().toString();\n\n\t\tif (s_asc.compareTo(t_desc) < 0){\n\t\t\tSystem.out.println(\"Yes\");\n\t\t} else {\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given strings s and t, consisting of lowercase English letters.\nYou will create a string s' by freely rearranging the characters in s.\nYou will also create a string t' by freely rearranging the characters in t.\nDetermine whether it is possible to satisfy s' < t' for the lexicographic order.\n\nNotes\n\nFor a string a = a_1 a_2 ... a_N of length N and a string b = b_1 b_2 ... b_M of length M, we say a < b for the lexicographic order if either one of the following two conditions holds true:\n\nN < M and a_1 = b_1, a_2 = b_2, ..., a_N = b_N.\n\nThere exists i (1 \\leq i \\leq N, M) such that a_1 = b_1, a_2 = b_2, ..., a_{i - 1} = b_{i - 1} and a_i < b_i. Here, letters are compared using alphabetical order.\n\nFor example, xy < xya and atcoder < atlas.\n\nConstraints\n\nThe lengths of s and t are between 1 and 100 (inclusive).\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf it is possible to satisfy s' < t', print Yes; if it is not, print No.\n\nSample Input 1\n\nyx\naxy\n\nSample Output 1\n\nYes\n\nWe can, for example, rearrange yx into xy and axy into yxa. Then, xy < yxa.\n\nSample Input 2\n\nratcode\natlas\n\nSample Output 2\n\nYes\n\nWe can, for example, rearrange ratcode into acdeort and atlas into tslaa. Then, acdeort < tslaa.\n\nSample Input 3\n\ncd\nabc\n\nSample Output 3\n\nNo\n\nNo matter how we rearrange cd and abc, we cannot achieve our objective.\n\nSample Input 4\n\nw\nww\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nzzz\nzzz\n\nSample Output 5\n\nNo", "sample_input": "yx\naxy\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03486", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given strings s and t, consisting of lowercase English letters.\nYou will create a string s' by freely rearranging the characters in s.\nYou will also create a string t' by freely rearranging the characters in t.\nDetermine whether it is possible to satisfy s' < t' for the lexicographic order.\n\nNotes\n\nFor a string a = a_1 a_2 ... a_N of length N and a string b = b_1 b_2 ... b_M of length M, we say a < b for the lexicographic order if either one of the following two conditions holds true:\n\nN < M and a_1 = b_1, a_2 = b_2, ..., a_N = b_N.\n\nThere exists i (1 \\leq i \\leq N, M) such that a_1 = b_1, a_2 = b_2, ..., a_{i - 1} = b_{i - 1} and a_i < b_i. Here, letters are compared using alphabetical order.\n\nFor example, xy < xya and atcoder < atlas.\n\nConstraints\n\nThe lengths of s and t are between 1 and 100 (inclusive).\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf it is possible to satisfy s' < t', print Yes; if it is not, print No.\n\nSample Input 1\n\nyx\naxy\n\nSample Output 1\n\nYes\n\nWe can, for example, rearrange yx into xy and axy into yxa. Then, xy < yxa.\n\nSample Input 2\n\nratcode\natlas\n\nSample Output 2\n\nYes\n\nWe can, for example, rearrange ratcode into acdeort and atlas into tslaa. Then, acdeort < tslaa.\n\nSample Input 3\n\ncd\nabc\n\nSample Output 3\n\nNo\n\nNo matter how we rearrange cd and abc, we cannot achieve our objective.\n\nSample Input 4\n\nw\nww\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nzzz\nzzz\n\nSample Output 5\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 508, "cpu_time_ms": 99, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s103064366", "group_id": "codeNet:p03494", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\t\twhile(true) {\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tif(a[i] % 2 == 0) {\n\t\t\t\t\ta[i] = a[i]/2;\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.println(count);\n\t\t\t\t\tsc.close();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t}\n\t}\n\n\tvoid debug(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}", "language": "Java", "metadata": {"date": 1518902731, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03494.html", "problem_id": "p03494", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03494/input.txt", "sample_output_relpath": "derived/input_output/data/p03494/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03494/Java/s103064366.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s103064366", "user_id": "u307037394"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] a = new int[n];\n\t\tint count = 0;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.nextInt();\n\t\t}\n\t\twhile(true) {\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tif(a[i] % 2 == 0) {\n\t\t\t\t\ta[i] = a[i]/2;\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.println(count);\n\t\t\t\t\tsc.close();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcount++;\n\t\t}\n\t}\n\n\tvoid debug(Object... o) {\n\t\tSystem.out.println(Arrays.deepToString(o));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N positive integers written on a blackboard: A_1, ..., A_N.\n\nSnuke can perform the following operation when all integers on the blackboard are even:\n\nReplace each integer X on the blackboard by X divided by 2.\n\nFind the maximum possible number of operations that Snuke can perform.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n8 12 40\n\nSample Output 1\n\n2\n\nInitially, [8, 12, 40] are written on the blackboard.\nSince all those integers are even, Snuke can perform the operation.\n\nAfter the operation is performed once, [4, 6, 20] are written on the blackboard.\nSince all those integers are again even, he can perform the operation.\n\nAfter the operation is performed twice, [2, 3, 10] are written on the blackboard.\nNow, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.\n\nThus, Snuke can perform the operation at most twice.\n\nSample Input 2\n\n4\n5 6 8 10\n\nSample Output 2\n\n0\n\nSince there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.\n\nSample Input 3\n\n6\n382253568 723152896 37802240 379425024 404894720 471526144\n\nSample Output 3\n\n8", "sample_input": "3\n8 12 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03494", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N positive integers written on a blackboard: A_1, ..., A_N.\n\nSnuke can perform the following operation when all integers on the blackboard are even:\n\nReplace each integer X on the blackboard by X divided by 2.\n\nFind the maximum possible number of operations that Snuke can perform.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n8 12 40\n\nSample Output 1\n\n2\n\nInitially, [8, 12, 40] are written on the blackboard.\nSince all those integers are even, Snuke can perform the operation.\n\nAfter the operation is performed once, [4, 6, 20] are written on the blackboard.\nSince all those integers are again even, he can perform the operation.\n\nAfter the operation is performed twice, [2, 3, 10] are written on the blackboard.\nNow, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.\n\nThus, Snuke can perform the operation at most twice.\n\nSample Input 2\n\n4\n5 6 8 10\n\nSample Output 2\n\n0\n\nSince there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.\n\nSample Input 3\n\n6\n382253568 723152896 37802240 379425024 404894720 471526144\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 589, "cpu_time_ms": 115, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s858722284", "group_id": "codeNet:p03502", "input_text": "import java.util.*;\n \npublic class Main{\n public static void main(String[] args){\n \n Scanner sc = new Scanner(System.in);\n \n String N = sc.next();\n int sum = 0;\n \n for(int i = 0; i < N.length(); i++){\n int a =Integer.parseInt(N.substring(i, i+1)); \n sum += a;\n }\n \n int total = Integer.parseInt(N);\n String output = null;\n \n output = (total % sum == 0) ? \"Yes\":\"No\";\n System.out.println(output);\n }\n}", "language": "Java", "metadata": {"date": 1543809775, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03502.html", "problem_id": "p03502", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03502/input.txt", "sample_output_relpath": "derived/input_output/data/p03502/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03502/Java/s858722284.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s858722284", "user_id": "u587842109"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n \npublic class Main{\n public static void main(String[] args){\n \n Scanner sc = new Scanner(System.in);\n \n String N = sc.next();\n int sum = 0;\n \n for(int i = 0; i < N.length(); i++){\n int a =Integer.parseInt(N.substring(i, i+1)); \n sum += a;\n }\n \n int total = Integer.parseInt(N);\n String output = null;\n \n output = (total % sum == 0) ? \"Yes\":\"No\";\n System.out.println(output);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03502", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 451, "cpu_time_ms": 90, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s974237010", "group_id": "codeNet:p03503", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n static int n;\n static boolean[][] f;\n static int[][] p;\n\n static long dfs(boolean[] b, int cn, long max, boolean tf) {\n b[cn] = tf;\n long cMax = max;\n if (cn + 1 < b.length) {\n cMax = dfs(b, cn + 1, cMax, true);\n }\n if (cn + 1 < b.length) {\n cMax = dfs(b, cn + 1, cMax, false);\n }\n\n boolean opened = false;\n for (int i = 0; i < b.length; i++) {\n if (b[i]) {\n opened = true;\n break;\n }\n }\n if (!opened) return max;\n\n if (cn == b.length - 1) {\n int cProfit = 0;\n for (int i = 0; i < n; i++) {\n int iCount = 0;\n for (int j = 0; j < 10; j++) {\n if (b[j] && f[i][j]) iCount++;\n }\n cProfit += p[i][iCount];\n }\n if (cProfit > cMax) cMax = cProfit;\n }\n return cMax;\n }\n\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n n = in.nextInt();\n f = new boolean[n][10];\n p = new int[n][11];\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < 10; j++) {\n int c = in.nextInt();\n f[i][j] = (c == 1);\n }\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < 11; j++) {\n int c = in.nextInt();\n p[i][j] = c;\n }\n }\n\n boolean[] open = new boolean[10];\n long max = Long.MIN_VALUE;\n max = dfs(open, 0, max, false);\n max = dfs(open, 0, max, true);\n\n out.println(max);\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1517867322, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03503.html", "problem_id": "p03503", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03503/input.txt", "sample_output_relpath": "derived/input_output/data/p03503/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03503/Java/s974237010.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s974237010", "user_id": "u510349606"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Scanner;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskC solver = new TaskC();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskC {\n static int n;\n static boolean[][] f;\n static int[][] p;\n\n static long dfs(boolean[] b, int cn, long max, boolean tf) {\n b[cn] = tf;\n long cMax = max;\n if (cn + 1 < b.length) {\n cMax = dfs(b, cn + 1, cMax, true);\n }\n if (cn + 1 < b.length) {\n cMax = dfs(b, cn + 1, cMax, false);\n }\n\n boolean opened = false;\n for (int i = 0; i < b.length; i++) {\n if (b[i]) {\n opened = true;\n break;\n }\n }\n if (!opened) return max;\n\n if (cn == b.length - 1) {\n int cProfit = 0;\n for (int i = 0; i < n; i++) {\n int iCount = 0;\n for (int j = 0; j < 10; j++) {\n if (b[j] && f[i][j]) iCount++;\n }\n cProfit += p[i][iCount];\n }\n if (cProfit > cMax) cMax = cProfit;\n }\n return cMax;\n }\n\n public void solve(int testNumber, Scanner in, PrintWriter out) {\n n = in.nextInt();\n f = new boolean[n][10];\n p = new int[n][11];\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < 10; j++) {\n int c = in.nextInt();\n f[i][j] = (c == 1);\n }\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < 11; j++) {\n int c = in.nextInt();\n p[i][j] = c;\n }\n }\n\n boolean[] open = new boolean[10];\n long max = Long.MIN_VALUE;\n max = dfs(open, 0, max, false);\n max = dfs(open, 0, max, true);\n\n out.println(max);\n }\n\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nJoisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided into two periods, the morning and the evening. For each of those ten periods, a shop must be either open during the whole period, or closed during the whole period. Naturally, a shop must be open during at least one of those periods.\n\nThere are already N stores in the street, numbered 1 through N.\n\nYou are given information of the business hours of those shops, F_{i,j,k}. If F_{i,j,k}=1, Shop i is open during Period k on Day j (this notation is explained below); if F_{i,j,k}=0, Shop i is closed during that period. Here, the days of the week are denoted as follows. Monday: Day 1, Tuesday: Day 2, Wednesday: Day 3, Thursday: Day 4, Friday: Day 5. Also, the morning is denoted as Period 1, and the afternoon is denoted as Period 2.\n\nLet c_i be the number of periods during which both Shop i and Joisino's shop are open. Then, the profit of Joisino's shop will be P_{1,c_1}+P_{2,c_2}+...+P_{N,c_N}.\n\nFind the maximum possible profit of Joisino's shop when she decides whether her shop is open during each period, making sure that it is open during at least one period.\n\nConstraints\n\n1≤N≤100\n\n0≤F_{i,j,k}≤1\n\nFor every integer i such that 1≤i≤N, there exists at least one pair (j,k) such that F_{i,j,k}=1.\n\n-10^7≤P_{i,j}≤10^7\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nF_{1,1,1} F_{1,1,2} ... F_{1,5,1} F_{1,5,2}\n:\nF_{N,1,1} F_{N,1,2} ... F_{N,5,1} F_{N,5,2}\nP_{1,0} ... P_{1,10}\n:\nP_{N,0} ... P_{N,10}\n\nOutput\n\nPrint the maximum possible profit of Joisino's shop.\n\nSample Input 1\n\n1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2\n\nSample Output 1\n\n8\n\nIf her shop is open only during the periods when Shop 1 is opened, the profit will be 8, which is the maximum possible profit.\n\nSample Input 2\n\n2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n\nSample Output 2\n\n-2\n\nNote that a shop must be open during at least one period, and the profit may be negative.\n\nSample Input 3\n\n3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 0 1 0\n1 0 1 1 0 1 0 1 0 1\n-8 6 -2 -8 -8 4 8 7 -6 2 2\n-9 2 0 1 7 -5 0 -2 -6 5 5\n6 -6 7 -9 6 -5 8 0 -9 -7 -7\n\nSample Output 3\n\n23", "sample_input": "1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03503", "source_text": "Score : 300 points\n\nProblem Statement\n\nJoisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided into two periods, the morning and the evening. For each of those ten periods, a shop must be either open during the whole period, or closed during the whole period. Naturally, a shop must be open during at least one of those periods.\n\nThere are already N stores in the street, numbered 1 through N.\n\nYou are given information of the business hours of those shops, F_{i,j,k}. If F_{i,j,k}=1, Shop i is open during Period k on Day j (this notation is explained below); if F_{i,j,k}=0, Shop i is closed during that period. Here, the days of the week are denoted as follows. Monday: Day 1, Tuesday: Day 2, Wednesday: Day 3, Thursday: Day 4, Friday: Day 5. Also, the morning is denoted as Period 1, and the afternoon is denoted as Period 2.\n\nLet c_i be the number of periods during which both Shop i and Joisino's shop are open. Then, the profit of Joisino's shop will be P_{1,c_1}+P_{2,c_2}+...+P_{N,c_N}.\n\nFind the maximum possible profit of Joisino's shop when she decides whether her shop is open during each period, making sure that it is open during at least one period.\n\nConstraints\n\n1≤N≤100\n\n0≤F_{i,j,k}≤1\n\nFor every integer i such that 1≤i≤N, there exists at least one pair (j,k) such that F_{i,j,k}=1.\n\n-10^7≤P_{i,j}≤10^7\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nF_{1,1,1} F_{1,1,2} ... F_{1,5,1} F_{1,5,2}\n:\nF_{N,1,1} F_{N,1,2} ... F_{N,5,1} F_{N,5,2}\nP_{1,0} ... P_{1,10}\n:\nP_{N,0} ... P_{N,10}\n\nOutput\n\nPrint the maximum possible profit of Joisino's shop.\n\nSample Input 1\n\n1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2\n\nSample Output 1\n\n8\n\nIf her shop is open only during the periods when Shop 1 is opened, the profit will be 8, which is the maximum possible profit.\n\nSample Input 2\n\n2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n\nSample Output 2\n\n-2\n\nNote that a shop must be open during at least one period, and the profit may be negative.\n\nSample Input 3\n\n3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 0 1 0\n1 0 1 1 0 1 0 1 0 1\n-8 6 -2 -8 -8 4 8 7 -6 2 2\n-9 2 0 1 7 -5 0 -2 -6 5 5\n6 -6 7 -9 6 -5 8 0 -9 -7 -7\n\nSample Output 3\n\n23", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2490, "cpu_time_ms": 175, "memory_kb": 26200}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s475535290", "group_id": "codeNet:p03523", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.util.AbstractMap;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Comparator.*;\t\t\t\t\n\npublic class Main {\n\t\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n \n Solver solver = new Solver();\n solver.solve(1, in, out);\n \n out.close();\n }\n \n // ======================================================================\n\n static class PPP {\n \tpublic int key, val;\n \tpublic PPP(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(int key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(int val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n\tstatic class Solver {\n\t\tpublic void solve(int testNumber, MyInput in, PrintWriter out) {\n\t\t\tString[] D = \n\t\t\t\t{\"AKIHABARA\",\"AKIHBR\",\"AKIHABR\",\"AKIHABAR\",\"AKIHABRA\",\"AKIHBAR\",\"AKIHBARA\",\"AKIHBRA\",\n\t\t\t\t\t\"KIHABARA\",\"KIHBR\",\"KIHABR\",\"KIHABAR\",\"KIHABRA\",\"KIHBAR\",\"KIHBARA\",\"KIHBRA\" };\n\n\t\t\tString S = in.nextString();\n\t\t\tboolean ans = false;\n \t\tfor(int i=1; i < D.length; i++) {\n \t\t\tif(S.equals(D[i])) {\n \t\t\t\tans = true;\n \t\t\t\tbreak;\n \t\t\t}\n \t\t}\n \t\tif(ans)\t\tout.println(\"YES\");\n \t\telse\t\tout.println(\"NO\");\n }\n }\n\n // ======================================================================\n static class Pair extends AbstractMap.SimpleEntry {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n } \n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n \n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n \n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n \n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n \n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n \n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n \n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n \n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n \n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n \n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n \n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1559026287, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03523.html", "problem_id": "p03523", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03523/input.txt", "sample_output_relpath": "derived/input_output/data/p03523/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03523/Java/s475535290.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s475535290", "user_id": "u181039779"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.util.AbstractMap;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Comparator.*;\t\t\t\t\n\npublic class Main {\n\t\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n \n Solver solver = new Solver();\n solver.solve(1, in, out);\n \n out.close();\n }\n \n // ======================================================================\n\n static class PPP {\n \tpublic int key, val;\n \tpublic PPP(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(int key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(int val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n\tstatic class Solver {\n\t\tpublic void solve(int testNumber, MyInput in, PrintWriter out) {\n\t\t\tString[] D = \n\t\t\t\t{\"AKIHABARA\",\"AKIHBR\",\"AKIHABR\",\"AKIHABAR\",\"AKIHABRA\",\"AKIHBAR\",\"AKIHBARA\",\"AKIHBRA\",\n\t\t\t\t\t\"KIHABARA\",\"KIHBR\",\"KIHABR\",\"KIHABAR\",\"KIHABRA\",\"KIHBAR\",\"KIHBARA\",\"KIHBRA\" };\n\n\t\t\tString S = in.nextString();\n\t\t\tboolean ans = false;\n \t\tfor(int i=1; i < D.length; i++) {\n \t\t\tif(S.equals(D[i])) {\n \t\t\t\tans = true;\n \t\t\t\tbreak;\n \t\t\t}\n \t\t}\n \t\tif(ans)\t\tout.println(\"YES\");\n \t\telse\t\tout.println(\"NO\");\n }\n }\n\n // ======================================================================\n static class Pair extends AbstractMap.SimpleEntry {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n } \n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n \n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n \n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n \n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n \n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n \n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n \n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n \n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n \n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n \n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n \n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "sample_input": "KIHBR\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03523", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5872, "cpu_time_ms": 72, "memory_kb": 22740}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s304021017", "group_id": "codeNet:p03544", "input_text": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt(); \n long[] L = new long[N + 1];\n\n L[0] = 2;\n L[1] = 1;\n \n for(int i = 2; i <= N; i++){\n L[i] = L[i - 1] + L[i - 2];\n }\n System.out.println(L[N]);\n } \n}\n", "language": "Java", "metadata": {"date": 1551407293, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03544.html", "problem_id": "p03544", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03544/input.txt", "sample_output_relpath": "derived/input_output/data/p03544/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03544/Java/s304021017.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s304021017", "user_id": "u356726575"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt(); \n long[] L = new long[N + 1];\n\n L[0] = 2;\n L[1] = 1;\n \n for(int i = 2; i <= N; i++){\n L[i] = L[i - 1] + L[i - 2];\n }\n System.out.println(L[N]);\n } \n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "sample_input": "5\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03544", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 397, "cpu_time_ms": 96, "memory_kb": 21712}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s307298915", "group_id": "codeNet:p03545", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().solve();\n\t\tpw.close();\n\t}\n\n\t/**\n\t * ASCII\n\t * 0 48\n\t * A 65\n\t * a 97\n\t */\n\n\tstatic PrintWriter pw = new PrintWriter(System.out);\n\n\tlong MOD = 1_000_000_007;\n\n\tvoid solve() {\n\t\tFastScanner sc = new FastScanner();\n\t\tString s = sc.next();\n\t\tfor (int i = 0; i < 1 << 3; i++) {\n\t\t\tint sum = s.charAt(0) - '0';\n\t\t\tStringBuilder sb = new StringBuilder(s);\n\t\t\tfor (int j = 0; j < 3; j++) {\n\t\t\t\tif ((i >> j & 1) == 1) {\n\t\t\t\t\tsum += s.charAt(j+1) - '0';\n\t\t\t\t\tsb.insert(j*2+1, \"+\");\n\t\t\t\t} else {\n\t\t\t\t\tsum -= s.charAt(j+1) - '0';\n\t\t\t\t\tsb.insert(j*2+1, \"-\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (sum == 7) {\n\t\t\t\tsb.append(\"=7\");\n\t\t\t\trout(sb.toString());\n\t\t\t}\n\t\t}\n\t}\n\n\tclass Data {\n\t\tint a;\n\t\tint b;\n\t\tData(int a, int b) {\n\t\t\tthis.a = a;\n\t\t\tthis.b = b;\n\t\t}\n\t}\n\n\tclass UnionFind {\n\t\tint[] parents;\n\t\tint[] counts;\n\n\t\tpublic UnionFind(int size) {\n\t\t\tparents = new int[size];\n\t\t\tcounts = new int[size];\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tparents[i] = i;\n\t\t\t\tcounts[i] = 1;\n\t\t\t}\n\t\t}\n\n\t\tpublic int find(int a) {\n\t\t\tif (parents[a] == a) return a;\n\t\t\tparents[a] = find(parents[a]);\n\t\t\treturn parents[a];\n\t\t}\n\n\t\tpublic void unite(int a, int b) {\n\t\t\ta = find(a);\n\t\t\tb = find(b);\n\t\t\tif (a == b) return;\n\t\t\tif (counts[a] < counts[b]) {\n\t\t\t\tparents[a] = b;\n\t\t\t\tcounts[b] += counts[a];\n\t\t\t} else {\n\t\t\t\tparents[b] = a;\n\t\t\t\tcounts[a] += counts[b];\n\t\t\t}\n\t\t}\n\n\t\tpublic boolean differ(int a, int b) {\n\t\t\ta = find(a);\n\t\t\tb = find(b);\n\t\t\treturn a != b;\n\t\t}\n\n\t\tpublic int count(int a) {\n\t\t\treturn counts[find(a)];\n\t\t}\n\t}\n\n\tclass Combination {\n\t\tfinal int mod;\n\t\tfinal int max;\n\n\t\tfinal long[] fact;\n\t\tfinal long[] inv;\n\t\tfinal long[] invfact;\n\n\t\tpublic Combination(int n) {\n\t\t\tthis(n, 1_000_000_007);\n\t\t}\n\n\t\tpublic Combination(int n, int mod) {\n\t\t\tthis.mod = mod;\n\t\t\tmax = n + 1;\n\t\t\tfact = new long[max];\n\t\t\tinvfact = new long[max];\n\t\t\tinv = new long[max];\n\n\t\t\tinv[1] = 1;\n\t\t\tfor (int i = 2; i < inv.length; i++) {\n\t\t\t\tinv[i] = inv[mod % i] * (mod - mod / i) % mod;\n\t\t\t}\n\n\t\t\tfact[0] = 1;\n\t\t\tinvfact[0] = 1;\n\t\t\tfor (int i = 1; i < inv.length; i++) {\n\t\t\t\tfact[i] = i * fact[i - 1] % mod;\n\t\t\t\tinvfact[i] = inv[i] * invfact[i - 1] % mod;\n\t\t\t}\n\t\t}\n\n\t\tpublic long get(int n, int r) {\n\t\t\treturn fact[n] * invfact[n - r] % mod * invfact[r] % mod;\n\t\t}\n\t}\n\n\tpublic long gcd(long a, long b) {\n\t\tif (b == 0) return a;\n\t\telse return gcd(b, a%b);\n\t}\n\n\tpublic void reverse(int[] a) {\n\t\tint last = a.length-1;\n\t\tint n = a.length / 2;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint t = a[i];\n\t\t\ta[i] = a[last-i];\n\t\t\ta[last-i] = t;\n\t\t}\n\t}\n\n\tpublic void reverse(long[] a) {\n\t\tint last = a.length-1;\n\t\tint n = a.length / 2;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlong t = a[i];\n\t\t\ta[i] = a[last-i];\n\t\t\ta[last-i] = t;\n\t\t}\n\t}\n\n\tvoid out(String a) {\n\t\tpw.println(a);\n\t}\n\tvoid out(boolean a) {\n\t\tpw.println(a);\n\t}\n\n\tvoid out(int a) {\n\t\tpw.println(a);\n\t}\n\n\tvoid out(long a) {\n\t\tpw.println(a);\n\t}\n\n\tvoid out(double a) {\n\t\tpw.println(a);\n\t}\n\n\tvoid out(char a) {\n\t\tpw.println(a);\n\t}\n\n\tvoid rout(String a) {\n\t\tout(a);\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n\tvoid rout(int a) {\n\t\tout(a);\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n\tvoid rout(long a) {\n\t\tout(a);\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n\tvoid rout(double a) {\n\t\tout(a);\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n\tvoid rout(char a) {\n\t\tout(a);\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n}\n\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "language": "Java", "metadata": {"date": 1578156009, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03545.html", "problem_id": "p03545", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03545/input.txt", "sample_output_relpath": "derived/input_output/data/p03545/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03545/Java/s307298915.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s307298915", "user_id": "u893188242"}, "prompt_components": {"gold_output": "1+2+2+2=7\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().solve();\n\t\tpw.close();\n\t}\n\n\t/**\n\t * ASCII\n\t * 0 48\n\t * A 65\n\t * a 97\n\t */\n\n\tstatic PrintWriter pw = new PrintWriter(System.out);\n\n\tlong MOD = 1_000_000_007;\n\n\tvoid solve() {\n\t\tFastScanner sc = new FastScanner();\n\t\tString s = sc.next();\n\t\tfor (int i = 0; i < 1 << 3; i++) {\n\t\t\tint sum = s.charAt(0) - '0';\n\t\t\tStringBuilder sb = new StringBuilder(s);\n\t\t\tfor (int j = 0; j < 3; j++) {\n\t\t\t\tif ((i >> j & 1) == 1) {\n\t\t\t\t\tsum += s.charAt(j+1) - '0';\n\t\t\t\t\tsb.insert(j*2+1, \"+\");\n\t\t\t\t} else {\n\t\t\t\t\tsum -= s.charAt(j+1) - '0';\n\t\t\t\t\tsb.insert(j*2+1, \"-\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (sum == 7) {\n\t\t\t\tsb.append(\"=7\");\n\t\t\t\trout(sb.toString());\n\t\t\t}\n\t\t}\n\t}\n\n\tclass Data {\n\t\tint a;\n\t\tint b;\n\t\tData(int a, int b) {\n\t\t\tthis.a = a;\n\t\t\tthis.b = b;\n\t\t}\n\t}\n\n\tclass UnionFind {\n\t\tint[] parents;\n\t\tint[] counts;\n\n\t\tpublic UnionFind(int size) {\n\t\t\tparents = new int[size];\n\t\t\tcounts = new int[size];\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tparents[i] = i;\n\t\t\t\tcounts[i] = 1;\n\t\t\t}\n\t\t}\n\n\t\tpublic int find(int a) {\n\t\t\tif (parents[a] == a) return a;\n\t\t\tparents[a] = find(parents[a]);\n\t\t\treturn parents[a];\n\t\t}\n\n\t\tpublic void unite(int a, int b) {\n\t\t\ta = find(a);\n\t\t\tb = find(b);\n\t\t\tif (a == b) return;\n\t\t\tif (counts[a] < counts[b]) {\n\t\t\t\tparents[a] = b;\n\t\t\t\tcounts[b] += counts[a];\n\t\t\t} else {\n\t\t\t\tparents[b] = a;\n\t\t\t\tcounts[a] += counts[b];\n\t\t\t}\n\t\t}\n\n\t\tpublic boolean differ(int a, int b) {\n\t\t\ta = find(a);\n\t\t\tb = find(b);\n\t\t\treturn a != b;\n\t\t}\n\n\t\tpublic int count(int a) {\n\t\t\treturn counts[find(a)];\n\t\t}\n\t}\n\n\tclass Combination {\n\t\tfinal int mod;\n\t\tfinal int max;\n\n\t\tfinal long[] fact;\n\t\tfinal long[] inv;\n\t\tfinal long[] invfact;\n\n\t\tpublic Combination(int n) {\n\t\t\tthis(n, 1_000_000_007);\n\t\t}\n\n\t\tpublic Combination(int n, int mod) {\n\t\t\tthis.mod = mod;\n\t\t\tmax = n + 1;\n\t\t\tfact = new long[max];\n\t\t\tinvfact = new long[max];\n\t\t\tinv = new long[max];\n\n\t\t\tinv[1] = 1;\n\t\t\tfor (int i = 2; i < inv.length; i++) {\n\t\t\t\tinv[i] = inv[mod % i] * (mod - mod / i) % mod;\n\t\t\t}\n\n\t\t\tfact[0] = 1;\n\t\t\tinvfact[0] = 1;\n\t\t\tfor (int i = 1; i < inv.length; i++) {\n\t\t\t\tfact[i] = i * fact[i - 1] % mod;\n\t\t\t\tinvfact[i] = inv[i] * invfact[i - 1] % mod;\n\t\t\t}\n\t\t}\n\n\t\tpublic long get(int n, int r) {\n\t\t\treturn fact[n] * invfact[n - r] % mod * invfact[r] % mod;\n\t\t}\n\t}\n\n\tpublic long gcd(long a, long b) {\n\t\tif (b == 0) return a;\n\t\telse return gcd(b, a%b);\n\t}\n\n\tpublic void reverse(int[] a) {\n\t\tint last = a.length-1;\n\t\tint n = a.length / 2;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint t = a[i];\n\t\t\ta[i] = a[last-i];\n\t\t\ta[last-i] = t;\n\t\t}\n\t}\n\n\tpublic void reverse(long[] a) {\n\t\tint last = a.length-1;\n\t\tint n = a.length / 2;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tlong t = a[i];\n\t\t\ta[i] = a[last-i];\n\t\t\ta[last-i] = t;\n\t\t}\n\t}\n\n\tvoid out(String a) {\n\t\tpw.println(a);\n\t}\n\tvoid out(boolean a) {\n\t\tpw.println(a);\n\t}\n\n\tvoid out(int a) {\n\t\tpw.println(a);\n\t}\n\n\tvoid out(long a) {\n\t\tpw.println(a);\n\t}\n\n\tvoid out(double a) {\n\t\tpw.println(a);\n\t}\n\n\tvoid out(char a) {\n\t\tpw.println(a);\n\t}\n\n\tvoid rout(String a) {\n\t\tout(a);\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n\tvoid rout(int a) {\n\t\tout(a);\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n\tvoid rout(long a) {\n\t\tout(a);\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n\tvoid rout(double a) {\n\t\tout(a);\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n\tvoid rout(char a) {\n\t\tout(a);\n\t\tpw.close();\n\t\tSystem.exit(0);\n\t}\n}\n\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte())\n return buffer[ptr++];\n else\n return -1;\n }\n\n private boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr]))\n ptr++;\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext())\n throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext())\n throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSitting in a station waiting room, Joisino is gazing at her train ticket.\n\nThe ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).\n\nIn the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with + or - so that the formula holds.\n\nThe given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.\n\nConstraints\n\n0≤A,B,C,D≤9\n\nAll input values are integers.\n\nIt is guaranteed that there is a solution.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nABCD\n\nOutput\n\nPrint the formula you made, including the part =7.\n\nUse the signs + and -.\n\nDo not print a space between a digit and a sign.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n1+2+2+2=7\n\nThis is the only valid solution.\n\nSample Input 2\n\n0290\n\nSample Output 2\n\n0-2+9+0=7\n\n0 - 2 + 9 - 0 = 7 is also a valid solution.\n\nSample Input 3\n\n3242\n\nSample Output 3\n\n3+2+4-2=7", "sample_input": "1222\n"}, "reference_outputs": ["1+2+2+2=7\n"], "source_document_id": "p03545", "source_text": "Score : 300 points\n\nProblem Statement\n\nSitting in a station waiting room, Joisino is gazing at her train ticket.\n\nThe ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).\n\nIn the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with + or - so that the formula holds.\n\nThe given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.\n\nConstraints\n\n0≤A,B,C,D≤9\n\nAll input values are integers.\n\nIt is guaranteed that there is a solution.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nABCD\n\nOutput\n\nPrint the formula you made, including the part =7.\n\nUse the signs + and -.\n\nDo not print a space between a digit and a sign.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n1+2+2+2=7\n\nThis is the only valid solution.\n\nSample Input 2\n\n0290\n\nSample Output 2\n\n0-2+9+0=7\n\n0 - 2 + 9 - 0 = 7 is also a valid solution.\n\nSample Input 3\n\n3242\n\nSample Output 3\n\n3+2+4-2=7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5670, "cpu_time_ms": 70, "memory_kb": 22484}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s711550927", "group_id": "codeNet:p03547", "input_text": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar x = sc.next().charAt(0);\n\t\tchar y = sc.next().charAt(0);\n\t\tif (x < y) {\n\t\t\tSystem.out.println(\"<\");\n\t\t} else if (x == y) {\n\t\t\tSystem.out.println(\"=\");\n\t\t} else {\n\t\t\tSystem.out.println(\">\");\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1546406247, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03547.html", "problem_id": "p03547", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03547/input.txt", "sample_output_relpath": "derived/input_output/data/p03547/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03547/Java/s711550927.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s711550927", "user_id": "u575909439"}, "prompt_components": {"gold_output": "<\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n\tpublic static void main (String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tchar x = sc.next().charAt(0);\n\t\tchar y = sc.next().charAt(0);\n\t\tif (x < y) {\n\t\t\tSystem.out.println(\"<\");\n\t\t} else if (x == y) {\n\t\t\tSystem.out.println(\"=\");\n\t\t} else {\n\t\t\tSystem.out.println(\">\");\n\t\t}\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn programming, hexadecimal notation is often used.\n\nIn hexadecimal notation, besides the ten digits 0, 1, ..., 9, the six letters A, B, C, D, E and F are used to represent the values 10, 11, 12, 13, 14 and 15, respectively.\n\nIn this problem, you are given two letters X and Y. Each X and Y is A, B, C, D, E or F.\n\nWhen X and Y are seen as hexadecimal numbers, which is larger?\n\nConstraints\n\nEach X and Y is A, B, C, D, E or F.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf X is smaller, print <; if Y is smaller, print >; if they are equal, print =.\n\nSample Input 1\n\nA B\n\nSample Output 1\n\n<\n\n10 < 11.\n\nSample Input 2\n\nE C\n\nSample Output 2\n\n>\n\n14 > 12.\n\nSample Input 3\n\nF F\n\nSample Output 3\n\n=\n\n15 = 15.", "sample_input": "A B\n"}, "reference_outputs": ["<\n"], "source_document_id": "p03547", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn programming, hexadecimal notation is often used.\n\nIn hexadecimal notation, besides the ten digits 0, 1, ..., 9, the six letters A, B, C, D, E and F are used to represent the values 10, 11, 12, 13, 14 and 15, respectively.\n\nIn this problem, you are given two letters X and Y. Each X and Y is A, B, C, D, E or F.\n\nWhen X and Y are seen as hexadecimal numbers, which is larger?\n\nConstraints\n\nEach X and Y is A, B, C, D, E or F.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf X is smaller, print <; if Y is smaller, print >; if they are equal, print =.\n\nSample Input 1\n\nA B\n\nSample Output 1\n\n<\n\n10 < 11.\n\nSample Input 2\n\nE C\n\nSample Output 2\n\n>\n\n14 > 12.\n\nSample Input 3\n\nF F\n\nSample Output 3\n\n=\n\n15 = 15.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 330, "cpu_time_ms": 94, "memory_kb": 21972}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s056099037", "group_id": "codeNet:p03557", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n/**\n * for (int i = 0; i < N; i++) {}\n * System.out.println();\n * HashMap hm = new HashMap<>();\n * int[] s = new int[M];\n * ArrayDeque deq = new ArrayDeque<>();\n *\n */\npublic class Main implements Runnable { //クラス名はSnukeFestival\n\n\tpublic static void main(String[] args) {\n\t\tThread.setDefaultUncaughtExceptionHandler((t, e) -> System.exit(1));\n\t\tnew Thread(null, new Main(), \"\", 16 * 1024 * 1024).start(); //16MBスタックを確保して実行\n\t}\n\n\tpublic void run() {\n\t\tFastScannerSnukeFestival sc = new FastScannerSnukeFestival(System.in);\n\n\t\ttry {\n\t\t\t//String S = sc.nextLine().trim();\n\t\t\tint N = sc.nextInt();\n\t\t\tdouble[] a = new double[N];\n\t\t\tdouble[] b = new double[N];\n\t\t\tdouble[] c = new double[N];\n\t\t\t//long l = sc.nextLong();\n\t\t\t//ArrayList arr = new ArrayList();\n\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\ta[i] = sc.nextLong();\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tb[i] = sc.nextLong();\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tc[i] = sc.nextLong();\n\t\t\t}\n\n\t\t\tArrays.sort(a);\n\t\t\tArrays.sort(c);\n\n\t\t\tlong ans = 0;\n\t\t\tlong numa = 0;\n\t\t\tlong numc = 0;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\t/**\n\t\t\t\t * binarySearchメソッドの戻り値は、\n\t\t\t\t * listの中に該当する値があるときはその値の格納場所を返す。indexは0から始まる。\n\t\t\t\t *\n\t\t\t\t * 該当する値がないときは、その値が格納されるであろう場所の符号をマイナスにし、その値にさらに1を引いた値が返される。\n\t\t\t\t * 符号をマイナスにするだけであると先頭に格���されたとき(index=0)は該当する値があるときとないときでは区別できなくなってしまうため、1を引く必要がある。\n\t\t\t\t */\n\t\t\t\t//System.out.println(b[i]);\n\t\t\t\t//System.out.println(Arrays.binarySearch(a, b[i] - 0.1));\n\t\t\t\tnuma = Arrays.binarySearch(a, b[i] - 0.1);\n\t\t\t\t//System.out.println(Arrays.binarySearch(c, b[i] + 0.1));\n\t\t\t\tnumc = Arrays.binarySearch(c, b[i] + 0.1);\n\n\t\t\t\tnuma = 0 - (numa + 1);\n\t\t\t\tnumc = 0 - (numc + 1);\n\n\t\t\t\t//System.out.println(numa + \" \" + numc);\n\n\t\t\t\tif (numa > 0 && numc < N) {\n\t\t\t\t\tans += numa * (N - numc);\n\t\t\t\t}\n\t\t\t\t//System.out.println(\"ans \" + ans);\n\t\t\t}\n\n\t\t\tSystem.out.println(ans);\n\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t}\n}\n\n//高速なScanner\nclass FastScannerSnukeFestival {\n\tprivate BufferedReader reader = null;\n\tprivate StringTokenizer tokenizer = null;\n\n\tpublic FastScannerSnukeFestival(InputStream in) {\n\t\treader = new BufferedReader(new InputStreamReader(in));\n\t\ttokenizer = null;\n\t}\n\n\tpublic String next() {\n\t\tif (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\n\tpublic String nextLine() {\n\t\tif (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn tokenizer.nextToken(\"\\n\");\n\t}\n\n\tpublic long nextLong() {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tpublic int nextInt() {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tpublic int[] nextIntArray(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nextInt();\n\t\treturn a;\n\t}\n\n\tpublic long[] nextLongArray(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nextLong();\n\t\treturn a;\n\t}\n}\n", "language": "Java", "metadata": {"date": 1584143723, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03557.html", "problem_id": "p03557", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03557/input.txt", "sample_output_relpath": "derived/input_output/data/p03557/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03557/Java/s056099037.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s056099037", "user_id": "u173574510"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\n/**\n * for (int i = 0; i < N; i++) {}\n * System.out.println();\n * HashMap hm = new HashMap<>();\n * int[] s = new int[M];\n * ArrayDeque deq = new ArrayDeque<>();\n *\n */\npublic class Main implements Runnable { //クラス名はSnukeFestival\n\n\tpublic static void main(String[] args) {\n\t\tThread.setDefaultUncaughtExceptionHandler((t, e) -> System.exit(1));\n\t\tnew Thread(null, new Main(), \"\", 16 * 1024 * 1024).start(); //16MBスタックを確保して実行\n\t}\n\n\tpublic void run() {\n\t\tFastScannerSnukeFestival sc = new FastScannerSnukeFestival(System.in);\n\n\t\ttry {\n\t\t\t//String S = sc.nextLine().trim();\n\t\t\tint N = sc.nextInt();\n\t\t\tdouble[] a = new double[N];\n\t\t\tdouble[] b = new double[N];\n\t\t\tdouble[] c = new double[N];\n\t\t\t//long l = sc.nextLong();\n\t\t\t//ArrayList arr = new ArrayList();\n\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\ta[i] = sc.nextLong();\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tb[i] = sc.nextLong();\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tc[i] = sc.nextLong();\n\t\t\t}\n\n\t\t\tArrays.sort(a);\n\t\t\tArrays.sort(c);\n\n\t\t\tlong ans = 0;\n\t\t\tlong numa = 0;\n\t\t\tlong numc = 0;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\t/**\n\t\t\t\t * binarySearchメソッドの戻り値は、\n\t\t\t\t * listの中に該当する値があるときはその値の格納場所を返す。indexは0から始まる。\n\t\t\t\t *\n\t\t\t\t * 該当する値がないときは、その値が格納されるであろう場所の符号をマイナスにし、その値にさらに1を引いた値が返される。\n\t\t\t\t * 符号をマイナスにするだけであると先頭に格納されたとき(index=0)は該当する値があるときとないときでは区別できなくなってしまうため、1を引く必要がある。\n\t\t\t\t */\n\t\t\t\t//System.out.println(b[i]);\n\t\t\t\t//System.out.println(Arrays.binarySearch(a, b[i] - 0.1));\n\t\t\t\tnuma = Arrays.binarySearch(a, b[i] - 0.1);\n\t\t\t\t//System.out.println(Arrays.binarySearch(c, b[i] + 0.1));\n\t\t\t\tnumc = Arrays.binarySearch(c, b[i] + 0.1);\n\n\t\t\t\tnuma = 0 - (numa + 1);\n\t\t\t\tnumc = 0 - (numc + 1);\n\n\t\t\t\t//System.out.println(numa + \" \" + numc);\n\n\t\t\t\tif (numa > 0 && numc < N) {\n\t\t\t\t\tans += numa * (N - numc);\n\t\t\t\t}\n\t\t\t\t//System.out.println(\"ans \" + ans);\n\t\t\t}\n\n\t\t\tSystem.out.println(ans);\n\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t}\n}\n\n//高速なScanner\nclass FastScannerSnukeFestival {\n\tprivate BufferedReader reader = null;\n\tprivate StringTokenizer tokenizer = null;\n\n\tpublic FastScannerSnukeFestival(InputStream in) {\n\t\treader = new BufferedReader(new InputStreamReader(in));\n\t\ttokenizer = null;\n\t}\n\n\tpublic String next() {\n\t\tif (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn tokenizer.nextToken();\n\t}\n\n\tpublic String nextLine() {\n\t\tif (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\treturn tokenizer.nextToken(\"\\n\");\n\t}\n\n\tpublic long nextLong() {\n\t\treturn Long.parseLong(next());\n\t}\n\n\tpublic int nextInt() {\n\t\treturn Integer.parseInt(next());\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n\n\tpublic int[] nextIntArray(int n) {\n\t\tint[] a = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nextInt();\n\t\treturn a;\n\t}\n\n\tpublic long[] nextLongArray(int n) {\n\t\tlong[] a = new long[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\ta[i] = nextLong();\n\t\treturn a;\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "sample_input": "2\n1 5\n2 4\n3 6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03557", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3695, "cpu_time_ms": 541, "memory_kb": 57748}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s928080121", "group_id": "codeNet:p03557", "input_text": "\nimport java.io.*;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n FastScanner in;\n PrintWriter out;\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n void solve() {\n int N = in.nextInt();\n int[] A = new int[N];\n int[] B = new int[N];\n int[] C = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = in.nextInt();\n }\n for (int i = 0; i < N; i++) {\n B[i] = in.nextInt();\n }\n for (int i = 0; i < N; i++) {\n C[i] = in.nextInt();\n }\n Arrays.sort(A);\n Arrays.sort(B);\n Arrays.sort(C);\n long result = 0;\n int startb = 0;\n int startc = 0;\n for (int i = 0; i < N; i++) {\n // round of array A\n for (int j = startb; j < N; j++) {\n //round of array B\n if (A[i] >= B[j]) {\n startb = j;\n continue;\n }\n for (int k = startc; k < N; k++) {\n //round of array C\n if (B[j] >= C[k]) {\n if (startb >= C[k]) {\n startc = k;\n }\n continue;\n } else {\n result += C.length - k;\n break;\n }\n }\n }\n }\n out.println(result);\n }\n\n\n\n void run() {\n in = new FastScanner();\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n public class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public FastScanner(String s) {\n try {\n br = new BufferedReader(new FileReader(s));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n\n}", "language": "Java", "metadata": {"date": 1509848265, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03557.html", "problem_id": "p03557", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03557/input.txt", "sample_output_relpath": "derived/input_output/data/p03557/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03557/Java/s928080121.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s928080121", "user_id": "u822353071"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nimport java.io.*;\nimport java.util.Arrays;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n FastScanner in;\n PrintWriter out;\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n void solve() {\n int N = in.nextInt();\n int[] A = new int[N];\n int[] B = new int[N];\n int[] C = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = in.nextInt();\n }\n for (int i = 0; i < N; i++) {\n B[i] = in.nextInt();\n }\n for (int i = 0; i < N; i++) {\n C[i] = in.nextInt();\n }\n Arrays.sort(A);\n Arrays.sort(B);\n Arrays.sort(C);\n long result = 0;\n int startb = 0;\n int startc = 0;\n for (int i = 0; i < N; i++) {\n // round of array A\n for (int j = startb; j < N; j++) {\n //round of array B\n if (A[i] >= B[j]) {\n startb = j;\n continue;\n }\n for (int k = startc; k < N; k++) {\n //round of array C\n if (B[j] >= C[k]) {\n if (startb >= C[k]) {\n startc = k;\n }\n continue;\n } else {\n result += C.length - k;\n break;\n }\n }\n }\n }\n out.println(result);\n }\n\n\n\n void run() {\n in = new FastScanner();\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n public class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public FastScanner(String s) {\n try {\n br = new BufferedReader(new FileReader(s));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "sample_input": "2\n1 5\n2 4\n3 6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03557", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2651, "cpu_time_ms": 2109, "memory_kb": 55472}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s916064635", "group_id": "codeNet:p03557", "input_text": "\nimport java.io.*;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n FastScanner in;\n PrintWriter out;\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n void solve() {\n int N = in.nextInt();\n int[] A = new int[N];\n int[] B = new int[N];\n int[] C = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = in.nextInt();\n }\n for (int i = 0; i < N; i++) {\n B[i] = in.nextInt();\n }\n for (int i = 0; i < N; i++) {\n C[i] = in.nextInt();\n }\n long result = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (A[i] >= B[j]) {\n continue;\n }\n for (int k = 0; k < N; k++) {\n if (B[j] >= C[k]) {\n continue;\n } else {\n result += 1L;\n }\n }\n }\n }\n out.println(result);\n }\n\n\n\n void run() {\n in = new FastScanner();\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n public class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public FastScanner(String s) {\n try {\n br = new BufferedReader(new FileReader(s));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n\n}", "language": "Java", "metadata": {"date": 1509846776, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03557.html", "problem_id": "p03557", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03557/input.txt", "sample_output_relpath": "derived/input_output/data/p03557/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03557/Java/s916064635.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s916064635", "user_id": "u822353071"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nimport java.io.*;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n FastScanner in;\n PrintWriter out;\n\n public static void main(String[] args) {\n new Main().run();\n }\n\n void solve() {\n int N = in.nextInt();\n int[] A = new int[N];\n int[] B = new int[N];\n int[] C = new int[N];\n for (int i = 0; i < N; i++) {\n A[i] = in.nextInt();\n }\n for (int i = 0; i < N; i++) {\n B[i] = in.nextInt();\n }\n for (int i = 0; i < N; i++) {\n C[i] = in.nextInt();\n }\n long result = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (A[i] >= B[j]) {\n continue;\n }\n for (int k = 0; k < N; k++) {\n if (B[j] >= C[k]) {\n continue;\n } else {\n result += 1L;\n }\n }\n }\n }\n out.println(result);\n }\n\n\n\n void run() {\n in = new FastScanner();\n out = new PrintWriter(System.out);\n solve();\n out.close();\n }\n\n public class FastScanner {\n BufferedReader br;\n StringTokenizer st;\n\n public FastScanner() {\n br = new BufferedReader(new InputStreamReader(System.in));\n }\n\n public FastScanner(String s) {\n try {\n br = new BufferedReader(new FileReader(s));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }\n\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (IOException e) {\n }\n }\n return st.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(nextToken());\n }\n\n public long nextLong() {\n return Long.parseLong(nextToken());\n }\n\n public double nextDouble() {\n return Double.parseDouble(nextToken());\n }\n }\n\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "sample_input": "2\n1 5\n2 4\n3 6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03557", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2205, "cpu_time_ms": 2109, "memory_kb": 56496}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s668962783", "group_id": "codeNet:p03560", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in Actual solution is at the top\n * \n * @author daltao\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"daltao\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n }\n static class TaskD {\n int inf = (int) 1e8;\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int k = in.readInt();\n if (k == 100000) {\n out.println(1);\n return;\n }\n\n int round = 200;\n int limit = 100000;\n int[][] dp = new int[round + 1][limit];\n SequenceUtils.deepFill(dp, inf);\n dp[0][k] = 0;\n for (int i = 1; i <= round; i++) {\n for (int j = 0; j < 10; j++) {\n int val = k * j;\n for (int t = 0; t < limit; t++) {\n int transform = (val + t) / 10;\n dp[i][transform] = Math.min(dp[i][transform], dp[i - 1][t] + (val + t) % 10);\n }\n }\n }\n\n int ans = inf;\n DigitUtils.DigitBase base = new DigitUtils.DigitBase(10);\n for (int i = 0; i < limit; i++) {\n int sum = 0;\n for (int j = 0; j < 6; j++) {\n sum += base.getBit(i, j);\n }\n ans = Math.min(ans, sum + dp[round][i]);\n }\n\n out.println(ans);\n }\n\n }\n static class FastOutput implements AutoCloseable, Closeable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput println(int c) {\n cache.append(c).append('\\n');\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n static class SequenceUtils {\n public static void deepFill(Object array, int val) {\n if (!array.getClass().isArray()) {\n throw new IllegalArgumentException();\n }\n if (array instanceof int[]) {\n int[] intArray = (int[]) array;\n Arrays.fill(intArray, val);\n } else {\n Object[] objArray = (Object[]) array;\n for (Object obj : objArray) {\n deepFill(obj, val);\n }\n }\n }\n\n }\n static class LongList {\n private int size;\n private int cap;\n private long[] data;\n private static final long[] EMPTY = new long[0];\n\n public LongList(int cap) {\n this.cap = cap;\n if (cap == 0) {\n data = EMPTY;\n } else {\n data = new long[cap];\n }\n }\n\n public LongList(LongList list) {\n this.size = list.size;\n this.cap = list.cap;\n this.data = Arrays.copyOf(list.data, size);\n }\n\n public LongList() {\n this(0);\n }\n\n private void ensureSpace(int need) {\n int req = size + need;\n if (req > cap) {\n while (cap < req) {\n cap = Math.max(cap + 10, 2 * cap);\n }\n data = Arrays.copyOf(data, cap);\n }\n }\n\n private void checkRange(int i) {\n if (i < 0 || i >= size) {\n throw new ArrayIndexOutOfBoundsException();\n }\n }\n\n public long tail() {\n checkRange(0);\n return data[size - 1];\n }\n\n public void add(long x) {\n ensureSpace(1);\n data[size++] = x;\n }\n\n public long[] toArray() {\n return Arrays.copyOf(data, size);\n }\n\n public String toString() {\n return Arrays.toString(Arrays.copyOf(data, size));\n }\n\n }\n static class DigitUtils {\n private static final long[] DIGIT_VALUES = new long[19];\n static {\n DIGIT_VALUES[0] = 1;\n for (int i = 1; i < 19; i++) {\n DIGIT_VALUES[i] = DIGIT_VALUES[i - 1] * 10;\n }\n }\n\n private DigitUtils() {}\n\n public static boolean isMultiplicationOverflow(long a, long b, long limit) {\n if (limit < 0) {\n limit = -limit;\n }\n if (a < 0) {\n a = -a;\n }\n if (b < 0) {\n b = -b;\n }\n if (a == 0 || b == 0) {\n return false;\n }\n return a > limit / b;\n }\n\n public static class DigitBase {\n private long[] pow;\n private long base;\n\n public DigitBase(long base) {\n if (base <= 1) {\n throw new IllegalArgumentException();\n }\n this.base = base;\n LongList ll = new LongList(64);\n ll.add(1);\n while (!isMultiplicationOverflow(ll.tail(), base, Long.MAX_VALUE)) {\n ll.add(ll.tail() * base);\n }\n pow = ll.toArray();\n }\n\n public int getBit(long x, int i) {\n return (int) (x / pow[i] % base);\n }\n\n }\n\n }\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1572992780, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03560.html", "problem_id": "p03560", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03560/input.txt", "sample_output_relpath": "derived/input_output/data/p03560/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03560/Java/s668962783.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s668962783", "user_id": "u511225853"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.UncheckedIOException;\nimport java.io.Closeable;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in Actual solution is at the top\n * \n * @author daltao\n */\npublic class Main {\n public static void main(String[] args) throws Exception {\n Thread thread = new Thread(null, new TaskAdapter(), \"daltao\", 1 << 27);\n thread.start();\n thread.join();\n }\n\n static class TaskAdapter implements Runnable {\n @Override\n public void run() {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastInput in = new FastInput(inputStream);\n FastOutput out = new FastOutput(outputStream);\n TaskD solver = new TaskD();\n solver.solve(1, in, out);\n out.close();\n }\n }\n static class TaskD {\n int inf = (int) 1e8;\n\n public void solve(int testNumber, FastInput in, FastOutput out) {\n int k = in.readInt();\n if (k == 100000) {\n out.println(1);\n return;\n }\n\n int round = 200;\n int limit = 100000;\n int[][] dp = new int[round + 1][limit];\n SequenceUtils.deepFill(dp, inf);\n dp[0][k] = 0;\n for (int i = 1; i <= round; i++) {\n for (int j = 0; j < 10; j++) {\n int val = k * j;\n for (int t = 0; t < limit; t++) {\n int transform = (val + t) / 10;\n dp[i][transform] = Math.min(dp[i][transform], dp[i - 1][t] + (val + t) % 10);\n }\n }\n }\n\n int ans = inf;\n DigitUtils.DigitBase base = new DigitUtils.DigitBase(10);\n for (int i = 0; i < limit; i++) {\n int sum = 0;\n for (int j = 0; j < 6; j++) {\n sum += base.getBit(i, j);\n }\n ans = Math.min(ans, sum + dp[round][i]);\n }\n\n out.println(ans);\n }\n\n }\n static class FastOutput implements AutoCloseable, Closeable {\n private StringBuilder cache = new StringBuilder(10 << 20);\n private final Writer os;\n\n public FastOutput(Writer os) {\n this.os = os;\n }\n\n public FastOutput(OutputStream os) {\n this(new OutputStreamWriter(os));\n }\n\n public FastOutput println(int c) {\n cache.append(c).append('\\n');\n return this;\n }\n\n public FastOutput flush() {\n try {\n os.append(cache);\n os.flush();\n cache.setLength(0);\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n return this;\n }\n\n public void close() {\n flush();\n try {\n os.close();\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n\n public String toString() {\n return cache.toString();\n }\n\n }\n static class SequenceUtils {\n public static void deepFill(Object array, int val) {\n if (!array.getClass().isArray()) {\n throw new IllegalArgumentException();\n }\n if (array instanceof int[]) {\n int[] intArray = (int[]) array;\n Arrays.fill(intArray, val);\n } else {\n Object[] objArray = (Object[]) array;\n for (Object obj : objArray) {\n deepFill(obj, val);\n }\n }\n }\n\n }\n static class LongList {\n private int size;\n private int cap;\n private long[] data;\n private static final long[] EMPTY = new long[0];\n\n public LongList(int cap) {\n this.cap = cap;\n if (cap == 0) {\n data = EMPTY;\n } else {\n data = new long[cap];\n }\n }\n\n public LongList(LongList list) {\n this.size = list.size;\n this.cap = list.cap;\n this.data = Arrays.copyOf(list.data, size);\n }\n\n public LongList() {\n this(0);\n }\n\n private void ensureSpace(int need) {\n int req = size + need;\n if (req > cap) {\n while (cap < req) {\n cap = Math.max(cap + 10, 2 * cap);\n }\n data = Arrays.copyOf(data, cap);\n }\n }\n\n private void checkRange(int i) {\n if (i < 0 || i >= size) {\n throw new ArrayIndexOutOfBoundsException();\n }\n }\n\n public long tail() {\n checkRange(0);\n return data[size - 1];\n }\n\n public void add(long x) {\n ensureSpace(1);\n data[size++] = x;\n }\n\n public long[] toArray() {\n return Arrays.copyOf(data, size);\n }\n\n public String toString() {\n return Arrays.toString(Arrays.copyOf(data, size));\n }\n\n }\n static class DigitUtils {\n private static final long[] DIGIT_VALUES = new long[19];\n static {\n DIGIT_VALUES[0] = 1;\n for (int i = 1; i < 19; i++) {\n DIGIT_VALUES[i] = DIGIT_VALUES[i - 1] * 10;\n }\n }\n\n private DigitUtils() {}\n\n public static boolean isMultiplicationOverflow(long a, long b, long limit) {\n if (limit < 0) {\n limit = -limit;\n }\n if (a < 0) {\n a = -a;\n }\n if (b < 0) {\n b = -b;\n }\n if (a == 0 || b == 0) {\n return false;\n }\n return a > limit / b;\n }\n\n public static class DigitBase {\n private long[] pow;\n private long base;\n\n public DigitBase(long base) {\n if (base <= 1) {\n throw new IllegalArgumentException();\n }\n this.base = base;\n LongList ll = new LongList(64);\n ll.add(1);\n while (!isMultiplicationOverflow(ll.tail(), base, Long.MAX_VALUE)) {\n ll.add(ll.tail() * base);\n }\n pow = ll.toArray();\n }\n\n public int getBit(long x, int i) {\n return (int) (x / pow[i] % base);\n }\n\n }\n\n }\n static class FastInput {\n private final InputStream is;\n private byte[] buf = new byte[1 << 13];\n private int bufLen;\n private int bufOffset;\n private int next;\n\n public FastInput(InputStream is) {\n this.is = is;\n }\n\n private int read() {\n while (bufLen == bufOffset) {\n bufOffset = 0;\n try {\n bufLen = is.read(buf);\n } catch (IOException e) {\n bufLen = -1;\n }\n if (bufLen == -1) {\n return -1;\n }\n }\n return buf[bufOffset++];\n }\n\n public void skipBlank() {\n while (next >= 0 && next <= 32) {\n next = read();\n }\n }\n\n public int readInt() {\n int sign = 1;\n\n skipBlank();\n if (next == '+' || next == '-') {\n sign = next == '+' ? 1 : -1;\n next = read();\n }\n\n int val = 0;\n if (sign == 1) {\n while (next >= '0' && next <= '9') {\n val = val * 10 + next - '0';\n next = read();\n }\n } else {\n while (next >= '0' && next <= '9') {\n val = val * 10 - next + '0';\n next = read();\n }\n }\n\n return val;\n }\n\n }\n}\n\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03560", "source_text": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8285, "cpu_time_ms": 852, "memory_kb": 146900}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s430375472", "group_id": "codeNet:p03560", "input_text": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n\tprivate static Scanner sc;\n\tprivate static Printer pr;\n\n\tprivate static void solve() {\n\t\tint k = sc.nextInt();\n\n\t\tList> edges0 = new ArrayList<>(k);\n\t\tList> edges1 = new ArrayList<>(k);\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tedges0.add(new ArrayList<>());\n\t\t\tedges1.add(new ArrayList<>());\n\t\t}\n\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tedges1.get(i).add((i + 1) % k);\n\t\t\tedges0.get(i).add((i * 10) % k);\n\t\t}\n\n\t\tint[] d = new int[k];\n\t\tArrays.fill(d, Integer.MAX_VALUE / 2);\n\t\tDeque q = new ArrayDeque<>();\n\t\tq.add(1);\n\t\td[1] = 1;\n\t\twhile (!q.isEmpty()) {\n\t\t\tint e = q.remove();\n\n\t\t\tif (e == 0) {\n\t\t\t\tpr.println(d[0]);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tfor (int next : edges0.get(e)) {\n\t\t\t\tif (d[next] > d[e]) {\n\t\t\t\t\tq.addFirst(next);\n\t\t\t\t\td[next] = d[e];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int next : edges1.get(e)) {\n\t\t\t\tif (d[next] > d[e] + 1) {\n\t\t\t\t\tq.addLast(next);\n\t\t\t\t\td[next] = d[e] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// ---------------------------------------------------\n\tpublic static void main(String[] args) {\n\t\tsc = new Scanner(System.in);\n\t\tpr = new Printer(System.out);\n\n\t\tsolve();\n\n\t\tpr.close();\n\t\tsc.close();\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static class Scanner {\n\t\tBufferedReader br;\n\n\t\tScanner (InputStream in) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(in));\n\t\t}\n\n\t\tprivate boolean isPrintable(int ch) {\n\t\t\treturn ch >= '!' && ch <= '~';\n\t\t}\n\n\t\tprivate boolean isCRLF(int ch) {\n\t\t\treturn ch == '\\n' || ch == '\\r' || ch == -1;\n\t\t}\n\n\t\tprivate int nextPrintable() {\n\t\t\ttry {\n\t\t\t\tint ch;\n\t\t\t\twhile (!isPrintable(ch = br.read())) {\n\t\t\t\t\tif (ch == -1) {\n\t\t\t\t\t\tthrow new NoSuchElementException();\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn ch;\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\n\t\tString next() {\n\t\t\ttry {\n\t\t\t\tint ch = nextPrintable();\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tdo {\n\t\t\t\t\tsb.appendCodePoint(ch);\n\t\t\t\t} while (isPrintable(ch = br.read()));\n\n\t\t\t\treturn sb.toString();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\n\t\tint nextInt() {\n\t\t\ttry {\n\t\t\t\t// parseInt from Integer.parseInt()\n\t\t\t\tboolean negative = false;\n\t\t\t\tint res = 0;\n\t\t\t\tint limit = -Integer.MAX_VALUE;\n\t\t\t\tint radix = 10;\n\n\t\t\t\tint fc = nextPrintable();\n\t\t\t\tif (fc < '0') {\n\t\t\t\t\tif (fc == '-') {\n\t\t\t\t\t\tnegative = true;\n\t\t\t\t\t\tlimit = Integer.MIN_VALUE;\n\t\t\t\t\t} else if (fc != '+') {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tfc = br.read();\n\t\t\t\t}\n\t\t\t\tint multmin = limit / radix;\n\n\t\t\t\tint ch = fc;\n\t\t\t\tdo {\n\t\t\t\t\tint digit = ch - '0';\n\t\t\t\t\tif (digit < 0 || digit >= radix) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tif (res < multmin) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tres *= radix;\n\t\t\t\t\tif (res < limit + digit) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tres -= digit;\n\n\t\t\t\t} while (isPrintable(ch = br.read()));\n\n\t\t\t\treturn negative ? res : -res;\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\ttry {\n\t\t\t\t// parseLong from Long.parseLong()\n\t\t\t\tboolean negative = false;\n\t\t\t\tlong res = 0;\n\t\t\t\tlong limit = -Long.MAX_VALUE;\n\t\t\t\tint radix = 10;\n\n\t\t\t\tint fc = nextPrintable();\n\t\t\t\tif (fc < '0') {\n\t\t\t\t\tif (fc == '-') {\n\t\t\t\t\t\tnegative = true;\n\t\t\t\t\t\tlimit = Long.MIN_VALUE;\n\t\t\t\t\t} else if (fc != '+') {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tfc = br.read();\n\t\t\t\t}\n\t\t\t\tlong multmin = limit / radix;\n\n\t\t\t\tint ch = fc;\n\t\t\t\tdo {\n\t\t\t\t\tint digit = ch - '0';\n\t\t\t\t\tif (digit < 0 || digit >= radix) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tif (res < multmin) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tres *= radix;\n\t\t\t\t\tif (res < limit + digit) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tres -= digit;\n\n\t\t\t\t} while (isPrintable(ch = br.read()));\n\n\t\t\t\treturn negative ? res : -res;\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\n\t\tfloat nextFloat() {\n\t\t\treturn Float.parseFloat(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\ttry {\n\t\t\t\tint ch;\n\t\t\t\twhile (isCRLF(ch = br.read())) {\n\t\t\t\t\tif (ch == -1) {\n\t\t\t\t\t\tthrow new NoSuchElementException();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tdo {\n\t\t\t\t\tsb.appendCodePoint(ch);\n\t\t\t\t} while (!isCRLF(ch = br.read()));\n\n\t\t\t\treturn sb.toString();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\n\t\tvoid close() {\n\t\t\ttry {\n\t\t\t\tbr.close();\n\t\t\t} catch (IOException e) {\n//\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate static class Printer extends PrintWriter {\n\t\tPrinter(PrintStream out) {\n\t\t\tsuper(out);\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1509901091, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03560.html", "problem_id": "p03560", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03560/input.txt", "sample_output_relpath": "derived/input_output/data/p03560/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03560/Java/s430375472.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s430375472", "user_id": "u900015623"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n\tprivate static Scanner sc;\n\tprivate static Printer pr;\n\n\tprivate static void solve() {\n\t\tint k = sc.nextInt();\n\n\t\tList> edges0 = new ArrayList<>(k);\n\t\tList> edges1 = new ArrayList<>(k);\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tedges0.add(new ArrayList<>());\n\t\t\tedges1.add(new ArrayList<>());\n\t\t}\n\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tedges1.get(i).add((i + 1) % k);\n\t\t\tedges0.get(i).add((i * 10) % k);\n\t\t}\n\n\t\tint[] d = new int[k];\n\t\tArrays.fill(d, Integer.MAX_VALUE / 2);\n\t\tDeque q = new ArrayDeque<>();\n\t\tq.add(1);\n\t\td[1] = 1;\n\t\twhile (!q.isEmpty()) {\n\t\t\tint e = q.remove();\n\n\t\t\tif (e == 0) {\n\t\t\t\tpr.println(d[0]);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tfor (int next : edges0.get(e)) {\n\t\t\t\tif (d[next] > d[e]) {\n\t\t\t\t\tq.addFirst(next);\n\t\t\t\t\td[next] = d[e];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int next : edges1.get(e)) {\n\t\t\t\tif (d[next] > d[e] + 1) {\n\t\t\t\t\tq.addLast(next);\n\t\t\t\t\td[next] = d[e] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// ---------------------------------------------------\n\tpublic static void main(String[] args) {\n\t\tsc = new Scanner(System.in);\n\t\tpr = new Printer(System.out);\n\n\t\tsolve();\n\n\t\tpr.close();\n\t\tsc.close();\n\t}\n\n\t@SuppressWarnings(\"unused\")\n\tprivate static class Scanner {\n\t\tBufferedReader br;\n\n\t\tScanner (InputStream in) {\n\t\t\tbr = new BufferedReader(new InputStreamReader(in));\n\t\t}\n\n\t\tprivate boolean isPrintable(int ch) {\n\t\t\treturn ch >= '!' && ch <= '~';\n\t\t}\n\n\t\tprivate boolean isCRLF(int ch) {\n\t\t\treturn ch == '\\n' || ch == '\\r' || ch == -1;\n\t\t}\n\n\t\tprivate int nextPrintable() {\n\t\t\ttry {\n\t\t\t\tint ch;\n\t\t\t\twhile (!isPrintable(ch = br.read())) {\n\t\t\t\t\tif (ch == -1) {\n\t\t\t\t\t\tthrow new NoSuchElementException();\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn ch;\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\n\t\tString next() {\n\t\t\ttry {\n\t\t\t\tint ch = nextPrintable();\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tdo {\n\t\t\t\t\tsb.appendCodePoint(ch);\n\t\t\t\t} while (isPrintable(ch = br.read()));\n\n\t\t\t\treturn sb.toString();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\n\t\tint nextInt() {\n\t\t\ttry {\n\t\t\t\t// parseInt from Integer.parseInt()\n\t\t\t\tboolean negative = false;\n\t\t\t\tint res = 0;\n\t\t\t\tint limit = -Integer.MAX_VALUE;\n\t\t\t\tint radix = 10;\n\n\t\t\t\tint fc = nextPrintable();\n\t\t\t\tif (fc < '0') {\n\t\t\t\t\tif (fc == '-') {\n\t\t\t\t\t\tnegative = true;\n\t\t\t\t\t\tlimit = Integer.MIN_VALUE;\n\t\t\t\t\t} else if (fc != '+') {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tfc = br.read();\n\t\t\t\t}\n\t\t\t\tint multmin = limit / radix;\n\n\t\t\t\tint ch = fc;\n\t\t\t\tdo {\n\t\t\t\t\tint digit = ch - '0';\n\t\t\t\t\tif (digit < 0 || digit >= radix) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tif (res < multmin) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tres *= radix;\n\t\t\t\t\tif (res < limit + digit) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tres -= digit;\n\n\t\t\t\t} while (isPrintable(ch = br.read()));\n\n\t\t\t\treturn negative ? res : -res;\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\ttry {\n\t\t\t\t// parseLong from Long.parseLong()\n\t\t\t\tboolean negative = false;\n\t\t\t\tlong res = 0;\n\t\t\t\tlong limit = -Long.MAX_VALUE;\n\t\t\t\tint radix = 10;\n\n\t\t\t\tint fc = nextPrintable();\n\t\t\t\tif (fc < '0') {\n\t\t\t\t\tif (fc == '-') {\n\t\t\t\t\t\tnegative = true;\n\t\t\t\t\t\tlimit = Long.MIN_VALUE;\n\t\t\t\t\t} else if (fc != '+') {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tfc = br.read();\n\t\t\t\t}\n\t\t\t\tlong multmin = limit / radix;\n\n\t\t\t\tint ch = fc;\n\t\t\t\tdo {\n\t\t\t\t\tint digit = ch - '0';\n\t\t\t\t\tif (digit < 0 || digit >= radix) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tif (res < multmin) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tres *= radix;\n\t\t\t\t\tif (res < limit + digit) {\n\t\t\t\t\t\tthrow new NumberFormatException();\n\t\t\t\t\t}\n\t\t\t\t\tres -= digit;\n\n\t\t\t\t} while (isPrintable(ch = br.read()));\n\n\t\t\t\treturn negative ? res : -res;\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\n\t\tfloat nextFloat() {\n\t\t\treturn Float.parseFloat(next());\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tString nextLine() {\n\t\t\ttry {\n\t\t\t\tint ch;\n\t\t\t\twhile (isCRLF(ch = br.read())) {\n\t\t\t\t\tif (ch == -1) {\n\t\t\t\t\t\tthrow new NoSuchElementException();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\t\tdo {\n\t\t\t\t\tsb.appendCodePoint(ch);\n\t\t\t\t} while (!isCRLF(ch = br.read()));\n\n\t\t\t\treturn sb.toString();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\n\t\tvoid close() {\n\t\t\ttry {\n\t\t\t\tbr.close();\n\t\t\t} catch (IOException e) {\n//\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate static class Printer extends PrintWriter {\n\t\tPrinter(PrintStream out) {\n\t\t\tsuper(out);\n\t\t}\n\t}\n}\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03560", "source_text": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4671, "cpu_time_ms": 256, "memory_kb": 57144}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s228752754", "group_id": "codeNet:p03564", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tMain mainObj = new Main();\n\t\tmainObj.solve();\n\t}\n\n\tpublic void solve() throws IOException {\n\t\tFastScanner fs = new FastScanner();\n\t\tint n = fs.nextInt();\n\t\tint k = fs.nextInt();\n\t\t\n\t\tint ans = 1;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(ans > k) {\n\t\t\t\tans *= 2;\n\t\t\t}else {\n\t\t\t\tans += k;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n\n\t\n\n\tpublic class FastScanner {\n\n\t\tBufferedReader reader;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextIntArr(int n) throws NumberFormatException, IOException {\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic long[] nextLongArr(int n) throws NumberFormatException, IOException {\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\treader.close();\n\t\t}\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1585099410, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03564.html", "problem_id": "p03564", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03564/input.txt", "sample_output_relpath": "derived/input_output/data/p03564/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03564/Java/s228752754.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s228752754", "user_id": "u903557324"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\tpublic static void main(String[] args) throws IOException {\n\t\tMain mainObj = new Main();\n\t\tmainObj.solve();\n\t}\n\n\tpublic void solve() throws IOException {\n\t\tFastScanner fs = new FastScanner();\n\t\tint n = fs.nextInt();\n\t\tint k = fs.nextInt();\n\t\t\n\t\tint ans = 1;\n\t\t\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(ans > k) {\n\t\t\t\tans *= 2;\n\t\t\t}else {\n\t\t\t\tans += k;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t}\n\n\t\n\n\tpublic class FastScanner {\n\n\t\tBufferedReader reader;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner() {\n\t\t\tst = null;\n\t\t\treader = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\n\t\tpublic String next() throws IOException {\n\t\t\tif (st == null || !st.hasMoreElements()) {\n\t\t\t\tst = new StringTokenizer(reader.readLine());\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic String nextLine() throws IOException {\n\t\t\tst = null;\n\t\t\tString readLine = null;\n\t\t\treadLine = reader.readLine();\n\t\t\treturn readLine;\n\t\t}\n\n\t\tpublic int nextInt() throws NumberFormatException, IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() throws NumberFormatException, IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic int[] nextIntArr(int n) throws NumberFormatException, IOException {\n\t\t\tint[] retArr = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextInt();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic long[] nextLongArr(int n) throws NumberFormatException, IOException {\n\t\t\tlong[] retArr = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tretArr[i] = nextLong();\n\t\t\t}\n\t\t\treturn retArr;\n\t\t}\n\n\t\tpublic void close() throws IOException {\n\t\t\treader.close();\n\t\t}\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSquare1001 has seen an electric bulletin board displaying the integer 1.\nHe can perform the following operations A and B to change this value:\n\nOperation A: The displayed value is doubled.\n\nOperation B: The displayed value increases by K.\n\nSquare1001 needs to perform these operations N times in total.\nFind the minimum possible value displayed in the board after N operations.\n\nConstraints\n\n1 \\leq N, K \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the minimum possible value displayed in the board after N operations.\n\nSample Input 1\n\n4\n3\n\nSample Output 1\n\n10\n\nThe value will be minimized when the operations are performed in the following order: A, A, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 7 → 10.\n\nSample Input 2\n\n10\n10\n\nSample Output 2\n\n76\n\nThe value will be minimized when the operations are performed in the following order: A, A, A, A, B, B, B, B, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 8 → 16 → 26 → 36 → 46 → 56 → 66 → 76.\n\nBy the way, this contest is AtCoder Beginner Contest 076.", "sample_input": "4\n3\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03564", "source_text": "Score : 200 points\n\nProblem Statement\n\nSquare1001 has seen an electric bulletin board displaying the integer 1.\nHe can perform the following operations A and B to change this value:\n\nOperation A: The displayed value is doubled.\n\nOperation B: The displayed value increases by K.\n\nSquare1001 needs to perform these operations N times in total.\nFind the minimum possible value displayed in the board after N operations.\n\nConstraints\n\n1 \\leq N, K \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the minimum possible value displayed in the board after N operations.\n\nSample Input 1\n\n4\n3\n\nSample Output 1\n\n10\n\nThe value will be minimized when the operations are performed in the following order: A, A, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 7 → 10.\n\nSample Input 2\n\n10\n10\n\nSample Output 2\n\n76\n\nThe value will be minimized when the operations are performed in the following order: A, A, A, A, B, B, B, B, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 8 → 16 → 26 → 36 → 46 → 56 → 66 → 76.\n\nBy the way, this contest is AtCoder Beginner Contest 076.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1743, "cpu_time_ms": 70, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s830600131", "group_id": "codeNet:p03564", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main {\n\tpublic static void main(String args[]) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tSolver solver = new Solver();\n\t\tsolver.init();\n\t\tsolver.readHead(in.readLine());\n\t\tfor (; solver.hasNext();) {\n\t\t\tsolver.readBody(in.readLine());\n\t\t}\n\t\tsolver.solve();\n\t}\n}\n\nclass Solver {\n\tint N;\n\tint cnt;\n\tint K;\n\n\tpublic void init() {\n\t\tN = 0;\n\t\tcnt = 0;\n\t\tK = 0;\n\t}\n\n\tpublic void readHead(String str) {\n\t\tString[] strArr = str.split(\" \");\n\t\tN = Integer.parseInt(strArr[0]);\n\t\t// System.out.println(N);\n\t}\n\n\tpublic boolean hasNext() {\n\t\t// return cnt < N;\n\t\treturn cnt < 1;\n\t}\n\n\tpublic void readBody(String str) {\n\t\t// System.out.println(str);\n\t\tcnt++;\n\t\tK = Integer.parseInt(str);\n\t}\n\n\tpublic void solve() {\n\t\tint ans = 1;\n\t\tfor (; N > 0 && ans < K; N--) {\n\t\t\tans *= 2;\n\t\t}\n\t\tans += N * K;\n\t\tSystem.out.println(ans);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1509239927, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03564.html", "problem_id": "p03564", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03564/input.txt", "sample_output_relpath": "derived/input_output/data/p03564/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03564/Java/s830600131.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s830600131", "user_id": "u366035313"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main {\n\tpublic static void main(String args[]) throws IOException {\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tSolver solver = new Solver();\n\t\tsolver.init();\n\t\tsolver.readHead(in.readLine());\n\t\tfor (; solver.hasNext();) {\n\t\t\tsolver.readBody(in.readLine());\n\t\t}\n\t\tsolver.solve();\n\t}\n}\n\nclass Solver {\n\tint N;\n\tint cnt;\n\tint K;\n\n\tpublic void init() {\n\t\tN = 0;\n\t\tcnt = 0;\n\t\tK = 0;\n\t}\n\n\tpublic void readHead(String str) {\n\t\tString[] strArr = str.split(\" \");\n\t\tN = Integer.parseInt(strArr[0]);\n\t\t// System.out.println(N);\n\t}\n\n\tpublic boolean hasNext() {\n\t\t// return cnt < N;\n\t\treturn cnt < 1;\n\t}\n\n\tpublic void readBody(String str) {\n\t\t// System.out.println(str);\n\t\tcnt++;\n\t\tK = Integer.parseInt(str);\n\t}\n\n\tpublic void solve() {\n\t\tint ans = 1;\n\t\tfor (; N > 0 && ans < K; N--) {\n\t\t\tans *= 2;\n\t\t}\n\t\tans += N * K;\n\t\tSystem.out.println(ans);\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSquare1001 has seen an electric bulletin board displaying the integer 1.\nHe can perform the following operations A and B to change this value:\n\nOperation A: The displayed value is doubled.\n\nOperation B: The displayed value increases by K.\n\nSquare1001 needs to perform these operations N times in total.\nFind the minimum possible value displayed in the board after N operations.\n\nConstraints\n\n1 \\leq N, K \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the minimum possible value displayed in the board after N operations.\n\nSample Input 1\n\n4\n3\n\nSample Output 1\n\n10\n\nThe value will be minimized when the operations are performed in the following order: A, A, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 7 → 10.\n\nSample Input 2\n\n10\n10\n\nSample Output 2\n\n76\n\nThe value will be minimized when the operations are performed in the following order: A, A, A, A, B, B, B, B, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 8 → 16 → 26 → 36 → 46 → 56 → 66 → 76.\n\nBy the way, this contest is AtCoder Beginner Contest 076.", "sample_input": "4\n3\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03564", "source_text": "Score : 200 points\n\nProblem Statement\n\nSquare1001 has seen an electric bulletin board displaying the integer 1.\nHe can perform the following operations A and B to change this value:\n\nOperation A: The displayed value is doubled.\n\nOperation B: The displayed value increases by K.\n\nSquare1001 needs to perform these operations N times in total.\nFind the minimum possible value displayed in the board after N operations.\n\nConstraints\n\n1 \\leq N, K \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the minimum possible value displayed in the board after N operations.\n\nSample Input 1\n\n4\n3\n\nSample Output 1\n\n10\n\nThe value will be minimized when the operations are performed in the following order: A, A, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 7 → 10.\n\nSample Input 2\n\n10\n10\n\nSample Output 2\n\n76\n\nThe value will be minimized when the operations are performed in the following order: A, A, A, A, B, B, B, B, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 8 → 16 → 26 → 36 → 46 → 56 → 66 → 76.\n\nBy the way, this contest is AtCoder Beginner Contest 076.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 972, "cpu_time_ms": 92, "memory_kb": 21076}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s928422464", "group_id": "codeNet:p03566", "input_text": "import java.math.BigDecimal;\nimport java.util.*;\nimport java.util.stream.Collectors;\n\npublic class Main {\n\n public static void main(String[] args) {\n final Scanner scanner = new Scanner(System.in);\n solve(scanner);\n }\n\n static void solve(Scanner scanner) {\n int N = Integer.parseInt(scanner.nextLine());\n int[] ts = Arrays.stream(scanner.nextLine().split(\" \")).mapToInt(Integer::parseInt).toArray();\n for (int i = 1; i < N; i++) {\n ts[i] += ts[i - 1];\n }\n int[] vs = Arrays.stream(scanner.nextLine().split(\" \")).mapToInt(Integer::parseInt).toArray();\n BigDecimal[] dp = new BigDecimal[200 * 100 + 1];\n Arrays.fill(dp, BigDecimal.ZERO);\n int curr = 0;\n for (int i = 1; i < 200 * 100 + 1; i++) {\n if (i >= 2 * ts[N - 1] && dp[i - 1].compareTo(BigDecimal.ZERO) == 0) {\n break;\n }\n BigDecimal vNext = curr == N - 1 ? BigDecimal.ZERO : BigDecimal.valueOf(vs[curr + 1]);\n if (dp[i - 1].subtract(vNext).compareTo(BigDecimal.valueOf(ts[curr]).subtract(BigDecimal.valueOf(i - 1).divide(BigDecimal.valueOf(2)))) == 0) {\n dp[i] = dp[i - 1].subtract(BigDecimal.valueOf(0.5));\n } else if (BigDecimal.valueOf(vs[curr]).compareTo(dp[i - 1]) > 0) {\n dp[i] = dp[i - 1].add(BigDecimal.valueOf(0.5));\n } else if (BigDecimal.valueOf(vs[curr]).compareTo(dp[i - 1]) == 0) {\n dp[i] = dp[i - 1];\n }\n // System.out.printf(\"%.1f %.1f \\n\", i / 2.0, dp[i].doubleValue());\n if (curr != N - 1 && 2 * ts[curr] == i) {\n curr++;\n }\n }\n System.out.printf(\"%.6f\\n\", Arrays.stream(dp).mapToDouble(BigDecimal::doubleValue).sum() / 2.0);\n }\n\n}", "language": "Java", "metadata": {"date": 1573116061, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03566.html", "problem_id": "p03566", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03566/input.txt", "sample_output_relpath": "derived/input_output/data/p03566/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03566/Java/s928422464.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s928422464", "user_id": "u241874341"}, "prompt_components": {"gold_output": "2100.000000000000000\n", "input_to_evaluate": "import java.math.BigDecimal;\nimport java.util.*;\nimport java.util.stream.Collectors;\n\npublic class Main {\n\n public static void main(String[] args) {\n final Scanner scanner = new Scanner(System.in);\n solve(scanner);\n }\n\n static void solve(Scanner scanner) {\n int N = Integer.parseInt(scanner.nextLine());\n int[] ts = Arrays.stream(scanner.nextLine().split(\" \")).mapToInt(Integer::parseInt).toArray();\n for (int i = 1; i < N; i++) {\n ts[i] += ts[i - 1];\n }\n int[] vs = Arrays.stream(scanner.nextLine().split(\" \")).mapToInt(Integer::parseInt).toArray();\n BigDecimal[] dp = new BigDecimal[200 * 100 + 1];\n Arrays.fill(dp, BigDecimal.ZERO);\n int curr = 0;\n for (int i = 1; i < 200 * 100 + 1; i++) {\n if (i >= 2 * ts[N - 1] && dp[i - 1].compareTo(BigDecimal.ZERO) == 0) {\n break;\n }\n BigDecimal vNext = curr == N - 1 ? BigDecimal.ZERO : BigDecimal.valueOf(vs[curr + 1]);\n if (dp[i - 1].subtract(vNext).compareTo(BigDecimal.valueOf(ts[curr]).subtract(BigDecimal.valueOf(i - 1).divide(BigDecimal.valueOf(2)))) == 0) {\n dp[i] = dp[i - 1].subtract(BigDecimal.valueOf(0.5));\n } else if (BigDecimal.valueOf(vs[curr]).compareTo(dp[i - 1]) > 0) {\n dp[i] = dp[i - 1].add(BigDecimal.valueOf(0.5));\n } else if (BigDecimal.valueOf(vs[curr]).compareTo(dp[i - 1]) == 0) {\n dp[i] = dp[i - 1];\n }\n // System.out.printf(\"%.1f %.1f \\n\", i / 2.0, dp[i].doubleValue());\n if (curr != N - 1 && 2 * ts[curr] == i) {\n curr++;\n }\n }\n System.out.printf(\"%.6f\\n\", Arrays.stream(dp).mapToDouble(BigDecimal::doubleValue).sum() / 2.0);\n }\n\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nIn the year 2168, AtCoder Inc., which is much larger than now, is starting a limited express train service called AtCoder Express.\n\nIn the plan developed by the president Takahashi, the trains will run as follows:\n\nA train will run for (t_1 + t_2 + t_3 + ... + t_N) seconds.\n\nIn the first t_1 seconds, a train must run at a speed of at most v_1 m/s (meters per second). Similarly, in the subsequent t_2 seconds, a train must run at a speed of at most v_2 m/s, and so on.\n\nAccording to the specifications of the trains, the acceleration of a train must be always within ±1m/s^2. Additionally, a train must stop at the beginning and the end of the run.\n\nFind the maximum possible distance that a train can cover in the run.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq t_i \\leq 200\n\n1 \\leq v_i \\leq 100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 t_2 t_3 … t_N\nv_1 v_2 v_3 … v_N\n\nOutput\n\nPrint the maximum possible that a train can cover in the run.\n\nOutput is considered correct if its absolute difference from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n1\n100\n30\n\nSample Output 1\n\n2100.000000000000000\n\nThe maximum distance is achieved when a train runs as follows:\n\nIn the first 30 seconds, it accelerates at a rate of 1m/s^2, covering 450 meters.\n\nIn the subsequent 40 seconds, it maintains the velocity of 30m/s, covering 1200 meters.\n\nIn the last 30 seconds, it decelerates at the acceleration of -1m/s^2, covering 450 meters.\n\nThe total distance covered is 450 + 1200 + 450 = 2100 meters.\n\nSample Input 2\n\n2\n60 50\n34 38\n\nSample Output 2\n\n2632.000000000000000\n\nThe maximum distance is achieved when a train runs as follows:\n\nIn the first 34 seconds, it accelerates at a rate of 1m/s^2, covering 578 meters.\n\nIn the subsequent 26 seconds, it maintains the velocity of 34m/s, covering 884 meters.\n\nIn the subsequent 4 seconds, it accelerates at a rate of 1m/s^2, covering 144 meters.\n\nIn the subsequent 8 seconds, it maintains the velocity of 38m/s, covering 304 meters.\n\nIn the last 38 seconds, it decelerates at the acceleration of -1m/s^2, covering 722 meters.\n\nThe total distance covered is 578 + 884 + 144 + 304 + 722 = 2632 meters.\n\nSample Input 3\n\n3\n12 14 2\n6 2 7\n\nSample Output 3\n\n76.000000000000000\n\nThe maximum distance is achieved when a train runs as follows:\n\nIn the first 6 seconds, it accelerates at a rate of 1m/s^2, covering 18 meters.\n\nIn the subsequent 2 seconds, it maintains the velocity of 6m/s, covering 12 meters.\n\nIn the subsequent 4 seconds, it decelerates at the acceleration of -1m/s^2, covering 16 meters.\n\nIn the subsequent 14 seconds, it maintains the velocity of 2m/s, covering 28 meters.\n\nIn the last 2 seconds, it decelerates at the acceleration of -1m/s^2, covering 2 meters.\n\nThe total distance covered is 18 + 12 + 16 + 28 + 2 = 76 meters.\n\nSample Input 4\n\n1\n9\n10\n\nSample Output 4\n\n20.250000000000000000\n\nThe maximum distance is achieved when a train runs as follows:\n\nIn the first 4.5 seconds, it accelerates at a rate of 1m/s^2, covering 10.125 meters.\n\nIn the last 4.5 seconds, it decelerates at the acceleration of -1m/s^2, covering 10.125 meters.\n\nThe total distance covered is 10.125 + 10.125 = 20.25 meters.\n\nSample Input 5\n\n10\n64 55 27 35 76 119 7 18 49 100\n29 19 31 39 27 48 41 87 55 70\n\nSample Output 5\n\n20291.000000000000", "sample_input": "1\n100\n30\n"}, "reference_outputs": ["2100.000000000000000\n"], "source_document_id": "p03566", "source_text": "Score : 400 points\n\nProblem Statement\n\nIn the year 2168, AtCoder Inc., which is much larger than now, is starting a limited express train service called AtCoder Express.\n\nIn the plan developed by the president Takahashi, the trains will run as follows:\n\nA train will run for (t_1 + t_2 + t_3 + ... + t_N) seconds.\n\nIn the first t_1 seconds, a train must run at a speed of at most v_1 m/s (meters per second). Similarly, in the subsequent t_2 seconds, a train must run at a speed of at most v_2 m/s, and so on.\n\nAccording to the specifications of the trains, the acceleration of a train must be always within ±1m/s^2. Additionally, a train must stop at the beginning and the end of the run.\n\nFind the maximum possible distance that a train can cover in the run.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq t_i \\leq 200\n\n1 \\leq v_i \\leq 100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 t_2 t_3 … t_N\nv_1 v_2 v_3 … v_N\n\nOutput\n\nPrint the maximum possible that a train can cover in the run.\n\nOutput is considered correct if its absolute difference from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n1\n100\n30\n\nSample Output 1\n\n2100.000000000000000\n\nThe maximum distance is achieved when a train runs as follows:\n\nIn the first 30 seconds, it accelerates at a rate of 1m/s^2, covering 450 meters.\n\nIn the subsequent 40 seconds, it maintains the velocity of 30m/s, covering 1200 meters.\n\nIn the last 30 seconds, it decelerates at the acceleration of -1m/s^2, covering 450 meters.\n\nThe total distance covered is 450 + 1200 + 450 = 2100 meters.\n\nSample Input 2\n\n2\n60 50\n34 38\n\nSample Output 2\n\n2632.000000000000000\n\nThe maximum distance is achieved when a train runs as follows:\n\nIn the first 34 seconds, it accelerates at a rate of 1m/s^2, covering 578 meters.\n\nIn the subsequent 26 seconds, it maintains the velocity of 34m/s, covering 884 meters.\n\nIn the subsequent 4 seconds, it accelerates at a rate of 1m/s^2, covering 144 meters.\n\nIn the subsequent 8 seconds, it maintains the velocity of 38m/s, covering 304 meters.\n\nIn the last 38 seconds, it decelerates at the acceleration of -1m/s^2, covering 722 meters.\n\nThe total distance covered is 578 + 884 + 144 + 304 + 722 = 2632 meters.\n\nSample Input 3\n\n3\n12 14 2\n6 2 7\n\nSample Output 3\n\n76.000000000000000\n\nThe maximum distance is achieved when a train runs as follows:\n\nIn the first 6 seconds, it accelerates at a rate of 1m/s^2, covering 18 meters.\n\nIn the subsequent 2 seconds, it maintains the velocity of 6m/s, covering 12 meters.\n\nIn the subsequent 4 seconds, it decelerates at the acceleration of -1m/s^2, covering 16 meters.\n\nIn the subsequent 14 seconds, it maintains the velocity of 2m/s, covering 28 meters.\n\nIn the last 2 seconds, it decelerates at the acceleration of -1m/s^2, covering 2 meters.\n\nThe total distance covered is 18 + 12 + 16 + 28 + 2 = 76 meters.\n\nSample Input 4\n\n1\n9\n10\n\nSample Output 4\n\n20.250000000000000000\n\nThe maximum distance is achieved when a train runs as follows:\n\nIn the first 4.5 seconds, it accelerates at a rate of 1m/s^2, covering 10.125 meters.\n\nIn the last 4.5 seconds, it decelerates at the acceleration of -1m/s^2, covering 10.125 meters.\n\nThe total distance covered is 10.125 + 10.125 = 20.25 meters.\n\nSample Input 5\n\n10\n64 55 27 35 76 119 7 18 49 100\n29 19 31 39 27 48 41 87 55 70\n\nSample Output 5\n\n20291.000000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1807, "cpu_time_ms": 302, "memory_kb": 35348}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s656397399", "group_id": "codeNet:p03569", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tint n = s.length();\n\t\tint ans = 0, l = 0, r = n - 1;\n\t\tif(n == 1) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tfor(; ; ) {\n\t\t\tif(s.charAt(l) == s.charAt(r)) {\n\t\t\t\tl++; r--;\n\t\t\t} else {\n\t\t\t\tif(s.charAt(l) != 'x' && s.charAt(r) != 'x') {\n\t\t\t\t\tSystem.out.println(-1);\n\t\t\t\t\treturn;\n\t\t\t\t} else {\n\t\t\t\t\tif(s.charAt(l) == 'x') {\n\t\t\t\t\t\tl++;\n\t\t\t\t\t\tans++;\n\t\t\t\t\t\tif(l == r) {\n\t\t\t\t\t\t\tSystem.out.println(ans);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(s.charAt(r) == 'x') {\n\t\t\t\t\t\tr--;\n\t\t\t\t\t\tans++;\n\t\t\t\t\t\tif(l == r) {\n\t\t\t\t\t\t\tSystem.out.println(ans);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1508732652, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03569.html", "problem_id": "p03569", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03569/input.txt", "sample_output_relpath": "derived/input_output/data/p03569/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03569/Java/s656397399.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s656397399", "user_id": "u764011970"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s = sc.next();\n\t\tint n = s.length();\n\t\tint ans = 0, l = 0, r = n - 1;\n\t\tif(n == 1) {\n\t\t\tSystem.out.println(0);\n\t\t\treturn;\n\t\t}\n\t\tfor(; ; ) {\n\t\t\tif(s.charAt(l) == s.charAt(r)) {\n\t\t\t\tl++; r--;\n\t\t\t} else {\n\t\t\t\tif(s.charAt(l) != 'x' && s.charAt(r) != 'x') {\n\t\t\t\t\tSystem.out.println(-1);\n\t\t\t\t\treturn;\n\t\t\t\t} else {\n\t\t\t\t\tif(s.charAt(l) == 'x') {\n\t\t\t\t\t\tl++;\n\t\t\t\t\t\tans++;\n\t\t\t\t\t\tif(l == r) {\n\t\t\t\t\t\t\tSystem.out.println(ans);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(s.charAt(r) == 'x') {\n\t\t\t\t\t\tr--;\n\t\t\t\t\t\tans++;\n\t\t\t\t\t\tif(l == r) {\n\t\t\t\t\t\t\tSystem.out.println(ans);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "sample_input": "xabxa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03569", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 735, "cpu_time_ms": 170, "memory_kb": 25428}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s968811110", "group_id": "codeNet:p03569", "input_text": "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n String s = scanner.next();\n\n int xCount = 0;\n String newStr = \"\";\n\n for (int i = 0; i < s.length(); i++) {\n String tmp = s.substring(i, i + 1);\n if (tmp.equals(\"x\")) {\n if (!(s.length() % 2 == 1 && i == (s.length() - 1) / 2)) {\n xCount++;\n }\n } else {\n newStr += tmp;\n }\n }\n\n if (newStr.length() == 0) {\n System.out.println(0);\n } else if (check(newStr)) {\n System.out.println(xCount);\n } else {\n System.out.println(-1);\n }\n }\n\n private static boolean check(String s) {\n int l = s.length();\n if (l % 2 == 1) {\n for (int i = 0; i < (l - 1) / 2; i++) {\n if (!s.substring(i, i + 1).equals(s.substring(l - 1 - i, l - i))) {\n return false;\n }\n }\n } else {\n for (int i = 0; i < l / 2; i++) {\n if (!s.substring(i, i + 1).equals(s.substring(l - 1 - i, l - i))) {\n return false;\n }\n }\n }\n return true;\n }\n}", "language": "Java", "metadata": {"date": 1508724290, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03569.html", "problem_id": "p03569", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03569/input.txt", "sample_output_relpath": "derived/input_output/data/p03569/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03569/Java/s968811110.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s968811110", "user_id": "u042338793"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n String s = scanner.next();\n\n int xCount = 0;\n String newStr = \"\";\n\n for (int i = 0; i < s.length(); i++) {\n String tmp = s.substring(i, i + 1);\n if (tmp.equals(\"x\")) {\n if (!(s.length() % 2 == 1 && i == (s.length() - 1) / 2)) {\n xCount++;\n }\n } else {\n newStr += tmp;\n }\n }\n\n if (newStr.length() == 0) {\n System.out.println(0);\n } else if (check(newStr)) {\n System.out.println(xCount);\n } else {\n System.out.println(-1);\n }\n }\n\n private static boolean check(String s) {\n int l = s.length();\n if (l % 2 == 1) {\n for (int i = 0; i < (l - 1) / 2; i++) {\n if (!s.substring(i, i + 1).equals(s.substring(l - 1 - i, l - i))) {\n return false;\n }\n }\n } else {\n for (int i = 0; i < l / 2; i++) {\n if (!s.substring(i, i + 1).equals(s.substring(l - 1 - i, l - i))) {\n return false;\n }\n }\n }\n return true;\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "sample_input": "xabxa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03569", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1324, "cpu_time_ms": 2110, "memory_kb": 347112}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s425334821", "group_id": "codeNet:p03569", "input_text": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\nclass Main {\n public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n public static PrintWriter pw = new PrintWriter(System.out);\n public static String line;\n public static StringTokenizer st;\n public static ArrayList> adjList;\n public static int[] dx = {-1, 0, 1, 0, -1, 1, 1, -1};\n public static int[] dy = {0, 1, 0, -1, 1, 1, -1, -1};\n public static int INF = 0x3f3f3f3f;\n public static int MOD = 1000000007;\n\n public static void main(String[] args) throws Exception{\n String s = br.readLine();\n int xCount = 0;\n StringBuilder sb = new StringBuilder();\n for(int i = 0; i < s.length(); i++){\n if(s.charAt(i) == 'x'){\n xCount++;\n } else{\n sb.append(s.charAt(i));\n }\n }\n\n // System.out.println(sb.reverse().toString() + \" \" + sb.toString());\n if(sb.toString().equals(sb.reverse().toString())){\n int i = 0;\n int j = s.length() - 1;\n int ans = 0;\n while(i < j){\n char a = s.charAt(i);\n char b = s.charAt(j);\n\n if(a == b){\n i++;\n j--;\n } else if(a == 'x'){\n i++;\n ans++;\n } else{\n j--;\n ans++;\n }\n }\n pw.print(ans + \"\\n\");\n } else{\n pw.print(\"-1\\n\");\n }\n\n pw.close(); \n br.close();\n }\n}\n\nclass Pair{\n public long x, y;\n\n Pair(long _x, long _y){\n x = _x;\n y = _y;\n }\n}\nclass Point implements Comparable{\n public double x, y;\n\n Point(double x, double y){\n this.x = x;\n this.y = y;\n }\n\n public int compareTo(Point p){\n if(x != p.x) return x < p.x ? -1 : 1;\n else if(y != p.y) return y < p.y ? -1 : 1;\n return 0;\n }\n}", "language": "Java", "metadata": {"date": 1508721623, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03569.html", "problem_id": "p03569", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03569/input.txt", "sample_output_relpath": "derived/input_output/data/p03569/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03569/Java/s425334821.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s425334821", "user_id": "u191165038"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nimport java.math.*;\n\nclass Main {\n public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n public static PrintWriter pw = new PrintWriter(System.out);\n public static String line;\n public static StringTokenizer st;\n public static ArrayList> adjList;\n public static int[] dx = {-1, 0, 1, 0, -1, 1, 1, -1};\n public static int[] dy = {0, 1, 0, -1, 1, 1, -1, -1};\n public static int INF = 0x3f3f3f3f;\n public static int MOD = 1000000007;\n\n public static void main(String[] args) throws Exception{\n String s = br.readLine();\n int xCount = 0;\n StringBuilder sb = new StringBuilder();\n for(int i = 0; i < s.length(); i++){\n if(s.charAt(i) == 'x'){\n xCount++;\n } else{\n sb.append(s.charAt(i));\n }\n }\n\n // System.out.println(sb.reverse().toString() + \" \" + sb.toString());\n if(sb.toString().equals(sb.reverse().toString())){\n int i = 0;\n int j = s.length() - 1;\n int ans = 0;\n while(i < j){\n char a = s.charAt(i);\n char b = s.charAt(j);\n\n if(a == b){\n i++;\n j--;\n } else if(a == 'x'){\n i++;\n ans++;\n } else{\n j--;\n ans++;\n }\n }\n pw.print(ans + \"\\n\");\n } else{\n pw.print(\"-1\\n\");\n }\n\n pw.close(); \n br.close();\n }\n}\n\nclass Pair{\n public long x, y;\n\n Pair(long _x, long _y){\n x = _x;\n y = _y;\n }\n}\nclass Point implements Comparable{\n public double x, y;\n\n Point(double x, double y){\n this.x = x;\n this.y = y;\n }\n\n public int compareTo(Point p){\n if(x != p.x) return x < p.x ? -1 : 1;\n else if(y != p.y) return y < p.y ? -1 : 1;\n return 0;\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "sample_input": "xabxa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03569", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2055, "cpu_time_ms": 115, "memory_kb": 26836}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s081696624", "group_id": "codeNet:p03576", "input_text": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tD();\n\t\treturn;\n\t}\n\t\n\tpublic static void A() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\t\n\t\tif(A==B) System.out.println(C);\n\t\telse if(B==C) System.out.println(A);\n\t\telse System.out.println(B);\n\t}\n\n\t// #を読めば、その周囲に数字を入れる\n\t// -1は#に対応する 空間O(n)\n\t//あるいは、ますの８方向を確認する　時間O(n)　空間O(1）\n\t\n\tpublic static void calc8(char[][] cell ,int h, int w) {\n\t\tif(cell[h][w] == '#') System.out.print('#');\n\t\telse {\n\t\t\tint[] hs = new int[] {h-1,h,h+1};\n\t\t\tint[] ws = new int[] {w-1,w,w+1};\n\t\t\tint sum = 0;\n\t\t\tfor(int nh: hs) {\n\t\t\t\tfor(int nw : ws) {\n\t\t\t\t\tif(nh=0 && nw >=0 && nw < cell[0].length) {\n\t\t\t\t\t\tif(cell[nh][nw]=='#') sum++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.print(sum);\n\t\t}\n\t\tif(w == cell[0].length-1) System.out.println(\"\");\n\t}\n\t\n\tpublic static void B() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint H = sc.nextInt();\n\t\tint W = sc.nextInt();\n\t\tchar[][] cell = new char[H][W];\n\t\tfor(int i=0;i que = new LinkedList();\n\t\tque.add(i);\n\t\twhile(!que.isEmpty()) {\n\t\t\tint check = que.removeFirst();\n\t\t\tif(check == j) return true;\n\t\t\t//System.out.println(check + \" check\");\n\t\t\tvisit[check] = true;\n\t\t\tfor(int w=0;w=K) {\n\t\t\t\t\t\t\tmin = Math.min(min, (xs[xridx]-xs[xlidx])*(long)(ys[yuidx]-ys[ydidx]));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1554922735, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03576.html", "problem_id": "p03576", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03576/input.txt", "sample_output_relpath": "derived/input_output/data/p03576/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03576/Java/s081696624.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s081696624", "user_id": "u086752773"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tD();\n\t\treturn;\n\t}\n\t\n\tpublic static void A() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint A = sc.nextInt();\n\t\tint B = sc.nextInt();\n\t\tint C = sc.nextInt();\n\t\t\n\t\tif(A==B) System.out.println(C);\n\t\telse if(B==C) System.out.println(A);\n\t\telse System.out.println(B);\n\t}\n\n\t// #を読めば、その周囲に数字を入れる\n\t// -1は#に対応する 空間O(n)\n\t//あるいは、ますの８方向を確認する　時間O(n)　空間O(1）\n\t\n\tpublic static void calc8(char[][] cell ,int h, int w) {\n\t\tif(cell[h][w] == '#') System.out.print('#');\n\t\telse {\n\t\t\tint[] hs = new int[] {h-1,h,h+1};\n\t\t\tint[] ws = new int[] {w-1,w,w+1};\n\t\t\tint sum = 0;\n\t\t\tfor(int nh: hs) {\n\t\t\t\tfor(int nw : ws) {\n\t\t\t\t\tif(nh=0 && nw >=0 && nw < cell[0].length) {\n\t\t\t\t\t\tif(cell[nh][nw]=='#') sum++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.print(sum);\n\t\t}\n\t\tif(w == cell[0].length-1) System.out.println(\"\");\n\t}\n\t\n\tpublic static void B() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint H = sc.nextInt();\n\t\tint W = sc.nextInt();\n\t\tchar[][] cell = new char[H][W];\n\t\tfor(int i=0;i que = new LinkedList();\n\t\tque.add(i);\n\t\twhile(!que.isEmpty()) {\n\t\t\tint check = que.removeFirst();\n\t\t\tif(check == j) return true;\n\t\t\t//System.out.println(check + \" check\");\n\t\t\tvisit[check] = true;\n\t\t\tfor(int w=0;w=K) {\n\t\t\t\t\t\t\tmin = Math.min(min, (xs[xridx]-xs[xlidx])*(long)(ys[yuidx]-ys[ydidx]));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(min);\n\t}\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N points in a two-dimensional plane.\n\nThe coordinates of the i-th point (1 \\leq i \\leq N) are (x_i,y_i).\n\nLet us consider a rectangle whose sides are parallel to the coordinate axes that contains K or more of the N points in its interior.\n\nHere, points on the sides of the rectangle are considered to be in the interior.\n\nFind the minimum possible area of such a rectangle.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 50\n\n-10^9 \\leq x_i,y_i \\leq 10^9 (1 \\leq i \\leq N)\n\nx_i≠x_j (1 \\leq i r.key));\n IntPair[] ry = rx.clone();\n Arrays.sort(ry, Comparator.comparing(r -> r.value));\n\n long ans = Long.MAX_VALUE;\n for (int xs = 0; xs <= n - k; xs++) {\n for (int ys = 0; ys <= n - k; ys++) {\n for (int xe = xs; xe < n; xe++) {\n for (int ye = ys; ye < n; ye++) {\n int count = 0;\n for (int i = xs; i < n; i++) {\n if (rx[i].key <= rx[xe].key && ry[ys].value <= rx[i].value && rx[i].value <= ry[ye].value) {\n count++;\n }\n }\n if (count >= k) {\n ans = Math.min(ans, (rx[xe].key - rx[xs].key) * (long) (ry[ye].value - ry[ys].value));\n }\n }\n }\n }\n }\n out.println(ans);\n }\n\n }\n\n static class IntPair {\n public int key;\n public int value;\n\n public IntPair(int key, int value) {\n this.key = key;\n this.value = value;\n }\n\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n Pair pair = (Pair) o;\n return Objects.equals(key, pair.key) &&\n Objects.equals(value, pair.value);\n }\n\n public int hashCode() {\n return Objects.hash(key, value);\n }\n\n public String toString() {\n return \"Pair{\" +\n \"key=\" + key +\n \", value=\" + value +\n '}';\n }\n\n }\n\n static interface BiIntFunction {\n T apply(int t, int u);\n\n }\n\n static class LightScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n public void objs(T[] array, BiIntFunction constructor) {\n for (int i = 0; i < array.length; i++) {\n array[i] = constructor.apply(ints(), ints());\n }\n }\n\n }\n\n static final class Pair {\n public K key;\n public V value;\n\n public Pair(K key, V value) {\n this.key = key;\n this.value = value;\n }\n\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n Pair pair = (Pair) o;\n return Objects.equals(key, pair.key) &&\n Objects.equals(value, pair.value);\n }\n\n public int hashCode() {\n return Objects.hash(key, value);\n }\n\n public String toString() {\n return \"Pair{\" +\n \"key=\" + key +\n \", value=\" + value +\n '}';\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1540001566, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03576.html", "problem_id": "p03576", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03576/input.txt", "sample_output_relpath": "derived/input_output/data/p03576/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03576/Java/s075162258.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s075162258", "user_id": "u183509493"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.UncheckedIOException;\nimport java.util.Objects;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.util.Comparator;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author mikit\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n LightScanner in = new LightScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n DAxisParallelRectangle solver = new DAxisParallelRectangle();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class DAxisParallelRectangle {\n public void solve(int testNumber, LightScanner in, PrintWriter out) {\n int n = in.ints(), k = in.ints();\n IntPair[] rx = new IntPair[n];\n in.objs(rx, IntPair::new);\n Arrays.sort(rx, Comparator.comparing(r -> r.key));\n IntPair[] ry = rx.clone();\n Arrays.sort(ry, Comparator.comparing(r -> r.value));\n\n long ans = Long.MAX_VALUE;\n for (int xs = 0; xs <= n - k; xs++) {\n for (int ys = 0; ys <= n - k; ys++) {\n for (int xe = xs; xe < n; xe++) {\n for (int ye = ys; ye < n; ye++) {\n int count = 0;\n for (int i = xs; i < n; i++) {\n if (rx[i].key <= rx[xe].key && ry[ys].value <= rx[i].value && rx[i].value <= ry[ye].value) {\n count++;\n }\n }\n if (count >= k) {\n ans = Math.min(ans, (rx[xe].key - rx[xs].key) * (long) (ry[ye].value - ry[ys].value));\n }\n }\n }\n }\n }\n out.println(ans);\n }\n\n }\n\n static class IntPair {\n public int key;\n public int value;\n\n public IntPair(int key, int value) {\n this.key = key;\n this.value = value;\n }\n\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n Pair pair = (Pair) o;\n return Objects.equals(key, pair.key) &&\n Objects.equals(value, pair.value);\n }\n\n public int hashCode() {\n return Objects.hash(key, value);\n }\n\n public String toString() {\n return \"Pair{\" +\n \"key=\" + key +\n \", value=\" + value +\n '}';\n }\n\n }\n\n static interface BiIntFunction {\n T apply(int t, int u);\n\n }\n\n static class LightScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n public void objs(T[] array, BiIntFunction constructor) {\n for (int i = 0; i < array.length; i++) {\n array[i] = constructor.apply(ints(), ints());\n }\n }\n\n }\n\n static final class Pair {\n public K key;\n public V value;\n\n public Pair(K key, V value) {\n this.key = key;\n this.value = value;\n }\n\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n Pair pair = (Pair) o;\n return Objects.equals(key, pair.key) &&\n Objects.equals(value, pair.value);\n }\n\n public int hashCode() {\n return Objects.hash(key, value);\n }\n\n public String toString() {\n return \"Pair{\" +\n \"key=\" + key +\n \", value=\" + value +\n '}';\n }\n\n }\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N points in a two-dimensional plane.\n\nThe coordinates of the i-th point (1 \\leq i \\leq N) are (x_i,y_i).\n\nLet us consider a rectangle whose sides are parallel to the coordinate axes that contains K or more of the N points in its interior.\n\nHere, points on the sides of the rectangle are considered to be in the interior.\n\nFind the minimum possible area of such a rectangle.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 50\n\n-10^9 \\leq x_i,y_i \\leq 10^9 (1 \\leq i \\leq N)\n\nx_i≠x_j (1 \\leq i 0) {\n\t\t\t\t\tSystem.out.println(h + \" \" + n + \" \" + (child/mother));\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1564631106, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03583.html", "problem_id": "p03583", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03583/input.txt", "sample_output_relpath": "derived/input_output/data/p03583/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03583/Java/s155491828.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s155491828", "user_id": "u010090035"}, "prompt_components": {"gold_output": "1 2 2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static final int MAX = 3500;\n\n\tpublic static void main(String args[]) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\n\t\tfor(int h=1;h<=MAX;h++) {\n\t\t\tfor(int n=1;n<=MAX;n++) {\n\t\t\t\tint child = N*h*n;\n\t\t\t\tint mother = 4*h*n - N*n - N*h;\n\n\t\t\t\tif(mother != 0 && child%mother == 0 && child/mother > 0) {\n\t\t\t\t\tSystem.out.println(h + \" \" + n + \" \" + (child/mother));\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "sample_input": "2\n"}, "reference_outputs": ["1 2 2\n"], "source_document_id": "p03583", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 468, "cpu_time_ms": 129, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s879073125", "group_id": "codeNet:p03583", "input_text": "import java.util.*;\n\n// Tenakaichi \n// https://yukicoder.me/problems/no/325\t\n\npublic class Main {\n\t\n\tpublic static void main (String[] args) throws InterruptedException {\n\t\tScanner in = new Scanner(System.in);\n\t\t\n\t\tdouble E = 1e-9;\n\t\t\n\t\tdouble N = in.nextDouble();\n\t\tboolean answerFound = false;\n\t\tdouble d = 4 / N;\n\t\t\n\t\tfor (double i = 3500; i > 0 && 1 / i < d && !answerFound; i--) {\n\t\t\tdouble dd = d - 1 / i;\n\t\t\t\n\t\t\tfor (double j = 3500; j > 0 && 1 / j < dd && !answerFound; j--) {\n\t\t\t\tdouble ddd = dd - 1 / j;\n\t\t\t\t\n\t\t\t\tdouble x = 1 / ddd;\n\t\t\t\tint k = 0;\n\t\t\t\t\n\t\t\t\tif (Math.abs(Math.ceil(x) - x) <= E) {\n\t\t\t\t\tk = (int) Math.ceil(x);\n\t\t\t\t\tanswerFound = true;\n\t\t\t\t} else if (Math.abs(Math.floor(x) - x) <= E) {\n\t\t\t\t\tk = (int) Math.floor(x);\n\t\t\t\t\tanswerFound = true;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (answerFound) {\n\t\t\t\t\tSystem.out.printf(\"%d %d %d\\n\", (int) i, (int) j, k);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n}\n", "language": "Java", "metadata": {"date": 1506821236, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03583.html", "problem_id": "p03583", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03583/input.txt", "sample_output_relpath": "derived/input_output/data/p03583/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03583/Java/s879073125.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s879073125", "user_id": "u189568205"}, "prompt_components": {"gold_output": "1 2 2\n", "input_to_evaluate": "import java.util.*;\n\n// Tenakaichi \n// https://yukicoder.me/problems/no/325\t\n\npublic class Main {\n\t\n\tpublic static void main (String[] args) throws InterruptedException {\n\t\tScanner in = new Scanner(System.in);\n\t\t\n\t\tdouble E = 1e-9;\n\t\t\n\t\tdouble N = in.nextDouble();\n\t\tboolean answerFound = false;\n\t\tdouble d = 4 / N;\n\t\t\n\t\tfor (double i = 3500; i > 0 && 1 / i < d && !answerFound; i--) {\n\t\t\tdouble dd = d - 1 / i;\n\t\t\t\n\t\t\tfor (double j = 3500; j > 0 && 1 / j < dd && !answerFound; j--) {\n\t\t\t\tdouble ddd = dd - 1 / j;\n\t\t\t\t\n\t\t\t\tdouble x = 1 / ddd;\n\t\t\t\tint k = 0;\n\t\t\t\t\n\t\t\t\tif (Math.abs(Math.ceil(x) - x) <= E) {\n\t\t\t\t\tk = (int) Math.ceil(x);\n\t\t\t\t\tanswerFound = true;\n\t\t\t\t} else if (Math.abs(Math.floor(x) - x) <= E) {\n\t\t\t\t\tk = (int) Math.floor(x);\n\t\t\t\t\tanswerFound = true;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (answerFound) {\n\t\t\t\t\tSystem.out.printf(\"%d %d %d\\n\", (int) i, (int) j, k);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "sample_input": "2\n"}, "reference_outputs": ["1 2 2\n"], "source_document_id": "p03583", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 883, "cpu_time_ms": 346, "memory_kb": 23348}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s398831145", "group_id": "codeNet:p03587", "input_text": "import static java.lang.System.out;\nimport java.io.InputStream;\nimport java.io.IOException;\nimport java.util.NoSuchElementException;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tMyInput in = new MyInput();\n int N = in.nextInt();\n int t = 0;\n int m = 0;\n int tmp = 0;\n for(int i = 0; i < N; i++) {\n tmp = in.nextInt();\n if(tmp > t) {\n t = tmp;\n m = in.nextInt();\n }\n else in.nextInt();\n }\n out.println(t + m);\n\n\t}\n}\n\nclass MyInput {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr= 0;\n\tprivate int buflen = 0;\n\tprivate boolean hasNextByte() {\n\t\tif(ptr < buflen) {\n\t\t\treturn true;\n\t\t}else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch(IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif(buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic int readByte() { \n\t\tif (hasNextByte()) return buffer[ptr++];\n\t\telse return -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <=126;\n\t}\n\n\tprivate void skipUnprintable() {\n\t\twhile(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n\t}\n\n\tpublic boolean hasNext() {\n\t\tskipUnprintable();\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif(!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile(isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif(!hasNext()) throw new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif(b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true) {\n\t\t\tif('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif(nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1506820158, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03587.html", "problem_id": "p03587", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03587/input.txt", "sample_output_relpath": "derived/input_output/data/p03587/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03587/Java/s398831145.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s398831145", "user_id": "u729767359"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import static java.lang.System.out;\nimport java.io.InputStream;\nimport java.io.IOException;\nimport java.util.NoSuchElementException;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tMyInput in = new MyInput();\n int N = in.nextInt();\n int t = 0;\n int m = 0;\n int tmp = 0;\n for(int i = 0; i < N; i++) {\n tmp = in.nextInt();\n if(tmp > t) {\n t = tmp;\n m = in.nextInt();\n }\n else in.nextInt();\n }\n out.println(t + m);\n\n\t}\n}\n\nclass MyInput {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr= 0;\n\tprivate int buflen = 0;\n\tprivate boolean hasNextByte() {\n\t\tif(ptr < buflen) {\n\t\t\treturn true;\n\t\t}else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch(IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif(buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic int readByte() { \n\t\tif (hasNextByte()) return buffer[ptr++];\n\t\telse return -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <=126;\n\t}\n\n\tprivate void skipUnprintable() {\n\t\twhile(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n\t}\n\n\tpublic boolean hasNext() {\n\t\tskipUnprintable();\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif(!hasNext()) throw new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile(isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif(!hasNext()) throw new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif(b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile(true) {\n\t\t\tif('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t}else if(b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t}else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif(nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke prepared 6 problems for a upcoming programming contest.\nFor each of those problems, Rng judged whether it can be used in the contest or not.\n\nYou are given a string S of length 6.\nIf the i-th character of s is 1, it means that the i-th problem prepared by Snuke is accepted to be used; 0 means that the problem is not accepted.\n\nHow many problems prepared by Snuke are accepted to be used in the contest?\n\nConstraints\n\nThe length of S is 6.\n\nS consists of 0 and 1.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutputs\n\nPrint the number of problems prepared by Snuke that are accepted to be used in the contest.\n\nSample Input 1\n\n111100\n\nSample Output 1\n\n4\n\nThe first, second, third and fourth problems are accepted, for a total of four.\n\nSample Input 2\n\n001001\n\nSample Output 2\n\n2\n\nSample Input 3\n\n000000\n\nSample Output 3\n\n0", "sample_input": "111100\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03587", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke prepared 6 problems for a upcoming programming contest.\nFor each of those problems, Rng judged whether it can be used in the contest or not.\n\nYou are given a string S of length 6.\nIf the i-th character of s is 1, it means that the i-th problem prepared by Snuke is accepted to be used; 0 means that the problem is not accepted.\n\nHow many problems prepared by Snuke are accepted to be used in the contest?\n\nConstraints\n\nThe length of S is 6.\n\nS consists of 0 and 1.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutputs\n\nPrint the number of problems prepared by Snuke that are accepted to be used in the contest.\n\nSample Input 1\n\n111100\n\nSample Output 1\n\n4\n\nThe first, second, third and fourth problems are accepted, for a total of four.\n\nSample Input 2\n\n001001\n\nSample Output 2\n\n2\n\nSample Input 3\n\n000000\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2330, "cpu_time_ms": 77, "memory_kb": 21332}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s963435570", "group_id": "codeNet:p03597", "input_text": "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint A = sc.nextInt();\n\n\t\tSystem.out.println(N*N-A);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1528566820, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03597.html", "problem_id": "p03597", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03597/input.txt", "sample_output_relpath": "derived/input_output/data/p03597/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03597/Java/s963435570.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s963435570", "user_id": "u102547855"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint A = sc.nextInt();\n\n\t\tSystem.out.println(N*N-A);\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "sample_input": "3\n4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03597", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 210, "cpu_time_ms": 96, "memory_kb": 21460}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s172788026", "group_id": "codeNet:p03598", "input_text": "import java.math.BigInteger;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.Iterator;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\n\nclass Main {\n static final int MOD = 1000000007;\n static final int INF = 1 << 30;\n static final int ALF = 26;\n\n Main() {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int K = sc.nextInt();\n int ans = 0;\n int[] X = new int[N];\n for(int i=0;i= k * c + d * l;\n\t}\n\n}", "language": "Java", "metadata": {"date": 1560704621, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03599.html", "problem_id": "p03599", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03599/input.txt", "sample_output_relpath": "derived/input_output/data/p03599/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03599/Java/s326638518.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s326638518", "user_id": "u830501843"}, "prompt_components": {"gold_output": "110 10\n", "input_to_evaluate": "public class Main {\n\tint a;\n\tint b;\n\tint c;\n\tint d;\n\tint e;\n\tint f;\n\n\tpublic static void main(String[] args) {\n\t\tjava.util.Scanner s = new java.util.Scanner(System.in);\n\t\tSystem.out.println(Main.calc(s.nextInt(), s.nextInt(), s.nextInt(),\n\t\t\t\ts.nextInt(), s.nextInt(), s.nextInt()));\n\t}\n\t\n\tpublic Main(int a, int b, int c, int d, int e, int f) {\n\t\tthis.a = a;\n\t\tthis.b = b;\n\t\tthis.c = c;\n\t\tthis.d = d;\n\t\tthis.e = e;\n\t\tthis.f = f;\n\t}\n\n\tpublic static String calc(int a, int b, int c, int d, int e, int f) {\n\t\treturn new Main(a, b, c, d, e, f).calc();\n\t}\n\n\tpublic String calc() {\n\t\tdouble noudo = 0;\n\t\tint satousui = 0;\n\t\tint satou = 0;\n\t\tfor (int i = 0; this.sum(i, 0, 0, 0) <= f; i++) {\n\t\t\tfor (int j = 0; this.sum(i, j, 0, 0) <= f; j++) {\n\t\t\t\tfor (int k = 0; this.sum(i, j, k, 0) <= f; k++) {\n\t\t\t\t\tfor (int l = 0; this.sum(i, j, k, l) <= f; l++) {\n\t\t\t\t\t\tdouble cal = this.calcNoudo(i, j, k, l);\n\t\t\t\t\t\tif (this.isTokeru(i, j, k, l) && noudo < cal) {\n\t\t\t\t\t\t\tnoudo = cal;\n\t\t\t\t\t\t\tsatousui = this.sum(i, j, k, l);\n\t\t\t\t\t\t\tsatou = c * k + d * l;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn satousui + \" \" + satou;\n\t}\n\n\tpublic int sum(int i, int j, int k, int l) {\n\t\treturn 100 * i * a + 100 * j * b + k * c + l * d;\n\t}\n\n\tpublic double calcNoudo(int i, int j, int k, int l) {\n\t\tif ((100 * (i * a + j * b) + k * c + l * d) <= 0) {\n\t\t\treturn 0;\n\t\t}\n\t\treturn 100 * (k * c + l * d) / (100 * (i * a + j * b) + k * c + l * d);\n\t}\n\n\tpublic boolean isTokeru(int i, int j, int k, int l) {\n\t\treturn (i * a + j * b) * e >= k * c + d * l;\n\t}\n\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n\nOperation 1: Pour 100A grams of water into the beaker.\n\nOperation 2: Pour 100B grams of water into the beaker.\n\nOperation 3: Put C grams of sugar into the beaker.\n\nOperation 4: Put D grams of sugar into the beaker.\n\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\n\nSnuke will make sugar water with the highest possible density.\n\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\n\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\nConstraints\n\n1 \\leq A < B \\leq 30\n\n1 \\leq C < D \\leq 30\n\n1 \\leq E \\leq 100\n\n100A \\leq F \\leq 3 000\n\nA, B, C, D, E and F are all integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nA B C D E F\n\nOutputs\n\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\nSample Input 1\n\n1 2 10 20 15 200\n\nSample Output 1\n\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\n\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n\nIf we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n\nIf we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.\n\nSample Input 2\n\n1 2 1 2 100 1000\n\nSample Output 2\n\n200 100\n\nThere are other acceptable outputs, such as:\n\n400 200\n\nHowever, the output below is not acceptable:\n\n300 150\n\nThis is because, in order to make 300 grams of sugar water containing 150 grams of sugar, we need to pour exactly 150 grams of water into the beaker, which is impossible.\n\nSample Input 3\n\n17 19 22 26 55 2802\n\nSample Output 3\n\n2634 934", "sample_input": "1 2 10 20 15 200\n"}, "reference_outputs": ["110 10\n"], "source_document_id": "p03599", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n\nOperation 1: Pour 100A grams of water into the beaker.\n\nOperation 2: Pour 100B grams of water into the beaker.\n\nOperation 3: Put C grams of sugar into the beaker.\n\nOperation 4: Put D grams of sugar into the beaker.\n\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\n\nSnuke will make sugar water with the highest possible density.\n\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\n\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\nConstraints\n\n1 \\leq A < B \\leq 30\n\n1 \\leq C < D \\leq 30\n\n1 \\leq E \\leq 100\n\n100A \\leq F \\leq 3 000\n\nA, B, C, D, E and F are all integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nA B C D E F\n\nOutputs\n\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\nSample Input 1\n\n1 2 10 20 15 200\n\nSample Output 1\n\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\n\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n\nIf we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n\nIf we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.\n\nSample Input 2\n\n1 2 1 2 100 1000\n\nSample Output 2\n\n200 100\n\nThere are other acceptable outputs, such as:\n\n400 200\n\nHowever, the output below is not acceptable:\n\n300 150\n\nThis is because, in order to make 300 grams of sugar water containing 150 grams of sugar, we need to pour exactly 150 grams of water into the beaker, which is impossible.\n\nSample Input 3\n\n17 19 22 26 55 2802\n\nSample Output 3\n\n2634 934", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1519, "cpu_time_ms": 123, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s809334165", "group_id": "codeNet:p03601", "input_text": "import java.util.*;\nimport java.lang.*;\n\nclass Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = Integer.parseInt(sc.next());\n int B = Integer.parseInt(sc.next());\n int C = Integer.parseInt(sc.next());\n int D = Integer.parseInt(sc.next());\n int E = Integer.parseInt(sc.next());\n int F = Integer.parseInt(sc.next());\n int[] res = new int[3];\n int a = 100*A;\n int b = 100*B;\n for(int i = 0; i<30; i++){\n if(a*i > F) break;\n for(int j = 0; j<30; j++){\n int w = a*i+b*j;\n if(w == 0) continue;\n if(w > F) break;\n else{\n int lim = w*E/100;\n for(int k = 0; klim) break;\n if(s<=lim && w+s <= F){\n int noudo = s*100/(s+w);\n if(res[2]<=noudo){\n //System.out.println(\"i,j,k,l = \"+i+\" \"+j+\" \"+k+\" \"+l);\n res[0] = s+w;\n res[1] = s;\n res[2] = noudo;\n }\n }\n }\n }\n }\n }\n }\n System.out.println(res[0]+\" \"+res[1]);\n }\n}", "language": "Java", "metadata": {"date": 1534519215, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03601.html", "problem_id": "p03601", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03601/input.txt", "sample_output_relpath": "derived/input_output/data/p03601/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03601/Java/s809334165.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s809334165", "user_id": "u432614080"}, "prompt_components": {"gold_output": "110 10\n", "input_to_evaluate": "import java.util.*;\nimport java.lang.*;\n\nclass Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int A = Integer.parseInt(sc.next());\n int B = Integer.parseInt(sc.next());\n int C = Integer.parseInt(sc.next());\n int D = Integer.parseInt(sc.next());\n int E = Integer.parseInt(sc.next());\n int F = Integer.parseInt(sc.next());\n int[] res = new int[3];\n int a = 100*A;\n int b = 100*B;\n for(int i = 0; i<30; i++){\n if(a*i > F) break;\n for(int j = 0; j<30; j++){\n int w = a*i+b*j;\n if(w == 0) continue;\n if(w > F) break;\n else{\n int lim = w*E/100;\n for(int k = 0; klim) break;\n if(s<=lim && w+s <= F){\n int noudo = s*100/(s+w);\n if(res[2]<=noudo){\n //System.out.println(\"i,j,k,l = \"+i+\" \"+j+\" \"+k+\" \"+l);\n res[0] = s+w;\n res[1] = s;\n res[2] = noudo;\n }\n }\n }\n }\n }\n }\n }\n System.out.println(res[0]+\" \"+res[1]);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n\nOperation 1: Pour 100A grams of water into the beaker.\n\nOperation 2: Pour 100B grams of water into the beaker.\n\nOperation 3: Put C grams of sugar into the beaker.\n\nOperation 4: Put D grams of sugar into the beaker.\n\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\n\nSnuke will make sugar water with the highest possible density.\n\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\n\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\nConstraints\n\n1 \\leq A < B \\leq 30\n\n1 \\leq C < D \\leq 30\n\n1 \\leq E \\leq 100\n\n100A \\leq F \\leq 3 000\n\nA, B, C, D, E and F are all integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nA B C D E F\n\nOutputs\n\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\nSample Input 1\n\n1 2 10 20 15 200\n\nSample Output 1\n\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\n\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n\nIf we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n\nIf we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.\n\nSample Input 2\n\n1 2 1 2 100 1000\n\nSample Output 2\n\n200 100\n\nThere are other acceptable outputs, such as:\n\n400 200\n\nHowever, the output below is not acceptable:\n\n300 150\n\nThis is because, in order to make 300 grams of sugar water containing 150 grams of sugar, we need to pour exactly 150 grams of water into the beaker, which is impossible.\n\nSample Input 3\n\n17 19 22 26 55 2802\n\nSample Output 3\n\n2634 934", "sample_input": "1 2 10 20 15 200\n"}, "reference_outputs": ["110 10\n"], "source_document_id": "p03601", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n\nOperation 1: Pour 100A grams of water into the beaker.\n\nOperation 2: Pour 100B grams of water into the beaker.\n\nOperation 3: Put C grams of sugar into the beaker.\n\nOperation 4: Put D grams of sugar into the beaker.\n\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\n\nSnuke will make sugar water with the highest possible density.\n\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\n\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\nConstraints\n\n1 \\leq A < B \\leq 30\n\n1 \\leq C < D \\leq 30\n\n1 \\leq E \\leq 100\n\n100A \\leq F \\leq 3 000\n\nA, B, C, D, E and F are all integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nA B C D E F\n\nOutputs\n\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\nSample Input 1\n\n1 2 10 20 15 200\n\nSample Output 1\n\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\n\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n\nIf we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n\nIf we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.\n\nSample Input 2\n\n1 2 1 2 100 1000\n\nSample Output 2\n\n200 100\n\nThere are other acceptable outputs, such as:\n\n400 200\n\nHowever, the output below is not acceptable:\n\n300 150\n\nThis is because, in order to make 300 grams of sugar water containing 150 grams of sugar, we need to pour exactly 150 grams of water into the beaker, which is impossible.\n\nSample Input 3\n\n17 19 22 26 55 2802\n\nSample Output 3\n\n2634 934", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1392, "cpu_time_ms": 305, "memory_kb": 22864}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s191775913", "group_id": "codeNet:p03602", "input_text": "import java.util.HashSet;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\n static class Edge implements Comparable{\n int start;\n int end;\n int weight;\n public Edge(int start, int end, int weigth) {\n this.start = start;\n this.end = end;\n this.weight = weigth;\n }\n\n @Override\n public int compareTo(Edge o) {\n return Integer.compare(this.weight, o.weight);\n }\n\n\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int[][] graph = new int[N][N];\n\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n graph[i][j] = sc.nextInt();\n }\n }\n\n if (!legitGraph(graph)) {\n System.out.println(-1);\n return;\n } else {\n System.out.println(MST(graph));\n return;\n }\n\n\n }\n\n private static boolean legitGraph(int[][] graph) {\n int N = graph.length;\n for (int k = 0; k < N; k++) {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (graph[i][j] > graph[i][k] + graph[k][j]) {\n return false;\n }\n }\n }\n }\n\n return true;\n }\n\n\n private static int MST(int[][] graph) {\n PriorityQueue pq = new PriorityQueue<>();\n Set vertices = new HashSet<>();\n Set edges = new HashSet<>();\n for (int i = 0; i < graph.length; i++) {\n for (int j = i + 1; j < graph.length; j++) {\n pq.add(new Edge(i, j, graph[i][j]));\n }\n }\n\n while(edges.size() < graph.length - 1) {\n edges.add(pq.remove());\n }\n\n\n int ans = 0;\n for (Edge edge : edges) {\n System.out.println(edge.start + \" \" + edge.end + \" \" + edge.weight);\n ans += edge.weight;\n }\n\n return ans;\n }\n}\n", "language": "Java", "metadata": {"date": 1509735367, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03602.html", "problem_id": "p03602", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03602/input.txt", "sample_output_relpath": "derived/input_output/data/p03602/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03602/Java/s191775913.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s191775913", "user_id": "u618115184"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.HashSet;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\n static class Edge implements Comparable{\n int start;\n int end;\n int weight;\n public Edge(int start, int end, int weigth) {\n this.start = start;\n this.end = end;\n this.weight = weigth;\n }\n\n @Override\n public int compareTo(Edge o) {\n return Integer.compare(this.weight, o.weight);\n }\n\n\n }\n\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int[][] graph = new int[N][N];\n\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n graph[i][j] = sc.nextInt();\n }\n }\n\n if (!legitGraph(graph)) {\n System.out.println(-1);\n return;\n } else {\n System.out.println(MST(graph));\n return;\n }\n\n\n }\n\n private static boolean legitGraph(int[][] graph) {\n int N = graph.length;\n for (int k = 0; k < N; k++) {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (graph[i][j] > graph[i][k] + graph[k][j]) {\n return false;\n }\n }\n }\n }\n\n return true;\n }\n\n\n private static int MST(int[][] graph) {\n PriorityQueue pq = new PriorityQueue<>();\n Set vertices = new HashSet<>();\n Set edges = new HashSet<>();\n for (int i = 0; i < graph.length; i++) {\n for (int j = i + 1; j < graph.length; j++) {\n pq.add(new Edge(i, j, graph[i][j]));\n }\n }\n\n while(edges.size() < graph.length - 1) {\n edges.add(pq.remove());\n }\n\n\n int ans = 0;\n for (Edge edge : edges) {\n System.out.println(edge.start + \" \" + edge.end + \" \" + edge.weight);\n ans += edge.weight;\n }\n\n return ans;\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIn Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidirectionally by roads.\nThe following are known about the road network:\n\nPeople traveled between cities only through roads. It was possible to reach any city from any other city, via intermediate cities if necessary.\n\nDifferent roads may have had different lengths, but all the lengths were positive integers.\n\nSnuke the archeologist found a table with N rows and N columns, A, in the ruin of Takahashi Kingdom.\nHe thought that it represented the shortest distances between the cities along the roads in the kingdom.\n\nDetermine whether there exists a road network such that for each u and v, the integer A_{u, v} at the u-th row and v-th column of A is equal to the length of the shortest path from City u to City v.\nIf such a network exist, find the shortest possible total length of the roads.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nIf i ≠ j, 1 \\leq A_{i, j} = A_{j, i} \\leq 10^9.\n\nA_{i, i} = 0\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n...\nA_{N, 1} A_{N, 2} ... A_{N, N}\n\nOutputs\n\nIf there exists no network that satisfies the condition, print -1.\nIf it exists, print the shortest possible total length of the roads.\n\nSample Input 1\n\n3\n0 1 3\n1 0 2\n3 2 0\n\nSample Output 1\n\n3\n\nThe network below satisfies the condition:\n\nCity 1 and City 2 is connected by a road of length 1.\n\nCity 2 and City 3 is connected by a road of length 2.\n\nCity 3 and City 1 is not connected by a road.\n\nSample Input 2\n\n3\n0 1 3\n1 0 1\n3 1 0\n\nSample Output 2\n\n-1\n\nAs there is a path of length 1 from City 1 to City 2 and City 2 to City 3, there is a path of length 2 from City 1 to City 3.\nHowever, according to the table, the shortest distance between City 1 and City 3 must be 3.\n\nThus, we conclude that there exists no network that satisfies the condition.\n\nSample Input 3\n\n5\n0 21 18 11 28\n21 0 13 10 26\n18 13 0 23 13\n11 10 23 0 17\n28 26 13 17 0\n\nSample Output 3\n\n82\n\nSample Input 4\n\n3\n0 1000000000 1000000000\n1000000000 0 1000000000\n1000000000 1000000000 0\n\nSample Output 4\n\n3000000000", "sample_input": "3\n0 1 3\n1 0 2\n3 2 0\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03602", "source_text": "Score : 500 points\n\nProblem Statement\n\nIn Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidirectionally by roads.\nThe following are known about the road network:\n\nPeople traveled between cities only through roads. It was possible to reach any city from any other city, via intermediate cities if necessary.\n\nDifferent roads may have had different lengths, but all the lengths were positive integers.\n\nSnuke the archeologist found a table with N rows and N columns, A, in the ruin of Takahashi Kingdom.\nHe thought that it represented the shortest distances between the cities along the roads in the kingdom.\n\nDetermine whether there exists a road network such that for each u and v, the integer A_{u, v} at the u-th row and v-th column of A is equal to the length of the shortest path from City u to City v.\nIf such a network exist, find the shortest possible total length of the roads.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nIf i ≠ j, 1 \\leq A_{i, j} = A_{j, i} \\leq 10^9.\n\nA_{i, i} = 0\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n...\nA_{N, 1} A_{N, 2} ... A_{N, N}\n\nOutputs\n\nIf there exists no network that satisfies the condition, print -1.\nIf it exists, print the shortest possible total length of the roads.\n\nSample Input 1\n\n3\n0 1 3\n1 0 2\n3 2 0\n\nSample Output 1\n\n3\n\nThe network below satisfies the condition:\n\nCity 1 and City 2 is connected by a road of length 1.\n\nCity 2 and City 3 is connected by a road of length 2.\n\nCity 3 and City 1 is not connected by a road.\n\nSample Input 2\n\n3\n0 1 3\n1 0 1\n3 1 0\n\nSample Output 2\n\n-1\n\nAs there is a path of length 1 from City 1 to City 2 and City 2 to City 3, there is a path of length 2 from City 1 to City 3.\nHowever, according to the table, the shortest distance between City 1 and City 3 must be 3.\n\nThus, we conclude that there exists no network that satisfies the condition.\n\nSample Input 3\n\n5\n0 21 18 11 28\n21 0 13 10 26\n18 13 0 23 13\n11 10 23 0 17\n28 26 13 17 0\n\nSample Output 3\n\n82\n\nSample Input 4\n\n3\n0 1000000000 1000000000\n1000000000 0 1000000000\n1000000000 1000000000 0\n\nSample Output 4\n\n3000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2118, "cpu_time_ms": 520, "memory_kb": 51868}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s307588047", "group_id": "codeNet:p03605", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.UncheckedIOException;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author mikit\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n LightScanner in = new LightScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n ASeptember9 solver = new ASeptember9();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class ASeptember9 {\n private static final String YES = \"Yes\";\n private static final String NO = \"No\";\n\n public void solve(int testNumber, LightScanner in, PrintWriter out) {\n int n = in.ints();\n out.println(n / 10 == 9 || n % 10 == 9 ? YES : NO);\n }\n\n }\n\n static class LightScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1538191297, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03605.html", "problem_id": "p03605", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03605/input.txt", "sample_output_relpath": "derived/input_output/data/p03605/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03605/Java/s307588047.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s307588047", "user_id": "u183509493"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.UncheckedIOException;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author mikit\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n LightScanner in = new LightScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n ASeptember9 solver = new ASeptember9();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class ASeptember9 {\n private static final String YES = \"Yes\";\n private static final String NO = \"No\";\n\n public void solve(int testNumber, LightScanner in, PrintWriter out) {\n int n = in.ints();\n out.println(n / 10 == 9 || n % 10 == 9 ? YES : NO);\n }\n\n }\n\n static class LightScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n }\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIt is September 9 in Japan now.\n\nYou are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?\n\nConstraints\n\n10≤N≤99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf 9 is contained in the decimal notation of N, print Yes; if not, print No.\n\nSample Input 1\n\n29\n\nSample Output 1\n\nYes\n\nThe one's digit of 29 is 9.\n\nSample Input 2\n\n72\n\nSample Output 2\n\nNo\n\n72 does not contain 9.\n\nSample Input 3\n\n91\n\nSample Output 3\n\nYes", "sample_input": "29\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03605", "source_text": "Score : 100 points\n\nProblem Statement\n\nIt is September 9 in Japan now.\n\nYou are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?\n\nConstraints\n\n10≤N≤99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf 9 is contained in the decimal notation of N, print Yes; if not, print No.\n\nSample Input 1\n\n29\n\nSample Output 1\n\nYes\n\nThe one's digit of 29 is 9.\n\nSample Input 2\n\n72\n\nSample Output 2\n\nNo\n\n72 does not contain 9.\n\nSample Input 3\n\n91\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1824, "cpu_time_ms": 70, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s767425801", "group_id": "codeNet:p03607", "input_text": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n Set set = new HashSet();\n for(int i = 0; i < N; i++){\n int A = sc.nextInt();\n if(set.contains(A)){\n set.remove(A);\n }else{\n set.add(A);\n }\n }\n System.out.println(set.size());\n \n }\n}\n", "language": "Java", "metadata": {"date": 1598972711, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03607.html", "problem_id": "p03607", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03607/input.txt", "sample_output_relpath": "derived/input_output/data/p03607/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03607/Java/s767425801.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s767425801", "user_id": "u918923596"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n Set set = new HashSet();\n for(int i = 0; i < N; i++){\n int A = sc.nextInt();\n if(set.contains(A)){\n set.remove(A);\n }else{\n set.add(A);\n }\n }\n System.out.println(set.size());\n \n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are playing the following game with Joisino.\n\nInitially, you have a blank sheet of paper.\n\nJoisino announces a number. If that number is written on the sheet, erase the number from the sheet; if not, write the number on the sheet. This process is repeated N times.\n\nThen, you are asked a question: How many numbers are written on the sheet now?\n\nThe numbers announced by Joisino are given as A_1, ... ,A_N in the order she announces them. How many numbers will be written on the sheet at the end of the game?\n\nConstraints\n\n1≤N≤100000\n\n1≤A_i≤1000000000(=10^9)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint how many numbers will be written on the sheet at the end of the game.\n\nSample Input 1\n\n3\n6\n2\n6\n\nSample Output 1\n\n1\n\nThe game proceeds as follows:\n\n6 is not written on the sheet, so write 6.\n\n2 is not written on the sheet, so write 2.\n\n6 is written on the sheet, so erase 6.\n\nThus, the sheet contains only 2 in the end. The answer is 1.\n\nSample Input 2\n\n4\n2\n5\n5\n2\n\nSample Output 2\n\n0\n\nIt is possible that no number is written on the sheet in the end.\n\nSample Input 3\n\n6\n12\n22\n16\n22\n18\n12\n\nSample Output 3\n\n2", "sample_input": "3\n6\n2\n6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03607", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are playing the following game with Joisino.\n\nInitially, you have a blank sheet of paper.\n\nJoisino announces a number. If that number is written on the sheet, erase the number from the sheet; if not, write the number on the sheet. This process is repeated N times.\n\nThen, you are asked a question: How many numbers are written on the sheet now?\n\nThe numbers announced by Joisino are given as A_1, ... ,A_N in the order she announces them. How many numbers will be written on the sheet at the end of the game?\n\nConstraints\n\n1≤N≤100000\n\n1≤A_i≤1000000000(=10^9)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint how many numbers will be written on the sheet at the end of the game.\n\nSample Input 1\n\n3\n6\n2\n6\n\nSample Output 1\n\n1\n\nThe game proceeds as follows:\n\n6 is not written on the sheet, so write 6.\n\n2 is not written on the sheet, so write 2.\n\n6 is written on the sheet, so erase 6.\n\nThus, the sheet contains only 2 in the end. The answer is 1.\n\nSample Input 2\n\n4\n2\n5\n5\n2\n\nSample Output 2\n\n0\n\nIt is possible that no number is written on the sheet in the end.\n\nSample Input 3\n\n6\n12\n22\n16\n22\n18\n12\n\nSample Output 3\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 416, "cpu_time_ms": 515, "memory_kb": 61596}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s796535583", "group_id": "codeNet:p03609", "input_text": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.TreeSet;\n\nimport org.omg.Messaging.SyncScopeHelper;\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args){\n\t\tnew Main();\n\t}\n\tpublic Main(){\n\t\tnew Test_100().doIt();\n\t}\n\tclass Test_100{\n\t\tvoid doIt() {\n\t\t\tint X = sc.nextInt();\n\t\t\tint T = sc.nextInt();\n\t\t\tint ans = X - T;\n\t\t\tif(ans < 0)System.out.println(0);\n\t\t\telse System.out.println(ans);\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1553138614, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03609.html", "problem_id": "p03609", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03609/input.txt", "sample_output_relpath": "derived/input_output/data/p03609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03609/Java/s796535583.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s796535583", "user_id": "u138301705"}, "prompt_components": {"gold_output": "83\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.TreeSet;\n\nimport org.omg.Messaging.SyncScopeHelper;\n\npublic class Main {\n\tScanner sc = new Scanner(System.in);\n\tpublic static void main(String[] args){\n\t\tnew Main();\n\t}\n\tpublic Main(){\n\t\tnew Test_100().doIt();\n\t}\n\tclass Test_100{\n\t\tvoid doIt() {\n\t\t\tint X = sc.nextInt();\n\t\t\tint T = sc.nextInt();\n\t\t\tint ans = X - T;\n\t\t\tif(ans < 0)System.out.println(0);\n\t\t\telse System.out.println(ans);\n\t\t}\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "sample_input": "100 17\n"}, "reference_outputs": ["83\n"], "source_document_id": "p03609", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 553, "cpu_time_ms": 95, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s018888071", "group_id": "codeNet:p03609", "input_text": "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint t = sc.nextInt();\n\t\t\n\t\tif (X-t > 0) System.out.println(X-t);\n\t\telse if (X-t <= 0) System.out.println(\"0\");\n\t}\n}\n", "language": "Java", "metadata": {"date": 1528566490, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03609.html", "problem_id": "p03609", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03609/input.txt", "sample_output_relpath": "derived/input_output/data/p03609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03609/Java/s018888071.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s018888071", "user_id": "u102547855"}, "prompt_components": {"gold_output": "83\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint X = sc.nextInt();\n\t\tint t = sc.nextInt();\n\t\t\n\t\tif (X-t > 0) System.out.println(X-t);\n\t\telse if (X-t <= 0) System.out.println(\"0\");\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "sample_input": "100 17\n"}, "reference_outputs": ["83\n"], "source_document_id": "p03609", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 269, "cpu_time_ms": 96, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s862781684", "group_id": "codeNet:p03609", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n boolean eof;\n final long MOD = 1000L * 1000L * 1000L + 7;\n\n void solveA() throws IOException {\n int x = nextInt();\n int t = nextInt();\n outln(Math.max(0, x - t));\n }\n void solveB() throws IOException {\n\n\n\n }\n void solveC() throws IOException {\n\n\n\n }\n void solveD() throws IOException {\n\n\n\n }\n\n void shuffle(int[] a) {\n int n = a.length;\n for(int i = 0; i < n; i++) {\n int r = i + (int) (Math.random() * (n - i));\n int tmp = a[i];\n a[i] = a[r];\n a[r] = tmp;\n }\n }\n private void outln(Object o) {\n out.println(o);\n }\n private void out(Object o) {\n out.print(o);\n }\n public Main() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n\n solveA();\n\n out.close();\n }\n public static void main(String[] args) throws IOException {\n new Main();\n }\n\n public long[] nextLongArr(int n) throws IOException{\n long[] res = new long[n];\n for(int i = 0; i < n; i++)\n res[i] = nextLong();\n return res;\n }\n public int[] nextIntArr(int n) throws IOException {\n int[] res = new int[n];\n for(int i = 0; i < n; i++)\n res[i] = nextInt();\n return res;\n }\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return null;\n }\n }\n return st.nextToken();\n }\n public String nextString() {\n try {\n return br.readLine();\n } catch (IOException e) {\n eof = true;\n return null;\n }\n }\n public int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n public long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n public double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n}", "language": "Java", "metadata": {"date": 1504400555, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03609.html", "problem_id": "p03609", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03609/input.txt", "sample_output_relpath": "derived/input_output/data/p03609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03609/Java/s862781684.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s862781684", "user_id": "u497372370"}, "prompt_components": {"gold_output": "83\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\n BufferedReader br;\n PrintWriter out;\n StringTokenizer st;\n boolean eof;\n final long MOD = 1000L * 1000L * 1000L + 7;\n\n void solveA() throws IOException {\n int x = nextInt();\n int t = nextInt();\n outln(Math.max(0, x - t));\n }\n void solveB() throws IOException {\n\n\n\n }\n void solveC() throws IOException {\n\n\n\n }\n void solveD() throws IOException {\n\n\n\n }\n\n void shuffle(int[] a) {\n int n = a.length;\n for(int i = 0; i < n; i++) {\n int r = i + (int) (Math.random() * (n - i));\n int tmp = a[i];\n a[i] = a[r];\n a[r] = tmp;\n }\n }\n private void outln(Object o) {\n out.println(o);\n }\n private void out(Object o) {\n out.print(o);\n }\n public Main() throws IOException {\n br = new BufferedReader(new InputStreamReader(System.in));\n out = new PrintWriter(System.out);\n\n solveA();\n\n out.close();\n }\n public static void main(String[] args) throws IOException {\n new Main();\n }\n\n public long[] nextLongArr(int n) throws IOException{\n long[] res = new long[n];\n for(int i = 0; i < n; i++)\n res[i] = nextLong();\n return res;\n }\n public int[] nextIntArr(int n) throws IOException {\n int[] res = new int[n];\n for(int i = 0; i < n; i++)\n res[i] = nextInt();\n return res;\n }\n public String nextToken() {\n while (st == null || !st.hasMoreTokens()) {\n try {\n st = new StringTokenizer(br.readLine());\n } catch (Exception e) {\n eof = true;\n return null;\n }\n }\n return st.nextToken();\n }\n public String nextString() {\n try {\n return br.readLine();\n } catch (IOException e) {\n eof = true;\n return null;\n }\n }\n public int nextInt() throws IOException {\n return Integer.parseInt(nextToken());\n }\n public long nextLong() throws IOException {\n return Long.parseLong(nextToken());\n }\n public double nextDouble() throws IOException {\n return Double.parseDouble(nextToken());\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "sample_input": "100 17\n"}, "reference_outputs": ["83\n"], "source_document_id": "p03609", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2406, "cpu_time_ms": 68, "memory_kb": 21076}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s704911261", "group_id": "codeNet:p03611", "input_text": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\t\n\tpublic static void main (String[] args) {\n\t InputReader in = new InputReader(System.in);\n\t int n = in.readInt();\n\t int arr[] = new int[100003];\n\t for(int i = 0; i= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n\n\tpublic long readLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9') {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\t\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic String next() {\n\t\treturn readString();\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1587757696, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03611.html", "problem_id": "p03611", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03611/input.txt", "sample_output_relpath": "derived/input_output/data/p03611/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03611/Java/s704911261.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s704911261", "user_id": "u686751625"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\n\npublic class Main {\n\t\n\tpublic static void main (String[] args) {\n\t InputReader in = new InputReader(System.in);\n\t int n = in.readInt();\n\t int arr[] = new int[100003];\n\t for(int i = 0; i= numChars) {\n\t\t\tcurChar = 0;\n\t\t\ttry {\n\t\t\t\tnumChars = stream.read(buf);\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tif (numChars <= 0)\n\t\t\t\treturn -1;\n\t\t}\n\t\treturn buf[curChar++];\n\t}\n\n\tpublic int readInt() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tint res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9')\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\n\tpublic String readString() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c))\n\t\t\tc = read();\n\t\tStringBuilder res = new StringBuilder();\n\t\tdo {\n\t\t\tres.appendCodePoint(c);\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res.toString();\n\t}\n\n\tpublic long readLong() {\n\t\tint c = read();\n\t\twhile (isSpaceChar(c)) {\n\t\t\tc = read();\n\t\t}\n\t\tint sgn = 1;\n\t\tif (c == '-') {\n\t\t\tsgn = -1;\n\t\t\tc = read();\n\t\t}\n\t\tlong res = 0;\n\t\tdo {\n\t\t\tif (c < '0' || c > '9') {\n\t\t\t\tthrow new InputMismatchException();\n\t\t\t}\n\t\t\tres *= 10;\n\t\t\tres += c - '0';\n\t\t\tc = read();\n\t\t} while (!isSpaceChar(c));\n\t\treturn res * sgn;\n\t}\n\t\n\tpublic boolean isSpaceChar(int c) {\n\t\tif (filter != null)\n\t\t\treturn filter.isSpaceChar(c);\n\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t}\n\n\tpublic String next() {\n\t\treturn readString();\n\t}\n\n\tpublic interface SpaceCharFilter {\n\t\tpublic boolean isSpaceChar(int ch);\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "sample_input": "7\n3 1 4 1 5 9 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03611", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2238, "cpu_time_ms": 97, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s580430839", "group_id": "codeNet:p03612", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint arr[] = new int [n+1]; \n\t\tboolean flag = false;\n\t\tfor(int i=1 ; i <= n ; i++){\n\t\t\tarr[i] = scanner.nextInt();\n\t\t}\n\t\tint count = 0;\n\t\tint i = 1;\n\t\t\n\t\twhile(flag == false){\n\t\t\tif(i == n+1){\n\t\t\t\ti=1;\n\t\t\t}\n\t\t\tif(arr[i] == i){\n\t\t\t\tif(i!=n){\n\t\t\t\t\tint temp = arr[i];\n\t\t\t\t\tarr[i] = arr[i+1];\n\t\t\t\t\tarr[i+1] = temp;\n\t\t\t\t\ti++;\n\t\t\t\t\tcount ++;\n\t\t\t\t}else{\n\t\t\t\t\tint temp = arr[i];\n\t\t\t\t\tarr[i] = arr[i-1];\n\t\t\t\t\tarr[i-1] = temp;\n\t\t\t\t\ti++;\n\t\t\t\t\tcount ++;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\ti++;\n\t\t\t}\n\t\t\t\n\t\t\tif(i == n+1){\n\t\t\t\tfor(int j=1 ; j<=n ; j++){\n\t\t\t\t\tif(arr[j] == j){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(j == n) flag = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\tfor(int j = 1 ; j<=n ; j++){\n\t\t\tSystem.out.print(arr[j]+\" \");\n\t\t}\n\t\tSystem.out.println();\n\t\tSystem.out.println(count);\n\t\t\n\t}\n}\n", "language": "Java", "metadata": {"date": 1578948003, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03612.html", "problem_id": "p03612", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03612/input.txt", "sample_output_relpath": "derived/input_output/data/p03612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03612/Java/s580430839.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s580430839", "user_id": "u353919145"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String args[]){\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint n = scanner.nextInt();\n\t\tint arr[] = new int [n+1]; \n\t\tboolean flag = false;\n\t\tfor(int i=1 ; i <= n ; i++){\n\t\t\tarr[i] = scanner.nextInt();\n\t\t}\n\t\tint count = 0;\n\t\tint i = 1;\n\t\t\n\t\twhile(flag == false){\n\t\t\tif(i == n+1){\n\t\t\t\ti=1;\n\t\t\t}\n\t\t\tif(arr[i] == i){\n\t\t\t\tif(i!=n){\n\t\t\t\t\tint temp = arr[i];\n\t\t\t\t\tarr[i] = arr[i+1];\n\t\t\t\t\tarr[i+1] = temp;\n\t\t\t\t\ti++;\n\t\t\t\t\tcount ++;\n\t\t\t\t}else{\n\t\t\t\t\tint temp = arr[i];\n\t\t\t\t\tarr[i] = arr[i-1];\n\t\t\t\t\tarr[i-1] = temp;\n\t\t\t\t\ti++;\n\t\t\t\t\tcount ++;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\ti++;\n\t\t\t}\n\t\t\t\n\t\t\tif(i == n+1){\n\t\t\t\tfor(int j=1 ; j<=n ; j++){\n\t\t\t\t\tif(arr[j] == j){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif(j == n) flag = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\tfor(int j = 1 ; j<=n ; j++){\n\t\t\tSystem.out.print(arr[j]+\" \");\n\t\t}\n\t\tSystem.out.println();\n\t\tSystem.out.println(count);\n\t\t\n\t}\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N.\nYou can perform the following operation any number of times (possibly zero):\n\nOperation: Swap two adjacent elements in the permutation.\n\nYou want to have p_i ≠ i for all 1≤i≤N.\nFind the minimum required number of operations to achieve this.\n\nConstraints\n\n2≤N≤10^5\n\np_1,p_2,..,p_N is a permutation of 1,2,..,N.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\np_1 p_2 .. p_N\n\nOutput\n\nPrint the minimum required number of operations\n\nSample Input 1\n\n5\n1 4 3 5 2\n\nSample Output 1\n\n2\n\nSwap 1 and 4, then swap 1 and 3. p is now 4,3,1,5,2 and satisfies the condition.\nThis is the minimum possible number, so the answer is 2.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n1\n\nSwapping 1 and 2 satisfies the condition.\n\nSample Input 3\n\n2\n2 1\n\nSample Output 3\n\n0\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n9\n1 2 4 9 5 8 7 3 6\n\nSample Output 4\n\n3", "sample_input": "5\n1 4 3 5 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03612", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N.\nYou can perform the following operation any number of times (possibly zero):\n\nOperation: Swap two adjacent elements in the permutation.\n\nYou want to have p_i ≠ i for all 1≤i≤N.\nFind the minimum required number of operations to achieve this.\n\nConstraints\n\n2≤N≤10^5\n\np_1,p_2,..,p_N is a permutation of 1,2,..,N.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\np_1 p_2 .. p_N\n\nOutput\n\nPrint the minimum required number of operations\n\nSample Input 1\n\n5\n1 4 3 5 2\n\nSample Output 1\n\n2\n\nSwap 1 and 4, then swap 1 and 3. p is now 4,3,1,5,2 and satisfies the condition.\nThis is the minimum possible number, so the answer is 2.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n1\n\nSwapping 1 and 2 satisfies the condition.\n\nSample Input 3\n\n2\n2 1\n\nSample Output 3\n\n0\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n9\n1 2 4 9 5 8 7 3 6\n\nSample Output 4\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 907, "cpu_time_ms": 826, "memory_kb": 62876}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s347949202", "group_id": "codeNet:p03617", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint q = sc.nextInt();\n\t\tint h = sc.nextInt();\n\t\tint s = sc.nextInt();\n\t\tint d = sc.nextInt();\n\t\tint n = sc.nextInt();\n\t\tint min = Math.min(4 * q, h * 2);\n\t\tmin = Math.min(min, s);\n\t\tlong sum = 0;\n\t\tif (min * 2 > d) {\n\t\t\tif (n >= 2) {\n\t\t\t\tsum = (long) min * n / 2;\n\t\t\t}\n\t\t\tsum += (n % 2) * min;\n\t\t} else {\n\t\t\tsum = (long) min * n;\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1566402251, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03617.html", "problem_id": "p03617", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03617/input.txt", "sample_output_relpath": "derived/input_output/data/p03617/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03617/Java/s347949202.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s347949202", "user_id": "u275174880"}, "prompt_components": {"gold_output": "150\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint q = sc.nextInt();\n\t\tint h = sc.nextInt();\n\t\tint s = sc.nextInt();\n\t\tint d = sc.nextInt();\n\t\tint n = sc.nextInt();\n\t\tint min = Math.min(4 * q, h * 2);\n\t\tmin = Math.min(min, s);\n\t\tlong sum = 0;\n\t\tif (min * 2 > d) {\n\t\t\tif (n >= 2) {\n\t\t\t\tsum = (long) min * n / 2;\n\t\t\t}\n\t\t\tsum += (n % 2) * min;\n\t\t} else {\n\t\t\tsum = (long) min * n;\n\t\t}\n\t\tSystem.out.println(sum);\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou've come to your favorite store Infinitesco to buy some ice tea.\n\nThe store sells ice tea in bottles of different volumes at different costs.\nSpecifically, a 0.25-liter bottle costs Q yen, a 0.5-liter bottle costs H yen, a 1-liter bottle costs S yen, and a 2-liter bottle costs D yen.\nThe store has an infinite supply of bottles of each type.\n\nYou want to buy exactly N liters of ice tea. How many yen do you have to spend?\n\nConstraints\n\n1 \\leq Q, H, S, D \\leq 10^8\n\n1 \\leq N \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ H S D\nN\n\nOutput\n\nPrint the smallest number of yen you have to spend to buy exactly N liters of ice tea.\n\nSample Input 1\n\n20 30 70 90\n3\n\nSample Output 1\n\n150\n\nBuy one 2-liter bottle and two 0.5-liter bottles. You'll get 3 liters for 90 + 30 + 30 = 150 yen.\n\nSample Input 2\n\n10000 1000 100 10\n1\n\nSample Output 2\n\n100\n\nEven though a 2-liter bottle costs just 10 yen, you need only 1 liter.\nThus, you have to buy a 1-liter bottle for 100 yen.\n\nSample Input 3\n\n10 100 1000 10000\n1\n\nSample Output 3\n\n40\n\nNow it's better to buy four 0.25-liter bottles for 10 + 10 + 10 + 10 = 40 yen.\n\nSample Input 4\n\n12345678 87654321 12345678 87654321\n123456789\n\nSample Output 4\n\n1524157763907942", "sample_input": "20 30 70 90\n3\n"}, "reference_outputs": ["150\n"], "source_document_id": "p03617", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou've come to your favorite store Infinitesco to buy some ice tea.\n\nThe store sells ice tea in bottles of different volumes at different costs.\nSpecifically, a 0.25-liter bottle costs Q yen, a 0.5-liter bottle costs H yen, a 1-liter bottle costs S yen, and a 2-liter bottle costs D yen.\nThe store has an infinite supply of bottles of each type.\n\nYou want to buy exactly N liters of ice tea. How many yen do you have to spend?\n\nConstraints\n\n1 \\leq Q, H, S, D \\leq 10^8\n\n1 \\leq N \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ H S D\nN\n\nOutput\n\nPrint the smallest number of yen you have to spend to buy exactly N liters of ice tea.\n\nSample Input 1\n\n20 30 70 90\n3\n\nSample Output 1\n\n150\n\nBuy one 2-liter bottle and two 0.5-liter bottles. You'll get 3 liters for 90 + 30 + 30 = 150 yen.\n\nSample Input 2\n\n10000 1000 100 10\n1\n\nSample Output 2\n\n100\n\nEven though a 2-liter bottle costs just 10 yen, you need only 1 liter.\nThus, you have to buy a 1-liter bottle for 100 yen.\n\nSample Input 3\n\n10 100 1000 10000\n1\n\nSample Output 3\n\n40\n\nNow it's better to buy four 0.25-liter bottles for 10 + 10 + 10 + 10 = 40 yen.\n\nSample Input 4\n\n12345678 87654321 12345678 87654321\n123456789\n\nSample Output 4\n\n1524157763907942", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 538, "cpu_time_ms": 98, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s022428798", "group_id": "codeNet:p03623", "input_text": "import java.util.*;\n\nclass Main {\npublic static void main(String[] args){\n\nScanner sc = new Scanner(System.in);\nint x = sc.nextInt();\nint a = sc.nextInt();\nint b = sc.nextInt();\nint A = x - a;\nif(A < 0){\n A *= -1;\n}\nint B = x - b;\nif(B < 0){\n B *= -1;\n}\nif(A < B){\n System.out.println(\"B\");\n}else{\n System.out.println(\"A\");\n}\n\n}\n}", "language": "Java", "metadata": {"date": 1575478308, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03623.html", "problem_id": "p03623", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03623/input.txt", "sample_output_relpath": "derived/input_output/data/p03623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03623/Java/s022428798.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s022428798", "user_id": "u806768852"}, "prompt_components": {"gold_output": "B\n", "input_to_evaluate": "import java.util.*;\n\nclass Main {\npublic static void main(String[] args){\n\nScanner sc = new Scanner(System.in);\nint x = sc.nextInt();\nint a = sc.nextInt();\nint b = sc.nextInt();\nint A = x - a;\nif(A < 0){\n A *= -1;\n}\nint B = x - b;\nif(B < 0){\n B *= -1;\n}\nif(A < B){\n System.out.println(\"B\");\n}else{\n System.out.println(\"A\");\n}\n\n}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke lives at position x on a number line.\nOn this line, there are two stores A and B, respectively at position a and b, that offer food for delivery.\n\nSnuke decided to get food delivery from the closer of stores A and B.\nFind out which store is closer to Snuke's residence.\n\nHere, the distance between two points s and t on a number line is represented by |s-t|.\n\nConstraints\n\n1 \\leq x \\leq 1000\n\n1 \\leq a \\leq 1000\n\n1 \\leq b \\leq 1000\n\nx, a and b are pairwise distinct.\n\nThe distances between Snuke's residence and stores A and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx a b\n\nOutput\n\nIf store A is closer, print A; if store B is closer, print B.\n\nSample Input 1\n\n5 2 7\n\nSample Output 1\n\nB\n\nThe distances between Snuke's residence and stores A and B are 3 and 2, respectively.\nSince store B is closer, print B.\n\nSample Input 2\n\n1 999 1000\n\nSample Output 2\n\nA", "sample_input": "5 2 7\n"}, "reference_outputs": ["B\n"], "source_document_id": "p03623", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke lives at position x on a number line.\nOn this line, there are two stores A and B, respectively at position a and b, that offer food for delivery.\n\nSnuke decided to get food delivery from the closer of stores A and B.\nFind out which store is closer to Snuke's residence.\n\nHere, the distance between two points s and t on a number line is represented by |s-t|.\n\nConstraints\n\n1 \\leq x \\leq 1000\n\n1 \\leq a \\leq 1000\n\n1 \\leq b \\leq 1000\n\nx, a and b are pairwise distinct.\n\nThe distances between Snuke's residence and stores A and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx a b\n\nOutput\n\nIf store A is closer, print A; if store B is closer, print B.\n\nSample Input 1\n\n5 2 7\n\nSample Output 1\n\nB\n\nThe distances between Snuke's residence and stores A and B are 3 and 2, respectively.\nSince store B is closer, print B.\n\nSample Input 2\n\n1 999 1000\n\nSample Output 2\n\nA", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 338, "cpu_time_ms": 94, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s472001531", "group_id": "codeNet:p03625", "input_text": "\nimport static java.util.Arrays.sort;\nimport java.util.Scanner;\n\n/**\n *\n * @author cs18097\n */\npublic class Main {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n // TODO code application logic here\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] ary = new int[n];\n for(int i = 0;i < n;i++){\n ary[i] = sc.nextInt();\n }\n sort(ary);\n int max = ary[n-1];\n int min = 0;\n int flag = 0;\n OUTER:\n for (int i = n-2; i > 0; i--) {\n switch (flag) {\n case 0:\n {\n int tmp = max;\n max = ary[i];\n if(max == tmp){\n flag++;\n } break;\n }\n case 1:\n if(max == ary[i])continue;\n min = ary[i];\n flag++;\n break;\n default:\n {\n int tmp = min;\n min = ary[i];\n if (min == tmp) {\n break OUTER;\n }\n break;\n }\n }\n }\n long ans = max*min;\n System.out.print(ans);\n }\n \n}\n", "language": "Java", "metadata": {"date": 1574988281, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03625.html", "problem_id": "p03625", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03625/input.txt", "sample_output_relpath": "derived/input_output/data/p03625/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03625/Java/s472001531.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s472001531", "user_id": "u794927332"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nimport static java.util.Arrays.sort;\nimport java.util.Scanner;\n\n/**\n *\n * @author cs18097\n */\npublic class Main {\n\n /**\n * @param args the command line arguments\n */\n public static void main(String[] args) {\n // TODO code application logic here\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] ary = new int[n];\n for(int i = 0;i < n;i++){\n ary[i] = sc.nextInt();\n }\n sort(ary);\n int max = ary[n-1];\n int min = 0;\n int flag = 0;\n OUTER:\n for (int i = n-2; i > 0; i--) {\n switch (flag) {\n case 0:\n {\n int tmp = max;\n max = ary[i];\n if(max == tmp){\n flag++;\n } break;\n }\n case 1:\n if(max == ary[i])continue;\n min = ary[i];\n flag++;\n break;\n default:\n {\n int tmp = min;\n min = ary[i];\n if (min == tmp) {\n break OUTER;\n }\n break;\n }\n }\n }\n long ans = max*min;\n System.out.print(ans);\n }\n \n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03625", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1428, "cpu_time_ms": 485, "memory_kb": 52872}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s575633029", "group_id": "codeNet:p03627", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = Integer.parseInt(sc.next());\n\n\t\tint[] A = new int[N+1];\n\t\tfor(int i =1; i < N+1; i++) {\n\t\t\tA[i] = Integer.parseInt(sc.next());\n\t\t}\n\t\tsc.close();\n\n\t\tArrays.sort(A);\n\n//\t\tint max = 0;\n//\t\tfor(int i = 1; i 0; i--) {\n\t\t\tif(A[i] == prev) {\n\t\t\t\tans *= prev;\n\t\t\t\tcount ++;\n\t\t\t\tprev = 0;\n\t\t\t}else {\n\t\t\t\tprev = A[i];\n\t\t\t}\n\t\t\tif(count == 2) {\n\t\t\t\tSystem.out.println(ans);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(count != 2) System.out.println(0);\n\n//\t\tint l1 = 0, l2 = 0;\n//\t\tfor(int i = numbers.length-1; i > 0; i-- ) {\n//\t\t\tif(numbers[i] >= 4 && l1 == 0) {\n//\t\t\t\tl1 = i;\n//\t\t\t\tbreak;\n//\t\t\t}else if(numbers[i] >= 2 && l1 == 0) {\n//\t\t\t\tl1 = i;\n//\t\t\t}else if(numbers[i] >= 2 && l1 != 0) {\n//\t\t\t\tl2 = i;\n//\t\t\t\tbreak;\n//\t\t\t}\n//\t\t}\n\n//\t\tif(l1 != 0 && l2 != 0) {\n//\t\t\tSystem.out.println(l1 * l2);\n//\t\t}else if(l1 != 0 && l2 == 0) {\n//\t\t\tSystem.out.println(l1 * l1);\n//\t\t}else {\n//\t\t\tSystem.out.println(0);\n//\t\t}\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1503292246, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03627.html", "problem_id": "p03627", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03627/input.txt", "sample_output_relpath": "derived/input_output/data/p03627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03627/Java/s575633029.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s575633029", "user_id": "u425032732"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = Integer.parseInt(sc.next());\n\n\t\tint[] A = new int[N+1];\n\t\tfor(int i =1; i < N+1; i++) {\n\t\t\tA[i] = Integer.parseInt(sc.next());\n\t\t}\n\t\tsc.close();\n\n\t\tArrays.sort(A);\n\n//\t\tint max = 0;\n//\t\tfor(int i = 1; i 0; i--) {\n\t\t\tif(A[i] == prev) {\n\t\t\t\tans *= prev;\n\t\t\t\tcount ++;\n\t\t\t\tprev = 0;\n\t\t\t}else {\n\t\t\t\tprev = A[i];\n\t\t\t}\n\t\t\tif(count == 2) {\n\t\t\t\tSystem.out.println(ans);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(count != 2) System.out.println(0);\n\n//\t\tint l1 = 0, l2 = 0;\n//\t\tfor(int i = numbers.length-1; i > 0; i-- ) {\n//\t\t\tif(numbers[i] >= 4 && l1 == 0) {\n//\t\t\t\tl1 = i;\n//\t\t\t\tbreak;\n//\t\t\t}else if(numbers[i] >= 2 && l1 == 0) {\n//\t\t\t\tl1 = i;\n//\t\t\t}else if(numbers[i] >= 2 && l1 != 0) {\n//\t\t\t\tl2 = i;\n//\t\t\t\tbreak;\n//\t\t\t}\n//\t\t}\n\n//\t\tif(l1 != 0 && l2 != 0) {\n//\t\t\tSystem.out.println(l1 * l2);\n//\t\t}else if(l1 != 0 && l2 == 0) {\n//\t\t\tSystem.out.println(l1 * l1);\n//\t\t}else {\n//\t\t\tSystem.out.println(0);\n//\t\t}\n\n\t}\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03627", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1301, "cpu_time_ms": 420, "memory_kb": 47288}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s349131236", "group_id": "codeNet:p03633", "input_text": "import java.math.BigInteger;\nimport java.util.*;\n\nclass Main{\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] t = new long[n];\n for(int i = 0; i < n; i++){\n t[i] = sc.nextLong();\n }\n long ans = lcm(t[0], t[1]);\n\n for(int i = 2; i < n; i++){\n ans = lcm(ans,t[i]);\n }\n System.out.println(ans);\n }\n\n static long lcm(long a, long b){\n BigInteger b1 = BigInteger.valueOf(a);\n BigInteger b2 = BigInteger.valueOf(b);\n return a / b1.gcd(b2).longValue() * b;\n }\n}", "language": "Java", "metadata": {"date": 1528915336, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03633.html", "problem_id": "p03633", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03633/input.txt", "sample_output_relpath": "derived/input_output/data/p03633/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03633/Java/s349131236.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s349131236", "user_id": "u593227551"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.math.BigInteger;\nimport java.util.*;\n\nclass Main{\n public static void main(String args[]) {\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n long[] t = new long[n];\n for(int i = 0; i < n; i++){\n t[i] = sc.nextLong();\n }\n long ans = lcm(t[0], t[1]);\n\n for(int i = 2; i < n; i++){\n ans = lcm(ans,t[i]);\n }\n System.out.println(ans);\n }\n\n static long lcm(long a, long b){\n BigInteger b1 = BigInteger.valueOf(a);\n BigInteger b2 = BigInteger.valueOf(b);\n return a / b1.gcd(b2).longValue() * b;\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.\n\nInitially, the hand of every clock stands still, pointing directly upward.\n\nNow, Dolphin starts all the clocks simultaneously.\n\nIn how many seconds will the hand of every clock point directly upward again?\n\nConstraints\n\n1≤N≤100\n\n1≤T_i≤10^{18}\n\nAll input values are integers.\n\nThe correct answer is at most 10^{18} seconds.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT_1\n:\nT_N\n\nOutput\n\nPrint the number of seconds after which the hand of every clock point directly upward again.\n\nSample Input 1\n\n2\n2\n3\n\nSample Output 1\n\n6\n\nWe have two clocks. The time when the hand of each clock points upward is as follows:\n\nClock 1: 2, 4, 6, ... seconds after the beginning\n\nClock 2: 3, 6, 9, ... seconds after the beginning\n\nTherefore, it takes 6 seconds until the hands of both clocks point directly upward.\n\nSample Input 2\n\n5\n2\n5\n10\n1000000000000000000\n1000000000000000000\n\nSample Output 2\n\n1000000000000000000", "sample_input": "2\n2\n3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03633", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.\n\nInitially, the hand of every clock stands still, pointing directly upward.\n\nNow, Dolphin starts all the clocks simultaneously.\n\nIn how many seconds will the hand of every clock point directly upward again?\n\nConstraints\n\n1≤N≤100\n\n1≤T_i≤10^{18}\n\nAll input values are integers.\n\nThe correct answer is at most 10^{18} seconds.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT_1\n:\nT_N\n\nOutput\n\nPrint the number of seconds after which the hand of every clock point directly upward again.\n\nSample Input 1\n\n2\n2\n3\n\nSample Output 1\n\n6\n\nWe have two clocks. The time when the hand of each clock points upward is as follows:\n\nClock 1: 2, 4, 6, ... seconds after the beginning\n\nClock 2: 3, 6, 9, ... seconds after the beginning\n\nTherefore, it takes 6 seconds until the hands of both clocks point directly upward.\n\nSample Input 2\n\n5\n2\n5\n10\n1000000000000000000\n1000000000000000000\n\nSample Output 2\n\n1000000000000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 636, "cpu_time_ms": 114, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s013061598", "group_id": "codeNet:p03634", "input_text": "\nimport java.io.*;\nimport java.util.*;\npublic class Main{\n\tpublic static void main(String[] args)throws Throwable {\n\t\tMyScanner sc=new MyScanner();\n\t\tPrintWriter pw=new PrintWriter(System.out);\n\t\t\n\t\tn=sc.nextInt();\n\t\tadj=new ArrayList [n];\n\t\tfor(int i=0;i();\n\t\tint [] x=new int [n-1];\n\t\tint [] y=new int [n-1];\n\t\tint [] z=new int [n-1];\n\t\tfor(int i=0;ilevel[y[i]])\n\t\t\t\tcost[x[i]]=z[i];\n\t\t\telse\n\t\t\t\tcost[y[i]]=z[i];\n\t\tdfs2(0);\n\t\tint q=sc.nextInt();\n\t\tk=sc.nextInt()-1;\n\t\twhile(q-->0){\n\t\t\tint u=sc.nextInt()-1;\n\t\t\tint v=sc.nextInt()-1;\n\t\t\tpw.println(min_dis(u, v));\n\t\t}\n\t\t\n\t\tpw.flush();\n\t\tpw.close();\n\t}\n\t\n\tstatic long min_dis(int u,int v){\n\t\tint l=query(u, v);\n\t\tint uk=query(u, k);\n\t\tint vk=query(v, k);\n\t\tint lk=query(l, k);\n\t\tif(lk==l && (uk==k || vk==k))\n\t\t\treturn path_len(u, v, l);\n\t\telse\n\t\t\treturn path_len(u, k, uk)+path_len(v, k, vk);\n\t}\n\t\n\tstatic long path_len(int u,int v,int l){\n\t\treturn cost[u]+cost[v]-2*cost[l];\n\t}\n\t\n\tstatic int n,k;\n\tstatic int [][] ansector;\n\tstatic int [] parent,level;\n\tstatic long [] cost;\n\tstatic ArrayList [] adj;\n\t\n\tstatic void preProcessing(){\n\t\tparent=new int [n];\n\t\tlevel=new int [n];\n\t\tcost=new long [n];\n\t\tparent[0]=-1;\n\t\tdfs(0, 0);\n\t\tint log=(int)Math.ceil(Math.log(n)/Math.log(2));\n\t\tansector=new int [n][log];\n\t\tfor(int [] x : ansector)\n\t\t\tArrays.fill(x, -1);\n\t\tfor(int i=0;i=0;i--)\n\t\t\tif(level[u]-(1<=level[v])\n\t\t\t\tu=ansector[u][i];\n\t\t\n\t\tif(u==v)\n\t\t\treturn u;\n\t\t\n\t\tfor(int i=log;i>=0;i--)\n\t\t\tif(ansector[u][i]!=-1 && ansector[u][i]!=ansector[v][i]){\n\t\t\t\tu=ansector[u][i];\n\t\t\t\tv=ansector[v][i];\n\t\t\t}\n\t\treturn parent[u];\n\t}\n\t\n\tstatic class MyScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\t\tpublic MyScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\t\tString next() {while (st == null || !st.hasMoreElements()) {\n\t\t\ttry {st = new StringTokenizer(br.readLine());}\n\t\t\tcatch (IOException e) {e.printStackTrace();}}\n\t\treturn st.nextToken();}\n\t\tint nextInt() {return Integer.parseInt(next());}\n\t\tlong nextLong() {return Long.parseLong(next());}\n\t\tdouble nextDouble() {return Double.parseDouble(next());}\n\t\tString nextLine(){String str = \"\";\n\t\ttry {str = br.readLine();}\n\t\tcatch (IOException e) {e.printStackTrace();}\n\t\treturn str;}\n\t}\n}", "language": "Java", "metadata": {"date": 1503257697, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03634.html", "problem_id": "p03634", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03634/input.txt", "sample_output_relpath": "derived/input_output/data/p03634/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03634/Java/s013061598.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s013061598", "user_id": "u223401224"}, "prompt_components": {"gold_output": "3\n2\n4\n", "input_to_evaluate": "\nimport java.io.*;\nimport java.util.*;\npublic class Main{\n\tpublic static void main(String[] args)throws Throwable {\n\t\tMyScanner sc=new MyScanner();\n\t\tPrintWriter pw=new PrintWriter(System.out);\n\t\t\n\t\tn=sc.nextInt();\n\t\tadj=new ArrayList [n];\n\t\tfor(int i=0;i();\n\t\tint [] x=new int [n-1];\n\t\tint [] y=new int [n-1];\n\t\tint [] z=new int [n-1];\n\t\tfor(int i=0;ilevel[y[i]])\n\t\t\t\tcost[x[i]]=z[i];\n\t\t\telse\n\t\t\t\tcost[y[i]]=z[i];\n\t\tdfs2(0);\n\t\tint q=sc.nextInt();\n\t\tk=sc.nextInt()-1;\n\t\twhile(q-->0){\n\t\t\tint u=sc.nextInt()-1;\n\t\t\tint v=sc.nextInt()-1;\n\t\t\tpw.println(min_dis(u, v));\n\t\t}\n\t\t\n\t\tpw.flush();\n\t\tpw.close();\n\t}\n\t\n\tstatic long min_dis(int u,int v){\n\t\tint l=query(u, v);\n\t\tint uk=query(u, k);\n\t\tint vk=query(v, k);\n\t\tint lk=query(l, k);\n\t\tif(lk==l && (uk==k || vk==k))\n\t\t\treturn path_len(u, v, l);\n\t\telse\n\t\t\treturn path_len(u, k, uk)+path_len(v, k, vk);\n\t}\n\t\n\tstatic long path_len(int u,int v,int l){\n\t\treturn cost[u]+cost[v]-2*cost[l];\n\t}\n\t\n\tstatic int n,k;\n\tstatic int [][] ansector;\n\tstatic int [] parent,level;\n\tstatic long [] cost;\n\tstatic ArrayList [] adj;\n\t\n\tstatic void preProcessing(){\n\t\tparent=new int [n];\n\t\tlevel=new int [n];\n\t\tcost=new long [n];\n\t\tparent[0]=-1;\n\t\tdfs(0, 0);\n\t\tint log=(int)Math.ceil(Math.log(n)/Math.log(2));\n\t\tansector=new int [n][log];\n\t\tfor(int [] x : ansector)\n\t\t\tArrays.fill(x, -1);\n\t\tfor(int i=0;i=0;i--)\n\t\t\tif(level[u]-(1<=level[v])\n\t\t\t\tu=ansector[u][i];\n\t\t\n\t\tif(u==v)\n\t\t\treturn u;\n\t\t\n\t\tfor(int i=log;i>=0;i--)\n\t\t\tif(ansector[u][i]!=-1 && ansector[u][i]!=ansector[v][i]){\n\t\t\t\tu=ansector[u][i];\n\t\t\t\tv=ansector[v][i];\n\t\t\t}\n\t\treturn parent[u];\n\t}\n\t\n\tstatic class MyScanner {\n\t\tBufferedReader br;\n\t\tStringTokenizer st;\n\t\tpublic MyScanner() {\n\t\t\tbr = new BufferedReader(new InputStreamReader(System.in));\n\t\t}\n\t\tString next() {while (st == null || !st.hasMoreElements()) {\n\t\t\ttry {st = new StringTokenizer(br.readLine());}\n\t\t\tcatch (IOException e) {e.printStackTrace();}}\n\t\treturn st.nextToken();}\n\t\tint nextInt() {return Integer.parseInt(next());}\n\t\tlong nextLong() {return Long.parseLong(next());}\n\t\tdouble nextDouble() {return Double.parseDouble(next());}\n\t\tString nextLine(){String str = \"\";\n\t\ttry {str = br.readLine();}\n\t\tcatch (IOException e) {e.printStackTrace();}\n\t\treturn str;}\n\t}\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "sample_input": "5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n"}, "reference_outputs": ["3\n2\n4\n"], "source_document_id": "p03634", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3074, "cpu_time_ms": 742, "memory_kb": 107584}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s924984262", "group_id": "codeNet:p03635", "input_text": "import java.io.*;\nimport java.util.*;\n\nclass Main{\n\n void solve(){ \n int a = ni();\n int b = ni();\n System.out.println((a - 1) * (b - 1));\n \n }\n\n\n public static void main(String[] args){\n new Main().solve();\n }\n\n private FastScanner scan = new FastScanner();\n private final int MOD = 1_000_000_007;\n private final int INF = 2147483647;\n private final long LINF = 9223372036854775807L;\n private long[] fac;\n private long[] finv;\n private long[] inv;\n\n // Scanner\n int ni(){ return scan.nextInt();}\n int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}\n int[][] ni(int y, int x){int[][] a = new int[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}\n long nl(){return scan.nextLong();}\n long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}\n long[][] nl(int y, int x){long[][] a = new long[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}\n String ns(){return scan.next();}\n String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}\n String[][] ns(int y, int x){String[][] a = new String[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}\n\n // Mathematics\n int max(int a, int b){return Math.max(a, b);}\n long max(long a, long b){return Math.max(a, b);}\n double max(double a, double b){return Math.max(a, b);}\n int max(int[] a){int max = a[0]; for(int value:a){max = max(max,value);} return max;}\n long max(long[] a){long max = a[0]; for(long value:a){max = max(max,value);} return max;}\n double max(double[] a){double max = a[0]; for(double value:a){max = max(max,value);} return max;}\n int min(int a, int b){return Math.min(a, b);}\n long min(long a, long b){return Math.min(a, b);}\n double min(double a, double b){return Math.min(a, b);}\n int min(int[] a){int min = a[0]; for(int value:a){min = min(min,value);} return min;}\n long min(long[] a){long min = a[0]; for(long value:a){min = min(min,value);} return min;}\n double min(double[] a){double min = a[0]; for(double value:a){min = min(min,value);} return min;}\n long sum(int[] a){long sum = 0; for(int value:a){sum += value;} return sum;}\n long sum(long[] a){long sum = 0; for(long value:a){sum += value;} return sum;}\n double sum(double[] a){double sum = 0; for(double value:a){sum += value;} return sum;}\n int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}\n long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}\n int lcm(int a, int b){return a / gcd(a, b) * b;}\n long lcm(long a, long b){return a / gcd(a, b) * b;}\n long fact(int n){ if(n == 0){ return 1; } long a = n; for(long i = n - 1; i >= 2; i--){ a = a % MOD * i; } return a; }\n long fact(long n){ if(n == 0){ return 1; } long a = n; for(long i = n - 1; i >= 2; i--){ a = a % MOD * i; } return a; }\n // nPr(int)\n long npr(int n, int r){\n long a = 1;\n for(int i = n; i > n - r; i--){\n a *= i;\n }\n return a;\n }\n // nPr(long)\n long npr(long n, long r){\n long a = 1;\n for(long i = n; i > n - r; i--){\n a *= i;\n }\n return a;\n }\n // 素数判定(int)\n boolean checkPrime(int n){\n for(int i = 2; i * i <= n; i++){\n if(n % i == 0){\n return false;\n }\n }\n return true;\n }\n // 素数判定(long)\n boolean checkPrime(long n){\n for(long i = 2; i * i <= n; i++){\n if(n % i == 0){\n return false;\n }\n }\n return true;\n }\n // エラトステネスの篩\n List erathos(int n){\n boolean[] flag = new boolean[n + 1];\n List nums = new ArrayList<>();\n for(int i = 2; i <= n; i++){\n if(flag[i]) continue;\n nums.add(i);\n for(int j = i * 2; j <= n; j += i){\n flag[j] = true;\n }\n }\n\n return nums;\n }\n\n // mod pにおける累乗 a^n\n long modpow(long a, long n, long p){\n long res = 1;\n while(n > 0){\n if((n & 1) == 1){\n res = res * a % p;\n }\n a = a * a % p;\n n = n >> 1;\n }\n return res;\n }\n // mod pにおけるaの逆元a^-1\n long modinv(long a, long p){\n return modpow(a, p - 2, p);\n }\n // fac,finv,invの初期化\n void comInit(int max){\n fac = new long[max];\n finv = new long[max];\n inv = new long[max];\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(int i = 2; i < max; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n // 二項係数nCr\n long com(int n, int r){\n if(n < r || (n < 0 || r < 0)){\n return 0;\n }\n return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;\n }\n // 二項係数nCr（nが10^9など巨大なとき用）\n long ncr(long n, long k){\n long a = 1;\n long b = 1;\n for(int i = 1; i <= k; i++){\n a = a * (n + 1 - i) % MOD;\n b = b * i % MOD;\n }\n \n return modinv(b, MOD) * a % MOD;\n }\n // 二次元上の二点間の距離\n double distance(double x1, double y1, double x2, double y2){\n double dist = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n return dist;\n }\n // 三次元上の二点間の距離\n double distance(double x1, double y1, double z1, double x2, double y2, double z2){\n double dist = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + (z1 - z2) * (z1 - z2));\n return dist;\n }\n\n\n // Array\n void sort(int[] a){ Arrays.sort(a);}\n void sort(long[] a){ Arrays.sort(a);}\n void sort(double[] a){ Arrays.sort(a);}\n void sort(String[] a){ Arrays.sort(a);}\n int[] reverse(int[] a){\n int[] reversed = new int[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n long[] reverse(long[] a){\n long[] reversed = new long[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n double[] reverse(double[] a){\n double[] reversed = new double[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n char[] reverse(char[] a){\n char[] reversed = new char[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n String[] reverse(String[] a){\n String[] reversed = new String[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n boolean[] reverse(boolean[] a){\n boolean[] reversed = new boolean[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n void fill(int[] array, int x) { Arrays.fill(array, x); }\n void fill(long[] array, long x) { Arrays.fill(array, x); }\n void fill(double[] array, double x) { Arrays.fill(array, x); }\n void fill(boolean[] array, boolean x) { Arrays.fill(array, x); }\n void fill(int[][] array, int x) { for(int a[] : array) { fill(a, x); } }\n void fill(long[][] array, long x) { for(long a[] : array) { fill(a, x); } }\n void fill(double[][] array, double x) { for(double a[] : array) { fill(a, x); } }\n void fill(boolean[][] array, boolean x) { for(boolean a[] : array) { fill(a, x); } }\n void fill(int[][][] array, int x) { for(int[][] ary : array) { for(int[] a : ary){ fill(a, x); } } }\n void fill(long[][][] array, long x) { for(long[][] ary : array) { for(long[] a : ary){ fill(a, x); } } }\n\n // Algorithm\n // 深さ優先探索\n /*\n HashMap> graph = new HashMap<>();\n List list;\n */\n void dfs(HashMap> graph, int v, boolean[] seen, int[] friendCount, boolean[][] block){\n seen[v] = true;\n if(!graph.containsKey(v) || graph.get(v).size() == 0) return;\n List todo = graph.get(v);\n for(int next : todo){\n if(seen[next]) continue;\n if(!block[v][next]){\n friendCount[v] += 1;\n friendCount[next] += 1;\n }\n dfs(graph, next, seen, friendCount, block);\n }\n }\n // 幅優先探索\n /*\n HashMap> graph = new HashMap<>();\n List list;\n */\n void bfs(HashMap> graph, int v, int[] dist, int[] friendCount, boolean[][] block){\n Queue que = new ArrayDeque<>();\n que.add(v);\n\n while(que.size() > 0){\n v = que.poll();\n if(!graph.containsKey(v)) continue;\n for(int next : graph.get(v)){\n if(!block[v][next]){\n friendCount[v] += 1;\n friendCount[next] += 1;\n }\n if(dist[next] != -1) continue;\n dist[next] = dist[v] + 1;\n que.add(next);\n }\n }\n }\n \n // ダイクストラ法\n Node[] dijkstra(HashMap> graph, int size, int v, boolean[] flag, int[][] cost, int[] temp, int X){\n Queue queue = new PriorityQueue<>(new MyComparator());\n Node[] nodes = new Node[size];\n int[] hot = new int[size]; // 最後に暑すぎる部屋を出た時刻\n int[] cold = new int[size]; // 最後に寒すぎる部屋を出た時刻\n for(int i = 0; i < size; i++){\n nodes[i] = new Node(i, INF, -1); // id, dist, pastを指定して初期化\n }\n /* for(int key : graph.keySet()){\n nodes[key] = new Node(key, INF, -1); // id, dist, pastを指定して初期化\n } */\n \n nodes[v].dist = 0; // 始点のコストを0に\n try{\n queue.add(nodes[v].clone());\n } catch(CloneNotSupportedException e){\n e.printStackTrace();\n }\n\n while(queue.size() > 0){\n Node now = queue.poll(); // 未確定の中で最もコストの低いノードを取り出す\n //flag[now.id] = true; // 確定\n if(temp[now.id] != 1) flag[now.id] = true;\n if(!graph.containsKey(now.id)) continue;\n for(int next : graph.get(now.id)){ // 辺で繋がっているノードを順にチェック\n if(flag[next] || nodes[next].dist < nodes[now.id].dist + cost[now.id][next]) continue;\n if(Math.abs(temp[now.id] - temp[next]) == 2 && cost[now.id][next] < X) continue;//\n int lastTime = 0; //\n if(temp[next] == 0){\n lastTime = hot[now.id];\n } else if(temp[next] == 2){\n lastTime = cold[now.id];\n }\n if(cost[now.id][next] < X - lastTime){ //\n int min = INF;\n for(int next2 : graph.get(now.id)){\n if(next2 == next || Math.abs(temp[next2] - temp[next]) == 2) continue;\n min = min(min, cost[now.id][next2]);\n }\n if(min == INF) continue;\n min *= 2;\n while(nodes[now.id].dist + cost[now.id][next] + min < X + lastTime){\n min += min;\n }\n if(nodes[next].dist < nodes[now.id].dist + cost[now.id][next] + min) continue;\n nodes[next].dist = nodes[now.id].dist + cost[now.id][next] + min; // distを更新\n nodes[next].past = now.id; // pastを現在のノードに\n hot[next] = hot[now.id] + cost[now.id][next] + min;\n cold[next] = cold[now.id] + cost[now.id][next] + min;\n if(temp[next] == 2) hot[next] = 0;\n if(temp[next] == 0) cold[next] = 0;\n try{\n queue.add(nodes[next].clone());\n } catch (CloneNotSupportedException e){\n e.printStackTrace();\n }\n continue;\n }//\n nodes[next].dist = nodes[now.id].dist + cost[now.id][next]; // distを更新\n nodes[next].past = now.id; // pastを現在のノードに\n hot[next] = hot[now.id] + cost[now.id][next]; //\n cold[next] = cold[now.id] + cost[now.id][next];\n if(temp[next] == 2) hot[next] = 0;\n if(temp[next] == 0) cold[next] = 0; //\n try{\n queue.add(nodes[next].clone());\n } catch (CloneNotSupportedException e){\n e.printStackTrace();\n }\n }\n }\n\n return nodes;\n }\n \n // ソート済みint型配列でkey以上の値の最小indexを返す\n int lowerBound(int[] a, int key){\n int ng = -1;\n int ok = a.length;\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2; \n if(a[mid] >= key){\n ok = mid;\n } else {\n ng = mid;\n }\n }\n return ok;\n }\n // ソート済みlong型配列でkey以上の値の最小indexを返す\n int lowerBound(long[] a, long key){\n int ng = -1;\n int ok = a.length;\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2; \n if(a[mid] >= key){\n ok = mid;\n } else {\n ng = mid;\n }\n }\n return ok;\n }\n // 文字列sとtの最長共通部分列の長さを返す\n int lcs(String s , String t){\n int[][] dp = new int[s.length() + 1][t.length() + 1];\n\n for(int i = 0; i < s.length(); i++){\n for(int j = 0; j < t.length(); j++){\n if(s.charAt(i) == t.charAt(j)){\n dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i + 1][j + 1]);\n }\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i + 1][j]);\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j + 1]);\n }\n }\n\n return dp[s.length()][t.length()];\n }\n\n}\n// ダイクストラ法におけるノード\nclass Node implements Cloneable{\n int id; // ノード番号\n int dist; // 最低必要コスト\n int past; // 直前の頂点\n\n Node(int id, int dist, int past){\n this.id = id;\n this.dist = dist;\n this.past = past;\n }\n @Override\n protected Node clone() throws CloneNotSupportedException{\n Node node = (Node)super.clone();\n return node;\n }\n public String toString(){\n return \"[\" + id + \", \" + dist + \" ,\" + past + \"]\";\n }\n}\n// ダイクストラ法における重み比較のComparator\nclass MyComparator implements Comparator{\n @Override\n public int compare(Node n1, Node n2){\n int dist1 = n1.dist;\n int dist2 = n2.dist;\n if(dist1 < dist2){\n return -1;\n } else if(dist1 > dist2){\n return 1;\n } else {\n return 0;\n }\n }\n}\n// 辺の情報を持つクラス\nclass Edge implements Cloneable{\n int from; // どの頂点から\n int to; // どの頂点へ\n double cost; // 辺の重み\n\n Edge(int from, int to, double cost){\n this.from = from;\n this.to = to;\n this.cost = cost;\n }\n @Override\n protected Edge clone() throws CloneNotSupportedException{\n Edge edge = (Edge)super.clone();\n return edge;\n }\n public String toString(){\n return \"[\" + from + \" to \" + to + \",\" + cost + \"]\";\n }\n}\n// 辺の重み比較のComparator\nclass EdgeComparator implements Comparator{\n @Override\n public int compare(Edge e1, Edge e2){\n double cost1 = e1.cost;\n double cost2 = e2.cost;\n if(cost1 < cost2){\n return -1;\n } else if(cost1 > cost2){\n return 1;\n } else {\n return 0;\n }\n }\n}\n// Union-Find\nclass UnionFind{\n int[] par;\n int[] size;\n UnionFind(int N){\n par = new int[N];\n size = new int[N];\n for(int i = 0; i < N; i++){\n par[i] = i;\n size[i] = 1;\n }\n }\n\n void init(int N){\n for(int i = 0; i < N; i++){\n par[i] = i;\n size[i] = 1;\n }\n }\n\n int root(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = root(par[x]);\n }\n }\n\n boolean same(int x, int y){\n return root(x) == root(y);\n }\n\n void unite(int x, int y){\n x = root(x);\n y = root(y);\n if(x == y) return;\n if(size[x] < size[y]){\n int tmp = x;\n x = y;\n y = tmp;\n }\n size[x] += size[y];\n par[y] = x;\n }\n\n int size(int x){\n return size[root(x)];\n }\n\n}\n\n// 順列を管理する\nclass Permutation {\n private int number;\n private int listSize;\n private int searched;\n private int nextIndex;\n private int[][] permList;\n\n Permutation(int num) {\n this.number = num;\n this.listSize = this.fact(this.number);\n this.searched = 0;\n this.nextIndex = 0;\n this.permList = new int[this.listSize][this.number];\n\n this.create(0, new int[this.number], new boolean[this.number]);\n }\n\n int[] nextPerm() {\n return permList[this.nextIndex++];\n }\n\n boolean isNext() {\n if(this.nextIndex < this.listSize) {\n return true;\n } else {\n this.nextIndex = 0;\n return false;\n }\n }\n\n int fact(int n){\n return n == 0 ? 1 : n * fact(n-1);\n }\n\n void create(int num, int[] list, boolean[] flag) {\n if(num == this.number) {\n copyArray(list, permList[this.searched]);\n this.searched++;\n }\n for(int i = 0; i < this.number; i++){\n if(flag[i]) continue;\n list[num] = i;\n flag[i] = true;\n this.create(num+1, list, flag);\n flag[i] = false;\n\n }\n }\n\n void copyArray(int[] from, int[] to) {\n for(int i=0; i 0){\n i = i >> 1; // 1ビットぶん右シフト\n dat[i] = Math.min(dat[i << 1], dat[(i << 1) + 1]);\n }\n }\n\n public String toString(){\n StringBuilder sb = new StringBuilder(\"[\");\n for(int i = size; i < 2 * size; i++){\n sb.append(dat[i]).append(\",\");\n }\n sb.delete(sb.length() - 1, sb.length());\n String output = sb.append(\"]\").toString();\n return output;\n }\n}\n\n// Range Sum Queryを実現するBinary Indexed Tree\nclass BIT{\n int[] tree;\n\n BIT(int N){\n this.tree = new int[N + 1];\n }\n\n int sum(int i){\n int sum = 0;\n while(i > 0){\n sum += this.tree[i];\n i -= i & -i;\n }\n return sum;\n }\n\n void add(int i, int x){\n while(i <= tree.length){\n this.tree[i] += x;\n i += i & -i;\n }\n }\n\n public String toString(){\n StringBuilder sb = new StringBuilder(\"[\");\n for(int i = 0; i < tree.length; i++){\n sb.append(tree[i] + \",\");\n }\n sb.append(\"]\");\n String output = sb.toString();\n return output;\n }\n \n}\n\n// 標準のScannerより高速に標準入力する\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}", "language": "Java", "metadata": {"date": 1583285935, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03635.html", "problem_id": "p03635", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03635/input.txt", "sample_output_relpath": "derived/input_output/data/p03635/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03635/Java/s924984262.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s924984262", "user_id": "u581625805"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\nclass Main{\n\n void solve(){ \n int a = ni();\n int b = ni();\n System.out.println((a - 1) * (b - 1));\n \n }\n\n\n public static void main(String[] args){\n new Main().solve();\n }\n\n private FastScanner scan = new FastScanner();\n private final int MOD = 1_000_000_007;\n private final int INF = 2147483647;\n private final long LINF = 9223372036854775807L;\n private long[] fac;\n private long[] finv;\n private long[] inv;\n\n // Scanner\n int ni(){ return scan.nextInt();}\n int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}\n int[][] ni(int y, int x){int[][] a = new int[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}\n long nl(){return scan.nextLong();}\n long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}\n long[][] nl(int y, int x){long[][] a = new long[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}\n String ns(){return scan.next();}\n String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}\n String[][] ns(int y, int x){String[][] a = new String[y][x];\n for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}\n\n // Mathematics\n int max(int a, int b){return Math.max(a, b);}\n long max(long a, long b){return Math.max(a, b);}\n double max(double a, double b){return Math.max(a, b);}\n int max(int[] a){int max = a[0]; for(int value:a){max = max(max,value);} return max;}\n long max(long[] a){long max = a[0]; for(long value:a){max = max(max,value);} return max;}\n double max(double[] a){double max = a[0]; for(double value:a){max = max(max,value);} return max;}\n int min(int a, int b){return Math.min(a, b);}\n long min(long a, long b){return Math.min(a, b);}\n double min(double a, double b){return Math.min(a, b);}\n int min(int[] a){int min = a[0]; for(int value:a){min = min(min,value);} return min;}\n long min(long[] a){long min = a[0]; for(long value:a){min = min(min,value);} return min;}\n double min(double[] a){double min = a[0]; for(double value:a){min = min(min,value);} return min;}\n long sum(int[] a){long sum = 0; for(int value:a){sum += value;} return sum;}\n long sum(long[] a){long sum = 0; for(long value:a){sum += value;} return sum;}\n double sum(double[] a){double sum = 0; for(double value:a){sum += value;} return sum;}\n int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}\n long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}\n int lcm(int a, int b){return a / gcd(a, b) * b;}\n long lcm(long a, long b){return a / gcd(a, b) * b;}\n long fact(int n){ if(n == 0){ return 1; } long a = n; for(long i = n - 1; i >= 2; i--){ a = a % MOD * i; } return a; }\n long fact(long n){ if(n == 0){ return 1; } long a = n; for(long i = n - 1; i >= 2; i--){ a = a % MOD * i; } return a; }\n // nPr(int)\n long npr(int n, int r){\n long a = 1;\n for(int i = n; i > n - r; i--){\n a *= i;\n }\n return a;\n }\n // nPr(long)\n long npr(long n, long r){\n long a = 1;\n for(long i = n; i > n - r; i--){\n a *= i;\n }\n return a;\n }\n // 素数判定(int)\n boolean checkPrime(int n){\n for(int i = 2; i * i <= n; i++){\n if(n % i == 0){\n return false;\n }\n }\n return true;\n }\n // 素数判定(long)\n boolean checkPrime(long n){\n for(long i = 2; i * i <= n; i++){\n if(n % i == 0){\n return false;\n }\n }\n return true;\n }\n // エラトステネスの篩\n List erathos(int n){\n boolean[] flag = new boolean[n + 1];\n List nums = new ArrayList<>();\n for(int i = 2; i <= n; i++){\n if(flag[i]) continue;\n nums.add(i);\n for(int j = i * 2; j <= n; j += i){\n flag[j] = true;\n }\n }\n\n return nums;\n }\n\n // mod pにおける累乗 a^n\n long modpow(long a, long n, long p){\n long res = 1;\n while(n > 0){\n if((n & 1) == 1){\n res = res * a % p;\n }\n a = a * a % p;\n n = n >> 1;\n }\n return res;\n }\n // mod pにおけるaの逆元a^-1\n long modinv(long a, long p){\n return modpow(a, p - 2, p);\n }\n // fac,finv,invの初期化\n void comInit(int max){\n fac = new long[max];\n finv = new long[max];\n inv = new long[max];\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(int i = 2; i < max; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n }\n // 二項係数nCr\n long com(int n, int r){\n if(n < r || (n < 0 || r < 0)){\n return 0;\n }\n return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;\n }\n // 二項係数nCr（nが10^9など巨大なとき用）\n long ncr(long n, long k){\n long a = 1;\n long b = 1;\n for(int i = 1; i <= k; i++){\n a = a * (n + 1 - i) % MOD;\n b = b * i % MOD;\n }\n \n return modinv(b, MOD) * a % MOD;\n }\n // 二次元上の二点間の距離\n double distance(double x1, double y1, double x2, double y2){\n double dist = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n return dist;\n }\n // 三次元上の二点間の距離\n double distance(double x1, double y1, double z1, double x2, double y2, double z2){\n double dist = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + (z1 - z2) * (z1 - z2));\n return dist;\n }\n\n\n // Array\n void sort(int[] a){ Arrays.sort(a);}\n void sort(long[] a){ Arrays.sort(a);}\n void sort(double[] a){ Arrays.sort(a);}\n void sort(String[] a){ Arrays.sort(a);}\n int[] reverse(int[] a){\n int[] reversed = new int[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n long[] reverse(long[] a){\n long[] reversed = new long[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n double[] reverse(double[] a){\n double[] reversed = new double[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n char[] reverse(char[] a){\n char[] reversed = new char[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n String[] reverse(String[] a){\n String[] reversed = new String[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n boolean[] reverse(boolean[] a){\n boolean[] reversed = new boolean[a.length];\n for(int i = 0; i < a.length; i++){\n reversed[a.length - i - 1] = a[i];\n }\n return reversed;\n }\n void fill(int[] array, int x) { Arrays.fill(array, x); }\n void fill(long[] array, long x) { Arrays.fill(array, x); }\n void fill(double[] array, double x) { Arrays.fill(array, x); }\n void fill(boolean[] array, boolean x) { Arrays.fill(array, x); }\n void fill(int[][] array, int x) { for(int a[] : array) { fill(a, x); } }\n void fill(long[][] array, long x) { for(long a[] : array) { fill(a, x); } }\n void fill(double[][] array, double x) { for(double a[] : array) { fill(a, x); } }\n void fill(boolean[][] array, boolean x) { for(boolean a[] : array) { fill(a, x); } }\n void fill(int[][][] array, int x) { for(int[][] ary : array) { for(int[] a : ary){ fill(a, x); } } }\n void fill(long[][][] array, long x) { for(long[][] ary : array) { for(long[] a : ary){ fill(a, x); } } }\n\n // Algorithm\n // 深さ優先探索\n /*\n HashMap> graph = new HashMap<>();\n List list;\n */\n void dfs(HashMap> graph, int v, boolean[] seen, int[] friendCount, boolean[][] block){\n seen[v] = true;\n if(!graph.containsKey(v) || graph.get(v).size() == 0) return;\n List todo = graph.get(v);\n for(int next : todo){\n if(seen[next]) continue;\n if(!block[v][next]){\n friendCount[v] += 1;\n friendCount[next] += 1;\n }\n dfs(graph, next, seen, friendCount, block);\n }\n }\n // 幅優先探索\n /*\n HashMap> graph = new HashMap<>();\n List list;\n */\n void bfs(HashMap> graph, int v, int[] dist, int[] friendCount, boolean[][] block){\n Queue que = new ArrayDeque<>();\n que.add(v);\n\n while(que.size() > 0){\n v = que.poll();\n if(!graph.containsKey(v)) continue;\n for(int next : graph.get(v)){\n if(!block[v][next]){\n friendCount[v] += 1;\n friendCount[next] += 1;\n }\n if(dist[next] != -1) continue;\n dist[next] = dist[v] + 1;\n que.add(next);\n }\n }\n }\n \n // ダイクストラ法\n Node[] dijkstra(HashMap> graph, int size, int v, boolean[] flag, int[][] cost, int[] temp, int X){\n Queue queue = new PriorityQueue<>(new MyComparator());\n Node[] nodes = new Node[size];\n int[] hot = new int[size]; // 最後に暑すぎる部屋を出た時刻\n int[] cold = new int[size]; // 最後に寒すぎる部屋を出た時刻\n for(int i = 0; i < size; i++){\n nodes[i] = new Node(i, INF, -1); // id, dist, pastを指定して初期化\n }\n /* for(int key : graph.keySet()){\n nodes[key] = new Node(key, INF, -1); // id, dist, pastを指定して初期化\n } */\n \n nodes[v].dist = 0; // 始点のコストを0に\n try{\n queue.add(nodes[v].clone());\n } catch(CloneNotSupportedException e){\n e.printStackTrace();\n }\n\n while(queue.size() > 0){\n Node now = queue.poll(); // 未確定の中で最もコストの低いノードを取り出す\n //flag[now.id] = true; // 確定\n if(temp[now.id] != 1) flag[now.id] = true;\n if(!graph.containsKey(now.id)) continue;\n for(int next : graph.get(now.id)){ // 辺で繋がっているノードを順にチェック\n if(flag[next] || nodes[next].dist < nodes[now.id].dist + cost[now.id][next]) continue;\n if(Math.abs(temp[now.id] - temp[next]) == 2 && cost[now.id][next] < X) continue;//\n int lastTime = 0; //\n if(temp[next] == 0){\n lastTime = hot[now.id];\n } else if(temp[next] == 2){\n lastTime = cold[now.id];\n }\n if(cost[now.id][next] < X - lastTime){ //\n int min = INF;\n for(int next2 : graph.get(now.id)){\n if(next2 == next || Math.abs(temp[next2] - temp[next]) == 2) continue;\n min = min(min, cost[now.id][next2]);\n }\n if(min == INF) continue;\n min *= 2;\n while(nodes[now.id].dist + cost[now.id][next] + min < X + lastTime){\n min += min;\n }\n if(nodes[next].dist < nodes[now.id].dist + cost[now.id][next] + min) continue;\n nodes[next].dist = nodes[now.id].dist + cost[now.id][next] + min; // distを更新\n nodes[next].past = now.id; // pastを現在のノードに\n hot[next] = hot[now.id] + cost[now.id][next] + min;\n cold[next] = cold[now.id] + cost[now.id][next] + min;\n if(temp[next] == 2) hot[next] = 0;\n if(temp[next] == 0) cold[next] = 0;\n try{\n queue.add(nodes[next].clone());\n } catch (CloneNotSupportedException e){\n e.printStackTrace();\n }\n continue;\n }//\n nodes[next].dist = nodes[now.id].dist + cost[now.id][next]; // distを更新\n nodes[next].past = now.id; // pastを現在のノードに\n hot[next] = hot[now.id] + cost[now.id][next]; //\n cold[next] = cold[now.id] + cost[now.id][next];\n if(temp[next] == 2) hot[next] = 0;\n if(temp[next] == 0) cold[next] = 0; //\n try{\n queue.add(nodes[next].clone());\n } catch (CloneNotSupportedException e){\n e.printStackTrace();\n }\n }\n }\n\n return nodes;\n }\n \n // ソート済みint型配列でkey以上の値の最小indexを返す\n int lowerBound(int[] a, int key){\n int ng = -1;\n int ok = a.length;\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2; \n if(a[mid] >= key){\n ok = mid;\n } else {\n ng = mid;\n }\n }\n return ok;\n }\n // ソート済みlong型配列でkey以上の値の最小indexを返す\n int lowerBound(long[] a, long key){\n int ng = -1;\n int ok = a.length;\n while(Math.abs(ok - ng) > 1){\n int mid = (ok + ng) / 2; \n if(a[mid] >= key){\n ok = mid;\n } else {\n ng = mid;\n }\n }\n return ok;\n }\n // 文字列sとtの最長共通部分列の長さを返す\n int lcs(String s , String t){\n int[][] dp = new int[s.length() + 1][t.length() + 1];\n\n for(int i = 0; i < s.length(); i++){\n for(int j = 0; j < t.length(); j++){\n if(s.charAt(i) == t.charAt(j)){\n dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i + 1][j + 1]);\n }\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i + 1][j]);\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j + 1]);\n }\n }\n\n return dp[s.length()][t.length()];\n }\n\n}\n// ダイクストラ法におけるノード\nclass Node implements Cloneable{\n int id; // ノード番号\n int dist; // 最低必要コスト\n int past; // 直前の頂点\n\n Node(int id, int dist, int past){\n this.id = id;\n this.dist = dist;\n this.past = past;\n }\n @Override\n protected Node clone() throws CloneNotSupportedException{\n Node node = (Node)super.clone();\n return node;\n }\n public String toString(){\n return \"[\" + id + \", \" + dist + \" ,\" + past + \"]\";\n }\n}\n// ダイクストラ法における重み比較のComparator\nclass MyComparator implements Comparator{\n @Override\n public int compare(Node n1, Node n2){\n int dist1 = n1.dist;\n int dist2 = n2.dist;\n if(dist1 < dist2){\n return -1;\n } else if(dist1 > dist2){\n return 1;\n } else {\n return 0;\n }\n }\n}\n// 辺の情報を持つクラス\nclass Edge implements Cloneable{\n int from; // どの頂点から\n int to; // どの頂点へ\n double cost; // 辺の重み\n\n Edge(int from, int to, double cost){\n this.from = from;\n this.to = to;\n this.cost = cost;\n }\n @Override\n protected Edge clone() throws CloneNotSupportedException{\n Edge edge = (Edge)super.clone();\n return edge;\n }\n public String toString(){\n return \"[\" + from + \" to \" + to + \",\" + cost + \"]\";\n }\n}\n// 辺の重み比較のComparator\nclass EdgeComparator implements Comparator{\n @Override\n public int compare(Edge e1, Edge e2){\n double cost1 = e1.cost;\n double cost2 = e2.cost;\n if(cost1 < cost2){\n return -1;\n } else if(cost1 > cost2){\n return 1;\n } else {\n return 0;\n }\n }\n}\n// Union-Find\nclass UnionFind{\n int[] par;\n int[] size;\n UnionFind(int N){\n par = new int[N];\n size = new int[N];\n for(int i = 0; i < N; i++){\n par[i] = i;\n size[i] = 1;\n }\n }\n\n void init(int N){\n for(int i = 0; i < N; i++){\n par[i] = i;\n size[i] = 1;\n }\n }\n\n int root(int x){\n if(par[x] == x){\n return x;\n } else {\n return par[x] = root(par[x]);\n }\n }\n\n boolean same(int x, int y){\n return root(x) == root(y);\n }\n\n void unite(int x, int y){\n x = root(x);\n y = root(y);\n if(x == y) return;\n if(size[x] < size[y]){\n int tmp = x;\n x = y;\n y = tmp;\n }\n size[x] += size[y];\n par[y] = x;\n }\n\n int size(int x){\n return size[root(x)];\n }\n\n}\n\n// 順列を管理する\nclass Permutation {\n private int number;\n private int listSize;\n private int searched;\n private int nextIndex;\n private int[][] permList;\n\n Permutation(int num) {\n this.number = num;\n this.listSize = this.fact(this.number);\n this.searched = 0;\n this.nextIndex = 0;\n this.permList = new int[this.listSize][this.number];\n\n this.create(0, new int[this.number], new boolean[this.number]);\n }\n\n int[] nextPerm() {\n return permList[this.nextIndex++];\n }\n\n boolean isNext() {\n if(this.nextIndex < this.listSize) {\n return true;\n } else {\n this.nextIndex = 0;\n return false;\n }\n }\n\n int fact(int n){\n return n == 0 ? 1 : n * fact(n-1);\n }\n\n void create(int num, int[] list, boolean[] flag) {\n if(num == this.number) {\n copyArray(list, permList[this.searched]);\n this.searched++;\n }\n for(int i = 0; i < this.number; i++){\n if(flag[i]) continue;\n list[num] = i;\n flag[i] = true;\n this.create(num+1, list, flag);\n flag[i] = false;\n\n }\n }\n\n void copyArray(int[] from, int[] to) {\n for(int i=0; i 0){\n i = i >> 1; // 1ビットぶん右シフト\n dat[i] = Math.min(dat[i << 1], dat[(i << 1) + 1]);\n }\n }\n\n public String toString(){\n StringBuilder sb = new StringBuilder(\"[\");\n for(int i = size; i < 2 * size; i++){\n sb.append(dat[i]).append(\",\");\n }\n sb.delete(sb.length() - 1, sb.length());\n String output = sb.append(\"]\").toString();\n return output;\n }\n}\n\n// Range Sum Queryを実現するBinary Indexed Tree\nclass BIT{\n int[] tree;\n\n BIT(int N){\n this.tree = new int[N + 1];\n }\n\n int sum(int i){\n int sum = 0;\n while(i > 0){\n sum += this.tree[i];\n i -= i & -i;\n }\n return sum;\n }\n\n void add(int i, int x){\n while(i <= tree.length){\n this.tree[i] += x;\n i += i & -i;\n }\n }\n\n public String toString(){\n StringBuilder sb = new StringBuilder(\"[\");\n for(int i = 0; i < tree.length; i++){\n sb.append(tree[i] + \",\");\n }\n sb.append(\"]\");\n String output = sb.toString();\n return output;\n }\n \n}\n\n// 標準のScannerより高速に標準入力する\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n }else{\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}\n public String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while(isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n public long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while(true){\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n }else if(b == -1 || !isPrintableChar(b)){\n return minus ? -n : n;\n }else{\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n public double nextDouble() { return Double.parseDouble(next());}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "sample_input": "3 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03635", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 23191, "cpu_time_ms": 76, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s212816608", "group_id": "codeNet:p03636", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n String s = in.nextString();\n\n out.println(\"\" + s.charAt(0) + (s.length() - 2) + s.charAt(s.length() - 1));\n }\n\n }\n\n static class InputReader {\n BufferedReader in;\n StringTokenizer tok;\n\n public String nextString() {\n while (!tok.hasMoreTokens()) {\n try {\n tok = new StringTokenizer(in.readLine(), \" \");\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n return tok.nextToken();\n }\n\n public InputReader(InputStream inputStream) {\n in = new BufferedReader(new InputStreamReader(inputStream));\n tok = new StringTokenizer(\"\");\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1502102226, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03636.html", "problem_id": "p03636", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03636/input.txt", "sample_output_relpath": "derived/input_output/data/p03636/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03636/Java/s212816608.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s212816608", "user_id": "u611502820"}, "prompt_components": {"gold_output": "i18n\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.util.InputMismatchException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskB solver = new TaskB();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskB {\n public void solve(int testNumber, InputReader in, PrintWriter out) {\n String s = in.nextString();\n\n out.println(\"\" + s.charAt(0) + (s.length() - 2) + s.charAt(s.length() - 1));\n }\n\n }\n\n static class InputReader {\n BufferedReader in;\n StringTokenizer tok;\n\n public String nextString() {\n while (!tok.hasMoreTokens()) {\n try {\n tok = new StringTokenizer(in.readLine(), \" \");\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n }\n return tok.nextToken();\n }\n\n public InputReader(InputStream inputStream) {\n in = new BufferedReader(new InputStreamReader(inputStream));\n tok = new StringTokenizer(\"\");\n }\n\n }\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "sample_input": "internationalization\n"}, "reference_outputs": ["i18n\n"], "source_document_id": "p03636", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1624, "cpu_time_ms": 76, "memory_kb": 21588}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s578690560", "group_id": "codeNet:p03636", "input_text": " import java.io.*;\n import java.util.*;\n\n public class Main {\n\n public static void main(String[] args) throws IOException {\n\n boolean local = false;\n if (args.length > 0 && args[0].equals(\"LOCAL\"))\n local = true;\n\n new Main(local).go();\n }\n\n boolean LOCAL;\n PrintWriter out;\n Reader in;\n BufferedReader br;\n\n Main(boolean local) throws IOException {\n\n this.LOCAL = local;\n\n try {\n\n //br = new BufferedReader( new FileReader(\"input.txt\") );\n in = new Reader(\"input.txt\");\n out = new PrintWriter( new BufferedWriter(new FileWriter(\"output.txt\")) );\n }\n catch (Exception e) {\n\n //br = new BufferedReader( new InputStreamReader( System.in ) );\n in = new Reader();\n out = new PrintWriter( new BufferedWriter(new OutputStreamWriter(System.out)) );\n }\n }\n\n void go() throws IOException {\n\n int t = 1;\n\n if (this.LOCAL)\n t = in.nextInt();\n\n while (t > 0) {\n\n solve();\n t--;\n\n if (LOCAL)\n out.println();\n\n }\n\n out.flush();\n out.close();\n }\n\n\n int inf = 2000000000;\n int mod = 1000000007;\n double eps = 1e-9;\n\n int n;\n int m;\n\n //ArrayList[] g = new ArrayList[200010];\n\n void solve() throws IOException {\n\n String s = in.nextLine();\n out.println(s.charAt(0) + \"\" + s.substring(1, s.length()-1).length() + s.charAt(s.length()-1));\n }\n\n class Pair implements Comparable{\n\n int a;\n int b;\n\n Pair(int a, int b) {\n\n this.a = a;\n this.b = b;\n }\n\n public int compareTo(Pair p) {\n\n // if (a > p.a) return 1;\n // if (a < p.a) return -1;\n if (b > p.b) return 1;\n if (b < p.b) return -1;\n return 0;\n }\n }\n\n class Item {\n\n int a;\n int b;\n int c;\n\n Item(int a, int b, int c) {\n this.a = a;\n this.b = b;\n this.c = c;\n }\n\n }\n\n class Reader {\n\n BufferedReader br;\n StringTokenizer tok;\n\n Reader(String file) throws IOException {\n br = new BufferedReader( new FileReader(file) );\n }\n\n Reader() throws IOException {\n br = new BufferedReader( new InputStreamReader(System.in) );\n }\n\n String next() throws IOException {\n\n while (tok == null || !tok.hasMoreElements())\n tok = new StringTokenizer(br.readLine());\n return tok.nextToken();\n }\n\n int nextInt() throws NumberFormatException, IOException {\n return Integer.valueOf(next());\n }\n\n long nextLong() throws NumberFormatException, IOException {\n return Long.valueOf(next());\n }\n\n double nextDouble() throws NumberFormatException, IOException {\n return Double.valueOf(next());\n }\n\n\n String nextLine() throws IOException {\n return br.readLine();\n }\n\n }\n\n }", "language": "Java", "metadata": {"date": 1502067948, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03636.html", "problem_id": "p03636", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03636/input.txt", "sample_output_relpath": "derived/input_output/data/p03636/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03636/Java/s578690560.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s578690560", "user_id": "u208733542"}, "prompt_components": {"gold_output": "i18n\n", "input_to_evaluate": " import java.io.*;\n import java.util.*;\n\n public class Main {\n\n public static void main(String[] args) throws IOException {\n\n boolean local = false;\n if (args.length > 0 && args[0].equals(\"LOCAL\"))\n local = true;\n\n new Main(local).go();\n }\n\n boolean LOCAL;\n PrintWriter out;\n Reader in;\n BufferedReader br;\n\n Main(boolean local) throws IOException {\n\n this.LOCAL = local;\n\n try {\n\n //br = new BufferedReader( new FileReader(\"input.txt\") );\n in = new Reader(\"input.txt\");\n out = new PrintWriter( new BufferedWriter(new FileWriter(\"output.txt\")) );\n }\n catch (Exception e) {\n\n //br = new BufferedReader( new InputStreamReader( System.in ) );\n in = new Reader();\n out = new PrintWriter( new BufferedWriter(new OutputStreamWriter(System.out)) );\n }\n }\n\n void go() throws IOException {\n\n int t = 1;\n\n if (this.LOCAL)\n t = in.nextInt();\n\n while (t > 0) {\n\n solve();\n t--;\n\n if (LOCAL)\n out.println();\n\n }\n\n out.flush();\n out.close();\n }\n\n\n int inf = 2000000000;\n int mod = 1000000007;\n double eps = 1e-9;\n\n int n;\n int m;\n\n //ArrayList[] g = new ArrayList[200010];\n\n void solve() throws IOException {\n\n String s = in.nextLine();\n out.println(s.charAt(0) + \"\" + s.substring(1, s.length()-1).length() + s.charAt(s.length()-1));\n }\n\n class Pair implements Comparable{\n\n int a;\n int b;\n\n Pair(int a, int b) {\n\n this.a = a;\n this.b = b;\n }\n\n public int compareTo(Pair p) {\n\n // if (a > p.a) return 1;\n // if (a < p.a) return -1;\n if (b > p.b) return 1;\n if (b < p.b) return -1;\n return 0;\n }\n }\n\n class Item {\n\n int a;\n int b;\n int c;\n\n Item(int a, int b, int c) {\n this.a = a;\n this.b = b;\n this.c = c;\n }\n\n }\n\n class Reader {\n\n BufferedReader br;\n StringTokenizer tok;\n\n Reader(String file) throws IOException {\n br = new BufferedReader( new FileReader(file) );\n }\n\n Reader() throws IOException {\n br = new BufferedReader( new InputStreamReader(System.in) );\n }\n\n String next() throws IOException {\n\n while (tok == null || !tok.hasMoreElements())\n tok = new StringTokenizer(br.readLine());\n return tok.nextToken();\n }\n\n int nextInt() throws NumberFormatException, IOException {\n return Integer.valueOf(next());\n }\n\n long nextLong() throws NumberFormatException, IOException {\n return Long.valueOf(next());\n }\n\n double nextDouble() throws NumberFormatException, IOException {\n return Double.valueOf(next());\n }\n\n\n String nextLine() throws IOException {\n return br.readLine();\n }\n\n }\n\n }", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "sample_input": "internationalization\n"}, "reference_outputs": ["i18n\n"], "source_document_id": "p03636", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3516, "cpu_time_ms": 71, "memory_kb": 21076}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s277463836", "group_id": "codeNet:p03643", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String... nui) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tSystem.out.println(\"ABC\" + n);\n\t\t\n\t}\n\n}", "language": "Java", "metadata": {"date": 1584993145, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03643.html", "problem_id": "p03643", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03643/input.txt", "sample_output_relpath": "derived/input_output/data/p03643/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03643/Java/s277463836.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s277463836", "user_id": "u045289115"}, "prompt_components": {"gold_output": "ABC100\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String... nui) {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tint n = sc.nextInt();\n\t\t\n\t\tSystem.out.println(\"ABC\" + n);\n\t\t\n\t}\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest, AtCoder Beginner Contest, is abbreviated as ABC.\n\nWhen we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.\n\nWhat is the abbreviation for the N-th round of ABC? Write a program to output the answer.\n\nConstraints\n\n100 ≤ N ≤ 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the abbreviation for the N-th round of ABC.\n\nSample Input 1\n\n100\n\nSample Output 1\n\nABC100\n\nThe 100th round of ABC is ABC100.\n\nSample Input 2\n\n425\n\nSample Output 2\n\nABC425\n\nSample Input 3\n\n999\n\nSample Output 3\n\nABC999", "sample_input": "100\n"}, "reference_outputs": ["ABC100\n"], "source_document_id": "p03643", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest, AtCoder Beginner Contest, is abbreviated as ABC.\n\nWhen we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.\n\nWhat is the abbreviation for the N-th round of ABC? Write a program to output the answer.\n\nConstraints\n\n100 ≤ N ≤ 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the abbreviation for the N-th round of ABC.\n\nSample Input 1\n\n100\n\nSample Output 1\n\nABC100\n\nThe 100th round of ABC is ABC100.\n\nSample Input 2\n\n425\n\nSample Output 2\n\nABC425\n\nSample Input 3\n\n999\n\nSample Output 3\n\nABC999", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 200, "cpu_time_ms": 94, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s928235406", "group_id": "codeNet:p03645", "input_text": "import java.util.*;\n\nclass Main{\n public static void main(String[] arg){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int M = sc.nextInt();\n String ans = \"IMPOSSIBLE\";\n Listlist1 = new ArrayList<>();\n Listlist2 = new ArrayList<>();\n for(int i = 0; i < M; i++){\n list1.add(sc.nextInt());\n list2.add(sc.nextInt());\n }\n for(int j = 0; j < M; j++){\n if(list2.get(j) == N){\n for(int l = 0; l < M; l++){\n if(list1.get(l) == 1){\n ans = \"POSSIBLE\";\n break;\n }\n }\n }\n }\n System.out.println(ans);\n }\n}\n", "language": "Java", "metadata": {"date": 1585341141, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03645.html", "problem_id": "p03645", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03645/input.txt", "sample_output_relpath": "derived/input_output/data/p03645/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03645/Java/s928235406.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s928235406", "user_id": "u325206354"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "import java.util.*;\n\nclass Main{\n public static void main(String[] arg){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int M = sc.nextInt();\n String ans = \"IMPOSSIBLE\";\n Listlist1 = new ArrayList<>();\n Listlist2 = new ArrayList<>();\n for(int i = 0; i < M; i++){\n list1.add(sc.nextInt());\n list2.add(sc.nextInt());\n }\n for(int j = 0; j < M; j++){\n if(list2.get(j) == N){\n for(int l = 0; l < M; l++){\n if(list1.get(l) == 1){\n ans = \"POSSIBLE\";\n break;\n }\n }\n }\n }\n System.out.println(ans);\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn Takahashi Kingdom, there is an archipelago of N islands, called Takahashi Islands.\nFor convenience, we will call them Island 1, Island 2, ..., Island N.\n\nThere are M kinds of regular boat services between these islands.\nEach service connects two islands. The i-th service connects Island a_i and Island b_i.\n\nCat Snuke is on Island 1 now, and wants to go to Island N.\nHowever, it turned out that there is no boat service from Island 1 to Island N, so he wants to know whether it is possible to go to Island N by using two boat services.\n\nHelp him.\n\nConstraints\n\n3 ≤ N ≤ 200 000\n\n1 ≤ M ≤ 200 000\n\n1 ≤ a_i < b_i ≤ N\n\n(a_i, b_i) \\neq (1, N)\n\nIf i \\neq j, (a_i, b_i) \\neq (a_j, b_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nIf it is possible to go to Island N by using two boat services, print POSSIBLE; otherwise, print IMPOSSIBLE.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\nPOSSIBLE\n\nSample Input 2\n\n4 3\n1 2\n2 3\n3 4\n\nSample Output 2\n\nIMPOSSIBLE\n\nYou have to use three boat services to get to Island 4.\n\nSample Input 3\n\n100000 1\n1 99999\n\nSample Output 3\n\nIMPOSSIBLE\n\nSample Input 4\n\n5 5\n1 3\n4 5\n2 3\n2 4\n1 4\n\nSample Output 4\n\nPOSSIBLE\n\nYou can get to Island 5 by using two boat services: Island 1 -> Island 4 -> Island 5.", "sample_input": "3 2\n1 2\n2 3\n"}, "reference_outputs": ["POSSIBLE\n"], "source_document_id": "p03645", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn Takahashi Kingdom, there is an archipelago of N islands, called Takahashi Islands.\nFor convenience, we will call them Island 1, Island 2, ..., Island N.\n\nThere are M kinds of regular boat services between these islands.\nEach service connects two islands. The i-th service connects Island a_i and Island b_i.\n\nCat Snuke is on Island 1 now, and wants to go to Island N.\nHowever, it turned out that there is no boat service from Island 1 to Island N, so he wants to know whether it is possible to go to Island N by using two boat services.\n\nHelp him.\n\nConstraints\n\n3 ≤ N ≤ 200 000\n\n1 ≤ M ≤ 200 000\n\n1 ≤ a_i < b_i ≤ N\n\n(a_i, b_i) \\neq (1, N)\n\nIf i \\neq j, (a_i, b_i) \\neq (a_j, b_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nIf it is possible to go to Island N by using two boat services, print POSSIBLE; otherwise, print IMPOSSIBLE.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\nPOSSIBLE\n\nSample Input 2\n\n4 3\n1 2\n2 3\n3 4\n\nSample Output 2\n\nIMPOSSIBLE\n\nYou have to use three boat services to get to Island 4.\n\nSample Input 3\n\n100000 1\n1 99999\n\nSample Output 3\n\nIMPOSSIBLE\n\nSample Input 4\n\n5 5\n1 3\n4 5\n2 3\n2 4\n1 4\n\nSample Output 4\n\nPOSSIBLE\n\nYou can get to Island 5 by using two boat services: Island 1 -> Island 4 -> Island 5.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 682, "cpu_time_ms": 738, "memory_kb": 103072}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s952373487", "group_id": "codeNet:p03651", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.AbstractMap;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.NoSuchElementException;\n\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\t\n\t\tfor(int i=0;i<1;i++) {\n\t\t\t\n\t\t\tslover();\n\t\t\tout.flush();\n\t\t}\n\t}\n\tstatic FastScanner sc = new FastScanner();\n\tstatic PrintWriter out = new PrintWriter(System.out);\n\t\n\n\t\t\n\n\n\n\t\t@SuppressWarnings(\"unused\")\n\t\tprivate static class D{\n\n\t\t\tD(ArrayList X,ArrayList Y,int t,int index){\n\n\t\t\t}\n\n\t\t}\n\n\n\n\t//Set a=new HashSet();\n\t\n\t\n\t\n\t//Integer.toBinaryString(i);\n\t//Integer.toString(i, 2);\n//\t//Integer.parseInt(bin, 2);\n\t//bitset\n\t\t//StringBuffer S = new StringBuffer(sc.next());\n\t\t\t\t//String hoge2 = str.reverse().toString();\n\t\t\t\t//map.containsKey(A)\n\t\t\t\t//Map map = new HashMap(N);\n\t\t\t\t/*for ( キーのデータ型 key : マップの名前.keySet() ) {\n\t\t\t\t\tデータのデータ型 data = マップの名前.get( key );\n\n\t\t\t\t\t// keyやdataを使った処理;\n\t\t\t\t}*/\n\t\t\t\t//int i = Integer.parseInt(s);\n\t\t\t\t//Queue qq=new ArrayDeque<>(); //add,poll,peek BFSは前から実行される\n\t\t\t\t//Deque dd=new ArrayDeque<>();//push後ろに入れる,poll(pop)後ろからとる,peek addは先頭に入るからバグ注意\n\t\t\t\t//stackdfsは後ろから実行される\n\t\t\t\t//ArrayList cc = new ArrayList<>(N);\n\t\t\t\t//cc.contains(tmp)\n\t\t\t\t//Arrays.asList(c).contains(\"a\")\n\t\t\t\t//list.set(1,\"walk\");//1 1 2 3 5\n\t\t\t\t//PriorityQueue r=new PriorityQueue();//add poll\n\t\t\n\t\tpublic static class Pair extends AbstractMap.SimpleEntry implements Comparable> {\n\t\t\t/** serialVersionUID. */\n\t\t private static final long serialVersionUID = 6411527075103472113L;\n\t \n\t\t public Pair(final K key, final V value) {\n\t\t super(key, value);\n\t\t }\n\t \n\t\t\t@Override\n\t\t\tpublic int compareTo(Pair o) {\n\t \n\t\t\t\tComparable key = (Comparable)this.getKey();\n\t\t\t\tComparable key2 = (Comparable)o.getKey();\n\t \n\t\t\t\treturn key.compareTo(key2);\n\t\t\t}\n\t \n\t\t}\n\t \n\t\t// 文字列として入力を取得\n\t\t\n\t\t\n\t\t\n\t\t\n\tprivate static long mod=1000000007;\n\tprivate static int INF =999999999;\n\t@SuppressWarnings(\"unused\")\n\tprivate static long LINF=4000000000000000000L;\n\t\n\t@SuppressWarnings(\"unused\")\n\tprivate static long ncr(long n,long r) {\n\t\tlong res=1;\n\t\t\n\t\tfor(int i=0;i=0) {\n\t\t\t//p(t);\n\t\t\tres++;\n\t\t\tt=T.indexOf(v,t)+1;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tprivate static int slover() {\n\t\t\n\t\tint N=sc.nextInt(),K=sc.nextInt();\n\t\tint A[]=sc.nextIntArray(N, false);\n\t\tlong t=A[0];\n\t\tint max=0;\n\t\n\t\tfor(int i=0;i=0&&Queue[(index-1)/2]>value) {\n\t\t\t\tQueue[index]=Queue[(index-1)/2];\n\t\t\t\tpriority_queue_add(Queue,(index-1)/2,value);\n\t\t\t\t\n\t\t\t}\n\t\t\tif((index-2)/2>=0&&Queue[(index-2)/2]>value) {\n\t\t\t\tQueue[index]=Queue[(index-2)/2];\n\t\t\t\tpriority_queue_add(Queue,(index-2)/2,value);\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t}\n@SuppressWarnings(\"unused\")\nprivate static int priority_queue_getFirst(int[] Queue) {\n\t\tint res=Queue[0];\n\t\tQueue[0]=Queue[Queue.length-1];\n\t\tQueue[Queue.length-1]=INF;\n\t\t//System.out.println(Arrays.toString(Queue));\n\t\t//大きさのチェック\n\t\tQ_shape(Queue,0);\n\t\t\n\t\treturn res;\n\t}\n\tprivate static void Q_shape(int[] Queue,int index) {\n\t\t\t\n\t\t\t\n\t\t\n\t\t\tif(index*2+1>1;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tpublic static long gcd(long num1,long num2) {\n if(num2==0) return num1;\n else return gcd(num2,num1%num2);\n }\n\tpublic static long lcm(long num1,long num2) {\n\t\treturn num1*num2/gcd(num1,num2);\n\t}\n\t//O(N^0.5)\n\tprivate static boolean isPrime(long t) {\n\t\tif(t<2)return false;\n\t\tfor(int i=2;i*i<=t;i++) {\n\t\t\tif(t%i==0)return false;\n\t\t}\n\t\treturn true;\n\t}\n\tprivate static ArrayList Divisors(long t) {\n\t\tArrayList c=new ArrayList();\n\t\t\n\t\tfor(long i=1;i*i<=t;i++) {\n\t\t\tif(t%i==0) {\n\t\t\t\t\n\t\t\t\tif(i*i!=t) {\n\t\t\t\t\tc.add(t/i);\n\t\t\t\t}\n\t\t\t\tc.add((long)i);\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n\tprivate static ArrayList Sorted_Divisors(long t) {\n\t\tArrayList c=new ArrayList();\n\t\tfor(long i=2;i*i<=t;i++) {\n\t\t\t\n\t\t\t\n\t\t\tif(t%i==0) {\n\t\t\t\tp(t+\" \"+i);\n\t\t\t\tc.add((long)i);\n\t\t\t\tt/=i;\n\t\t\t\ti--;\n\t\t\t}\n\t\t}\n\t\tif(t!=1)c.add(t);\n\t\tCollections.sort(c);\n\t\t\n\t\treturn c;\n\t}\n\tprivate static void bubunwa() {\n\t\tint N=sc.nextInt();\n\t\tint K=sc.nextInt();\n\t\tint a[]=sc.nextIntArray(N, false);\n\n\t\tboolean dp[] =new boolean[K+1];\n\n\t\tArrays.fill(dp, false);\n\t\tdp[0]=true;\n\t\tfor(int i=0;i=0;x--) {\n\t\t\t\tif(dp[x])dp[x+a[i]]=true;\n\t\t\t}\n\t\t}\n\n\t\tp(dp[K] ? \"Yes\":\"No\");\n\t}\n\t\n\tprivate static String bitToString(int i) {\n\t\treturn Integer.toBinaryString(i);\n\t}\n/*********************************************************************/\n\t//target以下までの値のindexを返す\n\t//target以上が欲しいときは返り値+1すればいい\n\t//0-indexで個数を求めるときはさらにindex+1する必要あり\n\tprivate static int lower_bound(long a[],long target) {\n\t//p(target+ \" \"+Arrays.toString(a));\n\tif(a[0]>target)return -1;\n\t//最後の値がtarget以下であるときは最後のindexを返す。\n\t//target以上が欲しいときは注意する必要あり\n\tif(a[a.length-1]<=target) return a.length-1;\n\n\tint S=-1;\n\tint E=a.length;\n\n\twhile(Starget) {\n\t\t\treturn G;\n\n\t\t}else if(a[G]<=target){\n\t\t\tS=G;\n\t\t}else if(a[G]>target) {\n\t\t\tE=G;\n\t\t}\n\n\t}\n\n\n\treturn -1;\n\t}\n\tstatic String nextPermutation(String s) {\n\t\tArrayList list=new ArrayList();\n\t\tfor(int i=0;i=0;i--) {\n\t\t\tif(list.get(i)=L;i--) {\n\t\t\tif(pivot X,ArrayList Y,int t,int index){\n\n\t\t\t}\n\n\t\t}\n\n\n\n\t//Set a=new HashSet();\n\t\n\t\n\t\n\t//Integer.toBinaryString(i);\n\t//Integer.toString(i, 2);\n//\t//Integer.parseInt(bin, 2);\n\t//bitset\n\t\t//StringBuffer S = new StringBuffer(sc.next());\n\t\t\t\t//String hoge2 = str.reverse().toString();\n\t\t\t\t//map.containsKey(A)\n\t\t\t\t//Map map = new HashMap(N);\n\t\t\t\t/*for ( キーのデータ型 key : マップの名前.keySet() ) {\n\t\t\t\t\tデータのデータ型 data = マップの名前.get( key );\n\n\t\t\t\t\t// keyやdataを使った処理;\n\t\t\t\t}*/\n\t\t\t\t//int i = Integer.parseInt(s);\n\t\t\t\t//Queue qq=new ArrayDeque<>(); //add,poll,peek BFSは前から実行される\n\t\t\t\t//Deque dd=new ArrayDeque<>();//push後ろに入れる,poll(pop)後ろからとる,peek addは先頭に入るからバグ注意\n\t\t\t\t//stackdfsは後ろから実行される\n\t\t\t\t//ArrayList cc = new ArrayList<>(N);\n\t\t\t\t//cc.contains(tmp)\n\t\t\t\t//Arrays.asList(c).contains(\"a\")\n\t\t\t\t//list.set(1,\"walk\");//1 1 2 3 5\n\t\t\t\t//PriorityQueue r=new PriorityQueue();//add poll\n\t\t\n\t\tpublic static class Pair extends AbstractMap.SimpleEntry implements Comparable> {\n\t\t\t/** serialVersionUID. */\n\t\t private static final long serialVersionUID = 6411527075103472113L;\n\t \n\t\t public Pair(final K key, final V value) {\n\t\t super(key, value);\n\t\t }\n\t \n\t\t\t@Override\n\t\t\tpublic int compareTo(Pair o) {\n\t \n\t\t\t\tComparable key = (Comparable)this.getKey();\n\t\t\t\tComparable key2 = (Comparable)o.getKey();\n\t \n\t\t\t\treturn key.compareTo(key2);\n\t\t\t}\n\t \n\t\t}\n\t \n\t\t// 文字列として入力を取得\n\t\t\n\t\t\n\t\t\n\t\t\n\tprivate static long mod=1000000007;\n\tprivate static int INF =999999999;\n\t@SuppressWarnings(\"unused\")\n\tprivate static long LINF=4000000000000000000L;\n\t\n\t@SuppressWarnings(\"unused\")\n\tprivate static long ncr(long n,long r) {\n\t\tlong res=1;\n\t\t\n\t\tfor(int i=0;i=0) {\n\t\t\t//p(t);\n\t\t\tres++;\n\t\t\tt=T.indexOf(v,t)+1;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tprivate static int slover() {\n\t\t\n\t\tint N=sc.nextInt(),K=sc.nextInt();\n\t\tint A[]=sc.nextIntArray(N, false);\n\t\tlong t=A[0];\n\t\tint max=0;\n\t\n\t\tfor(int i=0;i=0&&Queue[(index-1)/2]>value) {\n\t\t\t\tQueue[index]=Queue[(index-1)/2];\n\t\t\t\tpriority_queue_add(Queue,(index-1)/2,value);\n\t\t\t\t\n\t\t\t}\n\t\t\tif((index-2)/2>=0&&Queue[(index-2)/2]>value) {\n\t\t\t\tQueue[index]=Queue[(index-2)/2];\n\t\t\t\tpriority_queue_add(Queue,(index-2)/2,value);\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t}\n@SuppressWarnings(\"unused\")\nprivate static int priority_queue_getFirst(int[] Queue) {\n\t\tint res=Queue[0];\n\t\tQueue[0]=Queue[Queue.length-1];\n\t\tQueue[Queue.length-1]=INF;\n\t\t//System.out.println(Arrays.toString(Queue));\n\t\t//大きさのチェック\n\t\tQ_shape(Queue,0);\n\t\t\n\t\treturn res;\n\t}\n\tprivate static void Q_shape(int[] Queue,int index) {\n\t\t\t\n\t\t\t\n\t\t\n\t\t\tif(index*2+1>1;\n\t\t}\n\t\treturn res;\n\t}\n\t\n\tpublic static long gcd(long num1,long num2) {\n if(num2==0) return num1;\n else return gcd(num2,num1%num2);\n }\n\tpublic static long lcm(long num1,long num2) {\n\t\treturn num1*num2/gcd(num1,num2);\n\t}\n\t//O(N^0.5)\n\tprivate static boolean isPrime(long t) {\n\t\tif(t<2)return false;\n\t\tfor(int i=2;i*i<=t;i++) {\n\t\t\tif(t%i==0)return false;\n\t\t}\n\t\treturn true;\n\t}\n\tprivate static ArrayList Divisors(long t) {\n\t\tArrayList c=new ArrayList();\n\t\t\n\t\tfor(long i=1;i*i<=t;i++) {\n\t\t\tif(t%i==0) {\n\t\t\t\t\n\t\t\t\tif(i*i!=t) {\n\t\t\t\t\tc.add(t/i);\n\t\t\t\t}\n\t\t\t\tc.add((long)i);\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n\tprivate static ArrayList Sorted_Divisors(long t) {\n\t\tArrayList c=new ArrayList();\n\t\tfor(long i=2;i*i<=t;i++) {\n\t\t\t\n\t\t\t\n\t\t\tif(t%i==0) {\n\t\t\t\tp(t+\" \"+i);\n\t\t\t\tc.add((long)i);\n\t\t\t\tt/=i;\n\t\t\t\ti--;\n\t\t\t}\n\t\t}\n\t\tif(t!=1)c.add(t);\n\t\tCollections.sort(c);\n\t\t\n\t\treturn c;\n\t}\n\tprivate static void bubunwa() {\n\t\tint N=sc.nextInt();\n\t\tint K=sc.nextInt();\n\t\tint a[]=sc.nextIntArray(N, false);\n\n\t\tboolean dp[] =new boolean[K+1];\n\n\t\tArrays.fill(dp, false);\n\t\tdp[0]=true;\n\t\tfor(int i=0;i=0;x--) {\n\t\t\t\tif(dp[x])dp[x+a[i]]=true;\n\t\t\t}\n\t\t}\n\n\t\tp(dp[K] ? \"Yes\":\"No\");\n\t}\n\t\n\tprivate static String bitToString(int i) {\n\t\treturn Integer.toBinaryString(i);\n\t}\n/*********************************************************************/\n\t//target以下までの値のindexを返す\n\t//target以上が欲しいときは返り値+1すればいい\n\t//0-indexで個数を求めるときはさらにindex+1する必要あり\n\tprivate static int lower_bound(long a[],long target) {\n\t//p(target+ \" \"+Arrays.toString(a));\n\tif(a[0]>target)return -1;\n\t//最後の値がtarget以下であるときは最後のindexを返す。\n\t//target以上が欲しいときは注意する必要あり\n\tif(a[a.length-1]<=target) return a.length-1;\n\n\tint S=-1;\n\tint E=a.length;\n\n\twhile(Starget) {\n\t\t\treturn G;\n\n\t\t}else if(a[G]<=target){\n\t\t\tS=G;\n\t\t}else if(a[G]>target) {\n\t\t\tE=G;\n\t\t}\n\n\t}\n\n\n\treturn -1;\n\t}\n\tstatic String nextPermutation(String s) {\n\t\tArrayList list=new ArrayList();\n\t\tfor(int i=0;i=0;i--) {\n\t\t\tif(list.get(i)=L;i--) {\n\t\t\tif(pivot= bufLength) {\n if (bufLength == -1)\n throw new InputMismatchException();\n\n bufPointer = 0;\n try {\n bufLength = in.read(buffer);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if (bufLength <= 0)\n return -1;\n }\n return buffer[bufPointer++];\n }\n\n private static boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public long nextLong() {\n long n = 0;\n\n int b = readByte();\n while (isSpaceChar(b))\n b = readByte();\n\n boolean minus = (b == '-');\n if (minus)\n b = readByte();\n\n while (b >= '0' && b <= '9') {\n n *= 10;\n n += b - '0';\n b = readByte();\n }\n\n if (!isSpaceChar(b))\n throw new NumberFormatException();\n\n return minus ? -n : n;\n }\n\n public int nextInt() {\n long n = nextLong();\n\n if (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE)\n throw new NumberFormatException();\n\n return (int) n;\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1546411154, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03657.html", "problem_id": "p03657", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03657/input.txt", "sample_output_relpath": "derived/input_output/data/p03657/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03657/Java/s663241008.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s663241008", "user_id": "u510349606"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.io.IOException;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n FastScanner in = new FastScanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskA solver = new TaskA();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class TaskA {\n public void solve(int testNumber, FastScanner in, PrintWriter out) {\n int a = in.nextInt();\n int b = in.nextInt();\n boolean possible = a % 3 == 0 || b % 3 == 0 || (a + b) % 3 == 0;\n out.println(possible ? \"Possible\" : \"Impossible\");\n }\n\n }\n\n static class FastScanner {\n private InputStream in;\n private byte[] buffer = new byte[1024];\n private int bufPointer;\n private int bufLength;\n\n public FastScanner(InputStream in) {\n this.in = in;\n }\n\n private int readByte() {\n if (bufPointer >= bufLength) {\n if (bufLength == -1)\n throw new InputMismatchException();\n\n bufPointer = 0;\n try {\n bufLength = in.read(buffer);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n\n if (bufLength <= 0)\n return -1;\n }\n return buffer[bufPointer++];\n }\n\n private static boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n public long nextLong() {\n long n = 0;\n\n int b = readByte();\n while (isSpaceChar(b))\n b = readByte();\n\n boolean minus = (b == '-');\n if (minus)\n b = readByte();\n\n while (b >= '0' && b <= '9') {\n n *= 10;\n n += b - '0';\n b = readByte();\n }\n\n if (!isSpaceChar(b))\n throw new NumberFormatException();\n\n return minus ? -n : n;\n }\n\n public int nextInt() {\n long n = nextLong();\n\n if (n < Integer.MIN_VALUE || n > Integer.MAX_VALUE)\n throw new NumberFormatException();\n\n return (int) n;\n }\n\n }\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is giving cookies to his three goats.\n\nHe has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).\n\nYour task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.\n\nConstraints\n\n1 \\leq A,B \\leq 100\n\nBoth A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf it is possible to give cookies so that each of the three goats can have the same number of cookies, print Possible; otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nPossible\n\nIf Snuke gives nine cookies, each of the three goats can have three cookies.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nImpossible\n\nSince there are only two cookies, the three goats cannot have the same number of cookies no matter what Snuke gives to them.", "sample_input": "4 5\n"}, "reference_outputs": ["Possible\n"], "source_document_id": "p03657", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is giving cookies to his three goats.\n\nHe has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).\n\nYour task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.\n\nConstraints\n\n1 \\leq A,B \\leq 100\n\nBoth A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf it is possible to give cookies so that each of the three goats can have the same number of cookies, print Possible; otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nPossible\n\nIf Snuke gives nine cookies, each of the three goats can have three cookies.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nImpossible\n\nSince there are only two cookies, the three goats cannot have the same number of cookies no matter what Snuke gives to them.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2660, "cpu_time_ms": 72, "memory_kb": 22740}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s211689785", "group_id": "codeNet:p03659", "input_text": "import java.util.Scanner;\n\nclass Main {\n\t\n\tpublic static int absDifference(int x, int[] cards) {\n\t\tint sumx = 0;\n\t\tint sumy = 0;\n\t\tint n = cards.length;\n\t\t\n\t\tfor (int i = 0; i < x; i++) {\n\t\t\tsumx += cards[i];\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < n-x; i++) {\n\t\t\tsumy += cards[n-i-1];\n\t\t}\n\t\t\n\t\treturn Math.abs(sumx - sumy);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] cards = new int[n];\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcards[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tsc.close();\n\t\t\n\t\tint ans = 100000000;\n\t\t\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tint temp = absDifference(i, cards);\n\t\t\tif (temp <= ans) {\n\t\t\t\tans = temp; \n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t}\n\t\n}\n", "language": "Java", "metadata": {"date": 1502793031, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03659.html", "problem_id": "p03659", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03659/input.txt", "sample_output_relpath": "derived/input_output/data/p03659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03659/Java/s211689785.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s211689785", "user_id": "u099249771"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main {\n\t\n\tpublic static int absDifference(int x, int[] cards) {\n\t\tint sumx = 0;\n\t\tint sumy = 0;\n\t\tint n = cards.length;\n\t\t\n\t\tfor (int i = 0; i < x; i++) {\n\t\t\tsumx += cards[i];\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < n-x; i++) {\n\t\t\tsumy += cards[n-i-1];\n\t\t}\n\t\t\n\t\treturn Math.abs(sumx - sumy);\n\t}\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[] cards = new int[n];\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcards[i] = sc.nextInt();\n\t\t}\n\t\t\n\t\tsc.close();\n\t\t\n\t\tint ans = 100000000;\n\t\t\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tint temp = absDifference(i, cards);\n\t\t\tif (temp <= ans) {\n\t\t\t\tans = temp; \n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(ans);\n\t\t\n\t\t\n\t}\n\t\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke and Raccoon have a heap of N cards. The i-th card from the top has the integer a_i written on it.\n\nThey will share these cards.\nFirst, Snuke will take some number of cards from the top of the heap, then Raccoon will take all the remaining cards.\nHere, both Snuke and Raccoon have to take at least one card.\n\nLet the sum of the integers on Snuke's cards and Raccoon's cards be x and y, respectively.\nThey would like to minimize |x-y|.\nFind the minimum possible value of |x-y|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n-10^{9} \\leq a_i \\leq 10^{9}\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6\n1 2 3 4 5 6\n\nSample Output 1\n\n1\n\nIf Snuke takes four cards from the top, and Raccoon takes the remaining two cards, x=10, y=11, and thus |x-y|=1. This is the minimum possible value.\n\nSample Input 2\n\n2\n10 -10\n\nSample Output 2\n\n20\n\nSnuke can only take one card from the top, and Raccoon can only take the remaining one card. In this case, x=10, y=-10, and thus |x-y|=20.", "sample_input": "6\n1 2 3 4 5 6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03659", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke and Raccoon have a heap of N cards. The i-th card from the top has the integer a_i written on it.\n\nThey will share these cards.\nFirst, Snuke will take some number of cards from the top of the heap, then Raccoon will take all the remaining cards.\nHere, both Snuke and Raccoon have to take at least one card.\n\nLet the sum of the integers on Snuke's cards and Raccoon's cards be x and y, respectively.\nThey would like to minimize |x-y|.\nFind the minimum possible value of |x-y|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n-10^{9} \\leq a_i \\leq 10^{9}\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6\n1 2 3 4 5 6\n\nSample Output 1\n\n1\n\nIf Snuke takes four cards from the top, and Raccoon takes the remaining two cards, x=10, y=11, and thus |x-y|=1. This is the minimum possible value.\n\nSample Input 2\n\n2\n10 -10\n\nSample Output 2\n\n20\n\nSnuke can only take one card from the top, and Raccoon can only take the remaining one card. In this case, x=10, y=-10, and thus |x-y|=20.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 729, "cpu_time_ms": 2113, "memory_kb": 66244}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s432575360", "group_id": "codeNet:p03660", "input_text": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\n\npublic class Main {\n int n;\n ArrayList> es;\n public static void main(String[] args) {\n Main m = new Main();\n m.read();\n m.solve();\n }\n\n void read() {\n Scanner sc = new Scanner(System.in);\n n = sc.nextInt();\n es = new ArrayList<>(n);\n for (int i = 0; i < n; i++) {\n es.add(new ArrayList<>());\n }\n for (int i = 0; i < n - 1; i++) {\n int a = sc.nextInt() - 1;\n int b = sc.nextInt() - 1;\n es.get(a).add(new Edge(a, b));\n es.get(b).add(new Edge(b, a));\n }\n }\n\n void solve() {\n UnionFind uf = new UnionFind(n);\n int sScore = 0, fScore = 0;\n ArrayList path = getPath();\n int mid = (path.size() - 1) / 2;\n int midFrom = path.get(mid);\n int midTo = path.get(mid+1);\n for (int i = 0; i < n; i++) {\n ArrayList ess = es.get(i);\n for (int j = 0; j < ess.size(); j++) {\n if ((i == midFrom && ess.get(j).to == midTo) ||\n (i == midTo && ess.get(j).to == midFrom))\n continue;\n uf.unite(i, ess.get(j).to);\n }\n }\n for (int i = 0; i < n; i++) {\n if (uf.hasSamePar(0, i))\n fScore++;\n else\n sScore++;\n }\n if (fScore > sScore)\n System.out.println(\"Fennec\");\n else\n System.out.println(\"Snuke\");\n }\n\n ArrayList getPath() {\n int[] log = new int[n];\n int[] prev = new int[n];\n Arrays.fill(log, Integer.MAX_VALUE);\n PriorityQueue queue =\n new PriorityQueue<>((n1, n2) -> Integer.compare(n2.rank, n1.rank));\n log[0] = 0;\n Arrays.fill(prev, -1);\n prev[0] = 0;\n for (Edge e: es.get(0)) {\n queue.add(new Node(e.to, 1));\n prev[e.to] = 0;\n }\n while (!queue.isEmpty()) {\n Node n = queue.poll();\n if (n.rank > log[n.id])\n continue;\n log[n.id] = n.rank;\n for (Edge e: es.get(n.id)) {\n if (log[e.to] > log[n.id] + 1) {\n prev[e.to] = n.id;\n queue.add(new Node(e.to, log[n.id] + 1));\n }\n }\n }\n ArrayList path = new ArrayList<>(n-1);\n int current = n - 1;\n while (current != 0) {\n path.add(0, current);\n current = prev[current];\n }\n path.add(0, 0);\n return path;\n }\n\n private class Edge {\n int from, to;\n Edge(int f, int t) {\n from = f;\n to = t;\n }\n }\n\n private class Node {\n int id;\n int rank;\n Node(int id, int rank) {\n this.id = id;\n this.rank = rank;\n }\n }\n\n private class UnionFind {\n int[] parent;\n UnionFind(int n) {\n parent = new int[n];\n for (int i = 0; i < n; i++) {\n parent[i] = i;\n }\n }\n\n int getRoot(int x) {\n if (x == parent[x])\n return x;\n return parent[x] = getRoot(parent[x]);\n }\n\n boolean hasSamePar(int x, int y) {\n return getRoot(x) == getRoot(y);\n }\n\n void unite(int x, int y) {\n int px = getRoot(x);\n int py = getRoot(y);\n if (px == py)\n return;\n parent[x] = py;\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1500171868, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03660.html", "problem_id": "p03660", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03660/input.txt", "sample_output_relpath": "derived/input_output/data/p03660/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03660/Java/s432575360.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s432575360", "user_id": "u067614599"}, "prompt_components": {"gold_output": "Fennec\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\n\npublic class Main {\n int n;\n ArrayList> es;\n public static void main(String[] args) {\n Main m = new Main();\n m.read();\n m.solve();\n }\n\n void read() {\n Scanner sc = new Scanner(System.in);\n n = sc.nextInt();\n es = new ArrayList<>(n);\n for (int i = 0; i < n; i++) {\n es.add(new ArrayList<>());\n }\n for (int i = 0; i < n - 1; i++) {\n int a = sc.nextInt() - 1;\n int b = sc.nextInt() - 1;\n es.get(a).add(new Edge(a, b));\n es.get(b).add(new Edge(b, a));\n }\n }\n\n void solve() {\n UnionFind uf = new UnionFind(n);\n int sScore = 0, fScore = 0;\n ArrayList path = getPath();\n int mid = (path.size() - 1) / 2;\n int midFrom = path.get(mid);\n int midTo = path.get(mid+1);\n for (int i = 0; i < n; i++) {\n ArrayList ess = es.get(i);\n for (int j = 0; j < ess.size(); j++) {\n if ((i == midFrom && ess.get(j).to == midTo) ||\n (i == midTo && ess.get(j).to == midFrom))\n continue;\n uf.unite(i, ess.get(j).to);\n }\n }\n for (int i = 0; i < n; i++) {\n if (uf.hasSamePar(0, i))\n fScore++;\n else\n sScore++;\n }\n if (fScore > sScore)\n System.out.println(\"Fennec\");\n else\n System.out.println(\"Snuke\");\n }\n\n ArrayList getPath() {\n int[] log = new int[n];\n int[] prev = new int[n];\n Arrays.fill(log, Integer.MAX_VALUE);\n PriorityQueue queue =\n new PriorityQueue<>((n1, n2) -> Integer.compare(n2.rank, n1.rank));\n log[0] = 0;\n Arrays.fill(prev, -1);\n prev[0] = 0;\n for (Edge e: es.get(0)) {\n queue.add(new Node(e.to, 1));\n prev[e.to] = 0;\n }\n while (!queue.isEmpty()) {\n Node n = queue.poll();\n if (n.rank > log[n.id])\n continue;\n log[n.id] = n.rank;\n for (Edge e: es.get(n.id)) {\n if (log[e.to] > log[n.id] + 1) {\n prev[e.to] = n.id;\n queue.add(new Node(e.to, log[n.id] + 1));\n }\n }\n }\n ArrayList path = new ArrayList<>(n-1);\n int current = n - 1;\n while (current != 0) {\n path.add(0, current);\n current = prev[current];\n }\n path.add(0, 0);\n return path;\n }\n\n private class Edge {\n int from, to;\n Edge(int f, int t) {\n from = f;\n to = t;\n }\n }\n\n private class Node {\n int id;\n int rank;\n Node(int id, int rank) {\n this.id = id;\n this.rank = rank;\n }\n }\n\n private class UnionFind {\n int[] parent;\n UnionFind(int n) {\n parent = new int[n];\n for (int i = 0; i < n; i++) {\n parent[i] = i;\n }\n }\n\n int getRoot(int x) {\n if (x == parent[x])\n return x;\n return parent[x] = getRoot(parent[x]);\n }\n\n boolean hasSamePar(int x, int y) {\n return getRoot(x) == getRoot(y);\n }\n\n void unite(int x, int y) {\n int px = getRoot(x);\n int py = getRoot(y);\n if (px == py)\n return;\n parent[x] = py;\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFennec and Snuke are playing a board game.\n\nOn the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.\n\nInitially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored.\nFennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell.\nMore specifically, each player performs the following action in her/his turn:\n\nFennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.\n\nSnuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.\n\nA player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf Fennec wins, print Fennec; if Snuke wins, print Snuke.\n\nSample Input 1\n\n7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n\nSample Output 1\n\nFennec\n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.\n\nSample Input 2\n\n4\n1 4\n4 2\n2 3\n\nSample Output 2\n\nSnuke", "sample_input": "7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n"}, "reference_outputs": ["Fennec\n"], "source_document_id": "p03660", "source_text": "Score : 400 points\n\nProblem Statement\n\nFennec and Snuke are playing a board game.\n\nOn the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.\n\nInitially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored.\nFennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell.\nMore specifically, each player performs the following action in her/his turn:\n\nFennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.\n\nSnuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.\n\nA player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf Fennec wins, print Fennec; if Snuke wins, print Snuke.\n\nSample Input 1\n\n7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n\nSample Output 1\n\nFennec\n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.\n\nSample Input 2\n\n4\n1 4\n4 2\n2 3\n\nSample Output 2\n\nSnuke", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3682, "cpu_time_ms": 1606, "memory_kb": 105392}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s302757886", "group_id": "codeNet:p03665", "input_text": "import java.util.*;\nimport java.util.stream.*;\n\npublic class Main {\n static Scanner scanner = new Scanner(System.in);\n\n public static void main(String[]$) {\n int n = scanner.nextInt(), p = scanner.nextInt();\n System.out.println(IntStream.range(0, n).allMatch(i -> scanner.nextInt() % 2 == 0) ? p == 1 ? 0 : 1L << n : 1L << n - 1);\n }\n}", "language": "Java", "metadata": {"date": 1555628422, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03665.html", "problem_id": "p03665", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03665/input.txt", "sample_output_relpath": "derived/input_output/data/p03665/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03665/Java/s302757886.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s302757886", "user_id": "u981808900"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\nimport java.util.stream.*;\n\npublic class Main {\n static Scanner scanner = new Scanner(System.in);\n\n public static void main(String[]$) {\n int n = scanner.nextInt(), p = scanner.nextInt();\n System.out.println(IntStream.range(0, n).allMatch(i -> scanner.nextInt() % 2 == 0) ? p == 1 ? 0 : 1L << n : 1L << n - 1);\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N bags of biscuits. The i-th bag contains A_i biscuits.\n\nTakaki will select some of these bags and eat all of the biscuits inside.\nHere, it is also possible to select all or none of the bags.\n\nHe would like to select bags so that the total number of biscuits inside is congruent to P modulo 2.\nHow many such ways to select bags there are?\n\nConstraints\n\n1 \\leq N \\leq 50\n\nP = 0 or 1\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of ways to select bags so that the total number of biscuits inside is congruent to P modulo 2.\n\nSample Input 1\n\n2 0\n1 3\n\nSample Output 1\n\n2\n\nThere are two ways to select bags so that the total number of biscuits inside is congruent to 0 modulo 2:\n\nSelect neither bag. The total number of biscuits is 0.\n\nSelect both bags. The total number of biscuits is 4.\n\nSample Input 2\n\n1 1\n50\n\nSample Output 2\n\n0\n\nSample Input 3\n\n3 0\n1 1 1\n\nSample Output 3\n\n4\n\nTwo bags are distinguished even if they contain the same number of biscuits.\n\nSample Input 4\n\n45 1\n17 55 85 55 74 20 90 67 40 70 39 89 91 50 16 24 14 43 24 66 25 9 89 71 41 16 53 13 61 15 85 72 62 67 42 26 36 66 4 87 59 91 4 25 26\n\nSample Output 4\n\n17592186044416", "sample_input": "2 0\n1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03665", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N bags of biscuits. The i-th bag contains A_i biscuits.\n\nTakaki will select some of these bags and eat all of the biscuits inside.\nHere, it is also possible to select all or none of the bags.\n\nHe would like to select bags so that the total number of biscuits inside is congruent to P modulo 2.\nHow many such ways to select bags there are?\n\nConstraints\n\n1 \\leq N \\leq 50\n\nP = 0 or 1\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of ways to select bags so that the total number of biscuits inside is congruent to P modulo 2.\n\nSample Input 1\n\n2 0\n1 3\n\nSample Output 1\n\n2\n\nThere are two ways to select bags so that the total number of biscuits inside is congruent to 0 modulo 2:\n\nSelect neither bag. The total number of biscuits is 0.\n\nSelect both bags. The total number of biscuits is 4.\n\nSample Input 2\n\n1 1\n50\n\nSample Output 2\n\n0\n\nSample Input 3\n\n3 0\n1 1 1\n\nSample Output 3\n\n4\n\nTwo bags are distinguished even if they contain the same number of biscuits.\n\nSample Input 4\n\n45 1\n17 55 85 55 74 20 90 67 40 70 39 89 91 50 16 24 14 43 24 66 25 9 89 71 41 16 53 13 61 15 85 72 62 67 42 26 36 66 4 87 59 91 4 25 26\n\nSample Output 4\n\n17592186044416", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 208, "memory_kb": 28624}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s437381565", "group_id": "codeNet:p03673", "input_text": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n int[] b = new int[n];\n for(int i = 0 ; i < n ; i++){\n a[i] = sc.nextInt();\n b[i] = a[i];\n for(int j = 0 ; j <= i ; j++){\n a[j] = b[i - j];\n }\n for(int j = 0 ; j <= i ; j++){\n b[j] = a[j];\n }\n }\n for(int i = 0 ; i < n ; i++){\n System.out.print(b[i]);\n if(i != n - 1){\n System.out.print(\" \");\n }else{\n System.out.println();\n }\n }\n sc.close();\n }\n}", "language": "Java", "metadata": {"date": 1596300741, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03673.html", "problem_id": "p03673", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03673/input.txt", "sample_output_relpath": "derived/input_output/data/p03673/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03673/Java/s437381565.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s437381565", "user_id": "u073879055"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int[] a = new int[n];\n int[] b = new int[n];\n for(int i = 0 ; i < n ; i++){\n a[i] = sc.nextInt();\n b[i] = a[i];\n for(int j = 0 ; j <= i ; j++){\n a[j] = b[i - j];\n }\n for(int j = 0 ; j <= i ; j++){\n b[j] = a[j];\n }\n }\n for(int i = 0 ; i < n ; i++){\n System.out.print(b[i]);\n if(i != n - 1){\n System.out.print(\" \");\n }else{\n System.out.println();\n }\n }\n sc.close();\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length n, a_1, ..., a_n.\nLet us consider performing the following n operations on an empty sequence b.\n\nThe i-th operation is as follows:\n\nAppend a_i to the end of b.\n\nReverse the order of the elements in b.\n\nFind the sequence b obtained after these n operations.\n\nConstraints\n\n1 \\leq n \\leq 2\\times 10^5\n\n0 \\leq a_i \\leq 10^9\n\nn and a_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint n integers in a line with spaces in between.\nThe i-th integer should be b_i.\n\nSample Input 1\n\n4\n1 2 3 4\n\nSample Output 1\n\n4 2 1 3\n\nAfter step 1 of the first operation, b becomes: 1.\n\nAfter step 2 of the first operation, b becomes: 1.\n\nAfter step 1 of the second operation, b becomes: 1, 2.\n\nAfter step 2 of the second operation, b becomes: 2, 1.\n\nAfter step 1 of the third operation, b becomes: 2, 1, 3.\n\nAfter step 2 of the third operation, b becomes: 3, 1, 2.\n\nAfter step 1 of the fourth operation, b becomes: 3, 1, 2, 4.\n\nAfter step 2 of the fourth operation, b becomes: 4, 2, 1, 3.\n\nThus, the answer is 4 2 1 3.\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n3 1 2\n\nAs shown above in Sample Output 1, b becomes 3, 1, 2 after step 2 of the third operation. Thus, the answer is 3 1 2.\n\nSample Input 3\n\n1\n1000000000\n\nSample Output 3\n\n1000000000\n\nSample Input 4\n\n6\n0 6 7 6 7 0\n\nSample Output 4\n\n0 6 6 0 7 7", "sample_input": "4\n1 2 3 4\n"}, "reference_outputs": ["4 2 1 3\n"], "source_document_id": "p03673", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length n, a_1, ..., a_n.\nLet us consider performing the following n operations on an empty sequence b.\n\nThe i-th operation is as follows:\n\nAppend a_i to the end of b.\n\nReverse the order of the elements in b.\n\nFind the sequence b obtained after these n operations.\n\nConstraints\n\n1 \\leq n \\leq 2\\times 10^5\n\n0 \\leq a_i \\leq 10^9\n\nn and a_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint n integers in a line with spaces in between.\nThe i-th integer should be b_i.\n\nSample Input 1\n\n4\n1 2 3 4\n\nSample Output 1\n\n4 2 1 3\n\nAfter step 1 of the first operation, b becomes: 1.\n\nAfter step 2 of the first operation, b becomes: 1.\n\nAfter step 1 of the second operation, b becomes: 1, 2.\n\nAfter step 2 of the second operation, b becomes: 2, 1.\n\nAfter step 1 of the third operation, b becomes: 2, 1, 3.\n\nAfter step 2 of the third operation, b becomes: 3, 1, 2.\n\nAfter step 1 of the fourth operation, b becomes: 3, 1, 2, 4.\n\nAfter step 2 of the fourth operation, b becomes: 4, 2, 1, 3.\n\nThus, the answer is 4 2 1 3.\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n3 1 2\n\nAs shown above in Sample Output 1, b becomes 3, 1, 2 after step 2 of the third operation. Thus, the answer is 3 1 2.\n\nSample Input 3\n\n1\n1000000000\n\nSample Output 3\n\n1000000000\n\nSample Input 4\n\n6\n0 6 7 6 7 0\n\nSample Output 4\n\n0 6 6 0 7 7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 750, "cpu_time_ms": 2208, "memory_kb": 62548}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s170216089", "group_id": "codeNet:p03683", "input_text": "\nimport java.util.*;\npublic class Main {\n\npublic static void main(String[] args)\n{\n Scanner sc=new Scanner(System.in);\n fact=new long[100002];\n fact[0]=1;\n for(int i=1;i<100002;i++) {\n fact[i]=(1l*fact[i-1]%mod*i%mod)%mod;\n }\n int n=sc.nextInt();\n int m=sc.nextInt();\n if((n==1&&m>2)||(m==1&&n>2)) {\n System.out.println(0);\n }else if((n==1&&m==2)||(m==1&&n==2)) {\n System.out.println(2);\n }\n else {\n if((n%2==0&&m%2==0)||(n%2!=0&&m%2!=0))\n System.out.println((fact[n]%mod*fact[m]%mod*2l%mod)%mod);\n else\n System.out.println((fact[n]%mod*fact[m]%mod)%mod);\n }\n}\n\n\n \nstatic long modInverse(long fac, int p) \n{ \n return pow(fac, p - 2); \n} \n\n\nstatic long nCr(int n, int r, \n int p) \n{ \n\n \n if (r == 0) \n return 1; \n\n\n long [] fac = new long [n + 1]; \n fac[0] = 1; \n\n for (int i = 1; i <= n; i++) \n fac[i] = fac[i - 1] * i % p; \n\n return (fac[n] * modInverse(fac[r], p) \n % p * modInverse(fac[n - r], p) \n % p) \n % p; \n} \n\n\npublic static long[] fact;\npublic static long[] invfact;\npublic static long ncr(int n, int r){\n if(r > n) return 0;\n return ((((fact[n]) * (invfact[r])) % mod)* invfact[n-r]) % mod;\n}\nstatic int mod=(int)1e9+7;\nstatic long pow(long x,long y) {\n long res=1l;\n while(y!=0) {\n if(y%2==1) {\n res=x*res%mod;\n }\n y/=2;\n x=x*x%mod;\n }\n return res;\n}\n\n\n}\n \n\n\n\n\n\n\n", "language": "Java", "metadata": {"date": 1601445905, "filename_ext": "java", "original_language": "Java (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03683.html", "problem_id": "p03683", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03683/input.txt", "sample_output_relpath": "derived/input_output/data/p03683/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03683/Java/s170216089.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s170216089", "user_id": "u018679195"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "\nimport java.util.*;\npublic class Main {\n\npublic static void main(String[] args)\n{\n Scanner sc=new Scanner(System.in);\n fact=new long[100002];\n fact[0]=1;\n for(int i=1;i<100002;i++) {\n fact[i]=(1l*fact[i-1]%mod*i%mod)%mod;\n }\n int n=sc.nextInt();\n int m=sc.nextInt();\n if((n==1&&m>2)||(m==1&&n>2)) {\n System.out.println(0);\n }else if((n==1&&m==2)||(m==1&&n==2)) {\n System.out.println(2);\n }\n else {\n if((n%2==0&&m%2==0)||(n%2!=0&&m%2!=0))\n System.out.println((fact[n]%mod*fact[m]%mod*2l%mod)%mod);\n else\n System.out.println((fact[n]%mod*fact[m]%mod)%mod);\n }\n}\n\n\n \nstatic long modInverse(long fac, int p) \n{ \n return pow(fac, p - 2); \n} \n\n\nstatic long nCr(int n, int r, \n int p) \n{ \n\n \n if (r == 0) \n return 1; \n\n\n long [] fac = new long [n + 1]; \n fac[0] = 1; \n\n for (int i = 1; i <= n; i++) \n fac[i] = fac[i - 1] * i % p; \n\n return (fac[n] * modInverse(fac[r], p) \n % p * modInverse(fac[n - r], p) \n % p) \n % p; \n} \n\n\npublic static long[] fact;\npublic static long[] invfact;\npublic static long ncr(int n, int r){\n if(r > n) return 0;\n return ((((fact[n]) * (invfact[r])) % mod)* invfact[n-r]) % mod;\n}\nstatic int mod=(int)1e9+7;\nstatic long pow(long x,long y) {\n long res=1l;\n while(y!=0) {\n if(y%2==1) {\n res=x*res%mod;\n }\n y/=2;\n x=x*x%mod;\n }\n return res;\n}\n\n\n}\n \n\n\n\n\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N dogs and M monkeys. He wants them to line up in a row.\n\nAs a Japanese saying goes, these dogs and monkeys are on bad terms. (\"ken'en no naka\", literally \"the relationship of dogs and monkeys\", means a relationship of mutual hatred.) Snuke is trying to reconsile them, by arranging the animals so that there are neither two adjacent dogs nor two adjacent monkeys.\n\nHow many such arrangements there are? Find the count modulo 10^9+7 (since animals cannot understand numbers larger than that).\nHere, dogs and monkeys are both distinguishable. Also, two arrangements that result from reversing each other are distinguished.\n\nConstraints\n\n1 ≤ N,M ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of possible arrangements, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n8\n\nWe will denote the dogs by A and B, and the monkeys by C and D. There are eight possible arrangements: ACBD, ADBC, BCAD, BDAC, CADB, CBDA, DACB and DBCA.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 8\n\nSample Output 3\n\n0\n\nSample Input 4\n\n100000 100000\n\nSample Output 4\n\n530123477", "sample_input": "2 2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03683", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N dogs and M monkeys. He wants them to line up in a row.\n\nAs a Japanese saying goes, these dogs and monkeys are on bad terms. (\"ken'en no naka\", literally \"the relationship of dogs and monkeys\", means a relationship of mutual hatred.) Snuke is trying to reconsile them, by arranging the animals so that there are neither two adjacent dogs nor two adjacent monkeys.\n\nHow many such arrangements there are? Find the count modulo 10^9+7 (since animals cannot understand numbers larger than that).\nHere, dogs and monkeys are both distinguishable. Also, two arrangements that result from reversing each other are distinguished.\n\nConstraints\n\n1 ≤ N,M ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of possible arrangements, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n8\n\nWe will denote the dogs by A and B, and the monkeys by C and D. There are eight possible arrangements: ACBD, ADBC, BCAD, BDAC, CADB, CBDA, DACB and DBCA.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 8\n\nSample Output 3\n\n0\n\nSample Input 4\n\n100000 100000\n\nSample Output 4\n\n530123477", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1391, "cpu_time_ms": 119, "memory_kb": 27864}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s413634956", "group_id": "codeNet:p03685", "input_text": "import java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\t\n\t\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\n\t\tint R = sc.nextInt(), C = sc.nextInt(), N = sc.nextInt();\n\t\tPoint[] pts = new Point[N << 1];\n\t\tint sz = 0;\n\t\tfor(int i = 0, j = 0; i < N; ++i)\n\t\t{\n\t\t\tPoint p = new Point(sc.nextInt(), sc.nextInt()), q = new Point(sc.nextInt(), sc.nextInt());\n\t\t\tif(p.onBoundary(R, C) && q.onBoundary(R, C))\n\t\t\t{\n\t\t\t\tpts[sz << 1] = p;\n\t\t\t\tpts[sz << 1 | 1] = q;\n\t\t\t\tp.idx = q.idx = sz++;\n\t\t\t}\n\t\t}\n\t\tpts = Arrays.copyOf(pts, sz << 1);\n\t\tfor(int i = 0; i < sz << 1; ++i)\n\t\t\tpts[i].setFrameIndex(R, C);\n\t\tArrays.sort(pts);\n\t\tboolean possible = true, open[] = new boolean[sz];\n\t\tStack s = new Stack<>();\n\t\tfor(Point p: pts)\n\t\t\tif(!open[p.idx])\n\t\t\t{\n\t\t\t\topen[p.idx] = true;\n\t\t\t\ts.push(p.idx);\n\t\t\t}\n\t\t\telse if(s.pop() != p.idx)\n\t\t\t{\n\t\t\t\tpossible = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tout.println(possible ? \"YES\" : \"NO\");\n\t\tout.close();\n\t}\n\t\n\tstatic class Point implements Comparable\n\t{\n\t\tint x, y, idx, frameIndex;\n\t\t\n\t\tPoint(int a, int b) { x = a; y = b; }\n\t\t\n\t\tboolean onBoundary(int R, int C) { return x == 0 || x == R || y == 0 || y == C; }\n\t\t\n\t\tvoid setFrameIndex(int R, int C)\n\t\t{\n\t\t\tif(y == 0)\n\t\t\t\tframeIndex = x;\n\t\t\telse if(x == R)\n\t\t\t\tframeIndex = R + y;\n\t\t\telse if(y == C)\n\t\t\t\tframeIndex = R + C + R - x;\n\t\t\telse\n\t\t\t\tframeIndex = R + C + R + C - y;\n\t\t}\n\t\t\n\t\tpublic int compareTo(Point p) { return frameIndex - p.frameIndex; }\n\t}\n\t\t\n\tstatic class Scanner \n\t{\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s){\tbr = new BufferedReader(new InputStreamReader(s));}\n\n\t\tpublic Scanner(String s) throws FileNotFoundException{\tbr = new BufferedReader(new FileReader(s));}\n\n\t\tpublic String next() throws IOException \n\t\t{\n\t\t\twhile (st == null || !st.hasMoreTokens()) \n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {return Integer.parseInt(next());}\n\n\t\tpublic long nextLong() throws IOException {return Long.parseLong(next());}\n\n\t\tpublic String nextLine() throws IOException {return br.readLine();}\n\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next()); }\n\n\t\tpublic boolean ready() throws IOException {return br.ready();} \n\t}\n}", "language": "Java", "metadata": {"date": 1498355573, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03685.html", "problem_id": "p03685", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03685/input.txt", "sample_output_relpath": "derived/input_output/data/p03685/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03685/Java/s413634956.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s413634956", "user_id": "u407907081"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.FileNotFoundException;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\t\n\t\n\tpublic static void main(String[] args) throws IOException {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\n\t\tint R = sc.nextInt(), C = sc.nextInt(), N = sc.nextInt();\n\t\tPoint[] pts = new Point[N << 1];\n\t\tint sz = 0;\n\t\tfor(int i = 0, j = 0; i < N; ++i)\n\t\t{\n\t\t\tPoint p = new Point(sc.nextInt(), sc.nextInt()), q = new Point(sc.nextInt(), sc.nextInt());\n\t\t\tif(p.onBoundary(R, C) && q.onBoundary(R, C))\n\t\t\t{\n\t\t\t\tpts[sz << 1] = p;\n\t\t\t\tpts[sz << 1 | 1] = q;\n\t\t\t\tp.idx = q.idx = sz++;\n\t\t\t}\n\t\t}\n\t\tpts = Arrays.copyOf(pts, sz << 1);\n\t\tfor(int i = 0; i < sz << 1; ++i)\n\t\t\tpts[i].setFrameIndex(R, C);\n\t\tArrays.sort(pts);\n\t\tboolean possible = true, open[] = new boolean[sz];\n\t\tStack s = new Stack<>();\n\t\tfor(Point p: pts)\n\t\t\tif(!open[p.idx])\n\t\t\t{\n\t\t\t\topen[p.idx] = true;\n\t\t\t\ts.push(p.idx);\n\t\t\t}\n\t\t\telse if(s.pop() != p.idx)\n\t\t\t{\n\t\t\t\tpossible = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tout.println(possible ? \"YES\" : \"NO\");\n\t\tout.close();\n\t}\n\t\n\tstatic class Point implements Comparable\n\t{\n\t\tint x, y, idx, frameIndex;\n\t\t\n\t\tPoint(int a, int b) { x = a; y = b; }\n\t\t\n\t\tboolean onBoundary(int R, int C) { return x == 0 || x == R || y == 0 || y == C; }\n\t\t\n\t\tvoid setFrameIndex(int R, int C)\n\t\t{\n\t\t\tif(y == 0)\n\t\t\t\tframeIndex = x;\n\t\t\telse if(x == R)\n\t\t\t\tframeIndex = R + y;\n\t\t\telse if(y == C)\n\t\t\t\tframeIndex = R + C + R - x;\n\t\t\telse\n\t\t\t\tframeIndex = R + C + R + C - y;\n\t\t}\n\t\t\n\t\tpublic int compareTo(Point p) { return frameIndex - p.frameIndex; }\n\t}\n\t\t\n\tstatic class Scanner \n\t{\n\t\tStringTokenizer st;\n\t\tBufferedReader br;\n\n\t\tpublic Scanner(InputStream s){\tbr = new BufferedReader(new InputStreamReader(s));}\n\n\t\tpublic Scanner(String s) throws FileNotFoundException{\tbr = new BufferedReader(new FileReader(s));}\n\n\t\tpublic String next() throws IOException \n\t\t{\n\t\t\twhile (st == null || !st.hasMoreTokens()) \n\t\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() throws IOException {return Integer.parseInt(next());}\n\n\t\tpublic long nextLong() throws IOException {return Long.parseLong(next());}\n\n\t\tpublic String nextLine() throws IOException {return br.readLine();}\n\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next()); }\n\n\t\tpublic boolean ready() throws IOException {return br.ready();} \n\t}\n}", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSnuke is playing a puzzle game.\nIn this game, you are given a rectangular board of dimensions R × C, filled with numbers. Each integer i from 1 through N is written twice, at the coordinates (x_{i,1},y_{i,1}) and (x_{i,2},y_{i,2}).\n\nThe objective is to draw a curve connecting the pair of points where the same integer is written, for every integer from 1 through N.\nHere, the curves may not go outside the board or cross each other.\n\nDetermine whether this is possible.\n\nConstraints\n\n1 ≤ R,C ≤ 10^8\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_{i,1},x_{i,2} ≤ R(1 ≤ i ≤ N)\n\n0 ≤ y_{i,1},y_{i,2} ≤ C(1 ≤ i ≤ N)\n\nAll given points are distinct.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR C N\nx_{1,1} y_{1,1} x_{1,2} y_{1,2}\n:\nx_{N,1} y_{N,1} x_{N,2} y_{N,2}\n\nOutput\n\nPrint YES if the objective is achievable; print NO otherwise.\n\nSample Input 1\n\n4 2 3\n0 1 3 1\n1 1 4 1\n2 0 2 2\n\nSample Output 1\n\nYES\n\nThe above figure shows a possible solution.\n\nSample Input 2\n\n2 2 4\n0 0 2 2\n2 0 0 1\n0 2 1 2\n1 1 2 1\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n5 5 7\n0 0 2 4\n2 3 4 5\n3 5 5 2\n5 5 5 4\n0 3 5 1\n2 2 4 4\n0 5 4 1\n\nSample Output 3\n\nYES\n\nSample Input 4\n\n1 1 2\n0 0 1 1\n1 0 0 1\n\nSample Output 4\n\nNO", "sample_input": "4 2 3\n0 1 3 1\n1 1 4 1\n2 0 2 2\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03685", "source_text": "Score : 700 points\n\nProblem Statement\n\nSnuke is playing a puzzle game.\nIn this game, you are given a rectangular board of dimensions R × C, filled with numbers. Each integer i from 1 through N is written twice, at the coordinates (x_{i,1},y_{i,1}) and (x_{i,2},y_{i,2}).\n\nThe objective is to draw a curve connecting the pair of points where the same integer is written, for every integer from 1 through N.\nHere, the curves may not go outside the board or cross each other.\n\nDetermine whether this is possible.\n\nConstraints\n\n1 ≤ R,C ≤ 10^8\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_{i,1},x_{i,2} ≤ R(1 ≤ i ≤ N)\n\n0 ≤ y_{i,1},y_{i,2} ≤ C(1 ≤ i ≤ N)\n\nAll given points are distinct.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR C N\nx_{1,1} y_{1,1} x_{1,2} y_{1,2}\n:\nx_{N,1} y_{N,1} x_{N,2} y_{N,2}\n\nOutput\n\nPrint YES if the objective is achievable; print NO otherwise.\n\nSample Input 1\n\n4 2 3\n0 1 3 1\n1 1 4 1\n2 0 2 2\n\nSample Output 1\n\nYES\n\nThe above figure shows a possible solution.\n\nSample Input 2\n\n2 2 4\n0 0 2 2\n2 0 0 1\n0 2 1 2\n1 1 2 1\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n5 5 7\n0 0 2 4\n2 3 4 5\n3 5 5 2\n5 5 5 4\n0 3 5 1\n2 2 4 4\n0 5 4 1\n\nSample Output 3\n\nYES\n\nSample Input 4\n\n1 1 2\n0 0 1 1\n1 0 0 1\n\nSample Output 4\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2612, "cpu_time_ms": 525, "memory_kb": 49988}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s638245395", "group_id": "codeNet:p03689", "input_text": "\nimport java.io.FileNotFoundException;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws FileNotFoundException {\n\t\tnew Main().run();\n\t}\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint H = sc.nextInt();\n\t\tint W = sc.nextInt();\n\t\tint h = sc.nextInt();\n\t\tint w = sc.nextInt();\n\t\tif (H % h == 0 && W % w == 0) {\n\t\t\tSystem.out.println(\"No\");\n\t\t\treturn;\n\t\t} else {\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}\n\t\tint[][] a = new int[H][W];\n\t\tfor (int i = 0; i < H; i += h) {\n\t\t\tfor (int j = 0; j < W; j += w) {\n\t\t\t\ta[i][j] = 1_000_000_000 - 1;\n\t\t\t\tif (i + h - 1 < H && j + w - 1 < W) {\n\t\t\t\t\ta[i + h - 1][j + w - 1] = -1_000_000_000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tSystem.out.print(a[i][j] + (j < W - 1 ? \" \" : \"\\n\"));\n\t\t\t}\n\t\t}\n\n\t}\n\n\tvoid tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n}\n", "language": "Java", "metadata": {"date": 1498328156, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03689.html", "problem_id": "p03689", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03689/input.txt", "sample_output_relpath": "derived/input_output/data/p03689/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03689/Java/s638245395.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s638245395", "user_id": "u313111801"}, "prompt_components": {"gold_output": "Yes\n1 1 1\n1 -4 1\n1 1 1\n", "input_to_evaluate": "\nimport java.io.FileNotFoundException;\nimport java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) throws FileNotFoundException {\n\t\tnew Main().run();\n\t}\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint H = sc.nextInt();\n\t\tint W = sc.nextInt();\n\t\tint h = sc.nextInt();\n\t\tint w = sc.nextInt();\n\t\tif (H % h == 0 && W % w == 0) {\n\t\t\tSystem.out.println(\"No\");\n\t\t\treturn;\n\t\t} else {\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}\n\t\tint[][] a = new int[H][W];\n\t\tfor (int i = 0; i < H; i += h) {\n\t\t\tfor (int j = 0; j < W; j += w) {\n\t\t\t\ta[i][j] = 1_000_000_000 - 1;\n\t\t\t\tif (i + h - 1 < H && j + w - 1 < W) {\n\t\t\t\t\ta[i + h - 1][j + w - 1] = -1_000_000_000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tSystem.out.print(a[i][j] + (j < W - 1 ? \" \" : \"\\n\"));\n\t\t\t}\n\t\t}\n\n\t}\n\n\tvoid tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n}\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given four integers: H, W, h and w (1 ≤ h ≤ H, 1 ≤ w ≤ W).\nDetermine whether there exists a matrix such that all of the following conditions are held, and construct one such matrix if the answer is positive:\n\nThe matrix has H rows and W columns.\n\nEach element of the matrix is an integer between -10^9 and 10^9 (inclusive).\n\nThe sum of all the elements of the matrix is positive.\n\nThe sum of all the elements within every subrectangle with h rows and w columns in the matrix is negative.\n\nConstraints\n\n1 ≤ h ≤ H ≤ 500\n\n1 ≤ w ≤ W ≤ 500\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W h w\n\nOutput\n\nIf there does not exist a matrix that satisfies all of the conditions, print No.\n\nOtherwise, print Yes in the first line, and print a matrix in the subsequent lines in the following format:\n\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nHere, a_{ij} represents the (i,\\ j) element of the matrix.\n\nSample Input 1\n\n3 3 2 2\n\nSample Output 1\n\nYes\n1 1 1\n1 -4 1\n1 1 1\n\nThe sum of all the elements of this matrix is 4, which is positive.\nAlso, in this matrix, there are four subrectangles with 2 rows and 2 columns as shown below. For each of them, the sum of all the elements inside is -1, which is negative.\n\nSample Input 2\n\n2 4 1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n3 4 2 3\n\nSample Output 3\n\nYes\n2 -5 8 7\n3 -5 -4 -5\n2 1 -1 7", "sample_input": "3 3 2 2\n"}, "reference_outputs": ["Yes\n1 1 1\n1 -4 1\n1 1 1\n"], "source_document_id": "p03689", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given four integers: H, W, h and w (1 ≤ h ≤ H, 1 ≤ w ≤ W).\nDetermine whether there exists a matrix such that all of the following conditions are held, and construct one such matrix if the answer is positive:\n\nThe matrix has H rows and W columns.\n\nEach element of the matrix is an integer between -10^9 and 10^9 (inclusive).\n\nThe sum of all the elements of the matrix is positive.\n\nThe sum of all the elements within every subrectangle with h rows and w columns in the matrix is negative.\n\nConstraints\n\n1 ≤ h ≤ H ≤ 500\n\n1 ≤ w ≤ W ≤ 500\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W h w\n\nOutput\n\nIf there does not exist a matrix that satisfies all of the conditions, print No.\n\nOtherwise, print Yes in the first line, and print a matrix in the subsequent lines in the following format:\n\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nHere, a_{ij} represents the (i,\\ j) element of the matrix.\n\nSample Input 1\n\n3 3 2 2\n\nSample Output 1\n\nYes\n1 1 1\n1 -4 1\n1 1 1\n\nThe sum of all the elements of this matrix is 4, which is positive.\nAlso, in this matrix, there are four subrectangles with 2 rows and 2 columns as shown below. For each of them, the sum of all the elements inside is -1, which is negative.\n\nSample Input 2\n\n2 4 1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n3 4 2 3\n\nSample Output 3\n\nYes\n2 -5 8 7\n3 -5 -4 -5\n2 1 -1 7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 935, "cpu_time_ms": 838, "memory_kb": 54836}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s278386169", "group_id": "codeNet:p03694", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException{\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\t\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tString[] str = new String[n];\n\t\tstr = br.readLine().split(\"　\");\n\t\tint[] num = new int[n];\n \t\t\n\t\tfor(int i=0; inum[i+1]) max=num[i+1];\n\t\t}\n\t}\n\n}", "language": "Java", "metadata": {"date": 1528751127, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03694.html", "problem_id": "p03694", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03694/input.txt", "sample_output_relpath": "derived/input_output/data/p03694/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03694/Java/s278386169.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s278386169", "user_id": "u028413707"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws IOException{\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\t\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tString[] str = new String[n];\n\t\tstr = br.readLine().split(\"　\");\n\t\tint[] num = new int[n];\n \t\t\n\t\tfor(int i=0; inum[i+1]) max=num[i+1];\n\t\t}\n\t}\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts.\n\nThere are N houses along TopCoDeer street. The i-th house is located at coordinate a_i. He has decided to deliver gifts to all these houses.\n\nFind the minimum distance to be traveled when AtCoDeer can start and end his travel at any positions.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n0 ≤ a_i ≤ 1000\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum distance to be traveled.\n\nSample Input 1\n\n4\n2 3 7 9\n\nSample Output 1\n\n7\n\nThe travel distance of 7 can be achieved by starting at coordinate 9 and traveling straight to coordinate 2.\n\nIt is not possible to do with a travel distance of less than 7, and thus 7 is the minimum distance to be traveled.\n\nSample Input 2\n\n8\n3 1 4 1 5 9 2 6\n\nSample Output 2\n\n8\n\nThere may be more than one house at a position.", "sample_input": "4\n2 3 7 9\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03694", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts.\n\nThere are N houses along TopCoDeer street. The i-th house is located at coordinate a_i. He has decided to deliver gifts to all these houses.\n\nFind the minimum distance to be traveled when AtCoDeer can start and end his travel at any positions.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n0 ≤ a_i ≤ 1000\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum distance to be traveled.\n\nSample Input 1\n\n4\n2 3 7 9\n\nSample Output 1\n\n7\n\nThe travel distance of 7 can be achieved by starting at coordinate 9 and traveling straight to coordinate 2.\n\nIt is not possible to do with a travel distance of less than 7, and thus 7 is the minimum distance to be traveled.\n\nSample Input 2\n\n8\n3 1 4 1 5 9 2 6\n\nSample Output 2\n\n8\n\nThere may be more than one house at a position.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 709, "cpu_time_ms": 70, "memory_kb": 21332}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s678444537", "group_id": "codeNet:p03695", "input_text": "\nimport java.util.*;\nimport java.io.*;\n\npublic class Main{\n public static void main(String[] args) {\n try(BufferedReader in = new BufferedReader(new InputStreamReader(System.in))){\n boolean[] colors = new boolean[8];\n int master = 0;\n int N = Integer.parseInt(in.readLine());\n for(String s: in.readLine().split(\" \")){\n int rating = Integer.parseInt(s);\n for(int i=0;i<8;i++){\n if(rating < (i+1)*400){\n colors[i] = colors[i] || true;\n break;\n }\n }\n if(rating>=3200){\n master++;\n }\n }\n int cnt=0;\n for(int i=0;i<8;i++){\n if(colors[i]){\n cnt++;\n }\n }\n int min = Math.max(1, cnt);\n int max = cnt+master;\n System.out.println(min+\" \"+max);\n }catch(IOException e){\n e.printStackTrace();\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1497147079, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03695.html", "problem_id": "p03695", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03695/input.txt", "sample_output_relpath": "derived/input_output/data/p03695/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03695/Java/s678444537.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s678444537", "user_id": "u076936237"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "\nimport java.util.*;\nimport java.io.*;\n\npublic class Main{\n public static void main(String[] args) {\n try(BufferedReader in = new BufferedReader(new InputStreamReader(System.in))){\n boolean[] colors = new boolean[8];\n int master = 0;\n int N = Integer.parseInt(in.readLine());\n for(String s: in.readLine().split(\" \")){\n int rating = Integer.parseInt(s);\n for(int i=0;i<8;i++){\n if(rating < (i+1)*400){\n colors[i] = colors[i] || true;\n break;\n }\n }\n if(rating>=3200){\n master++;\n }\n }\n int cnt=0;\n for(int i=0;i<8;i++){\n if(colors[i]){\n cnt++;\n }\n }\n int min = Math.max(1, cnt);\n int max = cnt+master;\n System.out.println(min+\" \"+max);\n }catch(IOException e){\n e.printStackTrace();\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "sample_input": "4\n2100 2500 2700 2700\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p03695", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 866, "cpu_time_ms": 73, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s378393566", "group_id": "codeNet:p03696", "input_text": "import java.util.*;\n\nclass Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n String S = sc.next();\n int end = N-1;\n while(end>=0&&S.charAt(end)=='(') end--;\n if(end==-1){\n StringBuilder sb = new StringBuilder();\n for(int i=0;i=0;i--){\n if(S.charAt(i)=='(') cnt1++;\n else cnt2++;\n }\n StringBuilder sb = new StringBuilder();\n for(int i=0;i=0&&S.charAt(end)=='(') end--;\n if(end==-1){\n StringBuilder sb = new StringBuilder();\n for(int i=0;i=0;i--){\n if(S.charAt(i)=='(') cnt1++;\n else cnt2++;\n }\n StringBuilder sb = new StringBuilder();\n for(int i=0;i= 0 ? \"error\" : a + b);\n\n\t\tsc.close();\n\n\t}\n\n}", "language": "Java", "metadata": {"date": 1597279781, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03697.html", "problem_id": "p03697", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03697/input.txt", "sample_output_relpath": "derived/input_output/data/p03697/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03697/Java/s081889583.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s081889583", "user_id": "u518703962"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint a = sc.nextInt();\n\t\tint b = sc.nextInt();\n\n\t\tSystem.out.println(a + b >= 0 ? \"error\" : a + b);\n\n\t\tsc.close();\n\n\t}\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "sample_input": "6 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03697", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 251, "cpu_time_ms": 116, "memory_kb": 35716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s423133929", "group_id": "codeNet:p03699", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint score = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x = sc.nextInt();\n\t\t\tif (x % 10 > 0) {\n\t\t\t\tscore += x;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(score);\n\t\tsc.close();\n\t}\n}\n", "language": "Java", "metadata": {"date": 1498274831, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03699.html", "problem_id": "p03699", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03699/input.txt", "sample_output_relpath": "derived/input_output/data/p03699/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03699/Java/s423133929.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s423133929", "user_id": "u083542245"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint score = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x = sc.nextInt();\n\t\t\tif (x % 10 > 0) {\n\t\t\t\tscore += x;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(score);\n\t\tsc.close();\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are taking a computer-based examination. The examination consists of N questions, and the score allocated to the i-th question is s_i. Your answer to each question will be judged as either \"correct\" or \"incorrect\", and your grade will be the sum of the points allocated to questions that are answered correctly. When you finish answering the questions, your answers will be immediately judged and your grade will be displayed... if everything goes well.\n\nHowever, the examination system is actually flawed, and if your grade is a multiple of 10, the system displays 0 as your grade. Otherwise, your grade is displayed correctly. In this situation, what is the maximum value that can be displayed as your grade?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 100\n\n1 ≤ s_i ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the maximum value that can be displayed as your grade.\n\nSample Input 1\n\n3\n5\n10\n15\n\nSample Output 1\n\n25\n\nYour grade will be 25 if the 10-point and 15-point questions are answered correctly and the 5-point question is not, and this grade will be displayed correctly. Your grade will become 30 if the 5-point question is also answered correctly, but this grade will be incorrectly displayed as 0.\n\nSample Input 2\n\n3\n10\n10\n15\n\nSample Output 2\n\n35\n\nYour grade will be 35 if all the questions are answered correctly, and this grade will be displayed correctly.\n\nSample Input 3\n\n3\n10\n20\n30\n\nSample Output 3\n\n0\n\nRegardless of whether each question is answered correctly or not, your grade will be a multiple of 10 and displayed as 0.", "sample_input": "3\n5\n10\n15\n"}, "reference_outputs": ["25\n"], "source_document_id": "p03699", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are taking a computer-based examination. The examination consists of N questions, and the score allocated to the i-th question is s_i. Your answer to each question will be judged as either \"correct\" or \"incorrect\", and your grade will be the sum of the points allocated to questions that are answered correctly. When you finish answering the questions, your answers will be immediately judged and your grade will be displayed... if everything goes well.\n\nHowever, the examination system is actually flawed, and if your grade is a multiple of 10, the system displays 0 as your grade. Otherwise, your grade is displayed correctly. In this situation, what is the maximum value that can be displayed as your grade?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 100\n\n1 ≤ s_i ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the maximum value that can be displayed as your grade.\n\nSample Input 1\n\n3\n5\n10\n15\n\nSample Output 1\n\n25\n\nYour grade will be 25 if the 10-point and 15-point questions are answered correctly and the 5-point question is not, and this grade will be displayed correctly. Your grade will become 30 if the 5-point question is also answered correctly, but this grade will be incorrectly displayed as 0.\n\nSample Input 2\n\n3\n10\n10\n15\n\nSample Output 2\n\n35\n\nYour grade will be 35 if all the questions are answered correctly, and this grade will be displayed correctly.\n\nSample Input 3\n\n3\n10\n20\n30\n\nSample Output 3\n\n0\n\nRegardless of whether each question is answered correctly or not, your grade will be a multiple of 10 and displayed as 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 322, "cpu_time_ms": 109, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s214323679", "group_id": "codeNet:p03707", "input_text": "import java.util.*;\nimport java.io.*;\n \npublic class Main {\n\t\n\t\n\tpublic static int cusumCount(int[][] cusum, int x, int y){\n\t\tif(x>=0&&y>=0) return cusum[x][y];\n\t\telse return 0;\n\t}\n\tpublic static int cusumCount(int[][] cusum, int x1,int y1, int x2, int y2){\n\t\treturn cusumCount(cusum,x2,y2) - cusumCount(cusum,x1-1,y2) - cusumCount(cusum,x2,y1-1) + cusumCount(cusum,x1-1,y1-1);\n\t}\n\t\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n final int N = sc.nextInt();\n final int M = sc.nextInt();\n final int Q = sc.nextInt();\n sc.nextLine();\n boolean[][] blue = new boolean[N][M];\n //[0][0] [0][1] [0][2] ... [0][M-1]\n //[1][0] [1][1] [1][2] ... [1][M-1]\n // :\n // :\n //[N-1][0] [N-1][1] ...... [N-1][M-1]\n \n \n for(int n=0;n=0&&y>=0) return cusum[x][y];\n\t\telse return 0;\n\t}\n\tpublic static int cusumCount(int[][] cusum, int x1,int y1, int x2, int y2){\n\t\treturn cusumCount(cusum,x2,y2) - cusumCount(cusum,x1-1,y2) - cusumCount(cusum,x2,y1-1) + cusumCount(cusum,x1-1,y1-1);\n\t}\n\t\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n final int N = sc.nextInt();\n final int M = sc.nextInt();\n final int Q = sc.nextInt();\n sc.nextLine();\n boolean[][] blue = new boolean[N][M];\n //[0][0] [0][1] [0][2] ... [0][M-1]\n //[1][0] [1][1] [1][2] ... [1][M-1]\n // :\n // :\n //[N-1][0] [N-1][1] ...... [N-1][M-1]\n \n \n for(int n=0;n() {\n\t\t\t@Override\n\t\t\tpublic int compare(int[] o1, int[] o2) {\n\t\t\t\treturn Integer.compare(o1[1], o2[1]);\n\t\t\t}\n\t\t});\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\te[i][2] = i;\n\t\t}\n\n\t\tArrays.sort(e, new Comparator() {\n\t\t\t@Override\n\t\t\tpublic int compare(int[] o1, int[] o2) {\n\t\t\t\treturn Integer.compare(o1[0], o2[0]);\n\t\t\t}\n\t\t});\n\n\t\tint[][] min = new int[n][2];\n\t\tint[][] max = new int[n][2];\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tmin[i][0] = Integer.MAX_VALUE / 16;\n\t\t\tmax[i][0] = -Integer.MAX_VALUE / 16;\n\t\t\tmin[i][1] = -1;\n\t\t\tmax[i][1] = -1;\n\t\t}\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tif (i == 0 || max[i - 1][0] < e[i][1]) {\n\t\t\t\tmax[i][0] = e[i][1];\n\t\t\t\tmax[i][1] = e[i][2];\n\t\t\t} else {\n\t\t\t\tmax[i][0] = max[i - 1][0];\n\t\t\t\tmax[i][1] = max[i - 1][1];\n\t\t\t}\n\t\t}\n\t\tfor (int i = n - 1; i >= 0; --i) {\n\t\t\tif (i == n - 1 || min[i + 1][0] > e[i][1]) {\n\t\t\t\tmin[i][0] = e[i][1];\n\t\t\t\tmin[i][1] = e[i][2];\n\t\t\t} else {\n\t\t\t\tmin[i][0] = min[i + 1][0];\n\t\t\t\tmin[i][1] = min[i + 1][1];\n\t\t\t}\n\t\t}\n\n\t\tlong[] f = new long[n];\n\t\tlong s = 0;\n\t\tint t = 0;\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\twhile (max[t][1] < min[i][1]) {\n\t\t\t\ts = (s - f[t] + MODULO) % MODULO;\n\t\t\t\t++t;\n\t\t\t}\n\t\t\tf[i] = s;\n\t\t\tif (min[i][1] == min[0][1]) {\n\t\t\t\t++f[i];\n\t\t\t}\n\t\t\ts += f[i];\n\t\t\ts %= MODULO;\n\t\t\tf[i] %= MODULO;\n\t\t}\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tif (max[n - 1][1] == max[i][1]) {\n\t\t\t\tans += f[i];\n\t\t\t}\n\t\t\twhile (ans >= MODULO) {\n\t\t\t\tans -= MODULO;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n\tstatic void tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n\n}", "language": "Java", "metadata": {"date": 1496113121, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03709.html", "problem_id": "p03709", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03709/input.txt", "sample_output_relpath": "derived/input_output/data/p03709/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03709/Java/s936405098.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s936405098", "user_id": "u313111801"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tlong MODULO = 1_000_000_000 + 7;\n\n\tvoid run() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint[][] e = new int[n][3];\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\te[i][0] = sc.nextInt();// x\n\t\t\te[i][1] = sc.nextInt();// v\n\t\t\te[i][2] = -1;\n\t\t}\n\t\tArrays.sort(e, new Comparator() {\n\t\t\t@Override\n\t\t\tpublic int compare(int[] o1, int[] o2) {\n\t\t\t\treturn Integer.compare(o1[1], o2[1]);\n\t\t\t}\n\t\t});\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\te[i][2] = i;\n\t\t}\n\n\t\tArrays.sort(e, new Comparator() {\n\t\t\t@Override\n\t\t\tpublic int compare(int[] o1, int[] o2) {\n\t\t\t\treturn Integer.compare(o1[0], o2[0]);\n\t\t\t}\n\t\t});\n\n\t\tint[][] min = new int[n][2];\n\t\tint[][] max = new int[n][2];\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tmin[i][0] = Integer.MAX_VALUE / 16;\n\t\t\tmax[i][0] = -Integer.MAX_VALUE / 16;\n\t\t\tmin[i][1] = -1;\n\t\t\tmax[i][1] = -1;\n\t\t}\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tif (i == 0 || max[i - 1][0] < e[i][1]) {\n\t\t\t\tmax[i][0] = e[i][1];\n\t\t\t\tmax[i][1] = e[i][2];\n\t\t\t} else {\n\t\t\t\tmax[i][0] = max[i - 1][0];\n\t\t\t\tmax[i][1] = max[i - 1][1];\n\t\t\t}\n\t\t}\n\t\tfor (int i = n - 1; i >= 0; --i) {\n\t\t\tif (i == n - 1 || min[i + 1][0] > e[i][1]) {\n\t\t\t\tmin[i][0] = e[i][1];\n\t\t\t\tmin[i][1] = e[i][2];\n\t\t\t} else {\n\t\t\t\tmin[i][0] = min[i + 1][0];\n\t\t\t\tmin[i][1] = min[i + 1][1];\n\t\t\t}\n\t\t}\n\n\t\tlong[] f = new long[n];\n\t\tlong s = 0;\n\t\tint t = 0;\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\twhile (max[t][1] < min[i][1]) {\n\t\t\t\ts = (s - f[t] + MODULO) % MODULO;\n\t\t\t\t++t;\n\t\t\t}\n\t\t\tf[i] = s;\n\t\t\tif (min[i][1] == min[0][1]) {\n\t\t\t\t++f[i];\n\t\t\t}\n\t\t\ts += f[i];\n\t\t\ts %= MODULO;\n\t\t\tf[i] %= MODULO;\n\t\t}\n\t\tlong ans = 0;\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tif (max[n - 1][1] == max[i][1]) {\n\t\t\t\tans += f[i];\n\t\t\t}\n\t\t\twhile (ans >= MODULO) {\n\t\t\t\tans -= MODULO;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t}\n\n\tstatic void tr(Object... objects) {\n\t\tSystem.out.println(Arrays.deepToString(objects));\n\t}\n\n}", "problem_context": "Score : 1200 points\n\nProblem Statement\n\nTakahashi is an expert of Clone Jutsu, a secret art that creates copies of his body.\n\nOn a number line, there are N copies of Takahashi, numbered 1 through N.\nThe i-th copy is located at position X_i and starts walking with velocity V_i in the positive direction at time 0.\n\nKenus is a master of Transformation Jutsu, and not only can he change into a person other than himself, but he can also transform another person into someone else.\n\nKenus can select some of the copies of Takahashi at time 0, and transform them into copies of Aoki, another Ninja.\nThe walking velocity of a copy does not change when it transforms.\nFrom then on, whenever a copy of Takahashi and a copy of Aoki are at the same coordinate, that copy of Takahashi transforms into a copy of Aoki.\n\nAmong the 2^N ways to transform some copies of Takahashi into copies of Aoki at time 0, in how many ways will all the copies of Takahashi become copies of Aoki after a sufficiently long time?\nFind the count modulo 10^9+7.\n\nConstraints\n\n1 ≤ N ≤ 200000\n\n1 ≤ X_i,V_i ≤ 10^9(1 ≤ i ≤ N)\n\nX_i and V_i are integers.\n\nAll X_i are distinct.\n\nAll V_i are distinct.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nX_1 V_1\n:\nX_N V_N\n\nOutput\n\nPrint the number of the ways that cause all the copies of Takahashi to turn into copies of Aoki after a sufficiently long time, modulo 10^9+7.\n\nSample Input 1\n\n3\n2 5\n6 1\n3 7\n\nSample Output 1\n\n6\n\nAll copies of Takahashi will turn into copies of Aoki after a sufficiently long time if Kenus transforms one of the following sets of copies of Takahashi into copies of Aoki: (2), (3), (1,2), (1,3), (2,3) and (1,2,3).\n\nSample Input 2\n\n4\n3 7\n2 9\n8 16\n10 8\n\nSample Output 2\n\n9", "sample_input": "3\n2 5\n6 1\n3 7\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03709", "source_text": "Score : 1200 points\n\nProblem Statement\n\nTakahashi is an expert of Clone Jutsu, a secret art that creates copies of his body.\n\nOn a number line, there are N copies of Takahashi, numbered 1 through N.\nThe i-th copy is located at position X_i and starts walking with velocity V_i in the positive direction at time 0.\n\nKenus is a master of Transformation Jutsu, and not only can he change into a person other than himself, but he can also transform another person into someone else.\n\nKenus can select some of the copies of Takahashi at time 0, and transform them into copies of Aoki, another Ninja.\nThe walking velocity of a copy does not change when it transforms.\nFrom then on, whenever a copy of Takahashi and a copy of Aoki are at the same coordinate, that copy of Takahashi transforms into a copy of Aoki.\n\nAmong the 2^N ways to transform some copies of Takahashi into copies of Aoki at time 0, in how many ways will all the copies of Takahashi become copies of Aoki after a sufficiently long time?\nFind the count modulo 10^9+7.\n\nConstraints\n\n1 ≤ N ≤ 200000\n\n1 ≤ X_i,V_i ≤ 10^9(1 ≤ i ≤ N)\n\nX_i and V_i are integers.\n\nAll X_i are distinct.\n\nAll V_i are distinct.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nX_1 V_1\n:\nX_N V_N\n\nOutput\n\nPrint the number of the ways that cause all the copies of Takahashi to turn into copies of Aoki after a sufficiently long time, modulo 10^9+7.\n\nSample Input 1\n\n3\n2 5\n6 1\n3 7\n\nSample Output 1\n\n6\n\nAll copies of Takahashi will turn into copies of Aoki after a sufficiently long time if Kenus transforms one of the following sets of copies of Takahashi into copies of Aoki: (2), (3), (1,2), (1,3), (2,3) and (1,2,3).\n\nSample Input 2\n\n4\n3 7\n2 9\n8 16\n10 8\n\nSample Output 2\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2022, "cpu_time_ms": 1386, "memory_kb": 133292}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s422551947", "group_id": "codeNet:p03711", "input_text": "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int a = group(x);\n int b = group(y);\n if(a == b) System.out.println(\"Yes\");\n else System.out.println(\"No\");\n }\n public static int group(int a) {\n if(a == 2) return 1;\n else if(a == 4 || a == 6 || a == 9 || a == 11) return 2;\n else return 3;\n }\n}\n", "language": "Java", "metadata": {"date": 1503386542, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03711.html", "problem_id": "p03711", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03711/input.txt", "sample_output_relpath": "derived/input_output/data/p03711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03711/Java/s422551947.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s422551947", "user_id": "u307037394"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main{\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int x = sc.nextInt();\n int y = sc.nextInt();\n int a = group(x);\n int b = group(y);\n if(a == b) System.out.println(\"Yes\");\n else System.out.println(\"No\");\n }\n public static int group(int a) {\n if(a == 2) return 1;\n else if(a == 4 || a == 6 || a == 9 || a == 11) return 2;\n else return 3;\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "sample_input": "1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03711", "source_text": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 452, "cpu_time_ms": 97, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s714731752", "group_id": "codeNet:p03716", "input_text": "import static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport java.util.*;\nimport java.io.*;\n\npublic class Main {\n\t\n\tvoid solve() {\n\t\tint N = sc.nextInt();\n\t\tint[] A = sc.nextIntArray(3 * N);\n\t\t\n\t\tlong[] B = new long[3 * N + 1];\n\t\tlong[] C = new long[3 * N + 1];\n\t\t\n\t\t{\n\t\t\tPriorityQueue q= new PriorityQueue<>();\n\t\t\tlong sum = 0;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tsum += A[i];\n\t\t\t\tq.add(A[i]);\n\t\t\t}\n\t\t\tfor (int i = N; i <= 3 * N; i++) {\n\t\t\t\tB[i] = sum;\n\t\t\t\tif (i < 3 * N) {\n\t\t\t\t\tsum += A[i];\n\t\t\t\t\tq.add(A[i]);\n\t\t\t\t\tsum -= q.poll();\n\t\t\t\t}\n\t\t\t}\n//\t\t\ttr(B);\n\t\t}\n\t\t{\n\t\t\tPriorityQueue q = new PriorityQueue<>();\n\t\t\tlong sum = 0;\n\t\t\tfor (int i = 3*N-1; i >= 2*N; i--) {\n\t\t\t\tsum += A[i];\n\t\t\t\tq.add(-A[i]);\n\t\t\t}\n\t\t\tfor (int i = 2*N-1; i >= 0; i--) {\n\t\t\t\tC[i+1] = sum;\n\t\t\t\tsum += A[i];\n\t\t\t\tq.add(-A[i]);\n\t\t\t\tsum += q.poll();\n\t\t\t}\n\t\t\tC[0] = sum;\n//\t\t\ttr(C);\n\t\t}\n\t\tlong ans = -(1L << 58);\n\t\tfor (int i = N; i <= 2*N; i++) {\n\t\t\tans = max(B[i] - C[i], ans);\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tstatic void tr(Object... os) { System.err.println(deepToString(os)); }\n\tstatic void tr(int[][] as) { for (int[] a : as) tr(a); }\n\n\tvoid print(int[] a) {\n\t\tout.print(a[0]);\n\t\tfor (int i = 1; i < a.length; i++) out.print(\" \" + a[i]);\n\t\tout.println();\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().run();\n\t}\n\n\tMyScanner sc = null;\n\tPrintWriter out = null;\n\tpublic void run() throws Exception {\n\t\tsc = new MyScanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tfor (;sc.hasNext();) {\n\t\t\tsolve();\n\t\t\tout.flush();\n\t\t}\n\t\tout.close();\n\t}\n\n\tclass MyScanner {\n\t\tString line;\n\t\tBufferedReader reader;\n\t\tStringTokenizer tokenizer;\n\n\t\tpublic MyScanner(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream));\n\t\t\ttokenizer = null;\n\t\t}\n\t\tpublic void eat() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tline = reader.readLine();\n\t\t\t\t\tif (line == null) {\n\t\t\t\t\t\ttokenizer = null;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\ttokenizer = new StringTokenizer(line);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tpublic String next() {\n\t\t\teat();\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\tpublic boolean hasNext() {\n\t\t\teat();\n\t\t\treturn (tokenizer != null && tokenizer.hasMoreElements());\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1495329622, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03716.html", "problem_id": "p03716", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03716/input.txt", "sample_output_relpath": "derived/input_output/data/p03716/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03716/Java/s714731752.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s714731752", "user_id": "u045939752"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import static java.lang.Math.*;\nimport static java.util.Arrays.*;\nimport java.util.*;\nimport java.io.*;\n\npublic class Main {\n\t\n\tvoid solve() {\n\t\tint N = sc.nextInt();\n\t\tint[] A = sc.nextIntArray(3 * N);\n\t\t\n\t\tlong[] B = new long[3 * N + 1];\n\t\tlong[] C = new long[3 * N + 1];\n\t\t\n\t\t{\n\t\t\tPriorityQueue q= new PriorityQueue<>();\n\t\t\tlong sum = 0;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tsum += A[i];\n\t\t\t\tq.add(A[i]);\n\t\t\t}\n\t\t\tfor (int i = N; i <= 3 * N; i++) {\n\t\t\t\tB[i] = sum;\n\t\t\t\tif (i < 3 * N) {\n\t\t\t\t\tsum += A[i];\n\t\t\t\t\tq.add(A[i]);\n\t\t\t\t\tsum -= q.poll();\n\t\t\t\t}\n\t\t\t}\n//\t\t\ttr(B);\n\t\t}\n\t\t{\n\t\t\tPriorityQueue q = new PriorityQueue<>();\n\t\t\tlong sum = 0;\n\t\t\tfor (int i = 3*N-1; i >= 2*N; i--) {\n\t\t\t\tsum += A[i];\n\t\t\t\tq.add(-A[i]);\n\t\t\t}\n\t\t\tfor (int i = 2*N-1; i >= 0; i--) {\n\t\t\t\tC[i+1] = sum;\n\t\t\t\tsum += A[i];\n\t\t\t\tq.add(-A[i]);\n\t\t\t\tsum += q.poll();\n\t\t\t}\n\t\t\tC[0] = sum;\n//\t\t\ttr(C);\n\t\t}\n\t\tlong ans = -(1L << 58);\n\t\tfor (int i = N; i <= 2*N; i++) {\n\t\t\tans = max(B[i] - C[i], ans);\n\t\t}\n\t\tout.println(ans);\n\t}\n\t\n\tstatic void tr(Object... os) { System.err.println(deepToString(os)); }\n\tstatic void tr(int[][] as) { for (int[] a : as) tr(a); }\n\n\tvoid print(int[] a) {\n\t\tout.print(a[0]);\n\t\tfor (int i = 1; i < a.length; i++) out.print(\" \" + a[i]);\n\t\tout.println();\n\t}\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tnew Main().run();\n\t}\n\n\tMyScanner sc = null;\n\tPrintWriter out = null;\n\tpublic void run() throws Exception {\n\t\tsc = new MyScanner(System.in);\n\t\tout = new PrintWriter(System.out);\n\t\tfor (;sc.hasNext();) {\n\t\t\tsolve();\n\t\t\tout.flush();\n\t\t}\n\t\tout.close();\n\t}\n\n\tclass MyScanner {\n\t\tString line;\n\t\tBufferedReader reader;\n\t\tStringTokenizer tokenizer;\n\n\t\tpublic MyScanner(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream));\n\t\t\ttokenizer = null;\n\t\t}\n\t\tpublic void eat() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tline = reader.readLine();\n\t\t\t\t\tif (line == null) {\n\t\t\t\t\t\ttokenizer = null;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\ttokenizer = new StringTokenizer(line);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tpublic String next() {\n\t\t\teat();\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t}\n\t\tpublic boolean hasNext() {\n\t\t\teat();\n\t\t\treturn (tokenizer != null && tokenizer.hasMoreElements());\n\t\t}\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) a[i] = nextInt();\n\t\t\treturn a;\n\t\t}\n\t}\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03716", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2764, "cpu_time_ms": 458, "memory_kb": 67632}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s840128978", "group_id": "codeNet:p03719", "input_text": "import java.util.Scanner ;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\tScanner stdin = new Scanner( System.in ) ;\n\tint a,b,c;\n\ta = stdin.nextInt();\n\tb = stdin.nextInt();\n\tc = stdin.nextInt();\n\tif(a<=c){\n\t\tif(c<=b){\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}else{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}else{\n\t\tSystem.out.println(\"No\");\n\n\n\t\t}\n\t}\n\n\n}\n\n", "language": "Java", "metadata": {"date": 1494724776, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03719.html", "problem_id": "p03719", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03719/input.txt", "sample_output_relpath": "derived/input_output/data/p03719/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03719/Java/s840128978.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s840128978", "user_id": "u955811392"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner ;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\tScanner stdin = new Scanner( System.in ) ;\n\tint a,b,c;\n\ta = stdin.nextInt();\n\tb = stdin.nextInt();\n\tc = stdin.nextInt();\n\tif(a<=c){\n\t\tif(c<=b){\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}else{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}else{\n\t\tSystem.out.println(\"No\");\n\n\n\t\t}\n\t}\n\n\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\nDetermine whether C is not less than A and not greater than B.\n\nConstraints\n\n-100≤A,B,C≤100\n\nA, B and C are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the condition is satisfied, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\nYes\n\nC=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.\n\nSample Input 2\n\n6 5 4\n\nSample Output 2\n\nNo\n\nC=4 is less than A=6, and thus the output should be No.\n\nSample Input 3\n\n2 2 2\n\nSample Output 3\n\nYes", "sample_input": "1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03719", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\nDetermine whether C is not less than A and not greater than B.\n\nConstraints\n\n-100≤A,B,C≤100\n\nA, B and C are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the condition is satisfied, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\nYes\n\nC=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.\n\nSample Input 2\n\n6 5 4\n\nSample Output 2\n\nNo\n\nC=4 is less than A=6, and thus the output should be No.\n\nSample Input 3\n\n2 2 2\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 357, "cpu_time_ms": 94, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s598927359", "group_id": "codeNet:p03720", "input_text": "import java.util.*;\nimport java.io.PrintWriter;\nimport static java.lang.Integer.*;\nimport static java.lang.Long.*;\nimport static java.lang.Math.*;\nimport static java.lang.System.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tint i,j;\n\t\tScanner sc = new Scanner(in);\n\t\tint n = parseInt(sc.next());\n\t\tint m = parseInt(sc.next());\n\t\tint[] c = new int[n+1];\n\t\tint a;\n\t\tint b;\n\t\tfor (i = 0; i < m; i++) {\n\t\t\ta = parseInt(sc.next());\n\t\t\tb = parseInt(sc.next());\n\t\t\tc[a]++;\n\t\t\tc[b]++;\n\t\t}\n\t\tsc.close();\n\t\tPrintWriter pw = new PrintWriter(out);\n\t\tfor(i=1;i<=n;i++) {\n\t\t\tpw.println(c[i]);\n\t\t}\n\t\tpw.flush();\n\t}\n}\n", "language": "Java", "metadata": {"date": 1570917197, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03720.html", "problem_id": "p03720", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03720/input.txt", "sample_output_relpath": "derived/input_output/data/p03720/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03720/Java/s598927359.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s598927359", "user_id": "u892395063"}, "prompt_components": {"gold_output": "2\n2\n1\n1\n", "input_to_evaluate": "import java.util.*;\nimport java.io.PrintWriter;\nimport static java.lang.Integer.*;\nimport static java.lang.Long.*;\nimport static java.lang.Math.*;\nimport static java.lang.System.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tint i,j;\n\t\tScanner sc = new Scanner(in);\n\t\tint n = parseInt(sc.next());\n\t\tint m = parseInt(sc.next());\n\t\tint[] c = new int[n+1];\n\t\tint a;\n\t\tint b;\n\t\tfor (i = 0; i < m; i++) {\n\t\t\ta = parseInt(sc.next());\n\t\t\tb = parseInt(sc.next());\n\t\t\tc[a]++;\n\t\t\tc[b]++;\n\t\t}\n\t\tsc.close();\n\t\tPrintWriter pw = new PrintWriter(out);\n\t\tfor(i=1;i<=n;i++) {\n\t\t\tpw.println(c[i]);\n\t\t}\n\t\tpw.flush();\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "sample_input": "4 3\n1 2\n2 3\n1 4\n"}, "reference_outputs": ["2\n2\n1\n1\n"], "source_document_id": "p03720", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 624, "cpu_time_ms": 106, "memory_kb": 23636}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s440393906", "group_id": "codeNet:p03720", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tInteger city=Integer.valueOf(sc.nextLine().split(\" \")[0]);\n\t\tint[] road=new int[city];\n\n\t\twhile (sc.hasNextLine()) {\n\t\t\tInteger[] roadInfo=Arrays.asList(sc.nextLine().split(\" \"))\n\t\t\t\t\t.stream()\n\t\t\t\t\t.map(Integer::valueOf)\n\t\t\t\t\t.toArray(Integer[]::new);\n\t\t\troad[roadInfo[0]-1]++;\n\t\t\troad[roadInfo[1]-1]++;\n\t\t}\n\t\tfor(Integer i:road) {\n\t\t\tSystem.out.println(i);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1567282690, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03720.html", "problem_id": "p03720", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03720/input.txt", "sample_output_relpath": "derived/input_output/data/p03720/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03720/Java/s440393906.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s440393906", "user_id": "u360956346"}, "prompt_components": {"gold_output": "2\n2\n1\n1\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tInteger city=Integer.valueOf(sc.nextLine().split(\" \")[0]);\n\t\tint[] road=new int[city];\n\n\t\twhile (sc.hasNextLine()) {\n\t\t\tInteger[] roadInfo=Arrays.asList(sc.nextLine().split(\" \"))\n\t\t\t\t\t.stream()\n\t\t\t\t\t.map(Integer::valueOf)\n\t\t\t\t\t.toArray(Integer[]::new);\n\t\t\troad[roadInfo[0]-1]++;\n\t\t\troad[roadInfo[1]-1]++;\n\t\t}\n\t\tfor(Integer i:road) {\n\t\t\tSystem.out.println(i);\n\t\t}\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "sample_input": "4 3\n1 2\n2 3\n1 4\n"}, "reference_outputs": ["2\n2\n1\n1\n"], "source_document_id": "p03720", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 522, "cpu_time_ms": 183, "memory_kb": 30932}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s749564649", "group_id": "codeNet:p03721", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int k = sc.nextInt();\n int[][] nums = new int[n][2];\n for (int i = 0; i < n; i++) {\n nums[i][0] = sc.nextInt();\n nums[i][1] = sc.nextInt();\n }\n \n Arrays.sort(nums, (a, b) -> Integer.compare(a[1], b[1]));\n Arrays.sort(nums, (a, b) -> Integer.compare(a[0], b[0]));\n \n int count = 0;\n for (int i = 0; i < n; i++) {\n count += nums[i][1];\n \n if (count >= k) {\n System.out.println(nums[i][0]);\n return;\n }\n \n }\n }\n}\n", "language": "Java", "metadata": {"date": 1560462718, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03721.html", "problem_id": "p03721", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03721/input.txt", "sample_output_relpath": "derived/input_output/data/p03721/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03721/Java/s749564649.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s749564649", "user_id": "u273816974"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int k = sc.nextInt();\n int[][] nums = new int[n][2];\n for (int i = 0; i < n; i++) {\n nums[i][0] = sc.nextInt();\n nums[i][1] = sc.nextInt();\n }\n \n Arrays.sort(nums, (a, b) -> Integer.compare(a[1], b[1]));\n Arrays.sort(nums, (a, b) -> Integer.compare(a[0], b[0]));\n \n int count = 0;\n for (int i = 0; i < n; i++) {\n count += nums[i][1];\n \n if (count >= k) {\n System.out.println(nums[i][0]);\n return;\n }\n \n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "sample_input": "3 4\n1 1\n2 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03721", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 803, "cpu_time_ms": 830, "memory_kb": 89556}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s189150390", "group_id": "codeNet:p03721", "input_text": "import java.util.TreeMap;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic class Main {\n private static java.util.Scanner scanner = new java.util.Scanner(System.in);\n\n public static void main(String[] args) {\n int n = scanner.nextInt(), k = scanner.nextInt();\n IntStream.range(0, n)\n .boxed()\n .collect(Collectors.toMap(i -> scanner.nextInt(), i -> scanner.nextLong(), Long::sum, TreeMap::new))\n .entrySet().stream()\n .reduce((long)k, (rem, entry) -> {\n if (rem != null && (rem -= entry.getValue()) <= 0) {\n System.out.println(entry.getKey());\n return null;\n }\n return rem;\n }, Long::sum);\n }\n}", "language": "Java", "metadata": {"date": 1551832895, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03721.html", "problem_id": "p03721", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03721/input.txt", "sample_output_relpath": "derived/input_output/data/p03721/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03721/Java/s189150390.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s189150390", "user_id": "u981808900"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.TreeMap;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic class Main {\n private static java.util.Scanner scanner = new java.util.Scanner(System.in);\n\n public static void main(String[] args) {\n int n = scanner.nextInt(), k = scanner.nextInt();\n IntStream.range(0, n)\n .boxed()\n .collect(Collectors.toMap(i -> scanner.nextInt(), i -> scanner.nextLong(), Long::sum, TreeMap::new))\n .entrySet().stream()\n .reduce((long)k, (rem, entry) -> {\n if (rem != null && (rem -= entry.getValue()) <= 0) {\n System.out.println(entry.getKey());\n return null;\n }\n return rem;\n }, Long::sum);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "sample_input": "3 4\n1 1\n2 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03721", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 825, "cpu_time_ms": 756, "memory_kb": 89768}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s914106908", "group_id": "codeNet:p03721", "input_text": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.Map;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class TaskX {\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt();\n\t\t\tint k = in.nextInt();\n\t\t\tlong[] array = new long[100010];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint a = in.nextInt();\n\t\t\t\tlong b = in.nextLong();\n\t\t\t\tarray[a] += b;\n\t\t\t}\n\n\t\t\twhile (k > 0) {\n\t\t\t\tfor (int i = 1; i < array.length; i++) {\n\t\t\t\t\tk -= array[i];\n\t\t\t\t\tif (k <= 0) {\n\t\t\t\t\t\tout.print(i);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tstatic class ArrayUtils {\n\t\tpublic static Map getCountMap(int[] array) {\n\t\t\tMap map = new TreeMap<>();\n\t\t\tfor (int x : array)\n\t\t\t\tmap.merge(x, 1, Integer::sum);\n\t\t\treturn map;\n\t\t}\n\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1518475553, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03721.html", "problem_id": "p03721", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03721/input.txt", "sample_output_relpath": "derived/input_output/data/p03721/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03721/Java/s914106908.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s914106908", "user_id": "u266665184"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nimport java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\nimport java.util.Map;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tInputReader in = new InputReader(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class TaskX {\n\t\tpublic void solve(int testNumber, InputReader in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt();\n\t\t\tint k = in.nextInt();\n\t\t\tlong[] array = new long[100010];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tint a = in.nextInt();\n\t\t\t\tlong b = in.nextLong();\n\t\t\t\tarray[a] += b;\n\t\t\t}\n\n\t\t\twhile (k > 0) {\n\t\t\t\tfor (int i = 1; i < array.length; i++) {\n\t\t\t\t\tk -= array[i];\n\t\t\t\t\tif (k <= 0) {\n\t\t\t\t\t\tout.print(i);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tstatic class ArrayUtils {\n\t\tpublic static Map getCountMap(int[] array) {\n\t\t\tMap map = new TreeMap<>();\n\t\t\tfor (int x : array)\n\t\t\t\tmap.merge(x, 1, Integer::sum);\n\t\t\treturn map;\n\t\t}\n\n\t}\n\n\tstatic class InputReader {\n\t\tBufferedReader in;\n\t\tStringTokenizer tok;\n\n\t\tpublic String nextString() {\n\t\t\twhile (!tok.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttok = new StringTokenizer(in.readLine(), \" \");\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tok.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(nextString());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(nextString());\n\t\t}\n\n\t\tpublic int[] nextIntArray(int n) {\n\t\t\tint[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic InputReader(InputStream inputStream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(inputStream));\n\t\t\ttok = new StringTokenizer(\"\");\n\t\t}\n\n\t}\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "sample_input": "3 4\n1 1\n2 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03721", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2064, "cpu_time_ms": 216, "memory_kb": 43844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s260992252", "group_id": "codeNet:p03721", "input_text": "import java.util.HashMap;\nimport java.util.Iterator;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.SortedSet;\nimport java.util.TreeSet;\n\npublic class Main{\n\t \n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tlong k = scan.nextInt();\n \n\t\tSortedSet set = new TreeSet<>();\n\t\tMap map = new HashMap<>();\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tlong a = scan.nextInt();\n\t\t\tlong b = scan.nextInt();\n\t\t\tset.add(a);\n\t\t\tif(map.containsKey(a)){\n\t\t\t\tmap.put(a, map.get(a) + b);\n\t\t\t}else{\n\t\t\t\tmap.put(a, b);\n\t\t\t}\n\t\t}\n \n\t\tfor(Iterator it = set.iterator();;){\n\t\t\tlong num = (long) it.next();\n\t\t\tk -= map.get(num);\n\t\t\tif(k <= 0){\n\t\t\t\tSystem.out.println(num);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n \n\t}\n \n}\n", "language": "Java", "metadata": {"date": 1494726691, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03721.html", "problem_id": "p03721", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03721/input.txt", "sample_output_relpath": "derived/input_output/data/p03721/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03721/Java/s260992252.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s260992252", "user_id": "u148643910"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.HashMap;\nimport java.util.Iterator;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.SortedSet;\nimport java.util.TreeSet;\n\npublic class Main{\n\t \n\tpublic static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tint n = scan.nextInt();\n\t\tlong k = scan.nextInt();\n \n\t\tSortedSet set = new TreeSet<>();\n\t\tMap map = new HashMap<>();\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tlong a = scan.nextInt();\n\t\t\tlong b = scan.nextInt();\n\t\t\tset.add(a);\n\t\t\tif(map.containsKey(a)){\n\t\t\t\tmap.put(a, map.get(a) + b);\n\t\t\t}else{\n\t\t\t\tmap.put(a, b);\n\t\t\t}\n\t\t}\n \n\t\tfor(Iterator it = set.iterator();;){\n\t\t\tlong num = (long) it.next();\n\t\t\tk -= map.get(num);\n\t\t\tif(k <= 0){\n\t\t\t\tSystem.out.println(num);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n \n\t}\n \n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "sample_input": "3 4\n1 1\n2 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03721", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 764, "cpu_time_ms": 612, "memory_kb": 99976}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s558268915", "group_id": "codeNet:p03722", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.lang.Character.Subset;\nimport java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.time.temporal.ValueRange;\nimport java.util.AbstractMap;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.Objects;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\nimport java.util.concurrent.ForkJoinPool;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\n Solver solver = new Solver(in, out);\n solver.solve();\n\n out.close();\n }\n\n // ======================================================================\n static class Solver {\n \tMyInput in;\n \tPrintWriter out;\n public Solver(MyInput in, PrintWriter out) {\n \tthis.in = in;\n \tthis.out = out;\n }\n\n // -----------------------------------------\n // ベルマン・フォード\n long INF = 1000000000L * 2010;\n int N, M;\n int[] A, B, C;\n long[] dist;\t\t\t\t\t\t\t\t\t// 最短距離\n public void solve() {\n \tN = ni();\n \tdist = new long[N];\n \tArrays.fill(dist, INF);\t\t\t\t\t\t// INF で埋める\n \tdist[0] = 0L;\t\t\t\t\t\t\t\t// 始点を　０　で初期化する\n \tM = ni();\n \tA = new int[M];\n \tB = new int[M];\n \tC = new int[M];\n \tfor (int i = 0; i < M; i++) {\n\t\t\t\tA[i] = ni()-1;\n\t\t\t\tB[i] = ni()-1;\n\t\t\t\tC[i] = -ni();\t\t\t\t\t\t\t// 正負を反転する（最大値を求めるので）\n\t\t\t}\n \tlong sv = 0L;\n \tfor (int i = 0; i < N; i++) {\t\t\t\t// 頂点数繰り返す\n \t\tfor (int j = 0; j < M; j++) {\t\t\t// 辺の数、最短距離を更新する\n\t\t\t\t\tif(dist[A[j]] == INF)\tcontinue;\n\t\t\t\t\tif(dist[B[j]] > dist[A[j]] + C[j])\n\t\t\t\t\t\tdist[B[j]] = dist[A[j]] + C[j];\t// 最短距離を更新する\n\t\t\t\t}\n \t\tif(i == N - 2) {\n \t\t\tsv = dist[N-1];\t\t\t\t\t\t// 終点の値を保存する\n \t\t}\n\t\t\t}\n \tif(sv != dist[N-1])\t\tprn(\"inf\");\t\t\t// 一回多く回して変化したらなら、負の閉路がある\n \telse\t\t\t\t\tprn(-sv);\t\t\t// 最大値を出力する\n }\n\n // -----------------------------------------\n // Integer のキーに対して、カウントを管理する（カウントを足したり、引いたりする）\n static class MapCounter {\n \tprivate Map map = new TreeMap<>();\n \tpublic MapCounter() {}\n \t// キーのカウントに値を足す\n \tpublic void add(long key) {\n \t\tadd(key, 1);\n \t}\n \tpublic void add(long key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)cnt);\n \t\t} else {\n \t\t\tmap.put(key, val + cnt);\n \t\t}\n \t}\n \t// キーのカウントから値を引く\n \tpublic void sub(long key) {\n \t\tsub(key, 1);\n \t}\n \tpublic void sub(long key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)-cnt);\n \t\t} else {\n \t\t\tmap.put(key, val - cnt);\n \t\t}\n \t}\n \t// キーのカウントを取得する（なければ　ＮＵＬＬを返す）\n \tpublic Long getCountwithNull(long key) {\n \t\treturn map.get(key);\n \t}\n \t// キーのカウントを取得する（なければ　０　を返す）\n \tpublic Long getCount(long key) {\n \t\tLong val = map.get(key);\n \t\tif(val == null)\t\treturn 0L;\n \t\telse \t\t\t\treturn val;\n \t}\n \tpublic Set getKey() {\n \t\treturn map.keySet();\n \t}\n \t// 登録されているキーの数を返す\n \tpublic int getKeyCount() {\n \t\treturn map.keySet().size();\n \t}\n }\n // -----------------------------------------\n // 配列のバイナリーサーチ　１\n boolean isRightMin(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] >= key)\t\treturn true;\t\t// 以上\n \t else if (!f && a[index] > key)\treturn true;\t\t// より大きい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以上（f=true)または、より大きく（f=false)、一番小さい値を返す\n \tint binarySearchRightMin(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isRightMin(a, f, mid, key))\tok = mid;\t// 下半分を対象とする\n \t else \t\t\t\t\t\t\tng = mid;\t// 上半分を対象とする\n \t }\t\n \t return ok;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n // -----------------------------------------\n // 配列のバイナリーサーチ　２\n boolean isLeftMax(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] <= key)\t\treturn true;\t\t// 以下\n \t else if (!f && a[index] < key)\treturn true;\t\t// より小さい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以下（f=true)または、より小さい（f=false)、一番大きい値を返す\n \tint binarySearchLeftMax(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isLeftMax(a, f, mid, key))\tng = mid;\t// 上半分を対象とする\n \t else \t\t\t\t\t\t\tok = mid;\t// 下半分を対象とする\n \t }\t\n \t return ng;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n \t\n // -----------------------------------------\n \t// オイラーツアー（部分木対応）　　　→　　工事中\n \tstatic class EulerTour {\n \t\tGraph g;\n \t\tList euler_tour = new ArrayList<>();\n \t\tint[] begin, end;\n \t\tint k = 0, root = 0;\n \t\t\n \t\tvoid dfs(int v,int p, PrintWriter out) {\n \t\t\tout.println(\"v = \" + v + \" p = \" + p);\n \t\t\tbegin[v] = k;\n \t\t\teuler_tour.add(v);\n \t\t\tk++;\n \t\t\tif(!g.contains(v)) {\n \t\t\t\treturn;\n \t\t\t}\n \t\t\tfor(int i : g.get(v)) {\n \t\t\t\tif(i != p) {\n \t\t\t\t\tdfs(i, v, out);\n \t\t\t\t\teuler_tour.add(v);\n \t\t\t\t\tk++;\n \t\t\t\t}\n \t\t\t}\n \t\t\tend[v]=k;\n \t\t}\n \t\t// 初期化\n \t\tpublic void init(int p_cnt, int root, Graph g, PrintWriter out) {\n \t\t\tbegin = new int[p_cnt + 1];\n \t\t\tend = new int[p_cnt + 1];\n \t\t\tthis.root = root;\n \t\t\tthis.g = g;\n \t\t\tdfs(root, -1, out);\n \t\t}\n \t\t// 部分木の頂点を渡すと、オイラーツアーの部分木を返す\n \t\tpublic List getPartTour(int v) {\n \t\t\treturn euler_tour.subList(begin[v], end[v]);\n \t\t}\n \t\t// 部分木の頂点を渡すと、頂点のリストを返す\n \t\tpublic List getPartList(int v) {\n \t\t\tSet set = new TreeSet<>();\n\t\t\t\tset.addAll(getPartTour(v));\n\t\t\t\tList ans = new ArrayList<>();\n\t\t\t\tfor(Integer p : set) {\n\t\t\t\t\tans.add(p);\n\t\t\t\t}\n\t\t\t\treturn ans;\n \t\t}\n \t}\n \t\n // -----------------------------------------\n // 重みなし　グラフのリンクリスト\n static class Graph {\n \t// 頂点に紐づく頂点のリスト\n private Map> data = new HashMap>();\n// // 全ての頂点のセット\n// private Set point = new TreeSet<>();\n // 頂点と頂点の繋がりを追加する\n void add(int from, int to) {\n \tList list = data.get(from);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(from, list);\n \t}\n \tlist.add(to);\n// \tpoint.add(key);\n// \tpoint.add(value);\n }\n // 指定された頂点に紐づく、頂点のリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList list = data.get(key_1);\n \tif(list == null)\treturn false;\n \telse \t\t\t\treturn list.contains(key_2);\n }\n // 指定された頂点から、すべての頂点への距離を返す\n List distList(int key) {\n \tList dist = new ArrayList<>();\t\t// 頂点と距離のペアのリスト\n \tSet mark = new HashSet<>();\t// 処理したら入れる\n \t\t\tStack stack = new Stack<>();\t\t// スタックの宣言\n \t\t\tstack.push(new PP(key, 0));\t\t\t\t// スタートをスタックに保存\n \t\t\twhile(!stack.isEmpty()) {\n \t\t\t\tPP wk = stack.pop();\t\t\t\t// スタックから次の頂点を取得\n \t\t\t\tint pp = wk.getKey();\n \t\t\t\tint dd = wk.getVal();\n \t\t\t\tmark.add(pp);\t\t\t\t\t\t// 通過マーク\n \t\t\tdist.add(new PP(pp, dd));\t\t\t// 距離を登録\n \t\t\t\tList list = get(pp);\t\t// つながっている頂点のリストを取得\n \t\t\t\tfor(int next : list) {\n \t\t\t\t\tif(mark.contains(next))\tcontinue;\n \t\t\t\t\tstack.push(new PP(next, dd + 1));\n \t\t\t\t}\n \t\t\t}\n \t\t\treturn dist;\n }\n // ダンプ\n void dump(PrintWriter out) {\n \tfor(int key : data.keySet()) {\n \t\tout.print(key + \" : \");\n \t\tfor(int val : data.get(key)) {\n \t\t\tout.print(val + \" \");\n \t\t}\n \t\tout.println(\"\");\n \t}\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト\n static class GraphWith {\n \t// キーに紐づくリストに、頂点番号と重さのペアを持つ\n private Map> data = new HashMap>();\n // 指定された頂点に紐づく、頂点と重さのペアを追加する\n void add(int key, PP p) {\n \tList list = data.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(key, list);\n \t}\n \tlist.add(p);\n }\n // 頂点に紐づく、頂点と重さのペアのリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList list = data.get(key_1);\n \tif(list == null)\treturn false;\n \tboolean ans = false;\n \tfor(PP p : list) {\n \t\tif(p.getKey() == key_2) {\n \t\t\tans = true;\n \t\t\tbreak;\n \t\t}\n \t}\n \treturn ans;\n }\n }\n // -----------------------------------------\n // 重みなし　グラフのリンクリスト(Long)\n static class GraphLong {\n private Map> G = new HashMap>();\n void add(long key, long value) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(value);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト(Long)\n static class GraphLongWith {\n private Map> G = new HashMap>();\n void add(long key, PPL p) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(p);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n\n void prn(String s) {\n \tout.println(s);\n }\n void prn(int i) {\n \tout.println(i);\n }\n void prn(long i) {\n \tout.println(i);\n }\n void prr(String s) {\n \tout.print(s);\n }\n int ni() {\n \treturn in.nextInt();\n }\n long nl() {\n \treturn in.nextLong();\n }\n double nd() {\n \treturn in.nextDouble();\n }\n String ns() {\n \treturn in.nextString();\n }\n int[] ndi(int n) {\n \tint[] ans = new int[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ni();\n \t}\n \treturn ans;\n }\n long[] ndl(int n) {\n \tlong[] ans = new long[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nl();\n \t}\n \treturn ans;\n }\n double[] ndd(int n) {\n \tdouble[] ans = new double[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nd();\n \t}\n \treturn ans;\n }\n String[] nds(int n) {\n \tString[] ans = new String[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ns();\n \t}\n \treturn ans;\n }\n int[][] nddi(int n, int m) {\n \tint[][] ans = new int[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = ni();\n \t}\n \t}\n \treturn ans;\n }\n long[][] nddl(int n, int m) {\n \tlong[][] ans = new long[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = nl();\n \t}\n \t}\n \treturn ans;\n }\n }\n // Set に入れるなら　PPKEY　を使う！\n static class PP{\n \tpublic int key, val;\n \tpublic PP(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(int key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(int val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPL {\n \tpublic long key, val;\n \tpublic PPL(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPDL {\n \tpublic long key;\n \tpublic long[] val;\n \tpublic PPDL(long key, long[] val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long[] getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long[] val) {\n\t\t\tthis.val = val;\n\t\t}\n\t\tpublic void dump(PrintWriter out) {\n\t\t\tout.print(\"key = \" + key + \" val \");\n\t\t\tfor(int i=0; i < val.length; i++) {\n\t\t\t\tout.print(\"[\" + val[i] + \"] \");\n\t\t\t}\n\t\t\tout.println(\"\");\n\t\t}\n }\n // HashMap のキーに使う　→　Set に入れるのもこれ（PPでは値での比較が行われない）\n static final class PPKEY{\n \tprivate final int key, val;\n \tpublic PPKEY(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // HashMap のキーに使う　→　Set に入れるのもこれ（PPでは値での比較が行われない）\n static final class PPLKEY{\n \tprivate final long key, val;\n \tpublic PPLKEY(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // ======================================================================\n static class Pair extends AbstractMap.SimpleEntry {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n }\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public double nextDouble() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n double ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n int cnt = 0;\n for (; i < len; i++) {\n \tif(str[i] == '.') {\n \t\tcnt = 10;\n \t\tcontinue;\n \t}\n \tif(cnt == 0) {\n \t\tret = ret * 10 + str[i] - '0';\n \t} else {\n \t\tret = ret + ((double)(str[i] - '0') / cnt);\n \t\tcnt *= 10;\n \t}\n }\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n\n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1569112066, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03722.html", "problem_id": "p03722", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03722/input.txt", "sample_output_relpath": "derived/input_output/data/p03722/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03722/Java/s558268915.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558268915", "user_id": "u181039779"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.lang.Character.Subset;\nimport java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.time.temporal.ValueRange;\nimport java.util.AbstractMap;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.Objects;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\nimport java.util.concurrent.ForkJoinPool;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\n Solver solver = new Solver(in, out);\n solver.solve();\n\n out.close();\n }\n\n // ======================================================================\n static class Solver {\n \tMyInput in;\n \tPrintWriter out;\n public Solver(MyInput in, PrintWriter out) {\n \tthis.in = in;\n \tthis.out = out;\n }\n\n // -----------------------------------------\n // ベルマン・フォード\n long INF = 1000000000L * 2010;\n int N, M;\n int[] A, B, C;\n long[] dist;\t\t\t\t\t\t\t\t\t// 最短距離\n public void solve() {\n \tN = ni();\n \tdist = new long[N];\n \tArrays.fill(dist, INF);\t\t\t\t\t\t// INF で埋める\n \tdist[0] = 0L;\t\t\t\t\t\t\t\t// 始点を　０　で初期化する\n \tM = ni();\n \tA = new int[M];\n \tB = new int[M];\n \tC = new int[M];\n \tfor (int i = 0; i < M; i++) {\n\t\t\t\tA[i] = ni()-1;\n\t\t\t\tB[i] = ni()-1;\n\t\t\t\tC[i] = -ni();\t\t\t\t\t\t\t// 正負を反転する（最大値を求めるので）\n\t\t\t}\n \tlong sv = 0L;\n \tfor (int i = 0; i < N; i++) {\t\t\t\t// 頂点数繰り返す\n \t\tfor (int j = 0; j < M; j++) {\t\t\t// 辺の数、最短距離を更新する\n\t\t\t\t\tif(dist[A[j]] == INF)\tcontinue;\n\t\t\t\t\tif(dist[B[j]] > dist[A[j]] + C[j])\n\t\t\t\t\t\tdist[B[j]] = dist[A[j]] + C[j];\t// 最短距離を更新する\n\t\t\t\t}\n \t\tif(i == N - 2) {\n \t\t\tsv = dist[N-1];\t\t\t\t\t\t// 終点の値を保存する\n \t\t}\n\t\t\t}\n \tif(sv != dist[N-1])\t\tprn(\"inf\");\t\t\t// 一回多く回して変化したらなら、負の閉路がある\n \telse\t\t\t\t\tprn(-sv);\t\t\t// 最大値を出力する\n }\n\n // -----------------------------------------\n // Integer のキーに対して、カウントを管理する（カウントを足したり、引いたりする）\n static class MapCounter {\n \tprivate Map map = new TreeMap<>();\n \tpublic MapCounter() {}\n \t// キーのカウントに値を足す\n \tpublic void add(long key) {\n \t\tadd(key, 1);\n \t}\n \tpublic void add(long key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)cnt);\n \t\t} else {\n \t\t\tmap.put(key, val + cnt);\n \t\t}\n \t}\n \t// キーのカウントから値を引く\n \tpublic void sub(long key) {\n \t\tsub(key, 1);\n \t}\n \tpublic void sub(long key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)-cnt);\n \t\t} else {\n \t\t\tmap.put(key, val - cnt);\n \t\t}\n \t}\n \t// キーのカウントを取得する（なければ　ＮＵＬＬを返す）\n \tpublic Long getCountwithNull(long key) {\n \t\treturn map.get(key);\n \t}\n \t// キーのカウントを取得する（なければ　０　を返す）\n \tpublic Long getCount(long key) {\n \t\tLong val = map.get(key);\n \t\tif(val == null)\t\treturn 0L;\n \t\telse \t\t\t\treturn val;\n \t}\n \tpublic Set getKey() {\n \t\treturn map.keySet();\n \t}\n \t// 登録されているキーの数を返す\n \tpublic int getKeyCount() {\n \t\treturn map.keySet().size();\n \t}\n }\n // -----------------------------------------\n // 配列のバイナリーサーチ　１\n boolean isRightMin(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] >= key)\t\treturn true;\t\t// 以上\n \t else if (!f && a[index] > key)\treturn true;\t\t// より大きい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以上（f=true)または、より大きく（f=false)、一番小さい値を返す\n \tint binarySearchRightMin(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isRightMin(a, f, mid, key))\tok = mid;\t// 下半分を対象とする\n \t else \t\t\t\t\t\t\tng = mid;\t// 上半分を対象とする\n \t }\t\n \t return ok;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n // -----------------------------------------\n // 配列のバイナリーサーチ　２\n boolean isLeftMax(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] <= key)\t\treturn true;\t\t// 以下\n \t else if (!f && a[index] < key)\treturn true;\t\t// より小さい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以下（f=true)または、より小さい（f=false)、一番大きい値を返す\n \tint binarySearchLeftMax(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isLeftMax(a, f, mid, key))\tng = mid;\t// 上半分を対象とする\n \t else \t\t\t\t\t\t\tok = mid;\t// 下半分を対象とする\n \t }\t\n \t return ng;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n \t\n // -----------------------------------------\n \t// オイラーツアー（部分木対応）　　　→　　工事中\n \tstatic class EulerTour {\n \t\tGraph g;\n \t\tList euler_tour = new ArrayList<>();\n \t\tint[] begin, end;\n \t\tint k = 0, root = 0;\n \t\t\n \t\tvoid dfs(int v,int p, PrintWriter out) {\n \t\t\tout.println(\"v = \" + v + \" p = \" + p);\n \t\t\tbegin[v] = k;\n \t\t\teuler_tour.add(v);\n \t\t\tk++;\n \t\t\tif(!g.contains(v)) {\n \t\t\t\treturn;\n \t\t\t}\n \t\t\tfor(int i : g.get(v)) {\n \t\t\t\tif(i != p) {\n \t\t\t\t\tdfs(i, v, out);\n \t\t\t\t\teuler_tour.add(v);\n \t\t\t\t\tk++;\n \t\t\t\t}\n \t\t\t}\n \t\t\tend[v]=k;\n \t\t}\n \t\t// 初期化\n \t\tpublic void init(int p_cnt, int root, Graph g, PrintWriter out) {\n \t\t\tbegin = new int[p_cnt + 1];\n \t\t\tend = new int[p_cnt + 1];\n \t\t\tthis.root = root;\n \t\t\tthis.g = g;\n \t\t\tdfs(root, -1, out);\n \t\t}\n \t\t// 部分木の頂点を渡すと、オイラーツアーの部分木を返す\n \t\tpublic List getPartTour(int v) {\n \t\t\treturn euler_tour.subList(begin[v], end[v]);\n \t\t}\n \t\t// 部分木の頂点を渡すと、頂点のリストを返す\n \t\tpublic List getPartList(int v) {\n \t\t\tSet set = new TreeSet<>();\n\t\t\t\tset.addAll(getPartTour(v));\n\t\t\t\tList ans = new ArrayList<>();\n\t\t\t\tfor(Integer p : set) {\n\t\t\t\t\tans.add(p);\n\t\t\t\t}\n\t\t\t\treturn ans;\n \t\t}\n \t}\n \t\n // -----------------------------------------\n // 重みなし　グラフのリンクリスト\n static class Graph {\n \t// 頂点に紐づく頂点のリスト\n private Map> data = new HashMap>();\n// // 全ての頂点のセット\n// private Set point = new TreeSet<>();\n // 頂点と頂点の繋がりを追加する\n void add(int from, int to) {\n \tList list = data.get(from);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(from, list);\n \t}\n \tlist.add(to);\n// \tpoint.add(key);\n// \tpoint.add(value);\n }\n // 指定された頂点に紐づく、頂点のリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList list = data.get(key_1);\n \tif(list == null)\treturn false;\n \telse \t\t\t\treturn list.contains(key_2);\n }\n // 指定された頂点から、すべての頂点への距離を返す\n List distList(int key) {\n \tList dist = new ArrayList<>();\t\t// 頂点と距離のペアのリスト\n \tSet mark = new HashSet<>();\t// 処理したら入れる\n \t\t\tStack stack = new Stack<>();\t\t// スタックの宣言\n \t\t\tstack.push(new PP(key, 0));\t\t\t\t// スタートをスタックに保存\n \t\t\twhile(!stack.isEmpty()) {\n \t\t\t\tPP wk = stack.pop();\t\t\t\t// スタックから次の頂点を取得\n \t\t\t\tint pp = wk.getKey();\n \t\t\t\tint dd = wk.getVal();\n \t\t\t\tmark.add(pp);\t\t\t\t\t\t// 通過マーク\n \t\t\tdist.add(new PP(pp, dd));\t\t\t// 距離を登録\n \t\t\t\tList list = get(pp);\t\t// つながっている頂点のリストを取得\n \t\t\t\tfor(int next : list) {\n \t\t\t\t\tif(mark.contains(next))\tcontinue;\n \t\t\t\t\tstack.push(new PP(next, dd + 1));\n \t\t\t\t}\n \t\t\t}\n \t\t\treturn dist;\n }\n // ダンプ\n void dump(PrintWriter out) {\n \tfor(int key : data.keySet()) {\n \t\tout.print(key + \" : \");\n \t\tfor(int val : data.get(key)) {\n \t\t\tout.print(val + \" \");\n \t\t}\n \t\tout.println(\"\");\n \t}\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト\n static class GraphWith {\n \t// キーに紐づくリストに、頂点番号と重さのペアを持つ\n private Map> data = new HashMap>();\n // 指定された頂点に紐づく、頂点と重さのペアを追加する\n void add(int key, PP p) {\n \tList list = data.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(key, list);\n \t}\n \tlist.add(p);\n }\n // 頂点に紐づく、頂点と重さのペアのリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList list = data.get(key_1);\n \tif(list == null)\treturn false;\n \tboolean ans = false;\n \tfor(PP p : list) {\n \t\tif(p.getKey() == key_2) {\n \t\t\tans = true;\n \t\t\tbreak;\n \t\t}\n \t}\n \treturn ans;\n }\n }\n // -----------------------------------------\n // 重みなし　グラフのリンクリスト(Long)\n static class GraphLong {\n private Map> G = new HashMap>();\n void add(long key, long value) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(value);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト(Long)\n static class GraphLongWith {\n private Map> G = new HashMap>();\n void add(long key, PPL p) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(p);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n\n void prn(String s) {\n \tout.println(s);\n }\n void prn(int i) {\n \tout.println(i);\n }\n void prn(long i) {\n \tout.println(i);\n }\n void prr(String s) {\n \tout.print(s);\n }\n int ni() {\n \treturn in.nextInt();\n }\n long nl() {\n \treturn in.nextLong();\n }\n double nd() {\n \treturn in.nextDouble();\n }\n String ns() {\n \treturn in.nextString();\n }\n int[] ndi(int n) {\n \tint[] ans = new int[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ni();\n \t}\n \treturn ans;\n }\n long[] ndl(int n) {\n \tlong[] ans = new long[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nl();\n \t}\n \treturn ans;\n }\n double[] ndd(int n) {\n \tdouble[] ans = new double[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nd();\n \t}\n \treturn ans;\n }\n String[] nds(int n) {\n \tString[] ans = new String[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ns();\n \t}\n \treturn ans;\n }\n int[][] nddi(int n, int m) {\n \tint[][] ans = new int[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = ni();\n \t}\n \t}\n \treturn ans;\n }\n long[][] nddl(int n, int m) {\n \tlong[][] ans = new long[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = nl();\n \t}\n \t}\n \treturn ans;\n }\n }\n // Set に入れるなら　PPKEY　を使う！\n static class PP{\n \tpublic int key, val;\n \tpublic PP(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(int key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(int val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPL {\n \tpublic long key, val;\n \tpublic PPL(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPDL {\n \tpublic long key;\n \tpublic long[] val;\n \tpublic PPDL(long key, long[] val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long[] getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long[] val) {\n\t\t\tthis.val = val;\n\t\t}\n\t\tpublic void dump(PrintWriter out) {\n\t\t\tout.print(\"key = \" + key + \" val \");\n\t\t\tfor(int i=0; i < val.length; i++) {\n\t\t\t\tout.print(\"[\" + val[i] + \"] \");\n\t\t\t}\n\t\t\tout.println(\"\");\n\t\t}\n }\n // HashMap のキーに使う　→　Set に入れるのもこれ（PPでは値での比較が行われない）\n static final class PPKEY{\n \tprivate final int key, val;\n \tpublic PPKEY(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // HashMap のキーに使う　→　Set に入れるのもこれ（PPでは値での比較が行われない）\n static final class PPLKEY{\n \tprivate final long key, val;\n \tpublic PPLKEY(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // ======================================================================\n static class Pair extends AbstractMap.SimpleEntry {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n }\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public double nextDouble() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n double ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n int cnt = 0;\n for (; i < len; i++) {\n \tif(str[i] == '.') {\n \t\tcnt = 10;\n \t\tcontinue;\n \t}\n \tif(cnt == 0) {\n \t\tret = ret * 10 + str[i] - '0';\n \t} else {\n \t\tret = ret + ((double)(str[i] - '0') / cnt);\n \t\tcnt *= 10;\n \t}\n }\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n\n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i count + 1) {\n\t\t\t\t\t\t\t\t\t\tmap2[i + i2][j + j2] = count + 1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t//}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcount++;\n\n\t\t\tfor (int i = 0; i < h; i++) {\n\t\t\t\tfor (int j = 0; j < w; j++) {\n\t\t\t\t\tif (count == map2[i][j] || count - 1 == map2[i][j]) {\n\t\t\t\t\t\tfor (int i2 = -k; i2 <= k; i2++) {\n\t\t\t\t\t\t\tfor (int j2 = -k; Math.abs(j2) + Math.abs(i2) <= k; j2++) {\n\t\t\t\t\t\t\t\tif (i + i2 < h && j + j2 < w && 0 <= i + i2 && 0 <= j + j2 && \"#\".equals(map1[i + i2][j + j2])) {\n\t\t\t\t\t\t\t\t\tif (\"#\".equals(map1[i + i2][j + j2])) {\n\t\t\t\t\t\t\t\t\t\tmap1[i + i2][j + j2] = \".\";\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n}", "language": "Java", "metadata": {"date": 1494125677, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03725.html", "problem_id": "p03725", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03725/input.txt", "sample_output_relpath": "derived/input_output/data/p03725/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03725/Java/s527196669.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s527196669", "user_id": "u519004991"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\nimport java.lang.*;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception {\n\n\t\tint h;\n\t\tint w;\n\t\tint k;\n\n\t\tString[][] map1;\n\t\tint[][] map2;\n\n\t\tint px = -1;\n\t\tint py = -1;\n\n\t\ttry (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {\n\t\t\tString line;\n\n\t\t\tline = br.readLine();\n\t\t\t{\n\t\t\t\tString[] tokens = line.split(\" \");\n\t\t\t\th = Integer.parseInt(tokens[0]);\n\t\t\t\tw = Integer.parseInt(tokens[1]);\n\t\t\t\tk = Integer.parseInt(tokens[2]);\n\t\t\t}\n\n\t\t\tmap1 = new String[h][w];\n\t\t\tmap2 = new int[h][w];\n\n\t\t\tint r = 0;\n\t\t\twhile ((line = br.readLine()) != null) {\n\t\t\t\tString[] tokens = line.split(\"\");\n\n\t\t\t\tfor (int i = 0; i < w; i++) {\n\t\t\t\t\tmap1[r][i] = tokens[i + 1];\n\t\t\t\t\tmap2[r][i] = Integer.MAX_VALUE;\n\t\t\t\t\tif (map1[r][i].equals(\"S\")) {\n\t\t\t\t\t\tpx = r;\n\t\t\t\t\t\tpy = i;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tr++;\n\t\t\t}\n\t\t}\n\n\t\tmap2[px][py] = 0;\n\t\tint count = 0;\n\n\t\tLoop1:\n\t\twhile(true) {\n\t\t\tfor (int i = 0; i < h; i++) {\n\t\t\t\tfor (int j = 0; j < w; j++) {\n\t\t\t\t\t//if (count == map2[i][j]) {\n\t\t\t\t\t\tfor (int i2 = -k; i2 <= k; i2++) {\n\t\t\t\t\t\t\tfor (int j2 = -k; Math.abs(j2) + Math.abs(i2) <= k; j2++) {\n\t\t\t\t\t\t\t\tif (i + i2 < h && j + j2 < w && 0 <= i + i2 && 0 <= j + j2 && \".\".equals(map1[i + i2][j + j2])) {\n\t\t\t\t\t\t\t\t\tif (i + i2 == 0 || i + i2 == h - 1 ||\n\t\t\t\t\t\t\t\t\t\tj + j2 == 0 || j + j2 == w -1) {\n\t\t\t\t\t\t\t\t\t\tcount++;\n\t\t\t\t\t\t\t\t\t\tbreak Loop1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tif (map2[i + i2][j + j2] > count + 1) {\n\t\t\t\t\t\t\t\t\t\tmap2[i + i2][j + j2] = count + 1;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t//}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcount++;\n\n\t\t\tfor (int i = 0; i < h; i++) {\n\t\t\t\tfor (int j = 0; j < w; j++) {\n\t\t\t\t\tif (count == map2[i][j] || count - 1 == map2[i][j]) {\n\t\t\t\t\t\tfor (int i2 = -k; i2 <= k; i2++) {\n\t\t\t\t\t\t\tfor (int j2 = -k; Math.abs(j2) + Math.abs(i2) <= k; j2++) {\n\t\t\t\t\t\t\t\tif (i + i2 < h && j + j2 < w && 0 <= i + i2 && 0 <= j + j2 && \"#\".equals(map1[i + i2][j + j2])) {\n\t\t\t\t\t\t\t\t\tif (\"#\".equals(map1[i + i2][j + j2])) {\n\t\t\t\t\t\t\t\t\t\tmap1[i + i2][j + j2] = \".\";\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(count);\n\t}\n}", "problem_context": "Score : 700 points\n\nProblem Statement\n\nTakahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows and W columns.\nWe will denote the room at the i-th row and j-th column as (i,j). The state of this room is represented by a character A_{i,j}. If A_{i,j}= #, the room is locked and cannot be entered; if A_{i,j}= ., the room is not locked and can be freely entered.\nTakahashi is currently at the room where A_{i,j}= S, which can also be freely entered.\n\nEach room in the 1-st row, 1-st column, H-th row or W-th column, has an exit.\nEach of the other rooms (i,j) is connected to four rooms: (i-1,j), (i+1,j), (i,j-1) and (i,j+1).\n\nTakahashi will use his magic to get out of the building. In one cast, he can do the following:\n\nMove to an adjacent room at most K times, possibly zero. Here, locked rooms cannot be entered.\n\nThen, select and unlock at most K locked rooms, possibly zero. Those rooms will remain unlocked from then on.\n\nHis objective is to reach a room with an exit. Find the minimum necessary number of casts to do so.\n\nIt is guaranteed that Takahashi is initially at a room without an exit.\n\nConstraints\n\n3 ≤ H ≤ 800\n\n3 ≤ W ≤ 800\n\n1 ≤ K ≤ H×W\n\nEach A_{i,j} is # , . or S.\n\nThere uniquely exists (i,j) such that A_{i,j}= S, and it satisfies 2 ≤ i ≤ H-1 and 2 ≤ j ≤ W-1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nA_{1,1}A_{1,2}...A_{1,W}\n:\nA_{H,1}A_{H,2}...A_{H,W}\n\nOutput\n\nPrint the minimum necessary number of casts.\n\nSample Input 1\n\n3 3 3\n#.#\n#S.\n###\n\nSample Output 1\n\n1\n\nTakahashi can move to room (1,2) in one cast.\n\nSample Input 2\n\n3 3 3\n###\n#S#\n###\n\nSample Output 2\n\n2\n\nTakahashi cannot move in the first cast, but can unlock room (1,2).\nThen, he can move to room (1,2) in the next cast, achieving the objective in two casts.\n\nSample Input 3\n\n7 7 2\n#######\n#######\n##...##\n###S###\n##.#.##\n###.###\n#######\n\nSample Output 3\n\n2", "sample_input": "3 3 3\n#.#\n#S.\n###\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03725", "source_text": "Score : 700 points\n\nProblem Statement\n\nTakahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows and W columns.\nWe will denote the room at the i-th row and j-th column as (i,j). The state of this room is represented by a character A_{i,j}. If A_{i,j}= #, the room is locked and cannot be entered; if A_{i,j}= ., the room is not locked and can be freely entered.\nTakahashi is currently at the room where A_{i,j}= S, which can also be freely entered.\n\nEach room in the 1-st row, 1-st column, H-th row or W-th column, has an exit.\nEach of the other rooms (i,j) is connected to four rooms: (i-1,j), (i+1,j), (i,j-1) and (i,j+1).\n\nTakahashi will use his magic to get out of the building. In one cast, he can do the following:\n\nMove to an adjacent room at most K times, possibly zero. Here, locked rooms cannot be entered.\n\nThen, select and unlock at most K locked rooms, possibly zero. Those rooms will remain unlocked from then on.\n\nHis objective is to reach a room with an exit. Find the minimum necessary number of casts to do so.\n\nIt is guaranteed that Takahashi is initially at a room without an exit.\n\nConstraints\n\n3 ≤ H ≤ 800\n\n3 ≤ W ≤ 800\n\n1 ≤ K ≤ H×W\n\nEach A_{i,j} is # , . or S.\n\nThere uniquely exists (i,j) such that A_{i,j}= S, and it satisfies 2 ≤ i ≤ H-1 and 2 ≤ j ≤ W-1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nA_{1,1}A_{1,2}...A_{1,W}\n:\nA_{H,1}A_{H,2}...A_{H,W}\n\nOutput\n\nPrint the minimum necessary number of casts.\n\nSample Input 1\n\n3 3 3\n#.#\n#S.\n###\n\nSample Output 1\n\n1\n\nTakahashi can move to room (1,2) in one cast.\n\nSample Input 2\n\n3 3 3\n###\n#S#\n###\n\nSample Output 2\n\n2\n\nTakahashi cannot move in the first cast, but can unlock room (1,2).\nThen, he can move to room (1,2) in the next cast, achieving the objective in two casts.\n\nSample Input 3\n\n7 7 2\n#######\n#######\n##...##\n###S###\n##.#.##\n###.###\n#######\n\nSample Output 3\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2079, "cpu_time_ms": 439, "memory_kb": 72112}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s972902745", "group_id": "codeNet:p03726", "input_text": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n private static String solve(int n, int[] a, int[] b) {\n ArrayList> edges = new ArrayList<>();\n for (int i = 0; i <= n; i++) {\n edges.add(new ArrayList<>());\n }\n for (int i = 0; i < n - 1; i++) {\n edges.get(a[i]).add(b[i]);\n edges.get(b[i]).add(a[i]);\n }\n for (int i = 1; i <= n; i++) {\n int numLeaf = 0;\n for (int next : edges.get(i)) {\n if (edges.get(next).size() == 1) {\n numLeaf++;\n }\n }\n if (numLeaf >= 2) {\n return \"First\";\n }\n }\n return \"Second\";\n }\n \n private static void execute(ContestReader reader, PrintWriter out) {\n int n = reader.nextInt();\n int[] a = new int[n - 1];\n int[] b = new int[n - 1];\n for (int i = 0; i < n - 1; i++) {\n a[i] = reader.nextInt();\n b[i] = reader.nextInt();\n }\n out.println(solve(n, a, b));\n }\n \n public static void main(String[] args) {\n ContestReader reader = new ContestReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n execute(reader, out);\n out.flush();\n }\n}\n\nclass ContestReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n \n ContestReader(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n \n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n \n public long nextLong() {\n return Long.parseLong(next());\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n \n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n}\n\nclass Algorithm {\n private static void swap(Object[] list, int a, int b) {\n Object tmp = list[a];\n list[a] = list[b];\n list[b] = tmp;\n }\n \n public static > boolean nextPermutation(T[] ts) {\n int rightMostAscendingOrderIndex = ts.length - 2;\n while (rightMostAscendingOrderIndex >= 0 &&\n ts[rightMostAscendingOrderIndex].compareTo(ts[rightMostAscendingOrderIndex + 1]) >= 0) {\n rightMostAscendingOrderIndex--;\n }\n if (rightMostAscendingOrderIndex < 0) {\n return false;\n }\n \n int rightMostGreatorIndex = ts.length - 1;\n while (ts[rightMostAscendingOrderIndex].compareTo(ts[rightMostGreatorIndex]) >= 0) {\n rightMostGreatorIndex--;\n }\n \n swap(ts, rightMostAscendingOrderIndex, rightMostGreatorIndex);\n for (int i = 0; i < (ts.length - rightMostAscendingOrderIndex - 1) / 2; i++) {\n swap(ts, rightMostAscendingOrderIndex + 1 + i, ts.length - 1 - i);\n }\n return true;\n }\n}\n\n", "language": "Java", "metadata": {"date": 1557743191, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03726.html", "problem_id": "p03726", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03726/input.txt", "sample_output_relpath": "derived/input_output/data/p03726/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03726/Java/s972902745.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s972902745", "user_id": "u853633924"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n private static String solve(int n, int[] a, int[] b) {\n ArrayList> edges = new ArrayList<>();\n for (int i = 0; i <= n; i++) {\n edges.add(new ArrayList<>());\n }\n for (int i = 0; i < n - 1; i++) {\n edges.get(a[i]).add(b[i]);\n edges.get(b[i]).add(a[i]);\n }\n for (int i = 1; i <= n; i++) {\n int numLeaf = 0;\n for (int next : edges.get(i)) {\n if (edges.get(next).size() == 1) {\n numLeaf++;\n }\n }\n if (numLeaf >= 2) {\n return \"First\";\n }\n }\n return \"Second\";\n }\n \n private static void execute(ContestReader reader, PrintWriter out) {\n int n = reader.nextInt();\n int[] a = new int[n - 1];\n int[] b = new int[n - 1];\n for (int i = 0; i < n - 1; i++) {\n a[i] = reader.nextInt();\n b[i] = reader.nextInt();\n }\n out.println(solve(n, a, b));\n }\n \n public static void main(String[] args) {\n ContestReader reader = new ContestReader(System.in);\n PrintWriter out = new PrintWriter(System.out);\n execute(reader, out);\n out.flush();\n }\n}\n\nclass ContestReader {\n private BufferedReader reader;\n private StringTokenizer tokenizer;\n \n ContestReader(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n \n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n \n public int nextInt() {\n return Integer.parseInt(next());\n }\n \n public long nextLong() {\n return Long.parseLong(next());\n }\n \n public double nextDouble() {\n return Double.parseDouble(next());\n }\n \n public int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextInt();\n }\n return array;\n }\n \n public long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++) {\n array[i] = nextLong();\n }\n return array;\n }\n}\n\nclass Algorithm {\n private static void swap(Object[] list, int a, int b) {\n Object tmp = list[a];\n list[a] = list[b];\n list[b] = tmp;\n }\n \n public static > boolean nextPermutation(T[] ts) {\n int rightMostAscendingOrderIndex = ts.length - 2;\n while (rightMostAscendingOrderIndex >= 0 &&\n ts[rightMostAscendingOrderIndex].compareTo(ts[rightMostAscendingOrderIndex + 1]) >= 0) {\n rightMostAscendingOrderIndex--;\n }\n if (rightMostAscendingOrderIndex < 0) {\n return false;\n }\n \n int rightMostGreatorIndex = ts.length - 1;\n while (ts[rightMostAscendingOrderIndex].compareTo(ts[rightMostGreatorIndex]) >= 0) {\n rightMostGreatorIndex--;\n }\n \n swap(ts, rightMostAscendingOrderIndex, rightMostGreatorIndex);\n for (int i = 0; i < (ts.length - rightMostAscendingOrderIndex - 1) / 2; i++) {\n swap(ts, rightMostAscendingOrderIndex + 1 + i, ts.length - 1 - i);\n }\n return true;\n }\n}\n\n", "problem_context": "Score : 900 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 through N.\nThe i-th of the N-1 edges connects vertices a_i and b_i.\n\nInitially, each vertex is uncolored.\n\nTakahashi and Aoki is playing a game by painting the vertices. In this game, they alternately perform the following operation, starting from Takahashi:\n\nSelect a vertex that is not painted yet.\n\nIf it is Takahashi who is performing this operation, paint the vertex white; paint it black if it is Aoki.\n\nThen, after all the vertices are colored, the following procedure takes place:\n\nRepaint every white vertex that is adjacent to a black vertex, in black.\n\nNote that all such white vertices are repainted simultaneously, not one at a time.\n\nIf there are still one or more white vertices remaining, Takahashi wins; if all the vertices are now black, Aoki wins.\nDetermine the winner of the game, assuming that both persons play optimally.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i,b_i ≤ N\n\na_i ≠ b_i\n\nThe input graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nPrint First if Takahashi wins; print Second if Aoki wins.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\nFirst\n\nBelow is a possible progress of the game:\n\nFirst, Takahashi paint vertex 2 white.\n\nThen, Aoki paint vertex 1 black.\n\nLastly, Takahashi paint vertex 3 white.\n\nIn this case, the colors of vertices 1, 2 and 3 after the final procedure are black, black and white, resulting in Takahashi's victory.\n\nSample Input 2\n\n4\n1 2\n2 3\n2 4\n\nSample Output 2\n\nFirst\n\nSample Input 3\n\n6\n1 2\n2 3\n3 4\n2 5\n5 6\n\nSample Output 3\n\nSecond", "sample_input": "3\n1 2\n2 3\n"}, "reference_outputs": ["First\n"], "source_document_id": "p03726", "source_text": "Score : 900 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 through N.\nThe i-th of the N-1 edges connects vertices a_i and b_i.\n\nInitially, each vertex is uncolored.\n\nTakahashi and Aoki is playing a game by painting the vertices. In this game, they alternately perform the following operation, starting from Takahashi:\n\nSelect a vertex that is not painted yet.\n\nIf it is Takahashi who is performing this operation, paint the vertex white; paint it black if it is Aoki.\n\nThen, after all the vertices are colored, the following procedure takes place:\n\nRepaint every white vertex that is adjacent to a black vertex, in black.\n\nNote that all such white vertices are repainted simultaneously, not one at a time.\n\nIf there are still one or more white vertices remaining, Takahashi wins; if all the vertices are now black, Aoki wins.\nDetermine the winner of the game, assuming that both persons play optimally.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i,b_i ≤ N\n\na_i ≠ b_i\n\nThe input graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nPrint First if Takahashi wins; print Second if Aoki wins.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\nFirst\n\nBelow is a possible progress of the game:\n\nFirst, Takahashi paint vertex 2 white.\n\nThen, Aoki paint vertex 1 black.\n\nLastly, Takahashi paint vertex 3 white.\n\nIn this case, the colors of vertices 1, 2 and 3 after the final procedure are black, black and white, resulting in Takahashi's victory.\n\nSample Input 2\n\n4\n1 2\n2 3\n2 4\n\nSample Output 2\n\nFirst\n\nSample Input 3\n\n6\n1 2\n2 3\n3 4\n2 5\n5 6\n\nSample Output 3\n\nSecond", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3155, "cpu_time_ms": 334, "memory_kb": 52396}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s160714838", "group_id": "codeNet:p03730", "input_text": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\n long A;\n long B;\n long C;\n try (Scanner sc = new Scanner(System.in)) {\n A = sc.nextLong();\n B = sc.nextLong();\n C = sc.nextLong();\n }\n\n long AmB = A % B;\n\n for (int i = 0; i < B; i++) {\n if ((AmB * i) % B == C) {\n System.out.println(\"Yes\");\n return;\n }\n }\n System.out.println(\"No\");\n }\n}\n", "language": "Java", "metadata": {"date": 1580752323, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03730.html", "problem_id": "p03730", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03730/input.txt", "sample_output_relpath": "derived/input_output/data/p03730/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03730/Java/s160714838.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s160714838", "user_id": "u499889187"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n\n long A;\n long B;\n long C;\n try (Scanner sc = new Scanner(System.in)) {\n A = sc.nextLong();\n B = sc.nextLong();\n C = sc.nextLong();\n }\n\n long AmB = A % B;\n\n for (int i = 0; i < B; i++) {\n if ((AmB * i) % B == C) {\n System.out.println(\"Yes\");\n return;\n }\n }\n System.out.println(\"No\");\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe ask you to select some number of positive integers, and calculate the sum of them.\n\nIt is allowed to select as many integers as you like, and as large integers as you wish.\nYou have to follow these, however: each selected integer needs to be a multiple of A, and you need to select at least one integer.\n\nYour objective is to make the sum congruent to C modulo B.\nDetermine whether this is possible.\n\nIf the objective is achievable, print YES. Otherwise, print NO.\n\nConstraints\n\n1 ≤ A ≤ 100\n\n1 ≤ B ≤ 100\n\n0 ≤ C < B\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint YES or NO.\n\nSample Input 1\n\n7 5 1\n\nSample Output 1\n\nYES\n\nFor example, if you select 7 and 14, the sum 21 is congruent to 1 modulo 5.\n\nSample Input 2\n\n2 2 1\n\nSample Output 2\n\nNO\n\nThe sum of even numbers, no matter how many, is never odd.\n\nSample Input 3\n\n1 100 97\n\nSample Output 3\n\nYES\n\nYou can select 97, since you may select multiples of 1, that is, all integers.\n\nSample Input 4\n\n40 98 58\n\nSample Output 4\n\nYES\n\nSample Input 5\n\n77 42 36\n\nSample Output 5\n\nNO", "sample_input": "7 5 1\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03730", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe ask you to select some number of positive integers, and calculate the sum of them.\n\nIt is allowed to select as many integers as you like, and as large integers as you wish.\nYou have to follow these, however: each selected integer needs to be a multiple of A, and you need to select at least one integer.\n\nYour objective is to make the sum congruent to C modulo B.\nDetermine whether this is possible.\n\nIf the objective is achievable, print YES. Otherwise, print NO.\n\nConstraints\n\n1 ≤ A ≤ 100\n\n1 ≤ B ≤ 100\n\n0 ≤ C < B\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint YES or NO.\n\nSample Input 1\n\n7 5 1\n\nSample Output 1\n\nYES\n\nFor example, if you select 7 and 14, the sum 21 is congruent to 1 modulo 5.\n\nSample Input 2\n\n2 2 1\n\nSample Output 2\n\nNO\n\nThe sum of even numbers, no matter how many, is never odd.\n\nSample Input 3\n\n1 100 97\n\nSample Output 3\n\nYES\n\nYou can select 97, since you may select multiples of 1, that is, all integers.\n\nSample Input 4\n\n40 98 58\n\nSample Output 4\n\nYES\n\nSample Input 5\n\n77 42 36\n\nSample Output 5\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 533, "cpu_time_ms": 95, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s141961179", "group_id": "codeNet:p03731", "input_text": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tFastScanner sc = new FastScanner();\n\t\tint N = sc.nextInt();\n\t\tint T = sc.nextInt();\n\t\tint[] t = new int[N];\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tt[i] = sc.nextInt();\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < N - 1; i++) {\n\t\t\tif (t[i + 1] - t[i] >= T)\n\t\t\t\tans += T;\n\t\t\telse\n\t\t\t\tans += t[i + 1] - t[i];\n\t\t}\n\t\tSystem.out.println(ans+T);\n\n\t}\n\t//以下、自作ライブラリ\n\n\t//最大公約数\n\tpublic static long gcd(long a, long b) {\n\t\tif (a < b)\n\t\t\treturn gcd(b, a);\n\t\tlong c = 0;\n\t\tc = a % b;\n\t\tif (c == 0)\n\t\t\treturn b;\n\t\treturn gcd(b, c);\n\t}\n\n\t//最小公倍数\n\tpublic static long lcm(long m, long n) {\n\t\treturn m * n / gcd(m, n);\n\t}\n\n\t//素数判定\n\tpublic static boolean isPrime(int n) {\n\t\tif (n < 2)\n\t\t\treturn false;\n\t\tif (n == 2)\n\t\t\treturn true;\n\t\tif (n % 2 == 0)\n\t\t\treturn false;\n\n\t\tfor (int i = 3; i * i <= n; i += 2) {\n\t\t\tif (n % i == 0)\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n}\n\n//以下、高速スキャナークラス\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n", "language": "Java", "metadata": {"date": 1578195563, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03731.html", "problem_id": "p03731", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03731/input.txt", "sample_output_relpath": "derived/input_output/data/p03731/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03731/Java/s141961179.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s141961179", "user_id": "u248897784"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\n\t\tFastScanner sc = new FastScanner();\n\t\tint N = sc.nextInt();\n\t\tint T = sc.nextInt();\n\t\tint[] t = new int[N];\n\t\tfor (int i = 0; i < N; i++)\n\t\t\tt[i] = sc.nextInt();\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < N - 1; i++) {\n\t\t\tif (t[i + 1] - t[i] >= T)\n\t\t\t\tans += T;\n\t\t\telse\n\t\t\t\tans += t[i + 1] - t[i];\n\t\t}\n\t\tSystem.out.println(ans+T);\n\n\t}\n\t//以下、自作ライブラリ\n\n\t//最大公約数\n\tpublic static long gcd(long a, long b) {\n\t\tif (a < b)\n\t\t\treturn gcd(b, a);\n\t\tlong c = 0;\n\t\tc = a % b;\n\t\tif (c == 0)\n\t\t\treturn b;\n\t\treturn gcd(b, c);\n\t}\n\n\t//最小公倍数\n\tpublic static long lcm(long m, long n) {\n\t\treturn m * n / gcd(m, n);\n\t}\n\n\t//素数判定\n\tpublic static boolean isPrime(int n) {\n\t\tif (n < 2)\n\t\t\treturn false;\n\t\tif (n == 2)\n\t\t\treturn true;\n\t\tif (n % 2 == 0)\n\t\t\treturn false;\n\n\t\tfor (int i = 3; i * i <= n; i += 2) {\n\t\t\tif (n % i == 0)\n\t\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n}\n\n//以下、高速スキャナークラス\nclass FastScanner {\n\tprivate final InputStream in = System.in;\n\tprivate final byte[] buffer = new byte[1024];\n\tprivate int ptr = 0;\n\tprivate int buflen = 0;\n\n\tprivate boolean hasNextByte() {\n\t\tif (ptr < buflen) {\n\t\t\treturn true;\n\t\t} else {\n\t\t\tptr = 0;\n\t\t\ttry {\n\t\t\t\tbuflen = in.read(buffer);\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tif (buflen <= 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate int readByte() {\n\t\tif (hasNextByte())\n\t\t\treturn buffer[ptr++];\n\t\telse\n\t\t\treturn -1;\n\t}\n\n\tprivate static boolean isPrintableChar(int c) {\n\t\treturn 33 <= c && c <= 126;\n\t}\n\n\tpublic boolean hasNext() {\n\t\twhile (hasNextByte() && !isPrintableChar(buffer[ptr]))\n\t\t\tptr++;\n\t\treturn hasNextByte();\n\t}\n\n\tpublic String next() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tint b = readByte();\n\t\twhile (isPrintableChar(b)) {\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\n\tpublic long nextLong() {\n\t\tif (!hasNext())\n\t\t\tthrow new NoSuchElementException();\n\t\tlong n = 0;\n\t\tboolean minus = false;\n\t\tint b = readByte();\n\t\tif (b == '-') {\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\tif (b < '0' || '9' < b) {\n\t\t\tthrow new NumberFormatException();\n\t\t}\n\t\twhile (true) {\n\t\t\tif ('0' <= b && b <= '9') {\n\t\t\t\tn *= 10;\n\t\t\t\tn += b - '0';\n\t\t\t} else if (b == -1 || !isPrintableChar(b)) {\n\t\t\t\treturn minus ? -n : n;\n\t\t\t} else {\n\t\t\t\tthrow new NumberFormatException();\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\n\tpublic int nextInt() {\n\t\tlong nl = nextLong();\n\t\tif (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)\n\t\t\tthrow new NumberFormatException();\n\t\treturn (int) nl;\n\t}\n\n\tpublic double nextDouble() {\n\t\treturn Double.parseDouble(next());\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn a public bath, there is a shower which emits water for T seconds when the switch is pushed.\n\nIf the switch is pushed when the shower is already emitting water, from that moment it will be emitting water for T seconds.\nNote that it does not mean that the shower emits water for T additional seconds.\n\nN people will push the switch while passing by the shower.\nThe i-th person will push the switch t_i seconds after the first person pushes it.\n\nHow long will the shower emit water in total?\n\nConstraints\n\n1 ≤ N ≤ 200,000\n\n1 ≤ T ≤ 10^9\n\n0 = t_1 < t_2 < t_3 < , ..., < t_{N-1} < t_N ≤ 10^9\n\nT and each t_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nt_1 t_2 ... t_N\n\nOutput\n\nAssume that the shower will emit water for a total of X seconds. Print X.\n\nSample Input 1\n\n2 4\n0 3\n\nSample Output 1\n\n7\n\nThree seconds after the first person pushes the water, the switch is pushed again and the shower emits water for four more seconds, for a total of seven seconds.\n\nSample Input 2\n\n2 4\n0 5\n\nSample Output 2\n\n8\n\nOne second after the shower stops emission of water triggered by the first person, the switch is pushed again.\n\nSample Input 3\n\n4 1000000000\n0 1000 1000000 1000000000\n\nSample Output 3\n\n2000000000\n\nSample Input 4\n\n1 1\n0\n\nSample Output 4\n\n1\n\nSample Input 5\n\n9 10\n0 3 5 7 100 110 200 300 311\n\nSample Output 5\n\n67", "sample_input": "2 4\n0 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03731", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn a public bath, there is a shower which emits water for T seconds when the switch is pushed.\n\nIf the switch is pushed when the shower is already emitting water, from that moment it will be emitting water for T seconds.\nNote that it does not mean that the shower emits water for T additional seconds.\n\nN people will push the switch while passing by the shower.\nThe i-th person will push the switch t_i seconds after the first person pushes it.\n\nHow long will the shower emit water in total?\n\nConstraints\n\n1 ≤ N ≤ 200,000\n\n1 ≤ T ≤ 10^9\n\n0 = t_1 < t_2 < t_3 < , ..., < t_{N-1} < t_N ≤ 10^9\n\nT and each t_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nt_1 t_2 ... t_N\n\nOutput\n\nAssume that the shower will emit water for a total of X seconds. Print X.\n\nSample Input 1\n\n2 4\n0 3\n\nSample Output 1\n\n7\n\nThree seconds after the first person pushes the water, the switch is pushed again and the shower emits water for four more seconds, for a total of seven seconds.\n\nSample Input 2\n\n2 4\n0 5\n\nSample Output 2\n\n8\n\nOne second after the shower stops emission of water triggered by the first person, the switch is pushed again.\n\nSample Input 3\n\n4 1000000000\n0 1000 1000000 1000000000\n\nSample Output 3\n\n2000000000\n\nSample Input 4\n\n1 1\n0\n\nSample Output 4\n\n1\n\nSample Input 5\n\n9 10\n0 3 5 7 100 110 200 300 311\n\nSample Output 5\n\n67", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2810, "cpu_time_ms": 125, "memory_kb": 23508}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s629765186", "group_id": "codeNet:p03737", "input_text": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s1 = sc.next();\n\t\tString s2 = sc.next();\n\t\tString s3 = sc.next();\n\t\tsc.close();\n\t\tString str1 = s1.substring(0,1).toUpperCase();\n\t\tString str2 = s2.substring(0,1).toUpperCase();\n\t\tString str3 = s3.substring(0,1).toUpperCase();\n\t\tSystem.out.println(str1 + str2 + str3);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1493488436, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03737.html", "problem_id": "p03737", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03737/input.txt", "sample_output_relpath": "derived/input_output/data/p03737/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03737/Java/s629765186.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s629765186", "user_id": "u764011970"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tScanner sc = new Scanner(System.in);\n\t\tString s1 = sc.next();\n\t\tString s2 = sc.next();\n\t\tString s3 = sc.next();\n\t\tsc.close();\n\t\tString str1 = s1.substring(0,1).toUpperCase();\n\t\tString str2 = s2.substring(0,1).toUpperCase();\n\t\tString str3 = s3.substring(0,1).toUpperCase();\n\t\tSystem.out.println(str1 + str2 + str3);\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.\nPrint the acronym formed from the uppercased initial letters of the words.\n\nConstraints\n\ns_1, s_2 and s_3 are composed of lowercase English letters.\n\n1 ≤ |s_i| ≤ 10 (1≤i≤3)\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_1 s_2 s_3\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\natcoder beginner contest\n\nSample Output 1\n\nABC\n\nThe initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.\n\nSample Input 2\n\nresident register number\n\nSample Output 2\n\nRRN\n\nSample Input 3\n\nk nearest neighbor\n\nSample Output 3\n\nKNN\n\nSample Input 4\n\nasync layered coding\n\nSample Output 4\n\nALC", "sample_input": "atcoder beginner contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03737", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.\nPrint the acronym formed from the uppercased initial letters of the words.\n\nConstraints\n\ns_1, s_2 and s_3 are composed of lowercase English letters.\n\n1 ≤ |s_i| ≤ 10 (1≤i≤3)\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_1 s_2 s_3\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\natcoder beginner contest\n\nSample Output 1\n\nABC\n\nThe initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.\n\nSample Input 2\n\nresident register number\n\nSample Output 2\n\nRRN\n\nSample Input 3\n\nk nearest neighbor\n\nSample Output 3\n\nKNN\n\nSample Input 4\n\nasync layered coding\n\nSample Output 4\n\nALC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 467, "cpu_time_ms": 94, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s201757777", "group_id": "codeNet:p03740", "input_text": "\nimport java.util.Scanner;\n\npublic class Main {\n\n private static Scanner scan = new Scanner(System.in);\n\n public static void main(String[] args) {\n\tlong X = Long.parseLong(scan.next());\n\tlong Y = Long.parseLong(scan.next());\n\n\tSystem.out.println(Math.abs(X-Y) <= 1 ? \"Brown\" : \"Alice\");\n\tscan.close();\n }\n}\n", "language": "Java", "metadata": {"date": 1498348586, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03740.html", "problem_id": "p03740", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03740/input.txt", "sample_output_relpath": "derived/input_output/data/p03740/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03740/Java/s201757777.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s201757777", "user_id": "u043692992"}, "prompt_components": {"gold_output": "Brown\n", "input_to_evaluate": "\nimport java.util.Scanner;\n\npublic class Main {\n\n private static Scanner scan = new Scanner(System.in);\n\n public static void main(String[] args) {\n\tlong X = Long.parseLong(scan.next());\n\tlong Y = Long.parseLong(scan.next());\n\n\tSystem.out.println(Math.abs(X-Y) <= 1 ? \"Brown\" : \"Alice\");\n\tscan.close();\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nAlice and Brown loves games. Today, they will play the following game.\n\nIn this game, there are two piles initially consisting of X and Y stones, respectively.\nAlice and Bob alternately perform the following operation, starting from Alice:\n\nTake 2i stones from one of the piles. Then, throw away i of them, and put the remaining i in the other pile. Here, the integer i (1≤i) can be freely chosen as long as there is a sufficient number of stones in the pile.\n\nThe player who becomes unable to perform the operation, loses the game.\n\nGiven X and Y, determine the winner of the game, assuming that both players play optimally.\n\nConstraints\n\n0 ≤ X, Y ≤ 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the winner: either Alice or Brown.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\nBrown\n\nAlice can do nothing but taking two stones from the pile containing two stones. As a result, the piles consist of zero and two stones, respectively. Then, Brown will take the two stones, and the piles will consist of one and zero stones, respectively. Alice will be unable to perform the operation anymore, which means Brown's victory.\n\nSample Input 2\n\n5 0\n\nSample Output 2\n\nAlice\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\nBrown\n\nSample Input 4\n\n4 8\n\nSample Output 4\n\nAlice", "sample_input": "2 1\n"}, "reference_outputs": ["Brown\n"], "source_document_id": "p03740", "source_text": "Score : 500 points\n\nProblem Statement\n\nAlice and Brown loves games. Today, they will play the following game.\n\nIn this game, there are two piles initially consisting of X and Y stones, respectively.\nAlice and Bob alternately perform the following operation, starting from Alice:\n\nTake 2i stones from one of the piles. Then, throw away i of them, and put the remaining i in the other pile. Here, the integer i (1≤i) can be freely chosen as long as there is a sufficient number of stones in the pile.\n\nThe player who becomes unable to perform the operation, loses the game.\n\nGiven X and Y, determine the winner of the game, assuming that both players play optimally.\n\nConstraints\n\n0 ≤ X, Y ≤ 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the winner: either Alice or Brown.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\nBrown\n\nAlice can do nothing but taking two stones from the pile containing two stones. As a result, the piles consist of zero and two stones, respectively. Then, Brown will take the two stones, and the piles will consist of one and zero stones, respectively. Alice will be unable to perform the operation anymore, which means Brown's victory.\n\nSample Input 2\n\n5 0\n\nSample Output 2\n\nAlice\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\nBrown\n\nSample Input 4\n\n4 8\n\nSample Output 4\n\nAlice", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 316, "cpu_time_ms": 92, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s702841836", "group_id": "codeNet:p03742", "input_text": "\nimport java.io.*;\nimport java.util.*;\n\npublic class Main{\n \n public static void main(String args[])throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(br.readLine());\n int a = Integer.parseInt(st.nextToken());\n int b = Integer.parseInt(st.nextToken());\n if((a^b)==0){\n System.out.println(\"Alice\");\n }else{\n System.out.println(\"Brown\");\n }\n \n }\n \n}\n\n", "language": "Java", "metadata": {"date": 1492911976, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03742.html", "problem_id": "p03742", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03742/input.txt", "sample_output_relpath": "derived/input_output/data/p03742/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03742/Java/s702841836.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s702841836", "user_id": "u628833380"}, "prompt_components": {"gold_output": "Brown\n", "input_to_evaluate": "\nimport java.io.*;\nimport java.util.*;\n\npublic class Main{\n \n public static void main(String args[])throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(br.readLine());\n int a = Integer.parseInt(st.nextToken());\n int b = Integer.parseInt(st.nextToken());\n if((a^b)==0){\n System.out.println(\"Alice\");\n }else{\n System.out.println(\"Brown\");\n }\n \n }\n \n}\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nAlice and Brown loves games. Today, they will play the following game.\n\nIn this game, there are two piles initially consisting of X and Y stones, respectively.\nAlice and Bob alternately perform the following operation, starting from Alice:\n\nTake 2i stones from one of the piles. Then, throw away i of them, and put the remaining i in the other pile. Here, the integer i (1≤i) can be freely chosen as long as there is a sufficient number of stones in the pile.\n\nThe player who becomes unable to perform the operation, loses the game.\n\nGiven X and Y, determine the winner of the game, assuming that both players play optimally.\n\nConstraints\n\n0 ≤ X, Y ≤ 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the winner: either Alice or Brown.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\nBrown\n\nAlice can do nothing but taking two stones from the pile containing two stones. As a result, the piles consist of zero and two stones, respectively. Then, Brown will take the two stones, and the piles will consist of one and zero stones, respectively. Alice will be unable to perform the operation anymore, which means Brown's victory.\n\nSample Input 2\n\n5 0\n\nSample Output 2\n\nAlice\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\nBrown\n\nSample Input 4\n\n4 8\n\nSample Output 4\n\nAlice", "sample_input": "2 1\n"}, "reference_outputs": ["Brown\n"], "source_document_id": "p03742", "source_text": "Score : 500 points\n\nProblem Statement\n\nAlice and Brown loves games. Today, they will play the following game.\n\nIn this game, there are two piles initially consisting of X and Y stones, respectively.\nAlice and Bob alternately perform the following operation, starting from Alice:\n\nTake 2i stones from one of the piles. Then, throw away i of them, and put the remaining i in the other pile. Here, the integer i (1≤i) can be freely chosen as long as there is a sufficient number of stones in the pile.\n\nThe player who becomes unable to perform the operation, loses the game.\n\nGiven X and Y, determine the winner of the game, assuming that both players play optimally.\n\nConstraints\n\n0 ≤ X, Y ≤ 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the winner: either Alice or Brown.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\nBrown\n\nAlice can do nothing but taking two stones from the pile containing two stones. As a result, the piles consist of zero and two stones, respectively. Then, Brown will take the two stones, and the piles will consist of one and zero stones, respectively. Alice will be unable to perform the operation anymore, which means Brown's victory.\n\nSample Input 2\n\n5 0\n\nSample Output 2\n\nAlice\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\nBrown\n\nSample Input 4\n\n4 8\n\nSample Output 4\n\nAlice", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 526, "cpu_time_ms": 72, "memory_kb": 24532}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s350516078", "group_id": "codeNet:p03747", "input_text": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tMain main = new Main();\n\t\tmain.solveC();\n\t}\n\n\tprivate void solveC() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint L = sc.nextInt();\n\t\tint T = sc.nextInt();\n\t\tint offset = L;\n\t\tList list = new ArrayList();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tint x = sc.nextInt();\n\t\t\tint d = sc.nextInt();\n\t\t\tint g = x + T * (3 - d * 2);\n\t\t\tlist.add(g);\n\t\t\tif (offset > g) {\n\t\t\t\toffset = g;\n\t\t\t}\n\t\t}\n\t\tList relativeList = new ArrayList();\n\t\tint index = 0;\n\t\tfor (int x : list) {\n\t\t\trelativeList.add((x - offset) % L);\n\t\t\tif (x - offset >= L) {\n\t\t\t\tindex += (x - offset) / L;\n\t\t\t}\n\t\t}\n\t\tCollections.sort(relativeList);\n\t\tindex %= N;\n\t\tfor (int x : relativeList.subList(index, N)) {\n\t\t\tSystem.out.println((((x + offset) % L) + L) % L);\n\t\t}\n\t\tfor (int x : relativeList.subList(0, index)) {\n\t\t\tSystem.out.println((((x + offset) % L) + L) % L);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1492312565, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03747.html", "problem_id": "p03747", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03747/input.txt", "sample_output_relpath": "derived/input_output/data/p03747/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03747/Java/s350516078.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s350516078", "user_id": "u564054133"}, "prompt_components": {"gold_output": "1\n3\n0\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Scanner;\npublic class Main {\n\tpublic static void main(String[] args){\n\t\tMain main = new Main();\n\t\tmain.solveC();\n\t}\n\n\tprivate void solveC() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint L = sc.nextInt();\n\t\tint T = sc.nextInt();\n\t\tint offset = L;\n\t\tList list = new ArrayList();\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tint x = sc.nextInt();\n\t\t\tint d = sc.nextInt();\n\t\t\tint g = x + T * (3 - d * 2);\n\t\t\tlist.add(g);\n\t\t\tif (offset > g) {\n\t\t\t\toffset = g;\n\t\t\t}\n\t\t}\n\t\tList relativeList = new ArrayList();\n\t\tint index = 0;\n\t\tfor (int x : list) {\n\t\t\trelativeList.add((x - offset) % L);\n\t\t\tif (x - offset >= L) {\n\t\t\t\tindex += (x - offset) / L;\n\t\t\t}\n\t\t}\n\t\tCollections.sort(relativeList);\n\t\tindex %= N;\n\t\tfor (int x : relativeList.subList(index, N)) {\n\t\t\tSystem.out.println((((x + offset) % L) + L) % L);\n\t\t}\n\t\tfor (int x : relativeList.subList(0, index)) {\n\t\t\tSystem.out.println((((x + offset) % L) + L) % L);\n\t\t}\n\t}\n}", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere is a circle with a circumference of L.\nEach point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point.\nOn this circumference, there are N ants.\nThese ants are numbered 1 through N in order of increasing coordinate, and ant i is at coordinate X_i.\n\nThe N ants have just started walking.\nFor each ant i, you are given the initial direction W_i. Ant i is initially walking clockwise if W_i is 1; counterclockwise if W_i is 2.\nEvery ant walks at a constant speed of 1 per second.\nSometimes, two ants bump into each other.\nEach of these two ants will then turn around and start walking in the opposite direction.\n\nFor each ant, find its position after T seconds.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq L \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\n0 \\leq X_1 < X_2 < ... < X_N \\leq L - 1\n\n1 \\leq W_i \\leq 2\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L T\nX_1 W_1\nX_2 W_2\n:\nX_N W_N\n\nOutput\n\nPrint N lines.\nThe i-th line should contain the coordinate of ant i after T seconds. Here, each coordinate must be between 0 and L-1, inclusive.\n\nSample Input 1\n\n3 8 3\n0 1\n3 2\n6 1\n\nSample Output 1\n\n1\n3\n0\n\n1.5 seconds after the ants start walking, ant 1 and 2 bump into each other at coordinate 1.5.\n1 second after that, ant 1 and 3 bump into each other at coordinate 0.5.\n0.5 seconds after that, that is, 3 seconds after the ants start walking, ants 1, 2 and 3 are at coordinates 1, 3 and 0, respectively.\n\nSample Input 2\n\n4 20 9\n7 2\n9 1\n12 1\n18 1\n\nSample Output 2\n\n7\n18\n18\n1", "sample_input": "3 8 3\n0 1\n3 2\n6 1\n"}, "reference_outputs": ["1\n3\n0\n"], "source_document_id": "p03747", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere is a circle with a circumference of L.\nEach point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point.\nOn this circumference, there are N ants.\nThese ants are numbered 1 through N in order of increasing coordinate, and ant i is at coordinate X_i.\n\nThe N ants have just started walking.\nFor each ant i, you are given the initial direction W_i. Ant i is initially walking clockwise if W_i is 1; counterclockwise if W_i is 2.\nEvery ant walks at a constant speed of 1 per second.\nSometimes, two ants bump into each other.\nEach of these two ants will then turn around and start walking in the opposite direction.\n\nFor each ant, find its position after T seconds.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq L \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\n0 \\leq X_1 < X_2 < ... < X_N \\leq L - 1\n\n1 \\leq W_i \\leq 2\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L T\nX_1 W_1\nX_2 W_2\n:\nX_N W_N\n\nOutput\n\nPrint N lines.\nThe i-th line should contain the coordinate of ant i after T seconds. Here, each coordinate must be between 0 and L-1, inclusive.\n\nSample Input 1\n\n3 8 3\n0 1\n3 2\n6 1\n\nSample Output 1\n\n1\n3\n0\n\n1.5 seconds after the ants start walking, ant 1 and 2 bump into each other at coordinate 1.5.\n1 second after that, ant 1 and 3 bump into each other at coordinate 0.5.\n0.5 seconds after that, that is, 3 seconds after the ants start walking, ants 1, 2 and 3 are at coordinates 1, 3 and 0, respectively.\n\nSample Input 2\n\n4 20 9\n7 2\n9 1\n12 1\n18 1\n\nSample Output 2\n\n7\n18\n18\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1060, "cpu_time_ms": 1305, "memory_kb": 76784}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s103218367", "group_id": "codeNet:p03759", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main {\n\n public static void main(String[] args) throws Exception {\n\n try {\n\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n String[] pillarHeightList = br.readLine().split(\" \");\n int firstPillar = Integer.parseInt(pillarHeightList[0]);\n int secondPillar = Integer.parseInt(pillarHeightList[1]);\n int thirdPillar = Integer.parseInt(pillarHeightList[2]);\n\n String isPillarsBeautiful = \"NO\";\n\n if ((secondPillar - firstPillar) == (thirdPillar - secondPillar)) {\n isPillarsBeautiful = \"YES\";\n }\n\n System.out.println(isPillarsBeautiful);\n\n } catch (IOException | NumberFormatException e) {\n e.printStackTrace();\n System.exit(0);\n } catch (final Exception e) {\n e.printStackTrace();\n System.exit(0);\n }\n }\n}", "language": "Java", "metadata": {"date": 1585514334, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03759.html", "problem_id": "p03759", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03759/input.txt", "sample_output_relpath": "derived/input_output/data/p03759/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03759/Java/s103218367.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s103218367", "user_id": "u233179341"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\nclass Main {\n\n public static void main(String[] args) throws Exception {\n\n try {\n\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n String[] pillarHeightList = br.readLine().split(\" \");\n int firstPillar = Integer.parseInt(pillarHeightList[0]);\n int secondPillar = Integer.parseInt(pillarHeightList[1]);\n int thirdPillar = Integer.parseInt(pillarHeightList[2]);\n\n String isPillarsBeautiful = \"NO\";\n\n if ((secondPillar - firstPillar) == (thirdPillar - secondPillar)) {\n isPillarsBeautiful = \"YES\";\n }\n\n System.out.println(isPillarsBeautiful);\n\n } catch (IOException | NumberFormatException e) {\n e.printStackTrace();\n System.exit(0);\n } catch (final Exception e) {\n e.printStackTrace();\n System.exit(0);\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThree poles stand evenly spaced along a line. Their heights are a, b and c meters, from left to right.\nWe will call the arrangement of the poles beautiful if the tops of the poles lie on the same line, that is, b-a = c-b.\n\nDetermine whether the arrangement of the poles is beautiful.\n\nConstraints\n\n1 \\leq a,b,c \\leq 100\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint YES if the arrangement of the poles is beautiful; print NO otherwise.\n\nSample Input 1\n\n2 4 6\n\nSample Output 1\n\nYES\n\nSince 4-2 = 6-4, this arrangement of poles is beautiful.\n\nSample Input 2\n\n2 5 6\n\nSample Output 2\n\nNO\n\nSince 5-2 \\neq 6-5, this arrangement of poles is not beautiful.\n\nSample Input 3\n\n3 2 1\n\nSample Output 3\n\nYES\n\nSince 1-2 = 2-3, this arrangement of poles is beautiful.", "sample_input": "2 4 6\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03759", "source_text": "Score : 100 points\n\nProblem Statement\n\nThree poles stand evenly spaced along a line. Their heights are a, b and c meters, from left to right.\nWe will call the arrangement of the poles beautiful if the tops of the poles lie on the same line, that is, b-a = c-b.\n\nDetermine whether the arrangement of the poles is beautiful.\n\nConstraints\n\n1 \\leq a,b,c \\leq 100\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint YES if the arrangement of the poles is beautiful; print NO otherwise.\n\nSample Input 1\n\n2 4 6\n\nSample Output 1\n\nYES\n\nSince 4-2 = 6-4, this arrangement of poles is beautiful.\n\nSample Input 2\n\n2 5 6\n\nSample Output 2\n\nNO\n\nSince 5-2 \\neq 6-5, this arrangement of poles is not beautiful.\n\nSample Input 3\n\n3 2 1\n\nSample Output 3\n\nYES\n\nSince 1-2 = 2-3, this arrangement of poles is beautiful.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1022, "cpu_time_ms": 71, "memory_kb": 20308}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s359484808", "group_id": "codeNet:p03759", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.lang.Character.Subset;\nimport java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.time.temporal.ValueRange;\nimport java.util.AbstractMap;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.Objects;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\n Solver solver = new Solver(in, out);\n solver.solve();\n\n out.close();\n }\n\n // ======================================================================\n static class Solver {\n \tMyInput in;\n \tPrintWriter out;\n public Solver(MyInput in, PrintWriter out) {\n \tthis.in = in;\n \tthis.out = out;\n }\n \n // ======================================================================\n public void solve() {\n int a = ni();\n int b = ni();\n int c = ni();\n prn((b-a) == (c-b) ? \"YES\" : \"NO\");\n }\n // -----------------------------------------\n // Integer のキーに対して、カウントを管理する（カウントを足したり、引いたりする）\n static class MapCounter {\n \tprivate Map map = new HashMap<>();\n \tpublic MapCounter() {}\n \t// キーのカウントに値を足す\n \tpublic void add(int key) {\n \t\tadd(key, 1);\n \t}\n \tpublic void add(int key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)cnt);\n \t\t} else {\n \t\t\tmap.put(key, val + cnt);\n \t\t}\n \t}\n \t// キーのカウントから値を引く\n \tpublic void sub(int key) {\n \t\tsub(key, 1);\n \t}\n \tpublic void sub(int key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)-cnt);\n \t\t} else {\n \t\t\tmap.put(key, val - cnt);\n \t\t}\n \t}\n \t// キーのカウントを取得する（なければ　ＮＵＬＬを返す）\n \tpublic Long getCountwithNull(int key) {\n \t\treturn map.get(key);\n \t}\n \t// キーのカウントを取得する（なければ　０　を返す）\n \tpublic Long getCount(int key) {\n \t\tLong val = map.get(key);\n \t\tif(val == null)\t\treturn 0L;\n \t\telse \t\t\t\treturn val;\n \t}\n \tpublic Set getKey() {\n \t\treturn map.keySet();\n \t}\n \t// 登録されているキーの数を返す\n \tpublic int getKeyCount() {\n \t\treturn map.keySet().size();\n \t}\n }\n // -----------------------------------------\n // 配列のバイナリーサーチ　１\n boolean isRightMin(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] >= key)\t\treturn true;\t\t// 以上\n \t else if (!f && a[index] > key)\treturn true;\t\t// より大きい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以上（f=true)または、より大きく（f=false)、一番小さい値を返す\n \tint binarySearchRightMin(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isRightMin(a, f, mid, key))\tok = mid;\t// 下半分を対象とする\n \t else \t\t\t\t\t\t\tng = mid;\t// 上半分を対象とする\n \t }\t\n \t return ok;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n // -----------------------------------------\n // 配列のバイナリーサーチ　２\n boolean isLeftMax(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] <= key)\t\treturn true;\t\t// 以下\n \t else if (!f && a[index] < key)\treturn true;\t\t// より小さい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以下（f=true)または、より小さい（f=false)、一番大きい値を返す\n \tint binarySearchLeftMax(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isLeftMax(a, f, mid, key))\tng = mid;\t// 上半分を対象とする\n \t else \t\t\t\t\t\t\tok = mid;\t// 下半分を対象とする\n \t }\t\n \t return ng;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n \t\n // -----------------------------------------\n \t// オイラーツアー（部分木対応）\n \tstatic class EulerTour {\n \t\tGraph g;\n \t\tList euler_tour = new ArrayList<>();\n \t\tint[] begin, end;\n \t\tint k = 0, root = 0;\n \t\t\n \t\tvoid dfs(int v,int p, PrintWriter out) {\n \t\t\tout.println(\"v = \" + v + \" p = \" + p);\n \t\t\tbegin[v] = k;\n \t\t\teuler_tour.add(v);\n \t\t\tk++;\n \t\t\tif(!g.contains(v)) {\n \t\t\t\treturn;\n \t\t\t}\n \t\t\tfor(int i : g.get(v)) {\n \t\t\t\tif(i != p) {\n \t\t\t\t\tdfs(i, v, out);\n \t\t\t\t\teuler_tour.add(v);\n \t\t\t\t\tk++;\n \t\t\t\t}\n \t\t\t}\n \t\t\tend[v]=k;\n \t\t}\n \t\t// 初期化\n \t\tpublic void init(int p_cnt, int root, Graph g, PrintWriter out) {\n \t\t\tbegin = new int[p_cnt + 1];\n \t\t\tend = new int[p_cnt + 1];\n \t\t\tthis.root = root;\n \t\t\tthis.g = g;\n \t\t\tdfs(root, -1, out);\n \t\t}\n \t\t// 部分木の頂点を渡すと、オイラーツアーの部分木を返す\n \t\tpublic List getPartTour(int v) {\n \t\t\treturn euler_tour.subList(begin[v], end[v]);\n \t\t}\n \t\t// 部分木の頂点を渡すと、頂点のリストを返す\n \t\tpublic List getPartList(int v) {\n \t\t\tSet set = new TreeSet<>();\n\t\t\t\tset.addAll(getPartTour(v));\n\t\t\t\tList ans = new ArrayList<>();\n\t\t\t\tfor(Integer p : set) {\n\t\t\t\t\tans.add(p);\n\t\t\t\t}\n\t\t\t\treturn ans;\n \t\t}\n \t}\n \t\n // -----------------------------------------\n // グラフのリンクリスト\n static class Graph {\n \t// 頂点に紐づく頂点のリスト\n private Map> data = new HashMap>();\n// // 全ての頂点のセット\n// private Set point = new TreeSet<>();\n // 頂点と頂点の繋がりを追加する\n void add(int from, int to) {\n \tList list = data.get(from);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(from, list);\n \t}\n \tlist.add(to);\n// \tpoint.add(key);\n// \tpoint.add(value);\n }\n // 指定された頂点に紐づく、頂点のリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList list = data.get(key_1);\n \tif(list == null)\treturn false;\n \telse \t\t\t\treturn list.contains(key_2);\n }\n // 指定された頂点から、すべての頂点への距離を返す\n List distList(int key) {\n \tList dist = new ArrayList<>();\t\t// 頂点と距離のペアのリスト\n \tSet mark = new HashSet<>();\t// 処理したら入れる\n \t\t\tStack stack = new Stack<>();\t\t// スタックの宣言\n \t\t\tstack.push(new PP(key, 0));\t\t\t\t// スタートをスタックに保存\n \t\t\twhile(!stack.isEmpty()) {\n \t\t\t\tPP wk = stack.pop();\t\t\t\t// スタックから次の頂点を取得\n \t\t\t\tint pp = wk.getKey();\n \t\t\t\tint dd = wk.getVal();\n \t\t\t\tmark.add(pp);\t\t\t\t\t\t// 通過マーク\n \t\t\tdist.add(new PP(pp, dd));\t\t\t// 距離を登録\n \t\t\t\tList list = get(pp);\t\t// つながっている頂点のリストを取得\n \t\t\t\tfor(int next : list) {\n \t\t\t\t\tif(mark.contains(next))\tcontinue;\n \t\t\t\t\tstack.push(new PP(next, dd + 1));\n \t\t\t\t}\n \t\t\t}\n \t\t\treturn dist;\n }\n // ダンプ\n void dump(PrintWriter out) {\n \tfor(int key : data.keySet()) {\n \t\tout.print(key + \" : \");\n \t\tfor(int val : data.get(key)) {\n \t\t\tout.print(val + \" \");\n \t\t}\n \t\tout.println(\"\");\n \t}\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト\n static class GraphWith {\n \t// キーに紐づくリストに、頂点番号と重さのペアを持つ\n private Map> data = new HashMap>();\n // 指定された頂点に紐づく、頂点と重さのペアを追加する\n void add(int key, PP p) {\n \tList list = data.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(key, list);\n \t}\n \tlist.add(p);\n }\n // 頂点に紐づく、頂点と重さのペアのリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // グラフの存在チェック（重さは関係しない）\n // 頂点　key と 頂点　value がつながっていれば　true を返す\n boolean contains(int key, int value) {\n \tList list = data.get(key);\n \tif(list == null)\treturn false;\n \tboolean ans = false;\n \tfor(PP p : list) {\n \t\tif(p.getKey() == value) {\n \t\t\tans = true;\n \t\t\tbreak;\n \t\t}\n \t}\n \treturn ans;\n }\n }\n // -----------------------------------------\n // グラフのリンクリスト(Long)\n static class GraphLong {\n private Map> G = new HashMap>();\n void add(long key, long value) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(value);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト(Long)\n static class GraphLongWith {\n private Map> G = new HashMap>();\n void add(long key, PPL p) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(p);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n\n void prn(String s) {\n \tout.println(s);\n }\n void prn(int i) {\n \tout.println(i);\n }\n void prn(long i) {\n \tout.println(i);\n }\n void prr(String s) {\n \tout.print(s);\n }\n int ni() {\n \treturn in.nextInt();\n }\n long nl() {\n \treturn in.nextLong();\n }\n double nd() {\n \treturn in.nextDouble();\n }\n String ns() {\n \treturn in.nextString();\n }\n int[] ndi(int n) {\n \tint[] ans = new int[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ni();\n \t}\n \treturn ans;\n }\n long[] ndl(int n) {\n \tlong[] ans = new long[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nl();\n \t}\n \treturn ans;\n }\n double[] ndd(int n) {\n \tdouble[] ans = new double[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nd();\n \t}\n \treturn ans;\n }\n String[] nds(int n) {\n \tString[] ans = new String[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ns();\n \t}\n \treturn ans;\n }\n int[][] nddi(int n, int m) {\n \tint[][] ans = new int[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = ni();\n \t}\n \t}\n \treturn ans;\n }\n long[][] nddl(int n, int m) {\n \tlong[][] ans = new long[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = nl();\n \t}\n \t}\n \treturn ans;\n }\n }\n static class PP{\n \tpublic int key, val;\n \tpublic PP(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(int key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(int val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPL {\n \tpublic long key, val;\n \tpublic PPL(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPDL {\n \tpublic long key;\n \tpublic long[] val;\n \tpublic PPDL(long key, long[] val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long[] getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long[] val) {\n\t\t\tthis.val = val;\n\t\t}\n\t\tpublic void dump(PrintWriter out) {\n\t\t\tout.print(\"key = \" + key + \" val \");\n\t\t\tfor(int i=0; i < val.length; i++) {\n\t\t\t\tout.print(\"[\" + val[i] + \"] \");\n\t\t\t}\n\t\t\tout.println(\"\");\n\t\t}\n }\n // HashMap のキーに使う\n static final class PPKEY{\n \tprivate final int key, val;\n \tpublic PPKEY(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // HashMap のキーに使う\n static final class PPLKEY{\n \tprivate final long key, val;\n \tpublic PPLKEY(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // ======================================================================\n static class Pair extends AbstractMap.SimpleEntry {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n }\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public double nextDouble() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n double ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n int cnt = 0;\n for (; i < len; i++) {\n \tif(str[i] == '.') {\n \t\tcnt = 10;\n \t\tcontinue;\n \t}\n \tif(cnt == 0) {\n \t\tret = ret * 10 + str[i] - '0';\n \t} else {\n \t\tret = ret + ((double)(str[i] - '0') / cnt);\n \t\tcnt *= 10;\n \t}\n }\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n\n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1566780073, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03759.html", "problem_id": "p03759", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03759/input.txt", "sample_output_relpath": "derived/input_output/data/p03759/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03759/Java/s359484808.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359484808", "user_id": "u181039779"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.lang.Character.Subset;\nimport java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.time.temporal.ValueRange;\nimport java.util.AbstractMap;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.Objects;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\n Solver solver = new Solver(in, out);\n solver.solve();\n\n out.close();\n }\n\n // ======================================================================\n static class Solver {\n \tMyInput in;\n \tPrintWriter out;\n public Solver(MyInput in, PrintWriter out) {\n \tthis.in = in;\n \tthis.out = out;\n }\n \n // ======================================================================\n public void solve() {\n int a = ni();\n int b = ni();\n int c = ni();\n prn((b-a) == (c-b) ? \"YES\" : \"NO\");\n }\n // -----------------------------------------\n // Integer のキーに対して、カウントを管理する（カウントを足したり、引いたりする）\n static class MapCounter {\n \tprivate Map map = new HashMap<>();\n \tpublic MapCounter() {}\n \t// キーのカウントに値を足す\n \tpublic void add(int key) {\n \t\tadd(key, 1);\n \t}\n \tpublic void add(int key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)cnt);\n \t\t} else {\n \t\t\tmap.put(key, val + cnt);\n \t\t}\n \t}\n \t// キーのカウントから値を引く\n \tpublic void sub(int key) {\n \t\tsub(key, 1);\n \t}\n \tpublic void sub(int key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)-cnt);\n \t\t} else {\n \t\t\tmap.put(key, val - cnt);\n \t\t}\n \t}\n \t// キーのカウントを取得する（なければ　ＮＵＬＬを返す）\n \tpublic Long getCountwithNull(int key) {\n \t\treturn map.get(key);\n \t}\n \t// キーのカウントを取得する（なければ　０　を返す）\n \tpublic Long getCount(int key) {\n \t\tLong val = map.get(key);\n \t\tif(val == null)\t\treturn 0L;\n \t\telse \t\t\t\treturn val;\n \t}\n \tpublic Set getKey() {\n \t\treturn map.keySet();\n \t}\n \t// 登録されているキーの数を返す\n \tpublic int getKeyCount() {\n \t\treturn map.keySet().size();\n \t}\n }\n // -----------------------------------------\n // 配列のバイナリーサーチ　１\n boolean isRightMin(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] >= key)\t\treturn true;\t\t// 以上\n \t else if (!f && a[index] > key)\treturn true;\t\t// より大きい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以上（f=true)または、より大きく（f=false)、一番小さい値を返す\n \tint binarySearchRightMin(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isRightMin(a, f, mid, key))\tok = mid;\t// 下半分を対象とする\n \t else \t\t\t\t\t\t\tng = mid;\t// 上半分を対象とする\n \t }\t\n \t return ok;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n // -----------------------------------------\n // 配列のバイナリーサーチ　２\n boolean isLeftMax(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] <= key)\t\treturn true;\t\t// 以下\n \t else if (!f && a[index] < key)\treturn true;\t\t// より小さい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以下（f=true)または、より小さい（f=false)、一番大きい値を返す\n \tint binarySearchLeftMax(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isLeftMax(a, f, mid, key))\tng = mid;\t// 上半分を対象とする\n \t else \t\t\t\t\t\t\tok = mid;\t// 下半分を対象とする\n \t }\t\n \t return ng;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n \t\n // -----------------------------------------\n \t// オイラーツアー（部分木対応）\n \tstatic class EulerTour {\n \t\tGraph g;\n \t\tList euler_tour = new ArrayList<>();\n \t\tint[] begin, end;\n \t\tint k = 0, root = 0;\n \t\t\n \t\tvoid dfs(int v,int p, PrintWriter out) {\n \t\t\tout.println(\"v = \" + v + \" p = \" + p);\n \t\t\tbegin[v] = k;\n \t\t\teuler_tour.add(v);\n \t\t\tk++;\n \t\t\tif(!g.contains(v)) {\n \t\t\t\treturn;\n \t\t\t}\n \t\t\tfor(int i : g.get(v)) {\n \t\t\t\tif(i != p) {\n \t\t\t\t\tdfs(i, v, out);\n \t\t\t\t\teuler_tour.add(v);\n \t\t\t\t\tk++;\n \t\t\t\t}\n \t\t\t}\n \t\t\tend[v]=k;\n \t\t}\n \t\t// 初期化\n \t\tpublic void init(int p_cnt, int root, Graph g, PrintWriter out) {\n \t\t\tbegin = new int[p_cnt + 1];\n \t\t\tend = new int[p_cnt + 1];\n \t\t\tthis.root = root;\n \t\t\tthis.g = g;\n \t\t\tdfs(root, -1, out);\n \t\t}\n \t\t// 部分木の頂点を渡すと、オイラーツアーの部分木を返す\n \t\tpublic List getPartTour(int v) {\n \t\t\treturn euler_tour.subList(begin[v], end[v]);\n \t\t}\n \t\t// 部分木の頂点を渡すと、頂点のリストを返す\n \t\tpublic List getPartList(int v) {\n \t\t\tSet set = new TreeSet<>();\n\t\t\t\tset.addAll(getPartTour(v));\n\t\t\t\tList ans = new ArrayList<>();\n\t\t\t\tfor(Integer p : set) {\n\t\t\t\t\tans.add(p);\n\t\t\t\t}\n\t\t\t\treturn ans;\n \t\t}\n \t}\n \t\n // -----------------------------------------\n // グラフのリンクリスト\n static class Graph {\n \t// 頂点に紐づく頂点のリスト\n private Map> data = new HashMap>();\n// // 全ての頂点のセット\n// private Set point = new TreeSet<>();\n // 頂点と頂点の繋がりを追加する\n void add(int from, int to) {\n \tList list = data.get(from);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(from, list);\n \t}\n \tlist.add(to);\n// \tpoint.add(key);\n// \tpoint.add(value);\n }\n // 指定された頂点に紐づく、頂点のリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList list = data.get(key_1);\n \tif(list == null)\treturn false;\n \telse \t\t\t\treturn list.contains(key_2);\n }\n // 指定された頂点から、すべての頂点への距離を返す\n List distList(int key) {\n \tList dist = new ArrayList<>();\t\t// 頂点と距離のペアのリスト\n \tSet mark = new HashSet<>();\t// 処理したら入れる\n \t\t\tStack stack = new Stack<>();\t\t// スタックの宣言\n \t\t\tstack.push(new PP(key, 0));\t\t\t\t// スタートをスタックに保存\n \t\t\twhile(!stack.isEmpty()) {\n \t\t\t\tPP wk = stack.pop();\t\t\t\t// スタックから次の頂点を取得\n \t\t\t\tint pp = wk.getKey();\n \t\t\t\tint dd = wk.getVal();\n \t\t\t\tmark.add(pp);\t\t\t\t\t\t// 通過マーク\n \t\t\tdist.add(new PP(pp, dd));\t\t\t// 距離を登録\n \t\t\t\tList list = get(pp);\t\t// つながっている頂点のリストを取得\n \t\t\t\tfor(int next : list) {\n \t\t\t\t\tif(mark.contains(next))\tcontinue;\n \t\t\t\t\tstack.push(new PP(next, dd + 1));\n \t\t\t\t}\n \t\t\t}\n \t\t\treturn dist;\n }\n // ダンプ\n void dump(PrintWriter out) {\n \tfor(int key : data.keySet()) {\n \t\tout.print(key + \" : \");\n \t\tfor(int val : data.get(key)) {\n \t\t\tout.print(val + \" \");\n \t\t}\n \t\tout.println(\"\");\n \t}\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト\n static class GraphWith {\n \t// キーに紐づくリストに、頂点番号と重さのペアを持つ\n private Map> data = new HashMap>();\n // 指定された頂点に紐づく、頂点と重さのペアを追加する\n void add(int key, PP p) {\n \tList list = data.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(key, list);\n \t}\n \tlist.add(p);\n }\n // 頂点に紐づく、頂点と重さのペアのリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // グラフの存在チェック（重さは関係しない）\n // 頂点　key と 頂点　value がつながっていれば　true を返す\n boolean contains(int key, int value) {\n \tList list = data.get(key);\n \tif(list == null)\treturn false;\n \tboolean ans = false;\n \tfor(PP p : list) {\n \t\tif(p.getKey() == value) {\n \t\t\tans = true;\n \t\t\tbreak;\n \t\t}\n \t}\n \treturn ans;\n }\n }\n // -----------------------------------------\n // グラフのリンクリスト(Long)\n static class GraphLong {\n private Map> G = new HashMap>();\n void add(long key, long value) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(value);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト(Long)\n static class GraphLongWith {\n private Map> G = new HashMap>();\n void add(long key, PPL p) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(p);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n\n void prn(String s) {\n \tout.println(s);\n }\n void prn(int i) {\n \tout.println(i);\n }\n void prn(long i) {\n \tout.println(i);\n }\n void prr(String s) {\n \tout.print(s);\n }\n int ni() {\n \treturn in.nextInt();\n }\n long nl() {\n \treturn in.nextLong();\n }\n double nd() {\n \treturn in.nextDouble();\n }\n String ns() {\n \treturn in.nextString();\n }\n int[] ndi(int n) {\n \tint[] ans = new int[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ni();\n \t}\n \treturn ans;\n }\n long[] ndl(int n) {\n \tlong[] ans = new long[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nl();\n \t}\n \treturn ans;\n }\n double[] ndd(int n) {\n \tdouble[] ans = new double[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nd();\n \t}\n \treturn ans;\n }\n String[] nds(int n) {\n \tString[] ans = new String[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ns();\n \t}\n \treturn ans;\n }\n int[][] nddi(int n, int m) {\n \tint[][] ans = new int[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = ni();\n \t}\n \t}\n \treturn ans;\n }\n long[][] nddl(int n, int m) {\n \tlong[][] ans = new long[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = nl();\n \t}\n \t}\n \treturn ans;\n }\n }\n static class PP{\n \tpublic int key, val;\n \tpublic PP(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(int key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(int val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPL {\n \tpublic long key, val;\n \tpublic PPL(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPDL {\n \tpublic long key;\n \tpublic long[] val;\n \tpublic PPDL(long key, long[] val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long[] getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long[] val) {\n\t\t\tthis.val = val;\n\t\t}\n\t\tpublic void dump(PrintWriter out) {\n\t\t\tout.print(\"key = \" + key + \" val \");\n\t\t\tfor(int i=0; i < val.length; i++) {\n\t\t\t\tout.print(\"[\" + val[i] + \"] \");\n\t\t\t}\n\t\t\tout.println(\"\");\n\t\t}\n }\n // HashMap のキーに使う\n static final class PPKEY{\n \tprivate final int key, val;\n \tpublic PPKEY(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // HashMap のキーに使う\n static final class PPLKEY{\n \tprivate final long key, val;\n \tpublic PPLKEY(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // ======================================================================\n static class Pair extends AbstractMap.SimpleEntry {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n }\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public double nextDouble() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n double ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n int cnt = 0;\n for (; i < len; i++) {\n \tif(str[i] == '.') {\n \t\tcnt = 10;\n \t\tcontinue;\n \t}\n \tif(cnt == 0) {\n \t\tret = ret * 10 + str[i] - '0';\n \t} else {\n \t\tret = ret + ((double)(str[i] - '0') / cnt);\n \t\tcnt *= 10;\n \t}\n }\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n\n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThree poles stand evenly spaced along a line. Their heights are a, b and c meters, from left to right.\nWe will call the arrangement of the poles beautiful if the tops of the poles lie on the same line, that is, b-a = c-b.\n\nDetermine whether the arrangement of the poles is beautiful.\n\nConstraints\n\n1 \\leq a,b,c \\leq 100\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint YES if the arrangement of the poles is beautiful; print NO otherwise.\n\nSample Input 1\n\n2 4 6\n\nSample Output 1\n\nYES\n\nSince 4-2 = 6-4, this arrangement of poles is beautiful.\n\nSample Input 2\n\n2 5 6\n\nSample Output 2\n\nNO\n\nSince 5-2 \\neq 6-5, this arrangement of poles is not beautiful.\n\nSample Input 3\n\n3 2 1\n\nSample Output 3\n\nYES\n\nSince 1-2 = 2-3, this arrangement of poles is beautiful.", "sample_input": "2 4 6\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03759", "source_text": "Score : 100 points\n\nProblem Statement\n\nThree poles stand evenly spaced along a line. Their heights are a, b and c meters, from left to right.\nWe will call the arrangement of the poles beautiful if the tops of the poles lie on the same line, that is, b-a = c-b.\n\nDetermine whether the arrangement of the poles is beautiful.\n\nConstraints\n\n1 \\leq a,b,c \\leq 100\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint YES if the arrangement of the poles is beautiful; print NO otherwise.\n\nSample Input 1\n\n2 4 6\n\nSample Output 1\n\nYES\n\nSince 4-2 = 6-4, this arrangement of poles is beautiful.\n\nSample Input 2\n\n2 5 6\n\nSample Output 2\n\nNO\n\nSince 5-2 \\neq 6-5, this arrangement of poles is not beautiful.\n\nSample Input 3\n\n3 2 1\n\nSample Output 3\n\nYES\n\nSince 1-2 = 2-3, this arrangement of poles is beautiful.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 21273, "cpu_time_ms": 72, "memory_kb": 23380}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s626112132", "group_id": "codeNet:p03760", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main (String[] args){\n\tScanner scan = new Scanner(System.in);\n\n\tString kisupas = scan.nextLine();\n\tString gusupas = scan.nextLine();\n\t\n\tString[] kisu = kisupas.split(\"\", 0);\n\tString[] gusu = gusupas.split(\"\", 0);\n\n\tfor(int i=0; i= N; i--) {\n sum += as[i];\n }\n\n System.out.println(sum);\n }\n\n public static void main(String[] args) throws Exception {\n long S = System.currentTimeMillis();\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n solve();\n out.flush();\n long G = System.currentTimeMillis();\n tr(G-S+\"ms\");\n }\n\n private static boolean eof() {\n if(lenbuf == -1)return true;\n int lptr = ptrbuf;\n while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\n try {\n is.mark(1000);\n while(true){\n int b = is.read();\n if(b == -1){\n is.reset();\n return true;\n }else if(!isSpaceChar(b)){\n is.reset();\n return false;\n }\n }\n } catch (IOException e) {\n return true;\n }\n }\n\n private static byte[] inbuf = new byte[1024];\n static int lenbuf = 0, ptrbuf = 0;\n\n private static int readByte() {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\n private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private static double nd() { return Double.parseDouble(ns()); }\n private static char nc() { return (char)skip(); }\n\n private static String ns() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private static char[] ns(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private static char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private static int ni() {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private static long nl() {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "language": "Java", "metadata": {"date": 1600020455, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03767.html", "problem_id": "p03767", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03767/input.txt", "sample_output_relpath": "derived/input_output/data/p03767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03767/Java/s472580883.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s472580883", "user_id": "u381460455"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\n\npublic class Main {\n static InputStream is;\n static PrintWriter out;\n static String INPUT = \"\";\n\n static void solve() {\n int N = ni();\n int[] as = new int[N * 3];\n\n for (int i = 0; i < N * 3; i++) {\n as[i] = ni();\n }\n\n Arrays.sort(as);\n\n long sum = 0;\n for (int i = N * 3 - 1 - N; i >= N; i--) {\n sum += as[i];\n }\n\n System.out.println(sum);\n }\n\n public static void main(String[] args) throws Exception {\n long S = System.currentTimeMillis();\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n\n solve();\n out.flush();\n long G = System.currentTimeMillis();\n tr(G-S+\"ms\");\n }\n\n private static boolean eof() {\n if(lenbuf == -1)return true;\n int lptr = ptrbuf;\n while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\n try {\n is.mark(1000);\n while(true){\n int b = is.read();\n if(b == -1){\n is.reset();\n return true;\n }else if(!isSpaceChar(b)){\n is.reset();\n return false;\n }\n }\n } catch (IOException e) {\n return true;\n }\n }\n\n private static byte[] inbuf = new byte[1024];\n static int lenbuf = 0, ptrbuf = 0;\n\n private static int readByte() {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n\n private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n\n private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\n private static double nd() { return Double.parseDouble(ns()); }\n private static char nc() { return (char)skip(); }\n\n private static String ns() {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b))){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private static char[] ns(int n) {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n\n private static char[][] nm(int n, int m) {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n\n private static int ni() {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private static long nl() {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n\n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n\n private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "sample_input": "2\n5 2 8 5 1 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4163, "cpu_time_ms": 220, "memory_kb": 43184}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s788035558", "group_id": "codeNet:p03767", "input_text": "import java.util.*;\n\npublic class Main {\n\t\n\tprivate void doit(){\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile(sc.hasNext()){\n\t\t\tint n = sc.nextInt();\n\t\t\tint [] data = new int[n * 3];\n\t\t\tfor(int i = 0; i < n * 3; i++){\n\t\t\t\tdata[i] = sc.nextInt();\n\t\t\t}\n\t\t\tArrays.sort(data);\n\t\t\tlong sum = 0;\n\t\t\tfor(int i = n; i < n * 3;i+=2){\n\t\t\t\tsum += data[i];\n\t\t\t}\n\t\t\tSystem.out.println(sum);\n\t\t}\n\t}\n\n\tprivate void debug(Object... o) {\n\t\tSystem.out.println(\"debug = \" + Arrays.deepToString(o));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().doit();\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1491181175, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03767.html", "problem_id": "p03767", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03767/input.txt", "sample_output_relpath": "derived/input_output/data/p03767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03767/Java/s788035558.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s788035558", "user_id": "u148142472"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\t\n\tprivate void doit(){\n\t\tScanner sc = new Scanner(System.in);\n\t\twhile(sc.hasNext()){\n\t\t\tint n = sc.nextInt();\n\t\t\tint [] data = new int[n * 3];\n\t\t\tfor(int i = 0; i < n * 3; i++){\n\t\t\t\tdata[i] = sc.nextInt();\n\t\t\t}\n\t\t\tArrays.sort(data);\n\t\t\tlong sum = 0;\n\t\t\tfor(int i = n; i < n * 3;i+=2){\n\t\t\t\tsum += data[i];\n\t\t\t}\n\t\t\tSystem.out.println(sum);\n\t\t}\n\t}\n\n\tprivate void debug(Object... o) {\n\t\tSystem.out.println(\"debug = \" + Arrays.deepToString(o));\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().doit();\n\t}\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "sample_input": "2\n5 2 8 5 1 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 555, "cpu_time_ms": 718, "memory_kb": 92704}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s177944013", "group_id": "codeNet:p03773", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.StringTokenizer;\n\nclass Main {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(br.readLine(), \" \");\n int A = Integer.parseInt(st.nextToken());\n int B = Integer.parseInt(st.nextToken());\n int ans = (A + B) % 24;\n System.out.println(ans);\n }\n}\n", "language": "Java", "metadata": {"date": 1510659058, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03773.html", "problem_id": "p03773", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03773/input.txt", "sample_output_relpath": "derived/input_output/data/p03773/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03773/Java/s177944013.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s177944013", "user_id": "u825528847"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.IOException;\nimport java.util.StringTokenizer;\n\nclass Main {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n StringTokenizer st = new StringTokenizer(br.readLine(), \" \");\n int A = Integer.parseInt(st.nextToken());\n int B = Integer.parseInt(st.nextToken());\n int ans = (A + B) % 24;\n System.out.println(ans);\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "sample_input": "9 12\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03773", "source_text": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 502, "cpu_time_ms": 68, "memory_kb": 21076}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s652173128", "group_id": "codeNet:p03773", "input_text": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if(a+b>=24){\n System.out.println(a+b-24);\n }else{\n System.out.println(a+b);\n }\n }\n}", "language": "Java", "metadata": {"date": 1490824812, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03773.html", "problem_id": "p03773", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03773/input.txt", "sample_output_relpath": "derived/input_output/data/p03773/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03773/Java/s652173128.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s652173128", "user_id": "u965553094"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n if(a+b>=24){\n System.out.println(a+b-24);\n }else{\n System.out.println(a+b);\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "sample_input": "9 12\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03773", "source_text": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 365, "cpu_time_ms": 104, "memory_kb": 23764}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s256549861", "group_id": "codeNet:p03774", "input_text": "import java.util.*;\n\npublic class Main{\n\t\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n \tint n=sc.nextInt(),m=sc.nextInt(),e=0;\n long[] a=new long[n],b=new long[n],c=new long[m],d=new long[m];\n long min=1000000000;\n for(int i=0;if){\n e=j+1;\n min=f;\n }\n }\n System.out.println(e);\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1590433860, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03774.html", "problem_id": "p03774", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03774/input.txt", "sample_output_relpath": "derived/input_output/data/p03774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03774/Java/s256549861.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s256549861", "user_id": "u587100042"}, "prompt_components": {"gold_output": "2\n1\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n\t\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n \tint n=sc.nextInt(),m=sc.nextInt(),e=0;\n long[] a=new long[n],b=new long[n],c=new long[m],d=new long[m];\n long min=1000000000;\n for(int i=0;if){\n e=j+1;\n min=f;\n }\n }\n System.out.println(e);\n }\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N students and M checkpoints on the xy-plane.\n\nThe coordinates of the i-th student (1 \\leq i \\leq N) is (a_i,b_i), and the coordinates of the checkpoint numbered j (1 \\leq j \\leq M) is (c_j,d_j).\n\nWhen the teacher gives a signal, each student has to go to the nearest checkpoint measured in Manhattan distance.\n\nThe Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is |x_1-x_2|+|y_1-y_2|.\n\nHere, |x| denotes the absolute value of x.\n\nIf there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.\n\nWhich checkpoint will each student go to?\n\nConstraints\n\n1 \\leq N,M \\leq 50\n\n-10^8 \\leq a_i,b_i,c_j,d_j \\leq 10^8\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_N b_N\nc_1 d_1\n:\nc_M d_M\n\nOutput\n\nPrint N lines.\n\nThe i-th line (1 \\leq i \\leq N) should contain the index of the checkpoint for the i-th student to go.\n\nSample Input 1\n\n2 2\n2 0\n0 0\n-1 0\n1 0\n\nSample Output 1\n\n2\n1\n\nThe Manhattan distance between the first student and each checkpoint is:\n\nFor checkpoint 1: |2-(-1)|+|0-0|=3\n\nFor checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\nFor checkpoint 1: |0-(-1)|+|0-0|=1\n\nFor checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.\n\nSample Input 2\n\n3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5\n\nSample Output 2\n\n3\n1\n2\n\nThere can be multiple checkpoints at the same coordinates.\n\nSample Input 3\n\n5 5\n-100000000 -100000000\n-100000000 100000000\n100000000 -100000000\n100000000 100000000\n0 0\n0 0\n100000000 100000000\n100000000 -100000000\n-100000000 100000000\n-100000000 -100000000\n\nSample Output 3\n\n5\n4\n3\n2\n1", "sample_input": "2 2\n2 0\n0 0\n-1 0\n1 0\n"}, "reference_outputs": ["2\n1\n"], "source_document_id": "p03774", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N students and M checkpoints on the xy-plane.\n\nThe coordinates of the i-th student (1 \\leq i \\leq N) is (a_i,b_i), and the coordinates of the checkpoint numbered j (1 \\leq j \\leq M) is (c_j,d_j).\n\nWhen the teacher gives a signal, each student has to go to the nearest checkpoint measured in Manhattan distance.\n\nThe Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is |x_1-x_2|+|y_1-y_2|.\n\nHere, |x| denotes the absolute value of x.\n\nIf there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.\n\nWhich checkpoint will each student go to?\n\nConstraints\n\n1 \\leq N,M \\leq 50\n\n-10^8 \\leq a_i,b_i,c_j,d_j \\leq 10^8\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_N b_N\nc_1 d_1\n:\nc_M d_M\n\nOutput\n\nPrint N lines.\n\nThe i-th line (1 \\leq i \\leq N) should contain the index of the checkpoint for the i-th student to go.\n\nSample Input 1\n\n2 2\n2 0\n0 0\n-1 0\n1 0\n\nSample Output 1\n\n2\n1\n\nThe Manhattan distance between the first student and each checkpoint is:\n\nFor checkpoint 1: |2-(-1)|+|0-0|=3\n\nFor checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\nFor checkpoint 1: |0-(-1)|+|0-0|=1\n\nFor checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.\n\nSample Input 2\n\n3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5\n\nSample Output 2\n\n3\n1\n2\n\nThere can be multiple checkpoints at the same coordinates.\n\nSample Input 3\n\n5 5\n-100000000 -100000000\n-100000000 100000000\n100000000 -100000000\n100000000 100000000\n0 0\n0 0\n100000000 100000000\n100000000 -100000000\n-100000000 100000000\n-100000000 -100000000\n\nSample Output 3\n\n5\n4\n3\n2\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 650, "cpu_time_ms": 110, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s083039341", "group_id": "codeNet:p03774", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n int m = scan.nextInt();\n int[][] ab = new int[n][2];\n for(int i = 0; i < n; i++){\n for(int j = 0; j < 2; j++){\n ab[i][j] = scan.nextInt();\n }\n }\n int[][] cd = new int[m][2];\n for(int i = 0; i < m; i++){\n for(int j = 0; j < 2; j++){\n cd[i][j] = scan.nextInt();\n }\n }\n int min = Integer.MAX_VALUE;\n int out = 0;\n for(int i = 0; i < n; i++){\n for(int j = 0; j < m; j++){\n if(Math.abs(ab[i][0] - cd[j][0]) + Math.abs(ab[i][1] - cd[j][1]) < min){\n min = Math.abs(ab[i][0] - cd[j][0]) + Math.abs(ab[i][1] - cd[j][1]);\n out = j + 1;\n }\n }\n System.out.println(out);\n min = Integer.MAX_VALUE;\n out = 0;\n }\n }\n}", "language": "Java", "metadata": {"date": 1586021816, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03774.html", "problem_id": "p03774", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03774/input.txt", "sample_output_relpath": "derived/input_output/data/p03774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03774/Java/s083039341.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s083039341", "user_id": "u459100168"}, "prompt_components": {"gold_output": "2\n1\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args){\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n int m = scan.nextInt();\n int[][] ab = new int[n][2];\n for(int i = 0; i < n; i++){\n for(int j = 0; j < 2; j++){\n ab[i][j] = scan.nextInt();\n }\n }\n int[][] cd = new int[m][2];\n for(int i = 0; i < m; i++){\n for(int j = 0; j < 2; j++){\n cd[i][j] = scan.nextInt();\n }\n }\n int min = Integer.MAX_VALUE;\n int out = 0;\n for(int i = 0; i < n; i++){\n for(int j = 0; j < m; j++){\n if(Math.abs(ab[i][0] - cd[j][0]) + Math.abs(ab[i][1] - cd[j][1]) < min){\n min = Math.abs(ab[i][0] - cd[j][0]) + Math.abs(ab[i][1] - cd[j][1]);\n out = j + 1;\n }\n }\n System.out.println(out);\n min = Integer.MAX_VALUE;\n out = 0;\n }\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N students and M checkpoints on the xy-plane.\n\nThe coordinates of the i-th student (1 \\leq i \\leq N) is (a_i,b_i), and the coordinates of the checkpoint numbered j (1 \\leq j \\leq M) is (c_j,d_j).\n\nWhen the teacher gives a signal, each student has to go to the nearest checkpoint measured in Manhattan distance.\n\nThe Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is |x_1-x_2|+|y_1-y_2|.\n\nHere, |x| denotes the absolute value of x.\n\nIf there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.\n\nWhich checkpoint will each student go to?\n\nConstraints\n\n1 \\leq N,M \\leq 50\n\n-10^8 \\leq a_i,b_i,c_j,d_j \\leq 10^8\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_N b_N\nc_1 d_1\n:\nc_M d_M\n\nOutput\n\nPrint N lines.\n\nThe i-th line (1 \\leq i \\leq N) should contain the index of the checkpoint for the i-th student to go.\n\nSample Input 1\n\n2 2\n2 0\n0 0\n-1 0\n1 0\n\nSample Output 1\n\n2\n1\n\nThe Manhattan distance between the first student and each checkpoint is:\n\nFor checkpoint 1: |2-(-1)|+|0-0|=3\n\nFor checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\nFor checkpoint 1: |0-(-1)|+|0-0|=1\n\nFor checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.\n\nSample Input 2\n\n3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5\n\nSample Output 2\n\n3\n1\n2\n\nThere can be multiple checkpoints at the same coordinates.\n\nSample Input 3\n\n5 5\n-100000000 -100000000\n-100000000 100000000\n100000000 -100000000\n100000000 100000000\n0 0\n0 0\n100000000 100000000\n100000000 -100000000\n-100000000 100000000\n-100000000 -100000000\n\nSample Output 3\n\n5\n4\n3\n2\n1", "sample_input": "2 2\n2 0\n0 0\n-1 0\n1 0\n"}, "reference_outputs": ["2\n1\n"], "source_document_id": "p03774", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N students and M checkpoints on the xy-plane.\n\nThe coordinates of the i-th student (1 \\leq i \\leq N) is (a_i,b_i), and the coordinates of the checkpoint numbered j (1 \\leq j \\leq M) is (c_j,d_j).\n\nWhen the teacher gives a signal, each student has to go to the nearest checkpoint measured in Manhattan distance.\n\nThe Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is |x_1-x_2|+|y_1-y_2|.\n\nHere, |x| denotes the absolute value of x.\n\nIf there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.\n\nWhich checkpoint will each student go to?\n\nConstraints\n\n1 \\leq N,M \\leq 50\n\n-10^8 \\leq a_i,b_i,c_j,d_j \\leq 10^8\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_N b_N\nc_1 d_1\n:\nc_M d_M\n\nOutput\n\nPrint N lines.\n\nThe i-th line (1 \\leq i \\leq N) should contain the index of the checkpoint for the i-th student to go.\n\nSample Input 1\n\n2 2\n2 0\n0 0\n-1 0\n1 0\n\nSample Output 1\n\n2\n1\n\nThe Manhattan distance between the first student and each checkpoint is:\n\nFor checkpoint 1: |2-(-1)|+|0-0|=3\n\nFor checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\nFor checkpoint 1: |0-(-1)|+|0-0|=1\n\nFor checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.\n\nSample Input 2\n\n3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5\n\nSample Output 2\n\n3\n1\n2\n\nThere can be multiple checkpoints at the same coordinates.\n\nSample Input 3\n\n5 5\n-100000000 -100000000\n-100000000 100000000\n100000000 -100000000\n100000000 100000000\n0 0\n0 0\n100000000 100000000\n100000000 -100000000\n-100000000 100000000\n-100000000 -100000000\n\nSample Output 3\n\n5\n4\n3\n2\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1043, "cpu_time_ms": 107, "memory_kb": 23892}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s248003202", "group_id": "codeNet:p03774", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main\n{\n\n\tstatic final int X = 0;\n\tstatic final int Y = 1;\n\t\n\tpublic static void main(String[] args) throws IOException \n\t{\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString str = br.readLine();\n\t\tint N = Integer.parseInt(str.substring(0, str.indexOf(\" \")));\n\t\tint M = Integer.parseInt(str.substring(str.indexOf(\" \") + 1));\n\t\tint Students[][] = new int[N][2];\n\t\tint CheckPoints[][] = new int[M][2];\n\t\tint Lan[][] = new int[N][2];\n\t\tfor(int i = 0; i < N; i++)\n\t\t{\n\t\t\tstr = br.readLine();\n\t\t\tStudents[i][X] = Integer.parseInt(str.substring(0, str.indexOf(\" \")));\n\t\t\tStudents[i][Y] = Integer.parseInt(str.substring(str.indexOf(\" \") + 1));\n\t\t\tLan[i][0] = 1000000000;\n\t\t\tLan[i][1] = 0;\n\t\t}\n\t\tfor(int i = 0; i < M; i++)\n\t\t{\n\t\t\tstr = br.readLine();\n\t\t\tCheckPoints[i][X] = Integer.parseInt(str.substring(0, str.indexOf(\" \")));\n\t\t\tCheckPoints[i][Y] = Integer.parseInt(str.substring(str.indexOf(\" \") + 1));\n\t\t}\n\t\tfor(int i = 0; i < N; i++)\n\t\t{\n\t\t\tfor(int j = 0; j < M; j++)\n\t\t\t{\n\t\t\t\tif(Lan[i][0] > Math.abs(Students[i][X] - CheckPoints[j][X]) + Math.abs(Students[i][Y] - CheckPoints[j][Y]))\n\t\t\t\t{\n\t\t\t\t\tLan[i][0] = Math.abs(Students[i][X] - CheckPoints[j][X]) + Math.abs(Students[i][Y] - CheckPoints[j][Y]);\n\t\t\t\t\tLan[i][1] = j + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < N; i++)\n\t\t{\n\t\t\tSystem.out.println(Lan[i][1]);\n\t\t}\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1490627525, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03774.html", "problem_id": "p03774", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03774/input.txt", "sample_output_relpath": "derived/input_output/data/p03774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03774/Java/s248003202.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s248003202", "user_id": "u485409442"}, "prompt_components": {"gold_output": "2\n1\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\n\npublic class Main\n{\n\n\tstatic final int X = 0;\n\tstatic final int Y = 1;\n\t\n\tpublic static void main(String[] args) throws IOException \n\t{\n\t\t// TODO 自動生成されたメソッド・スタブ\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString str = br.readLine();\n\t\tint N = Integer.parseInt(str.substring(0, str.indexOf(\" \")));\n\t\tint M = Integer.parseInt(str.substring(str.indexOf(\" \") + 1));\n\t\tint Students[][] = new int[N][2];\n\t\tint CheckPoints[][] = new int[M][2];\n\t\tint Lan[][] = new int[N][2];\n\t\tfor(int i = 0; i < N; i++)\n\t\t{\n\t\t\tstr = br.readLine();\n\t\t\tStudents[i][X] = Integer.parseInt(str.substring(0, str.indexOf(\" \")));\n\t\t\tStudents[i][Y] = Integer.parseInt(str.substring(str.indexOf(\" \") + 1));\n\t\t\tLan[i][0] = 1000000000;\n\t\t\tLan[i][1] = 0;\n\t\t}\n\t\tfor(int i = 0; i < M; i++)\n\t\t{\n\t\t\tstr = br.readLine();\n\t\t\tCheckPoints[i][X] = Integer.parseInt(str.substring(0, str.indexOf(\" \")));\n\t\t\tCheckPoints[i][Y] = Integer.parseInt(str.substring(str.indexOf(\" \") + 1));\n\t\t}\n\t\tfor(int i = 0; i < N; i++)\n\t\t{\n\t\t\tfor(int j = 0; j < M; j++)\n\t\t\t{\n\t\t\t\tif(Lan[i][0] > Math.abs(Students[i][X] - CheckPoints[j][X]) + Math.abs(Students[i][Y] - CheckPoints[j][Y]))\n\t\t\t\t{\n\t\t\t\t\tLan[i][0] = Math.abs(Students[i][X] - CheckPoints[j][X]) + Math.abs(Students[i][Y] - CheckPoints[j][Y]);\n\t\t\t\t\tLan[i][1] = j + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < N; i++)\n\t\t{\n\t\t\tSystem.out.println(Lan[i][1]);\n\t\t}\n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N students and M checkpoints on the xy-plane.\n\nThe coordinates of the i-th student (1 \\leq i \\leq N) is (a_i,b_i), and the coordinates of the checkpoint numbered j (1 \\leq j \\leq M) is (c_j,d_j).\n\nWhen the teacher gives a signal, each student has to go to the nearest checkpoint measured in Manhattan distance.\n\nThe Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is |x_1-x_2|+|y_1-y_2|.\n\nHere, |x| denotes the absolute value of x.\n\nIf there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.\n\nWhich checkpoint will each student go to?\n\nConstraints\n\n1 \\leq N,M \\leq 50\n\n-10^8 \\leq a_i,b_i,c_j,d_j \\leq 10^8\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_N b_N\nc_1 d_1\n:\nc_M d_M\n\nOutput\n\nPrint N lines.\n\nThe i-th line (1 \\leq i \\leq N) should contain the index of the checkpoint for the i-th student to go.\n\nSample Input 1\n\n2 2\n2 0\n0 0\n-1 0\n1 0\n\nSample Output 1\n\n2\n1\n\nThe Manhattan distance between the first student and each checkpoint is:\n\nFor checkpoint 1: |2-(-1)|+|0-0|=3\n\nFor checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\nFor checkpoint 1: |0-(-1)|+|0-0|=1\n\nFor checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.\n\nSample Input 2\n\n3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5\n\nSample Output 2\n\n3\n1\n2\n\nThere can be multiple checkpoints at the same coordinates.\n\nSample Input 3\n\n5 5\n-100000000 -100000000\n-100000000 100000000\n100000000 -100000000\n100000000 100000000\n0 0\n0 0\n100000000 100000000\n100000000 -100000000\n-100000000 100000000\n-100000000 -100000000\n\nSample Output 3\n\n5\n4\n3\n2\n1", "sample_input": "2 2\n2 0\n0 0\n-1 0\n1 0\n"}, "reference_outputs": ["2\n1\n"], "source_document_id": "p03774", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N students and M checkpoints on the xy-plane.\n\nThe coordinates of the i-th student (1 \\leq i \\leq N) is (a_i,b_i), and the coordinates of the checkpoint numbered j (1 \\leq j \\leq M) is (c_j,d_j).\n\nWhen the teacher gives a signal, each student has to go to the nearest checkpoint measured in Manhattan distance.\n\nThe Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is |x_1-x_2|+|y_1-y_2|.\n\nHere, |x| denotes the absolute value of x.\n\nIf there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.\n\nWhich checkpoint will each student go to?\n\nConstraints\n\n1 \\leq N,M \\leq 50\n\n-10^8 \\leq a_i,b_i,c_j,d_j \\leq 10^8\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_N b_N\nc_1 d_1\n:\nc_M d_M\n\nOutput\n\nPrint N lines.\n\nThe i-th line (1 \\leq i \\leq N) should contain the index of the checkpoint for the i-th student to go.\n\nSample Input 1\n\n2 2\n2 0\n0 0\n-1 0\n1 0\n\nSample Output 1\n\n2\n1\n\nThe Manhattan distance between the first student and each checkpoint is:\n\nFor checkpoint 1: |2-(-1)|+|0-0|=3\n\nFor checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\nFor checkpoint 1: |0-(-1)|+|0-0|=1\n\nFor checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.\n\nSample Input 2\n\n3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5\n\nSample Output 2\n\n3\n1\n2\n\nThere can be multiple checkpoints at the same coordinates.\n\nSample Input 3\n\n5 5\n-100000000 -100000000\n-100000000 100000000\n100000000 -100000000\n100000000 100000000\n0 0\n0 0\n100000000 100000000\n100000000 -100000000\n-100000000 100000000\n-100000000 -100000000\n\nSample Output 3\n\n5\n4\n3\n2\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1510, "cpu_time_ms": 71, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s790653080", "group_id": "codeNet:p03775", "input_text": "import java.io.BufferedReader;\nimport java.io.Closeable;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tfinal Scanner sc = new Scanner(System.in);\n\t\t\n\t\tfinal long N = sc.nextLong();\n\t\t\n\t\tint min = Integer.MAX_VALUE;\n\t\tfor(long j = 1; j * j <= N; j++){\n\t\t\tif(N % j != 0){ continue; }\n\t\t\t\n\t\t\tmin = Math.min(min, Math.max(Long.toString(j).length(), Long.toString(N / j).length()));\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t}\n\t\n\tpublic static class Scanner implements Closeable {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tok;\n \n\t\tpublic Scanner(InputStream is) throws IOException {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t}\n \n\t\tprivate void getLine() throws IOException {\n\t\t\twhile (!hasNext()) {\n\t\t\t\ttok = new StringTokenizer(br.readLine());\n\t\t\t}\n\t\t}\n \n\t\tprivate boolean hasNext() {\n\t\t\treturn tok != null && tok.hasMoreTokens();\n\t\t}\n \n\t\tpublic String next() throws IOException {\n\t\t\tgetLine();\n\t\t\treturn tok.nextToken();\n\t\t}\n \n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(int n) throws IOException {\n\t\t\tfinal int[] ret = new int[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextInt();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(int n) throws IOException {\n\t\t\tfinal long[] ret = new long[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextLong();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n \n\t\tpublic void close() throws IOException {\n\t\t\tbr.close();\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1490576855, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03775.html", "problem_id": "p03775", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03775/input.txt", "sample_output_relpath": "derived/input_output/data/p03775/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03775/Java/s790653080.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s790653080", "user_id": "u790372061"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.Closeable;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.LinkedList;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\nimport java.util.TreeMap;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tfinal Scanner sc = new Scanner(System.in);\n\t\t\n\t\tfinal long N = sc.nextLong();\n\t\t\n\t\tint min = Integer.MAX_VALUE;\n\t\tfor(long j = 1; j * j <= N; j++){\n\t\t\tif(N % j != 0){ continue; }\n\t\t\t\n\t\t\tmin = Math.min(min, Math.max(Long.toString(j).length(), Long.toString(N / j).length()));\n\t\t}\n\t\t\n\t\tSystem.out.println(min);\n\t}\n\t\n\tpublic static class Scanner implements Closeable {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tok;\n \n\t\tpublic Scanner(InputStream is) throws IOException {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t}\n \n\t\tprivate void getLine() throws IOException {\n\t\t\twhile (!hasNext()) {\n\t\t\t\ttok = new StringTokenizer(br.readLine());\n\t\t\t}\n\t\t}\n \n\t\tprivate boolean hasNext() {\n\t\t\treturn tok != null && tok.hasMoreTokens();\n\t\t}\n \n\t\tpublic String next() throws IOException {\n\t\t\tgetLine();\n\t\t\treturn tok.nextToken();\n\t\t}\n \n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(int n) throws IOException {\n\t\t\tfinal int[] ret = new int[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextInt();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(int n) throws IOException {\n\t\t\tfinal long[] ret = new long[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextLong();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n \n\t\tpublic void close() throws IOException {\n\t\t\tbr.close();\n\t\t}\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "sample_input": "10000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03775", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1931, "cpu_time_ms": 84, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s111987201", "group_id": "codeNet:p03777", "input_text": "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n String[] inputs = sc.nextLine().split(\" \");\n String a = inputs[0];\n String b = inputs[1];\n\n boolean doesTellTruth = false;\n if (a.equals(\"H\")) {\n doesTellTruth = true;\n } else {\n doesTellTruth = false;\n }\n\n boolean isHonest = false;\n if (b.equals(\"H\")) {\n isHonest = true;\n } else {\n isHonest = false;\n }\n\n if (doesTellTruth) {\n\n if (isHonest) {\n System.out.println(\"H\");\n } else {\n System.out.println(\"D\");\n }\n\n } else {\n if (isHonest) {\n System.out.println(\"D\");\n } else {\n System.out.println(\"H\");\n }\n }\n }\n}", "language": "Java", "metadata": {"date": 1490060030, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03777.html", "problem_id": "p03777", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03777/input.txt", "sample_output_relpath": "derived/input_output/data/p03777/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03777/Java/s111987201.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s111987201", "user_id": "u908266297"}, "prompt_components": {"gold_output": "H\n", "input_to_evaluate": "import java.util.*;\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n\n String[] inputs = sc.nextLine().split(\" \");\n String a = inputs[0];\n String b = inputs[1];\n\n boolean doesTellTruth = false;\n if (a.equals(\"H\")) {\n doesTellTruth = true;\n } else {\n doesTellTruth = false;\n }\n\n boolean isHonest = false;\n if (b.equals(\"H\")) {\n isHonest = true;\n } else {\n isHonest = false;\n }\n\n if (doesTellTruth) {\n\n if (isHonest) {\n System.out.println(\"H\");\n } else {\n System.out.println(\"D\");\n }\n\n } else {\n if (isHonest) {\n System.out.println(\"D\");\n } else {\n System.out.println(\"H\");\n }\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "sample_input": "H H\n"}, "reference_outputs": ["H\n"], "source_document_id": "p03777", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 914, "cpu_time_ms": 95, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s146625616", "group_id": "codeNet:p03778", "input_text": "import java.util.*;\npublic class Main{\n\tpublic static void main(String args[]){\n\t\tScanner scan = new Scanner(System.in);\n\t\tint w = scan.nextInt();\n\t\tint a = scan.nextInt();\n\t\tint b = scan.nextInt();\n\t\tif((a-w)<=b&&b<=(a+w)){\n\t\t\tSystem.out.println(\"0\");\n\t\t}\n\t\telse if(a<(b-w)){\n\t\t\tSystem.out.println(b-(a+w));\n\t\t}\n\t\telse if((b+w)= a[j]) {\n dp[j][k] = dp[j - 1][k] || dp[j - 1][k - a[j]];\n } else {\n dp[j][k] = dp[j - 1][k];\n }\n }\n }\n }\n boolean flg = false;\n for(int j = Math.max(0, K - a[i]); j < K; j++) {\n flg = flg || dp[N - 1][j];\n }\n if(flg) ans++;\n }\n System.out.println(N - ans);\n }\n}", "language": "Java", "metadata": {"date": 1489938811, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03780.html", "problem_id": "p03780", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03780/input.txt", "sample_output_relpath": "derived/input_output/data/p03780/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03780/Java/s635351567.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s635351567", "user_id": "u653981267"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int N = sc.nextInt();\n int K = sc.nextInt();\n int[] a = new int[N];\n for(int i = 0; i < N; i++) {\n a[i] = sc.nextInt();\n }\n int ans = 0;\n for(int i = 0; i < N; i++) {\n // dp[j][k]はajまででaiを使わずに和をkに出来るかどうかを表す。\n boolean[][] dp = new boolean[N][K + 1];\n dp[0][0] = true;\n if(i != 0) dp[0][a[0]] = true;\n for(int j = 1; j < N; j++) {\n for(int k = 0; k < K + 1; k++) {\n if(i == j) {\n dp[j][k] = dp[j - 1][k];\n } else {\n if(k >= a[j]) {\n dp[j][k] = dp[j - 1][k] || dp[j - 1][k - a[j]];\n } else {\n dp[j][k] = dp[j - 1][k];\n }\n }\n }\n }\n boolean flg = false;\n for(int j = Math.max(0, K - a[i]); j < K; j++) {\n flg = flg || dp[N - 1][j];\n }\n if(flg) ans++;\n }\n System.out.println(N - ans);\n }\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "sample_input": "3 6\n1 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03780", "source_text": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1056, "cpu_time_ms": 2110, "memory_kb": 273984}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s522702364", "group_id": "codeNet:p03782", "input_text": "import java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\n\tpublic static void main(String[] args) {\n\t\tint n = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint[] data = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tdata[i] = sc.nextInt();\n\t\tint result = solve(k, data);\n\t\tSystem.out.println(result);\n\t}\n\n\tprivate static int solve(int k, int[] data) {\n\t\t// TODO Auto-generated method stub\n\t\tArrays.sort(data);\n\t\tlong sum = 0;\n\t\tint count = 0;\n\t\tfor (int i = 0; i < data.length; i++) {\n\t\t\tsum+=data[i];\n\t\t\tif(sum>=k) break;\n\t\t}\n\t\tif(sum=k){\n\t\t\t\t\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tint end=count;\n\t\tfor(int i=0;i=k)\n\t\t\t\t\tcount--;\n\t\t\t}\n\t\t}\n\t\treturn count;\n\n\t}\n}\n", "language": "Java", "metadata": {"date": 1516754699, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03782.html", "problem_id": "p03782", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03782/input.txt", "sample_output_relpath": "derived/input_output/data/p03782/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03782/Java/s522702364.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s522702364", "user_id": "u712165693"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Scanner;\nimport java.util.Set;\n\npublic class Main {\n\tstatic Scanner sc = new Scanner(System.in);\n\n\tpublic static void main(String[] args) {\n\t\tint n = sc.nextInt();\n\t\tint k = sc.nextInt();\n\t\tint[] data = new int[n];\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tdata[i] = sc.nextInt();\n\t\tint result = solve(k, data);\n\t\tSystem.out.println(result);\n\t}\n\n\tprivate static int solve(int k, int[] data) {\n\t\t// TODO Auto-generated method stub\n\t\tArrays.sort(data);\n\t\tlong sum = 0;\n\t\tint count = 0;\n\t\tfor (int i = 0; i < data.length; i++) {\n\t\t\tsum+=data[i];\n\t\t\tif(sum>=k) break;\n\t\t}\n\t\tif(sum=k){\n\t\t\t\t\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\tint end=count;\n\t\tfor(int i=0;i=k)\n\t\t\t\t\tcount--;\n\t\t\t}\n\t\t}\n\t\treturn count;\n\n\t}\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "sample_input": "3 6\n1 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03782", "source_text": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 883, "cpu_time_ms": 249, "memory_kb": 28992}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s981350181", "group_id": "codeNet:p03785", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().solve();\n\t}\n\t\n\tvoid solve(){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint N=sc.nextInt();\n\t\tint C=sc.nextInt();\n\t\tint K=sc.nextInt();\n\t\tint[]T=new int[N];\n\t\tfor(int i=0;i0){\n\t\t\tif(people%C==0)count+=people/C;\n\t\t\telse count+=people/C+1;\n\t\t}\n\t\tSystem.out.println(count);\n\t\t\n\t}\n}", "language": "Java", "metadata": {"date": 1502236045, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03785.html", "problem_id": "p03785", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03785/input.txt", "sample_output_relpath": "derived/input_output/data/p03785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03785/Java/s981350181.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981350181", "user_id": "u369883202"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().solve();\n\t}\n\t\n\tvoid solve(){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint N=sc.nextInt();\n\t\tint C=sc.nextInt();\n\t\tint K=sc.nextInt();\n\t\tint[]T=new int[N];\n\t\tfor(int i=0;i0){\n\t\t\tif(people%C==0)count+=people/C;\n\t\t\telse count+=people/C+1;\n\t\t}\n\t\tSystem.out.println(count);\n\t\t\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "sample_input": "5 3 5\n1\n2\n3\n6\n12\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03785", "source_text": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 702, "cpu_time_ms": 495, "memory_kb": 50120}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s578153497", "group_id": "codeNet:p03785", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n int c = sc.nextInt();\n int k = sc.nextInt();\n\n int[] t = new int[n];\n for(int i= 0; i < n; i++) {\n t[i] = sc.nextInt();\n }\n\n Arrays.sort(t);\n\n int countBus = 1;\n int minPerson = 0;\n for(int i = 1; i < n; i++) {\n // capacity is full\n if(i - minPerson + 1 <= c && t[i] - t[minPerson] <= k) {\n // ok\n } else {\n countBus++;\n minPerson = i;\n }\n }\n\n System.out.println(countBus);\n }\n}\n", "language": "Java", "metadata": {"date": 1489367619, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03785.html", "problem_id": "p03785", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03785/input.txt", "sample_output_relpath": "derived/input_output/data/p03785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03785/Java/s578153497.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s578153497", "user_id": "u185193776"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n\n int n = sc.nextInt();\n int c = sc.nextInt();\n int k = sc.nextInt();\n\n int[] t = new int[n];\n for(int i= 0; i < n; i++) {\n t[i] = sc.nextInt();\n }\n\n Arrays.sort(t);\n\n int countBus = 1;\n int minPerson = 0;\n for(int i = 1; i < n; i++) {\n // capacity is full\n if(i - minPerson + 1 <= c && t[i] - t[minPerson] <= k) {\n // ok\n } else {\n countBus++;\n minPerson = i;\n }\n }\n\n System.out.println(countBus);\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "sample_input": "5 3 5\n1\n2\n3\n6\n12\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03785", "source_text": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 752, "cpu_time_ms": 527, "memory_kb": 48552}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s723411434", "group_id": "codeNet:p03787", "input_text": "\nimport java.util.Arrays;\n\npublic class Main {\n private static void solve() {\n int n = ni();\n int m = ni();\n int[] from = new int[m];\n int[] to = new int[m];\n DJSet ds = new DJSet(n);\n for (int i = 0; i < m; i++) {\n int u = ni() - 1;\n int v = ni() - 1;\n ds.union(u, v);\n from[i] = u;\n to[i] = v;\n }\n int[][] g = packU(n, from, to);\n\n int[][] buc = ds.toBucket();\n long size = 0;\n boolean[] bi = new boolean[n];\n\n long bicnt = 0;\n long one = 0;\n int[] eo = new int[n];\n for (int i = 0; i < n; i++) {\n if (buc[i] != null && buc[i].length > 1) {\n size++;\n bi[i] = dfs(i, g, eo, true);\n if (bi[i]) {\n bicnt++;\n }\n }\n if (buc[i] != null && buc[i].length == 1) {\n one++;\n }\n }\n\n long notbicnt = size - bicnt;\n\n\n long ret = 0;\n ret += one * (n - one) * 2 + one * one;\n ret += bicnt * 2;\n ret += notbicnt * notbicnt;\n ret += 2 * notbicnt * bicnt;\n ret += 2 * bicnt * (bicnt - 1);\n\n\n System.out.println(ret);\n }\n\n static int[][] packU(int n, int[] from, int[] to) {\n int[][] g = new int[n][];\n int[] p = new int[n];\n for (int f : from)\n p[f]++;\n for (int t : to)\n p[t]++;\n for (int i = 0; i < n; i++)\n g[i] = new int[p[i]];\n for (int i = 0; i < from.length; i++) {\n g[from[i]][--p[from[i]]] = to[i];\n g[to[i]][--p[to[i]]] = from[i];\n }\n return g;\n }\n\n private static boolean dfs(int now, int[][] g, int[] eo, boolean first) {\n if (first && eo[now] == 0) {\n eo[now] = 1;\n }\n\n for (int nex : g[now]) {\n if (eo[nex] != 0) {\n if (eo[nex] == eo[now]) {\n return false;\n }\n } else {\n eo[nex] = -eo[now];\n if (!dfs(nex, g, eo, false)) {\n return false;\n }\n }\n }\n return true;\n }\n\n\n public static class DJSet {\n public int[] upper;\n\n public DJSet(int n) {\n upper = new int[n];\n Arrays.fill(upper, -1);\n }\n\n public int root(int x) {\n return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n }\n\n public boolean equiv(int x, int y) {\n return root(x) == root(y);\n }\n\n public boolean union(int x, int y) {\n x = root(x);\n y = root(y);\n if (x != y) {\n if (upper[y] < upper[x]) {\n int d = x;\n x = y;\n y = d;\n }\n upper[x] += upper[y];\n upper[y] = x;\n }\n return x == y;\n }\n\n public int[][] toBucket() {\n int n = upper.length;\n int[][] ret = new int[n][];\n int[] rp = new int[n];\n for (int i = 0; i < n; i++) {\n if (upper[i] < 0)\n ret[i] = new int[-upper[i]];\n }\n for (int i = 0; i < n; i++) {\n int r = root(i);\n ret[r][rp[r]++] = i;\n }\n return ret;\n }\n }\n\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n @Override\n public void run() {\n long start = System.currentTimeMillis();\n String debug = args.length > 0 ? args[0] : null;\n if (debug != null) {\n try {\n is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);\n solve();\n out.flush();\n tr((System.currentTimeMillis() - start) + \"ms\");\n }\n }, \"\", 64000000).start();\n }\n\n private static java.io.InputStream is = System.in;\n private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);\n private static java.util.StringTokenizer tokenizer = null;\n private static java.io.BufferedReader reader;\n\n public static String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private static double nd() {\n return Double.parseDouble(next());\n }\n\n private static long nl() {\n return Long.parseLong(next());\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = ni();\n return a;\n }\n\n private static char[] ns() {\n return next().toCharArray();\n }\n\n private static long[] nal(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nl();\n return a;\n }\n\n private static int[][] ntable(int n, int m) {\n int[][] table = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[i][j] = ni();\n }\n }\n return table;\n }\n\n private static int[][] nlist(int n, int m) {\n int[][] table = new int[m][n];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[j][i] = ni();\n }\n }\n return table;\n }\n\n private static int ni() {\n return Integer.parseInt(next());\n }\n\n private static void tr(Object... o) {\n if (is != System.in)\n System.out.println(java.util.Arrays.deepToString(o));\n }\n}\n", "language": "Java", "metadata": {"date": 1584391687, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03787.html", "problem_id": "p03787", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03787/input.txt", "sample_output_relpath": "derived/input_output/data/p03787/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03787/Java/s723411434.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s723411434", "user_id": "u769201746"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "\nimport java.util.Arrays;\n\npublic class Main {\n private static void solve() {\n int n = ni();\n int m = ni();\n int[] from = new int[m];\n int[] to = new int[m];\n DJSet ds = new DJSet(n);\n for (int i = 0; i < m; i++) {\n int u = ni() - 1;\n int v = ni() - 1;\n ds.union(u, v);\n from[i] = u;\n to[i] = v;\n }\n int[][] g = packU(n, from, to);\n\n int[][] buc = ds.toBucket();\n long size = 0;\n boolean[] bi = new boolean[n];\n\n long bicnt = 0;\n long one = 0;\n int[] eo = new int[n];\n for (int i = 0; i < n; i++) {\n if (buc[i] != null && buc[i].length > 1) {\n size++;\n bi[i] = dfs(i, g, eo, true);\n if (bi[i]) {\n bicnt++;\n }\n }\n if (buc[i] != null && buc[i].length == 1) {\n one++;\n }\n }\n\n long notbicnt = size - bicnt;\n\n\n long ret = 0;\n ret += one * (n - one) * 2 + one * one;\n ret += bicnt * 2;\n ret += notbicnt * notbicnt;\n ret += 2 * notbicnt * bicnt;\n ret += 2 * bicnt * (bicnt - 1);\n\n\n System.out.println(ret);\n }\n\n static int[][] packU(int n, int[] from, int[] to) {\n int[][] g = new int[n][];\n int[] p = new int[n];\n for (int f : from)\n p[f]++;\n for (int t : to)\n p[t]++;\n for (int i = 0; i < n; i++)\n g[i] = new int[p[i]];\n for (int i = 0; i < from.length; i++) {\n g[from[i]][--p[from[i]]] = to[i];\n g[to[i]][--p[to[i]]] = from[i];\n }\n return g;\n }\n\n private static boolean dfs(int now, int[][] g, int[] eo, boolean first) {\n if (first && eo[now] == 0) {\n eo[now] = 1;\n }\n\n for (int nex : g[now]) {\n if (eo[nex] != 0) {\n if (eo[nex] == eo[now]) {\n return false;\n }\n } else {\n eo[nex] = -eo[now];\n if (!dfs(nex, g, eo, false)) {\n return false;\n }\n }\n }\n return true;\n }\n\n\n public static class DJSet {\n public int[] upper;\n\n public DJSet(int n) {\n upper = new int[n];\n Arrays.fill(upper, -1);\n }\n\n public int root(int x) {\n return upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n }\n\n public boolean equiv(int x, int y) {\n return root(x) == root(y);\n }\n\n public boolean union(int x, int y) {\n x = root(x);\n y = root(y);\n if (x != y) {\n if (upper[y] < upper[x]) {\n int d = x;\n x = y;\n y = d;\n }\n upper[x] += upper[y];\n upper[y] = x;\n }\n return x == y;\n }\n\n public int[][] toBucket() {\n int n = upper.length;\n int[][] ret = new int[n][];\n int[] rp = new int[n];\n for (int i = 0; i < n; i++) {\n if (upper[i] < 0)\n ret[i] = new int[-upper[i]];\n }\n for (int i = 0; i < n; i++) {\n int r = root(i);\n ret[r][rp[r]++] = i;\n }\n return ret;\n }\n }\n\n public static void main(String[] args) {\n new Thread(null, new Runnable() {\n @Override\n public void run() {\n long start = System.currentTimeMillis();\n String debug = args.length > 0 ? args[0] : null;\n if (debug != null) {\n try {\n is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);\n solve();\n out.flush();\n tr((System.currentTimeMillis() - start) + \"ms\");\n }\n }, \"\", 64000000).start();\n }\n\n private static java.io.InputStream is = System.in;\n private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);\n private static java.util.StringTokenizer tokenizer = null;\n private static java.io.BufferedReader reader;\n\n public static String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new java.util.StringTokenizer(reader.readLine());\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n private static double nd() {\n return Double.parseDouble(next());\n }\n\n private static long nl() {\n return Long.parseLong(next());\n }\n\n private static int[] na(int n) {\n int[] a = new int[n];\n for (int i = 0; i < n; i++)\n a[i] = ni();\n return a;\n }\n\n private static char[] ns() {\n return next().toCharArray();\n }\n\n private static long[] nal(int n) {\n long[] a = new long[n];\n for (int i = 0; i < n; i++)\n a[i] = nl();\n return a;\n }\n\n private static int[][] ntable(int n, int m) {\n int[][] table = new int[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[i][j] = ni();\n }\n }\n return table;\n }\n\n private static int[][] nlist(int n, int m) {\n int[][] table = new int[m][n];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n table[j][i] = ni();\n }\n }\n return table;\n }\n\n private static int ni() {\n return Integer.parseInt(next());\n }\n\n private static void tr(Object... o) {\n if (is != System.in)\n System.out.println(java.util.Arrays.deepToString(o));\n }\n}\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nTakahashi has received an undirected graph with N vertices, numbered 1, 2, ..., N.\nThe edges in this graph are represented by (u_i, v_i).\nThere are no self-loops and multiple edges in this graph.\n\nBased on this graph, Takahashi is now constructing a new graph with N^2 vertices, where each vertex is labeled with a pair of integers (a, b) (1 \\leq a \\leq N, 1 \\leq b \\leq N).\nThe edges in this new graph are generated by the following rule:\n\nSpan an edge between vertices (a, b) and (a', b') if and only if both of the following two edges exist in the original graph: an edge between vertices a and a', and an edge between vertices b and b'.\n\nHow many connected components are there in this new graph?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n0 \\leq M \\leq 200,000\n\n1 \\leq u_i < v_i \\leq N\n\nThere exists no pair of distinct integers i and j such that u_i = u_j and v_i = v_j.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nu_1 v_1\nu_2 v_2\n:\nu_M v_M\n\nOutput\n\nPrint the number of the connected components in the graph constructed by Takahashi.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n7\n\nThe graph constructed by Takahashi is as follows.\n\nSample Input 2\n\n7 5\n1 2\n3 4\n3 5\n4 5\n2 6\n\nSample Output 2\n\n18", "sample_input": "3 1\n1 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03787", "source_text": "Score : 800 points\n\nProblem Statement\n\nTakahashi has received an undirected graph with N vertices, numbered 1, 2, ..., N.\nThe edges in this graph are represented by (u_i, v_i).\nThere are no self-loops and multiple edges in this graph.\n\nBased on this graph, Takahashi is now constructing a new graph with N^2 vertices, where each vertex is labeled with a pair of integers (a, b) (1 \\leq a \\leq N, 1 \\leq b \\leq N).\nThe edges in this new graph are generated by the following rule:\n\nSpan an edge between vertices (a, b) and (a', b') if and only if both of the following two edges exist in the original graph: an edge between vertices a and a', and an edge between vertices b and b'.\n\nHow many connected components are there in this new graph?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n0 \\leq M \\leq 200,000\n\n1 \\leq u_i < v_i \\leq N\n\nThere exists no pair of distinct integers i and j such that u_i = u_j and v_i = v_j.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nu_1 v_1\nu_2 v_2\n:\nu_M v_M\n\nOutput\n\nPrint the number of the connected components in the graph constructed by Takahashi.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n7\n\nThe graph constructed by Takahashi is as follows.\n\nSample Input 2\n\n7 5\n1 2\n3 4\n3 5\n4 5\n2 6\n\nSample Output 2\n\n18", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5174, "cpu_time_ms": 287, "memory_kb": 49744}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s421660893", "group_id": "codeNet:p03792", "input_text": "import java.io.BufferedReader;\nimport java.io.Closeable;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\t\n\tpublic static boolean dfs(final int deep, final int limit, final int n, boolean[][] board){\n\t\t//System.out.println(deep + \" \" + limit + \" \" + Arrays.deepToString(board));\n\t\tif(deep >= limit){\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tfor(int j = 0; j < n; j++){\n\t\t\t\t\tif(!board[i][j]){ return false; }\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}\n\t\t\n\n\t\tfor(int row = 0; row < n; row++){\n\t\t\tfor(int col = 0; col < n; col++){\n\t\t\t\t\n\t\t\t\tboolean[] prev_col = new boolean[n];\n\t\t\t\tboolean[] prev_row = new boolean[n];\n\t\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\t\tprev_col[i] = board[i][col];\n\t\t\t\t\tprev_row[i] = board[row][i];\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\t\tboard[i][col] = prev_row[i];\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(dfs(deep + 1, limit, n, board)){ return true; }\n\t\t\t\t\n\t\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\t\tboard[i][col] = prev_col[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn false;\n\t}\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tfinal Scanner sc = new Scanner(System.in);\n\t\t\n\t\tfinal int n = sc.nextInt();\n\t\t\n\t\tif(n > 3){ return; }\n\t\t\n\t\tboolean[][] board = new boolean[n][n];\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tfinal char[] input = sc.next().toCharArray();\n\t\t\t\n\t\t\tfor(int j = 0; j < n; j++){\n\t\t\t\tboard[i][j] = input[j] == '#';\n\t\t\t}\n\t\t}\n\t\t\n\t\tboolean flg = false;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tif(board[0][i] || board[i][0]){\n\t\t\t\tflg = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(flg){\n\t\t\tSystem.out.println(-1);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint count = 0;\n\t\twhile(!dfs(0, count, n, board)){\n\t\t\tcount++;\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(count);\n\t}\n\t\n\tpublic static class Scanner implements Closeable {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tok;\n \n\t\tpublic Scanner(InputStream is) throws IOException {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t}\n \n\t\tprivate void getLine() throws IOException {\n\t\t\twhile (!hasNext()) {\n\t\t\t\ttok = new StringTokenizer(br.readLine());\n\t\t\t}\n\t\t}\n \n\t\tprivate boolean hasNext() {\n\t\t\treturn tok != null && tok.hasMoreTokens();\n\t\t}\n \n\t\tpublic String next() throws IOException {\n\t\t\tgetLine();\n\t\t\treturn tok.nextToken();\n\t\t}\n \n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(int n) throws IOException {\n\t\t\tfinal int[] ret = new int[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextInt();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(int n) throws IOException {\n\t\t\tfinal long[] ret = new long[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextLong();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n \n\t\tpublic void close() throws IOException {\n\t\t\tbr.close();\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1488075481, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03792.html", "problem_id": "p03792", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03792/input.txt", "sample_output_relpath": "derived/input_output/data/p03792/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03792/Java/s421660893.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s421660893", "user_id": "u790372061"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.Closeable;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.Arrays;\nimport java.util.LinkedList;\nimport java.util.Scanner;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\t\n\tpublic static boolean dfs(final int deep, final int limit, final int n, boolean[][] board){\n\t\t//System.out.println(deep + \" \" + limit + \" \" + Arrays.deepToString(board));\n\t\tif(deep >= limit){\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tfor(int j = 0; j < n; j++){\n\t\t\t\t\tif(!board[i][j]){ return false; }\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}\n\t\t\n\n\t\tfor(int row = 0; row < n; row++){\n\t\t\tfor(int col = 0; col < n; col++){\n\t\t\t\t\n\t\t\t\tboolean[] prev_col = new boolean[n];\n\t\t\t\tboolean[] prev_row = new boolean[n];\n\t\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\t\tprev_col[i] = board[i][col];\n\t\t\t\t\tprev_row[i] = board[row][i];\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\t\tboard[i][col] = prev_row[i];\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(dfs(deep + 1, limit, n, board)){ return true; }\n\t\t\t\t\n\t\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\t\tboard[i][col] = prev_col[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn false;\n\t}\n\t\n\tpublic static void main(String[] args) throws IOException {\n\t\tfinal Scanner sc = new Scanner(System.in);\n\t\t\n\t\tfinal int n = sc.nextInt();\n\t\t\n\t\tif(n > 3){ return; }\n\t\t\n\t\tboolean[][] board = new boolean[n][n];\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tfinal char[] input = sc.next().toCharArray();\n\t\t\t\n\t\t\tfor(int j = 0; j < n; j++){\n\t\t\t\tboard[i][j] = input[j] == '#';\n\t\t\t}\n\t\t}\n\t\t\n\t\tboolean flg = false;\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tif(board[0][i] || board[i][0]){\n\t\t\t\tflg = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(flg){\n\t\t\tSystem.out.println(-1);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint count = 0;\n\t\twhile(!dfs(0, count, n, board)){\n\t\t\tcount++;\n\t\t}\n\t\t\n\t\t\n\t\tSystem.out.println(count);\n\t}\n\t\n\tpublic static class Scanner implements Closeable {\n\t\tprivate BufferedReader br;\n\t\tprivate StringTokenizer tok;\n \n\t\tpublic Scanner(InputStream is) throws IOException {\n\t\t\tbr = new BufferedReader(new InputStreamReader(is));\n\t\t}\n \n\t\tprivate void getLine() throws IOException {\n\t\t\twhile (!hasNext()) {\n\t\t\t\ttok = new StringTokenizer(br.readLine());\n\t\t\t}\n\t\t}\n \n\t\tprivate boolean hasNext() {\n\t\t\treturn tok != null && tok.hasMoreTokens();\n\t\t}\n \n\t\tpublic String next() throws IOException {\n\t\t\tgetLine();\n\t\t\treturn tok.nextToken();\n\t\t}\n \n\t\tpublic int nextInt() throws IOException {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n \n\t\tpublic long nextLong() throws IOException {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n \n\t\tpublic double nextDouble() throws IOException {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t\t\n\t\tpublic int[] nextIntArray(int n) throws IOException {\n\t\t\tfinal int[] ret = new int[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextInt();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tpublic long[] nextLongArray(int n) throws IOException {\n\t\t\tfinal long[] ret = new long[n];\n\t\t\tfor(int i = 0; i < n; i++){\n\t\t\t\tret[i] = this.nextLong();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n \n\t\tpublic void close() throws IOException {\n\t\t\tbr.close();\n\t\t}\n\t}\n}", "problem_context": "Score : 1300 points\n\nProblem Statement\n\nThere is a square-shaped grid with N vertical rows and N horizontal columns.\nWe will denote the square at the i-th row from the top and the j-th column from the left as (i,\\ j).\n\nInitially, each square is either white or black.\nThe initial color of the grid is given to you as characters a_{ij}, arranged in a square shape.\nIf the square (i,\\ j) is white, a_{ij} is .. If it is black, a_{ij} is #.\n\nYou are developing a robot that repaints the grid.\nIt can repeatedly perform the following operation:\n\nSelect two integers i, j (1 ≤ i,\\ j ≤ N). Memorize the colors of the squares (i,\\ 1), (i,\\ 2), ..., (i,\\ N) as c_1, c_2, ..., c_N, respectively. Then, repaint the squares (1,\\ j), (2,\\ j), ..., (N,\\ j) with the colors c_1, c_2, ..., c_N, respectively.\n\nYour objective is to turn all the squares black.\nDetermine whether it is possible, and find the minimum necessary number of operations to achieve it if the answer is positive.\n\nConstraints\n\n2 ≤ N ≤ 500\n\na_{ij} is either . or #.\n\nPartial Score\n\nIn a test set worth 300 points, N ≤ 3.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_{11}...a_{1N}\n:\na_{N1}...a_{NN}\n\nOutput\n\nIf it is possible to turn all the squares black, print the minimum necessary number of operations to achieve the objective.\nIf it is impossible, print -1 instead.\n\nSample Input 1\n\n2\n#.\n.#\n\nSample Output 1\n\n3\n\nFor example, perform the operation as follows:\n\nSelect i = 1, j = 2.\n\nSelect i = 1, j = 1.\n\nSelect i = 1, j = 2.\n\nThe transition of the colors of the squares is shown in the figure below:\n\nSample Input 2\n\n2\n..\n..\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n2\n##\n##\n\nSample Output 3\n\n0\n\nSample Input 4\n\n3\n.#.\n###\n.#.\n\nSample Output 4\n\n2\n\nSample Input 5\n\n3\n...\n.#.\n...\n\nSample Output 5\n\n5", "sample_input": "2\n#.\n.#\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03792", "source_text": "Score : 1300 points\n\nProblem Statement\n\nThere is a square-shaped grid with N vertical rows and N horizontal columns.\nWe will denote the square at the i-th row from the top and the j-th column from the left as (i,\\ j).\n\nInitially, each square is either white or black.\nThe initial color of the grid is given to you as characters a_{ij}, arranged in a square shape.\nIf the square (i,\\ j) is white, a_{ij} is .. If it is black, a_{ij} is #.\n\nYou are developing a robot that repaints the grid.\nIt can repeatedly perform the following operation:\n\nSelect two integers i, j (1 ≤ i,\\ j ≤ N). Memorize the colors of the squares (i,\\ 1), (i,\\ 2), ..., (i,\\ N) as c_1, c_2, ..., c_N, respectively. Then, repaint the squares (1,\\ j), (2,\\ j), ..., (N,\\ j) with the colors c_1, c_2, ..., c_N, respectively.\n\nYour objective is to turn all the squares black.\nDetermine whether it is possible, and find the minimum necessary number of operations to achieve it if the answer is positive.\n\nConstraints\n\n2 ≤ N ≤ 500\n\na_{ij} is either . or #.\n\nPartial Score\n\nIn a test set worth 300 points, N ≤ 3.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_{11}...a_{1N}\n:\na_{N1}...a_{NN}\n\nOutput\n\nIf it is possible to turn all the squares black, print the minimum necessary number of operations to achieve the objective.\nIf it is impossible, print -1 instead.\n\nSample Input 1\n\n2\n#.\n.#\n\nSample Output 1\n\n3\n\nFor example, perform the operation as follows:\n\nSelect i = 1, j = 2.\n\nSelect i = 1, j = 1.\n\nSelect i = 1, j = 2.\n\nThe transition of the colors of the squares is shown in the figure below:\n\nSample Input 2\n\n2\n..\n..\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n2\n##\n##\n\nSample Output 3\n\n0\n\nSample Input 4\n\n3\n.#.\n###\n.#.\n\nSample Output 4\n\n2\n\nSample Input 5\n\n3\n...\n.#.\n...\n\nSample Output 5\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3010, "cpu_time_ms": 2105, "memory_kb": 339932}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s561395224", "group_id": "codeNet:p03795", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t}\n\n\tvoid solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tsc.close();\n\t\tSystem.out.println((n*800)-n/15*200);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1551312425, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03795.html", "problem_id": "p03795", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03795/input.txt", "sample_output_relpath": "derived/input_output/data/p03795/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03795/Java/s561395224.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s561395224", "user_id": "u908039151"}, "prompt_components": {"gold_output": "15800\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tMain main = new Main();\n\t\tmain.solve();\n\t}\n\n\tvoid solve() {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = Integer.parseInt(sc.next());\n\t\tsc.close();\n\t\tSystem.out.println((n*800)-n/15*200);\n\t}\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "sample_input": "20\n"}, "reference_outputs": ["15800\n"], "source_document_id": "p03795", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 290, "cpu_time_ms": 93, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s954280706", "group_id": "codeNet:p03795", "input_text": "import java.util.Scanner;\n\nclass Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt();\n\t\t\tSystem.out.println(800*n-200*(n/15));\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1492521783, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03795.html", "problem_id": "p03795", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03795/input.txt", "sample_output_relpath": "derived/input_output/data/p03795/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03795/Java/s954280706.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s954280706", "user_id": "u198062737"}, "prompt_components": {"gold_output": "15800\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main{\n\tpublic static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\twhile(sc.hasNext()){\n\t\t\tint n=sc.nextInt();\n\t\t\tSystem.out.println(800*n-200*(n/15));\n\t\t}\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "sample_input": "20\n"}, "reference_outputs": ["15800\n"], "source_document_id": "p03795", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 94, "memory_kb": 21588}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s879000762", "group_id": "codeNet:p03799", "input_text": "import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.Closeable;\nimport java.io.FileInputStream;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.BitSet;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.TreeMap;\n\npublic class Main implements Runnable{\n\tstatic ContestScanner in;static Writer out;\n\tpublic static void main(String[] args) {\n\t\tnew Thread(null, new Main(), \"\", 16 * 1024 * 1024).start();\n\t}\n\tpublic void run() {\n\t\ttry {\n//\t\t\tin = new ContestScanner(\"in.txt\");\n//\t\t\tout = new Writer(\"out.txt\");\n\t\t\tin = new ContestScanner();\n\t\t\tout = new Writer();\n\t\t\tMain solve = new Main();\n\t\t\tsolve.solve();\n\t\t\tin.close();\n\t\t\tout.flush();\n\t\t\tout.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}\n\tstatic void dump(int[]a){StringBuilder s=new StringBuilder();for(int i=0;i0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}\n\tstatic String itob(int a,int l){return String.format(\"%\"+l+\"s\",Integer.toBinaryString(a)).replace(' ','0');}\n\tstatic void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}\n\tstatic void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}\n\tstatic void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}\n\tstatic void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}\n\tstatic void m_sort(int[]a,int s,int sz,int[]b)\n\t{if(sz<7){for(int i=s;is&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}\n\tm_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;\n\twhile(la[r])b[idx++]=a[r++];else b[idx++]=a[l++];}\n\twhile(rs&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}\n\tm_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;\n\twhile(la[r])b[idx++]=a[r++];else b[idx++]=a[l++];}\n\twhile(rv)r=m-1;else{l=m+1;s=m;}}return s;}\n\tstatic int binarySearchSmallerMax(int[]a,int v,int l,int r)\n\t{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}\n\t@SuppressWarnings(\"unchecked\")\n\tstatic List[]createGraph(int n)\n {List[]g=new List[n];for(int i=0;i();return g;}\n\tvoid solve() throws IOException{\n\t\tlong n = in.nextLong();\n\t\tlong m = in.nextLong();\n\t\tif(n*2>m){\n\t\t\tSystem.out.println(n);\n\t\t\treturn;\n\t\t}\n\t\tlong ans = n;\n\t\tm -= 2*n;\n\t\tSystem.out.println(ans+(m/4));\n\t}\n}\n\n\n@SuppressWarnings(\"serial\")\nclass MultiSet extends HashMap{\n\t@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}\n\tpublic void add(T key,int v){put(key,get(key)+v);}\n\tpublic void add(T key){put(key,get(key)+1);}\n\tpublic void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}\n\tpublic MultiSet merge(MultiSet set)\n\t{MultiSets,l;if(this.size()e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}\n}\n@SuppressWarnings(\"serial\")\nclass OrderedMultiSet extends TreeMap{\n\t@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}\n\tpublic void add(T key,int v){put(key,get(key)+v);}\n\tpublic void add(T key){put(key,get(key)+1);}\n\tpublic void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}\n\tpublic OrderedMultiSet merge(OrderedMultiSet set)\n\t{OrderedMultiSets,l;if(this.size(){\n\tint a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}\n\tpublic boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}\n\tpublic int hashCode(){return hash;}\n\tpublic int compareTo(Pair o){if(a!=o.a)return a0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}\n\tstatic String itob(int a,int l){return String.format(\"%\"+l+\"s\",Integer.toBinaryString(a)).replace(' ','0');}\n\tstatic void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}\n\tstatic void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}\n\tstatic void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}\n\tstatic void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}\n\tstatic void m_sort(int[]a,int s,int sz,int[]b)\n\t{if(sz<7){for(int i=s;is&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}\n\tm_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;\n\twhile(la[r])b[idx++]=a[r++];else b[idx++]=a[l++];}\n\twhile(rs&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}\n\tm_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;\n\twhile(la[r])b[idx++]=a[r++];else b[idx++]=a[l++];}\n\twhile(rv)r=m-1;else{l=m+1;s=m;}}return s;}\n\tstatic int binarySearchSmallerMax(int[]a,int v,int l,int r)\n\t{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}\n\t@SuppressWarnings(\"unchecked\")\n\tstatic List[]createGraph(int n)\n {List[]g=new List[n];for(int i=0;i();return g;}\n\tvoid solve() throws IOException{\n\t\tlong n = in.nextLong();\n\t\tlong m = in.nextLong();\n\t\tif(n*2>m){\n\t\t\tSystem.out.println(n);\n\t\t\treturn;\n\t\t}\n\t\tlong ans = n;\n\t\tm -= 2*n;\n\t\tSystem.out.println(ans+(m/4));\n\t}\n}\n\n\n@SuppressWarnings(\"serial\")\nclass MultiSet extends HashMap{\n\t@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}\n\tpublic void add(T key,int v){put(key,get(key)+v);}\n\tpublic void add(T key){put(key,get(key)+1);}\n\tpublic void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}\n\tpublic MultiSet merge(MultiSet set)\n\t{MultiSets,l;if(this.size()e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}\n}\n@SuppressWarnings(\"serial\")\nclass OrderedMultiSet extends TreeMap{\n\t@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}\n\tpublic void add(T key,int v){put(key,get(key)+v);}\n\tpublic void add(T key){put(key,get(key)+1);}\n\tpublic void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}\n\tpublic OrderedMultiSet merge(OrderedMultiSet set)\n\t{OrderedMultiSets,l;if(this.size(){\n\tint a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}\n\tpublic boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}\n\tpublic int hashCode(){return hash;}\n\tpublic int compareTo(Pair o){if(a!=o.a)return a= n - m) {\n\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(\"No\");\n\n\t}\n}\n", "language": "Java", "metadata": {"date": 1512222455, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03804.html", "problem_id": "p03804", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03804/input.txt", "sample_output_relpath": "derived/input_output/data/p03804/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03804/Java/s948307911.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s948307911", "user_id": "u001648655"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\n\t\tString[] a = new String[n];\n\t\tString[] b = new String[m];\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ta[i] = sc.next();\n\t\t}\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tb[i] = sc.next();\n\t\t}\n\n\t\tfor (int i = 0; i <= n - m; i++) {\n\t\t\tint j;\n\t\t\tfor (j = 0; j < m; j++) {\n\t\t\t\tif (!a[i+j].substring(j, j + m ).equals(b[j])) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (j >= n - m) {\n\t\t\t\tSystem.out.println(\"Yes\");\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(\"No\");\n\n\t}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an image A composed of N rows and N columns of pixels, and a template image B composed of M rows and M columns of pixels.\n\nA pixel is the smallest element of an image, and in this problem it is a square of size 1×1.\n\nAlso, the given images are binary images, and the color of each pixel is either white or black.\n\nIn the input, every pixel is represented by a character: . corresponds to a white pixel, and # corresponds to a black pixel.\n\nThe image A is given as N strings A_1,...,A_N.\n\nThe j-th character in the string A_i corresponds to the pixel at the i-th row and j-th column of the image A (1≦i,j≦N).\n\nSimilarly, the template image B is given as M strings B_1,...,B_M.\n\nThe j-th character in the string B_i corresponds to the pixel at the i-th row and j-th column of the template image B (1≦i,j≦M).\n\nDetermine whether the template image B is contained in the image A when only parallel shifts can be applied to the images.\n\nConstraints\n\n1≦M≦N≦50\n\nA_i is a string of length N consisting of # and ..\n\nB_i is a string of length M consisting of # and ..\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1\nA_2\n:\nA_N\nB_1\nB_2\n:\nB_M\n\nOutput\n\nPrint Yes if the template image B is contained in the image A. Print No otherwise.\n\nSample Input 1\n\n3 2\n#.#\n.#.\n#.#\n#.\n.#\n\nSample Output 1\n\nYes\n\nThe template image B is identical to the upper-left 2 × 2 subimage and the lower-right 2 × 2 subimage of A. Thus, the output should be Yes.\n\nSample Input 2\n\n4 1\n....\n....\n....\n....\n#\n\nSample Output 2\n\nNo\n\nThe template image B, composed of a black pixel, is not contained in the image A composed of white pixels.", "sample_input": "3 2\n#.#\n.#.\n#.#\n#.\n.#\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03804", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an image A composed of N rows and N columns of pixels, and a template image B composed of M rows and M columns of pixels.\n\nA pixel is the smallest element of an image, and in this problem it is a square of size 1×1.\n\nAlso, the given images are binary images, and the color of each pixel is either white or black.\n\nIn the input, every pixel is represented by a character: . corresponds to a white pixel, and # corresponds to a black pixel.\n\nThe image A is given as N strings A_1,...,A_N.\n\nThe j-th character in the string A_i corresponds to the pixel at the i-th row and j-th column of the image A (1≦i,j≦N).\n\nSimilarly, the template image B is given as M strings B_1,...,B_M.\n\nThe j-th character in the string B_i corresponds to the pixel at the i-th row and j-th column of the template image B (1≦i,j≦M).\n\nDetermine whether the template image B is contained in the image A when only parallel shifts can be applied to the images.\n\nConstraints\n\n1≦M≦N≦50\n\nA_i is a string of length N consisting of # and ..\n\nB_i is a string of length M consisting of # and ..\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1\nA_2\n:\nA_N\nB_1\nB_2\n:\nB_M\n\nOutput\n\nPrint Yes if the template image B is contained in the image A. Print No otherwise.\n\nSample Input 1\n\n3 2\n#.#\n.#.\n#.#\n#.\n.#\n\nSample Output 1\n\nYes\n\nThe template image B is identical to the upper-left 2 × 2 subimage and the lower-right 2 × 2 subimage of A. Thus, the output should be Yes.\n\nSample Input 2\n\n4 1\n....\n....\n....\n....\n#\n\nSample Output 2\n\nNo\n\nThe template image B, composed of a black pixel, is not contained in the image A composed of white pixels.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 623, "cpu_time_ms": 117, "memory_kb": 22740}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s066735178", "group_id": "codeNet:p03804", "input_text": "import java.io.*;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n InputStreamReader is = new InputStreamReader(System.in);\n BufferedReader br = new BufferedReader(is);\n \n \n //キーボードから1列目を読み込み\n String str = br.readLine();\n //読み込みを分割\n String[] gazou = str.split(\" \",0);\n int n = Integer.parseInt(gazou[0]);\n int m = Integer.parseInt(gazou[1]);\n //aとbの配列を作る\n String[][] a = new String[n][n];\n String[][] b = new String[m][m];\n //配列に代入(a)\n for(int i=0; i 0 || d[i] % n != 0) {\n System.out.println(\"NO\");\n return;\n }\n }\n System.out.println(\"YES\");\n }\n}\n\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "language": "Java", "metadata": {"date": 1583977062, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03808.html", "problem_id": "p03808", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03808/input.txt", "sample_output_relpath": "derived/input_output/data/p03808/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03808/Java/s381679845.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s381679845", "user_id": "u541055501"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.NoSuchElementException;\n\npublic class Main {\n public static void main(String[] args) {\n FastScanner fsc = new FastScanner();\n int n = fsc.nextInt();\n long[] a = new long[n];\n long s = 0;\n for (int i = 0; i < n; i++) {\n a[i] = fsc.nextLong();\n s += a[i];\n }\n if (s % ((long) n * (n + 1) / 2) != 0) {\n System.out.println(\"NO\");\n return;\n }\n long x = s * 2 / n / (n + 1);\n long[] d = new long[n];\n for(int i = 0; i < n; i++) {\n d[i] = a[i] - a[(i - 1 + n) % n] - x;\n if (d[i] > 0 || d[i] % n != 0) {\n System.out.println(\"NO\");\n return;\n }\n }\n System.out.println(\"YES\");\n }\n}\n\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int buflen = 0;\n\n private boolean hasNextByte() {\n if (ptr < buflen) {\n return true;\n } else {\n ptr = 0;\n try {\n buflen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (buflen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) {\n return buffer[ptr++];\n } else {\n return -1;\n }\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n public boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) {\n ptr++;\n }\n return hasNextByte();\n }\n\n public String next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n public long nextLong() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n public int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {\n throw new NumberFormatException();\n }\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N boxes arranged in a circle. The i-th box contains A_i stones.\n\nDetermine whether it is possible to remove all the stones from the boxes by repeatedly performing the following operation:\n\nSelect one box. Let the box be the i-th box. Then, for each j from 1 through N, remove exactly j stones from the (i+j)-th box. Here, the (N+k)-th box is identified with the k-th box.\n\nNote that the operation cannot be performed if there is a box that does not contain enough number of stones to be removed.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nIf it is possible to remove all the stones from the boxes, print YES. Otherwise, print NO.\n\nSample Input 1\n\n5\n4 5 1 2 3\n\nSample Output 1\n\nYES\n\nAll the stones can be removed in one operation by selecting the second box.\n\nSample Input 2\n\n5\n6 9 12 10 8\n\nSample Output 2\n\nYES\n\nSample Input 3\n\n4\n1 2 3 1\n\nSample Output 3\n\nNO", "sample_input": "5\n4 5 1 2 3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03808", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N boxes arranged in a circle. The i-th box contains A_i stones.\n\nDetermine whether it is possible to remove all the stones from the boxes by repeatedly performing the following operation:\n\nSelect one box. Let the box be the i-th box. Then, for each j from 1 through N, remove exactly j stones from the (i+j)-th box. Here, the (N+k)-th box is identified with the k-th box.\n\nNote that the operation cannot be performed if there is a box that does not contain enough number of stones to be removed.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nIf it is possible to remove all the stones from the boxes, print YES. Otherwise, print NO.\n\nSample Input 1\n\n5\n4 5 1 2 3\n\nSample Output 1\n\nYES\n\nAll the stones can be removed in one operation by selecting the second box.\n\nSample Input 2\n\n5\n6 9 12 10 8\n\nSample Output 2\n\nYES\n\nSample Input 3\n\n4\n1 2 3 1\n\nSample Output 3\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3160, "cpu_time_ms": 99, "memory_kb": 26068}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s723760239", "group_id": "codeNet:p03809", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class TaskC {\n\t\tboolean ok;\n\n\t\tpublic void solve(int testNumber, FastScanner in, PrintWriter out) {\n\t\t\tint n = in.nextInt();\n\t\t\tList[] adj = new List[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tadj[i] = new ArrayList<>();\n\t\t\t}\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = in.nextInt();\n\t\t\t}\n\t\t\tfor (int i = 0; i < n - 1; i++) {\n\t\t\t\tint u = in.nextInt() - 1;\n\t\t\t\tint v = in.nextInt() - 1;\n\t\t\t\tadj[u].add(v);\n\t\t\t\tadj[v].add(u);\n\t\t\t}\n\t\t\tif (n == 2) {\n\t\t\t\tout.println(a[0] == a[1] ? \"YES\" : \"NO\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint root = -1;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (adj[i].size() > 1) {\n\t\t\t\t\troot = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (root < 0) {\n\t\t\t\tthrow new AssertionError();\n\t\t\t}\n\t\t\tok = true;\n\t\t\t// System.out.println(\"root = \" + root);\n\t\t\tlong excess = dfs(root, -1, adj, a);\n\t\t\tout.println(ok && excess == 0 ? \"YES\" : \"NO\");\n\t\t}\n\n\t\tprivate long dfs(int v, int parent, List[] adj, int[] a) {\n\t\t\tList e = new ArrayList<>();\n\t\t\tlong sum = 0;\n\t\t\tfor (int u : adj[v]) {\n\t\t\t\tif (u == parent) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tlong cur = dfs(u, v, adj, a);\n\t\t\t\te.add(cur);\n\t\t\t\tsum += cur;\n\t\t\t}\n\t\t\tif (e.size() == 0) {\n\t\t\t\treturn a[v];\n\t\t\t}\n\t\t\tlong p = sum - a[v]; // pairs\n\t\t\tlong s = a[v] - p; // singles\n\t\t\tif (p < 0 || s < 0) {\n\t\t\t\tok = false;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (p > maxPairs(e)) {\n\t\t\t\tok = false;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\treturn s;\n\t\t}\n\n\t\tprivate long maxPairs(List a) {\n\t\t\tlong free = 0;\n\t\t\tlong pairs = 0;\n\t\t\tfor (long x : a) {\n\t\t\t\tlong s = Math.min(x, free);\n\t\t\t\tx -= s;\n\t\t\t\tfree -= s;\n\t\t\t\tif (x % 2 != 0) {\n\t\t\t\t\t++free;\n\t\t\t\t\t--x;\n\t\t\t\t}\n\t\t\t\tlong d = Math.min(x, 2 * pairs);\n\t\t\t\tx -= d;\n\n\t\t\t\tpairs += s;\n\t\t\t\tpairs += d / 2;\n\t\t\t\tfree += x;\n\t\t\t}\n\t\t\treturn pairs;\n\t\t}\n\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate BufferedReader in;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif (rl == null) {\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1486266967, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03809.html", "problem_id": "p03809", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03809/input.txt", "sample_output_relpath": "derived/input_output/data/p03809/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03809/Java/s723760239.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s723760239", "user_id": "u113560961"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.StringTokenizer;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskC solver = new TaskC();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class TaskC {\n\t\tboolean ok;\n\n\t\tpublic void solve(int testNumber, FastScanner in, PrintWriter out) {\n\t\t\tint n = in.nextInt();\n\t\t\tList[] adj = new List[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tadj[i] = new ArrayList<>();\n\t\t\t}\n\t\t\tint[] a = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\ta[i] = in.nextInt();\n\t\t\t}\n\t\t\tfor (int i = 0; i < n - 1; i++) {\n\t\t\t\tint u = in.nextInt() - 1;\n\t\t\t\tint v = in.nextInt() - 1;\n\t\t\t\tadj[u].add(v);\n\t\t\t\tadj[v].add(u);\n\t\t\t}\n\t\t\tif (n == 2) {\n\t\t\t\tout.println(a[0] == a[1] ? \"YES\" : \"NO\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint root = -1;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (adj[i].size() > 1) {\n\t\t\t\t\troot = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (root < 0) {\n\t\t\t\tthrow new AssertionError();\n\t\t\t}\n\t\t\tok = true;\n\t\t\t// System.out.println(\"root = \" + root);\n\t\t\tlong excess = dfs(root, -1, adj, a);\n\t\t\tout.println(ok && excess == 0 ? \"YES\" : \"NO\");\n\t\t}\n\n\t\tprivate long dfs(int v, int parent, List[] adj, int[] a) {\n\t\t\tList e = new ArrayList<>();\n\t\t\tlong sum = 0;\n\t\t\tfor (int u : adj[v]) {\n\t\t\t\tif (u == parent) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tlong cur = dfs(u, v, adj, a);\n\t\t\t\te.add(cur);\n\t\t\t\tsum += cur;\n\t\t\t}\n\t\t\tif (e.size() == 0) {\n\t\t\t\treturn a[v];\n\t\t\t}\n\t\t\tlong p = sum - a[v]; // pairs\n\t\t\tlong s = a[v] - p; // singles\n\t\t\tif (p < 0 || s < 0) {\n\t\t\t\tok = false;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (p > maxPairs(e)) {\n\t\t\t\tok = false;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\treturn s;\n\t\t}\n\n\t\tprivate long maxPairs(List a) {\n\t\t\tlong free = 0;\n\t\t\tlong pairs = 0;\n\t\t\tfor (long x : a) {\n\t\t\t\tlong s = Math.min(x, free);\n\t\t\t\tx -= s;\n\t\t\t\tfree -= s;\n\t\t\t\tif (x % 2 != 0) {\n\t\t\t\t\t++free;\n\t\t\t\t\t--x;\n\t\t\t\t}\n\t\t\t\tlong d = Math.min(x, 2 * pairs);\n\t\t\t\tx -= d;\n\n\t\t\t\tpairs += s;\n\t\t\t\tpairs += d / 2;\n\t\t\t\tfree += x;\n\t\t\t}\n\t\t\treturn pairs;\n\t\t}\n\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate BufferedReader in;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tString rl = in.readLine();\n\t\t\t\t\tif (rl == null) {\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\tst = new StringTokenizer(rl);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t}\n}\n\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere is a tree with N vertices, numbered 1 through N.\nThe i-th of the N-1 edges connects vertices a_i and b_i.\n\nCurrently, there are A_i stones placed on vertex i.\nDetermine whether it is possible to remove all the stones from the vertices by repeatedly performing the following operation:\n\nSelect a pair of different leaves. Then, remove exactly one stone from every vertex on the path between those two vertices.\nHere, a leaf is a vertex of the tree whose degree is 1, and the selected leaves themselves are also considered as vertices on the path connecting them.\n\nNote that the operation cannot be performed if there is a vertex with no stone on the path.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ a_i,b_i ≦ N\n\n0 ≦ A_i ≦ 10^9\n\nThe given graph is a tree.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf it is possible to remove all the stones from the vertices, print YES. Otherwise, print NO.\n\nSample Input 1\n\n5\n1 2 1 1 2\n2 4\n5 2\n3 2\n1 3\n\nSample Output 1\n\nYES\n\nAll the stones can be removed, as follows:\n\nSelect vertices 4 and 5. Then, there is one stone remaining on each vertex except 4.\n\nSelect vertices 1 and 5. Then, there is no stone on any vertex.\n\nSample Input 2\n\n3\n1 2 1\n1 2\n2 3\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n6\n3 2 2 2 2 2\n1 2\n2 3\n1 4\n1 5\n4 6\n\nSample Output 3\n\nYES", "sample_input": "5\n1 2 1 1 2\n2 4\n5 2\n3 2\n1 3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03809", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere is a tree with N vertices, numbered 1 through N.\nThe i-th of the N-1 edges connects vertices a_i and b_i.\n\nCurrently, there are A_i stones placed on vertex i.\nDetermine whether it is possible to remove all the stones from the vertices by repeatedly performing the following operation:\n\nSelect a pair of different leaves. Then, remove exactly one stone from every vertex on the path between those two vertices.\nHere, a leaf is a vertex of the tree whose degree is 1, and the selected leaves themselves are also considered as vertices on the path connecting them.\n\nNote that the operation cannot be performed if there is a vertex with no stone on the path.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ a_i,b_i ≦ N\n\n0 ≦ A_i ≦ 10^9\n\nThe given graph is a tree.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf it is possible to remove all the stones from the vertices, print YES. Otherwise, print NO.\n\nSample Input 1\n\n5\n1 2 1 1 2\n2 4\n5 2\n3 2\n1 3\n\nSample Output 1\n\nYES\n\nAll the stones can be removed, as follows:\n\nSelect vertices 4 and 5. Then, there is one stone remaining on each vertex except 4.\n\nSelect vertices 1 and 5. Then, there is no stone on any vertex.\n\nSample Input 2\n\n3\n1 2 1\n1 2\n2 3\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n6\n3 2 2 2 2 2\n1 2\n2 3\n1 4\n1 5\n4 6\n\nSample Output 3\n\nYES", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3018, "cpu_time_ms": 588, "memory_kb": 85228}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s817544464", "group_id": "codeNet:p03815", "input_text": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong x = sc.nextLong();\n\t\tlong temp = x / 11;\n\t\tif((temp * 11) + 5 > x) {\n\t\t\tSystem.out.println(temp * 2 + 1);\n\t\t} else {\n\t\t\tSystem.out.println(temp * 2 + 2);\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1540740410, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03815.html", "problem_id": "p03815", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03815/input.txt", "sample_output_relpath": "derived/input_output/data/p03815/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03815/Java/s817544464.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s817544464", "user_id": "u861755736"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String args[]) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tlong x = sc.nextLong();\n\t\tlong temp = x / 11;\n\t\tif((temp * 11) + 5 > x) {\n\t\t\tSystem.out.println(temp * 2 + 1);\n\t\t} else {\n\t\t\tSystem.out.println(temp * 2 + 2);\n\t\t}\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "sample_input": "7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03815", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 96, "memory_kb": 25300}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s351699962", "group_id": "codeNet:p03821", "input_text": "import java.util.Scanner;\npublic class Main {\n\t\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a=sc.nextInt();\n int c[]=new int[a];\n int d[]=new int[a];\n for(int i=0;i!=a;i++) {\n \tc[i]=sc.nextInt();\n \td[i]=sc.nextInt();\n }\n int count=0;\n for(int i=0;i!=a;i++) {\n \tfor(;;) {\n \tif((c[i]+count)%d[i]==0) {\n \t\tbreak;\n \t}\n \tcount++;\n \t}\n }\n System.out.println(count);\n }\n}", "language": "Java", "metadata": {"date": 1549160274, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03821.html", "problem_id": "p03821", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03821/input.txt", "sample_output_relpath": "derived/input_output/data/p03821/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03821/Java/s351699962.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s351699962", "user_id": "u274962354"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main {\n\t\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int a=sc.nextInt();\n int c[]=new int[a];\n int d[]=new int[a];\n for(int i=0;i!=a;i++) {\n \tc[i]=sc.nextInt();\n \td[i]=sc.nextInt();\n }\n int count=0;\n for(int i=0;i!=a;i++) {\n \tfor(;;) {\n \tif((c[i]+count)%d[i]==0) {\n \t\tbreak;\n \t}\n \tcount++;\n \t}\n }\n System.out.println(count);\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are an integer sequence A_1,...,A_N consisting of N terms, and N buttons.\nWhen the i-th (1 �� i ≦ N) button is pressed, the values of the i terms from the first through the i-th are all incremented by 1.\n\nThere is also another integer sequence B_1,...,B_N. Takahashi will push the buttons some number of times so that for every i, A_i will be a multiple of B_i.\n\nFind the minimum number of times Takahashi will press the buttons.\n\nConstraints\n\nAll input values are integers.\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)\n\n1 ≦ B_i ≦ 10^9(1 ≦ i ≦ N)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint an integer representing the minimum number of times Takahashi will press the buttons.\n\nSample Input 1\n\n3\n3 5\n2 7\n9 4\n\nSample Output 1\n\n7\n\nPress the first button twice, the second button twice and the third button three times.\n\nSample Input 2\n\n7\n3 1\n4 1\n5 9\n2 6\n5 3\n5 8\n9 7\n\nSample Output 2\n\n22", "sample_input": "3\n3 5\n2 7\n9 4\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03821", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are an integer sequence A_1,...,A_N consisting of N terms, and N buttons.\nWhen the i-th (1 ≦ i ≦ N) button is pressed, the values of the i terms from the first through the i-th are all incremented by 1.\n\nThere is also another integer sequence B_1,...,B_N. Takahashi will push the buttons some number of times so that for every i, A_i will be a multiple of B_i.\n\nFind the minimum number of times Takahashi will press the buttons.\n\nConstraints\n\nAll input values are integers.\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)\n\n1 ≦ B_i ≦ 10^9(1 ≦ i ≦ N)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint an integer representing the minimum number of times Takahashi will press the buttons.\n\nSample Input 1\n\n3\n3 5\n2 7\n9 4\n\nSample Output 1\n\n7\n\nPress the first button twice, the second button twice and the third button three times.\n\nSample Input 2\n\n7\n3 1\n4 1\n5 9\n2 6\n5 3\n5 8\n9 7\n\nSample Output 2\n\n22", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 537, "cpu_time_ms": 2109, "memory_kb": 89540}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s657262625", "group_id": "codeNet:p03827", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line = \"\";\n\t\tint strN = 2; // 文字列を何行受け取るか\n\t\tfor (int i = 0; i < strN; i++) {\n\t\t\tline += br.readLine() + \" \";\n\t\t}\n\t\tString[] param = line.split(\" \");\n\t\tAtoZString(param);\n\n\t}\n\n\tstatic void AtoZString(String[] param) { //1行、文字列中のAからZまでの文字列で最大のものの文字数を出力[0]\n\t\tint max = 0;\n\t\tint count = 0;\n\n\t\tfor(int i = 0; i < param[1].length(); i++){\n\t\t\tif(param[1].charAt(i) == 'I'){\n\t\t\t\tcount++;\n\t\t\t\tif(max < count) max = count;\n\t\t\t} else if(param[1].charAt(i) == 'D'){\n\t\t\t\tcount--;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}", "language": "Java", "metadata": {"date": 1497821045, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03827.html", "problem_id": "p03827", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03827/input.txt", "sample_output_relpath": "derived/input_output/data/p03827/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03827/Java/s657262625.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s657262625", "user_id": "u802758605"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line = \"\";\n\t\tint strN = 2; // 文字列を何行受け取るか\n\t\tfor (int i = 0; i < strN; i++) {\n\t\t\tline += br.readLine() + \" \";\n\t\t}\n\t\tString[] param = line.split(\" \");\n\t\tAtoZString(param);\n\n\t}\n\n\tstatic void AtoZString(String[] param) { //1行、文字列中のAからZまでの文字列で最大のものの文字数を出力[0]\n\t\tint max = 0;\n\t\tint count = 0;\n\n\t\tfor(int i = 0; i < param[1].length(); i++){\n\t\t\tif(param[1].charAt(i) == 'I'){\n\t\t\t\tcount++;\n\t\t\t\tif(max < count) max = count;\n\t\t\t} else if(param[1].charAt(i) == 'D'){\n\t\t\t\tcount--;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(max);\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have an integer variable x.\nInitially, x=0.\n\nSome person gave you a string S of length N, and using the string you performed the following operation N times.\nIn the i-th operation, you incremented the value of x by 1 if S_i=I, and decremented the value of x by 1 if S_i=D.\n\nFind the maximum value taken by x during the operations (including before the first operation, and after the last operation).\n\nConstraints\n\n1≤N≤100\n\n|S|=N\n\nNo characters except I and D occur in S.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum value taken by x during the operations.\n\nSample Input 1\n\n5\nIIDID\n\nSample Output 1\n\n2\n\nAfter each operation, the value of x becomes 1, 2, 1, 2 and 1, respectively. Thus, the output should be 2, the maximum value.\n\nSample Input 2\n\n7\nDDIDDII\n\nSample Output 2\n\n0\n\nThe initial value x=0 is the maximum value taken by x, thus the output should be 0.", "sample_input": "5\nIIDID\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03827", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have an integer variable x.\nInitially, x=0.\n\nSome person gave you a string S of length N, and using the string you performed the following operation N times.\nIn the i-th operation, you incremented the value of x by 1 if S_i=I, and decremented the value of x by 1 if S_i=D.\n\nFind the maximum value taken by x during the operations (including before the first operation, and after the last operation).\n\nConstraints\n\n1≤N≤100\n\n|S|=N\n\nNo characters except I and D occur in S.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum value taken by x during the operations.\n\nSample Input 1\n\n5\nIIDID\n\nSample Output 1\n\n2\n\nAfter each operation, the value of x becomes 1, 2, 1, 2 and 1, respectively. Thus, the output should be 2, the maximum value.\n\nSample Input 2\n\n7\nDDIDDII\n\nSample Output 2\n\n0\n\nThe initial value x=0 is the maximum value taken by x, thus the output should be 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 816, "cpu_time_ms": 73, "memory_kb": 21332}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s179065266", "group_id": "codeNet:p03828", "input_text": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tsc.close();\n\n\t\tlong mod = 1000000007;\n\t\tList list = new ArrayList();\n\t\tfor(int i = 2; i <= N; i++) {\n\t\t\tboolean flag = true;\n\t\t\tfor(int j = 2; j < i; j++) {\n\t\t\t\tif(i % j == 0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {\n\t\t\t\tlist.add(i);\n\t\t\t}\n\t\t}\n\n\t\tint[]p = new int[list.size()];\n\t\tfor(int i = 0; i < list.size(); i++) {\n\t\t\tint k = list.get(i);\n\t\t\tfor(int j = 2; j <= N; j++) {\n\t\t\t\tint t = j;\n\t\t\t\twhile(t % k == 0) {\n\t\t\t\t\tt /= k;\n\t\t\t\t\tp[i]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong cnt = 1;\n\t\tfor(int i : p) {\n\t\t\tcnt *= (i + 1);\n\t\t\tcnt %= mod;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n}", "language": "Java", "metadata": {"date": 1540083943, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03828.html", "problem_id": "p03828", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03828/input.txt", "sample_output_relpath": "derived/input_output/data/p03828/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03828/Java/s179065266.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s179065266", "user_id": "u634209474"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tsc.close();\n\n\t\tlong mod = 1000000007;\n\t\tList list = new ArrayList();\n\t\tfor(int i = 2; i <= N; i++) {\n\t\t\tboolean flag = true;\n\t\t\tfor(int j = 2; j < i; j++) {\n\t\t\t\tif(i % j == 0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag) {\n\t\t\t\tlist.add(i);\n\t\t\t}\n\t\t}\n\n\t\tint[]p = new int[list.size()];\n\t\tfor(int i = 0; i < list.size(); i++) {\n\t\t\tint k = list.get(i);\n\t\t\tfor(int j = 2; j <= N; j++) {\n\t\t\t\tint t = j;\n\t\t\t\twhile(t % k == 0) {\n\t\t\t\t\tt /= k;\n\t\t\t\t\tp[i]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlong cnt = 1;\n\t\tfor(int i : p) {\n\t\t\tcnt *= (i + 1);\n\t\t\tcnt %= mod;\n\t\t}\n\t\tSystem.out.println(cnt);\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\nFind the number of the positive divisors of N!, modulo 10^9+7.\n\nConstraints\n\n1≤N≤10^3\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the positive divisors of N!, modulo 10^9+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n4\n\nThere are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n30\n\nSample Input 3\n\n1000\n\nSample Output 3\n\n972926972", "sample_input": "3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03828", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\nFind the number of the positive divisors of N!, modulo 10^9+7.\n\nConstraints\n\n1≤N≤10^3\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the positive divisors of N!, modulo 10^9+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n4\n\nThere are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n30\n\nSample Input 3\n\n1000\n\nSample Output 3\n\n972926972", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 799, "cpu_time_ms": 110, "memory_kb": 21716}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s758833465", "group_id": "codeNet:p03828", "input_text": "import java.util.Scanner;\nimport java.math.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n BigInteger N = new BigInteger(scan.nextLine());\n\n BigInteger F = new BigInteger(\"1\");\n BigInteger I = N;\n BigInteger A = F;\n\n while (I.compareTo(A) != 0){\n F = F.multiply(I);\n I = I.subtract(A);\n }\n \n System.out.println(nbDivisor(F));\n }\n\n public static long nbDivisor(BigInteger n){\n\n long nbDivi = 1;\n BigInteger zero = new BigInteger(\"0\");\n BigInteger un = new BigInteger(\"1\");\n BigInteger compteur = un;\n\n while (compteur.compareTo(n) < 0){\n\n if (n.mod(compteur).compareTo(zero) == 0){\n nbDivi++;\n }\n\n compteur = compteur.add(un);\n }\n return nbDivi;\n }\n\n}\n", "language": "Java", "metadata": {"date": 1484534666, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03828.html", "problem_id": "p03828", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03828/input.txt", "sample_output_relpath": "derived/input_output/data/p03828/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03828/Java/s758833465.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s758833465", "user_id": "u121166526"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.Scanner;\nimport java.math.*;\n\nclass Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n BigInteger N = new BigInteger(scan.nextLine());\n\n BigInteger F = new BigInteger(\"1\");\n BigInteger I = N;\n BigInteger A = F;\n\n while (I.compareTo(A) != 0){\n F = F.multiply(I);\n I = I.subtract(A);\n }\n \n System.out.println(nbDivisor(F));\n }\n\n public static long nbDivisor(BigInteger n){\n\n long nbDivi = 1;\n BigInteger zero = new BigInteger(\"0\");\n BigInteger un = new BigInteger(\"1\");\n BigInteger compteur = un;\n\n while (compteur.compareTo(n) < 0){\n\n if (n.mod(compteur).compareTo(zero) == 0){\n nbDivi++;\n }\n\n compteur = compteur.add(un);\n }\n return nbDivi;\n }\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\nFind the number of the positive divisors of N!, modulo 10^9+7.\n\nConstraints\n\n1≤N≤10^3\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the positive divisors of N!, modulo 10^9+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n4\n\nThere are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n30\n\nSample Input 3\n\n1000\n\nSample Output 3\n\n972926972", "sample_input": "3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03828", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\nFind the number of the positive divisors of N!, modulo 10^9+7.\n\nConstraints\n\n1≤N≤10^3\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the positive divisors of N!, modulo 10^9+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n4\n\nThere are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n30\n\nSample Input 3\n\n1000\n\nSample Output 3\n\n972926972", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 799, "cpu_time_ms": 2107, "memory_kb": 73792}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s671839707", "group_id": "codeNet:p03836", "input_text": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int sx = sc.nextInt();\n int sy = sc.nextInt();\n int tx = sc.nextInt();\n int ty = sc.nextInt();\n String S = \"\";\n for(int i = 0;i < tx - sx;i++){\n S += \"R\";\n }\n for(int j = 0;j < ty - sy;j++){\n S += \"U\";\n }\n for(int k = 0;k < tx - sx;k++){\n S += \"L\";\n }\n for(int l = 0;l < ty - sy;l++){\n S += \"D\";\n }\n S += \"D\";\n for(int m = 0;m < tx - sx + 1;m++){\n S += \"R\";\n }\n for(int n = 0;n < ty - sy + 1;n++){\n S += \"U\";\n }\n S += \"LU\";\n for(int o = 0;o < tx - sx + 1;o++){\n S += \"L\";\n }\n for(int p = 0;p < ty - sy + 1;p++){\n S += \"D\";\n }\n S += \"R\";\n System.out.println(S);\n }\n}\n", "language": "Java", "metadata": {"date": 1571712087, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03836.html", "problem_id": "p03836", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03836/input.txt", "sample_output_relpath": "derived/input_output/data/p03836/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03836/Java/s671839707.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Memory Limit Exceeded", "submission_id": "s671839707", "user_id": "u806768852"}, "prompt_components": {"gold_output": "UURDDLLUUURRDRDDDLLU\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n int sx = sc.nextInt();\n int sy = sc.nextInt();\n int tx = sc.nextInt();\n int ty = sc.nextInt();\n String S = \"\";\n for(int i = 0;i < tx - sx;i++){\n S += \"R\";\n }\n for(int j = 0;j < ty - sy;j++){\n S += \"U\";\n }\n for(int k = 0;k < tx - sx;k++){\n S += \"L\";\n }\n for(int l = 0;l < ty - sy;l++){\n S += \"D\";\n }\n S += \"D\";\n for(int m = 0;m < tx - sx + 1;m++){\n S += \"R\";\n }\n for(int n = 0;n < ty - sy + 1;n++){\n S += \"U\";\n }\n S += \"LU\";\n for(int o = 0;o < tx - sx + 1;o++){\n S += \"L\";\n }\n for(int p = 0;p < ty - sy + 1;p++){\n S += \"D\";\n }\n S += \"R\";\n System.out.println(S);\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "sample_input": "0 0 1 2\n"}, "reference_outputs": ["UURDDLLUUURRDRDDDLLU\n"], "source_document_id": "p03836", "source_text": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 806, "cpu_time_ms": 301, "memory_kb": 271700}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s098329640", "group_id": "codeNet:p03836", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.lang.Character.Subset;\nimport java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.time.temporal.ValueRange;\nimport java.util.AbstractMap;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.Objects;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\n Solver solver = new Solver(in, out);\n solver.solve();\n\n out.close();\n }\n\n // ======================================================================\n static class Solver {\n \tMyInput in;\n \tPrintWriter out;\n public Solver(MyInput in, PrintWriter out) {\n \tthis.in = in;\n \tthis.out = out;\n }\n \n // ======================================================================\n public void solve() {\n \tint sx = ni();\n \tint sy = ni();\n \tint tx = ni();\n \tint ty = ni();\n \tStringBuffer ans = new StringBuffer();\n \tfor (int i = 0; i < tx - sx; i++) \tans.append(\"R\");\n \tfor (int i = 0; i < ty - sy; i++) \tans.append(\"U\");\n \tfor (int i = 0; i < tx - sx; i++) \tans.append(\"L\");\n \tfor (int i = 0; i < tx - sx; i++) \tans.append(\"D\");\n \tans.append(\"D\");\n \tfor (int i = 0; i < tx - sx + 1; i++) \tans.append(\"R\");\n \tfor (int i = 0; i < ty - sy + 1; i++) \tans.append(\"U\");\n \tans.append(\"L\");\tans.append(\"U\");\n \tfor (int i = 0; i < tx - sx + 1; i++)\tans.append(\"L\");\n \tfor (int i = 0; i < tx - sx + 1; i++) \tans.append(\"D\");\n \tans.append(\"R\");\n \tprn(ans.toString());\n }\n // -----------------------------------------\n // Integer のキーに対して、カウントを管理する（カウントを足したり、引いたりする）\n static class MapCounter {\n \tprivate Map map = new HashMap<>();\n \tpublic MapCounter() {}\n \t// キーのカウントに値を足す\n \tpublic void add(int key) {\n \t\tadd(key, 1);\n \t}\n \tpublic void add(int key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)cnt);\n \t\t} else {\n \t\t\tmap.put(key, val + cnt);\n \t\t}\n \t}\n \t// キーのカウントから値を引く\n \tpublic void sub(int key) {\n \t\tsub(key, 1);\n \t}\n \tpublic void sub(int key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)-cnt);\n \t\t} else {\n \t\t\tmap.put(key, val - cnt);\n \t\t}\n \t}\n \t// キーのカウントを取得する（なければ　ＮＵＬＬを返す）\n \tpublic Long getCountwithNull(int key) {\n \t\treturn map.get(key);\n \t}\n \t// キーのカウントを取得する（なければ　０　を返す）\n \tpublic Long getCount(int key) {\n \t\tLong val = map.get(key);\n \t\tif(val == null)\t\treturn 0L;\n \t\telse \t\t\t\treturn val;\n \t}\n \tpublic Set getKey() {\n \t\treturn map.keySet();\n \t}\n \t// 登録されているキーの数を返す\n \tpublic int getKeyCount() {\n \t\treturn map.keySet().size();\n \t}\n }\n // -----------------------------------------\n // 配列のバイナリーサーチ　１\n boolean isRightMin(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] >= key)\t\treturn true;\t\t// 以上\n \t else if (!f && a[index] > key)\treturn true;\t\t// より大きい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以上（f=true)または、より大きく（f=false)、一番小さい値を返す\n \tint binarySearchRightMin(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isRightMin(a, f, mid, key))\tok = mid;\t// 下半分を対象とする\n \t else \t\t\t\t\t\t\tng = mid;\t// 上半分を対象とする\n \t }\t\n \t return ok;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n // -----------------------------------------\n // 配列のバイナリーサーチ　２\n boolean isLeftMax(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] <= key)\t\treturn true;\t\t// 以下\n \t else if (!f && a[index] < key)\treturn true;\t\t// より小さい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以下（f=true)または、より小さい（f=false)、一番大きい値を返す\n \tint binarySearchLeftMax(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isLeftMax(a, f, mid, key))\tng = mid;\t// 上半分を対象とする\n \t else \t\t\t\t\t\t\tok = mid;\t// 下半分を対象とする\n \t }\t\n \t return ng;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n \t\n // -----------------------------------------\n \t// オイラーツアー（部分木対応）\n \tstatic class EulerTour {\n \t\tGraph g;\n \t\tList euler_tour = new ArrayList<>();\n \t\tint[] begin, end;\n \t\tint k = 0, root = 0;\n \t\t\n \t\tvoid dfs(int v,int p, PrintWriter out) {\n \t\t\tout.println(\"v = \" + v + \" p = \" + p);\n \t\t\tbegin[v] = k;\n \t\t\teuler_tour.add(v);\n \t\t\tk++;\n \t\t\tif(!g.contains(v)) {\n \t\t\t\treturn;\n \t\t\t}\n \t\t\tfor(int i : g.get(v)) {\n \t\t\t\tif(i != p) {\n \t\t\t\t\tdfs(i, v, out);\n \t\t\t\t\teuler_tour.add(v);\n \t\t\t\t\tk++;\n \t\t\t\t}\n \t\t\t}\n \t\t\tend[v]=k;\n \t\t}\n \t\t// 初期化\n \t\tpublic void init(int p_cnt, int root, Graph g, PrintWriter out) {\n \t\t\tbegin = new int[p_cnt + 1];\n \t\t\tend = new int[p_cnt + 1];\n \t\t\tthis.root = root;\n \t\t\tthis.g = g;\n \t\t\tdfs(root, -1, out);\n \t\t}\n \t\t// 部分木の頂点を渡すと、オイラーツアーの部分木を返す\n \t\tpublic List getPartTour(int v) {\n \t\t\treturn euler_tour.subList(begin[v], end[v]);\n \t\t}\n \t\t// 部分木の頂点を渡すと、頂点のリストを返す\n \t\tpublic List getPartList(int v) {\n \t\t\tSet set = new TreeSet<>();\n\t\t\t\tset.addAll(getPartTour(v));\n\t\t\t\tList ans = new ArrayList<>();\n\t\t\t\tfor(Integer p : set) {\n\t\t\t\t\tans.add(p);\n\t\t\t\t}\n\t\t\t\treturn ans;\n \t\t}\n \t}\n \t\n // -----------------------------------------\n // グラフのリンクリスト\n static class Graph {\n \t// 頂点に紐づく頂点のリスト\n private Map> data = new HashMap>();\n// // 全ての頂点のセット\n// private Set point = new TreeSet<>();\n // 頂点と頂点の繋がりを追加する\n void add(int from, int to) {\n \tList list = data.get(from);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(from, list);\n \t}\n \tlist.add(to);\n// \tpoint.add(key);\n// \tpoint.add(value);\n }\n // 指定された頂点に紐づく、頂点のリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList list = data.get(key_1);\n \tif(list == null)\treturn false;\n \telse \t\t\t\treturn list.contains(key_2);\n }\n // 指定された頂点から、すべての頂点への距離を返す\n List distList(int key) {\n \tList dist = new ArrayList<>();\t\t// 頂点と距離のペアのリスト\n \tSet mark = new HashSet<>();\t// 処理したら入れる\n \t\t\tStack stack = new Stack<>();\t\t// スタックの宣言\n \t\t\tstack.push(new PP(key, 0));\t\t\t\t// スタートをスタックに保存\n \t\t\twhile(!stack.isEmpty()) {\n \t\t\t\tPP wk = stack.pop();\t\t\t\t// スタックから次の頂点を取得\n \t\t\t\tint pp = wk.getKey();\n \t\t\t\tint dd = wk.getVal();\n \t\t\t\tmark.add(pp);\t\t\t\t\t\t// 通過マーク\n \t\t\tdist.add(new PP(pp, dd));\t\t\t// 距離を登録\n \t\t\t\tList list = get(pp);\t\t// つながっている頂点のリストを取得\n \t\t\t\tfor(int next : list) {\n \t\t\t\t\tif(mark.contains(next))\tcontinue;\n \t\t\t\t\tstack.push(new PP(next, dd + 1));\n \t\t\t\t}\n \t\t\t}\n \t\t\treturn dist;\n }\n // ダンプ\n void dump(PrintWriter out) {\n \tfor(int key : data.keySet()) {\n \t\tout.print(key + \" : \");\n \t\tfor(int val : data.get(key)) {\n \t\t\tout.print(val + \" \");\n \t\t}\n \t\tout.println(\"\");\n \t}\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト\n static class GraphWith {\n \t// キーに紐づくリストに、頂点番号と重さのペアを持つ\n private Map> data = new HashMap>();\n // 指定された頂点に紐づく、頂点と重さのペアを追加する\n void add(int key, PP p) {\n \tList list = data.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(key, list);\n \t}\n \tlist.add(p);\n }\n // 頂点に紐づく、頂点と重さのペアのリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // グラフの存在チェック（重さは関係しない）\n // 頂点　key と 頂点　value がつながっていれば　true を返す\n boolean contains(int key, int value) {\n \tList list = data.get(key);\n \tif(list == null)\treturn false;\n \tboolean ans = false;\n \tfor(PP p : list) {\n \t\tif(p.getKey() == value) {\n \t\t\tans = true;\n \t\t\tbreak;\n \t\t}\n \t}\n \treturn ans;\n }\n }\n // -----------------------------------------\n // グラフのリンクリスト(Long)\n static class GraphLong {\n private Map> G = new HashMap>();\n void add(long key, long value) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(value);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト(Long)\n static class GraphLongWith {\n private Map> G = new HashMap>();\n void add(long key, PPL p) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(p);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n\n void prn(String s) {\n \tout.println(s);\n }\n void prn(int i) {\n \tout.println(i);\n }\n void prn(long i) {\n \tout.println(i);\n }\n void prr(String s) {\n \tout.print(s);\n }\n int ni() {\n \treturn in.nextInt();\n }\n long nl() {\n \treturn in.nextLong();\n }\n double nd() {\n \treturn in.nextDouble();\n }\n String ns() {\n \treturn in.nextString();\n }\n int[] ndi(int n) {\n \tint[] ans = new int[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ni();\n \t}\n \treturn ans;\n }\n long[] ndl(int n) {\n \tlong[] ans = new long[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nl();\n \t}\n \treturn ans;\n }\n double[] ndd(int n) {\n \tdouble[] ans = new double[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nd();\n \t}\n \treturn ans;\n }\n String[] nds(int n) {\n \tString[] ans = new String[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ns();\n \t}\n \treturn ans;\n }\n int[][] nddi(int n, int m) {\n \tint[][] ans = new int[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = ni();\n \t}\n \t}\n \treturn ans;\n }\n long[][] nddl(int n, int m) {\n \tlong[][] ans = new long[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = nl();\n \t}\n \t}\n \treturn ans;\n }\n }\n static class PP{\n \tpublic int key, val;\n \tpublic PP(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(int key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(int val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPL {\n \tpublic long key, val;\n \tpublic PPL(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPDL {\n \tpublic long key;\n \tpublic long[] val;\n \tpublic PPDL(long key, long[] val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long[] getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long[] val) {\n\t\t\tthis.val = val;\n\t\t}\n\t\tpublic void dump(PrintWriter out) {\n\t\t\tout.print(\"key = \" + key + \" val \");\n\t\t\tfor(int i=0; i < val.length; i++) {\n\t\t\t\tout.print(\"[\" + val[i] + \"] \");\n\t\t\t}\n\t\t\tout.println(\"\");\n\t\t}\n }\n // HashMap のキーに使う\n static final class PPKEY{\n \tprivate final int key, val;\n \tpublic PPKEY(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // HashMap のキーに使う\n static final class PPLKEY{\n \tprivate final long key, val;\n \tpublic PPLKEY(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // ======================================================================\n static class Pair extends AbstractMap.SimpleEntry {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n }\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public double nextDouble() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n double ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n int cnt = 0;\n for (; i < len; i++) {\n \tif(str[i] == '.') {\n \t\tcnt = 10;\n \t\tcontinue;\n \t}\n \tif(cnt == 0) {\n \t\tret = ret * 10 + str[i] - '0';\n \t} else {\n \t\tret = ret + ((double)(str[i] - '0') / cnt);\n \t\tcnt *= 10;\n \t}\n }\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n\n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1567054464, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03836.html", "problem_id": "p03836", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03836/input.txt", "sample_output_relpath": "derived/input_output/data/p03836/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03836/Java/s098329640.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s098329640", "user_id": "u181039779"}, "prompt_components": {"gold_output": "UURDDLLUUURRDRDDDLLU\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.lang.Character.Subset;\nimport java.math.BigDecimal;\nimport java.text.DecimalFormat;\nimport java.time.temporal.ValueRange;\nimport java.util.AbstractMap;\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Comparator;\nimport java.util.Deque;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Map.Entry;\nimport java.util.Objects;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.Stack;\nimport java.util.TreeMap;\nimport java.util.TreeSet;\n\nimport static java.util.Comparator.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n MyInput in = new MyInput(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\n Solver solver = new Solver(in, out);\n solver.solve();\n\n out.close();\n }\n\n // ======================================================================\n static class Solver {\n \tMyInput in;\n \tPrintWriter out;\n public Solver(MyInput in, PrintWriter out) {\n \tthis.in = in;\n \tthis.out = out;\n }\n \n // ======================================================================\n public void solve() {\n \tint sx = ni();\n \tint sy = ni();\n \tint tx = ni();\n \tint ty = ni();\n \tStringBuffer ans = new StringBuffer();\n \tfor (int i = 0; i < tx - sx; i++) \tans.append(\"R\");\n \tfor (int i = 0; i < ty - sy; i++) \tans.append(\"U\");\n \tfor (int i = 0; i < tx - sx; i++) \tans.append(\"L\");\n \tfor (int i = 0; i < tx - sx; i++) \tans.append(\"D\");\n \tans.append(\"D\");\n \tfor (int i = 0; i < tx - sx + 1; i++) \tans.append(\"R\");\n \tfor (int i = 0; i < ty - sy + 1; i++) \tans.append(\"U\");\n \tans.append(\"L\");\tans.append(\"U\");\n \tfor (int i = 0; i < tx - sx + 1; i++)\tans.append(\"L\");\n \tfor (int i = 0; i < tx - sx + 1; i++) \tans.append(\"D\");\n \tans.append(\"R\");\n \tprn(ans.toString());\n }\n // -----------------------------------------\n // Integer のキーに対して、カウントを管理する（カウントを足したり、引いたりする）\n static class MapCounter {\n \tprivate Map map = new HashMap<>();\n \tpublic MapCounter() {}\n \t// キーのカウントに値を足す\n \tpublic void add(int key) {\n \t\tadd(key, 1);\n \t}\n \tpublic void add(int key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)cnt);\n \t\t} else {\n \t\t\tmap.put(key, val + cnt);\n \t\t}\n \t}\n \t// キーの��ウントから値を引く\n \tpublic void sub(int key) {\n \t\tsub(key, 1);\n \t}\n \tpublic void sub(int key, int cnt) {\n \t\tLong val = map.get(key);\n \t\tif(val == null) {\n \t\t\tmap.put(key, (long)-cnt);\n \t\t} else {\n \t\t\tmap.put(key, val - cnt);\n \t\t}\n \t}\n \t// キーのカウントを取得する（なければ　ＮＵＬＬを返す）\n \tpublic Long getCountwithNull(int key) {\n \t\treturn map.get(key);\n \t}\n \t// キーのカウントを取得する（なければ　０　を返す）\n \tpublic Long getCount(int key) {\n \t\tLong val = map.get(key);\n \t\tif(val == null)\t\treturn 0L;\n \t\telse \t\t\t\treturn val;\n \t}\n \tpublic Set getKey() {\n \t\treturn map.keySet();\n \t}\n \t// 登録されているキーの数を返す\n \tpublic int getKeyCount() {\n \t\treturn map.keySet().size();\n \t}\n }\n // -----------------------------------------\n // 配列のバイナリーサーチ　１\n boolean isRightMin(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] >= key)\t\treturn true;\t\t// 以上\n \t else if (!f && a[index] > key)\treturn true;\t\t// より大きい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以上（f=true)または、より大きく（f=false)、一番小さい値を返す\n \tint binarySearchRightMin(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isRightMin(a, f, mid, key))\tok = mid;\t// 下半分を対象とする\n \t else \t\t\t\t\t\t\tng = mid;\t// 上半分を対象とする\n \t }\t\n \t return ok;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n // -----------------------------------------\n // 配列のバイナリーサーチ　２\n boolean isLeftMax(int[] a, boolean f, int index, int key) {\n \t if (f && a[index] <= key)\t\treturn true;\t\t// 以下\n \t else if (!f && a[index] < key)\treturn true;\t\t// より小さい\n \t else \t\t\t\t\t\t\treturn false;\t\n \t}\n \t// 配列 a の中で key 以下（f=true)または、より小さい（f=false)、一番大きい値を返す\n \tint binarySearchLeftMax(int[] a, boolean f, int key) {\t\n \t int ng = -1; \t\t\t\t//「index = 0」が条件を満たすこともあるので、初期値は -1\t\n \t int ok = (int)a.length; \t// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()\t\n \t\t\n \t /* ok と ng のどちらが大きいかわからないことを考慮 */\t\n \t while (Math.abs(ok - ng) > 1) {\t\n \t int mid = (ok + ng) / 2;\t\n \t\t\n \t if (isLeftMax(a, f, mid, key))\tng = mid;\t// 上半分を対象とする\n \t else \t\t\t\t\t\t\tok = mid;\t// 下半分を対象とする\n \t }\t\n \t return ng;\t\t// ←　ここで返すのは　isOK() が true の時にセットする方（ok / ng)\n \t}\n \t\n // -----------------------------------------\n \t// オイラーツアー（部分木対応）\n \tstatic class EulerTour {\n \t\tGraph g;\n \t\tList euler_tour = new ArrayList<>();\n \t\tint[] begin, end;\n \t\tint k = 0, root = 0;\n \t\t\n \t\tvoid dfs(int v,int p, PrintWriter out) {\n \t\t\tout.println(\"v = \" + v + \" p = \" + p);\n \t\t\tbegin[v] = k;\n \t\t\teuler_tour.add(v);\n \t\t\tk++;\n \t\t\tif(!g.contains(v)) {\n \t\t\t\treturn;\n \t\t\t}\n \t\t\tfor(int i : g.get(v)) {\n \t\t\t\tif(i != p) {\n \t\t\t\t\tdfs(i, v, out);\n \t\t\t\t\teuler_tour.add(v);\n \t\t\t\t\tk++;\n \t\t\t\t}\n \t\t\t}\n \t\t\tend[v]=k;\n \t\t}\n \t\t// 初期化\n \t\tpublic void init(int p_cnt, int root, Graph g, PrintWriter out) {\n \t\t\tbegin = new int[p_cnt + 1];\n \t\t\tend = new int[p_cnt + 1];\n \t\t\tthis.root = root;\n \t\t\tthis.g = g;\n \t\t\tdfs(root, -1, out);\n \t\t}\n \t\t// 部分木の頂点を渡すと、オイラーツアーの部分木を返す\n \t\tpublic List getPartTour(int v) {\n \t\t\treturn euler_tour.subList(begin[v], end[v]);\n \t\t}\n \t\t// 部分木の頂点を渡すと、頂点のリストを返す\n \t\tpublic List getPartList(int v) {\n \t\t\tSet set = new TreeSet<>();\n\t\t\t\tset.addAll(getPartTour(v));\n\t\t\t\tList ans = new ArrayList<>();\n\t\t\t\tfor(Integer p : set) {\n\t\t\t\t\tans.add(p);\n\t\t\t\t}\n\t\t\t\treturn ans;\n \t\t}\n \t}\n \t\n // -----------------------------------------\n // グラフのリンクリスト\n static class Graph {\n \t// 頂点に紐づく頂点のリスト\n private Map> data = new HashMap>();\n// // 全ての頂点のセット\n// private Set point = new TreeSet<>();\n // 頂点と頂点の繋がりを追加する\n void add(int from, int to) {\n \tList list = data.get(from);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(from, list);\n \t}\n \tlist.add(to);\n// \tpoint.add(key);\n// \tpoint.add(value);\n }\n // 指定された頂点に紐づく、頂点のリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // 頂点 key が登録されているか？\n boolean contains(int key) {\n \treturn data.containsKey(key);\n }\n \n //　頂点のセットを返す\n Set keySet() {\n \treturn data.keySet();\n }\n // 頂点　key_1 と 頂点　key_2 がつながっていれば　true を返す\n boolean isConnect(int key_1, int key_2) {\n \tList list = data.get(key_1);\n \tif(list == null)\treturn false;\n \telse \t\t\t\treturn list.contains(key_2);\n }\n // 指定された頂点から、すべての頂点への距離を返す\n List distList(int key) {\n \tList dist = new ArrayList<>();\t\t// 頂点と距離のペアのリスト\n \tSet mark = new HashSet<>();\t// 処理したら入れる\n \t\t\tStack stack = new Stack<>();\t\t// スタックの宣言\n \t\t\tstack.push(new PP(key, 0));\t\t\t\t// スタートをスタックに保存\n \t\t\twhile(!stack.isEmpty()) {\n \t\t\t\tPP wk = stack.pop();\t\t\t\t// スタックから次の頂点を取得\n \t\t\t\tint pp = wk.getKey();\n \t\t\t\tint dd = wk.getVal();\n \t\t\t\tmark.add(pp);\t\t\t\t\t\t// 通過マーク\n \t\t\tdist.add(new PP(pp, dd));\t\t\t// 距離を登録\n \t\t\t\tList list = get(pp);\t\t// つながっている頂点のリストを取得\n \t\t\t\tfor(int next : list) {\n \t\t\t\t\tif(mark.contains(next))\tcontinue;\n \t\t\t\t\tstack.push(new PP(next, dd + 1));\n \t\t\t\t}\n \t\t\t}\n \t\t\treturn dist;\n }\n // ダンプ\n void dump(PrintWriter out) {\n \tfor(int key : data.keySet()) {\n \t\tout.print(key + \" : \");\n \t\tfor(int val : data.get(key)) {\n \t\t\tout.print(val + \" \");\n \t\t}\n \t\tout.println(\"\");\n \t}\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト\n static class GraphWith {\n \t// キーに紐づくリストに、頂点番号と重さのペアを持つ\n private Map> data = new HashMap>();\n // 指定された頂点に紐づく、頂点と重さのペアを追加する\n void add(int key, PP p) {\n \tList list = data.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tdata.put(key, list);\n \t}\n \tlist.add(p);\n }\n // 頂点に紐づく、頂点と重さのペアのリストを返す\n List get(int key) {\n \treturn data.get(key);\n }\n // グラフの存在チェック（重さは関係しない）\n // 頂点　key と 頂点　value がつながっていれば　true を返す\n boolean contains(int key, int value) {\n \tList list = data.get(key);\n \tif(list == null)\treturn false;\n \tboolean ans = false;\n \tfor(PP p : list) {\n \t\tif(p.getKey() == value) {\n \t\t\tans = true;\n \t\t\tbreak;\n \t\t}\n \t}\n \treturn ans;\n }\n }\n // -----------------------------------------\n // グラフのリンクリスト(Long)\n static class GraphLong {\n private Map> G = new HashMap>();\n void add(long key, long value) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(value);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n // 重さを持ったグラフのリンクリスト(Long)\n static class GraphLongWith {\n private Map> G = new HashMap>();\n void add(long key, PPL p) {\n \tList list = G.get(key);\n \tif(list == null) {\n \t\tlist = new ArrayList();\n \t\tG.put(key, list);\n \t}\n \tlist.add(p);\n }\n List get(long key) {\n \treturn G.get(key);\n }\n }\n // -----------------------------------------\n\n void prn(String s) {\n \tout.println(s);\n }\n void prn(int i) {\n \tout.println(i);\n }\n void prn(long i) {\n \tout.println(i);\n }\n void prr(String s) {\n \tout.print(s);\n }\n int ni() {\n \treturn in.nextInt();\n }\n long nl() {\n \treturn in.nextLong();\n }\n double nd() {\n \treturn in.nextDouble();\n }\n String ns() {\n \treturn in.nextString();\n }\n int[] ndi(int n) {\n \tint[] ans = new int[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ni();\n \t}\n \treturn ans;\n }\n long[] ndl(int n) {\n \tlong[] ans = new long[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nl();\n \t}\n \treturn ans;\n }\n double[] ndd(int n) {\n \tdouble[] ans = new double[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = nd();\n \t}\n \treturn ans;\n }\n String[] nds(int n) {\n \tString[] ans = new String[n];\n \tfor(int i=0; i < n; i++) {\n \t\tans[i] = ns();\n \t}\n \treturn ans;\n }\n int[][] nddi(int n, int m) {\n \tint[][] ans = new int[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = ni();\n \t}\n \t}\n \treturn ans;\n }\n long[][] nddl(int n, int m) {\n \tlong[][] ans = new long[n][m];\n \tfor(int i=0; i < n; i++) {\n \tfor(int j=0; j < m; j++) {\n \t\tans[i][j] = nl();\n \t}\n \t}\n \treturn ans;\n }\n }\n static class PP{\n \tpublic int key, val;\n \tpublic PP(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(int key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(int val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPL {\n \tpublic long key, val;\n \tpublic PPL(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long val) {\n\t\t\tthis.val = val;\n\t\t}\n }\n static class PPDL {\n \tpublic long key;\n \tpublic long[] val;\n \tpublic PPDL(long key, long[] val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic void setKey(long key) {\n\t\t\tthis.key = key;\n\t\t}\n\t\tpublic long[] getVal() {\n\t\t\treturn val;\n\t\t}\n\t\tpublic void setVal(long[] val) {\n\t\t\tthis.val = val;\n\t\t}\n\t\tpublic void dump(PrintWriter out) {\n\t\t\tout.print(\"key = \" + key + \" val \");\n\t\t\tfor(int i=0; i < val.length; i++) {\n\t\t\t\tout.print(\"[\" + val[i] + \"] \");\n\t\t\t}\n\t\t\tout.println(\"\");\n\t\t}\n }\n // HashMap のキーに使う\n static final class PPKEY{\n \tprivate final int key, val;\n \tpublic PPKEY(int key, int val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic int getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic int getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // HashMap のキーに使う\n static final class PPLKEY{\n \tprivate final long key, val;\n \tpublic PPLKEY(long key, long val) {\n \t\tthis.key = key;\n \t\tthis.val = val;\n \t}\n\t\tpublic long getKey() {\n\t\t\treturn key;\n\t\t}\n\t\tpublic long getVal() {\n\t\t\treturn val;\n\t\t}\n\t @Override\n\t public boolean equals(Object obj) {\n\t if (obj instanceof PPKEY) {\n\t \tPPKEY dest = (PPKEY) obj;\n\t return this.key == dest.key && this.val == dest.val;\n\t } else {\n\t return false;\n\t }\n\t }\n\t @Override\n\t public int hashCode() {\n\t return Objects.hash(key, val);\n\t }\n }\n // ======================================================================\n static class Pair extends AbstractMap.SimpleEntry {\n /** serialVersionUID. */\n private static final long serialVersionUID = 6411527075103472113L;\n\n public Pair(final K key, final V value) {\n super(key, value);\n }\n }\n static class MyInput {\n private final BufferedReader in;\n private static int pos;\n private static int readLen;\n private static final char[] buffer = new char[1024 * 8];\n private static char[] str = new char[500 * 8 * 2];\n private static boolean[] isDigit = new boolean[256];\n private static boolean[] isSpace = new boolean[256];\n private static boolean[] isLineSep = new boolean[256];\n\n static {\n for (int i = 0; i < 10; i++) {\n isDigit['0' + i] = true;\n }\n isDigit['-'] = true;\n isSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n isLineSep['\\r'] = isLineSep['\\n'] = true;\n }\n\n public MyInput(InputStream is) {\n in = new BufferedReader(new InputStreamReader(is));\n }\n\n public int read() {\n if (pos >= readLen) {\n pos = 0;\n try {\n readLen = in.read(buffer);\n } catch (IOException e) {\n throw new RuntimeException();\n }\n if (readLen <= 0) {\n throw new MyInput.EndOfFileRuntimeException();\n }\n }\n return buffer[pos++];\n }\n\n public int nextInt() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n int ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public long nextLong() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n long ret = 0L;\n if (str[0] == '-') {\n i = 1;\n }\n for (; i < len; i++) ret = ret * 10 + str[i] - '0';\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public double nextDouble() {\n int len = 0;\n str[len++] = nextChar();\n len = reads(len, isSpace);\n int i = 0;\n double ret = 0;\n if (str[0] == '-') {\n i = 1;\n }\n int cnt = 0;\n for (; i < len; i++) {\n \tif(str[i] == '.') {\n \t\tcnt = 10;\n \t\tcontinue;\n \t}\n \tif(cnt == 0) {\n \t\tret = ret * 10 + str[i] - '0';\n \t} else {\n \t\tret = ret + ((double)(str[i] - '0') / cnt);\n \t\tcnt *= 10;\n \t}\n }\n if (str[0] == '-') {\n ret = -ret;\n }\n return ret;\n }\n\n public String nextString() {\n \tString ret = new String(nextDChar()).trim();\n return ret;\n }\n\n public char[] nextDChar() {\n int len = 0;\n len = reads(len, isSpace);\n char[] ret = new char[len + 1];\n for (int i=0; i < len; i++)\t\tret[i] = str[i];\n ret[len] = 0x00;\n return ret;\n }\n\n public char nextChar() {\n while (true) {\n final int c = read();\n if (!isSpace[c]) {\n return (char) c;\n }\n }\n }\n\n int reads(int len, boolean[] accept) {\n try {\n while (true) {\n final int c = read();\n if (accept[c]) {\n break;\n }\n if (str.length == len) {\n char[] rep = new char[str.length * 3 / 2];\n System.arraycopy(str, 0, rep, 0, str.length);\n str = rep;\n }\n str[len++] = (char) c;\n }\n } catch (MyInput.EndOfFileRuntimeException e) {\n }\n return len;\n }\n\n static class EndOfFileRuntimeException extends RuntimeException {\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "sample_input": "0 0 1 2\n"}, "reference_outputs": ["UURDDLLUUURRDRDDDLLU\n"], "source_document_id": "p03836", "source_text": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 21919, "cpu_time_ms": 83, "memory_kb": 21460}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s340921275", "group_id": "codeNet:p03837", "input_text": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Main {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n void solve()\n {\n int n = ni();\n int m = ni();\n int[][] a = new int[n][n];\n int[][] b = new int[n][n];\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n a[i][j] = 10000000;\n }\n }\n for(int i = 0; i < m; i++){\n int v = ni()-1;\n int w = ni()-1;\n int x = ni();\n a[v][w] = x;\n a[w][v] = x;\n b[v][w] = x;\n b[w][v] = x;\n }\n\n for (int k = 0; k < n; k++) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (a[i][j] > a[i][k] + a[k][j]) {\n a[i][j] = a[i][k] + a[k][j];\n }\n }\n }\n }\n // for(int i = 0; i < n; i++){\n // for(int j = 0; j < n; j++){\n // out.print(a[i][j]);\n // }\n // out.println();\n // }\n int[][] c = new int[n][n];\n for (int k = 0; k < n; k++) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (a[i][j] == a[i][k] + a[k][j]) {\n c[i][k] = 1;\n c[k][i] = 1;\n c[k][j] = 1;\n c[j][k] = 1;\n }\n }\n }\n }\n int res = 0;\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n if(i==j) continue;\n else{\n if(c[i][j]==0 && b[i][j] > 0 && (i == j+1 || i == j-1)) res++;\n }\n }\n }\n out.println(res/2);\n\n\n\n }\n\n private static void dp(){\n\n }\n \n void run() throws Exception\n {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n \n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }\n \n public static void main(String[] args) throws Exception { new Main().run(); }\n \n private byte[] inbuf = new byte[1024];\n private int lenbuf = 0, ptrbuf = 0;\n \n private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n \n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n \n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n \n private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b) && b != ' ')){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n \n private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n \n private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n \n private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n \n private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n \n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n \n private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n \n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n \n private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }\n}\n", "language": "Java", "metadata": {"date": 1508373526, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03837.html", "problem_id": "p03837", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03837/input.txt", "sample_output_relpath": "derived/input_output/data/p03837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03837/Java/s340921275.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s340921275", "user_id": "u675503966"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Main {\n InputStream is;\n PrintWriter out;\n String INPUT = \"\";\n \n void solve()\n {\n int n = ni();\n int m = ni();\n int[][] a = new int[n][n];\n int[][] b = new int[n][n];\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n a[i][j] = 10000000;\n }\n }\n for(int i = 0; i < m; i++){\n int v = ni()-1;\n int w = ni()-1;\n int x = ni();\n a[v][w] = x;\n a[w][v] = x;\n b[v][w] = x;\n b[w][v] = x;\n }\n\n for (int k = 0; k < n; k++) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (a[i][j] > a[i][k] + a[k][j]) {\n a[i][j] = a[i][k] + a[k][j];\n }\n }\n }\n }\n // for(int i = 0; i < n; i++){\n // for(int j = 0; j < n; j++){\n // out.print(a[i][j]);\n // }\n // out.println();\n // }\n int[][] c = new int[n][n];\n for (int k = 0; k < n; k++) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (a[i][j] == a[i][k] + a[k][j]) {\n c[i][k] = 1;\n c[k][i] = 1;\n c[k][j] = 1;\n c[j][k] = 1;\n }\n }\n }\n }\n int res = 0;\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n if(i==j) continue;\n else{\n if(c[i][j]==0 && b[i][j] > 0 && (i == j+1 || i == j-1)) res++;\n }\n }\n }\n out.println(res/2);\n\n\n\n }\n\n private static void dp(){\n\n }\n \n void run() throws Exception\n {\n is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n out = new PrintWriter(System.out);\n \n long s = System.currentTimeMillis();\n solve();\n out.flush();\n if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+\"ms\");\n }\n \n public static void main(String[] args) throws Exception { new Main().run(); }\n \n private byte[] inbuf = new byte[1024];\n private int lenbuf = 0, ptrbuf = 0;\n \n private int readByte()\n {\n if(lenbuf == -1)throw new InputMismatchException();\n if(ptrbuf >= lenbuf){\n ptrbuf = 0;\n try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n if(lenbuf <= 0)return -1;\n }\n return inbuf[ptrbuf++];\n }\n \n private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n \n private double nd() { return Double.parseDouble(ns()); }\n private char nc() { return (char)skip(); }\n \n private String ns()\n {\n int b = skip();\n StringBuilder sb = new StringBuilder();\n while(!(isSpaceChar(b) && b != ' ')){\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n \n private char[] ns(int n)\n {\n char[] buf = new char[n];\n int b = skip(), p = 0;\n while(p < n && !(isSpaceChar(b))){\n buf[p++] = (char)b;\n b = readByte();\n }\n return n == p ? buf : Arrays.copyOf(buf, p);\n }\n \n private char[][] nm(int n, int m)\n {\n char[][] map = new char[n][];\n for(int i = 0;i < n;i++)map[i] = ns(m);\n return map;\n }\n \n private int[] na(int n)\n {\n int[] a = new int[n];\n for(int i = 0;i < n;i++)a[i] = ni();\n return a;\n }\n \n private int ni()\n {\n int num = 0, b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n \n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n \n private long nl()\n {\n long num = 0;\n int b;\n boolean minus = false;\n while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n if(b == '-'){\n minus = true;\n b = readByte();\n }\n \n while(true){\n if(b >= '0' && b <= '9'){\n num = num * 10 + (b - '0');\n }else{\n return minus ? -num : num;\n }\n b = readByte();\n }\n }\n \n private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n//\tprivate static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }\n\tprivate static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate static double nd() { return Double.parseDouble(ns()); }\n\tprivate static char nc() { return (char)skip(); }\n\t\n\tprivate static String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate static char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate static char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate static int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate static int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "language": "Java", "metadata": {"date": 1482718711, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03840.html", "problem_id": "p03840", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03840/input.txt", "sample_output_relpath": "derived/input_output/data/p03840/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03840/Java/s449653024.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s449653024", "user_id": "u119714109"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Main {\n\tstatic InputStream is;\n\tstatic PrintWriter out;\n\tstatic String INPUT = \"\";\n\t\n\tstatic void solve()\n\t{\n\t\tlong I = ni(), O = ni(), T = ni(), J = ni(), L = ni(), S = ni(), Z = ni();\n\t\tlong ret = 0;\n\t\tret += J/2*4+L/2*4;\n\t\tret += O*2;\n\t\tret += I/2*4;\n\t\tout.println(ret/2);\n\t}\n\t\n\tpublic static void main(String[] args) throws Exception\n\t{\n\t\tlong S = System.currentTimeMillis();\n\t\tis = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n\t\tout = new PrintWriter(System.out);\n\t\t\n\t\tsolve();\n\t\tout.flush();\n\t\tlong G = System.currentTimeMillis();\n\t\ttr(G-S+\"ms\");\n\t}\n\t\n\tprivate static boolean eof()\n\t{\n\t\tif(lenbuf == -1)return true;\n\t\tint lptr = ptrbuf;\n\t\twhile(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n\t\t\n\t\ttry {\n\t\t\tis.mark(1000);\n\t\t\twhile(true){\n\t\t\t\tint b = is.read();\n\t\t\t\tif(b == -1){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn true;\n\t\t\t\t}else if(!isSpaceChar(b)){\n\t\t\t\t\tis.reset();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t\n\tprivate static byte[] inbuf = new byte[1024];\n\tstatic int lenbuf = 0, ptrbuf = 0;\n\t\n\tprivate static int readByte()\n\t{\n\t\tif(lenbuf == -1)throw new InputMismatchException();\n\t\tif(ptrbuf >= lenbuf){\n\t\t\tptrbuf = 0;\n\t\t\ttry { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n\t\t\tif(lenbuf <= 0)return -1;\n\t\t}\n\t\treturn inbuf[ptrbuf++];\n\t}\n\t\n\tprivate static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }\n//\tprivate static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }\n\tprivate static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }\n\t\n\tprivate static double nd() { return Double.parseDouble(ns()); }\n\tprivate static char nc() { return (char)skip(); }\n\t\n\tprivate static String ns()\n\t{\n\t\tint b = skip();\n\t\tStringBuilder sb = new StringBuilder();\n\t\twhile(!(isSpaceChar(b))){\n\t\t\tsb.appendCodePoint(b);\n\t\t\tb = readByte();\n\t\t}\n\t\treturn sb.toString();\n\t}\n\t\n\tprivate static char[] ns(int n)\n\t{\n\t\tchar[] buf = new char[n];\n\t\tint b = skip(), p = 0;\n\t\twhile(p < n && !(isSpaceChar(b))){\n\t\t\tbuf[p++] = (char)b;\n\t\t\tb = readByte();\n\t\t}\n\t\treturn n == p ? buf : Arrays.copyOf(buf, p);\n\t}\n\t\n\tprivate static char[][] nm(int n, int m)\n\t{\n\t\tchar[][] map = new char[n][];\n\t\tfor(int i = 0;i < n;i++)map[i] = ns(m);\n\t\treturn map;\n\t}\n\t\n\tprivate static int[] na(int n)\n\t{\n\t\tint[] a = new int[n];\n\t\tfor(int i = 0;i < n;i++)a[i] = ni();\n\t\treturn a;\n\t}\n\t\n\tprivate static int ni()\n\t{\n\t\tint num = 0, b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static long nl()\n\t{\n\t\tlong num = 0;\n\t\tint b;\n\t\tboolean minus = false;\n\t\twhile((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));\n\t\tif(b == '-'){\n\t\t\tminus = true;\n\t\t\tb = readByte();\n\t\t}\n\t\t\n\t\twhile(true){\n\t\t\tif(b >= '0' && b <= '9'){\n\t\t\t\tnum = num * 10 + (b - '0');\n\t\t\t}else{\n\t\t\t\treturn minus ? -num : num;\n\t\t\t}\n\t\t\tb = readByte();\n\t\t}\n\t}\n\t\n\tprivate static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA tetromino is a figure formed by joining four squares edge to edge.\nWe will refer to the following seven kinds of tetromino as I-, O-, T-, J-, L-, S- and Z-tetrominos, respectively:\n\nSnuke has many tetrominos. The number of I-, O-, T-, J-, L-, S- and Z-tetrominos in his possession are a_I, a_O, a_T, a_J, a_L, a_S and a_Z, respectively.\nSnuke will join K of his tetrominos to form a rectangle that is two squares tall and 2K squares wide.\nHere, the following rules must be followed:\n\nWhen placing each tetromino, rotation is allowed, but reflection is not.\n\nEach square in the rectangle must be covered by exactly one tetromino.\n\nNo part of each tetromino may be outside the rectangle.\n\nSnuke wants to form as large a rectangle as possible.\nFind the maximum possible value of K.\n\nConstraints\n\n0≤a_I,a_O,a_T,a_J,a_L,a_S,a_Z≤10^9\n\na_I+a_O+a_T+a_J+a_L+a_S+a_Z≥1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na_I a_O a_T a_J a_L a_S a_Z\n\nOutput\n\nPrint the maximum possible value of K. If no rectangle can be formed, print 0.\n\nSample Input 1\n\n2 1 1 0 0 0 0\n\nSample Output 1\n\n3\n\nOne possible way to form the largest rectangle is shown in the following figure:\n\nSample Input 2\n\n0 0 10 0 0 0 0\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.", "sample_input": "2 1 1 0 0 0 0\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03840", "source_text": "Score : 600 points\n\nProblem Statement\n\nA tetromino is a figure formed by joining four squares edge to edge.\nWe will refer to the following seven kinds of tetromino as I-, O-, T-, J-, L-, S- and Z-tetrominos, respectively:\n\nSnuke has many tetrominos. The number of I-, O-, T-, J-, L-, S- and Z-tetrominos in his possession are a_I, a_O, a_T, a_J, a_L, a_S and a_Z, respectively.\nSnuke will join K of his tetrominos to form a rectangle that is two squares tall and 2K squares wide.\nHere, the following rules must be followed:\n\nWhen placing each tetromino, rotation is allowed, but reflection is not.\n\nEach square in the rectangle must be covered by exactly one tetromino.\n\nNo part of each tetromino may be outside the rectangle.\n\nSnuke wants to form as large a rectangle as possible.\nFind the maximum possible value of K.\n\nConstraints\n\n0≤a_I,a_O,a_T,a_J,a_L,a_S,a_Z≤10^9\n\na_I+a_O+a_T+a_J+a_L+a_S+a_Z≥1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na_I a_O a_T a_J a_L a_S a_Z\n\nOutput\n\nPrint the maximum possible value of K. If no rectangle can be formed, print 0.\n\nSample Input 1\n\n2 1 1 0 0 0 0\n\nSample Output 1\n\n3\n\nOne possible way to form the largest rectangle is shown in the following figure:\n\nSample Input 2\n\n0 0 10 0 0 0 0\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3440, "cpu_time_ms": 123, "memory_kb": 8276}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s207127237", "group_id": "codeNet:p03845", "input_text": "import java.util.Scanner;\n\n/**\n * https://abc050.contest.atcoder.jp/tasks/abc050_b\n */\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = Integer.parseInt(sc.next());\n\t\tint[] t = new int[N];\n\t\tlong sum = 0;\n\t\tfor(int i=0; i> group = new ArrayList<>(n+1);\n List> group2 = new ArrayList<>(n+1);\n HashMap mem = new HashMap<>();\n for(int i =0;i<=n;i++){\n group.add(new HashSet<>());\n group2.add(new HashSet<>());\n }\n for(int i=0;i intersect = new HashSet<>(group.get(j));\n intersect.retainAll(group2.get(jj));\n mem.put(t,intersect.size());\n }\n\n System.out.print(mem.get(t)+\" \");\n }\n }\n\n}\n", "language": "Java", "metadata": {"date": 1566341515, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03855.html", "problem_id": "p03855", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03855/input.txt", "sample_output_relpath": "derived/input_output/data/p03855/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03855/Java/s734264706.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s734264706", "user_id": "u544637026"}, "prompt_components": {"gold_output": "1 2 2 1\n", "input_to_evaluate": "import java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.*;\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n Scanner in = new Scanner(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n int n = in.nextInt();\n int k = in.nextInt();\n int l = in.nextInt();\n int[] roads = new int[n+1];\n int[] railways = new int[n+1];\n List> group = new ArrayList<>(n+1);\n List> group2 = new ArrayList<>(n+1);\n HashMap mem = new HashMap<>();\n for(int i =0;i<=n;i++){\n group.add(new HashSet<>());\n group2.add(new HashSet<>());\n }\n for(int i=0;i intersect = new HashSet<>(group.get(j));\n intersect.retainAll(group2.get(jj));\n mem.put(t,intersect.size());\n }\n\n System.out.print(mem.get(t)+\" \");\n }\n }\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N cities. There are also K roads and L railways, extending between the cities.\nThe i-th road bidirectionally connects the p_i-th and q_i-th cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th cities.\nNo two roads connect the same pair of cities. Similarly, no two railways connect the same pair of cities.\n\nWe will say city A and B are connected by roads if city B is reachable from city A by traversing some number of roads. Here, any city is considered to be connected to itself by roads.\nWe will also define connectivity by railways similarly.\n\nFor each city, find the number of the cities connected to that city by both roads and railways.\n\nConstraints\n\n2 ≦ N ≦ 2*10^5\n\n1 ≦ K, L≦ 10^5\n\n1 ≦ p_i, q_i, r_i, s_i ≦ N\n\np_i < q_i\n\nr_i < s_i\n\nWhen i ≠ j, (p_i, q_i) ≠ (p_j, q_j)\n\nWhen i ≠ j, (r_i, s_i) ≠ (r_j, s_j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K L\np_1 q_1\n:\np_K q_K\nr_1 s_1\n:\nr_L s_L\n\nOutput\n\nPrint N integers. The i-th of them should represent the number of the cities connected to the i-th city by both roads and railways.\n\nSample Input 1\n\n4 3 1\n1 2\n2 3\n3 4\n2 3\n\nSample Output 1\n\n1 2 2 1\n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.\n\nSample Input 2\n\n4 2 2\n1 2\n2 3\n1 4\n2 3\n\nSample Output 2\n\n1 2 2 1\n\nSample Input 3\n\n7 4 4\n1 2\n2 3\n2 5\n6 7\n3 5\n4 5\n3 4\n6 7\n\nSample Output 3\n\n1 1 2 1 2 2 2", "sample_input": "4 3 1\n1 2\n2 3\n3 4\n2 3\n"}, "reference_outputs": ["1 2 2 1\n"], "source_document_id": "p03855", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N cities. There are also K roads and L railways, extending between the cities.\nThe i-th road bidirectionally connects the p_i-th and q_i-th cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th cities.\nNo two roads connect the same pair of cities. Similarly, no two railways connect the same pair of cities.\n\nWe will say city A and B are connected by roads if city B is reachable from city A by traversing some number of roads. Here, any city is considered to be connected to itself by roads.\nWe will also define connectivity by railways similarly.\n\nFor each city, find the number of the cities connected to that city by both roads and railways.\n\nConstraints\n\n2 ≦ N ≦ 2*10^5\n\n1 ≦ K, L≦ 10^5\n\n1 ≦ p_i, q_i, r_i, s_i ≦ N\n\np_i < q_i\n\nr_i < s_i\n\nWhen i ≠ j, (p_i, q_i) ≠ (p_j, q_j)\n\nWhen i ≠ j, (r_i, s_i) ≠ (r_j, s_j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K L\np_1 q_1\n:\np_K q_K\nr_1 s_1\n:\nr_L s_L\n\nOutput\n\nPrint N integers. The i-th of them should represent the number of the cities connected to the i-th city by both roads and railways.\n\nSample Input 1\n\n4 3 1\n1 2\n2 3\n3 4\n2 3\n\nSample Output 1\n\n1 2 2 1\n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.\n\nSample Input 2\n\n4 2 2\n1 2\n2 3\n1 4\n2 3\n\nSample Output 2\n\n1 2 2 1\n\nSample Input 3\n\n7 4 4\n1 2\n2 3\n2 5\n6 7\n3 5\n4 5\n3 4\n6 7\n\nSample Output 3\n\n1 1 2 1 2 2 2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2697, "cpu_time_ms": 2111, "memory_kb": 257012}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s018532459", "group_id": "codeNet:p03861", "input_text": "import java.util.*;\n \npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long a = sc.nextLong();\n long b = sc.nextLong();\n long x = sc.nextLong();\n \n if(a!=0){\n System.out.println(b/x-(a-1)/x);\n }else{\n System.out.println(b/x+1);\n }\n }\n}\n ", "language": "Java", "metadata": {"date": 1594818063, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p03861.html", "problem_id": "p03861", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03861/input.txt", "sample_output_relpath": "derived/input_output/data/p03861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03861/Java/s018532459.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s018532459", "user_id": "u176003399"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n \npublic class Main{\n public static void main(String[] args){\n Scanner sc = new Scanner(System.in);\n long a = sc.nextLong();\n long b = sc.nextLong();\n long x = sc.nextLong();\n \n if(a!=0){\n System.out.println(b/x-(a-1)/x);\n }else{\n System.out.println(b/x+1);\n }\n }\n}\n ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 326, "cpu_time_ms": 117, "memory_kb": 35624}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s855572614", "group_id": "codeNet:p03861", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(final String[] args) {\n final Scanner sc = new Scanner(System.in);\n long A = sc.nextLong();\n long B = sc.nextLong();\n long X = sc.nextLong();\n sc.close();\n\n long ans = B / X - (A - 1) / X;\n\n System.out.println(ans);\n\n }\n}", "language": "Java", "metadata": {"date": 1578628195, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03861.html", "problem_id": "p03861", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03861/input.txt", "sample_output_relpath": "derived/input_output/data/p03861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03861/Java/s855572614.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s855572614", "user_id": "u979180589"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(final String[] args) {\n final Scanner sc = new Scanner(System.in);\n long A = sc.nextLong();\n long B = sc.nextLong();\n long X = sc.nextLong();\n sc.close();\n\n long ans = B / X - (A - 1) / X;\n\n System.out.println(ans);\n\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 310, "cpu_time_ms": 93, "memory_kb": 23124}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s300141398", "group_id": "codeNet:p03861", "input_text": "import java.util.*;\npublic class Main{\npublic static void main(String args[]){\nScanner sc=new Scanner(System.in);\n long a=Long.parseLong(sc.next());\n long b=Long.parseLong(sc.next());\n long n=Long.parseLong(sc.next());\n if(a%n!=0)a+=n-a%n;\n if(b%n!=0)b-=a%n;;\n if(a>b)System.out.println(0);\n else if(a==b)System.out.println(1);\n else System.out.println((b-a)/n+1);\n}\n}\n", "language": "Java", "metadata": {"date": 1551535197, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03861.html", "problem_id": "p03861", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03861/input.txt", "sample_output_relpath": "derived/input_output/data/p03861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03861/Java/s300141398.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s300141398", "user_id": "u803314854"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\npublic class Main{\npublic static void main(String args[]){\nScanner sc=new Scanner(System.in);\n long a=Long.parseLong(sc.next());\n long b=Long.parseLong(sc.next());\n long n=Long.parseLong(sc.next());\n if(a%n!=0)a+=n-a%n;\n if(b%n!=0)b-=a%n;;\n if(a>b)System.out.println(0);\n else if(a==b)System.out.println(1);\n else System.out.println((b-a)/n+1);\n}\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 377, "cpu_time_ms": 91, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s067760923", "group_id": "codeNet:p03862", "input_text": "import java.util.*;\n\n// ABC 48-C\n// http://abc048.contest.atcoder.jp/tasks/arc064_a\n\npublic class Main {\n\t\n\tstatic int MOD = 1000000007;\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\t\n\t\tint n = in.nextInt();\n\t\tlong[] candies = new long[n];\n\t\tlong x = in.nextLong();\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcandies[i] = in.nextLong();\n\t\t}\n\t\t\n\t\tint answer = 0;\n\t\tfor (int i = 1; i < n; i++) {\n//\t\t\tint sum = candies[i - 1] + candies[i];\n//\t\t\tif (sum > x) {\n//\t\t\t\tint diff = sum - x;\n//\t\t\t\tanswer += diff;\n//\t\t\t\tif (diff <= candies[i]) {\n//\t\t\t\t\tcandies[i] -= diff;\n//\t\t\t\t} else {\n//\t\t\t\t\tcandies[i] = 0;\n//\t\t\t\t}\n//\t\t\t}\n\t\t\tlong sum = candies[i - 1] + candies[i];\n\t\t\tlong k = Math.max(0, sum - x);\n\t\t\tanswer += k;\n\t\t\tcandies[i] = Math.max(0, candies[i] - k);\n\t\t}\n\t\t\n\t\tSystem.out.println(answer);\n\t}\n}", "language": "Java", "metadata": {"date": 1490426974, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03862.html", "problem_id": "p03862", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03862/input.txt", "sample_output_relpath": "derived/input_output/data/p03862/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03862/Java/s067760923.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s067760923", "user_id": "u189568205"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*;\n\n// ABC 48-C\n// http://abc048.contest.atcoder.jp/tasks/arc064_a\n\npublic class Main {\n\t\n\tstatic int MOD = 1000000007;\n\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\t\n\t\tint n = in.nextInt();\n\t\tlong[] candies = new long[n];\n\t\tlong x = in.nextLong();\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcandies[i] = in.nextLong();\n\t\t}\n\t\t\n\t\tint answer = 0;\n\t\tfor (int i = 1; i < n; i++) {\n//\t\t\tint sum = candies[i - 1] + candies[i];\n//\t\t\tif (sum > x) {\n//\t\t\t\tint diff = sum - x;\n//\t\t\t\tanswer += diff;\n//\t\t\t\tif (diff <= candies[i]) {\n//\t\t\t\t\tcandies[i] -= diff;\n//\t\t\t\t} else {\n//\t\t\t\t\tcandies[i] = 0;\n//\t\t\t\t}\n//\t\t\t}\n\t\t\tlong sum = candies[i - 1] + candies[i];\n\t\t\tlong k = Math.max(0, sum - x);\n\t\t\tanswer += k;\n\t\t\tcandies[i] = Math.max(0, candies[i] - k);\n\t\t}\n\t\t\n\t\tSystem.out.println(answer);\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N boxes arranged in a row.\nInitially, the i-th box from the left contains a_i candies.\n\nSnuke can perform the following operation any number of times:\n\nChoose a box containing at least one candy, and eat one of the candies in the chosen box.\n\nHis objective is as follows:\n\nAny two neighboring boxes contain at most x candies in total.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ a_i ≤ 10^9\n\n0 ≤ x ≤ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3 3\n2 2 2\n\nSample Output 1\n\n1\n\nEat one candy in the second box.\nThen, the number of candies in each box becomes (2, 1, 2).\n\nSample Input 2\n\n6 1\n1 6 1 2 0 4\n\nSample Output 2\n\n11\n\nFor example, eat six candies in the second box, two in the fourth box, and three in the sixth box.\nThen, the number of candies in each box becomes (1, 0, 1, 0, 0, 1).\n\nSample Input 3\n\n5 9\n3 1 4 1 5\n\nSample Output 3\n\n0\n\nThe objective is already achieved without performing operations.\n\nSample Input 4\n\n2 0\n5 5\n\nSample Output 4\n\n10\n\nAll the candies need to be eaten.", "sample_input": "3 3\n2 2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03862", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N boxes arranged in a row.\nInitially, the i-th box from the left contains a_i candies.\n\nSnuke can perform the following operation any number of times:\n\nChoose a box containing at least one candy, and eat one of the candies in the chosen box.\n\nHis objective is as follows:\n\nAny two neighboring boxes contain at most x candies in total.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ a_i ≤ 10^9\n\n0 ≤ x ≤ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3 3\n2 2 2\n\nSample Output 1\n\n1\n\nEat one candy in the second box.\nThen, the number of candies in each box becomes (2, 1, 2).\n\nSample Input 2\n\n6 1\n1 6 1 2 0 4\n\nSample Output 2\n\n11\n\nFor example, eat six candies in the second box, two in the fourth box, and three in the sixth box.\nThen, the number of candies in each box becomes (1, 0, 1, 0, 0, 1).\n\nSample Input 3\n\n5 9\n3 1 4 1 5\n\nSample Output 3\n\n0\n\nThe objective is already achieved without performing operations.\n\nSample Input 4\n\n2 0\n5 5\n\nSample Output 4\n\n10\n\nAll the candies need to be eaten.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 830, "cpu_time_ms": 427, "memory_kb": 52216}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s220226226", "group_id": "codeNet:p03880", "input_text": "import java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\n\npublic class Main {\n InputStream is;\n\n int __t__ = 1;\n int __f__ = 0;\n int __FILE_DEBUG_FLAG__ = __f__;\n String __DEBUG_FILE_NAME__ = \"src/D1\";\n\n FastScanner in;\n PrintWriter out;\n\n int MOD = 1000000007;\n public void solve() {\n int N = in.nextInt();\n int[] a = in.nextIntArray(N);\n int[] cnt = new int[33];\n\n int xor = 0;\n for (int i = 0; i < N; i++) {\n int d = Integer.bitCount(a[i] ^ (a[i] - 1));\n cnt[d]++;\n xor ^= a[i];\n }\n\n int res = 0;\n for (int i = cnt.length - 1; i >= 0; i--) {\n if (cnt[i] == 0) {\n if ((xor & (1L << (i - 1))) == 0) {\n continue;\n } else {\n System.out.println(-1);\n return;\n }\n }\n xor ^= (1L << i) - 1;\n res++;\n }\n System.out.println(res);\n }\n\n long MULT(long x, long y) {\n return (x * y) % MOD;\n }\n\n long POW(long a, long p) {\n long res = 1;\n long val = a;\n while (p > 0) {\n if (p % 2 == 1) {\n res = MULT(res, val);\n }\n p >>= 1;\n val = MULT(val, val);\n }\n return res;\n }\n\n public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n // TODO 自動生成された catch ブロック\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }\n\n public static void main(final String[] args) {\n new Main().run();\n }\n\n class FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n // stream = new FileInputStream(new File(\"dec.in\"));\n\n }\n\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++)\n array[i] = nextInt();\n\n return array;\n }\n\n int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextIntArray(m);\n }\n return map;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++)\n array[i] = nextLong();\n\n return array;\n }\n\n long[][] nextLongMap(int n, int m) {\n long[][] map = new long[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextLongArray(m);\n }\n return map;\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++)\n array[i] = nextDouble();\n\n return array;\n }\n\n double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextDoubleArray(m);\n }\n return map;\n }\n\n String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++)\n array[i] = next();\n\n return array;\n }\n\n String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n }\n}\n", "language": "Java", "metadata": {"date": 1538014107, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03880.html", "problem_id": "p03880", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03880/input.txt", "sample_output_relpath": "derived/input_output/data/p03880/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03880/Java/s220226226.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s220226226", "user_id": "u617255029"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.InputMismatchException;\n\npublic class Main {\n InputStream is;\n\n int __t__ = 1;\n int __f__ = 0;\n int __FILE_DEBUG_FLAG__ = __f__;\n String __DEBUG_FILE_NAME__ = \"src/D1\";\n\n FastScanner in;\n PrintWriter out;\n\n int MOD = 1000000007;\n public void solve() {\n int N = in.nextInt();\n int[] a = in.nextIntArray(N);\n int[] cnt = new int[33];\n\n int xor = 0;\n for (int i = 0; i < N; i++) {\n int d = Integer.bitCount(a[i] ^ (a[i] - 1));\n cnt[d]++;\n xor ^= a[i];\n }\n\n int res = 0;\n for (int i = cnt.length - 1; i >= 0; i--) {\n if (cnt[i] == 0) {\n if ((xor & (1L << (i - 1))) == 0) {\n continue;\n } else {\n System.out.println(-1);\n return;\n }\n }\n xor ^= (1L << i) - 1;\n res++;\n }\n System.out.println(res);\n }\n\n long MULT(long x, long y) {\n return (x * y) % MOD;\n }\n\n long POW(long a, long p) {\n long res = 1;\n long val = a;\n while (p > 0) {\n if (p % 2 == 1) {\n res = MULT(res, val);\n }\n p >>= 1;\n val = MULT(val, val);\n }\n return res;\n }\n\n public void run() {\n if (__FILE_DEBUG_FLAG__ == __t__) {\n try {\n is = new FileInputStream(__DEBUG_FILE_NAME__);\n } catch (FileNotFoundException e) {\n // TODO 自動生成された catch ブロック\n e.printStackTrace();\n }\n System.out.println(\"FILE_INPUT!\");\n } else {\n is = System.in;\n }\n in = new FastScanner(is);\n out = new PrintWriter(System.out);\n\n solve();\n }\n\n public static void main(final String[] args) {\n new Main().run();\n }\n\n class FastScanner {\n private InputStream stream;\n private byte[] buf = new byte[1024];\n private int curChar;\n private int numChars;\n\n public FastScanner(InputStream stream) {\n this.stream = stream;\n // stream = new FileInputStream(new File(\"dec.in\"));\n\n }\n\n int read() {\n if (numChars == -1)\n throw new InputMismatchException();\n if (curChar >= numChars) {\n curChar = 0;\n try {\n numChars = stream.read(buf);\n } catch (IOException e) {\n throw new InputMismatchException();\n }\n if (numChars <= 0)\n return -1;\n }\n return buf[curChar++];\n }\n\n boolean isSpaceChar(int c) {\n return c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n }\n\n boolean isEndline(int c) {\n return c == '\\n' || c == '\\r' || c == -1;\n }\n\n int nextInt() {\n return Integer.parseInt(next());\n }\n\n int[] nextIntArray(int n) {\n int[] array = new int[n];\n for (int i = 0; i < n; i++)\n array[i] = nextInt();\n\n return array;\n }\n\n int[][] nextIntMap(int n, int m) {\n int[][] map = new int[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextIntArray(m);\n }\n return map;\n }\n\n long nextLong() {\n return Long.parseLong(next());\n }\n\n long[] nextLongArray(int n) {\n long[] array = new long[n];\n for (int i = 0; i < n; i++)\n array[i] = nextLong();\n\n return array;\n }\n\n long[][] nextLongMap(int n, int m) {\n long[][] map = new long[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextLongArray(m);\n }\n return map;\n }\n\n double nextDouble() {\n return Double.parseDouble(next());\n }\n\n double[] nextDoubleArray(int n) {\n double[] array = new double[n];\n for (int i = 0; i < n; i++)\n array[i] = nextDouble();\n\n return array;\n }\n\n double[][] nextDoubleMap(int n, int m) {\n double[][] map = new double[n][m];\n for (int i = 0; i < n; i++) {\n map[i] = in.nextDoubleArray(m);\n }\n return map;\n }\n\n String next() {\n int c = read();\n while (isSpaceChar(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isSpaceChar(c));\n return res.toString();\n }\n\n String[] nextStringArray(int n) {\n String[] array = new String[n];\n for (int i = 0; i < n; i++)\n array[i] = next();\n\n return array;\n }\n\n String nextLine() {\n int c = read();\n while (isEndline(c))\n c = read();\n StringBuilder res = new StringBuilder();\n do {\n res.appendCodePoint(c);\n c = read();\n } while (!isEndline(c));\n return res.toString();\n }\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nA cheetah and a cheater are going to play the game of Nim.\nIn this game they use N piles of stones.\nInitially the i-th pile contains a_i stones.\nThe players take turns alternately, and the cheetah plays first.\nIn each turn, the player chooses one of the piles, and takes one or more stones from the pile.\nThe player who can't make a move loses.\n\nHowever, before the game starts, the cheater wants to cheat a bit to make sure that he can win regardless of the moves by the cheetah.\nFrom each pile, the cheater takes zero or one stone and eats it before the game.\nIn case there are multiple ways to guarantee his winning, he wants to minimize the number of stones he eats.\n\nCompute the number of stones the cheater will eat.\nIn case there is no way for the cheater to win the game even with the cheating, print -1 instead.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n2 ≤ a_i ≤ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n2\n3\n4\n\nSample Output 1\n\n3\n\nThe only way for the cheater to win the game is to take stones from all piles and eat them.\n\nSample Input 2\n\n3\n100\n100\n100\n\nSample Output 2\n\n-1", "sample_input": "3\n2\n3\n4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03880", "source_text": "Score : 500 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nA cheetah and a cheater are going to play the game of Nim.\nIn this game they use N piles of stones.\nInitially the i-th pile contains a_i stones.\nThe players take turns alternately, and the cheetah plays first.\nIn each turn, the player chooses one of the piles, and takes one or more stones from the pile.\nThe player who can't make a move loses.\n\nHowever, before the game starts, the cheater wants to cheat a bit to make sure that he can win regardless of the moves by the cheetah.\nFrom each pile, the cheater takes zero or one stone and eats it before the game.\nIn case there are multiple ways to guarantee his winning, he wants to minimize the number of stones he eats.\n\nCompute the number of stones the cheater will eat.\nIn case there is no way for the cheater to win the game even with the cheating, print -1 instead.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n2 ≤ a_i ≤ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1\n:\na_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n2\n3\n4\n\nSample Output 1\n\n3\n\nThe only way for the cheater to win the game is to take stones from all piles and eat them.\n\nSample Input 2\n\n3\n100\n100\n100\n\nSample Output 2\n\n-1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5525, "cpu_time_ms": 138, "memory_kb": 39444}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s491879591", "group_id": "codeNet:p03899", "input_text": "\nimport java.io.*;\nimport java.util.*;\nimport java.util.function.IntPredicate;\n\n\npublic class Main {\n\tclass Pair{\n\t\tint idx;\n\t\tint value;\n\t\tpublic Pair(int idx, int value){\n\t\t\tthis.idx = idx;\n\t\t\tthis.value = value;\n\t\t}\n\t}\n\t\n\tint N, M, K;\n\tPair[] A;\n\tpublic void solve() {\n\t\tN = nextInt();\n\t\tM = nextInt();\n\t\tK = nextInt();\n\t\tA = new Pair[N];\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tA[i] = new Pair(i, nextInt());\n\t\t}\n\t\tArrays.sort(A, (a, b) -> Integer.compare(b.value, a.value));\n\t\tlong ans = 0;\n\t\tfor(int i = 0; i < K; i++){\n\t\t\tans += A[i].value;\n\t\t}\n\t\tout.println(ans);\n\t\t\n\t}\n \n\tprivate static PrintWriter out;\n\n\tpublic static void main(String[] args) {\n\t\tout = new PrintWriter(System.out);\n\t\tnew Main().solve();\n\t\tout.flush();\n\t}\n\n\tpublic static int nextInt() {\n\t\tint num = 0;\n\t\tString str = next();\n\t\tboolean minus = false;\n\t\tint i = 0;\n\t\tif (str.charAt(0) == '-') {\n\t\t\tminus = true;\n\t\t\ti++;\n\t\t}\n\t\tint len = str.length();\n\t\tfor (; i < len; i++) {\n\t\t\tchar c = str.charAt(i);\n\t\t\tif (!('0' <= c && c <= '9'))\n\t\t\t\tthrow new RuntimeException();\n\t\t\tnum = num * 10 + (c - '0');\n\t\t}\n\t\treturn minus ? -num : num;\n\t}\n\n\tpublic static long nextLong() {\n\t\tlong num = 0;\n\t\tString str = next();\n\t\tboolean minus = false;\n\t\tint i = 0;\n\t\tif (str.charAt(0) == '-') {\n\t\t\tminus = true;\n\t\t\ti++;\n\t\t}\n\t\tint len = str.length();\n\t\tfor (; i < len; i++) {\n\t\t\tchar c = str.charAt(i);\n\t\t\tif (!('0' <= c && c <= '9'))\n\t\t\t\tthrow new RuntimeException();\n\t\t\tnum = num * 10l + (c - '0');\n\t\t}\n\t\treturn minus ? -num : num;\n\t}\n\n\tpublic static String next() {\n\t\tint c;\n\t\twhile (!isAlNum(c = read())) {\n\t\t}\n\t\tStringBuilder build = new StringBuilder();\n\t\tbuild.append((char) c);\n\t\twhile (isAlNum(c = read())) {\n\t\t\tbuild.append((char) c);\n\t\t}\n\t\treturn build.toString();\n\t}\n\n\tprivate static byte[] inputBuffer = new byte[1024];\n\tprivate static int bufferLength = 0;\n\tprivate static int bufferIndex = 0;\n\n\tprivate static int read() {\n\t\tif (bufferLength < 0)\n\t\t\tthrow new RuntimeException();\n\t\tif (bufferIndex >= bufferLength) {\n\t\t\ttry {\n\t\t\t\tbufferLength = System.in.read(inputBuffer);\n\t\t\t\tbufferIndex = 0;\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t\tif (bufferLength <= 0)\n\t\t\t\treturn (bufferLength = -1);\n\t\t}\n\t\treturn inputBuffer[bufferIndex++];\n\t}\n\n\tprivate static boolean isAlNum(int c) {\n\t\treturn '!' <= c && c <= '~';\n\t}\n}", "language": "Java", "metadata": {"date": 1480262388, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03899.html", "problem_id": "p03899", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03899/input.txt", "sample_output_relpath": "derived/input_output/data/p03899/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03899/Java/s491879591.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s491879591", "user_id": "u313578924"}, "prompt_components": {"gold_output": "56\n", "input_to_evaluate": "\nimport java.io.*;\nimport java.util.*;\nimport java.util.function.IntPredicate;\n\n\npublic class Main {\n\tclass Pair{\n\t\tint idx;\n\t\tint value;\n\t\tpublic Pair(int idx, int value){\n\t\t\tthis.idx = idx;\n\t\t\tthis.value = value;\n\t\t}\n\t}\n\t\n\tint N, M, K;\n\tPair[] A;\n\tpublic void solve() {\n\t\tN = nextInt();\n\t\tM = nextInt();\n\t\tK = nextInt();\n\t\tA = new Pair[N];\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tA[i] = new Pair(i, nextInt());\n\t\t}\n\t\tArrays.sort(A, (a, b) -> Integer.compare(b.value, a.value));\n\t\tlong ans = 0;\n\t\tfor(int i = 0; i < K; i++){\n\t\t\tans += A[i].value;\n\t\t}\n\t\tout.println(ans);\n\t\t\n\t}\n \n\tprivate static PrintWriter out;\n\n\tpublic static void main(String[] args) {\n\t\tout = new PrintWriter(System.out);\n\t\tnew Main().solve();\n\t\tout.flush();\n\t}\n\n\tpublic static int nextInt() {\n\t\tint num = 0;\n\t\tString str = next();\n\t\tboolean minus = false;\n\t\tint i = 0;\n\t\tif (str.charAt(0) == '-') {\n\t\t\tminus = true;\n\t\t\ti++;\n\t\t}\n\t\tint len = str.length();\n\t\tfor (; i < len; i++) {\n\t\t\tchar c = str.charAt(i);\n\t\t\tif (!('0' <= c && c <= '9'))\n\t\t\t\tthrow new RuntimeException();\n\t\t\tnum = num * 10 + (c - '0');\n\t\t}\n\t\treturn minus ? -num : num;\n\t}\n\n\tpublic static long nextLong() {\n\t\tlong num = 0;\n\t\tString str = next();\n\t\tboolean minus = false;\n\t\tint i = 0;\n\t\tif (str.charAt(0) == '-') {\n\t\t\tminus = true;\n\t\t\ti++;\n\t\t}\n\t\tint len = str.length();\n\t\tfor (; i < len; i++) {\n\t\t\tchar c = str.charAt(i);\n\t\t\tif (!('0' <= c && c <= '9'))\n\t\t\t\tthrow new RuntimeException();\n\t\t\tnum = num * 10l + (c - '0');\n\t\t}\n\t\treturn minus ? -num : num;\n\t}\n\n\tpublic static String next() {\n\t\tint c;\n\t\twhile (!isAlNum(c = read())) {\n\t\t}\n\t\tStringBuilder build = new StringBuilder();\n\t\tbuild.append((char) c);\n\t\twhile (isAlNum(c = read())) {\n\t\t\tbuild.append((char) c);\n\t\t}\n\t\treturn build.toString();\n\t}\n\n\tprivate static byte[] inputBuffer = new byte[1024];\n\tprivate static int bufferLength = 0;\n\tprivate static int bufferIndex = 0;\n\n\tprivate static int read() {\n\t\tif (bufferLength < 0)\n\t\t\tthrow new RuntimeException();\n\t\tif (bufferIndex >= bufferLength) {\n\t\t\ttry {\n\t\t\t\tbufferLength = System.in.read(inputBuffer);\n\t\t\t\tbufferIndex = 0;\n\t\t\t} catch (IOException e) {\n\t\t\t\tthrow new RuntimeException(e);\n\t\t\t}\n\t\t\tif (bufferLength <= 0)\n\t\t\t\treturn (bufferLength = -1);\n\t\t}\n\t\treturn inputBuffer[bufferIndex++];\n\t}\n\n\tprivate static boolean isAlNum(int c) {\n\t\treturn '!' <= c && c <= '~';\n\t}\n}", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N panels arranged in a row in Takahashi's house, numbered 1 through N. The i-th panel has a number A_i written on it. Takahashi is playing by throwing balls at these panels.\n\nTakahashi threw a ball K times. Let the panel hit by a boll in the i-th throw be panel p_i. He set the score for the i-th throw as i \\times A_{p_i}.\n\nHe was about to calculate the total score for his throws, when he realized that he forgot the panels hit by balls, p_1,p_2,...,p_K. The only fact he remembers is that for every i (1 ≦ i ≦ K-1), 1 ≦ p_{i+1}-p_i ≦ M holds. Based on this fact, find the maximum possible total score for his throws.\n\nConstraints\n\n1 ≦ M ≦ N ≦ 100,000\n\n1 ≦ K ≦ min(300,N)\n\n1 ≦ A_i ≦ 10^{9}\n\nPartial Scores\n\nIn the test set worth 100 points, M = N.\n\nIn the test set worth another 200 points, N ≦ 300 and K ≦ 30.\n\nIn the test set worth another 300 points, K ≦ 30.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 … A_N\n\nOutput\n\nPrint the maximum possible total score for Takahashi's throws.\n\nSample Input 1\n\n5 2 3\n10 2 8 10 2\n\nSample Output 1\n\n56\n\nThe total score is maximized when panels 1,3 and 4 are hit, in this order.\n\nSample Input 2\n\n5 5 2\n5 2 10 5 9\n\nSample Output 2\n\n28\n\nThis case satisfies the additional constraint M = N for a partial score.\n\nSample Input 3\n\n10 3 5\n3 7 2 6 9 4 8 5 1 1000000000\n\nSample Output 3\n\n5000000078", "sample_input": "5 2 3\n10 2 8 10 2\n"}, "reference_outputs": ["56\n"], "source_document_id": "p03899", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere are N panels arranged in a row in Takahashi's house, numbered 1 through N. The i-th panel has a number A_i written on it. Takahashi is playing by throwing balls at these panels.\n\nTakahashi threw a ball K times. Let the panel hit by a boll in the i-th throw be panel p_i. He set the score for the i-th throw as i \\times A_{p_i}.\n\nHe was about to calculate the total score for his throws, when he realized that he forgot the panels hit by balls, p_1,p_2,...,p_K. The only fact he remembers is that for every i (1 ≦ i ≦ K-1), 1 ≦ p_{i+1}-p_i ≦ M holds. Based on this fact, find the maximum possible total score for his throws.\n\nConstraints\n\n1 ≦ M ≦ N ≦ 100,000\n\n1 ≦ K ≦ min(300,N)\n\n1 ≦ A_i ≦ 10^{9}\n\nPartial Scores\n\nIn the test set worth 100 points, M = N.\n\nIn the test set worth another 200 points, N ≦ 300 and K ≦ 30.\n\nIn the test set worth another 300 points, K ≦ 30.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 … A_N\n\nOutput\n\nPrint the maximum possible total score for Takahashi's throws.\n\nSample Input 1\n\n5 2 3\n10 2 8 10 2\n\nSample Output 1\n\n56\n\nThe total score is maximized when panels 1,3 and 4 are hit, in this order.\n\nSample Input 2\n\n5 5 2\n5 2 10 5 9\n\nSample Output 2\n\n28\n\nThis case satisfies the additional constraint M = N for a partial score.\n\nSample Input 3\n\n10 3 5\n3 7 2 6 9 4 8 5 1 1000000000\n\nSample Output 3\n\n5000000078", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2307, "cpu_time_ms": 371, "memory_kb": 32020}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s053105070", "group_id": "codeNet:p03915", "input_text": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint Q = sc.nextInt();\n\t\tint[] A = new int[Q];\n\t\tint[] B = new int[Q];\n\t\tlong[] C = new long[Q];\n\t\tlong[] min_cost = new long[N];\n\t\tArrays.fill(min_cost, Long.MAX_VALUE/ 10);\n\t\tPriorityQueue pq = new PriorityQueue<>();\n\t\tfor (int i = 0; i < Q; ++i) {\n\t\t\tA[i] = sc.nextInt();\n\t\t\tB[i] = sc.nextInt();\n\t\t\tC[i] = sc.nextInt();\n\t\t\tpq.add(new Edge(A[i], B[i], C[i]));\n\t\t\tmin_cost[A[i]] = Math.min(min_cost[A[i]], C[i] + 1);\n\t\t\tmin_cost[B[i]] = Math.min(min_cost[B[i]], C[i] + 2);\n\t\t}\n\t\tfor (int i = 0; i < 2 * N; ++i) {\n\t\t\tmin_cost[(i + 1) % N] = Math.min(min_cost[(i + 1) % N], min_cost[i % N] + 2);\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tpq.add(new Edge(i, (i + 1) % N, min_cost[i]));\n\t\t}\n\t\tDJSet ds = new DJSet(N);\n\t\tlong ret = 0;\n\t\twhile (!pq.isEmpty()) {\n\t\t\tEdge edge = pq.poll();\n\t\t\tif (ds.equiv(edge.a, edge.b))\n\t\t\t\tcontinue;\n\t\t\tret += edge.cost;\n\t\t\tds.setUnion(edge.a, edge.b);\n\t\t\tpq.add(new Edge(edge.b, (edge.a + 1) % N, edge.cost + 1));\n\t\t}\n\t\tSystem.out.println(ret);\n\n\t}\n\n\tstatic class DJSet {\n\t\tint n = 1;\n\t\tint[] upper;\n\n\t\tpublic DJSet(int n) {\n\t\t\tthis.n = n;\n\t\t\tupper = new int[n];\n\t\t\tArrays.fill(upper, -1);\n\t\t}\n\n\t\tint root(int x) {\n\t\t\treturn upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n\t\t}\n\n\t\tboolean equiv(int x, int y) {\n\t\t\treturn root(x) == root(y);\n\t\t}\n\n\t\tvoid setUnion(int x, int y) {\n\t\t\tx = root(x);\n\t\t\ty = root(y);\n\t\t\tif (x != y) {\n\t\t\t\tif (upper[x] < upper[y]) {\n\t\t\t\t\tint d = x;\n\t\t\t\t\tx = y;\n\t\t\t\t\ty = d;\n\t\t\t\t}\n\t\t\t\tupper[y] += upper[x];\n\t\t\t\tupper[x] = y;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Edge implements Comparable {\n\t\tint a;\n\t\tint b;\n\t\tlong cost;\n\n\t\tpublic Edge(int a, int b, long cost) {\n\t\t\tthis.a = a;\n\t\t\tthis.b = b;\n\t\t\tthis.cost = cost;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Edge o) {\n\t\t\treturn Long.compare(this.cost, o.cost);\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1483507741, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03915.html", "problem_id": "p03915", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03915/input.txt", "sample_output_relpath": "derived/input_output/data/p03915/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03915/Java/s053105070.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s053105070", "user_id": "u313111801"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint Q = sc.nextInt();\n\t\tint[] A = new int[Q];\n\t\tint[] B = new int[Q];\n\t\tlong[] C = new long[Q];\n\t\tlong[] min_cost = new long[N];\n\t\tArrays.fill(min_cost, Long.MAX_VALUE/ 10);\n\t\tPriorityQueue pq = new PriorityQueue<>();\n\t\tfor (int i = 0; i < Q; ++i) {\n\t\t\tA[i] = sc.nextInt();\n\t\t\tB[i] = sc.nextInt();\n\t\t\tC[i] = sc.nextInt();\n\t\t\tpq.add(new Edge(A[i], B[i], C[i]));\n\t\t\tmin_cost[A[i]] = Math.min(min_cost[A[i]], C[i] + 1);\n\t\t\tmin_cost[B[i]] = Math.min(min_cost[B[i]], C[i] + 2);\n\t\t}\n\t\tfor (int i = 0; i < 2 * N; ++i) {\n\t\t\tmin_cost[(i + 1) % N] = Math.min(min_cost[(i + 1) % N], min_cost[i % N] + 2);\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tpq.add(new Edge(i, (i + 1) % N, min_cost[i]));\n\t\t}\n\t\tDJSet ds = new DJSet(N);\n\t\tlong ret = 0;\n\t\twhile (!pq.isEmpty()) {\n\t\t\tEdge edge = pq.poll();\n\t\t\tif (ds.equiv(edge.a, edge.b))\n\t\t\t\tcontinue;\n\t\t\tret += edge.cost;\n\t\t\tds.setUnion(edge.a, edge.b);\n\t\t\tpq.add(new Edge(edge.b, (edge.a + 1) % N, edge.cost + 1));\n\t\t}\n\t\tSystem.out.println(ret);\n\n\t}\n\n\tstatic class DJSet {\n\t\tint n = 1;\n\t\tint[] upper;\n\n\t\tpublic DJSet(int n) {\n\t\t\tthis.n = n;\n\t\t\tupper = new int[n];\n\t\t\tArrays.fill(upper, -1);\n\t\t}\n\n\t\tint root(int x) {\n\t\t\treturn upper[x] < 0 ? x : (upper[x] = root(upper[x]));\n\t\t}\n\n\t\tboolean equiv(int x, int y) {\n\t\t\treturn root(x) == root(y);\n\t\t}\n\n\t\tvoid setUnion(int x, int y) {\n\t\t\tx = root(x);\n\t\t\ty = root(y);\n\t\t\tif (x != y) {\n\t\t\t\tif (upper[x] < upper[y]) {\n\t\t\t\t\tint d = x;\n\t\t\t\t\tx = y;\n\t\t\t\t\ty = d;\n\t\t\t\t}\n\t\t\t\tupper[y] += upper[x];\n\t\t\t\tupper[x] = y;\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic class Edge implements Comparable {\n\t\tint a;\n\t\tint b;\n\t\tlong cost;\n\n\t\tpublic Edge(int a, int b, long cost) {\n\t\t\tthis.a = a;\n\t\t\tthis.b = b;\n\t\t\tthis.cost = cost;\n\t\t}\n\n\t\t@Override\n\t\tpublic int compareTo(Edge o) {\n\t\t\treturn Long.compare(this.cost, o.cost);\n\t\t}\n\t}\n}\n", "problem_context": "Score : 1300 points\n\nProblem Statement\n\nWe have a graph with N vertices, numbered 0 through N-1. Edges are yet to be added.\n\nWe will process Q queries to add edges.\nIn the i-th (1≦i≦Q) query, three integers A_i, B_i and C_i will be given, and we will add infinitely many edges to the graph as follows:\n\nThe two vertices numbered A_i and B_i will be connected by an edge with a weight of C_i.\n\nThe two vertices numbered B_i and A_i+1 will be connected by an edge with a weight of C_i+1.\n\nThe two vertices numbered A_i+1 and B_i+1 will be connected by an edge with a weight of C_i+2.\n\nThe two vertices numbered B_i+1 and A_i+2 will be connected by an edge with a weight of C_i+3.\n\nThe two vertices numbered A_i+2 and B_i+2 will be connected by an edge with a weight of C_i+4.\n\nThe two vertices numbered B_i+2 and A_i+3 will be connected by an edge with a weight of C_i+5.\n\nThe two vertices numbered A_i+3 and B_i+3 will be connected by an edge with a weight of C_i+6.\n\n...\n\nHere, consider the indices of the vertices modulo N.\nFor example, the vertice numbered N is the one numbered 0, and the vertice numbered 2N-1 is the one numbered N-1.\n\nThe figure below shows the first seven edges added when N=16, A_i=7, B_i=14, C_i=1:\n\nAfter processing all the queries, find the total weight of the edges contained in a minimum spanning tree of the graph.\n\nConstraints\n\n2≦N≦200,000\n\n1≦Q≦200,000\n\n0≦A_i,B_i≦N-1\n\n1≦C_i≦10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN Q\nA_1 B_1 C_1\nA_2 B_2 C_2\n:\nA_Q B_Q C_Q\n\nOutput\n\nPrint the total weight of the edges contained in a minimum spanning tree of the graph.\n\nSample Input 1\n\n7 1\n5 2 1\n\nSample Output 1\n\n21\n\nThe figure below shows the minimum spanning tree of the graph:\n\nNote that there can be multiple edges connecting the same pair of vertices.\n\nSample Input 2\n\n2 1\n0 0 1000000000\n\nSample Output 2\n\n1000000001\n\nAlso note that there can be self-loops.\n\nSample Input 3\n\n5 3\n0 1 10\n0 2 10\n0 4 10\n\nSample Output 3\n\n42", "sample_input": "7 1\n5 2 1\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03915", "source_text": "Score : 1300 points\n\nProblem Statement\n\nWe have a graph with N vertices, numbered 0 through N-1. Edges are yet to be added.\n\nWe will process Q queries to add edges.\nIn the i-th (1≦i≦Q) query, three integers A_i, B_i and C_i will be given, and we will add infinitely many edges to the graph as follows:\n\nThe two vertices numbered A_i and B_i will be connected by an edge with a weight of C_i.\n\nThe two vertices numbered B_i and A_i+1 will be connected by an edge with a weight of C_i+1.\n\nThe two vertices numbered A_i+1 and B_i+1 will be connected by an edge with a weight of C_i+2.\n\nThe two vertices numbered B_i+1 and A_i+2 will be connected by an edge with a weight of C_i+3.\n\nThe two vertices numbered A_i+2 and B_i+2 will be connected by an edge with a weight of C_i+4.\n\nThe two vertices numbered B_i+2 and A_i+3 will be connected by an edge with a weight of C_i+5.\n\nThe two vertices numbered A_i+3 and B_i+3 will be connected by an edge with a weight of C_i+6.\n\n...\n\nHere, consider the indices of the vertices modulo N.\nFor example, the vertice numbered N is the one numbered 0, and the vertice numbered 2N-1 is the one numbered N-1.\n\nThe figure below shows the first seven edges added when N=16, A_i=7, B_i=14, C_i=1:\n\nAfter processing all the queries, find the total weight of the edges contained in a minimum spanning tree of the graph.\n\nConstraints\n\n2≦N≦200,000\n\n1≦Q≦200,000\n\n0≦A_i,B_i≦N-1\n\n1≦C_i≦10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN Q\nA_1 B_1 C_1\nA_2 B_2 C_2\n:\nA_Q B_Q C_Q\n\nOutput\n\nPrint the total weight of the edges contained in a minimum spanning tree of the graph.\n\nSample Input 1\n\n7 1\n5 2 1\n\nSample Output 1\n\n21\n\nThe figure below shows the minimum spanning tree of the graph:\n\nNote that there can be multiple edges connecting the same pair of vertices.\n\nSample Input 2\n\n2 1\n0 0 1000000000\n\nSample Output 2\n\n1000000001\n\nAlso note that there can be self-loops.\n\nSample Input 3\n\n5 3\n0 1 10\n0 2 10\n0 4 10\n\nSample Output 3\n\n42", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1916, "cpu_time_ms": 1309, "memory_kb": 152028}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s693517527", "group_id": "codeNet:p03919", "input_text": "import java.util.Scanner;\nimport java.util.stream.IntStream;\n\npublic class Main{\n\tstatic final Scanner s=new Scanner(System.in);\n\tstatic int getInt(){\n\t\treturn Integer.parseInt(s.next());\n\t}\n\tpublic static void main(String[] __){\n\t\tint h=getInt(),w=getInt();\n\t\tfor(int i=1;i<=h;i++)\n\t\t\tfor(char c='A';c-'A'= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tboolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tboolean isEndline(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tint[] nextIntArray(int n) {\n\t\t\tint[] array = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextInt();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tint[][] nextIntMap(int n, int m) {\n\t\t\tint[][] map = new int[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextIntArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tlong[] nextLongArray(int n) {\n\t\t\tlong[] array = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextLong();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tlong[][] nextLongMap(int n, int m) {\n\t\t\tlong[][] map = new long[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextLongArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tdouble[] nextDoubleArray(int n) {\n\t\t\tdouble[] array = new double[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextDouble();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tdouble[][] nextDoubleMap(int n, int m) {\n\t\t\tdouble[][] map = new double[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextDoubleArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tString next() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tString[] nextStringArray(int n) {\n\t\t\tString[] array = new String[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = next();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tint c = read();\n\t\t\twhile (isEndline(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isEndline(c));\n\t\t\treturn res.toString();\n\t\t}\n\t}\n}\n\n\n", "language": "Java", "metadata": {"date": 1479252753, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03937.html", "problem_id": "p03937", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03937/input.txt", "sample_output_relpath": "derived/input_output/data/p03937/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03937/Java/s684029704.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s684029704", "user_id": "u617255029"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\nimport java.util.PriorityQueue;\n\npublic class Main {\n\tprivate static final int UNDEFINED = -1000000;\n\n\tInputStream is;\n\n\tint __t__ = 1;\n\tint __f__ = 0;\n\tint __FILE_DEBUG_FLAG__ = __f__;\n\tString __DEBUG_FILE_NAME__ = \"src/D1\";\n\n\tFastScanner in;\n\tPrintWriter out;\n\n\tpublic void solve() {\n\t\tint n = in.nextInt(), m = in.nextInt();\n\t\tchar[][] s = new char[n][];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ts[i] = in.next().toCharArray();\n\t\t}\n\t\tif (s[0][0] == '#' || s[n-1][m-1] == '#') {\n\t\t\tSystem.out.println(\"Impossible\");\n\t\t\treturn;\n\t\t}\n\t\tint cx = 0, cy = 0;\n\t\twhile (cx != m - 1 || cy != n - 1) {\n\t\t\tboolean f1 = false, f2 = false;\n\t\t\tif (cx < m - 1 && s[cy][cx+1] == '#')\n\t\t\t\tf1 = true;\n\t\t\tif (cy < n - 1 && s[cy+1][cx] == '#')\n\t\t\t\tf2 = true;\n\t\t\t\n\t\t\tif ((f1 ^ f2) == false) {\n\t\t\t\tSystem.out.println(\"Impossible\");\n\t\t\t\treturn;\n\t\t\t} else if (f1) { \n\t\t\t\tcx++;\n\t\t\t} else { \n\t\t\t\tcy++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"Possible\");\n\t}\n\t\n\tpublic void run() {\n\t\tif (__FILE_DEBUG_FLAG__ == __t__) {\n\t\t\ttry {\n\t\t\t\tis = new FileInputStream(__DEBUG_FILE_NAME__);\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tSystem.out.println(\"FILE_INPUT!\");\n\t\t} else {\n\t\t\tis = System.in;\n\t\t}\n\t\tin = new FastScanner(is);\n\t\tout = new PrintWriter(System.out);\n\n\t\tThread t = new Thread(null, new Runnable() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic void run() {\n\t\t\t\tsolve();\n\t\t\t}\n\t\t}, \"lul\", 1 << 30);\n\t\tt.start();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tpublic void mapDebug(int[][] a) {\n\t\tSystem.out.println(\"--------map display---------\");\n\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tfor (int j = 0; j < a[i].length; j++) {\n\t\t\t\tSystem.out.printf(\"%3d \", a[i][j]);\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\n\t\tSystem.out.println(\"----------------------------\");\n\t\tSystem.out.println();\n\t}\n\n\tpublic void debug(Object... obj) {\n\t\tSystem.out.println(Arrays.deepToString(obj));\n\t}\n\n\tclass FastScanner {\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t\t//stream = new FileInputStream(new File(\"dec.in\"));\n\n\t\t}\n\n\t\tint read() {\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tboolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tboolean isEndline(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tint[] nextIntArray(int n) {\n\t\t\tint[] array = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextInt();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tint[][] nextIntMap(int n, int m) {\n\t\t\tint[][] map = new int[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextIntArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tlong[] nextLongArray(int n) {\n\t\t\tlong[] array = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextLong();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tlong[][] nextLongMap(int n, int m) {\n\t\t\tlong[][] map = new long[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextLongArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tdouble[] nextDoubleArray(int n) {\n\t\t\tdouble[] array = new double[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextDouble();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tdouble[][] nextDoubleMap(int n, int m) {\n\t\t\tdouble[][] map = new double[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextDoubleArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tString next() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tString[] nextStringArray(int n) {\n\t\t\tString[] array = new String[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = next();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tint c = read();\n\t\t\twhile (isEndline(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isEndline(c));\n\t\t\treturn res.toString();\n\t\t}\n\t}\n}\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nWe have a grid of H rows and W columns. Initially, there is a stone in the top left cell. Shik is trying to move the stone to the bottom right cell. In each step, he can move the stone one cell to its left, up, right, or down (if such cell exists). It is possible that the stone visits a cell multiple times (including the bottom right and the top left cell).\n\nYou are given a matrix of characters a_{ij} (1 \\leq i \\leq H, 1 \\leq j \\leq W). After Shik completes all moving actions, a_{ij} is # if the stone had ever located at the i-th row and the j-th column during the process of moving. Otherwise, a_{ij} is .. Please determine whether it is possible that Shik only uses right and down moves in all steps.\n\nConstraints\n\n2 \\leq H, W \\leq 8\n\na_{i,j} is either # or ..\n\nThere exists a valid sequence of moves for Shik to generate the map a.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\na_{11}a_{12}...a_{1W}\n:\na_{H1}a_{H2}...a_{HW}\n\nOutput\n\nIf it is possible that Shik only uses right and down moves, print Possible. Otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n##...\n.##..\n..##.\n...##\n\nSample Output 1\n\nPossible\n\nThe matrix can be generated by a 7-move sequence: right, down, right, down, right, down, and right.\n\nSample Input 2\n\n5 3\n###\n..#\n###\n#..\n###\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n4 5\n##...\n.###.\n.###.\n...##\n\nSample Output 3\n\nImpossible", "sample_input": "4 5\n##...\n.##..\n..##.\n...##\n"}, "reference_outputs": ["Possible\n"], "source_document_id": "p03937", "source_text": "Score : 200 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nWe have a grid of H rows and W columns. Initially, there is a stone in the top left cell. Shik is trying to move the stone to the bottom right cell. In each step, he can move the stone one cell to its left, up, right, or down (if such cell exists). It is possible that the stone visits a cell multiple times (including the bottom right and the top left cell).\n\nYou are given a matrix of characters a_{ij} (1 \\leq i \\leq H, 1 \\leq j \\leq W). After Shik completes all moving actions, a_{ij} is # if the stone had ever located at the i-th row and the j-th column during the process of moving. Otherwise, a_{ij} is .. Please determine whether it is possible that Shik only uses right and down moves in all steps.\n\nConstraints\n\n2 \\leq H, W \\leq 8\n\na_{i,j} is either # or ..\n\nThere exists a valid sequence of moves for Shik to generate the map a.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\na_{11}a_{12}...a_{1W}\n:\na_{H1}a_{H2}...a_{HW}\n\nOutput\n\nIf it is possible that Shik only uses right and down moves, print Possible. Otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n##...\n.##..\n..##.\n...##\n\nSample Output 1\n\nPossible\n\nThe matrix can be generated by a 7-move sequence: right, down, right, down, right, down, and right.\n\nSample Input 2\n\n5 3\n###\n..#\n###\n#..\n###\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n4 5\n##...\n.###.\n.###.\n...##\n\nSample Output 3\n\nImpossible", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4643, "cpu_time_ms": 100, "memory_kb": 8440}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s203047787", "group_id": "codeNet:p03943", "input_text": "import java.util.*;\n\npublic class Main{\n public static void main(String[]args){\n Scanner scanner = new Scanner(System.in);\n int a = scanner.nextInt();\n int b = scanner.nextInt();\n int c = scanner.nextInt();\n \n if(a + b == c){\n System.out.println(\"Yes\");\n }else if(b + c == a){\n System.out.println(\"Yes\");\n }else if(a + c == b){\n System.out.println(\"Yes\");\n }else{\n System.out.println(\"No\");\n }\n }\n}", "language": "Java", "metadata": {"date": 1573001587, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03943.html", "problem_id": "p03943", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03943/input.txt", "sample_output_relpath": "derived/input_output/data/p03943/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03943/Java/s203047787.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s203047787", "user_id": "u101630918"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n public static void main(String[]args){\n Scanner scanner = new Scanner(System.in);\n int a = scanner.nextInt();\n int b = scanner.nextInt();\n int c = scanner.nextInt();\n \n if(a + b == c){\n System.out.println(\"Yes\");\n }else if(b + c == a){\n System.out.println(\"Yes\");\n }else if(a + c == b){\n System.out.println(\"Yes\");\n }else{\n System.out.println(\"No\");\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "sample_input": "10 30 20\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03943", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 518, "cpu_time_ms": 93, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s714981845", "group_id": "codeNet:p03943", "input_text": "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[] X = new int[3];\n\t\tX[0] = sc.nextInt();\n\t\tX[1] = sc.nextInt();\n\t\tX[2] = sc.nextInt();\n\n\t\tArrays.sort(X);\n\n\t\tif(X[0] + X[1] == X[2]){\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}else{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1478638270, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03943.html", "problem_id": "p03943", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03943/input.txt", "sample_output_relpath": "derived/input_output/data/p03943/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03943/Java/s714981845.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s714981845", "user_id": "u863722302"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sc = new Scanner(System.in);\n\t\tint[] X = new int[3];\n\t\tX[0] = sc.nextInt();\n\t\tX[1] = sc.nextInt();\n\t\tX[2] = sc.nextInt();\n\n\t\tArrays.sort(X);\n\n\t\tif(X[0] + X[1] == X[2]){\n\t\t\tSystem.out.println(\"Yes\");\n\t\t}else{\n\t\t\tSystem.out.println(\"No\");\n\t\t}\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "sample_input": "10 30 20\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03943", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 129, "memory_kb": 9044}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s733310756", "group_id": "codeNet:p03946", "input_text": "import java.util.Scanner;\n\n/**\n * https://abc047.contest.atcoder.jp/tasks/arc063_b\n */\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tlong T = sc.nextLong();\n\t\tlong[] a = new long[N];\n\t\tfor(int i=0; i=0; i--){\n\t\t\tmaxDp[i] = Math.max(a[i], maxDp[i+1]);\n\t\t}\n\t\t\n\t\tlong max = Long.MIN_VALUE;\n\t\tint count = 0;\n\t\tfor(int i=0; imax){\n\t\t\t\tmax = s;\n\t\t\t\tcount = 1;\n\t\t\t}\n\t\t}\n\t\t//long ans = max<=0 ? 0 : Math.min(count, T/2);\n\t\tSystem.out.println(count);\n\n\t}\n\n}", "language": "Java", "metadata": {"date": 1516850955, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03946.html", "problem_id": "p03946", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03946/input.txt", "sample_output_relpath": "derived/input_output/data/p03946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03946/Java/s733310756.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s733310756", "user_id": "u357635195"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Scanner;\n\n/**\n * https://abc047.contest.atcoder.jp/tasks/arc063_b\n */\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tlong T = sc.nextLong();\n\t\tlong[] a = new long[N];\n\t\tfor(int i=0; i=0; i--){\n\t\t\tmaxDp[i] = Math.max(a[i], maxDp[i+1]);\n\t\t}\n\t\t\n\t\tlong max = Long.MIN_VALUE;\n\t\tint count = 0;\n\t\tfor(int i=0; imax){\n\t\t\t\tmax = s;\n\t\t\t\tcount = 1;\n\t\t\t}\n\t\t}\n\t\t//long ans = max<=0 ? 0 : Math.min(count, T/2);\n\t\tSystem.out.println(count);\n\n\t}\n\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "sample_input": "3 2\n100 50 200\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03946", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 733, "cpu_time_ms": 481, "memory_kb": 50944}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s242493780", "group_id": "codeNet:p03947", "input_text": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tString str=scan.next();\n\t\tchar a=str.charAt(0);\n\t\tint count=0;\n\t\tfor(int i=1;i!=str.length();i++) {\n\t\t\tchar b=str.charAt(i);\n\t\t\tif(a!=b) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\ta=str.charAt(i);\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}", "language": "Java", "metadata": {"date": 1549125288, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03947.html", "problem_id": "p03947", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03947/input.txt", "sample_output_relpath": "derived/input_output/data/p03947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03947/Java/s242493780.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s242493780", "user_id": "u274962354"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.Scanner;\npublic class Main{\n\tpublic static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tString str=scan.next();\n\t\tchar a=str.charAt(0);\n\t\tint count=0;\n\t\tfor(int i=1;i!=str.length();i++) {\n\t\t\tchar b=str.charAt(i);\n\t\t\tif(a!=b) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\ta=str.charAt(i);\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03947", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 168, "memory_kb": 24392}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s774752443", "group_id": "codeNet:p03957", "input_text": "import java.io.*;\nimport java.util.*;\n\n/**\n * Created by fcdkbear on 15.10.16.\n */\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n new Task().solve(in, out);\n out.close();\n }\n\n\n static class Task {\n\n public void solve(InputReader in, PrintWriter out) {\n\n String s = in.next();\n int cIndex = s.indexOf('C');\n int fIndex = s.lastIndexOf('F');\n if ((cIndex == -1) || (fIndex == -1) || (cIndex > fIndex)) {\n out.println(\"No\");\n } else {\n out.println(\"Yes\");\n }\n\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n\n}\n", "language": "Java", "metadata": {"date": 1477270999, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03957.html", "problem_id": "p03957", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03957/input.txt", "sample_output_relpath": "derived/input_output/data/p03957/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03957/Java/s774752443.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s774752443", "user_id": "u228126927"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\n/**\n * Created by fcdkbear on 15.10.16.\n */\npublic class Main {\n\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n new Task().solve(in, out);\n out.close();\n }\n\n\n static class Task {\n\n public void solve(InputReader in, PrintWriter out) {\n\n String s = in.next();\n int cIndex = s.indexOf('C');\n int fIndex = s.lastIndexOf('F');\n if ((cIndex == -1) || (fIndex == -1) || (cIndex > fIndex)) {\n out.println(\"No\");\n } else {\n out.println(\"Yes\");\n }\n\n }\n\n }\n\n static class InputReader {\n public BufferedReader reader;\n public StringTokenizer tokenizer;\n\n public InputReader(InputStream stream) {\n reader = new BufferedReader(new InputStreamReader(stream), 32768);\n tokenizer = null;\n }\n\n public String next() {\n while (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int nextInt() {\n return Integer.parseInt(next());\n }\n\n public long nextLong() {\n return Long.parseLong(next());\n }\n\n }\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODEFESTIVAL, which can be shortened to the string CF by deleting some characters.\n\nMr. Takahashi, full of curiosity, wondered if he could obtain CF from other strings in the same way.\n\nYou are given a string s consisting of uppercase English letters.\nDetermine whether the string CF can be obtained from the string s by deleting some characters.\n\nConstraints\n\n2 ≤ |s| ≤ 100\n\nAll characters in s are uppercase English letters (A-Z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint Yes if the string CF can be obtained from the string s by deleting some characters.\nOtherwise print No.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nYes\n\nCF is obtained by deleting characters other than the first character C and the fifth character F.\n\nSample Input 2\n\nFESTIVALCODE\n\nSample Output 2\n\nNo\n\nFC can be obtained but CF cannot be obtained because you cannot change the order of the characters.\n\nSample Input 3\n\nCF\n\nSample Output 3\n\nYes\n\nIt is also possible not to delete any characters.\n\nSample Input 4\n\nFCF\n\nSample Output 4\n\nYes\n\nCF is obtained by deleting the first character.", "sample_input": "CODEFESTIVAL\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03957", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODEFESTIVAL, which can be shortened to the string CF by deleting some characters.\n\nMr. Takahashi, full of curiosity, wondered if he could obtain CF from other strings in the same way.\n\nYou are given a string s consisting of uppercase English letters.\nDetermine whether the string CF can be obtained from the string s by deleting some characters.\n\nConstraints\n\n2 ≤ |s| ≤ 100\n\nAll characters in s are uppercase English letters (A-Z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint Yes if the string CF can be obtained from the string s by deleting some characters.\nOtherwise print No.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nYes\n\nCF is obtained by deleting characters other than the first character C and the fifth character F.\n\nSample Input 2\n\nFESTIVALCODE\n\nSample Output 2\n\nNo\n\nFC can be obtained but CF cannot be obtained because you cannot change the order of the characters.\n\nSample Input 3\n\nCF\n\nSample Output 3\n\nYes\n\nIt is also possible not to delete any characters.\n\nSample Input 4\n\nFCF\n\nSample Output 4\n\nYes\n\nCF is obtained by deleting the first character.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1660, "cpu_time_ms": 142, "memory_kb": 8404}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s765734044", "group_id": "codeNet:p03958", "input_text": "import java.util.Arrays;\nimport java.util.Scanner;\n\n\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t Scanner in = new Scanner(System.in);\n\t int k = in.nextInt();\n\t int t = in.nextInt();\n\n\t int arr[] = new int[t];\n\t for(int i=0;i=0;i--){\n\t \t\t if(arr[i]>0){\n\t \t\t\t get++;\n\t \t\t\t arr[i]--;\n\t \t\t }\n\t \t\t if(get==2)\n\t \t\t\t break;\n\t \t }\n\t \t step+=get;\n\t \t if(get==1 && step!=k)\n\t \t\t ans++;\n\t }\n \t\t System.out.println(ans);\n \t \n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1477271750, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p03958.html", "problem_id": "p03958", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03958/input.txt", "sample_output_relpath": "derived/input_output/data/p03958/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03958/Java/s765734044.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s765734044", "user_id": "u584619635"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "import java.util.Arrays;\nimport java.util.Scanner;\n\n\npublic class Main {\n\n\t/**\n\t * @param args\n\t */\n\tpublic static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\t\t Scanner in = new Scanner(System.in);\n\t int k = in.nextInt();\n\t int t = in.nextInt();\n\n\t int arr[] = new int[t];\n\t for(int i=0;i=0;i--){\n\t \t\t if(arr[i]>0){\n\t \t\t\t get++;\n\t \t\t\t arr[i]--;\n\t \t\t }\n\t \t\t if(get==2)\n\t \t\t\t break;\n\t \t }\n\t \t step+=get;\n\t \t if(get==1 && step!=k)\n\t \t\t ans++;\n\t }\n \t\t System.out.println(ans);\n \t \n\t}\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are K pieces of cakes.\nMr. Takahashi would like to eat one cake per day, taking K days to eat them all.\n\nThere are T types of cake, and the number of the cakes of type i (1 ≤ i ≤ T) is a_i.\n\nEating the same type of cake two days in a row would be no fun,\nso Mr. Takahashi would like to decide the order for eating cakes that minimizes the number of days on which he has to eat the same type of cake as the day before.\n\nCompute the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nConstraints\n\n1 ≤ K ≤ 10000\n\n1 ≤ T ≤ 100\n\n1 ≤ a_i ≤ 100\n\na_1 + a_2 + ... + a_T = K\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK T\na_1 a_2 ... a_T\n\nOutput\n\nPrint the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nSample Input 1\n\n7 3\n3 2 2\n\nSample Output 1\n\n0\n\nFor example, if Mr. Takahashi eats cakes in the order of 2, 1, 2, 3, 1, 3, 1, he can avoid eating the same type of cake as the previous day.\n\nSample Input 2\n\n6 3\n1 4 1\n\nSample Output 2\n\n1\n\nThere are 6 cakes.\nFor example, if Mr. Takahashi eats cakes in the order of 2, 3, 2, 2, 1, 2, he has to eat the same type of cake (i.e., type 2) as the previous day only on the fourth day.\nSince this is the minimum number, the answer is 1.\n\nSample Input 3\n\n100 1\n100\n\nSample Output 3\n\n99\n\nSince Mr. Takahashi has only one type of cake, he has no choice but to eat the same type of cake as the previous day from the second day and after.", "sample_input": "7 3\n3 2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03958", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are K pieces of cakes.\nMr. Takahashi would like to eat one cake per day, taking K days to eat them all.\n\nThere are T types of cake, and the number of the cakes of type i (1 ≤ i ≤ T) is a_i.\n\nEating the same type of cake two days in a row would be no fun,\nso Mr. Takahashi would like to decide the order for eating cakes that minimizes the number of days on which he has to eat the same type of cake as the day before.\n\nCompute the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nConstraints\n\n1 ≤ K ≤ 10000\n\n1 ≤ T ≤ 100\n\n1 ≤ a_i ≤ 100\n\na_1 + a_2 + ... + a_T = K\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK T\na_1 a_2 ... a_T\n\nOutput\n\nPrint the minimum number of days on which the same type of cake as the previous day will be eaten.\n\nSample Input 1\n\n7 3\n3 2 2\n\nSample Output 1\n\n0\n\nFor example, if Mr. Takahashi eats cakes in the order of 2, 1, 2, 3, 1, 3, 1, he can avoid eating the same type of cake as the previous day.\n\nSample Input 2\n\n6 3\n1 4 1\n\nSample Output 2\n\n1\n\nThere are 6 cakes.\nFor example, if Mr. Takahashi eats cakes in the order of 2, 3, 2, 2, 1, 2, he has to eat the same type of cake (i.e., type 2) as the previous day only on the fourth day.\nSince this is the minimum number, the answer is 1.\n\nSample Input 3\n\n100 1\n100\n\nSample Output 3\n\n99\n\nSince Mr. Takahashi has only one type of cake, he has no choice but to eat the same type of cake as the previous day from the second day and after.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 743, "cpu_time_ms": 151, "memory_kb": 10068}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s277691583", "group_id": "codeNet:p03959", "input_text": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tMyInput in = new MyInput(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic long LINF = 1L << 55;\n\tstatic int MOD = 1000000007;\n\tstatic int[] mh4 = { 0, -1, 1, 0 };\n\tstatic int[] mw4 = { -1, 0, 0, 1 };\n\tstatic int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\tstatic int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\n\tstatic class TaskX {\n\n\t\tpublic void solve(int testNumber, MyInput in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt();\n\t\t\tlong[] t = in.nextLongArray(n);\n\t\t\tlong[] a = in.nextLongArray(n);\n\n\t\t\tlong[] tc = new long[n], ac = new long[n];\n\t\t\tlong min = -1;\n\n\t\t\tlong tmax = Arrays.stream(t).max().getAsLong();\n\t\t\tlong amax = Arrays.stream(a).max().getAsLong();\n\n\t\t\tif (tmax != amax) {\n\t\t\t\tout.println(0);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (t[i] > min) {\n\t\t\t\t\tmin = t[i];\n\t\t\t\t\ttc[i] = 1;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\ttc[i] = t[i];\n\t\t\t}\n\n\t\t\tmin = -1;\n\t\t\tfor (int i = n-1; i >= 0; i--) {\n\t\t\t\tif (a[i] > min) {\n\t\t\t\t\tmin = a[i];\n\t\t\t\t\tac[i] = 1;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tac[i] = a[i];\n\t\t\t}\n\n\t\t\tlong[] cnt = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tcnt[i] = Math.min(ac[i], tc[i]);\n\t\t\t}\n\n\t\t\tlong ans = 1;\n\t\t\tfor (long l : cnt) {\n\t\t\t\tans *= l;\n\t\t\t\tans %= MOD;\n\t\t\t}\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\n\tstatic class MyInput {\n\t\tprivate final BufferedReader in;\n\t\tprivate static int pos;\n\t\tprivate static int readLen;\n\t\tprivate static final char[] buffer = new char[1024 * 8];\n\t\tprivate static char[] str = new char[500 * 8 * 2];\n\t\tprivate static boolean[] isDigit = new boolean[256];\n\t\tprivate static boolean[] isSpace = new boolean[256];\n\t\tprivate static boolean[] isLineSep = new boolean[256];\n\n\t\tstatic {\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tisDigit['0' + i] = true;\n\t\t\t}\n\t\t\tisDigit['-'] = true;\n\t\t\tisSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n\t\t\tisLineSep['\\r'] = isLineSep['\\n'] = true;\n\t\t}\n\n\t\tpublic MyInput(InputStream is) {\n\t\t\tin = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\n\t\tpublic int read() {\n\t\t\tif (pos >= readLen) {\n\t\t\t\tpos = 0;\n\t\t\t\ttry {\n\t\t\t\t\treadLen = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException();\n\t\t\t\t}\n\t\t\t\tif (readLen <= 0) {\n\t\t\t\t\tthrow new MyInput.EndOfFileRuntimeException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn buffer[pos++];\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tint len = 0;\n\t\t\tstr[len++] = nextChar();\n\t\t\tlen = reads(len, isSpace);\n\t\t\tint i = 0;\n\t\t\tint ret = 0;\n\t\t\tif (str[0] == '-') {\n\t\t\t\ti = 1;\n\t\t\t}\n\t\t\tfor (; i < len; i++)\n\t\t\t\tret = ret * 10 + str[i] - '0';\n\t\t\tif (str[0] == '-') {\n\t\t\t\tret = -ret;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tint len = 0;\n\t\t\tstr[len++] = nextChar();\n\t\t\tlen = reads(len, isSpace);\n\t\t\tint i = 0;\n\t\t\tlong ret = 0;\n\t\t\tif (str[0] == '-') {\n\t\t\t\ti = 1;\n\t\t\t}\n\t\t\tfor (; i < len; i++)\n\t\t\t\tret = ret * 10 + str[i] - '0';\n\t\t\tif (str[0] == '-') {\n\t\t\t\tret = -ret;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic char nextChar() {\n\t\t\twhile (true) {\n\t\t\t\tfinal int c = read();\n\t\t\t\tif (!isSpace[c]) {\n\t\t\t\t\treturn (char) c;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic String nextString() {\n\t\t\treturn new String(nextChars());\n\t\t}\n\n\t\tpublic char[] nextChars() {\n\t\t\tint len = 0;\n\t\t\tstr[len++] = nextChar();\n\t\t\tlen = reads(len, isSpace);\n\t\t\treturn Arrays.copyOf(str, len);\n\t\t}\n\n\t\tpublic char[][] next2DChars(int h, int w) {\n\t\t\tchar[][] s = new char[h][w];\n\t\t\tfor (int i = 0; i < h; i++) {\n\t\t\t\ts[i] = nextChars();\n\t\t\t}\n\t\t\treturn s;\n\t\t}\n\n\t\tint reads(int len, boolean[] accept) {\n\t\t\ttry {\n\t\t\t\twhile (true) {\n\t\t\t\t\tfinal int c = read();\n\t\t\t\t\tif (accept[c]) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif (str.length == len) {\n\t\t\t\t\t\tchar[] rep = new char[str.length * 3 / 2];\n\t\t\t\t\t\tSystem.arraycopy(str, 0, rep, 0, str.length);\n\t\t\t\t\t\tstr = rep;\n\t\t\t\t\t}\n\t\t\t\t\tstr[len++] = (char) c;\n\t\t\t\t}\n\t\t\t} catch (MyInput.EndOfFileRuntimeException e) {\n\t\t\t}\n\t\t\treturn len;\n\t\t}\n\n\t\tpublic int[] nextIntArray(final int n) {\n\t\t\tfinal int[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic int[] nextIntArray1Index(final int n) {\n\t\t\tfinal int[] res = new int[n + 1];\n\t\t\tfor (int i = 1; i < n + 1; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic int[] nextIntArrayDec(final int n) {\n\t\t\tfinal int[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(final int n) {\n\t\t\tfinal long[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray1Index(final int n) {\n\t\t\tfinal long[] res = new long[n + 1];\n\t\t\tfor (int i = 1; i < n + 1; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArrayDec(final int n) {\n\t\t\tfinal long[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic double[] nextDoubleArray(int n) {\n\t\t\tdouble[] res = new double[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tstatic class EndOfFileRuntimeException extends RuntimeException {\n\t\t}\n\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1549426932, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03959.html", "problem_id": "p03959", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03959/input.txt", "sample_output_relpath": "derived/input_output/data/p03959/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03959/Java/s277691583.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s277691583", "user_id": "u266665184"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\n\npublic class Main {\n\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tMyInput in = new MyInput(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tTaskX solver = new TaskX();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic int INF = 1 << 30;\n\tstatic long LINF = 1L << 55;\n\tstatic int MOD = 1000000007;\n\tstatic int[] mh4 = { 0, -1, 1, 0 };\n\tstatic int[] mw4 = { -1, 0, 0, 1 };\n\tstatic int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };\n\tstatic int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };\n\n\tstatic class TaskX {\n\n\t\tpublic void solve(int testNumber, MyInput in, PrintWriter out) {\n\n\t\t\tint n = in.nextInt();\n\t\t\tlong[] t = in.nextLongArray(n);\n\t\t\tlong[] a = in.nextLongArray(n);\n\n\t\t\tlong[] tc = new long[n], ac = new long[n];\n\t\t\tlong min = -1;\n\n\t\t\tlong tmax = Arrays.stream(t).max().getAsLong();\n\t\t\tlong amax = Arrays.stream(a).max().getAsLong();\n\n\t\t\tif (tmax != amax) {\n\t\t\t\tout.println(0);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tif (t[i] > min) {\n\t\t\t\t\tmin = t[i];\n\t\t\t\t\ttc[i] = 1;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\ttc[i] = t[i];\n\t\t\t}\n\n\t\t\tmin = -1;\n\t\t\tfor (int i = n-1; i >= 0; i--) {\n\t\t\t\tif (a[i] > min) {\n\t\t\t\t\tmin = a[i];\n\t\t\t\t\tac[i] = 1;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tac[i] = a[i];\n\t\t\t}\n\n\t\t\tlong[] cnt = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tcnt[i] = Math.min(ac[i], tc[i]);\n\t\t\t}\n\n\t\t\tlong ans = 1;\n\t\t\tfor (long l : cnt) {\n\t\t\t\tans *= l;\n\t\t\t\tans %= MOD;\n\t\t\t}\n\t\t\tout.println(ans);\n\t\t}\n\t}\n\n\tstatic class MyInput {\n\t\tprivate final BufferedReader in;\n\t\tprivate static int pos;\n\t\tprivate static int readLen;\n\t\tprivate static final char[] buffer = new char[1024 * 8];\n\t\tprivate static char[] str = new char[500 * 8 * 2];\n\t\tprivate static boolean[] isDigit = new boolean[256];\n\t\tprivate static boolean[] isSpace = new boolean[256];\n\t\tprivate static boolean[] isLineSep = new boolean[256];\n\n\t\tstatic {\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tisDigit['0' + i] = true;\n\t\t\t}\n\t\t\tisDigit['-'] = true;\n\t\t\tisSpace[' '] = isSpace['\\r'] = isSpace['\\n'] = isSpace['\\t'] = true;\n\t\t\tisLineSep['\\r'] = isLineSep['\\n'] = true;\n\t\t}\n\n\t\tpublic MyInput(InputStream is) {\n\t\t\tin = new BufferedReader(new InputStreamReader(is));\n\t\t}\n\n\t\tpublic int read() {\n\t\t\tif (pos >= readLen) {\n\t\t\t\tpos = 0;\n\t\t\t\ttry {\n\t\t\t\t\treadLen = in.read(buffer);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException();\n\t\t\t\t}\n\t\t\t\tif (readLen <= 0) {\n\t\t\t\t\tthrow new MyInput.EndOfFileRuntimeException();\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn buffer[pos++];\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\tint len = 0;\n\t\t\tstr[len++] = nextChar();\n\t\t\tlen = reads(len, isSpace);\n\t\t\tint i = 0;\n\t\t\tint ret = 0;\n\t\t\tif (str[0] == '-') {\n\t\t\t\ti = 1;\n\t\t\t}\n\t\t\tfor (; i < len; i++)\n\t\t\t\tret = ret * 10 + str[i] - '0';\n\t\t\tif (str[0] == '-') {\n\t\t\t\tret = -ret;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\tint len = 0;\n\t\t\tstr[len++] = nextChar();\n\t\t\tlen = reads(len, isSpace);\n\t\t\tint i = 0;\n\t\t\tlong ret = 0;\n\t\t\tif (str[0] == '-') {\n\t\t\t\ti = 1;\n\t\t\t}\n\t\t\tfor (; i < len; i++)\n\t\t\t\tret = ret * 10 + str[i] - '0';\n\t\t\tif (str[0] == '-') {\n\t\t\t\tret = -ret;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tpublic char nextChar() {\n\t\t\twhile (true) {\n\t\t\t\tfinal int c = read();\n\t\t\t\tif (!isSpace[c]) {\n\t\t\t\t\treturn (char) c;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic String nextString() {\n\t\t\treturn new String(nextChars());\n\t\t}\n\n\t\tpublic char[] nextChars() {\n\t\t\tint len = 0;\n\t\t\tstr[len++] = nextChar();\n\t\t\tlen = reads(len, isSpace);\n\t\t\treturn Arrays.copyOf(str, len);\n\t\t}\n\n\t\tpublic char[][] next2DChars(int h, int w) {\n\t\t\tchar[][] s = new char[h][w];\n\t\t\tfor (int i = 0; i < h; i++) {\n\t\t\t\ts[i] = nextChars();\n\t\t\t}\n\t\t\treturn s;\n\t\t}\n\n\t\tint reads(int len, boolean[] accept) {\n\t\t\ttry {\n\t\t\t\twhile (true) {\n\t\t\t\t\tfinal int c = read();\n\t\t\t\t\tif (accept[c]) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif (str.length == len) {\n\t\t\t\t\t\tchar[] rep = new char[str.length * 3 / 2];\n\t\t\t\t\t\tSystem.arraycopy(str, 0, rep, 0, str.length);\n\t\t\t\t\t\tstr = rep;\n\t\t\t\t\t}\n\t\t\t\t\tstr[len++] = (char) c;\n\t\t\t\t}\n\t\t\t} catch (MyInput.EndOfFileRuntimeException e) {\n\t\t\t}\n\t\t\treturn len;\n\t\t}\n\n\t\tpublic int[] nextIntArray(final int n) {\n\t\t\tfinal int[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic int[] nextIntArray1Index(final int n) {\n\t\t\tfinal int[] res = new int[n + 1];\n\t\t\tfor (int i = 1; i < n + 1; i++) {\n\t\t\t\tres[i] = nextInt();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic int[] nextIntArrayDec(final int n) {\n\t\t\tfinal int[] res = new int[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextInt() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray(final int n) {\n\t\t\tfinal long[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArray1Index(final int n) {\n\t\t\tfinal long[] res = new long[n + 1];\n\t\t\tfor (int i = 1; i < n + 1; i++) {\n\t\t\t\tres[i] = nextLong();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic long[] nextLongArrayDec(final int n) {\n\t\t\tfinal long[] res = new long[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextLong() - 1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(nextString());\n\t\t}\n\n\t\tpublic double[] nextDoubleArray(int n) {\n\t\t\tdouble[] res = new double[n];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tres[i] = nextDouble();\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tstatic class EndOfFileRuntimeException extends RuntimeException {\n\t\t}\n\n\t}\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nMountaineers Mr. Takahashi and Mr. Aoki recently trekked across a certain famous mountain range.\nThe mountain range consists of N mountains, extending from west to east in a straight line as Mt. 1, Mt. 2, ..., Mt. N.\nMr. Takahashi traversed the range from the west and Mr. Aoki from the east.\n\nThe height of Mt. i is h_i, but they have forgotten the value of each h_i.\nInstead, for each i (1 ≤ i ≤ N), they recorded the maximum height of the mountains climbed up to the time they reached the peak of Mt. i (including Mt. i).\nMr. Takahashi's record is T_i and Mr. Aoki's record is A_i.\n\nWe know that the height of each mountain h_i is a positive integer.\nCompute the number of the possible sequences of the mountains' heights, modulo 10^9 + 7.\n\nNote that the records may be incorrect and thus there may be no possible sequence of the mountains' heights.\nIn such a case, output 0.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ T_i ≤ 10^9\n\n1 ≤ A_i ≤ 10^9\n\nT_i ≤ T_{i+1} (1 ≤ i ≤ N - 1)\n\nA_i ≥ A_{i+1} (1 ≤ i ≤ N - 1)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 T_2 ... T_N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of possible sequences of the mountains' heights, modulo 10^9 + 7.\n\nSample Input 1\n\n5\n1 3 3 3 3\n3 3 2 2 2\n\nSample Output 1\n\n4\n\nThe possible sequences of the mountains' heights are:\n\n1, 3, 2, 2, 2\n\n1, 3, 2, 1, 2\n\n1, 3, 1, 2, 2\n\n1, 3, 1, 1, 2\n\nfor a total of four sequences.\n\nSample Input 2\n\n5\n1 1 1 2 2\n3 2 1 1 1\n\nSample Output 2\n\n0\n\nThe records are contradictory, since Mr. Takahashi recorded 2 as the highest peak after climbing all the mountains but Mr. Aoki recorded 3.\n\nSample Input 3\n\n10\n1 3776 3776 8848 8848 8848 8848 8848 8848 8848\n8848 8848 8848 8848 8848 8848 8848 8848 3776 5\n\nSample Output 3\n\n884111967\n\nDon't forget to compute the number modulo 10^9 + 7.\n\nSample Input 4\n\n1\n17\n17\n\nSample Output 4\n\n1\n\nSome mountain ranges consist of only one mountain.", "sample_input": "5\n1 3 3 3 3\n3 3 2 2 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03959", "source_text": "Score : 400 points\n\nProblem Statement\n\nMountaineers Mr. Takahashi and Mr. Aoki recently trekked across a certain famous mountain range.\nThe mountain range consists of N mountains, extending from west to east in a straight line as Mt. 1, Mt. 2, ..., Mt. N.\nMr. Takahashi traversed the range from the west and Mr. Aoki from the east.\n\nThe height of Mt. i is h_i, but they have forgotten the value of each h_i.\nInstead, for each i (1 ≤ i ≤ N), they recorded the maximum height of the mountains climbed up to the time they reached the peak of Mt. i (including Mt. i).\nMr. Takahashi's record is T_i and Mr. Aoki's record is A_i.\n\nWe know that the height of each mountain h_i is a positive integer.\nCompute the number of the possible sequences of the mountains' heights, modulo 10^9 + 7.\n\nNote that the records may be incorrect and thus there may be no possible sequence of the mountains' heights.\nIn such a case, output 0.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ T_i ≤ 10^9\n\n1 ≤ A_i ≤ 10^9\n\nT_i ≤ T_{i+1} (1 ≤ i ≤ N - 1)\n\nA_i ≥ A_{i+1} (1 ≤ i ≤ N - 1)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 T_2 ... T_N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of possible sequences of the mountains' heights, modulo 10^9 + 7.\n\nSample Input 1\n\n5\n1 3 3 3 3\n3 3 2 2 2\n\nSample Output 1\n\n4\n\nThe possible sequences of the mountains' heights are:\n\n1, 3, 2, 2, 2\n\n1, 3, 2, 1, 2\n\n1, 3, 1, 2, 2\n\n1, 3, 1, 1, 2\n\nfor a total of four sequences.\n\nSample Input 2\n\n5\n1 1 1 2 2\n3 2 1 1 1\n\nSample Output 2\n\n0\n\nThe records are contradictory, since Mr. Takahashi recorded 2 as the highest peak after climbing all the mountains but Mr. Aoki recorded 3.\n\nSample Input 3\n\n10\n1 3776 3776 8848 8848 8848 8848 8848 8848 8848\n8848 8848 8848 8848 8848 8848 8848 8848 3776 5\n\nSample Output 3\n\n884111967\n\nDon't forget to compute the number modulo 10^9 + 7.\n\nSample Input 4\n\n1\n17\n17\n\nSample Output 4\n\n1\n\nSome mountain ranges consist of only one mountain.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5516, "cpu_time_ms": 264, "memory_kb": 30844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s897883366", "group_id": "codeNet:p03960", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tProblemD solver = new ProblemD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class ProblemD {\n\t\tpublic void solve(int testNumber, FastScanner in, PrintWriter out) {\n\t\t\tint height = in.nextInt();\n\t\t\tint width = in.nextInt();\n\t\t\tchar[][] s = new char[height][];\n\t\t\tfor (int r = 0; r < height; r++) {\n\t\t\t\ts[r] = in.next().toCharArray();\n\t\t\t}\n\t\t\tfinal int infinity = 1000000000;\n\t\t\tint n = height;\n\t\t\tint[][] c1 = new int[n + 1][n + 1];\n\t\t\tint[][] c2 = new int[n + 1][n + 1];\n\t\t\tfor (int s1 = 0; s1 <= n; s1++) {\n\t\t\t\tfor (int s2 = 0; s2 <= n; s2++) {\n\t\t\t\t\tfor (int r = 0; r < height; r++) {\n\t\t\t\t\t\tif (r >= s1 && r >= s2 && s[r - s1][0] == s[r - s2][1]) {\n\t\t\t\t\t\t\t++c1[s1][s2];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (width == 3 && r >= s1 && r >= s2 && s[r - s1][1] == s[r - s2][2]) {\n\t\t\t\t\t\t\t++c2[s1][s2];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint[][][] d = new int[n + 1][n + 1][n + 1];\n\t\t\tfor (int s1 = n; s1 >= 0; s1--) {\n\t\t\t\tfor (int s2 = n; s2 >= 0; s2--) {\n\t\t\t\t\tfor (int s3 = n; s3 >= 0; s3--) {\n\t\t\t\t\t\tif (s1 == n && s2 == n && s3 == n) {\n\t\t\t\t\t\t\td[s1][s2][s3] = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\td[s1][s2][s3] = infinity;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (s1 < n) {\n\t\t\t\t\t\t\td[s1][s2][s3] = Math.min(d[s1][s2][s3], d[s1 + 1][s2][s3] + c1[s1][s2]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (s2 < n) {\n\t\t\t\t\t\t\td[s1][s2][s3] = Math.min(d[s1][s2][s3], d[s1][s2 + 1][s3] + c1[s1][s2] + c2[s2][s3]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (s3 < n) {\n\t\t\t\t\t\t\td[s1][s2][s3] = Math.min(d[s1][s2][s3], d[s1][s2][s3 + 1] + c2[s2][s3]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (width == 2) {\n\t\t\t\tout.println(d[0][0][n]);\n\t\t\t} else {\n\t\t\t\tout.println(d[0][0][0]);\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate BufferedReader in;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(in.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1477277432, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03960.html", "problem_id": "p03960", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03960/input.txt", "sample_output_relpath": "derived/input_output/data/p03960/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03960/Java/s897883366.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s897883366", "user_id": "u113560961"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.StringTokenizer;\nimport java.io.IOException;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n */\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n\t\tOutputStream outputStream = System.out;\n\t\tFastScanner in = new FastScanner(inputStream);\n\t\tPrintWriter out = new PrintWriter(outputStream);\n\t\tProblemD solver = new ProblemD();\n\t\tsolver.solve(1, in, out);\n\t\tout.close();\n\t}\n\n\tstatic class ProblemD {\n\t\tpublic void solve(int testNumber, FastScanner in, PrintWriter out) {\n\t\t\tint height = in.nextInt();\n\t\t\tint width = in.nextInt();\n\t\t\tchar[][] s = new char[height][];\n\t\t\tfor (int r = 0; r < height; r++) {\n\t\t\t\ts[r] = in.next().toCharArray();\n\t\t\t}\n\t\t\tfinal int infinity = 1000000000;\n\t\t\tint n = height;\n\t\t\tint[][] c1 = new int[n + 1][n + 1];\n\t\t\tint[][] c2 = new int[n + 1][n + 1];\n\t\t\tfor (int s1 = 0; s1 <= n; s1++) {\n\t\t\t\tfor (int s2 = 0; s2 <= n; s2++) {\n\t\t\t\t\tfor (int r = 0; r < height; r++) {\n\t\t\t\t\t\tif (r >= s1 && r >= s2 && s[r - s1][0] == s[r - s2][1]) {\n\t\t\t\t\t\t\t++c1[s1][s2];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (width == 3 && r >= s1 && r >= s2 && s[r - s1][1] == s[r - s2][2]) {\n\t\t\t\t\t\t\t++c2[s1][s2];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tint[][][] d = new int[n + 1][n + 1][n + 1];\n\t\t\tfor (int s1 = n; s1 >= 0; s1--) {\n\t\t\t\tfor (int s2 = n; s2 >= 0; s2--) {\n\t\t\t\t\tfor (int s3 = n; s3 >= 0; s3--) {\n\t\t\t\t\t\tif (s1 == n && s2 == n && s3 == n) {\n\t\t\t\t\t\t\td[s1][s2][s3] = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\td[s1][s2][s3] = infinity;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (s1 < n) {\n\t\t\t\t\t\t\td[s1][s2][s3] = Math.min(d[s1][s2][s3], d[s1 + 1][s2][s3] + c1[s1][s2]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (s2 < n) {\n\t\t\t\t\t\t\td[s1][s2][s3] = Math.min(d[s1][s2][s3], d[s1][s2 + 1][s3] + c1[s1][s2] + c2[s2][s3]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (s3 < n) {\n\t\t\t\t\t\t\td[s1][s2][s3] = Math.min(d[s1][s2][s3], d[s1][s2][s3 + 1] + c2[s2][s3]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (width == 2) {\n\t\t\t\tout.println(d[0][0][n]);\n\t\t\t} else {\n\t\t\t\tout.println(d[0][0][0]);\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstatic class FastScanner {\n\t\tprivate BufferedReader in;\n\t\tprivate StringTokenizer st;\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tin = new BufferedReader(new InputStreamReader(stream));\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (st == null || !st.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\tst = new StringTokenizer(in.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn st.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t}\n}\n\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nMr. Takahashi has in his room an art object with H rows and W columns, made up of H \\times W blocks.\nEach block has a color represented by a lowercase English letter (a-z).\nThe color of the block at the i-th row and j-th column is c_{i,j}.\n\nMr. Takahashi would like to dismantle the object, finding it a bit kitschy for his tastes.\nThe dismantling is processed by repeating the following operation:\n\nChoose one of the W columns and push down that column one row.\nThe block at the bottom of that column disappears.\n\nEach time the operation is performed, a cost is incurred.\nSince blocks of the same color have a property to draw each other together, the cost of the operation is the number of the pairs of blocks (p, q) such that:\n\nThe block p is in the selected column.\n\nThe two blocks p and q are horizontally adjacent (before pushing down the column).\n\nThe two blocks p and q have the same color.\n\nMr. Takahashi dismantles the object by repeating the operation H \\times W times to get rid of all the blocks.\nCompute the minimum total cost to dismantle the object.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n2 ≤ W ≤ 300\n\nAll characters c_{i,j} are lowercase English letters (a-z).\n\nPartial Score\n\nIn test cases worth 300 points, W = 3.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nc_{1,1}c_{1,2}..c_{1,W}\nc_{2,1}c_{2,2}..c_{2,W}\n:\nc_{H,1}c_{H,2}..c_{H,W}\n\nOutput\n\nPrint the minimum total cost to dismantle the object.\n\nSample Input 1\n\n2 3\nrrr\nbrg\n\nSample Output 1\n\n2\n\nFor example, the total cost of 2 can be achieved by performing the operation as follows and this is the minimum value.\n\nSample Input 2\n\n6 3\nxya\nxya\nayz\nayz\nxaz\nxaz\n\nSample Output 2\n\n0\n\nThe total cost of 0 can be achieved by first pushing down all blocks of the middle column, then all of the left column, and all of the right column.\n\nSample Input 3\n\n4 2\nay\nxa\nxy\nay\n\nSample Output 3\n\n0\n\nThe total cost of 0 can be achieved by the following operations:\n\npushing down the right column one row;\n\npushing down the left column one row;\n\npushing down all of the right column;\n\nand pushing down all of the left column.\n\nSample Input 4\n\n5 5\naaaaa\nabbba\nababa\nabbba\naaaaa\n\nSample Output 4\n\n24\n\nSample Input 5\n\n7 10\nxxxxxxxxxx\nccccxxffff\ncxxcxxfxxx\ncxxxxxffff\ncxxcxxfxxx\nccccxxfxxx\nxxxxxxxxxx\n\nSample Output 5\n\n130", "sample_input": "2 3\nrrr\nbrg\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03960", "source_text": "Score : 800 points\n\nProblem Statement\n\nMr. Takahashi has in his room an art object with H rows and W columns, made up of H \\times W blocks.\nEach block has a color represented by a lowercase English letter (a-z).\nThe color of the block at the i-th row and j-th column is c_{i,j}.\n\nMr. Takahashi would like to dismantle the object, finding it a bit kitschy for his tastes.\nThe dismantling is processed by repeating the following operation:\n\nChoose one of the W columns and push down that column one row.\nThe block at the bottom of that column disappears.\n\nEach time the operation is performed, a cost is incurred.\nSince blocks of the same color have a property to draw each other together, the cost of the operation is the number of the pairs of blocks (p, q) such that:\n\nThe block p is in the selected column.\n\nThe two blocks p and q are horizontally adjacent (before pushing down the column).\n\nThe two blocks p and q have the same color.\n\nMr. Takahashi dismantles the object by repeating the operation H \\times W times to get rid of all the blocks.\nCompute the minimum total cost to dismantle the object.\n\nConstraints\n\n1 ≤ H ≤ 300\n\n2 ≤ W ≤ 300\n\nAll characters c_{i,j} are lowercase English letters (a-z).\n\nPartial Score\n\nIn test cases worth 300 points, W = 3.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nc_{1,1}c_{1,2}..c_{1,W}\nc_{2,1}c_{2,2}..c_{2,W}\n:\nc_{H,1}c_{H,2}..c_{H,W}\n\nOutput\n\nPrint the minimum total cost to dismantle the object.\n\nSample Input 1\n\n2 3\nrrr\nbrg\n\nSample Output 1\n\n2\n\nFor example, the total cost of 2 can be achieved by performing the operation as follows and this is the minimum value.\n\nSample Input 2\n\n6 3\nxya\nxya\nayz\nayz\nxaz\nxaz\n\nSample Output 2\n\n0\n\nThe total cost of 0 can be achieved by first pushing down all blocks of the middle column, then all of the left column, and all of the right column.\n\nSample Input 3\n\n4 2\nay\nxa\nxy\nay\n\nSample Output 3\n\n0\n\nThe total cost of 0 can be achieved by the following operations:\n\npushing down the right column one row;\n\npushing down the left column one row;\n\npushing down all of the right column;\n\nand pushing down all of the left column.\n\nSample Input 4\n\n5 5\naaaaa\nabbba\nababa\nabbba\naaaaa\n\nSample Output 4\n\n24\n\nSample Input 5\n\n7 10\nxxxxxxxxxx\nccccxxffff\ncxxcxxfxxx\ncxxxxxffff\ncxxcxxfxxx\nccccxxfxxx\nxxxxxxxxxx\n\nSample Output 5\n\n130", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2652, "cpu_time_ms": 859, "memory_kb": 146852}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s822666010", "group_id": "codeNet:p03962", "input_text": "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String args[]){\n\t\tScanner in = new Scanner(System.in);\n\t\tint a =in.nextInt(), b = in.nextInt(), c = in.nextInt();\n\t\tint count = 0;\n\t\tif(a!=b) {\n\t\t\tcount++;\n\t\t}\n\t\tif(b!=c) {\n\t\t\tcount++;\n\t\t}\n\t\tif(a!=c) {\n\t\t\tcount++;\n\t\t}\n\t\tif(count == 3) {\n\t\t\tSystem.out.println(\"3\");\n\t\t\tSystem.out.print(\"Three different colors: \"+a+\", \"+b+\" and \"+c+\".\");\n\t\t}\n\t\tif(count == 2) {\n\t\t\tif(a==c) c = b;\n\t\t\tSystem.out.println(\"2\");\n\t\t\tSystem.out.print(\"Two different colors: \"+a+\" and \"+c+\".\");\n\t\t}\n\t\tif(count == 0) {\n\t\t\tSystem.out.println(\"1\");\n\t\t\tSystem.out.print(\"One different color: \"+a+\".\");\n\t\t}\n\t\tin.close();\n\t}\n}", "language": "Java", "metadata": {"date": 1582353890, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03962.html", "problem_id": "p03962", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03962/input.txt", "sample_output_relpath": "derived/input_output/data/p03962/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03962/Java/s822666010.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s822666010", "user_id": "u816631826"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n\tpublic static void main(String args[]){\n\t\tScanner in = new Scanner(System.in);\n\t\tint a =in.nextInt(), b = in.nextInt(), c = in.nextInt();\n\t\tint count = 0;\n\t\tif(a!=b) {\n\t\t\tcount++;\n\t\t}\n\t\tif(b!=c) {\n\t\t\tcount++;\n\t\t}\n\t\tif(a!=c) {\n\t\t\tcount++;\n\t\t}\n\t\tif(count == 3) {\n\t\t\tSystem.out.println(\"3\");\n\t\t\tSystem.out.print(\"Three different colors: \"+a+\", \"+b+\" and \"+c+\".\");\n\t\t}\n\t\tif(count == 2) {\n\t\t\tif(a==c) c = b;\n\t\t\tSystem.out.println(\"2\");\n\t\t\tSystem.out.print(\"Two different colors: \"+a+\" and \"+c+\".\");\n\t\t}\n\t\tif(count == 0) {\n\t\t\tSystem.out.println(\"1\");\n\t\t\tSystem.out.print(\"One different color: \"+a+\".\");\n\t\t}\n\t\tin.close();\n\t}\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "sample_input": "3 1 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03962", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 660, "cpu_time_ms": 111, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s790977585", "group_id": "codeNet:p03964", "input_text": "import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tint n = sc.nextInt();\n\t\t\n\t\t// 計算\n\t\tlong result = 0;\n\t\tlong t = 0;\n\t\tlong a = 0;\n\t\tfor(int i = 0; i < n; i++){\n\t\t long nt = sc.nextLong();\n\t\t long na = sc.nextLong();\n\t\t long tempt = nt;\n\t\t long tempa = na;\n\t\t int cnt = 2;\n\t\t while(t > tempt || a > tempa){\n\t\t tempt = nt*cnt;\n\t\t tempa = na*cnt;\n\t\t cnt++;\n\t\t }\n\t\t t = tempt;\n\t\t a = tempa;\n\t\t}\n\t\tresult = t + a;\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n\t\n\tpublic static class Scanner {\n\t\tprivate BufferedReader br; private StringTokenizer tok;\n\t\tpublic Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}\n\t\tprivate void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}\n\t\tprivate boolean hasNext() { return tok != null && tok.hasMoreTokens();}\n\t\tpublic String next() throws IOException { getLine(); return tok.nextToken();}\n\t\tpublic int nextInt() throws IOException { return Integer.parseInt(next());}\n\t\tpublic long nextLong() throws IOException { return Long.parseLong(next());}\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next());}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1591846113, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03964.html", "problem_id": "p03964", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03964/input.txt", "sample_output_relpath": "derived/input_output/data/p03964/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03964/Java/s790977585.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s790977585", "user_id": "u513960802"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.util.*;\nimport java.io.*;\nimport static java.lang.Math.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\t// 入力\n\t\tint n = sc.nextInt();\n\t\t\n\t\t// 計算\n\t\tlong result = 0;\n\t\tlong t = 0;\n\t\tlong a = 0;\n\t\tfor(int i = 0; i < n; i++){\n\t\t long nt = sc.nextLong();\n\t\t long na = sc.nextLong();\n\t\t long tempt = nt;\n\t\t long tempa = na;\n\t\t int cnt = 2;\n\t\t while(t > tempt || a > tempa){\n\t\t tempt = nt*cnt;\n\t\t tempa = na*cnt;\n\t\t cnt++;\n\t\t }\n\t\t t = tempt;\n\t\t a = tempa;\n\t\t}\n\t\tresult = t + a;\n\t\t\n\t\t// 出力\n\t\tSystem.out.println(result);\n\t}\n\t\n\tpublic static class Scanner {\n\t\tprivate BufferedReader br; private StringTokenizer tok;\n\t\tpublic Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}\n\t\tprivate void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}\n\t\tprivate boolean hasNext() { return tok != null && tok.hasMoreTokens();}\n\t\tpublic String next() throws IOException { getLine(); return tok.nextToken();}\n\t\tpublic int nextInt() throws IOException { return Integer.parseInt(next());}\n\t\tpublic long nextLong() throws IOException { return Long.parseLong(next());}\n\t\tpublic double nextDouble() throws IOException { return Double.parseDouble(next());}\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "sample_input": "3\n2 3\n1 1\n3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03964", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1374, "cpu_time_ms": 2108, "memory_kb": 22996}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s694722914", "group_id": "codeNet:p03964", "input_text": "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sn = new Scanner(System.in);\n\t\tint N = sn.nextInt();\n\t\tlong A = 1L,B = 1L;\n\t\tfor(int i = 0; i < N; ++i){\n\t\t\tlong x = sn.nextLong();\n\t\t\tlong y = sn.nextLong();\n\t\t\tdouble A_x = (double)A/(double)x;\n\t\t\tdouble B_y = (double)B/(double)y;\n\t\t\tlong n = (long)Math.max(Math.ceil(A_x),Math.ceil(B_y));\n\t\t\tA = n*x;\n\t\t\tB = n*y;\t\t\t\n\t\t}\n\t\tSystem.out.println(A+B);\n\t}\n}\n", "language": "Java", "metadata": {"date": 1480940491, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03964.html", "problem_id": "p03964", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03964/input.txt", "sample_output_relpath": "derived/input_output/data/p03964/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03964/Java/s694722914.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s694722914", "user_id": "u500652785"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.util.*;\npublic class Main{\n\tpublic static void main(String[] args){\n\t\tScanner sn = new Scanner(System.in);\n\t\tint N = sn.nextInt();\n\t\tlong A = 1L,B = 1L;\n\t\tfor(int i = 0; i < N; ++i){\n\t\t\tlong x = sn.nextLong();\n\t\t\tlong y = sn.nextLong();\n\t\t\tdouble A_x = (double)A/(double)x;\n\t\t\tdouble B_y = (double)B/(double)y;\n\t\t\tlong n = (long)Math.max(Math.ceil(A_x),Math.ceil(B_y));\n\t\t\tA = n*x;\n\t\t\tB = n*y;\t\t\t\n\t\t}\n\t\tSystem.out.println(A+B);\n\t}\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "sample_input": "3\n2 3\n1 1\n3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03964", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 445, "cpu_time_ms": 185, "memory_kb": 13368}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s274923804", "group_id": "codeNet:p03970", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\n\npublic class Main {\n\t\n\tstatic String collectStr = \"CODEFESTIVAL2016\";\n\n\tpublic static void main(String[] args) throws Exception {\n\t\tlong start = System.currentTimeMillis();\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString line = br.readLine();\n\t\tint cnt = 0;\n\t\tfor (int i=0; i122)\n\t\t\t\t\ttempe-=26;\n\t\t\t\ttemp.append(tempe);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(input.charAt(i)!='a'&&(int)'{'- (int )input.charAt(i)<=n ){\n\t\t\t\ttemp.append('a');\n\t\t\t\tn -= ((int)'{'- (int )input.charAt(i));\n\t\t\t}else{\n\t\t\t\ttemp.append(input.charAt(i));\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(temp.toString());\t\n\t}\n}", "language": "Java", "metadata": {"date": 1474768168, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03994.html", "problem_id": "p03994", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03994/input.txt", "sample_output_relpath": "derived/input_output/data/p03994/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03994/Java/s214358523.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s214358523", "user_id": "u499661641"}, "prompt_components": {"gold_output": "aya\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\nclass Main{\n\tpublic static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString input = br.readLine();\n\t\tStringBuilder temp = new StringBuilder(\"\");\n\t\tint n = Integer.parseInt(br.readLine());\n\t\tfor(int i =0;i122)\n\t\t\t\t\ttempe-=26;\n\t\t\t\ttemp.append(tempe);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(input.charAt(i)!='a'&&(int)'{'- (int )input.charAt(i)<=n ){\n\t\t\t\ttemp.append('a');\n\t\t\t\tn -= ((int)'{'- (int )input.charAt(i));\n\t\t\t}else{\n\t\t\t\ttemp.append(input.charAt(i));\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(temp.toString());\t\n\t}\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "sample_input": "xyz\n4\n"}, "reference_outputs": ["aya\n"], "source_document_id": "p03994", "source_text": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 734, "cpu_time_ms": 152, "memory_kb": 12116}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s451860706", "group_id": "codeNet:p03995", "input_text": "\nimport java.util.*;\nimport java.io.*;\n\npublic class Main{\n static final Reader sc = new Reader();\n static final PrintWriter out = new PrintWriter(System.out,false);\n\n public static void main(String[] args) throws Exception {\n \tint R = sc.nextInt();\n int C = sc.nextInt();\n int n = sc.nextInt();\n int[] r = new int[n];\n int[] c = new int[n];\n int[] a = new int[n];\n int[][] jjudge = new int[R][C];\n for(int i=0;i l2 = new ArrayList();\n ArrayList> l1 = new ArrayList>();\n for(int i=0;i x = new ArrayList();\n l1.add(x);\n }\n for(int i=0;i x = l1.get(r[i]);\n One o = new One(r[i],c[i],a[i]);\n x.add(o);\n }\n }\n else{\n ArrayList x = l1.get(R-1);\n One o = new One(r[i],c[i],a[i]);\n x.add(o);\n }\n }\n Point[] ten = new Point[R];\n for(int i=0;i x = l1.get(t.x);\n for(int i=0;i l2 = new ArrayList();\n ArrayList> l1 = new ArrayList>();\n for(int i=0;i x = new ArrayList();\n l1.add(x);\n }\n for(int i=0;i x = l1.get(r[i]);\n One o = new One(r[i],c[i],a[i]);\n x.add(o);\n }\n }\n else{\n ArrayList x = l1.get(R-1);\n One o = new One(r[i],c[i],a[i]);\n x.add(o);\n }\n }\n Point[] ten = new Point[R];\n for(int i=0;i x = l1.get(t.x);\n for(int i=0;i 100)) {\n System.exit(-1);\n }\n }\n}", "language": "Java", "metadata": {"date": 1474081500, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p03998.html", "problem_id": "p03998", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03998/input.txt", "sample_output_relpath": "derived/input_output/data/p03998/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03998/Java/s747609953.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s747609953", "user_id": "u035752336"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scan = new Scanner(System.in);\n\n String str_A = scan.next();\n String str_B = scan.next();\n String str_C = scan.next();\n check_input(str_A);\n check_input(str_B);\n check_input(str_C);\n\n int pos_A = 0;\n int pos_B = 0;\n int pos_C = 0;\n\n char ch = str_A.charAt(pos_A);\n pos_A++;\n\n while (pos_A < str_A.length() ||\n pos_B < str_B.length() ||\n pos_C < str_C.length() ) {\n if (ch == 'a') {\n if ( pos_A == str_A.length() ) {\n System.out.println('A');\n break;\n } else {\n ch = str_A.charAt(pos_A);\n pos_A++;\n }\n } else if (ch == 'b') {\n if ( pos_B == str_B.length() ) {\n System.out.println('B');\n break;\n } else {\n ch = str_B.charAt(pos_B);\n pos_B++;\n }\n } else if (ch == 'c') {\n if ( pos_C == str_C.length() ) {\n System.out.println('C');\n break;\n } else {\n ch = str_C.charAt(pos_C);\n pos_C++;\n }\n } else {\n System.exit(-1);\n }\n }\n }\n public static void check_input(String str) {\n if ((str.length() < 2) || (str.length() > 100)) {\n System.exit(-1);\n }\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAlice, Bob and Charlie are playing Card Game for Three, as below:\n\nAt first, each of the three players has a deck consisting of some number of cards. Each card has a letter a, b or c written on it. The orders of the cards in the decks cannot be rearranged.\n\nThe players take turns. Alice goes first.\n\nIf the current player's deck contains at least one card, discard the top card in the deck. Then, the player whose name begins with the letter on the discarded card, takes the next turn. (For example, if the card says a, Alice takes the next turn.)\n\nIf the current player's deck is empty, the game ends and the current player wins the game.\n\nYou are given the initial decks of the players.\nMore specifically, you are given three strings S_A, S_B and S_C. The i-th (1≦i≦|S_A|) letter in S_A is the letter on the i-th card in Alice's initial deck. S_B and S_C describes Bob's and Charlie's initial decks in the same way.\n\nDetermine the winner of the game.\n\nConstraints\n\n1≦|S_A|≦100\n\n1≦|S_B|≦100\n\n1≦|S_C|≦100\n\nEach letter in S_A, S_B, S_C is a, b or c.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS_A\nS_B\nS_C\n\nOutput\n\nIf Alice will win, print A. If Bob will win, print B. If Charlie will win, print C.\n\nSample Input 1\n\naca\naccc\nca\n\nSample Output 1\n\nA\n\nThe game will progress as below:\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice's deck is empty. The game ends and Alice wins the game.\n\nSample Input 2\n\nabcb\naacb\nbccc\n\nSample Output 2\n\nC", "sample_input": "aca\naccc\nca\n"}, "reference_outputs": ["A\n"], "source_document_id": "p03998", "source_text": "Score : 200 points\n\nProblem Statement\n\nAlice, Bob and Charlie are playing Card Game for Three, as below:\n\nAt first, each of the three players has a deck consisting of some number of cards. Each card has a letter a, b or c written on it. The orders of the cards in the decks cannot be rearranged.\n\nThe players take turns. Alice goes first.\n\nIf the current player's deck contains at least one card, discard the top card in the deck. Then, the player whose name begins with the letter on the discarded card, takes the next turn. (For example, if the card says a, Alice takes the next turn.)\n\nIf the current player's deck is empty, the game ends and the current player wins the game.\n\nYou are given the initial decks of the players.\nMore specifically, you are given three strings S_A, S_B and S_C. The i-th (1≦i≦|S_A|) letter in S_A is the letter on the i-th card in Alice's initial deck. S_B and S_C describes Bob's and Charlie's initial decks in the same way.\n\nDetermine the winner of the game.\n\nConstraints\n\n1≦|S_A|≦100\n\n1≦|S_B|≦100\n\n1≦|S_C|≦100\n\nEach letter in S_A, S_B, S_C is a, b or c.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS_A\nS_B\nS_C\n\nOutput\n\nIf Alice will win, print A. If Bob will win, print B. If Charlie will win, print C.\n\nSample Input 1\n\naca\naccc\nca\n\nSample Output 1\n\nA\n\nThe game will progress as below:\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, c. Charlie takes the next turn.\n\nCharlie discards the top card in his deck, a. Alice takes the next turn.\n\nAlice discards the top card in her deck, a. Alice takes the next turn.\n\nAlice's deck is empty. The game ends and Alice wins the game.\n\nSample Input 2\n\nabcb\naacb\nbccc\n\nSample Output 2\n\nC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1556, "cpu_time_ms": 198, "memory_kb": 9428}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s585090562", "group_id": "codeNet:p04001", "input_text": "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args){\n\t\tScanner scanner = new Scanner(System.in);\n\t\tString s = scanner.nextLine();\n\t\tlong length = s.length();\n\t\tscanner.close();\n\t\tlong sum = 0;\n\t\tfor(int i=0;i idMap = new HashMap<>();\n private static Queue edges = new ArrayDeque<>();\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n int n = sc.nextInt();\n int m = sc.nextInt();\n if (m == 0) {\n System.out.println(-1);\n return;\n }\n for (int i = 0; i < m; i++) {\n int p = sc.nextInt();\n int q = sc.nextInt();\n int c = sc.nextInt();\n edges.add(new Edge(toId(p, c), toId(q, c), 0));\n edges.add(new Edge(toId(p, c), toId(p, 0), 0));\n edges.add(new Edge(toId(p, 0), toId(p, c), 1));\n edges.add(new Edge(toId(q, c), toId(q, 0), 0));\n edges.add(new Edge(toId(q, 0), toId(q, c), 1));\n }\n long ans = dijkstra(toId(1, 0), toId(n, 0));\n System.out.println(ans == INF ? -1 : ans);\n }\n\n private static int toId(int fst, int snd) {\n long lid = ((long) (fst) << 32) + (long) (snd);\n Integer id = idMap.get(lid);\n if (id == null) {\n idMap.put(lid, id = idMap.size());\n }\n return id;\n }\n\n private static long dijkstra(int s, int t) {\n // O(E*logV)\n int[] d = new int[idMap.size()];\n Arrays.fill(d, INF);\n d[s] = 0;\n GraphL g = new GraphL(edges);\n PriorityQueue q = new PriorityQueue<>(PriorityPair::compareTo);\n q.add(new PriorityPair(s, 0));\n while (!q.isEmpty()) {\n PriorityPair pair = q.poll();\n int from = pair.element;\n if (d[from] < pair.priority) continue;\n g.getNext(from).stream().filter(to -> d[to] > d[from] + g.getWeight(from, to)).forEach(to -> {\n d[to] = d[from] + g.getWeight(from, to);\n q.add(new PriorityPair(to, d[to]));\n });\n }\n return d[t];\n }\n\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int bufLen = 0;\n\n private boolean hasNextByte() {\n if (ptr < bufLen) {\n return true;\n } else {\n ptr = 0;\n try {\n bufLen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (bufLen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n return hasNextByte();\n }\n\n private String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\nclass PriorityPair implements Comparable {\n\n public int element;\n public int priority;\n\n public PriorityPair(int element, int priority) {\n this.element = element;\n this.priority = priority;\n }\n\n public PriorityPair(List list) {\n this.element = list.get(0);\n this.priority = list.get(1);\n }\n\n public PriorityPair(int[] array) {\n this.element = array[0];\n this.priority = array[1];\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n\n PriorityPair that = (PriorityPair) o;\n\n return element == that.element && priority == that.priority;\n\n }\n\n @Override\n public int hashCode() {\n int result = element;\n result = 31 * result + priority;\n return result;\n }\n\n @Override\n public int compareTo(PriorityPair o) {\n return Integer.compare(priority, o.priority);\n }\n\n @Override\n public String toString() {\n return \"(\" + element + \", priority=\" + priority + \")\";\n }\n}\n\nclass Edge {\n\n int s;\n int t;\n int w;\n\n Edge(int s, int t, int w) {\n this.s = s;\n this.t = t;\n this.w = w;\n }\n}\n\nclass GraphL {\n\n private Map> assoc;\n private Map weight;\n\n public GraphL(Queue edges) {\n assoc = new HashMap<>();\n weight = new HashMap<>();\n for (Edge edge : edges) {\n assoc.putIfAbsent(edge.s, new HashSet());\n assoc.get(edge.s).add(edge.t);\n weight.put(intPairToLong(edge.s, edge.t), edge.w);\n }\n }\n\n public boolean hasNext(int s) {\n return assoc.containsKey(s);\n }\n\n public boolean hasWeight(int s, int t) {\n return weight.containsKey(intPairToLong(s, t));\n }\n\n public Set getNext(int s) {\n return assoc.get(s);\n }\n\n public int getWeight(int s, int t) {\n return weight.get(intPairToLong(s, t));\n }\n\n private static long intPairToLong(int fst, int snd) {\n return ((long) (fst) << 32) | (long) snd & 0xffffffffL;\n }\n\n private static int getFstFromLong(long intPair) {\n return (int) (intPair >> 32);\n }\n\n private static int getSndFromLong(long intPair) {\n return (int) (intPair & 0xffffffffL);\n }\n}", "language": "Java", "metadata": {"date": 1473876683, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04003.html", "problem_id": "p04003", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04003/input.txt", "sample_output_relpath": "derived/input_output/data/p04003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04003/Java/s945099865.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s945099865", "user_id": "u244058759"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.*;\n\npublic class Main {\n\n private static final int INF = (int) 1e+9 + 7;\n private static Map idMap = new HashMap<>();\n private static Queue edges = new ArrayDeque<>();\n\n public static void main(String[] args) {\n FastScanner sc = new FastScanner();\n int n = sc.nextInt();\n int m = sc.nextInt();\n if (m == 0) {\n System.out.println(-1);\n return;\n }\n for (int i = 0; i < m; i++) {\n int p = sc.nextInt();\n int q = sc.nextInt();\n int c = sc.nextInt();\n edges.add(new Edge(toId(p, c), toId(q, c), 0));\n edges.add(new Edge(toId(p, c), toId(p, 0), 0));\n edges.add(new Edge(toId(p, 0), toId(p, c), 1));\n edges.add(new Edge(toId(q, c), toId(q, 0), 0));\n edges.add(new Edge(toId(q, 0), toId(q, c), 1));\n }\n long ans = dijkstra(toId(1, 0), toId(n, 0));\n System.out.println(ans == INF ? -1 : ans);\n }\n\n private static int toId(int fst, int snd) {\n long lid = ((long) (fst) << 32) + (long) (snd);\n Integer id = idMap.get(lid);\n if (id == null) {\n idMap.put(lid, id = idMap.size());\n }\n return id;\n }\n\n private static long dijkstra(int s, int t) {\n // O(E*logV)\n int[] d = new int[idMap.size()];\n Arrays.fill(d, INF);\n d[s] = 0;\n GraphL g = new GraphL(edges);\n PriorityQueue q = new PriorityQueue<>(PriorityPair::compareTo);\n q.add(new PriorityPair(s, 0));\n while (!q.isEmpty()) {\n PriorityPair pair = q.poll();\n int from = pair.element;\n if (d[from] < pair.priority) continue;\n g.getNext(from).stream().filter(to -> d[to] > d[from] + g.getWeight(from, to)).forEach(to -> {\n d[to] = d[from] + g.getWeight(from, to);\n q.add(new PriorityPair(to, d[to]));\n });\n }\n return d[t];\n }\n\n}\n\nclass FastScanner {\n private final InputStream in = System.in;\n private final byte[] buffer = new byte[1024];\n private int ptr = 0;\n private int bufLen = 0;\n\n private boolean hasNextByte() {\n if (ptr < bufLen) {\n return true;\n } else {\n ptr = 0;\n try {\n bufLen = in.read(buffer);\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (bufLen <= 0) {\n return false;\n }\n }\n return true;\n }\n\n private int readByte() {\n if (hasNextByte()) return buffer[ptr++];\n else return -1;\n }\n\n private static boolean isPrintableChar(int c) {\n return 33 <= c && c <= 126;\n }\n\n private boolean hasNext() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;\n return hasNextByte();\n }\n\n private String next() {\n if (!hasNext()) throw new NoSuchElementException();\n StringBuilder sb = new StringBuilder();\n int b = readByte();\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b);\n b = readByte();\n }\n return sb.toString();\n }\n\n private long nextLong() {\n if (!hasNext()) throw new NoSuchElementException();\n long n = 0;\n boolean minus = false;\n int b = readByte();\n if (b == '-') {\n minus = true;\n b = readByte();\n }\n if (b < '0' || '9' < b) {\n throw new NumberFormatException();\n }\n while (true) {\n if ('0' <= b && b <= '9') {\n n *= 10;\n n += b - '0';\n } else if (b == -1 || !isPrintableChar(b)) {\n return minus ? -n : n;\n } else {\n throw new NumberFormatException();\n }\n b = readByte();\n }\n }\n\n int nextInt() {\n long nl = nextLong();\n if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();\n return (int) nl;\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n}\nclass PriorityPair implements Comparable {\n\n public int element;\n public int priority;\n\n public PriorityPair(int element, int priority) {\n this.element = element;\n this.priority = priority;\n }\n\n public PriorityPair(List list) {\n this.element = list.get(0);\n this.priority = list.get(1);\n }\n\n public PriorityPair(int[] array) {\n this.element = array[0];\n this.priority = array[1];\n }\n\n @Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n\n PriorityPair that = (PriorityPair) o;\n\n return element == that.element && priority == that.priority;\n\n }\n\n @Override\n public int hashCode() {\n int result = element;\n result = 31 * result + priority;\n return result;\n }\n\n @Override\n public int compareTo(PriorityPair o) {\n return Integer.compare(priority, o.priority);\n }\n\n @Override\n public String toString() {\n return \"(\" + element + \", priority=\" + priority + \")\";\n }\n}\n\nclass Edge {\n\n int s;\n int t;\n int w;\n\n Edge(int s, int t, int w) {\n this.s = s;\n this.t = t;\n this.w = w;\n }\n}\n\nclass GraphL {\n\n private Map> assoc;\n private Map weight;\n\n public GraphL(Queue edges) {\n assoc = new HashMap<>();\n weight = new HashMap<>();\n for (Edge edge : edges) {\n assoc.putIfAbsent(edge.s, new HashSet());\n assoc.get(edge.s).add(edge.t);\n weight.put(intPairToLong(edge.s, edge.t), edge.w);\n }\n }\n\n public boolean hasNext(int s) {\n return assoc.containsKey(s);\n }\n\n public boolean hasWeight(int s, int t) {\n return weight.containsKey(intPairToLong(s, t));\n }\n\n public Set getNext(int s) {\n return assoc.get(s);\n }\n\n public int getWeight(int s, int t) {\n return weight.get(intPairToLong(s, t));\n }\n\n private static long intPairToLong(int fst, int snd) {\n return ((long) (fst) << 32) | (long) snd & 0xffffffffL;\n }\n\n private static int getFstFromLong(long intPair) {\n return (int) (intPair >> 32);\n }\n\n private static int getSndFromLong(long intPair) {\n return (int) (intPair & 0xffffffffL);\n }\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 2 1\n2 3 1\n3 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04003", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke's town has a subway system, consisting of N stations and M railway lines. The stations are numbered 1 through N. Each line is operated by a company. Each company has an identification number.\n\nThe i-th ( 1 \\leq i \\leq M ) line connects station p_i and q_i bidirectionally. There is no intermediate station. This line is operated by company c_i.\n\nYou can change trains at a station where multiple lines are available.\n\nThe fare system used in this subway system is a bit strange. When a passenger only uses lines that are operated by the same company, the fare is 1 yen (the currency of Japan). Whenever a passenger changes to a line that is operated by a different company from the current line, the passenger is charged an additional fare of 1 yen. In a case where a passenger who changed from some company A's line to another company's line changes to company A's line again, the additional fare is incurred again.\n\nSnuke is now at station 1 and wants to travel to station N by subway. Find the minimum required fare.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 2×10^5\n\n1 \\leq p_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq q_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq c_i \\leq 10^6 (1 \\leq i \\leq M)\n\np_i \\neq q_i (1 \\leq i \\leq M)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\np_1 q_1 c_1\n:\np_M q_M c_M\n\nOutput\n\nPrint the minimum required fare. If it is impossible to get to station N by subway, print -1 instead.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n3 1 2\n\nSample Output 1\n\n1\n\nUse company 1's lines: 1 → 2 → 3. The fare is 1 yen.\n\nSample Input 2\n\n8 11\n1 3 1\n1 4 2\n2 3 1\n2 5 1\n3 4 3\n3 6 3\n3 7 3\n4 8 4\n5 6 1\n6 7 5\n7 8 5\n\nSample Output 2\n\n2\n\nFirst, use company 1's lines: 1 → 3 → 2 → 5 → 6. Then, use company 5's lines: 6 → 7 → 8. The fare is 2 yen.\n\nSample Input 3\n\n2 0\n\nSample Output 3\n\n-1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6648, "cpu_time_ms": 3185, "memory_kb": 288316}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s321201479", "group_id": "codeNet:p04011", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args){ \n Scanner sc = new Scanner(System.in);\n int n = sc.nextInt();\n int k = sc.nextInt();\n int x = sc.nextInt();\n int y = sc.nextInt();\n if(n h = new HashMap<>();\n\t\tHashMap h1 = new HashMap<>();\n\t\twhile (st < dp.length) {\n\t\t\tdp[st] = dp.length - 1;\n\t\t\tst++;\n\t\t}\n\t\tint par = 0;\n\t\tint index = 1;\n\t\tint[] rau = new int[dp.length];\n\t\tint[] freq = new int[dp.length];\n\t\trau[rau.length - 1] = 1;\n\t\tint apar;\n\t\tfor (int i = 0; i < dp.length; i++) {\n\t\t\tif (rau[i] == 0) {\n\t\t\t\tpar = i;\n\t\t\t\tapar = 1;\n\t\t\t\twhile (par < dp.length && rau[par] == 0||par==dp.length-1 &&freq[par]==0) {\n\t\t\t\t\trau[par] = index;\n\t\t\t\t\tif (freq[par] == 0)\n\t\t\t\t\t\tfreq[par] = apar;\n\t\t\t\t\tpar = dp[par];\n\t\t\t\t\t\n\t\t\t\t\tapar++;\n\t\t\t\t\tif (par == dp.length - 1 && freq[par] != 0) break;\n\t\t\t\t}\n\t\t\t\th.put(index, apar);\n\t\t\t\th1.put(index, par);\n\t\t\t\tindex++;\n\t\t\t}\n\t\t}\n\t/*\tfor (int i : rau) {\n\t\t\tSystem.out.print(i);\n\t\t}\n\t\tSystem.out.println();\n\t\tfor (int i : freq) {\n\t\t\tSystem.out.print(i);\n\t\t}*/\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tint a = s.nextInt() - 1;\n\t\t\tint b = s.nextInt() - 1;\n\t\t\tif (a > b) {\n\t\t\t\ta = a ^ b;\n\t\t\t\tb = a ^ b;\n\t\t\t\ta = a ^ b;\n\t\t\t}\n\t\t\t//System.out.println(f(dp, a - 1, b - 1));\n\t\t\tint cur = rau[a];\n\t\t\tint res = 0;\n\t\t\tint dest = rau[b];\n\t\t\t//System.out.println(rau[b]+\" \"+rau[a]);\n\t\t\tres -= freq[a];\n\t\t\tint last = 0;\n\t\t\t\n\t\t\twhile (cur != dest) {\n\t\t\t\tres += h.get(cur) - last;\n\t\t\t\tlast = freq[h1.get(cur)];\n\t\t\t\tcur = rau[h1.get(cur)];\n\t\t\t\t\n\t\t\t\t//System.out.println(last);\n\t\t\t\t\n\t\t\t}\n\t\t\t//System.out.println(last);\n\t\t\tres += freq[b] - last;\n\t\t\tSystem.out.println(res);\n\t\t}\n\t\t\n\t\t\n\t}\n\t\n\tpublic static int f(int[] dp, int a, int b) {\n\t\t\n\t\tint cost = 0;\n\t\tif (a > b) {\n\t\t\ta = a ^ b;\n\t\t\tb = a ^ b;\n\t\t\ta = a ^ b;\n\t\t\t\n\t\t}\n\t\tint current = a;\n\t\twhile (current < b) {\n\t\t\tcurrent = dp[current];\n\t\t\tcost++;\n\t\t}\n\t\treturn cost;\n\t\t\n\t\t\n\t}\n}\n", "language": "Java", "metadata": {"date": 1552699654, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04017.html", "problem_id": "p04017", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04017/input.txt", "sample_output_relpath": "derived/input_output/data/p04017/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04017/Java/s755028629.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s755028629", "user_id": "u354729543"}, "prompt_components": {"gold_output": "4\n2\n1\n2\n", "input_to_evaluate": "import java.util.HashMap;\nimport java.util.Scanner;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tScanner s = new Scanner(System.in);\n\t\t\n\t\tint n = s.nextInt();\n\t\t\n\t\tint[] num = new int[n];\n\t\tint[] dp = new int[n];\n\t\tint st = 0, dr = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnum[i] = s.nextInt();\n\t\t}\n\t\tint l = s.nextInt();\n\t\tint q = s.nextInt();\n\t\t\n\t\t\n\t\twhile (dr != dp.length) {\n\t\t\tif (num[dr] - num[st] <= l) {\n\t\t\t\tdp[st] = dr;\n\t\t\t\tdr++;\n\t\t\t} else {\n\t\t\t\tif (dp[st] == 0 && st != 0)\n\t\t\t\t\tdp[st] = dp[st - 1];\n\t\t\t\tst++;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t}\n\t\tHashMap h = new HashMap<>();\n\t\tHashMap h1 = new HashMap<>();\n\t\twhile (st < dp.length) {\n\t\t\tdp[st] = dp.length - 1;\n\t\t\tst++;\n\t\t}\n\t\tint par = 0;\n\t\tint index = 1;\n\t\tint[] rau = new int[dp.length];\n\t\tint[] freq = new int[dp.length];\n\t\trau[rau.length - 1] = 1;\n\t\tint apar;\n\t\tfor (int i = 0; i < dp.length; i++) {\n\t\t\tif (rau[i] == 0) {\n\t\t\t\tpar = i;\n\t\t\t\tapar = 1;\n\t\t\t\twhile (par < dp.length && rau[par] == 0||par==dp.length-1 &&freq[par]==0) {\n\t\t\t\t\trau[par] = index;\n\t\t\t\t\tif (freq[par] == 0)\n\t\t\t\t\t\tfreq[par] = apar;\n\t\t\t\t\tpar = dp[par];\n\t\t\t\t\t\n\t\t\t\t\tapar++;\n\t\t\t\t\tif (par == dp.length - 1 && freq[par] != 0) break;\n\t\t\t\t}\n\t\t\t\th.put(index, apar);\n\t\t\t\th1.put(index, par);\n\t\t\t\tindex++;\n\t\t\t}\n\t\t}\n\t/*\tfor (int i : rau) {\n\t\t\tSystem.out.print(i);\n\t\t}\n\t\tSystem.out.println();\n\t\tfor (int i : freq) {\n\t\t\tSystem.out.print(i);\n\t\t}*/\n\t\tfor (int i = 0; i < q; i++) {\n\t\t\tint a = s.nextInt() - 1;\n\t\t\tint b = s.nextInt() - 1;\n\t\t\tif (a > b) {\n\t\t\t\ta = a ^ b;\n\t\t\t\tb = a ^ b;\n\t\t\t\ta = a ^ b;\n\t\t\t}\n\t\t\t//System.out.println(f(dp, a - 1, b - 1));\n\t\t\tint cur = rau[a];\n\t\t\tint res = 0;\n\t\t\tint dest = rau[b];\n\t\t\t//System.out.println(rau[b]+\" \"+rau[a]);\n\t\t\tres -= freq[a];\n\t\t\tint last = 0;\n\t\t\t\n\t\t\twhile (cur != dest) {\n\t\t\t\tres += h.get(cur) - last;\n\t\t\t\tlast = freq[h1.get(cur)];\n\t\t\t\tcur = rau[h1.get(cur)];\n\t\t\t\t\n\t\t\t\t//System.out.println(last);\n\t\t\t\t\n\t\t\t}\n\t\t\t//System.out.println(last);\n\t\t\tres += freq[b] - last;\n\t\t\tSystem.out.println(res);\n\t\t}\n\t\t\n\t\t\n\t}\n\t\n\tpublic static int f(int[] dp, int a, int b) {\n\t\t\n\t\tint cost = 0;\n\t\tif (a > b) {\n\t\t\ta = a ^ b;\n\t\t\tb = a ^ b;\n\t\t\ta = a ^ b;\n\t\t\t\n\t\t}\n\t\tint current = a;\n\t\twhile (current < b) {\n\t\t\tcurrent = dp[current];\n\t\t\tcost++;\n\t\t}\n\t\treturn cost;\n\t\t\n\t\t\n\t}\n}\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nN hotels are located on a straight line. The coordinate of the i-th hotel (1 \\leq i \\leq N) is x_i.\n\nTak the traveler has the following two personal principles:\n\nHe never travels a distance of more than L in a single day.\n\nHe never sleeps in the open. That is, he must stay at a hotel at the end of a day.\n\nYou are given Q queries. The j-th (1 \\leq j \\leq Q) query is described by two distinct integers a_j and b_j.\nFor each query, find the minimum number of days that Tak needs to travel from the a_j-th hotel to the b_j-th hotel following his principles.\nIt is guaranteed that he can always travel from the a_j-th hotel to the b_j-th hotel, in any given input.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq x_i < x_2 < ... < x_N \\leq 10^9\n\nx_{i+1} - x_i \\leq L\n\n1 \\leq a_j,b_j \\leq N\n\na_j \\neq b_j\n\nN,\\,L,\\,Q,\\,x_i,\\,a_j,\\,b_j are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying N \\leq 10^3 and Q \\leq 10^3.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nx_1 x_2 ... x_N\nL\nQ\na_1 b_1\na_2 b_2\n:\na_Q b_Q\n\nOutput\n\nPrint Q lines.\nThe j-th line (1 \\leq j \\leq Q) should contain the minimum number of days that Tak needs to travel from the a_j-th hotel to the b_j-th hotel.\n\nSample Input 1\n\n9\n1 3 6 13 15 18 19 29 31\n10\n4\n1 8\n7 3\n6 7\n8 5\n\nSample Output 1\n\n4\n2\n1\n2\n\nFor the 1-st query, he can travel from the 1-st hotel to the 8-th hotel in 4 days, as follows:\n\nDay 1: Travel from the 1-st hotel to the 2-nd hotel. The distance traveled is 2.\n\nDay 2: Travel from the 2-nd hotel to the 4-th hotel. The distance traveled is 10.\n\nDay 3: Travel from the 4-th hotel to the 7-th hotel. The distance traveled is 6.\n\nDay 4: Travel from the 7-th hotel to the 8-th hotel. The distance traveled is 10.", "sample_input": "9\n1 3 6 13 15 18 19 29 31\n10\n4\n1 8\n7 3\n6 7\n8 5\n"}, "reference_outputs": ["4\n2\n1\n2\n"], "source_document_id": "p04017", "source_text": "Score : 700 points\n\nProblem Statement\n\nN hotels are located on a straight line. The coordinate of the i-th hotel (1 \\leq i \\leq N) is x_i.\n\nTak the traveler has the following two personal principles:\n\nHe never travels a distance of more than L in a single day.\n\nHe never sleeps in the open. That is, he must stay at a hotel at the end of a day.\n\nYou are given Q queries. The j-th (1 \\leq j \\leq Q) query is described by two distinct integers a_j and b_j.\nFor each query, find the minimum number of days that Tak needs to travel from the a_j-th hotel to the b_j-th hotel following his principles.\nIt is guaranteed that he can always travel from the a_j-th hotel to the b_j-th hotel, in any given input.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq x_i < x_2 < ... < x_N \\leq 10^9\n\nx_{i+1} - x_i \\leq L\n\n1 \\leq a_j,b_j \\leq N\n\na_j \\neq b_j\n\nN,\\,L,\\,Q,\\,x_i,\\,a_j,\\,b_j are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying N \\leq 10^3 and Q \\leq 10^3.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nx_1 x_2 ... x_N\nL\nQ\na_1 b_1\na_2 b_2\n:\na_Q b_Q\n\nOutput\n\nPrint Q lines.\nThe j-th line (1 \\leq j \\leq Q) should contain the minimum number of days that Tak needs to travel from the a_j-th hotel to the b_j-th hotel.\n\nSample Input 1\n\n9\n1 3 6 13 15 18 19 29 31\n10\n4\n1 8\n7 3\n6 7\n8 5\n\nSample Output 1\n\n4\n2\n1\n2\n\nFor the 1-st query, he can travel from the 1-st hotel to the 8-th hotel in 4 days, as follows:\n\nDay 1: Travel from the 1-st hotel to the 2-nd hotel. The distance traveled is 2.\n\nDay 2: Travel from the 2-nd hotel to the 4-th hotel. The distance traveled is 10.\n\nDay 3: Travel from the 4-th hotel to the 7-th hotel. The distance traveled is 6.\n\nDay 4: Travel from the 7-th hotel to the 8-th hotel. The distance traveled is 10.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2246, "cpu_time_ms": 3161, "memory_kb": 99028}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s090129602", "group_id": "codeNet:p04025", "input_text": "import java.util.*;\n\npublic class Main{\n void solve(){\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n int[] a = new int[n];\n for(int i = 0; i < n; i++) a[i] = scan.nextInt();\n int out = Integer.MAX_VALUE;\n for(int i = -100; i <= 100; i++){\n int r = 0;\n for(int j = 0; j < n; j++) r += (int)(Math.pow(a[j] - i, 2));\n out = Math.min(out, r);\n }\n System.out.println(out);\n }\n \n public static void main(String[] args){\n new Main().solve();\n }\n}\n", "language": "Java", "metadata": {"date": 1599851784, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p04025.html", "problem_id": "p04025", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04025/input.txt", "sample_output_relpath": "derived/input_output/data/p04025/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04025/Java/s090129602.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s090129602", "user_id": "u459100168"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main{\n void solve(){\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n int[] a = new int[n];\n for(int i = 0; i < n; i++) a[i] = scan.nextInt();\n int out = Integer.MAX_VALUE;\n for(int i = -100; i <= 100; i++){\n int r = 0;\n for(int j = 0; j < n; j++) r += (int)(Math.pow(a[j] - i, 2));\n out = Math.min(out, r);\n }\n System.out.println(out);\n }\n \n public static void main(String[] args){\n new Main().solve();\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nEvi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.\n\nHe may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).\n\nFind the minimum total cost to achieve his objective.\n\nConstraints\n\n1≦N≦100\n\n-100≦a_i≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum total cost to achieve Evi's objective.\n\nSample Input 1\n\n2\n4 8\n\nSample Output 1\n\n8\n\nTransforming the both into 6s will cost (4-6)^2+(8-6)^2=8 dollars, which is the minimum.\n\nSample Input 2\n\n3\n1 1 3\n\nSample Output 2\n\n3\n\nTransforming the all into 2s will cost (1-2)^2+(1-2)^2+(3-2)^2=3 dollars. Note that Evi has to pay (1-2)^2 dollar separately for transforming each of the two 1s.\n\nSample Input 3\n\n3\n4 2 5\n\nSample Output 3\n\n5\n\nLeaving the 4 as it is and transforming the 2 and the 5 into 4s will achieve the total cost of (2-4)^2+(5-4)^2=5 dollars, which is the minimum.\n\nSample Input 4\n\n4\n-100 -100 -100 -100\n\nSample Output 4\n\n0\n\nWithout transforming anything, Evi's objective is already achieved. Thus, the necessary cost is 0.", "sample_input": "2\n4 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p04025", "source_text": "Score : 200 points\n\nProblem Statement\n\nEvi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.\n\nHe may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).\n\nFind the minimum total cost to achieve his objective.\n\nConstraints\n\n1≦N≦100\n\n-100≦a_i≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum total cost to achieve Evi's objective.\n\nSample Input 1\n\n2\n4 8\n\nSample Output 1\n\n8\n\nTransforming the both into 6s will cost (4-6)^2+(8-6)^2=8 dollars, which is the minimum.\n\nSample Input 2\n\n3\n1 1 3\n\nSample Output 2\n\n3\n\nTransforming the all into 2s will cost (1-2)^2+(1-2)^2+(3-2)^2=3 dollars. Note that Evi has to pay (1-2)^2 dollar separately for transforming each of the two 1s.\n\nSample Input 3\n\n3\n4 2 5\n\nSample Output 3\n\n5\n\nLeaving the 4 as it is and transforming the 2 and the 5 into 4s will achieve the total cost of (2-4)^2+(5-4)^2=5 dollars, which is the minimum.\n\nSample Input 4\n\n4\n-100 -100 -100 -100\n\nSample Output 4\n\n0\n\nWithout transforming anything, Evi's objective is already achieved. Thus, the necessary cost is 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 571, "cpu_time_ms": 126, "memory_kb": 35888}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s349625754", "group_id": "codeNet:p04026", "input_text": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static final long mod = (long)1e9+7;\n public static final long INF = Long.MAX_VALUE/2;\n public static final int inf = Integer.MAX_VALUE/2;\n //arc59 d\n static void solve(InputReader in, PrintWriter out){\n char[] s = in.ns().toCharArray();\n int ans = -1;\n boolean flag = false;\n for (int i = 0; i < s.length-1; i++) {\n if(i 3) {\n char other = s.charAt(left++);\n count[other]--;\n }\n if (count[c] >= 2) return (left+1) + \" \" + right;\n }\n\n return \"-1 -1\";\n }\n\n /************************** UTILITY CODE BELOW THIS LINE **************************/\n\n class Point {\n int y;\n int x;\n\n public Point(int y, int x) {\n this.y = y;\n this.x = x;\n }\n }\n\n class IDval implements Comparable {\n int id;\n long val;\n\n public IDval(int id, long val) {\n this.val = val;\n this.id = id;\n }\n\n @Override\n public int compareTo(IDval o) {\n if (this.val < o.val) return -1;\n if (this.val > o.val) return 1;\n return this.id - o.id;\n }\n }\n\n private List[] toGraph(IO io, int n) {\n List[] g = new ArrayList[n+1];\n for (int i=1; i<=n; i++) g[i] = new ArrayList<>();\n for (int i=1; i<=n-1; i++) {\n int a = io.nextInt();\n int b = io.nextInt();\n g[a].add(b);\n g[b].add(a);\n }\n return g;\n }\n\n private class IO extends PrintWriter {\n private InputStreamReader r;\n private static final int BUFSIZE = 1 << 15;\n private char[] buf;\n private int bufc;\n private int bufi;\n private StringBuilder sb;\n\n public IO() {\n super(new BufferedOutputStream(System.out));\n r = new InputStreamReader(System.in);\n\n buf = new char[BUFSIZE];\n bufc = 0;\n bufi = 0;\n sb = new StringBuilder();\n }\n\n private void fillBuf() throws IOException {\n bufi = 0;\n bufc = 0;\n while(bufc == 0) {\n bufc = r.read(buf, 0, BUFSIZE);\n if(bufc == -1) {\n bufc = 0;\n return;\n }\n }\n }\n\n private boolean pumpBuf() throws IOException {\n if(bufi == bufc) {\n fillBuf();\n }\n return bufc != 0;\n }\n\n private boolean isDelimiter(char c) {\n return c == ' ' || c == '\\t' || c == '\\n' || c == '\\r' || c == '\\f';\n }\n\n private void eatDelimiters() throws IOException {\n while(true) {\n if(bufi == bufc) {\n fillBuf();\n if(bufc == 0) throw new RuntimeException(\"IO: Out of input.\");\n }\n\n if(!isDelimiter(buf[bufi])) break;\n ++bufi;\n }\n }\n\n public String next() {\n try {\n sb.setLength(0);\n\n eatDelimiters();\n int start = bufi;\n\n while(true) {\n if(bufi == bufc) {\n sb.append(buf, start, bufi - start);\n fillBuf();\n start = 0;\n if(bufc == 0) break;\n }\n\n if(isDelimiter(buf[bufi])) break;\n ++bufi;\n }\n\n sb.append(buf, start, bufi - start);\n\n return sb.toString();\n } catch(IOException e) {\n throw new RuntimeException(\"IO.next: Caught IOException.\");\n }\n }\n\n public int nextInt() {\n try {\n int ret = 0;\n\n eatDelimiters();\n\n boolean positive = true;\n if(buf[bufi] == '-') {\n ++bufi;\n if(!pumpBuf()) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n positive = false;\n }\n\n boolean first = true;\n while(true) {\n if(!pumpBuf()) break;\n if(isDelimiter(buf[bufi])) {\n if(first) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n break;\n }\n first = false;\n\n if(buf[bufi] >= '0' && buf[bufi] <= '9') {\n if(ret < -214748364) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n ret *= 10;\n ret -= (int)(buf[bufi] - '0');\n if(ret > 0) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n } else {\n throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n }\n\n ++bufi;\n }\n\n if(positive) {\n if(ret == -2147483648) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n ret = -ret;\n }\n\n return ret;\n } catch(IOException e) {\n throw new RuntimeException(\"IO.nextInt: Caught IOException.\");\n }\n }\n\n public long nextLong() {\n try {\n long ret = 0;\n\n eatDelimiters();\n\n boolean positive = true;\n if(buf[bufi] == '-') {\n ++bufi;\n if(!pumpBuf()) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n positive = false;\n }\n\n boolean first = true;\n while(true) {\n if(!pumpBuf()) break;\n if(isDelimiter(buf[bufi])) {\n if(first) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n break;\n }\n first = false;\n\n if(buf[bufi] >= '0' && buf[bufi] <= '9') {\n if(ret < -922337203685477580L) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n ret *= 10;\n ret -= (long)(buf[bufi] - '0');\n if(ret > 0) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n } else {\n throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n }\n\n ++bufi;\n }\n\n if(positive) {\n if(ret == -9223372036854775808L) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n ret = -ret;\n }\n\n return ret;\n } catch(IOException e) {\n throw new RuntimeException(\"IO.nextLong: Caught IOException.\");\n }\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n }\n }\n\n}\n\n", "language": "Java", "metadata": {"date": 1471139341, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04026.html", "problem_id": "p04026", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04026/input.txt", "sample_output_relpath": "derived/input_output/data/p04026/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04026/Java/s045188828.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s045188828", "user_id": "u935684968"}, "prompt_components": {"gold_output": "2 5\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n Solver solver = new Solver();\n }\n\n static class Solver {\n IO io;\n\n public Solver() {\n this.io = new IO();\n try {\n io.println(solve());\n } finally {\n io.close();\n }\n }\n\n /****************************** START READING HERE ********************************/\n\n String solve() {\n String s = io.next();\n for (int i=1; i 3) {\n char other = s.charAt(left++);\n count[other]--;\n }\n if (count[c] >= 2) return (left+1) + \" \" + right;\n }\n\n return \"-1 -1\";\n }\n\n /************************** UTILITY CODE BELOW THIS LINE **************************/\n\n class Point {\n int y;\n int x;\n\n public Point(int y, int x) {\n this.y = y;\n this.x = x;\n }\n }\n\n class IDval implements Comparable {\n int id;\n long val;\n\n public IDval(int id, long val) {\n this.val = val;\n this.id = id;\n }\n\n @Override\n public int compareTo(IDval o) {\n if (this.val < o.val) return -1;\n if (this.val > o.val) return 1;\n return this.id - o.id;\n }\n }\n\n private List[] toGraph(IO io, int n) {\n List[] g = new ArrayList[n+1];\n for (int i=1; i<=n; i++) g[i] = new ArrayList<>();\n for (int i=1; i<=n-1; i++) {\n int a = io.nextInt();\n int b = io.nextInt();\n g[a].add(b);\n g[b].add(a);\n }\n return g;\n }\n\n private class IO extends PrintWriter {\n private InputStreamReader r;\n private static final int BUFSIZE = 1 << 15;\n private char[] buf;\n private int bufc;\n private int bufi;\n private StringBuilder sb;\n\n public IO() {\n super(new BufferedOutputStream(System.out));\n r = new InputStreamReader(System.in);\n\n buf = new char[BUFSIZE];\n bufc = 0;\n bufi = 0;\n sb = new StringBuilder();\n }\n\n private void fillBuf() throws IOException {\n bufi = 0;\n bufc = 0;\n while(bufc == 0) {\n bufc = r.read(buf, 0, BUFSIZE);\n if(bufc == -1) {\n bufc = 0;\n return;\n }\n }\n }\n\n private boolean pumpBuf() throws IOException {\n if(bufi == bufc) {\n fillBuf();\n }\n return bufc != 0;\n }\n\n private boolean isDelimiter(char c) {\n return c == ' ' || c == '\\t' || c == '\\n' || c == '\\r' || c == '\\f';\n }\n\n private void eatDelimiters() throws IOException {\n while(true) {\n if(bufi == bufc) {\n fillBuf();\n if(bufc == 0) throw new RuntimeException(\"IO: Out of input.\");\n }\n\n if(!isDelimiter(buf[bufi])) break;\n ++bufi;\n }\n }\n\n public String next() {\n try {\n sb.setLength(0);\n\n eatDelimiters();\n int start = bufi;\n\n while(true) {\n if(bufi == bufc) {\n sb.append(buf, start, bufi - start);\n fillBuf();\n start = 0;\n if(bufc == 0) break;\n }\n\n if(isDelimiter(buf[bufi])) break;\n ++bufi;\n }\n\n sb.append(buf, start, bufi - start);\n\n return sb.toString();\n } catch(IOException e) {\n throw new RuntimeException(\"IO.next: Caught IOException.\");\n }\n }\n\n public int nextInt() {\n try {\n int ret = 0;\n\n eatDelimiters();\n\n boolean positive = true;\n if(buf[bufi] == '-') {\n ++bufi;\n if(!pumpBuf()) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n positive = false;\n }\n\n boolean first = true;\n while(true) {\n if(!pumpBuf()) break;\n if(isDelimiter(buf[bufi])) {\n if(first) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n break;\n }\n first = false;\n\n if(buf[bufi] >= '0' && buf[bufi] <= '9') {\n if(ret < -214748364) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n ret *= 10;\n ret -= (int)(buf[bufi] - '0');\n if(ret > 0) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n } else {\n throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n }\n\n ++bufi;\n }\n\n if(positive) {\n if(ret == -2147483648) throw new RuntimeException(\"IO.nextInt: Invalid int.\");\n ret = -ret;\n }\n\n return ret;\n } catch(IOException e) {\n throw new RuntimeException(\"IO.nextInt: Caught IOException.\");\n }\n }\n\n public long nextLong() {\n try {\n long ret = 0;\n\n eatDelimiters();\n\n boolean positive = true;\n if(buf[bufi] == '-') {\n ++bufi;\n if(!pumpBuf()) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n positive = false;\n }\n\n boolean first = true;\n while(true) {\n if(!pumpBuf()) break;\n if(isDelimiter(buf[bufi])) {\n if(first) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n break;\n }\n first = false;\n\n if(buf[bufi] >= '0' && buf[bufi] <= '9') {\n if(ret < -922337203685477580L) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n ret *= 10;\n ret -= (long)(buf[bufi] - '0');\n if(ret > 0) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n } else {\n throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n }\n\n ++bufi;\n }\n\n if(positive) {\n if(ret == -9223372036854775808L) throw new RuntimeException(\"IO.nextLong: Invalid long.\");\n ret = -ret;\n }\n\n return ret;\n } catch(IOException e) {\n throw new RuntimeException(\"IO.nextLong: Caught IOException.\");\n }\n }\n\n public double nextDouble() {\n return Double.parseDouble(next());\n }\n\n }\n }\n\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven a string t, we will call it unbalanced if and only if the length of t is at least 2, and more than half of the letters in t are the same. For example, both voodoo and melee are unbalanced, while neither noon nor a is.\n\nYou are given a string s consisting of lowercase letters. Determine if there exists a (contiguous) substring of s that is unbalanced. If the answer is positive, show a position where such a substring occurs in s.\n\nConstraints\n\n2 ≦ |s| ≦ 10^5\n\ns consists of lowercase letters.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 2 ≦ N ≦ 100.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf there exists no unbalanced substring of s, print -1 -1.\n\nIf there exists an unbalanced substring of s, let one such substring be s_a s_{a+1} ... s_{b} (1 ≦ a < b ≦ |s|), and print a b. If there exists more than one such substring, any of them will be accepted.\n\nSample Input 1\n\nneeded\n\nSample Output 1\n\n2 5\n\nThe string s_2 s_3 s_4 s_5 = eede is unbalanced. There are also other unbalanced substrings. For example, the output 2 6 will also be accepted.\n\nSample Input 2\n\natcoder\n\nSample Output 2\n\n-1 -1\n\nThe string atcoder contains no unbalanced substring.", "sample_input": "needed\n"}, "reference_outputs": ["2 5\n"], "source_document_id": "p04026", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven a string t, we will call it unbalanced if and only if the length of t is at least 2, and more than half of the letters in t are the same. For example, both voodoo and melee are unbalanced, while neither noon nor a is.\n\nYou are given a string s consisting of lowercase letters. Determine if there exists a (contiguous) substring of s that is unbalanced. If the answer is positive, show a position where such a substring occurs in s.\n\nConstraints\n\n2 ≦ |s| ≦ 10^5\n\ns consists of lowercase letters.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 2 ≦ N ≦ 100.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf there exists no unbalanced substring of s, print -1 -1.\n\nIf there exists an unbalanced substring of s, let one such substring be s_a s_{a+1} ... s_{b} (1 ≦ a < b ≦ |s|), and print a b. If there exists more than one such substring, any of them will be accepted.\n\nSample Input 1\n\nneeded\n\nSample Output 1\n\n2 5\n\nThe string s_2 s_3 s_4 s_5 = eede is unbalanced. There are also other unbalanced substrings. For example, the output 2 6 will also be accepted.\n\nSample Input 2\n\natcoder\n\nSample Output 2\n\n-1 -1\n\nThe string atcoder contains no unbalanced substring.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8367, "cpu_time_ms": 205, "memory_kb": 10836}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s184703739", "group_id": "codeNet:p04029", "input_text": "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n \n int N=sc.nextInt();\n int sum=0;\n for(int i=1; i<=N; i++){\n sum+=i;\n }\n System.out.println(sum);\n }\n}", "language": "Java", "metadata": {"date": 1564920440, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04029.html", "problem_id": "p04029", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04029/input.txt", "sample_output_relpath": "derived/input_output/data/p04029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04029/Java/s184703739.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s184703739", "user_id": "u378487414"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.Scanner;\nclass Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n \n int N=sc.nextInt();\n int sum=0;\n for(int i=1; i<=N; i++){\n sum+=i;\n }\n System.out.println(sum);\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N children in AtCoder Kindergarten. Mr. Evi will arrange the children in a line, then give 1 candy to the first child in the line, 2 candies to the second child, ..., N candies to the N-th child. How many candies will be necessary in total?\n\nConstraints\n\n1≦N≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the necessary number of candies in total.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nThe answer is 1+2+3=6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n55\n\nThe sum of the integers from 1 to 10 is 55.\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nOnly one child. The answer is 1 in this case.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p04029", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N children in AtCoder Kindergarten. Mr. Evi will arrange the children in a line, then give 1 candy to the first child in the line, 2 candies to the second child, ..., N candies to the N-th child. How many candies will be necessary in total?\n\nConstraints\n\n1≦N≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the necessary number of candies in total.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nThe answer is 1+2+3=6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n55\n\nThe sum of the integers from 1 to 10 is 55.\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nOnly one child. The answer is 1 in this case.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 236, "cpu_time_ms": 96, "memory_kb": 23252}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s047914467", "group_id": "codeNet:p04029", "input_text": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint N = scanner.nextInt();\n\n\t\tSystem.out.println(N*(N+1)/2);\n\n\t\tscanner.close();\n\t}\n}\n", "language": "Java", "metadata": {"date": 1556296071, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04029.html", "problem_id": "p04029", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04029/input.txt", "sample_output_relpath": "derived/input_output/data/p04029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04029/Java/s047914467.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s047914467", "user_id": "u916633312"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\tint N = scanner.nextInt();\n\n\t\tSystem.out.println(N*(N+1)/2);\n\n\t\tscanner.close();\n\t}\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N children in AtCoder Kindergarten. Mr. Evi will arrange the children in a line, then give 1 candy to the first child in the line, 2 candies to the second child, ..., N candies to the N-th child. How many candies will be necessary in total?\n\nConstraints\n\n1≦N≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the necessary number of candies in total.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nThe answer is 1+2+3=6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n55\n\nThe sum of the integers from 1 to 10 is 55.\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nOnly one child. The answer is 1 in this case.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p04029", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N children in AtCoder Kindergarten. Mr. Evi will arrange the children in a line, then give 1 candy to the first child in the line, 2 candies to the second child, ..., N candies to the N-th child. How many candies will be necessary in total?\n\nConstraints\n\n1≦N≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the necessary number of candies in total.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nThe answer is 1+2+3=6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n55\n\nThe sum of the integers from 1 to 10 is 55.\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nOnly one child. The answer is 1 in this case.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 221, "cpu_time_ms": 116, "memory_kb": 19284}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s391764618", "group_id": "codeNet:p04029", "input_text": "import java.util.*;\nimport java.util.Arrays;\nimport java.util.ArrayList;\nimport java.util.Set;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n int N=sc.nextInt();\n int sum=0;\n for(int i=0;i<=N;i++){\n sum+=i;\n }\n System.out.println(sum);\n\n \n \n}\n \n \n }\n", "language": "Java", "metadata": {"date": 1523726423, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04029.html", "problem_id": "p04029", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04029/input.txt", "sample_output_relpath": "derived/input_output/data/p04029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04029/Java/s391764618.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s391764618", "user_id": "u334656323"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.*;\nimport java.util.Arrays;\nimport java.util.ArrayList;\nimport java.util.Set;\n\npublic class Main{\n public static void main(String[] args){\n Scanner sc=new Scanner(System.in);\n int N=sc.nextInt();\n int sum=0;\n for(int i=0;i<=N;i++){\n sum+=i;\n }\n System.out.println(sum);\n\n \n \n}\n \n \n }\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N children in AtCoder Kindergarten. Mr. Evi will arrange the children in a line, then give 1 candy to the first child in the line, 2 candies to the second child, ..., N candies to the N-th child. How many candies will be necessary in total?\n\nConstraints\n\n1≦N≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the necessary number of candies in total.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nThe answer is 1+2+3=6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n55\n\nThe sum of the integers from 1 to 10 is 55.\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nOnly one child. The answer is 1 in this case.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p04029", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N children in AtCoder Kindergarten. Mr. Evi will arrange the children in a line, then give 1 candy to the first child in the line, 2 candies to the second child, ..., N candies to the N-th child. How many candies will be necessary in total?\n\nConstraints\n\n1≦N≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the necessary number of candies in total.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nThe answer is 1+2+3=6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n55\n\nThe sum of the integers from 1 to 10 is 55.\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nOnly one child. The answer is 1 in this case.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 388, "cpu_time_ms": 95, "memory_kb": 21204}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s458206181", "group_id": "codeNet:p04031", "input_text": "import java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\nclass AC043C {}\n\nclass Main {\n public static void main(String[] args) throws IOException {\n int n = ri(), a[] = ria(n);\n long min = LMAX;\n for(int i = -101; i < 101; ++i) {\n int x = 0;\n for(int aa : a) x += (long) (i - aa) * (i - aa);\n min = min(min, x);\n }\n prln(min);\n close();\n }\n\n static BufferedReader __in = new BufferedReader(new InputStreamReader(System.in));\n static PrintWriter __out = new PrintWriter(new OutputStreamWriter(System.out));\n static StringTokenizer input;\n\n // references\n // IBIG = 1e9 + 7\n // IRAND ~= 3e8\n // IMAX ~= 2e10\n // LMAX ~= 9e18\n // constants\n static final int IBIG = 1000000007;\n static final int IRAND = 327859546;\n static final int IMAX = 2147483647;\n static final int IMIN = -2147483648;\n static final long LMAX = 9223372036854775807L;\n static final long LMIN = -9223372036854775808L;\n // util\n static int minof(int a, int b, int c) {return min(a, min(b, c));}\n static int minof(int... x) {return x.length == 1 ? x[0] : x.length == 2 ? min(x[0], x[1]) : min(x[0], minstarting(1, x));}\n static int minstarting(int offset, int... x) {assert x.length > 2; return offset == x.length - 2 ? min(x[offset], x[offset + 1]) : min(x[offset], minstarting(offset + 1, x));}\n static long minof(long a, long b, long c) {return min(a, min(b, c));}\n static long minof(long... x) {return x.length == 1 ? x[0] : x.length == 2 ? min(x[0], x[1]) : min(x[0], minstarting(1, x));}\n static long minstarting(int offset, long... x) {assert x.length > 2; return offset == x.length - 2 ? min(x[offset], x[offset + 1]) : min(x[offset], minstarting(offset + 1, x));}\n static int maxof(int a, int b, int c) {return max(a, max(b, c));}\n static int maxof(int... x) {return x.length == 1 ? x[0] : x.length == 2 ? max(x[0], x[1]) : max(x[0], maxstarting(1, x));}\n static int maxstarting(int offset, int... x) {assert x.length > 2; return offset == x.length - 2 ? max(x[offset], x[offset + 1]) : max(x[offset], maxstarting(offset + 1, x));}\n static long maxof(long a, long b, long c) {return max(a, max(b, c));}\n static long maxof(long... x) {return x.length == 1 ? x[0] : x.length == 2 ? max(x[0], x[1]) : max(x[0], maxstarting(1, x));}\n static long maxstarting(int offset, long... x) {assert x.length > 2; return offset == x.length - 2 ? max(x[offset], x[offset + 1]) : max(x[offset], maxstarting(offset + 1, x));}\n static int powi(int a, int b) {if(a == 0) return 0; int ans = 1; while(b > 0) {if((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}\n static long powl(long a, int b) {if(a == 0) return 0; long ans = 1; while(b > 0) {if((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}\n static int floori(double d) {return (int)d;}\n static int ceili(double d) {return (int)ceil(d);}\n static long floorl(double d) {return (long)d;}\n static long ceill(double d) {return (long)ceil(d);}\n // input\n static void r() throws IOException {input = new StringTokenizer(__in.readLine());}\n static int ri() throws IOException {return Integer.parseInt(__in.readLine());}\n static long rl() throws IOException {return Long.parseLong(__in.readLine());}\n static int[] ria(int n) throws IOException {int[] a = new int[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Integer.parseInt(input.nextToken()); return a;}\n static long[] rla(int n) throws IOException {long[] a = new long[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Long.parseLong(input.nextToken()); return a;}\n static char[] rcha() throws IOException {return __in.readLine().toCharArray();}\n static String rline() throws IOException {return __in.readLine();}\n static int rni() throws IOException {input = new StringTokenizer(__in.readLine()); return Integer.parseInt(input.nextToken());}\n static int ni() {return Integer.parseInt(input.nextToken());}\n static long rnl() throws IOException {input = new StringTokenizer(__in.readLine()); return Long.parseLong(input.nextToken());}\n static long nl() {return Long.parseLong(input.nextToken());}\n // output\n static void pr(int i) {__out.print(i);}\n static void prln(int i) {__out.println(i);}\n static void pr(long l) {__out.print(l);}\n static void prln(long l) {__out.println(l);}\n static void pr(double d) {__out.print(d);}\n static void prln(double d) {__out.println(d);}\n static void pr(char c) {__out.print(c);}\n static void prln(char c) {__out.println(c);}\n static void pr(char[] s) {__out.print(new String(s));}\n static void prln(char[] s) {__out.println(new String(s));}\n static void pr(String s) {__out.print(s);}\n static void prln(String s) {__out.println(s);}\n static void pr(Object o) {__out.print(o);}\n static void prln(Object o) {__out.println(o);}\n static void prln() {__out.println();}\n static void pryes() {__out.println(\"yes\");}\n static void pry() {__out.println(\"Yes\");}\n static void prY() {__out.println(\"YES\");}\n static void prno() {__out.println(\"no\");}\n static void prn() {__out.println(\"No\");}\n static void prN() {__out.println(\"NO\");}\n static void pryesno(boolean b) {__out.println(b ? \"yes\" : \"no\");};\n static void pryn(boolean b) {__out.println(b ? \"Yes\" : \"No\");}\n static void prYN(boolean b) {__out.println(b ? \"YES\" : \"NO\");}\n static void prln(int... a) {for(int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i); __out.println(a[a.length - 1]);}\n static void prln(long... a) {for(int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i); __out.println(a[a.length - 1]);}\n static void prln(Collection c) {int n = c.size() - 1; Iterator iter = c.iterator(); for(int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i); __out.println(iter.next());}\n static void flush() {__out.flush();}\n static void close() {__out.close();}}\n", "language": "Java", "metadata": {"date": 1601195628, "filename_ext": "java", "original_language": "Java (OpenJDK 11.0.6)", "problem_description_relpath": "problem_descriptions/p04031.html", "problem_id": "p04031", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04031/input.txt", "sample_output_relpath": "derived/input_output/data/p04031/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04031/Java/s458206181.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s458206181", "user_id": "u494318775"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "import java.io.*;\nimport java.util.*;\n\nimport static java.lang.Math.*;\nimport static java.util.Arrays.*;\n\nclass AC043C {}\n\nclass Main {\n public static void main(String[] args) throws IOException {\n int n = ri(), a[] = ria(n);\n long min = LMAX;\n for(int i = -101; i < 101; ++i) {\n int x = 0;\n for(int aa : a) x += (long) (i - aa) * (i - aa);\n min = min(min, x);\n }\n prln(min);\n close();\n }\n\n static BufferedReader __in = new BufferedReader(new InputStreamReader(System.in));\n static PrintWriter __out = new PrintWriter(new OutputStreamWriter(System.out));\n static StringTokenizer input;\n\n // references\n // IBIG = 1e9 + 7\n // IRAND ~= 3e8\n // IMAX ~= 2e10\n // LMAX ~= 9e18\n // constants\n static final int IBIG = 1000000007;\n static final int IRAND = 327859546;\n static final int IMAX = 2147483647;\n static final int IMIN = -2147483648;\n static final long LMAX = 9223372036854775807L;\n static final long LMIN = -9223372036854775808L;\n // util\n static int minof(int a, int b, int c) {return min(a, min(b, c));}\n static int minof(int... x) {return x.length == 1 ? x[0] : x.length == 2 ? min(x[0], x[1]) : min(x[0], minstarting(1, x));}\n static int minstarting(int offset, int... x) {assert x.length > 2; return offset == x.length - 2 ? min(x[offset], x[offset + 1]) : min(x[offset], minstarting(offset + 1, x));}\n static long minof(long a, long b, long c) {return min(a, min(b, c));}\n static long minof(long... x) {return x.length == 1 ? x[0] : x.length == 2 ? min(x[0], x[1]) : min(x[0], minstarting(1, x));}\n static long minstarting(int offset, long... x) {assert x.length > 2; return offset == x.length - 2 ? min(x[offset], x[offset + 1]) : min(x[offset], minstarting(offset + 1, x));}\n static int maxof(int a, int b, int c) {return max(a, max(b, c));}\n static int maxof(int... x) {return x.length == 1 ? x[0] : x.length == 2 ? max(x[0], x[1]) : max(x[0], maxstarting(1, x));}\n static int maxstarting(int offset, int... x) {assert x.length > 2; return offset == x.length - 2 ? max(x[offset], x[offset + 1]) : max(x[offset], maxstarting(offset + 1, x));}\n static long maxof(long a, long b, long c) {return max(a, max(b, c));}\n static long maxof(long... x) {return x.length == 1 ? x[0] : x.length == 2 ? max(x[0], x[1]) : max(x[0], maxstarting(1, x));}\n static long maxstarting(int offset, long... x) {assert x.length > 2; return offset == x.length - 2 ? max(x[offset], x[offset + 1]) : max(x[offset], maxstarting(offset + 1, x));}\n static int powi(int a, int b) {if(a == 0) return 0; int ans = 1; while(b > 0) {if((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}\n static long powl(long a, int b) {if(a == 0) return 0; long ans = 1; while(b > 0) {if((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}\n static int floori(double d) {return (int)d;}\n static int ceili(double d) {return (int)ceil(d);}\n static long floorl(double d) {return (long)d;}\n static long ceill(double d) {return (long)ceil(d);}\n // input\n static void r() throws IOException {input = new StringTokenizer(__in.readLine());}\n static int ri() throws IOException {return Integer.parseInt(__in.readLine());}\n static long rl() throws IOException {return Long.parseLong(__in.readLine());}\n static int[] ria(int n) throws IOException {int[] a = new int[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Integer.parseInt(input.nextToken()); return a;}\n static long[] rla(int n) throws IOException {long[] a = new long[n]; input = new StringTokenizer(__in.readLine()); for(int i = 0; i < n; ++i) a[i] = Long.parseLong(input.nextToken()); return a;}\n static char[] rcha() throws IOException {return __in.readLine().toCharArray();}\n static String rline() throws IOException {return __in.readLine();}\n static int rni() throws IOException {input = new StringTokenizer(__in.readLine()); return Integer.parseInt(input.nextToken());}\n static int ni() {return Integer.parseInt(input.nextToken());}\n static long rnl() throws IOException {input = new StringTokenizer(__in.readLine()); return Long.parseLong(input.nextToken());}\n static long nl() {return Long.parseLong(input.nextToken());}\n // output\n static void pr(int i) {__out.print(i);}\n static void prln(int i) {__out.println(i);}\n static void pr(long l) {__out.print(l);}\n static void prln(long l) {__out.println(l);}\n static void pr(double d) {__out.print(d);}\n static void prln(double d) {__out.println(d);}\n static void pr(char c) {__out.print(c);}\n static void prln(char c) {__out.println(c);}\n static void pr(char[] s) {__out.print(new String(s));}\n static void prln(char[] s) {__out.println(new String(s));}\n static void pr(String s) {__out.print(s);}\n static void prln(String s) {__out.println(s);}\n static void pr(Object o) {__out.print(o);}\n static void prln(Object o) {__out.println(o);}\n static void prln() {__out.println();}\n static void pryes() {__out.println(\"yes\");}\n static void pry() {__out.println(\"Yes\");}\n static void prY() {__out.println(\"YES\");}\n static void prno() {__out.println(\"no\");}\n static void prn() {__out.println(\"No\");}\n static void prN() {__out.println(\"NO\");}\n static void pryesno(boolean b) {__out.println(b ? \"yes\" : \"no\");};\n static void pryn(boolean b) {__out.println(b ? \"Yes\" : \"No\");}\n static void prYN(boolean b) {__out.println(b ? \"YES\" : \"NO\");}\n static void prln(int... a) {for(int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i); __out.println(a[a.length - 1]);}\n static void prln(long... a) {for(int i = 0, len = a.length - 1; i < len; __out.print(a[i]), __out.print(' '), ++i); __out.println(a[a.length - 1]);}\n static void prln(Collection c) {int n = c.size() - 1; Iterator iter = c.iterator(); for(int i = 0; i < n; __out.print(iter.next()), __out.print(' '), ++i); __out.println(iter.next());}\n static void flush() {__out.flush();}\n static void close() {__out.close();}}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nEvi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.\n\nHe may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).\n\nFind the minimum total cost to achieve his objective.\n\nConstraints\n\n1≦N≦100\n\n-100≦a_i≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum total cost to achieve Evi's objective.\n\nSample Input 1\n\n2\n4 8\n\nSample Output 1\n\n8\n\nTransforming the both into 6s will cost (4-6)^2+(8-6)^2=8 dollars, which is the minimum.\n\nSample Input 2\n\n3\n1 1 3\n\nSample Output 2\n\n3\n\nTransforming the all into 2s will cost (1-2)^2+(1-2)^2+(3-2)^2=3 dollars. Note that Evi has to pay (1-2)^2 dollar separately for transforming each of the two 1s.\n\nSample Input 3\n\n3\n4 2 5\n\nSample Output 3\n\n5\n\nLeaving the 4 as it is and transforming the 2 and the 5 into 4s will achieve the total cost of (2-4)^2+(5-4)^2=5 dollars, which is the minimum.\n\nSample Input 4\n\n4\n-100 -100 -100 -100\n\nSample Output 4\n\n0\n\nWithout transforming anything, Evi's objective is already achieved. Thus, the necessary cost is 0.", "sample_input": "2\n4 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p04031", "source_text": "Score : 200 points\n\nProblem Statement\n\nEvi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.\n\nHe may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).\n\nFind the minimum total cost to achieve his objective.\n\nConstraints\n\n1≦N≦100\n\n-100≦a_i≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum total cost to achieve Evi's objective.\n\nSample Input 1\n\n2\n4 8\n\nSample Output 1\n\n8\n\nTransforming the both into 6s will cost (4-6)^2+(8-6)^2=8 dollars, which is the minimum.\n\nSample Input 2\n\n3\n1 1 3\n\nSample Output 2\n\n3\n\nTransforming the all into 2s will cost (1-2)^2+(1-2)^2+(3-2)^2=3 dollars. Note that Evi has to pay (1-2)^2 dollar separately for transforming each of the two 1s.\n\nSample Input 3\n\n3\n4 2 5\n\nSample Output 3\n\n5\n\nLeaving the 4 as it is and transforming the 2 and the 5 into 4s will achieve the total cost of (2-4)^2+(5-4)^2=5 dollars, which is the minimum.\n\nSample Input 4\n\n4\n-100 -100 -100 -100\n\nSample Output 4\n\n0\n\nWithout transforming anything, Evi's objective is already achieved. Thus, the necessary cost is 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6118, "cpu_time_ms": 81, "memory_kb": 32808}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s796383790", "group_id": "codeNet:p04033", "input_text": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n // write your code here\n Scanner sc = new Scanner(System.in);\n\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n if (a == 0 || b == 0) {\n System.out.println(\"Zero\");\n return;\n }\n\n if (a > 0) {\n System.out.println(b > 0 ? \"Positive\" : \"Zero\");\n } else {\n if (b > 0) {\n System.out.println( \"Zero\");\n } else {\n System.out.println(Math.abs(a - b) % 2 == 1 ? \"Positive\" : \"Negative\");\n }\n }\n }\n}", "language": "Java", "metadata": {"date": 1588604307, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04033.html", "problem_id": "p04033", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04033/input.txt", "sample_output_relpath": "derived/input_output/data/p04033/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04033/Java/s796383790.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s796383790", "user_id": "u711620077"}, "prompt_components": {"gold_output": "Positive\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) {\n // write your code here\n Scanner sc = new Scanner(System.in);\n\n int a = sc.nextInt();\n int b = sc.nextInt();\n\n if (a == 0 || b == 0) {\n System.out.println(\"Zero\");\n return;\n }\n\n if (a > 0) {\n System.out.println(b > 0 ? \"Positive\" : \"Zero\");\n } else {\n if (b > 0) {\n System.out.println( \"Zero\");\n } else {\n System.out.println(Math.abs(a - b) % 2 == 1 ? \"Positive\" : \"Negative\");\n }\n }\n }\n}", "problem_context": "Problem Statement\n\nYou are given two integers a and b (a≤b). Determine if the product of the integers a, a+1, …, b is positive, negative or zero.\n\nConstraints\n\na and b are integers.\n\n-10^9≤a≤b≤10^9\n\nPartial Score\n\nIn test cases worth 100 points, -10≤a≤b≤10.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is positive, print Positive. If it is negative, print Negative. If it is zero, print Zero.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nPositive\n\n1×2×3=6 is positive.\n\nSample Input 2\n\n-3 -1\n\nSample Output 2\n\nNegative\n\n(-3)×(-2)×(-1)=-6 is negative.\n\nSample Input 3\n\n-1 1\n\nSample Output 3\n\nZero\n\n(-1)×0×1=0.", "sample_input": "1 3\n"}, "reference_outputs": ["Positive\n"], "source_document_id": "p04033", "source_text": "Problem Statement\n\nYou are given two integers a and b (a≤b). Determine if the product of the integers a, a+1, …, b is positive, negative or zero.\n\nConstraints\n\na and b are integers.\n\n-10^9≤a≤b≤10^9\n\nPartial Score\n\nIn test cases worth 100 points, -10≤a≤b≤10.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is positive, print Positive. If it is negative, print Negative. If it is zero, print Zero.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nPositive\n\n1×2×3=6 is positive.\n\nSample Input 2\n\n-3 -1\n\nSample Output 2\n\nNegative\n\n(-3)×(-2)×(-1)=-6 is negative.\n\nSample Input 3\n\n-1 1\n\nSample Output 3\n\nZero\n\n(-1)×0×1=0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 638, "cpu_time_ms": 94, "memory_kb": 22612}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s144789132", "group_id": "codeNet:p04033", "input_text": "\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Main {\n\tInputStream is;\n\n\tint __t__ = 1;\n\tint __f__ = 0;\n\tint __FILE_DEBUG_FLAG__ = __f__;\n\tString __DEBUG_FILE_NAME__ = \"src/D1\";\n\n\tFastScanner in;\n\tPrintWriter out;\n\t\n\tpublic void solve() {\n\t\tint a = in.nextInt();\n\t\tint b = in.nextInt();\n\t\t\n\t\tif (a == 0 || b == 0 || (a < 0 && b > 0)) {\n\t\t\tSystem.out.println(\"Zero\");\n\t\t\treturn;\n\t\t} else if (a > 0 || (b - a + 1) % 2 == 0) {\n\t\t\tSystem.out.println(\"Positive\");\n\t\t\treturn;\n\t\t} else {\n\t\t\tSystem.out.println(\"Negative\");\n\t\t}\n\t\t\n\t}\n\n\tpublic void run() {\n\t\tif (__FILE_DEBUG_FLAG__ == __t__) {\n\t\t\ttry {\n\t\t\t\tis = new FileInputStream(__DEBUG_FILE_NAME__);\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tSystem.out.println(\"FILE_INPUT!\");\n\t\t} else {\n\t\t\tis = System.in;\n\t\t}\n\t\tin = new FastScanner(is);\n\t\tout = new PrintWriter(System.out);\n\n\t\tsolve();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tpublic void mapDebug(int[][] a) {\n\t\tSystem.out.println(\"--------map display---------\");\n\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tfor (int j = 0; j < a[i].length; j++) {\n\t\t\t\tSystem.out.printf(\"%3d \", a[i][j]);\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\n\t\tSystem.out.println(\"----------------------------\");\n\t\tSystem.out.println();\n\t}\n\n\tpublic void debug(Object... obj) {\n\t\tSystem.out.println(Arrays.deepToString(obj));\n\t}\n\n\tclass FastScanner {\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t\t//stream = new FileInputStream(new File(\"dec.in\"));\n\n\t\t}\n\n\t\tint read() {\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tboolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tboolean isEndline(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tint[] nextIntArray(int n) {\n\t\t\tint[] array = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextInt();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tint[][] nextIntMap(int n, int m) {\n\t\t\tint[][] map = new int[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextIntArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tlong[] nextLongArray(int n) {\n\t\t\tlong[] array = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextLong();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tlong[][] nextLongMap(int n, int m) {\n\t\t\tlong[][] map = new long[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextLongArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tdouble[] nextDoubleArray(int n) {\n\t\t\tdouble[] array = new double[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextDouble();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tdouble[][] nextDoubleMap(int n, int m) {\n\t\t\tdouble[][] map = new double[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextDoubleArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tString next() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tString[] nextStringArray(int n) {\n\t\t\tString[] array = new String[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = next();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tint c = read();\n\t\t\twhile (isEndline(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isEndline(c));\n\t\t\treturn res.toString();\n\t\t}\n\t}\n}\n\n", "language": "Java", "metadata": {"date": 1470013558, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04033.html", "problem_id": "p04033", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04033/input.txt", "sample_output_relpath": "derived/input_output/data/p04033/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04033/Java/s144789132.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s144789132", "user_id": "u617255029"}, "prompt_components": {"gold_output": "Positive\n", "input_to_evaluate": "\nimport java.io.FileInputStream;\nimport java.io.FileNotFoundException;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Main {\n\tInputStream is;\n\n\tint __t__ = 1;\n\tint __f__ = 0;\n\tint __FILE_DEBUG_FLAG__ = __f__;\n\tString __DEBUG_FILE_NAME__ = \"src/D1\";\n\n\tFastScanner in;\n\tPrintWriter out;\n\t\n\tpublic void solve() {\n\t\tint a = in.nextInt();\n\t\tint b = in.nextInt();\n\t\t\n\t\tif (a == 0 || b == 0 || (a < 0 && b > 0)) {\n\t\t\tSystem.out.println(\"Zero\");\n\t\t\treturn;\n\t\t} else if (a > 0 || (b - a + 1) % 2 == 0) {\n\t\t\tSystem.out.println(\"Positive\");\n\t\t\treturn;\n\t\t} else {\n\t\t\tSystem.out.println(\"Negative\");\n\t\t}\n\t\t\n\t}\n\n\tpublic void run() {\n\t\tif (__FILE_DEBUG_FLAG__ == __t__) {\n\t\t\ttry {\n\t\t\t\tis = new FileInputStream(__DEBUG_FILE_NAME__);\n\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\tSystem.out.println(\"FILE_INPUT!\");\n\t\t} else {\n\t\t\tis = System.in;\n\t\t}\n\t\tin = new FastScanner(is);\n\t\tout = new PrintWriter(System.out);\n\n\t\tsolve();\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tnew Main().run();\n\t}\n\n\tpublic void mapDebug(int[][] a) {\n\t\tSystem.out.println(\"--------map display---------\");\n\n\t\tfor (int i = 0; i < a.length; i++) {\n\t\t\tfor (int j = 0; j < a[i].length; j++) {\n\t\t\t\tSystem.out.printf(\"%3d \", a[i][j]);\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\n\t\tSystem.out.println(\"----------------------------\");\n\t\tSystem.out.println();\n\t}\n\n\tpublic void debug(Object... obj) {\n\t\tSystem.out.println(Arrays.deepToString(obj));\n\t}\n\n\tclass FastScanner {\n\t\tprivate InputStream stream;\n\t\tprivate byte[] buf = new byte[1024];\n\t\tprivate int curChar;\n\t\tprivate int numChars;\n\n\t\tpublic FastScanner(InputStream stream) {\n\t\t\tthis.stream = stream;\n\t\t\t//stream = new FileInputStream(new File(\"dec.in\"));\n\n\t\t}\n\n\t\tint read() {\n\t\t\tif (numChars == -1)\n\t\t\t\tthrow new InputMismatchException();\n\t\t\tif (curChar >= numChars) {\n\t\t\t\tcurChar = 0;\n\t\t\t\ttry {\n\t\t\t\t\tnumChars = stream.read(buf);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new InputMismatchException();\n\t\t\t\t}\n\t\t\t\tif (numChars <= 0)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn buf[curChar++];\n\t\t}\n\n\t\tboolean isSpaceChar(int c) {\n\t\t\treturn c == ' ' || c == '\\n' || c == '\\r' || c == '\\t' || c == -1;\n\t\t}\n\n\t\tboolean isEndline(int c) {\n\t\t\treturn c == '\\n' || c == '\\r' || c == -1;\n\t\t}\n\n\t\tint nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tint[] nextIntArray(int n) {\n\t\t\tint[] array = new int[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextInt();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tint[][] nextIntMap(int n, int m) {\n\t\t\tint[][] map = new int[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextIntArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tlong nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tlong[] nextLongArray(int n) {\n\t\t\tlong[] array = new long[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextLong();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tlong[][] nextLongMap(int n, int m) {\n\t\t\tlong[][] map = new long[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextLongArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tdouble nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\n\t\tdouble[] nextDoubleArray(int n) {\n\t\t\tdouble[] array = new double[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = nextDouble();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tdouble[][] nextDoubleMap(int n, int m) {\n\t\t\tdouble[][] map = new double[n][m];\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tmap[i] = in.nextDoubleArray(m);\n\t\t\t}\n\t\t\treturn map;\n\t\t}\n\n\t\tString next() {\n\t\t\tint c = read();\n\t\t\twhile (isSpaceChar(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isSpaceChar(c));\n\t\t\treturn res.toString();\n\t\t}\n\n\t\tString[] nextStringArray(int n) {\n\t\t\tString[] array = new String[n];\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t\tarray[i] = next();\n\n\t\t\treturn array;\n\t\t}\n\n\t\tString nextLine() {\n\t\t\tint c = read();\n\t\t\twhile (isEndline(c))\n\t\t\t\tc = read();\n\t\t\tStringBuilder res = new StringBuilder();\n\t\t\tdo {\n\t\t\t\tres.appendCodePoint(c);\n\t\t\t\tc = read();\n\t\t\t} while (!isEndline(c));\n\t\t\treturn res.toString();\n\t\t}\n\t}\n}\n\n", "problem_context": "Problem Statement\n\nYou are given two integers a and b (a≤b). Determine if the product of the integers a, a+1, …, b is positive, negative or zero.\n\nConstraints\n\na and b are integers.\n\n-10^9≤a≤b≤10^9\n\nPartial Score\n\nIn test cases worth 100 points, -10≤a≤b≤10.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is positive, print Positive. If it is negative, print Negative. If it is zero, print Zero.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nPositive\n\n1×2×3=6 is positive.\n\nSample Input 2\n\n-3 -1\n\nSample Output 2\n\nNegative\n\n(-3)×(-2)×(-1)=-6 is negative.\n\nSample Input 3\n\n-1 1\n\nSample Output 3\n\nZero\n\n(-1)×0×1=0.", "sample_input": "1 3\n"}, "reference_outputs": ["Positive\n"], "source_document_id": "p04033", "source_text": "Problem Statement\n\nYou are given two integers a and b (a≤b). Determine if the product of the integers a, a+1, …, b is positive, negative or zero.\n\nConstraints\n\na and b are integers.\n\n-10^9≤a≤b≤10^9\n\nPartial Score\n\nIn test cases worth 100 points, -10≤a≤b≤10.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is positive, print Positive. If it is negative, print Negative. If it is zero, print Zero.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nPositive\n\n1×2×3=6 is positive.\n\nSample Input 2\n\n-3 -1\n\nSample Output 2\n\nNegative\n\n(-3)×(-2)×(-1)=-6 is negative.\n\nSample Input 3\n\n-1 1\n\nSample Output 3\n\nZero\n\n(-1)×0×1=0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4087, "cpu_time_ms": 159, "memory_kb": 8020}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s609613357", "group_id": "codeNet:p04034", "input_text": "\n\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint x = 0;\n\t\tint y = 0;\n\n\t\tint[] balls = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tballs[i] = 1;\n\t\t}\n\n\t\tboolean[] red = new boolean[n];\n\t\tred[0] = true;\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tx = Integer.parseInt(sc.next()) - 1;\n\t\t\ty = Integer.parseInt(sc.next()) - 1;\n\n\t\t\tif (red[x]) {\n\t\t\t\tred[y] = true;\n\t\t\t}\n\t\t\tballs[x]--;\n\t\t\tballs[y]++;\n\n\t\t\tif (balls[x] == 0) {\n\t\t\t\tred[x] = false;\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (red[i])\n\t\t\t\tans++;\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "language": "Java", "metadata": {"date": 1590248658, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04034.html", "problem_id": "p04034", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04034/input.txt", "sample_output_relpath": "derived/input_output/data/p04034/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04034/Java/s609613357.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s609613357", "user_id": "u162241493"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\n\nimport java.util.Scanner;\n\npublic class Main {\n\tpublic static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint x = 0;\n\t\tint y = 0;\n\n\t\tint[] balls = new int[n];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tballs[i] = 1;\n\t\t}\n\n\t\tboolean[] red = new boolean[n];\n\t\tred[0] = true;\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tx = Integer.parseInt(sc.next()) - 1;\n\t\t\ty = Integer.parseInt(sc.next()) - 1;\n\n\t\t\tif (red[x]) {\n\t\t\t\tred[y] = true;\n\t\t\t}\n\t\t\tballs[x]--;\n\t\t\tballs[y]++;\n\n\t\t\tif (balls[x] == 0) {\n\t\t\t\tred[x] = false;\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif (red[i])\n\t\t\t\tans++;\n\t\t}\n\n\t\tSystem.out.println(ans);\n\t}\n\n}\n", "problem_context": "Problem Statement\n\nWe have N boxes, numbered 1 through N. At first, box 1 contains one red ball, and each of the other boxes contains one white ball.\n\nSnuke will perform the following M operations, one by one. In the i-th operation, he randomly picks one ball from box x_i, then he puts it into box y_i.\n\nFind the number of boxes that may contain the red ball after all operations are performed.\n\nConstraints\n\n2≤N≤10^5\n\n1≤M≤10^5\n\n1≤x_i,y_i≤N\n\nx_i≠y_i\n\nJust before the i-th operation is performed, box x_i contains at least 1 ball.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nx_1 y_1\n:\nx_M y_M\n\nOutput\n\nPrint the number of boxes that may contain the red ball after all operations are performed.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\n2\n\nJust after the first operation, box 1 is empty, box 2 contains one red ball and one white ball, and box 3 contains one white ball.\n\nNow, consider the second operation. If Snuke picks the red ball from box 2, the red ball will go into box 3. If he picks the white ball instead, the red ball will stay in box 2.\nThus, the number of boxes that may contain the red ball after all operations, is 2.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n2 3\n\nSample Output 2\n\n1\n\nAll balls will go into box 3.\n\nSample Input 3\n\n4 4\n1 2\n2 3\n4 1\n3 4\n\nSample Output 3\n\n3", "sample_input": "3 2\n1 2\n2 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p04034", "source_text": "Problem Statement\n\nWe have N boxes, numbered 1 through N. At first, box 1 contains one red ball, and each of the other boxes contains one white ball.\n\nSnuke will perform the following M operations, one by one. In the i-th operation, he randomly picks one ball from box x_i, then he puts it into box y_i.\n\nFind the number of boxes that may contain the red ball after all operations are performed.\n\nConstraints\n\n2≤N≤10^5\n\n1≤M≤10^5\n\n1≤x_i,y_i≤N\n\nx_i≠y_i\n\nJust before the i-th operation is performed, box x_i contains at least 1 ball.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nx_1 y_1\n:\nx_M y_M\n\nOutput\n\nPrint the number of boxes that may contain the red ball after all operations are performed.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\n2\n\nJust after the first operation, box 1 is empty, box 2 contains one red ball and one white ball, and box 3 contains one white ball.\n\nNow, consider the second operation. If Snuke picks the red ball from box 2, the red ball will go into box 3. If he picks the white ball instead, the red ball will stay in box 2.\nThus, the number of boxes that may contain the red ball after all operations, is 2.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n2 3\n\nSample Output 2\n\n1\n\nAll balls will go into box 3.\n\nSample Input 3\n\n4 4\n1 2\n2 3\n4 1\n3 4\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 690, "cpu_time_ms": 459, "memory_kb": 53344}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s827987760", "group_id": "codeNet:p04034", "input_text": "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tint m = in.nextInt();\n\t\tint[] box = new int[n];\n\t\tboolean[] boxred = new boolean[n];\n\t\t\n\t\tboxred[0] = true;\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tboxred[i] = false;\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tbox[i] = 1;\n\t\t}\n\t\t\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint x = in.nextInt()-1;\n\t\t\tint y = in.nextInt()-1;\n\t\t\tif(boxred[x] == true){\n\t\t\t\tif(box[x] == 1){\n\t\t\t\t\tboxred[x] = false;\n\t\t\t\t\tboxred[y] = true;\n\t\t\t\t}else{\n\t\t\t\t\tboxred[y] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbox[x]--;\n\t\t\tbox[y]++;\t\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif(boxred[i] == true){\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t\tin.close();\n\t}\n\t\n\n}", "language": "Java", "metadata": {"date": 1470020904, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04034.html", "problem_id": "p04034", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04034/input.txt", "sample_output_relpath": "derived/input_output/data/p04034/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04034/Java/s827987760.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s827987760", "user_id": "u460147385"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner;\n\nclass Main {\n\tpublic static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tint n = in.nextInt();\n\t\tint m = in.nextInt();\n\t\tint[] box = new int[n];\n\t\tboolean[] boxred = new boolean[n];\n\t\t\n\t\tboxred[0] = true;\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tboxred[i] = false;\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tbox[i] = 1;\n\t\t}\n\t\t\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint x = in.nextInt()-1;\n\t\t\tint y = in.nextInt()-1;\n\t\t\tif(boxred[x] == true){\n\t\t\t\tif(box[x] == 1){\n\t\t\t\t\tboxred[x] = false;\n\t\t\t\t\tboxred[y] = true;\n\t\t\t\t}else{\n\t\t\t\t\tboxred[y] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbox[x]--;\n\t\t\tbox[y]++;\t\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tif(boxred[i] == true){\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(ans);\n\t\tin.close();\n\t}\n\t\n\n}", "problem_context": "Problem Statement\n\nWe have N boxes, numbered 1 through N. At first, box 1 contains one red ball, and each of the other boxes contains one white ball.\n\nSnuke will perform the following M operations, one by one. In the i-th operation, he randomly picks one ball from box x_i, then he puts it into box y_i.\n\nFind the number of boxes that may contain the red ball after all operations are performed.\n\nConstraints\n\n2≤N≤10^5\n\n1≤M≤10^5\n\n1≤x_i,y_i≤N\n\nx_i≠y_i\n\nJust before the i-th operation is performed, box x_i contains at least 1 ball.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nx_1 y_1\n:\nx_M y_M\n\nOutput\n\nPrint the number of boxes that may contain the red ball after all operations are performed.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\n2\n\nJust after the first operation, box 1 is empty, box 2 contains one red ball and one white ball, and box 3 contains one white ball.\n\nNow, consider the second operation. If Snuke picks the red ball from box 2, the red ball will go into box 3. If he picks the white ball instead, the red ball will stay in box 2.\nThus, the number of boxes that may contain the red ball after all operations, is 2.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n2 3\n\nSample Output 2\n\n1\n\nAll balls will go into box 3.\n\nSample Input 3\n\n4 4\n1 2\n2 3\n4 1\n3 4\n\nSample Output 3\n\n3", "sample_input": "3 2\n1 2\n2 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p04034", "source_text": "Problem Statement\n\nWe have N boxes, numbered 1 through N. At first, box 1 contains one red ball, and each of the other boxes contains one white ball.\n\nSnuke will perform the following M operations, one by one. In the i-th operation, he randomly picks one ball from box x_i, then he puts it into box y_i.\n\nFind the number of boxes that may contain the red ball after all operations are performed.\n\nConstraints\n\n2≤N≤10^5\n\n1≤M≤10^5\n\n1≤x_i,y_i≤N\n\nx_i≠y_i\n\nJust before the i-th operation is performed, box x_i contains at least 1 ball.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nx_1 y_1\n:\nx_M y_M\n\nOutput\n\nPrint the number of boxes that may contain the red ball after all operations are performed.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\n2\n\nJust after the first operation, box 1 is empty, box 2 contains one red ball and one white ball, and box 3 contains one white ball.\n\nNow, consider the second operation. If Snuke picks the red ball from box 2, the red ball will go into box 3. If he picks the white ball instead, the red ball will stay in box 2.\nThus, the number of boxes that may contain the red ball after all operations, is 2.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n2 3\n\nSample Output 2\n\n1\n\nAll balls will go into box 3.\n\nSample Input 3\n\n4 4\n1 2\n2 3\n4 1\n3 4\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 765, "cpu_time_ms": 696, "memory_kb": 23768}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s302685388", "group_id": "codeNet:p04035", "input_text": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.TreeMap;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tString answerText = \"Possible\";\n\t\tArrayList answerList = new ArrayList();\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] array;\n\t\tarray = br.readLine().split(\" \");\n\t\tint n = Integer.parseInt(array[0]);//ロープの本数\n\t\tint l = Integer.parseInt(array[1]);//長さL\n\t\tTreeMap map = new TreeMap();\n\n\t\tint cnt = 0;\n\t\tfor(String str:br.readLine().split(\" \")){\n\t\t\tmap.put(cnt, Integer.parseInt(str));\n\t\t\tcnt++;\n\t\t}\n\n\t\tint total = getLength(map);\n\n\t\twhile(true){\n\t\t\tif(map.size() == 1){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(total >= l){\n\t\t\t\tint first = map.firstKey();\n\t\t\t\tint last = map.lastKey();\n\t\t\t\tif(map.get(first) < map.get(last)){\n\t\t\t\t\ttotal -= map.get(first);\n\t\t\t\t\tanswerList.add(first+1);\n\t\t\t\t\tmap.remove(first);\n\t\t\t\t}else{\n\t\t\t\t\ttotal -= map.get(last);\n\t\t\t\t\tanswerList.add(last);\n\t\t\t\t\tmap.remove(last);\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tanswerText = \"Impossible\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answerText);\n\t\tfor(Integer i:answerList){\n\t\t\tSystem.out.println(String.valueOf(i));\n\t\t}\n\t}\n\n\tprivate static Integer getLength(TreeMap map){\n\t\tint ret = 0;\n\n\t\tfor(int i:map.values()){\n\t\t\tret += i;\n\t\t}\n\t\treturn ret;\n\t}\n}\n", "language": "Java", "metadata": {"date": 1527788728, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04035.html", "problem_id": "p04035", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04035/input.txt", "sample_output_relpath": "derived/input_output/data/p04035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04035/Java/s302685388.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s302685388", "user_id": "u857583007"}, "prompt_components": {"gold_output": "Possible\n2\n1\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.TreeMap;\n\npublic class Main {\n\tpublic static void main(String[] args) throws Exception{\n\t\tString answerText = \"Possible\";\n\t\tArrayList answerList = new ArrayList();\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tString[] array;\n\t\tarray = br.readLine().split(\" \");\n\t\tint n = Integer.parseInt(array[0]);//ロープの本数\n\t\tint l = Integer.parseInt(array[1]);//長さL\n\t\tTreeMap map = new TreeMap();\n\n\t\tint cnt = 0;\n\t\tfor(String str:br.readLine().split(\" \")){\n\t\t\tmap.put(cnt, Integer.parseInt(str));\n\t\t\tcnt++;\n\t\t}\n\n\t\tint total = getLength(map);\n\n\t\twhile(true){\n\t\t\tif(map.size() == 1){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(total >= l){\n\t\t\t\tint first = map.firstKey();\n\t\t\t\tint last = map.lastKey();\n\t\t\t\tif(map.get(first) < map.get(last)){\n\t\t\t\t\ttotal -= map.get(first);\n\t\t\t\t\tanswerList.add(first+1);\n\t\t\t\t\tmap.remove(first);\n\t\t\t\t}else{\n\t\t\t\t\ttotal -= map.get(last);\n\t\t\t\t\tanswerList.add(last);\n\t\t\t\t\tmap.remove(last);\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tanswerText = \"Impossible\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(answerText);\n\t\tfor(Integer i:answerList){\n\t\t\tSystem.out.println(String.valueOf(i));\n\t\t}\n\t}\n\n\tprivate static Integer getLength(TreeMap map){\n\t\tint ret = 0;\n\n\t\tfor(int i:map.values()){\n\t\t\tret += i;\n\t\t}\n\t\treturn ret;\n\t}\n}\n", "problem_context": "Problem Statement\n\nWe have N pieces of ropes, numbered 1 through N. The length of piece i is a_i.\n\nAt first, for each i (1≤i≤N-1), piece i and piece i+1 are tied at the ends, forming one long rope with N-1 knots. Snuke will try to untie all of the knots by performing the following operation repeatedly:\n\nChoose a (connected) rope with a total length of at least L, then untie one of its knots.\n\nIs it possible to untie all of the N-1 knots by properly applying this operation? If the answer is positive, find one possible order to untie the knots.\n\nConstraints\n\n2≤N≤10^5\n\n1≤L≤10^9\n\n1≤a_i≤10^9\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\na_1 a_2 ... a_n\n\nOutput\n\nIf it is not possible to untie all of the N-1 knots, print Impossible.\n\nIf it is possible to untie all of the knots, print Possible, then print another N-1 lines that describe a possible order to untie the knots. The j-th of those N-1 lines should contain the index of the knot that is untied in the j-th operation. Here, the index of the knot connecting piece i and piece i+1 is i.\n\nIf there is more than one solution, output any.\n\nSample Input 1\n\n3 50\n30 20 10\n\nSample Output 1\n\nPossible\n2\n1\n\nIf the knot 1 is untied first, the knot 2 will become impossible to untie.\n\nSample Input 2\n\n2 21\n10 10\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n5 50\n10 20 30 40 50\n\nSample Output 3\n\nPossible\n1\n2\n3\n4\n\nAnother example of a possible solution is 3, 4, 1, 2.", "sample_input": "3 50\n30 20 10\n"}, "reference_outputs": ["Possible\n2\n1\n"], "source_document_id": "p04035", "source_text": "Problem Statement\n\nWe have N pieces of ropes, numbered 1 through N. The length of piece i is a_i.\n\nAt first, for each i (1≤i≤N-1), piece i and piece i+1 are tied at the ends, forming one long rope with N-1 knots. Snuke will try to untie all of the knots by performing the following operation repeatedly:\n\nChoose a (connected) rope with a total length of at least L, then untie one of its knots.\n\nIs it possible to untie all of the N-1 knots by properly applying this operation? If the answer is positive, find one possible order to untie the knots.\n\nConstraints\n\n2≤N≤10^5\n\n1≤L≤10^9\n\n1≤a_i≤10^9\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\na_1 a_2 ... a_n\n\nOutput\n\nIf it is not possible to untie all of the N-1 knots, print Impossible.\n\nIf it is possible to untie all of the knots, print Possible, then print another N-1 lines that describe a possible order to untie the knots. The j-th of those N-1 lines should contain the index of the knot that is untied in the j-th operation. Here, the index of the knot connecting piece i and piece i+1 is i.\n\nIf there is more than one solution, output any.\n\nSample Input 1\n\n3 50\n30 20 10\n\nSample Output 1\n\nPossible\n2\n1\n\nIf the knot 1 is untied first, the knot 2 will become impossible to untie.\n\nSample Input 2\n\n2 21\n10 10\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n5 50\n10 20 30 40 50\n\nSample Output 3\n\nPossible\n1\n2\n3\n4\n\nAnother example of a possible solution is 3, 4, 1, 2.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1412, "cpu_time_ms": 835, "memory_kb": 51044}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s059906309", "group_id": "codeNet:p04035", "input_text": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().solve();\n\t}\n\tint MAX=1000002;\n\t\n\tvoid solve(){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint N=sc.nextInt();\n\t\tint L=sc.nextInt();\n\t\tint[]a=new int[N];\n\t\tfor(int i=0;i=L) {\n\t\t\t\tlast=i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(last==-1) {\n\t\t\tSystem.out.println(\"Impossible\");\n\t\t\treturn;\n\t\t}else {\n\t\t\tSystem.out.println(\"Possible\");\n\t\t\tfor(int i=0;ilast+1;i--) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t}\n\t\t\tSystem.out.println(last+1);\n\t\t}\n\t}\n}", "language": "Java", "metadata": {"date": 1506790277, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04035.html", "problem_id": "p04035", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04035/input.txt", "sample_output_relpath": "derived/input_output/data/p04035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04035/Java/s059906309.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s059906309", "user_id": "u369883202"}, "prompt_components": {"gold_output": "Possible\n2\n1\n", "input_to_evaluate": "import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.PriorityQueue;\nimport java.util.Scanner;\nimport java.util.Stack;\n\npublic class Main {\n\t\n\tpublic static void main(String[] args) {\n\t\tnew Main().solve();\n\t}\n\tint MAX=1000002;\n\t\n\tvoid solve(){\n\t\tScanner sc=new Scanner(System.in);\n\t\tint N=sc.nextInt();\n\t\tint L=sc.nextInt();\n\t\tint[]a=new int[N];\n\t\tfor(int i=0;i=L) {\n\t\t\t\tlast=i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(last==-1) {\n\t\t\tSystem.out.println(\"Impossible\");\n\t\t\treturn;\n\t\t}else {\n\t\t\tSystem.out.println(\"Possible\");\n\t\t\tfor(int i=0;ilast+1;i--) {\n\t\t\t\tSystem.out.println(i);\n\t\t\t}\n\t\t\tSystem.out.println(last+1);\n\t\t}\n\t}\n}", "problem_context": "Problem Statement\n\nWe have N pieces of ropes, numbered 1 through N. The length of piece i is a_i.\n\nAt first, for each i (1≤i≤N-1), piece i and piece i+1 are tied at the ends, forming one long rope with N-1 knots. Snuke will try to untie all of the knots by performing the following operation repeatedly:\n\nChoose a (connected) rope with a total length of at least L, then untie one of its knots.\n\nIs it possible to untie all of the N-1 knots by properly applying this operation? If the answer is positive, find one possible order to untie the knots.\n\nConstraints\n\n2≤N≤10^5\n\n1≤L≤10^9\n\n1≤a_i≤10^9\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\na_1 a_2 ... a_n\n\nOutput\n\nIf it is not possible to untie all of the N-1 knots, print Impossible.\n\nIf it is possible to untie all of the knots, print Possible, then print another N-1 lines that describe a possible order to untie the knots. The j-th of those N-1 lines should contain the index of the knot that is untied in the j-th operation. Here, the index of the knot connecting piece i and piece i+1 is i.\n\nIf there is more than one solution, output any.\n\nSample Input 1\n\n3 50\n30 20 10\n\nSample Output 1\n\nPossible\n2\n1\n\nIf the knot 1 is untied first, the knot 2 will become impossible to untie.\n\nSample Input 2\n\n2 21\n10 10\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n5 50\n10 20 30 40 50\n\nSample Output 3\n\nPossible\n1\n2\n3\n4\n\nAnother example of a possible solution is 3, 4, 1, 2.", "sample_input": "3 50\n30 20 10\n"}, "reference_outputs": ["Possible\n2\n1\n"], "source_document_id": "p04035", "source_text": "Problem Statement\n\nWe have N pieces of ropes, numbered 1 through N. The length of piece i is a_i.\n\nAt first, for each i (1≤i≤N-1), piece i and piece i+1 are tied at the ends, forming one long rope with N-1 knots. Snuke will try to untie all of the knots by performing the following operation repeatedly:\n\nChoose a (connected) rope with a total length of at least L, then untie one of its knots.\n\nIs it possible to untie all of the N-1 knots by properly applying this operation? If the answer is positive, find one possible order to untie the knots.\n\nConstraints\n\n2≤N≤10^5\n\n1≤L≤10^9\n\n1≤a_i≤10^9\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\na_1 a_2 ... a_n\n\nOutput\n\nIf it is not possible to untie all of the N-1 knots, print Impossible.\n\nIf it is possible to untie all of the knots, print Possible, then print another N-1 lines that describe a possible order to untie the knots. The j-th of those N-1 lines should contain the index of the knot that is untied in the j-th operation. Here, the index of the knot connecting piece i and piece i+1 is i.\n\nIf there is more than one solution, output any.\n\nSample Input 1\n\n3 50\n30 20 10\n\nSample Output 1\n\nPossible\n2\n1\n\nIf the knot 1 is untied first, the knot 2 will become impossible to untie.\n\nSample Input 2\n\n2 21\n10 10\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n5 50\n10 20 30 40 50\n\nSample Output 3\n\nPossible\n1\n2\n3\n4\n\nAnother example of a possible solution is 3, 4, 1, 2.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 788, "cpu_time_ms": 1126, "memory_kb": 63884}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s417278099", "group_id": "codeNet:p04041", "input_text": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.LinkedList;\nimport java.util.Queue;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\tstatic int x, y, z;\n\tstatic Stack stack = new Stack();\n\tstatic ArrayList list = new ArrayList();\n\tstatic ArrayList seq = new ArrayList();\n\n\tstatic void rec() {\n\t\tlist = new ArrayList();\n\t\tgo(0, x);\n\t\tArrayList fives = new ArrayList();\n\t\tfor (String s : list)\n\t\t\tfives.add(s);\n\t\tlist = new ArrayList();\n\t\tgo(0, y);\n\t\tArrayList sevens = new ArrayList();\n\t\tfor (String s : list)\n\t\t\tsevens.add(s);\n\t\tlist = new ArrayList();\n\t\tgo(0, z);\n\t\tfor (String s : fives) {\n\t\t\tfor (String s2 : sevens) {\n\t\t\t\tfor (String s3 : list) {\n\t\t\t\t\tseq.add(s + s2 + s3);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic void go(int curr, int limit) {\n\t\tif (curr > limit)\n\t\t\treturn;\n\t\tif (curr == limit) {\n\t\t\tString s = \"\";\n\t\t\tfor (int x : stack) {\n\t\t\t\ts += x;\n\t\t\t}\n\t\t\tlist.add(s);\n\t\t\treturn;\n\t\t}\n\t\tfor (int i = 1; i <= limit; i++) {\n\t\t\tstack.push(i);\n\t\t\tgo(curr + i, limit);\n\t\t\tstack.pop();\n\t\t}\n\t}\n\n\tstatic class Node {\n\t\tint id;\n\t\tNode fail;\n\t\tNode[] child;\n\t\tboolean isTerminal;\n\t\tboolean[] chars;\n\n\t\tpublic Node() {\n\t\t\tchild = new Node[10];\n\t\t\tchars = new boolean[10];\n\t\t\tid = -1;\n\t\t}\n\n\t\tvoid insert(String str, int index, int charIndex) {\n\t\t\tif (charIndex == str.length())\n\t\t\t\tisTerminal = true;\n\t\t\telse {\n\t\t\t\tif (child[str.charAt(charIndex) - '0'] == null) {\n\t\t\t\t\tchild[str.charAt(charIndex) - '0'] = new Node();\n\t\t\t\t\tchars[str.charAt(charIndex) - '0'] = true;\n\t\t\t\t}\n\t\t\t\tchild[str.charAt(charIndex) - '0'].insert(str, index,\n\t\t\t\t\t\tcharIndex + 1);\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic Node build(ArrayList words) {\n\t\tNode root = new Node();\n\t\tfor (int i = 0; i < words.size(); i++)\n\t\t\troot.insert(words.get(i), i, 0);\n\t\tQueue q = new LinkedList();\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tif (root.child[i] == null)\n\t\t\t\troot.child[i] = root;\n\t\t\telse {\n\t\t\t\tq.add(root.child[i]);\n\t\t\t\troot.child[i].fail = root;\n\t\t\t}\n\t\t}\n\t\twhile (!q.isEmpty()) {\n\t\t\tNode front = q.remove();\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tif (!front.chars[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tq.add(front.child[i]);\n\t\t\t\tNode temp = front.fail;\n\t\t\t\twhile (temp.child[i] == null)\n\t\t\t\t\ttemp = temp.fail;\n\t\t\t\ttemp = temp.child[i];\n\t\t\t\tfront.child[i].fail = temp;\n\t\t\t\tfront.child[i].isTerminal |= temp.isTerminal;\n\t\t\t}\n\t\t}\n\t\treturn root;\n\t}\n\n\tpublic static void dfs(Node n) {\n\t\tif (n.id != -1)\n\t\t\treturn;\n\t\tn.id = id;\n\t\tnodes[id++] = n;\n\t\tfor (int i = 0; i < 10; i++)\n\t\t\tif (n.chars[i]) {\n\t\t\t\tdfs(n.child[i]);\n\t\t\t}\n\t}\n\n\tstatic int id, n;\n\tstatic Node[] nodes = new Node[50000];\n\tstatic Integer[][][] dp = new Integer[40][50000][2];\n\tstatic int mod = 1000000007;\n\n\tpublic static int go(int index, int nodeId, int flag) {\n\t\tif (index == n) {\n\t\t\treturn flag == 1 ? 1 : 0;\n\t\t}\n\t\tif (dp[index][nodeId][flag] != null)\n\t\t\treturn dp[index][nodeId][flag];\n\t\tint res = 0;\n\t\tfor (char c = '0'; c <= '9'; c++) {\n\t\t\tNode n = nodes[nodeId];\n\t\t\twhile (n.child[c-'0'] == null)\n\t\t\t\tn = n.fail;\n\t\t\tn = n.child[c-'0'];\n\t\t\tres += go(index + 1, n.id, flag | (n.isTerminal ? 1 : 0));\n\t\t\tres %= mod;\n\t\t}\n\t\treturn dp[index][nodeId][flag] = res;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tInputReader r = new InputReader(System.in);\n\t\tn = r.nextInt();\n\t\tx = r.nextInt();\n\t\ty = r.nextInt();\n\t\tz = r.nextInt();\n\t\trec();\n\t\tNode root = build(seq);\n\t\tdfs(root);\n\t\tSystem.out.println(go(0, 0, 0));\n\t}\n\n\tstatic class InputReader {\n\t\tprivate BufferedReader reader;\n\t\tprivate StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream));\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic InputReader(FileReader stream) {\n\t\t\treader = new BufferedReader(stream);\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n}\n", "language": "Java", "metadata": {"date": 1469331192, "filename_ext": "java", "original_language": "Java7 (OpenJDK 1.7.0)", "problem_description_relpath": "problem_descriptions/p04041.html", "problem_id": "p04041", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04041/input.txt", "sample_output_relpath": "derived/input_output/data/p04041/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04041/Java/s417278099.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417278099", "user_id": "u450436992"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.LinkedList;\nimport java.util.Queue;\nimport java.util.Stack;\nimport java.util.StringTokenizer;\n\npublic class Main {\n\tstatic int x, y, z;\n\tstatic Stack stack = new Stack();\n\tstatic ArrayList list = new ArrayList();\n\tstatic ArrayList seq = new ArrayList();\n\n\tstatic void rec() {\n\t\tlist = new ArrayList();\n\t\tgo(0, x);\n\t\tArrayList fives = new ArrayList();\n\t\tfor (String s : list)\n\t\t\tfives.add(s);\n\t\tlist = new ArrayList();\n\t\tgo(0, y);\n\t\tArrayList sevens = new ArrayList();\n\t\tfor (String s : list)\n\t\t\tsevens.add(s);\n\t\tlist = new ArrayList();\n\t\tgo(0, z);\n\t\tfor (String s : fives) {\n\t\t\tfor (String s2 : sevens) {\n\t\t\t\tfor (String s3 : list) {\n\t\t\t\t\tseq.add(s + s2 + s3);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic void go(int curr, int limit) {\n\t\tif (curr > limit)\n\t\t\treturn;\n\t\tif (curr == limit) {\n\t\t\tString s = \"\";\n\t\t\tfor (int x : stack) {\n\t\t\t\ts += x;\n\t\t\t}\n\t\t\tlist.add(s);\n\t\t\treturn;\n\t\t}\n\t\tfor (int i = 1; i <= limit; i++) {\n\t\t\tstack.push(i);\n\t\t\tgo(curr + i, limit);\n\t\t\tstack.pop();\n\t\t}\n\t}\n\n\tstatic class Node {\n\t\tint id;\n\t\tNode fail;\n\t\tNode[] child;\n\t\tboolean isTerminal;\n\t\tboolean[] chars;\n\n\t\tpublic Node() {\n\t\t\tchild = new Node[10];\n\t\t\tchars = new boolean[10];\n\t\t\tid = -1;\n\t\t}\n\n\t\tvoid insert(String str, int index, int charIndex) {\n\t\t\tif (charIndex == str.length())\n\t\t\t\tisTerminal = true;\n\t\t\telse {\n\t\t\t\tif (child[str.charAt(charIndex) - '0'] == null) {\n\t\t\t\t\tchild[str.charAt(charIndex) - '0'] = new Node();\n\t\t\t\t\tchars[str.charAt(charIndex) - '0'] = true;\n\t\t\t\t}\n\t\t\t\tchild[str.charAt(charIndex) - '0'].insert(str, index,\n\t\t\t\t\t\tcharIndex + 1);\n\t\t\t}\n\t\t}\n\t}\n\n\tstatic Node build(ArrayList words) {\n\t\tNode root = new Node();\n\t\tfor (int i = 0; i < words.size(); i++)\n\t\t\troot.insert(words.get(i), i, 0);\n\t\tQueue q = new LinkedList();\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\tif (root.child[i] == null)\n\t\t\t\troot.child[i] = root;\n\t\t\telse {\n\t\t\t\tq.add(root.child[i]);\n\t\t\t\troot.child[i].fail = root;\n\t\t\t}\n\t\t}\n\t\twhile (!q.isEmpty()) {\n\t\t\tNode front = q.remove();\n\t\t\tfor (int i = 0; i < 10; i++) {\n\t\t\t\tif (!front.chars[i])\n\t\t\t\t\tcontinue;\n\t\t\t\tq.add(front.child[i]);\n\t\t\t\tNode temp = front.fail;\n\t\t\t\twhile (temp.child[i] == null)\n\t\t\t\t\ttemp = temp.fail;\n\t\t\t\ttemp = temp.child[i];\n\t\t\t\tfront.child[i].fail = temp;\n\t\t\t\tfront.child[i].isTerminal |= temp.isTerminal;\n\t\t\t}\n\t\t}\n\t\treturn root;\n\t}\n\n\tpublic static void dfs(Node n) {\n\t\tif (n.id != -1)\n\t\t\treturn;\n\t\tn.id = id;\n\t\tnodes[id++] = n;\n\t\tfor (int i = 0; i < 10; i++)\n\t\t\tif (n.chars[i]) {\n\t\t\t\tdfs(n.child[i]);\n\t\t\t}\n\t}\n\n\tstatic int id, n;\n\tstatic Node[] nodes = new Node[50000];\n\tstatic Integer[][][] dp = new Integer[40][50000][2];\n\tstatic int mod = 1000000007;\n\n\tpublic static int go(int index, int nodeId, int flag) {\n\t\tif (index == n) {\n\t\t\treturn flag == 1 ? 1 : 0;\n\t\t}\n\t\tif (dp[index][nodeId][flag] != null)\n\t\t\treturn dp[index][nodeId][flag];\n\t\tint res = 0;\n\t\tfor (char c = '0'; c <= '9'; c++) {\n\t\t\tNode n = nodes[nodeId];\n\t\t\twhile (n.child[c-'0'] == null)\n\t\t\t\tn = n.fail;\n\t\t\tn = n.child[c-'0'];\n\t\t\tres += go(index + 1, n.id, flag | (n.isTerminal ? 1 : 0));\n\t\t\tres %= mod;\n\t\t}\n\t\treturn dp[index][nodeId][flag] = res;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tInputReader r = new InputReader(System.in);\n\t\tn = r.nextInt();\n\t\tx = r.nextInt();\n\t\ty = r.nextInt();\n\t\tz = r.nextInt();\n\t\trec();\n\t\tNode root = build(seq);\n\t\tdfs(root);\n\t\tSystem.out.println(go(0, 0, 0));\n\t}\n\n\tstatic class InputReader {\n\t\tprivate BufferedReader reader;\n\t\tprivate StringTokenizer tokenizer;\n\n\t\tpublic InputReader(InputStream stream) {\n\t\t\treader = new BufferedReader(new InputStreamReader(stream));\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic InputReader(FileReader stream) {\n\t\t\treader = new BufferedReader(stream);\n\t\t\ttokenizer = null;\n\t\t}\n\n\t\tpublic String nextLine() {\n\t\t\ttry {\n\t\t\t\treturn reader.readLine();\n\t\t\t} catch (IOException e) {\n\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\te.printStackTrace();\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\n\t\tpublic String next() {\n\t\t\twhile (tokenizer == null || !tokenizer.hasMoreTokens()) {\n\t\t\t\ttry {\n\t\t\t\t\ttokenizer = new StringTokenizer(reader.readLine());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tthrow new RuntimeException(e);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn tokenizer.nextToken();\n\t\t}\n\n\t\tpublic int nextInt() {\n\t\t\treturn Integer.parseInt(next());\n\t\t}\n\n\t\tpublic long nextLong() {\n\t\t\treturn Long.parseLong(next());\n\t\t}\n\n\t\tpublic double nextDouble() {\n\t\t\treturn Double.parseDouble(next());\n\t\t}\n\t}\n}\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nHaiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nIroha is looking for X,Y,Z-Haiku (defined below) in integer sequences.\n\nConsider all integer sequences of length N whose elements are between 1 and 10, inclusive. Out of those 10^N sequences, how many contain an X,Y,Z-Haiku?\n\nHere, an integer sequence a_0, a_1, ..., a_{N-1} is said to contain an X,Y,Z-Haiku if and only if there exist four indices x, y, z, w (0 ≦ x < y < z < w ≦ N) such that all of the following are satisfied:\n\na_x + a_{x+1} + ... + a_{y-1} = X\n\na_y + a_{y+1} + ... + a_{z-1} = Y\n\na_z + a_{z+1} + ... + a_{w-1} = Z\n\nSince the answer can be extremely large, print the number modulo 10^9+7.\n\nConstraints\n\n3 ≦ N ≦ 40\n\n1 ≦ X ≦ 5\n\n1 ≦ Y ≦ 7\n\n1 ≦ Z ≦ 5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN X Y Z\n\nOutput\n\nPrint the number of the sequences that contain an X,Y,Z-Haiku, modulo 10^9+7.\n\nSample Input 1\n\n3 5 7 5\n\nSample Output 1\n\n1\n\nHere, the only sequence that contains a 5,7,5-Haiku is [5, 7, 5].\n\nSample Input 2\n\n4 5 7 5\n\nSample Output 2\n\n34\n\nSample Input 3\n\n37 4 2 3\n\nSample Output 3\n\n863912418\n\nSample Input 4\n\n40 5 7 5\n\nSample Output 4\n\n562805100", "sample_input": "3 5 7 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04041", "source_text": "Score : 700 points\n\nProblem Statement\n\nHaiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nIroha is looking for X,Y,Z-Haiku (defined below) in integer sequences.\n\nConsider all integer sequences of length N whose elements are between 1 and 10, inclusive. Out of those 10^N sequences, how many contain an X,Y,Z-Haiku?\n\nHere, an integer sequence a_0, a_1, ..., a_{N-1} is said to contain an X,Y,Z-Haiku if and only if there exist four indices x, y, z, w (0 ≦ x < y < z < w ≦ N) such that all of the following are satisfied:\n\na_x + a_{x+1} + ... + a_{y-1} = X\n\na_y + a_{y+1} + ... + a_{z-1} = Y\n\na_z + a_{z+1} + ... + a_{w-1} = Z\n\nSince the answer can be extremely large, print the number modulo 10^9+7.\n\nConstraints\n\n3 ≦ N ≦ 40\n\n1 ≦ X ≦ 5\n\n1 ≦ Y ≦ 7\n\n1 ≦ Z ≦ 5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN X Y Z\n\nOutput\n\nPrint the number of the sequences that contain an X,Y,Z-Haiku, modulo 10^9+7.\n\nSample Input 1\n\n3 5 7 5\n\nSample Output 1\n\n1\n\nHere, the only sequence that contains a 5,7,5-Haiku is [5, 7, 5].\n\nSample Input 2\n\n4 5 7 5\n\nSample Output 2\n\n34\n\nSample Input 3\n\n37 4 2 3\n\nSample Output 3\n\n863912418\n\nSample Input 4\n\n40 5 7 5\n\nSample Output 4\n\n562805100", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4602, "cpu_time_ms": 2945, "memory_kb": 145304}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s394910757", "group_id": "codeNet:p04043", "input_text": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n if((a == 5 && b == 7 && c == 5) || (a == 7 && b == 5 && c == 5) || (a == 5 && b == 5 && c == 7)){\n System.out.println(\"YES\");\n }else{\n System.out.println(\"NG\");\n }\n }\n}", "language": "Java", "metadata": {"date": 1570997662, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04043.html", "problem_id": "p04043", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04043/input.txt", "sample_output_relpath": "derived/input_output/data/p04043/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04043/Java/s394910757.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s394910757", "user_id": "u010415482"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws Exception {\n // Your code here!\n Scanner sc = new Scanner(System.in);\n int a = sc.nextInt();\n int b = sc.nextInt();\n int c = sc.nextInt();\n if((a == 5 && b == 7 && c == 5) || (a == 7 && b == 5 && c == 5) || (a == 5 && b == 5 && c == 7)){\n System.out.println(\"YES\");\n }else{\n System.out.println(\"NG\");\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "sample_input": "5 5 7\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p04043", "source_text": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 471, "cpu_time_ms": 92, "memory_kb": 21844}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s664692444", "group_id": "codeNet:p04045", "input_text": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.UncheckedIOException;\nimport java.nio.charset.Charset;\nimport java.util.StringTokenizer;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author mikit\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n LightScanner in = new LightScanner(inputStream);\n LightWriter out = new LightWriter(outputStream);\n CIrohasObsession solver = new CIrohasObsession();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CIrohasObsession {\n public void solve(int testNumber, LightScanner in, LightWriter out) {\n // out.setBoolLabel(LightWriter.BoolLabel.YES_NO_FIRST_UP);\n int n = in.ints();\n int k = in.ints();\n boolean[] d = new boolean[10];\n for (int i = 0; i < k; i++) {\n d[in.ints()] = true;\n }\n\n outer:\n for (int i = n; ; i++) {\n int t = i;\n while (t > 0) {\n if (d[t % 10]) {\n continue outer;\n }\n t /= 10;\n }\n out.ansln(i);\n return;\n }\n }\n\n }\n\n static class LightScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n }\n\n static class LightWriter implements AutoCloseable {\n private final Writer out;\n private boolean autoflush = false;\n private boolean breaked = true;\n\n public LightWriter(Writer out) {\n this.out = out;\n }\n\n public LightWriter(OutputStream out) {\n this(new BufferedWriter(new OutputStreamWriter(out, Charset.defaultCharset())));\n }\n\n public LightWriter print(char c) {\n try {\n out.write(c);\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter print(String s) {\n try {\n out.write(s, 0, s.length());\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter ans(String s) {\n if (!breaked) {\n print(' ');\n }\n return print(s);\n }\n\n public LightWriter ans(int i) {\n return ans(Integer.toString(i));\n }\n\n public LightWriter ansln(int... n) {\n for (int n1 : n) {\n ans(n1).ln();\n }\n return this;\n }\n\n public LightWriter ln() {\n print(System.lineSeparator());\n breaked = true;\n if (autoflush) {\n try {\n out.flush();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n return this;\n }\n\n public void close() {\n try {\n out.close();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n\n }\n}\n\n", "language": "Java", "metadata": {"date": 1555044538, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04045.html", "problem_id": "p04045", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04045/input.txt", "sample_output_relpath": "derived/input_output/data/p04045/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04045/Java/s664692444.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s664692444", "user_id": "u183509493"}, "prompt_components": {"gold_output": "2000\n", "input_to_evaluate": "import java.io.OutputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.OutputStream;\nimport java.io.BufferedWriter;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.io.UncheckedIOException;\nimport java.nio.charset.Charset;\nimport java.util.StringTokenizer;\nimport java.io.Writer;\nimport java.io.OutputStreamWriter;\nimport java.io.BufferedReader;\nimport java.io.InputStream;\n\n/**\n * Built using CHelper plug-in\n * Actual solution is at the top\n *\n * @author mikit\n */\npublic class Main {\n public static void main(String[] args) {\n InputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n LightScanner in = new LightScanner(inputStream);\n LightWriter out = new LightWriter(outputStream);\n CIrohasObsession solver = new CIrohasObsession();\n solver.solve(1, in, out);\n out.close();\n }\n\n static class CIrohasObsession {\n public void solve(int testNumber, LightScanner in, LightWriter out) {\n // out.setBoolLabel(LightWriter.BoolLabel.YES_NO_FIRST_UP);\n int n = in.ints();\n int k = in.ints();\n boolean[] d = new boolean[10];\n for (int i = 0; i < k; i++) {\n d[in.ints()] = true;\n }\n\n outer:\n for (int i = n; ; i++) {\n int t = i;\n while (t > 0) {\n if (d[t % 10]) {\n continue outer;\n }\n t /= 10;\n }\n out.ansln(i);\n return;\n }\n }\n\n }\n\n static class LightScanner {\n private BufferedReader reader = null;\n private StringTokenizer tokenizer = null;\n\n public LightScanner(InputStream in) {\n reader = new BufferedReader(new InputStreamReader(in));\n }\n\n public String string() {\n if (tokenizer == null || !tokenizer.hasMoreTokens()) {\n try {\n tokenizer = new StringTokenizer(reader.readLine());\n } catch (IOException e) {\n throw new UncheckedIOException(e);\n }\n }\n return tokenizer.nextToken();\n }\n\n public int ints() {\n return Integer.parseInt(string());\n }\n\n }\n\n static class LightWriter implements AutoCloseable {\n private final Writer out;\n private boolean autoflush = false;\n private boolean breaked = true;\n\n public LightWriter(Writer out) {\n this.out = out;\n }\n\n public LightWriter(OutputStream out) {\n this(new BufferedWriter(new OutputStreamWriter(out, Charset.defaultCharset())));\n }\n\n public LightWriter print(char c) {\n try {\n out.write(c);\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter print(String s) {\n try {\n out.write(s, 0, s.length());\n breaked = false;\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n return this;\n }\n\n public LightWriter ans(String s) {\n if (!breaked) {\n print(' ');\n }\n return print(s);\n }\n\n public LightWriter ans(int i) {\n return ans(Integer.toString(i));\n }\n\n public LightWriter ansln(int... n) {\n for (int n1 : n) {\n ans(n1).ln();\n }\n return this;\n }\n\n public LightWriter ln() {\n print(System.lineSeparator());\n breaked = true;\n if (autoflush) {\n try {\n out.flush();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n return this;\n }\n\n public void close() {\n try {\n out.close();\n } catch (IOException ex) {\n throw new UncheckedIOException(ex);\n }\n }\n\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\n\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\n\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\n\nFind the amount of money that she will hand to the cashier.\n\nConstraints\n\n1 ≦ N < 10000\n\n1 �� K < 10\n\n0 ≦ D_1 < D_2 < … < D_K≦9\n\n\\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nD_1 D_2 … D_K\n\nOutput\n\nPrint the amount of money that Iroha will hand to the cashier.\n\nSample Input 1\n\n1000 8\n1 3 4 5 6 7 8 9\n\nSample Output 1\n\n2000\n\nShe dislikes all digits except 0 and 2.\n\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.\n\nSample Input 2\n\n9999 1\n0\n\nSample Output 2\n\n9999", "sample_input": "1000 8\n1 3 4 5 6 7 8 9\n"}, "reference_outputs": ["2000\n"], "source_document_id": "p04045", "source_text": "Score : 300 points\n\nProblem Statement\n\nIroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\n\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\n\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\n\nFind the amount of money that she will hand to the cashier.\n\nConstraints\n\n1 ≦ N < 10000\n\n1 ≦ K < 10\n\n0 ≦ D_1 < D_2 < … < D_K≦9\n\n\\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nD_1 D_2 … D_K\n\nOutput\n\nPrint the amount of money that Iroha will hand to the cashier.\n\nSample Input 1\n\n1000 8\n1 3 4 5 6 7 8 9\n\nSample Output 1\n\n2000\n\nShe dislikes all digits except 0 and 2.\n\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.\n\nSample Input 2\n\n9999 1\n0\n\nSample Output 2\n\n9999", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4283, "cpu_time_ms": 74, "memory_kb": 22740}, "variant": "high_resource"} +{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Java:s078731536", "group_id": "codeNet:p04048", "input_text": "import java.util.*;\npublic class Main{\npublic static void main(String[] args){\nScanner in=new Scanner(System.in);\nlong n=in.nextLong();\nlong x=in.nextLong();\nlong a,b,ans;\na=x;b=n-x;\nans=a+b;\nif(a next = node[i].dst;\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < next.size(); j++) {\n\t\t\t\tif(!node[next.get(j)].rem) count++;\n\t\t\t}\n\t\t\tif(count >= 2) cantRemove[i] = true;\n\t\t}\n\t\tArrays.fill(min, 2 << 28);\n\t\tArrayDeque

q = new ArrayDeque<>();\n\t\tfor(int i = 0; i < node.length; i++) {\n\t\t\tif(!node[i].rem) {\n\t\t\t\tq.addFirst(new P(i,0));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tint maxP = 0;\n\t\tint maxL = 0;\n\t\twhile(!q.isEmpty()) {\n\t\t\tP p = q.pollLast();\n\t\t\tif(min[p.now] <= p.cost) continue;\n\t\t\tmin[p.now] = p.cost;\n\t\t\tif(maxL < p.cost) {\n\t\t\t\tmaxL = p.cost;\n\t\t\t\tmaxP = p.now;\n\t\t\t}\n\t\t\tfor(int i = 0; i < node[p.now].dst.size(); i++) {\n\t\t\t\tif(!node[node[p.now].dst.get(i)].rem) q.addFirst(new P(node[p.now].dst.get(i),p.cost+1));\n\t\t\t}\n\t\t}\n\t\tArrays.fill(min, 2 << 28);\n\t\tq.addFirst(new P(maxP,0));\n\t\tmaxP = 0;\n\t\tmaxL = 0;\n\t\tint maxLL = 0;\n\t\twhile(!q.isEmpty()) {\n\t\t\tP p = q.pollLast();\n\t\t\tif(min[p.now] <= p.cost) continue;\n\t\t\tmin[p.now] = p.cost;\n\t\t\tif(maxLL < p.cost) {\n\t\t\t\tmaxLL = p.cost;\n\t\t\t\t\n\t\t\t}\n\t\t\tif(maxL < p.cost && !cantRemove[p.now]) {\n\t\t\t\tmaxL = p.cost;\n\t\t\t\tmaxP = p.now;\n\t\t\t}\n\t\t\tfor(int i = 0; i < node[p.now].dst.size(); i++) {\n\t\t\t\tif(!node[node[p.now].dst.get(i)].rem) q.addFirst(new P(node[p.now].dst.get(i),p.cost+1));\n\t\t\t}\n\t\t}\n\t\treturn new Data(maxP,maxLL);\n\t}\n\tstatic class P {\n\t\tint now;\n\t\tint cost;\n\t\tP(int a, int b) {\n\t\t\tnow = a;\n\t\t\tcost = b;\n\t\t}\n\t}\n\tstatic class Data {\n\t\tint maxID;\n\t\tint length; \n\t\tData(int a, int b) {\n\t\t\tmaxID = a;\n\t\t\tlength = b;\n\t\t}\n\t}\n\tstatic class Node {\n\t\tboolean rem = false;\n\t\tArrayList dst = new ArrayList<>();\n\t}\n\t\n\n\n\t\n\tstatic class FastScanner {\n\t private final InputStream in = System.in;\n\t private final byte[] buffer = new byte[1024];\n\t private int ptr = 0;\n\t private int buflen = 0;\n\t private boolean hasNextByte() {\n\t if (ptr < buflen) {\n\t return true;\n\t }else{\n\t ptr = 0;\n\t try {\n\t buflen = in.read(buffer);\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t if (buflen <= 0) {\n\t return false;\n\t }\n\t }\n\t return true;\n\t }\n\t private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n\t private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n\t private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n\t public boolean hasNext() { skipUnprintable(); return hasNextByte();}\n\t public String next() {\n\t if (!hasNext()) throw new NoSuchElementException();\n\t StringBuilder sb = new StringBuilder();\n\t int b = readByte();\n\t while(isPrintableChar(b)) {\n\t sb.appendCodePoint(b);\n\t b = readByte();\n\t }\n\t return sb.toString();\n\t }\n\t public long nextLong() {\n\t if (!hasNext()) throw new NoSuchElementException();\n\t long n = 0;\n\t boolean minus = false;\n\t int b = readByte();\n\t if (b == '-') {\n\t minus = true;\n\t b = readByte();\n\t }\n\t if (b < '0' || '9' < b) {\n\t throw new NumberFormatException();\n\t }\n\t while(true){\n\t if ('0' <= b && b <= '9') {\n\t n *= 10;\n\t n += b - '0';\n\t }else if(b == -1 || !isPrintableChar(b)){\n\t return minus ? -n : n;\n\t }else{\n\t throw new NumberFormatException();\n\t }\n\t b = readByte();\n\t }\n\t }\n\t public int nextInt() {\n\t if (!hasNext()) throw new NoSuchElementException();\n\t int n = 0;\n\t boolean minus = false;\n\t int b = readByte();\n\t if (b == '-') {\n\t minus = true;\n\t b = readByte();\n\t }\n\t if (b < '0' || '9' < b) {\n\t throw new NumberFormatException();\n\t }\n\t while(true){\n\t if ('0' <= b && b <= '9') {\n\t n *= 10;\n\t n += b - '0';\n\t }else if(b == -1 || !isPrintableChar(b)){\n\t return minus ? -n : n;\n\t }else{\n\t throw new NumberFormatException();\n\t }\n\t b = readByte();\n\t }\n\t }\n\t}\n}\n", "language": "Java", "metadata": {"date": 1468721867, "filename_ext": "java", "original_language": "Java8 (OpenJDK 1.8.0)", "problem_description_relpath": "problem_descriptions/p04049.html", "problem_id": "p04049", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04049/input.txt", "sample_output_relpath": "derived/input_output/data/p04049/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04049/Java/s269212029.java", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s269212029", "user_id": "u272319314"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.*;\nimport java.math.*;\nimport java.util.*;\nimport java.util.Map.Entry;\n\n\nclass Main {\n\tstatic Node[] node;\n\tpublic static void main(String[] args) {\t\n\t\t//FastScanner sc = new FastScanner();\n\t\tScanner sc = new Scanner(System.in);\n\t\tint N = sc.nextInt();\n\t\tint K = sc.nextInt();\n\t\tint[] A = new int[N-1];\n\t\tint[] B = new int[N-1];\n\t\tfor(int i = 0; i < N-1; i++) {\n\t\t\tA[i] = sc.nextInt();\n\t\t\tB[i] = sc.nextInt();\n\t\t}\n\t\tnode = new Node[N];\n\t\tfor(int i = 0; i < N; i++) {\n\t\t\tnode[i] = new Node();\n\t\t}\n\t\tfor(int i = 0; i < N-1; i++) {\n\t\t\tnode[A[i] - 1].dst.add(B[i] - 1);\n\t\t\tnode[B[i] - 1].dst.add(A[i] - 1);\n\t\t}\n\t\tint count = 0;\n\t\twhile(true) {\n\t\t\tData tmp = diameter();\n\t\t\tif(tmp.length <= K) break;\n\t\t\tnode[tmp.maxID].rem = true;\n\t\t\tcount++;\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\n \n\tstatic Data diameter() {\n\t\tint[] min = new int[node.length];\n\t\tboolean[] cantRemove = new boolean[node.length];\n\t\tfor(int i = 0; i < node.length; i++) {\n\t\t\tif(node[i].rem) cantRemove[i] = true;\n\t\t\tArrayList next = node[i].dst;\n\t\t\tint count = 0;\n\t\t\tfor(int j = 0; j < next.size(); j++) {\n\t\t\t\tif(!node[next.get(j)].rem) count++;\n\t\t\t}\n\t\t\tif(count >= 2) cantRemove[i] = true;\n\t\t}\n\t\tArrays.fill(min, 2 << 28);\n\t\tArrayDeque

q = new ArrayDeque<>();\n\t\tfor(int i = 0; i < node.length; i++) {\n\t\t\tif(!node[i].rem) {\n\t\t\t\tq.addFirst(new P(i,0));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tint maxP = 0;\n\t\tint maxL = 0;\n\t\twhile(!q.isEmpty()) {\n\t\t\tP p = q.pollLast();\n\t\t\tif(min[p.now] <= p.cost) continue;\n\t\t\tmin[p.now] = p.cost;\n\t\t\tif(maxL < p.cost) {\n\t\t\t\tmaxL = p.cost;\n\t\t\t\tmaxP = p.now;\n\t\t\t}\n\t\t\tfor(int i = 0; i < node[p.now].dst.size(); i++) {\n\t\t\t\tif(!node[node[p.now].dst.get(i)].rem) q.addFirst(new P(node[p.now].dst.get(i),p.cost+1));\n\t\t\t}\n\t\t}\n\t\tArrays.fill(min, 2 << 28);\n\t\tq.addFirst(new P(maxP,0));\n\t\tmaxP = 0;\n\t\tmaxL = 0;\n\t\tint maxLL = 0;\n\t\twhile(!q.isEmpty()) {\n\t\t\tP p = q.pollLast();\n\t\t\tif(min[p.now] <= p.cost) continue;\n\t\t\tmin[p.now] = p.cost;\n\t\t\tif(maxLL < p.cost) {\n\t\t\t\tmaxLL = p.cost;\n\t\t\t\t\n\t\t\t}\n\t\t\tif(maxL < p.cost && !cantRemove[p.now]) {\n\t\t\t\tmaxL = p.cost;\n\t\t\t\tmaxP = p.now;\n\t\t\t}\n\t\t\tfor(int i = 0; i < node[p.now].dst.size(); i++) {\n\t\t\t\tif(!node[node[p.now].dst.get(i)].rem) q.addFirst(new P(node[p.now].dst.get(i),p.cost+1));\n\t\t\t}\n\t\t}\n\t\treturn new Data(maxP,maxLL);\n\t}\n\tstatic class P {\n\t\tint now;\n\t\tint cost;\n\t\tP(int a, int b) {\n\t\t\tnow = a;\n\t\t\tcost = b;\n\t\t}\n\t}\n\tstatic class Data {\n\t\tint maxID;\n\t\tint length; \n\t\tData(int a, int b) {\n\t\t\tmaxID = a;\n\t\t\tlength = b;\n\t\t}\n\t}\n\tstatic class Node {\n\t\tboolean rem = false;\n\t\tArrayList dst = new ArrayList<>();\n\t}\n\t\n\n\n\t\n\tstatic class FastScanner {\n\t private final InputStream in = System.in;\n\t private final byte[] buffer = new byte[1024];\n\t private int ptr = 0;\n\t private int buflen = 0;\n\t private boolean hasNextByte() {\n\t if (ptr < buflen) {\n\t return true;\n\t }else{\n\t ptr = 0;\n\t try {\n\t buflen = in.read(buffer);\n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t if (buflen <= 0) {\n\t return false;\n\t }\n\t }\n\t return true;\n\t }\n\t private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}\n\t private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}\n\t private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}\n\t public boolean hasNext() { skipUnprintable(); return hasNextByte();}\n\t public String next() {\n\t if (!hasNext()) throw new NoSuchElementException();\n\t StringBuilder sb = new StringBuilder();\n\t int b = readByte();\n\t while(isPrintableChar(b)) {\n\t sb.appendCodePoint(b);\n\t b = readByte();\n\t }\n\t return sb.toString();\n\t }\n\t public long nextLong() {\n\t if (!hasNext()) throw new NoSuchElementException();\n\t long n = 0;\n\t boolean minus = false;\n\t int b = readByte();\n\t if (b == '-') {\n\t minus = true;\n\t b = readByte();\n\t }\n\t if (b < '0' || '9' < b) {\n\t throw new NumberFormatException();\n\t }\n\t while(true){\n\t if ('0' <= b && b <= '9') {\n\t n *= 10;\n\t n += b - '0';\n\t }else if(b == -1 || !isPrintableChar(b)){\n\t return minus ? -n : n;\n\t }else{\n\t throw new NumberFormatException();\n\t }\n\t b = readByte();\n\t }\n\t }\n\t public int nextInt() {\n\t if (!hasNext()) throw new NoSuchElementException();\n\t int n = 0;\n\t boolean minus = false;\n\t int b = readByte();\n\t if (b == '-') {\n\t minus = true;\n\t b = readByte();\n\t }\n\t if (b < '0' || '9' < b) {\n\t throw new NumberFormatException();\n\t }\n\t while(true){\n\t if ('0' <= b && b <= '9') {\n\t n *= 10;\n\t n += b - '0';\n\t }else if(b == -1 || !isPrintableChar(b)){\n\t return minus ? -n : n;\n\t }else{\n\t throw new NumberFormatException();\n\t }\n\t b = readByte();\n\t }\n\t }\n\t}\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven an undirected tree, let the distance between vertices u and v be the\nnumber of edges on the simple path from u to v.\nThe diameter of a tree is the maximum among the distances between any two vertices.\nWe will call a tree good if and only if its diameter is at most K.\n\nYou are given an undirected tree with N vertices numbered 1 through N.\nFor each i (1≦i≦N-1), there is an edge connecting vertices A_i and B_i.\n\nYou want to remove zero or more vertices from the tree, so that the resulting tree is good.\nWhen a vertex is removed, all incident edges will also be removed.\nThe resulting graph must be connected.\n\nFind the minimum number of vertices that you need to remove in order to produce a good tree.\n\nConstraints\n\n2≦N≦2000\n\n1≦K≦N-1\n\n1≦A_i≦N, 1≦B_i≦N\n\nThe graph defined by A_i and B_i is a tree.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nA_1 B_1\nA_2 B_2\n:\nA_{N-1} B_{N-1}\n\nOutput\n\nPrint the minimum number of vertices that you need to remove in order to produce a good tree.\n\nSample Input 1\n\n6 2\n1 2\n3 2\n4 2\n1 6\n5 6\n\nSample Output 1\n\n2\n\nThe tree is shown below. Removing vertices 5 and 6 will result in a good tree with the diameter of 2.\n\nSample Input 2\n\n6 5\n1 2\n3 2\n4 2\n1 6\n5 6\n\nSample Output 2\n\n0\n\nSince the given tree is already good, you do not need to remove any vertex.", "sample_input": "6 2\n1 2\n3 2\n4 2\n1 6\n5 6\n"}, "reference_outputs": ["2\n"], "source_document_id": "p04049", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven an undirected tree, let the distance between vertices u and v be the\nnumber of edges on the simple path from u to v.\nThe diameter of a tree is the maximum among the distances between any two vertices.\nWe will call a tree good if and only if its diameter is at most K.\n\nYou are given an undirected tree with N vertices numbered 1 through N.\nFor each i (1≦i≦N-1), there is an edge connecting vertices A_i and B_i.\n\nYou want to remove zero or more vertices from the tree, so that the resulting tree is good.\nWhen a vertex is removed, all incident edges will also be removed.\nThe resulting graph must be connected.\n\nFind the minimum number of vertices that you need to remove in order to produce a good tree.\n\nConstraints\n\n2≦N≦2000\n\n1≦K≦N-1\n\n1≦A_i≦N, 1≦B_i≦N\n\nThe graph defined by A_i and B_i is a tree.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nA_1 B_1\nA_2 B_2\n:\nA_{N-1} B_{N-1}\n\nOutput\n\nPrint the minimum number of vertices that you need to remove in order to produce a good tree.\n\nSample Input 1\n\n6 2\n1 2\n3 2\n4 2\n1 6\n5 6\n\nSample Output 1\n\n2\n\nThe tree is shown below. Removing vertices 5 and 6 will result in a good tree with the diameter of 2.\n\nSample Input 2\n\n6 5\n1 2\n3 2\n4 2\n1 6\n5 6\n\nSample Output 2\n\n0\n\nSince the given tree is already good, you do not need to remove any vertex.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5226, "cpu_time_ms": 1241, "memory_kb": 23632}, "variant": "high_resource"}